diff --git a/.rubocop.yml b/.rubocop.yml
index 833d564b9..c7afc3a72 100644
--- a/.rubocop.yml
+++ b/.rubocop.yml
@@ -45,6 +45,8 @@ Sorbet/TrueSigil:
   Include:
     - "**/*.rb"
     - "**/*.rake"
+  Exclude:
+    - "lib/ruby_lsp/tapioca/server_addon.rb"
 
 Style/CaseEquality:
   Enabled: false
diff --git a/Gemfile b/Gemfile
index 0355afcd1..52a999ee7 100644
--- a/Gemfile
+++ b/Gemfile
@@ -15,6 +15,8 @@ gem "irb"
 gem "rubocop-shopify"
 gem "rubocop-sorbet", ">= 0.4.1"
 gem "rubocop-rspec"
+gem "ruby-lsp", ">= 0.19.1", git: "https://github.com/Shopify/ruby-lsp.git", branch: "ar/shutdown-timestamp"
+gem "ruby-lsp-rails", ">= 0.3.18"
 
 group :deployment, :development do
   gem "rake"
diff --git a/Gemfile.lock b/Gemfile.lock
index 620bb77c3..22abb25e1 100644
--- a/Gemfile.lock
+++ b/Gemfile.lock
@@ -1,3 +1,14 @@
+GIT
+  remote: https://github.com/Shopify/ruby-lsp.git
+  revision: 06602886c19cad7f44101b143bdbba9a5fc40a0d
+  branch: ar/shutdown-timestamp
+  specs:
+    ruby-lsp (0.21.4)
+      language_server-protocol (~> 3.17.0)
+      prism (>= 1.2, < 2.0)
+      rbs (>= 3, < 4)
+      sorbet-runtime (>= 0.5.10782)
+
 GIT
   remote: https://github.com/csfrancis/cityhash.git
   revision: 3cfc7d01f333c01811d5e834f1495eaa29f87c36
@@ -273,6 +284,8 @@ GEM
     rbi (0.2.1)
       prism (~> 1.0)
       sorbet-runtime (>= 0.5.9204)
+    rbs (3.6.1)
+      logger
     rdoc (6.7.0)
       psych (>= 4.0.0)
     redis (5.0.8)
@@ -301,6 +314,8 @@ GEM
       rubocop (~> 1.51)
     rubocop-sorbet (0.8.6)
       rubocop (>= 1)
+    ruby-lsp-rails (0.3.25)
+      ruby-lsp (>= 0.21.2, < 0.22.0)
     ruby-progressbar (1.13.0)
     shopify-money (3.0.0)
     sidekiq (7.3.2)
@@ -385,6 +400,8 @@ DEPENDENCIES
   rubocop-rspec
   rubocop-shopify
   rubocop-sorbet (>= 0.4.1)
+  ruby-lsp (>= 0.19.1)!
+  ruby-lsp-rails (>= 0.3.18)
   shopify-money
   sidekiq
   smart_properties
diff --git a/lib/ruby_lsp/tapioca/addon.rb b/lib/ruby_lsp/tapioca/addon.rb
new file mode 100644
index 000000000..e014cb369
--- /dev/null
+++ b/lib/ruby_lsp/tapioca/addon.rb
@@ -0,0 +1,170 @@
+# typed: strict
+# frozen_string_literal: true
+
+RubyLsp::Addon.depend_on_ruby_lsp!(">= 0.20", "< 0.22")
+
+begin
+  # The Tapioca add-on depends on the Rails add-on to add a runtime component to the runtime server. We can allow the
+  # add-on to work outside of a Rails context in the future, but that may require Tapioca spawning its own runtime
+  # server
+  require "ruby-lsp-rails"
+rescue LoadError
+  return
+end
+
+require "zlib"
+
+module RubyLsp
+  module Tapioca
+    class Addon < ::RubyLsp::Addon
+      extend T::Sig
+
+      GEMFILE_LOCK_SNAPSHOT = "tmp/tapioca/.gemfile_lock_snapshot"
+      GIT_OPERATION_THRESHOLD = 15.0 # seconds
+
+      sig { void }
+      def initialize
+        super
+
+        @global_state = T.let(nil, T.nilable(RubyLsp::GlobalState))
+        @rails_runner_client = T.let(nil, T.nilable(RubyLsp::Rails::RunnerClient))
+        @index = T.let(nil, T.nilable(RubyIndexer::Index))
+        @file_checksums = T.let({}, T::Hash[String, String])
+      end
+
+      sig { override.params(global_state: RubyLsp::GlobalState, outgoing_queue: Thread::Queue).void }
+      def activate(global_state, outgoing_queue)
+        @global_state = global_state
+        # TODO: Uncomment
+        # return unless @global_state.experimental_features
+
+        @index = @global_state.index
+        Thread.new do
+          # Get a handle to the Rails add-on's runtime client. The call to `rails_runner_client` will block this thread
+          # until the server has finished booting, but it will not block the main LSP. This has to happen inside of a
+          # thread
+          addon = T.cast(::RubyLsp::Addon.get("Ruby LSP Rails", ">= 0.3.18", "< 0.4"), ::RubyLsp::Rails::Addon)
+          @rails_runner_client = addon.rails_runner_client
+          outgoing_queue << Notification.window_log_message("Activating Tapioca add-on v#{version}")
+          @rails_runner_client.register_server_addon(File.expand_path("server_addon.rb", __dir__))
+
+          handle_gemfile_changes
+        rescue IncompatibleApiError
+          # The requested version for the Rails add-on no longer matches. We need to upgrade and fix the breaking
+          # changes
+        end
+      end
+
+      sig { override.void }
+      def deactivate
+      end
+
+      sig { override.returns(String) }
+      def name
+        "Tapioca"
+      end
+
+      sig { override.returns(String) }
+      def version
+        "0.1.0"
+      end
+
+      sig { params(changes: T::Array[{ uri: String, type: Integer }]).void }
+      def workspace_did_change_watched_files(changes)
+        # TODO: Uncomment
+        # return unless T.must(@global_state).experimental_features
+        return unless @rails_runner_client # Client is not ready
+
+        constants = changes.flat_map do |change|
+          path = URI(change[:uri]).to_standardized_path
+          next if path.end_with?("_test.rb", "_spec.rb")
+
+          case change[:type]
+          when Constant::FileChangeType::CREATED, Constant::FileChangeType::CHANGED
+            content = File.read(path)
+            current_checksum = Zlib.crc32(content).to_s
+
+            if change[:type] == Constant::FileChangeType::CHANGED && @file_checksums[path] == current_checksum
+              $stderr.puts "File has not changed. Skipping #{path}"
+              next
+            end
+
+            @file_checksums[path] = current_checksum
+          when Constant::FileChangeType::DELETED
+            @file_checksums.delete(path)
+          end
+
+          entries = T.must(@index).entries_for(path)
+          next unless entries
+
+          entries.filter_map do |entry|
+            entry.name if entry.class == RubyIndexer::Entry::Class || entry.class == RubyIndexer::Entry::Module
+          end
+        end.compact
+
+        return if constants.empty?
+
+        @rails_runner_client.trigger_reload
+        @rails_runner_client.delegate_notification(
+          server_addon_name: "Tapioca",
+          request_name: "dsl",
+          constants: constants,
+        )
+      end
+
+      private
+
+      sig { void }
+      def handle_gemfile_changes
+        return unless File.exist?(".git") && File.exist?(".ruby-lsp/shutdown-timestamp")
+
+        git_timestamp = fetch_last_git_operation_time
+        return unless git_timestamp
+
+        ruby_lsp_stop_time = Time.iso8601(File.read(".ruby-lsp/shutdown-timestamp"))
+
+        $stderr.puts("ruby_lsp_stop_time: #{ruby_lsp_stop_time}") # TODO: Remove
+        $stderr.puts("git_timestamp: #{git_timestamp}") # TODO: Remove
+
+        # If the Ruby LSP was stopped shortly after the last git checkout/pull operation, we don't need to regenerate
+        # RBIs since any Gemfile.lock changes were likely from version control, not from running bundle install
+        return if (ruby_lsp_stop_time - git_timestamp) <= GIT_OPERATION_THRESHOLD
+
+        process_gemfile_changes
+      end
+
+      sig { returns(T.nilable(Time)) }
+      def fetch_last_git_operation_time
+        git_reflog_output = %x(git reflog --date=iso | grep -E "checkout|pull" | head -n 1).strip
+        return if git_reflog_output.empty?
+
+        timestamp_string = T.must(git_reflog_output.match(/\{(.*)\}/))[1]
+        Time.iso8601(T.must(timestamp_string).sub(" ", "T").delete(" "))
+      end
+
+      sig { returns(T.nilable(Integer)) }
+      def process_gemfile_changes
+        current_lockfile = File.read("Gemfile.lock")
+        snapshot_lockfile = File.read(GEMFILE_LOCK_SNAPSHOT) if File.exist?(GEMFILE_LOCK_SNAPSHOT)
+
+        unless snapshot_lockfile
+          $stdout.puts("Creating initial Gemfile.lock snapshot at #{GEMFILE_LOCK_SNAPSHOT}")
+          FileUtils.mkdir_p(File.dirname(GEMFILE_LOCK_SNAPSHOT))
+          File.write(GEMFILE_LOCK_SNAPSHOT, current_lockfile)
+          return
+        end
+
+        return if current_lockfile == snapshot_lockfile
+
+        T.must(@rails_runner_client).delegate_notification(
+          server_addon_name: "Tapioca",
+          request_name: "gem",
+          snapshot_lockfile: snapshot_lockfile,
+          current_lockfile: current_lockfile,
+        )
+
+        File.write(GEMFILE_LOCK_SNAPSHOT, current_lockfile)
+      end
+    end
+  end
+end
diff --git a/lib/ruby_lsp/tapioca/server_addon.rb b/lib/ruby_lsp/tapioca/server_addon.rb
new file mode 100644
index 000000000..0a7599df6
--- /dev/null
+++ b/lib/ruby_lsp/tapioca/server_addon.rb
@@ -0,0 +1,58 @@
+# typed: false
+# frozen_string_literal: true
+
+require "tapioca/internal"
+
+module RubyLsp
+  module Tapioca
+    class ServerAddon < ::RubyLsp::Rails::ServerAddon
+      def name
+        "Tapioca"
+      end
+
+      def execute(request, params)
+        case request
+        when "dsl"
+          dsl(params)
+        when "gem"
+          gem(params)
+        end
+      end
+
+      private
+
+      def dsl(params)
+        load("tapioca/cli.rb") # Reload the CLI to reset thor defaults between requests
+        ::Tapioca::Cli.start(["dsl", "--lsp_addon", "--workers=1"] + params[:constants])
+      end
+
+      def gem(params)
+        snapshot_specs = parse_lockfile(params[:snapshot_lockfile])
+        current_specs = parse_lockfile(params[:current_lockfile])
+
+        removed_gems = snapshot_specs.keys - current_specs.keys
+        changed_gems = current_specs.select { |name, version| snapshot_specs[name] != version }.keys
+
+        return $stdout.puts("No gem changes detected") if removed_gems.empty? && changed_gems.empty?
+
+        if removed_gems.any?
+          $stdout.puts("Removing RBIs for deleted gems: #{removed_gems.join(", ")}")
+          FileUtils.rm_f(Dir.glob("sorbet/rbi/gems/{#{removed_gems.join(",")}}@*.rbi"))
+        end
+
+        if changed_gems.any?
+          $stdout.puts("Generating RBIs for changed gems: #{changed_gems.join(", ")}")
+
+          load("tapioca/cli.rb") # Reload the CLI to reset thor defaults between requests
+          ::Tapioca::Cli.start(["gem"] + changed_gems)
+        end
+      end
+
+      def parse_lockfile(content)
+        return {} if content.to_s.empty?
+
+        Bundler::LockfileParser.new(content).specs.to_h { |spec| [spec.name, spec.version.to_s] }
+      end
+    end
+  end
+end
diff --git a/lib/tapioca/cli.rb b/lib/tapioca/cli.rb
index cadddf6c7..b3204a3ef 100644
--- a/lib/tapioca/cli.rb
+++ b/lib/tapioca/cli.rb
@@ -144,6 +144,11 @@ def todo
       type: :hash,
       desc: "Options to pass to the DSL compilers",
       default: {}
+    option :lsp_addon,
+      type: :boolean,
+      desc: "Generate DSL RBIs from the LSP addon. Internal to tapioca and not intended for end-users",
+      default: false,
+      hide: true
     def dsl(*constant_or_paths)
       set_environment(options)
 
@@ -166,6 +171,7 @@ def dsl(*constant_or_paths)
         app_root: options[:app_root],
         halt_upon_load_error: options[:halt_upon_load_error],
         compiler_options: options[:compiler_options],
+        lsp_addon: options[:lsp_addon],
       }
 
       command = if options[:verify]
diff --git a/lib/tapioca/commands/abstract_dsl.rb b/lib/tapioca/commands/abstract_dsl.rb
index 3395afd53..77c03e2c2 100644
--- a/lib/tapioca/commands/abstract_dsl.rb
+++ b/lib/tapioca/commands/abstract_dsl.rb
@@ -28,6 +28,7 @@ class AbstractDsl < CommandWithoutTracker
           app_root: String,
           halt_upon_load_error: T::Boolean,
           compiler_options: T::Hash[String, T.untyped],
+          lsp_addon: T::Boolean,
         ).void
       end
       def initialize(
@@ -47,7 +48,8 @@ def initialize(
         rbi_formatter: DEFAULT_RBI_FORMATTER,
         app_root: ".",
         halt_upon_load_error: true,
-        compiler_options: {}
+        compiler_options: {},
+        lsp_addon: false
       )
         @requested_constants = requested_constants
         @requested_paths = requested_paths
@@ -66,6 +68,7 @@ def initialize(
         @halt_upon_load_error = halt_upon_load_error
         @skip_constant = skip_constant
         @compiler_options = compiler_options
+        @lsp_addon = lsp_addon
 
         super()
       end
@@ -74,6 +77,10 @@ def initialize(
 
       sig { params(outpath: Pathname, quiet: T::Boolean).returns(T::Set[Pathname]) }
       def generate_dsl_rbi_files(outpath, quiet:)
+        if @lsp_addon
+          pipeline.active_compilers.each(&:reset_state)
+        end
+
         existing_rbi_files = existing_rbi_filenames(all_requested_constants)
 
         generated_files = pipeline.run do |constant, contents|
@@ -116,6 +123,7 @@ def load_application
           eager_load: @requested_constants.empty? && @requested_paths.empty?,
           app_root: @app_root,
           halt_upon_load_error: @halt_upon_load_error,
+          lsp_addon: @lsp_addon,
         )
       end
 
@@ -133,6 +141,7 @@ def create_pipeline
           skipped_constants: constantize(@skip_constant, ignore_missing: true),
           number_of_workers: @number_of_workers,
           compiler_options: @compiler_options,
+          lsp_addon: @lsp_addon,
         )
       end
 
diff --git a/lib/tapioca/dsl/compiler.rb b/lib/tapioca/dsl/compiler.rb
index c3e7192f0..897b155d7 100644
--- a/lib/tapioca/dsl/compiler.rb
+++ b/lib/tapioca/dsl/compiler.rb
@@ -51,6 +51,13 @@ def requested_constants=(constants)
           @@requested_constants = constants # rubocop:disable Style/ClassVars
         end
 
+        sig { void }
+        def reset_state
+          @processable_constants = nil
+          @all_classes = nil
+          @all_modules = nil
+        end
+
         private
 
         sig do
diff --git a/lib/tapioca/dsl/pipeline.rb b/lib/tapioca/dsl/pipeline.rb
index a0eaec494..1a9594241 100644
--- a/lib/tapioca/dsl/pipeline.rb
+++ b/lib/tapioca/dsl/pipeline.rb
@@ -34,6 +34,7 @@ class Pipeline
           skipped_constants: T::Array[Module],
           number_of_workers: T.nilable(Integer),
           compiler_options: T::Hash[String, T.untyped],
+          lsp_addon: T::Boolean,
         ).void
       end
       def initialize(
@@ -44,7 +45,8 @@ def initialize(
         error_handler: $stderr.method(:puts).to_proc,
         skipped_constants: [],
         number_of_workers: nil,
-        compiler_options: {}
+        compiler_options: {},
+        lsp_addon: false
       )
         @active_compilers = T.let(
           gather_active_compilers(requested_compilers, excluded_compilers),
@@ -57,6 +59,7 @@ def initialize(
         @number_of_workers = number_of_workers
         @compiler_options = compiler_options
         @errors = T.let([], T::Array[String])
+        @lsp_addon = lsp_addon
       end
 
       sig do
@@ -177,7 +180,7 @@ def filter_anonymous_and_reloaded_constants(constants)
         # Find the constants that have been reloaded
         reloaded_constants = constants_by_name.select { |_, constants| constants.size > 1 }.keys
 
-        unless reloaded_constants.empty?
+        unless reloaded_constants.empty? || @lsp_addon
           reloaded_constant_names = reloaded_constants.map { |name| "`#{name}`" }.join(", ")
 
           $stderr.puts("WARNING: Multiple constants with the same name: #{reloaded_constant_names}")
@@ -222,9 +225,14 @@ def report_error(error)
 
       sig { void }
       def abort_if_pending_migrations!
+        # When running within the add-on, we cannot invoke the abort if pending migrations task because that will exit
+        # the process and crash the Rails runtime server. Instead, the Rails add-on checks for pending migrations and
+        # warns the user, so that they are aware they need to migrate their database
+        return if @lsp_addon
         return unless defined?(::Rake)
 
         Rails.application.load_tasks
+
         if Rake::Task.task_defined?("db:abort_if_pending_migrations")
           Rake::Task["db:abort_if_pending_migrations"].invoke
         end
diff --git a/lib/tapioca/helpers/source_uri.rb b/lib/tapioca/helpers/source_uri.rb
index e2a9726f6..4846829d6 100644
--- a/lib/tapioca/helpers/source_uri.rb
+++ b/lib/tapioca/helpers/source_uri.rb
@@ -25,9 +25,6 @@ class Source < URI::File
     # have the uri gem in their own bundle and thus not use a compatible version.
     PARSER = T.let(const_defined?(:RFC2396_PARSER) ? RFC2396_PARSER : DEFAULT_PARSER, RFC2396_Parser)
 
-    alias_method(:gem_name, :host)
-    alias_method(:line_number, :fragment)
-
     sig { returns(T.nilable(String)) }
     attr_reader :gem_version
 
@@ -54,6 +51,16 @@ def build(gem_name:, gem_version:, path:, line_number:)
       end
     end
 
+    sig { returns(T.nilable(String)) }
+    def gem_name
+      host
+    end
+
+    sig { returns(T.nilable(String)) }
+    def line_number
+      fragment
+    end
+
     sig { params(v: T.nilable(String)).void }
     def set_path(v) # rubocop:disable Naming/AccessorMethodName
       return if v.nil?
diff --git a/lib/tapioca/loaders/dsl.rb b/lib/tapioca/loaders/dsl.rb
index 8635fff29..f874847b9 100644
--- a/lib/tapioca/loaders/dsl.rb
+++ b/lib/tapioca/loaders/dsl.rb
@@ -10,16 +10,27 @@ class << self
         extend T::Sig
 
         sig do
-          params(tapioca_path: String, eager_load: T::Boolean, app_root: String, halt_upon_load_error: T::Boolean).void
+          params(
+            tapioca_path: String,
+            eager_load: T::Boolean,
+            app_root: String,
+            halt_upon_load_error: T::Boolean,
+            lsp_addon: T::Boolean,
+          ).void
         end
-        def load_application(tapioca_path:, eager_load: true, app_root: ".", halt_upon_load_error: true)
+        def load_application(tapioca_path:, eager_load: true, app_root: ".", halt_upon_load_error: true,
+          lsp_addon: false)
           loader = new(
             tapioca_path: tapioca_path,
             eager_load: eager_load,
             app_root: app_root,
             halt_upon_load_error: halt_upon_load_error,
           )
-          loader.load
+          if lsp_addon
+            loader.load_dsl_extensions_and_compilers
+          else
+            loader.load
+          end
         end
       end
 
@@ -30,6 +41,12 @@ def load
         load_dsl_compilers
       end
 
+      sig { void }
+      def load_dsl_extensions_and_compilers
+        load_dsl_extensions
+        load_dsl_compilers
+      end
+
       protected
 
       sig do
diff --git a/sorbet/rbi/gems/prism@1.2.0.rbi b/sorbet/rbi/gems/prism@1.2.0.rbi
index c6c606d9d..24560b1dd 100644
--- a/sorbet/rbi/gems/prism@1.2.0.rbi
+++ b/sorbet/rbi/gems/prism@1.2.0.rbi
@@ -34,7 +34,7 @@ class Parser::Base; end
 # "Parsing Ruby is suddenly manageable!"
 #   - You, hopefully
 #
-# source://prism//lib/prism.rb#8
+# source://prism/lib/prism.rb#8
 module Prism
   class << self
     # Mirror the Prism.dump API by using the serialization API.
@@ -55,7 +55,7 @@ module Prism
     #
     # For supported options, see Prism::parse.
     #
-    # source://prism//lib/prism.rb#45
+    # source://prism/lib/prism.rb#45
     sig { params(source: String, options: T::Hash[Symbol, T.untyped]).returns(Prism::LexCompat::Result) }
     def lex_compat(source, **options); end
 
@@ -69,7 +69,7 @@ module Prism
     # returns the same tokens. Raises SyntaxError if the syntax in source is
     # invalid.
     #
-    # source://prism//lib/prism.rb#55
+    # source://prism/lib/prism.rb#55
     sig { params(source: String).returns(T::Array[T.untyped]) }
     def lex_ripper(source); end
 
@@ -78,7 +78,7 @@ module Prism
     #
     # Load the serialized AST using the source as a reference into a tree.
     #
-    # source://prism//lib/prism.rb#63
+    # source://prism/lib/prism.rb#63
     sig { params(source: String, serialized: String).returns(Prism::ParseResult) }
     def load(source, serialized); end
 
@@ -144,17 +144,17 @@ end
 # eagerly converted to UTF-8, this class will be used as well. This is because
 # at that point we will treat everything as single-byte characters.
 #
-# source://prism//lib/prism/parse_result.rb#236
+# source://prism/lib/prism/parse_result.rb#236
 class Prism::ASCIISource < ::Prism::Source
   # Return the column number in characters for the given byte offset.
   #
-  # source://prism//lib/prism/parse_result.rb#243
+  # source://prism/lib/prism/parse_result.rb#243
   sig { params(byte_offset: Integer).returns(Integer) }
   def character_column(byte_offset); end
 
   # Return the character offset for the given byte offset.
   #
-  # source://prism//lib/prism/parse_result.rb#238
+  # source://prism/lib/prism/parse_result.rb#238
   sig { params(byte_offset: Integer).returns(Integer) }
   def character_offset(byte_offset); end
 
@@ -162,7 +162,7 @@ class Prism::ASCIISource < ::Prism::Source
   # same interface. We can do this because code units are always equivalent to
   # byte offsets for ASCII-only sources.
   #
-  # source://prism//lib/prism/parse_result.rb#260
+  # source://prism/lib/prism/parse_result.rb#260
   sig do
     params(
       encoding: Encoding
@@ -174,7 +174,7 @@ class Prism::ASCIISource < ::Prism::Source
   # `code_units_offset`, which is a more expensive operation. This is
   # essentially the same as `Prism::Source#column`.
   #
-  # source://prism//lib/prism/parse_result.rb#267
+  # source://prism/lib/prism/parse_result.rb#267
   sig { params(byte_offset: Integer, encoding: Encoding).returns(Integer) }
   def code_units_column(byte_offset, encoding); end
 
@@ -185,7 +185,7 @@ class Prism::ASCIISource < ::Prism::Source
   # concept of code units that differs from the number of characters in other
   # encodings, it is not captured here.
   #
-  # source://prism//lib/prism/parse_result.rb#253
+  # source://prism/lib/prism/parse_result.rb#253
   sig { params(byte_offset: Integer, encoding: Encoding).returns(Integer) }
   def code_units_offset(byte_offset, encoding); end
 end
@@ -195,13 +195,13 @@ end
 #     alias $foo $bar
 #     ^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#227
+# source://prism/lib/prism/node.rb#227
 class Prism::AliasGlobalVariableNode < ::Prism::Node
   # Initialize a new AliasGlobalVariableNode node.
   #
   # @return [AliasGlobalVariableNode] a new instance of AliasGlobalVariableNode
   #
-  # source://prism//lib/prism/node.rb#229
+  # source://prism/lib/prism/node.rb#229
   sig do
     params(
       source: Prism::Source,
@@ -218,36 +218,36 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#316
+  # source://prism/lib/prism/node.rb#316
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#240
+  # source://prism/lib/prism/node.rb#240
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#245
+  # source://prism/lib/prism/node.rb#245
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#255
+  # source://prism/lib/prism/node.rb#255
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#250
+  # source://prism/lib/prism/node.rb#250
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?new_name: GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode, ?old_name: GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode | SymbolNode | MissingNode, ?keyword_loc: Location) -> AliasGlobalVariableNode
   #
-  # source://prism//lib/prism/node.rb#260
+  # source://prism/lib/prism/node.rb#260
   sig do
     params(
       node_id: Integer,
@@ -263,13 +263,13 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#245
+  # source://prism/lib/prism/node.rb#245
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, new_name: GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode, old_name: GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode | SymbolNode | MissingNode, keyword_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#268
+  # source://prism/lib/prism/node.rb#268
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -278,13 +278,13 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#300
+  # source://prism/lib/prism/node.rb#300
   sig { override.returns(String) }
   def inspect; end
 
   # def keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#295
+  # source://prism/lib/prism/node.rb#295
   sig { returns(String) }
   def keyword; end
 
@@ -293,7 +293,7 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node
   #     alias $foo $bar
   #     ^^^^^
   #
-  # source://prism//lib/prism/node.rb#288
+  # source://prism/lib/prism/node.rb#288
   sig { returns(Prism::Location) }
   def keyword_loc; end
 
@@ -302,7 +302,7 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node
   #     alias $foo $bar
   #           ^^^^
   #
-  # source://prism//lib/prism/node.rb#276
+  # source://prism/lib/prism/node.rb#276
   sig { returns(T.any(Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)) }
   def new_name; end
 
@@ -311,7 +311,7 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node
   #     alias $foo $bar
   #                ^^^^
   #
-  # source://prism//lib/prism/node.rb#282
+  # source://prism/lib/prism/node.rb#282
   sig do
     returns(T.any(Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::SymbolNode, Prism::MissingNode))
   end
@@ -319,14 +319,14 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#305
+  # source://prism/lib/prism/node.rb#305
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#310
+    # source://prism/lib/prism/node.rb#310
     def type; end
   end
 end
@@ -336,13 +336,13 @@ end
 #     alias foo bar
 #     ^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#328
+# source://prism/lib/prism/node.rb#328
 class Prism::AliasMethodNode < ::Prism::Node
   # Initialize a new AliasMethodNode node.
   #
   # @return [AliasMethodNode] a new instance of AliasMethodNode
   #
-  # source://prism//lib/prism/node.rb#330
+  # source://prism/lib/prism/node.rb#330
   sig do
     params(
       source: Prism::Source,
@@ -359,36 +359,36 @@ class Prism::AliasMethodNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#426
+  # source://prism/lib/prism/node.rb#426
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#341
+  # source://prism/lib/prism/node.rb#341
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#346
+  # source://prism/lib/prism/node.rb#346
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#356
+  # source://prism/lib/prism/node.rb#356
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#351
+  # source://prism/lib/prism/node.rb#351
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?new_name: SymbolNode | InterpolatedSymbolNode, ?old_name: SymbolNode | InterpolatedSymbolNode | GlobalVariableReadNode | MissingNode, ?keyword_loc: Location) -> AliasMethodNode
   #
-  # source://prism//lib/prism/node.rb#361
+  # source://prism/lib/prism/node.rb#361
   sig do
     params(
       node_id: Integer,
@@ -404,13 +404,13 @@ class Prism::AliasMethodNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#346
+  # source://prism/lib/prism/node.rb#346
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, new_name: SymbolNode | InterpolatedSymbolNode, old_name: SymbolNode | InterpolatedSymbolNode | GlobalVariableReadNode | MissingNode, keyword_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#369
+  # source://prism/lib/prism/node.rb#369
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -419,19 +419,19 @@ class Prism::AliasMethodNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#410
+  # source://prism/lib/prism/node.rb#410
   sig { override.returns(String) }
   def inspect; end
 
   # def keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#405
+  # source://prism/lib/prism/node.rb#405
   sig { returns(String) }
   def keyword; end
 
   # attr_reader keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#398
+  # source://prism/lib/prism/node.rb#398
   sig { returns(Prism::Location) }
   def keyword_loc; end
 
@@ -446,7 +446,7 @@ class Prism::AliasMethodNode < ::Prism::Node
   #     alias :"#{foo}" :"#{bar}"
   #           ^^^^^^^^^
   #
-  # source://prism//lib/prism/node.rb#383
+  # source://prism/lib/prism/node.rb#383
   sig { returns(T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode)) }
   def new_name; end
 
@@ -461,7 +461,7 @@ class Prism::AliasMethodNode < ::Prism::Node
   #     alias :"#{foo}" :"#{bar}"
   #                     ^^^^^^^^^
   #
-  # source://prism//lib/prism/node.rb#395
+  # source://prism/lib/prism/node.rb#395
   sig do
     returns(T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode, Prism::GlobalVariableReadNode, Prism::MissingNode))
   end
@@ -469,14 +469,14 @@ class Prism::AliasMethodNode < ::Prism::Node
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#415
+  # source://prism/lib/prism/node.rb#415
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#420
+    # source://prism/lib/prism/node.rb#420
     def type; end
   end
 end
@@ -486,13 +486,13 @@ end
 #     foo => bar | baz
 #            ^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#438
+# source://prism/lib/prism/node.rb#438
 class Prism::AlternationPatternNode < ::Prism::Node
   # Initialize a new AlternationPatternNode node.
   #
   # @return [AlternationPatternNode] a new instance of AlternationPatternNode
   #
-  # source://prism//lib/prism/node.rb#440
+  # source://prism/lib/prism/node.rb#440
   sig do
     params(
       source: Prism::Source,
@@ -509,36 +509,36 @@ class Prism::AlternationPatternNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#527
+  # source://prism/lib/prism/node.rb#527
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#451
+  # source://prism/lib/prism/node.rb#451
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#456
+  # source://prism/lib/prism/node.rb#456
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#466
+  # source://prism/lib/prism/node.rb#466
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#461
+  # source://prism/lib/prism/node.rb#461
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?left: Prism::node, ?right: Prism::node, ?operator_loc: Location) -> AlternationPatternNode
   #
-  # source://prism//lib/prism/node.rb#471
+  # source://prism/lib/prism/node.rb#471
   sig do
     params(
       node_id: Integer,
@@ -554,13 +554,13 @@ class Prism::AlternationPatternNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#456
+  # source://prism/lib/prism/node.rb#456
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, left: Prism::node, right: Prism::node, operator_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#479
+  # source://prism/lib/prism/node.rb#479
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -569,7 +569,7 @@ class Prism::AlternationPatternNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#511
+  # source://prism/lib/prism/node.rb#511
   sig { override.returns(String) }
   def inspect; end
 
@@ -578,13 +578,13 @@ class Prism::AlternationPatternNode < ::Prism::Node
   #     foo => bar | baz
   #            ^^^
   #
-  # source://prism//lib/prism/node.rb#487
+  # source://prism/lib/prism/node.rb#487
   sig { returns(Prism::Node) }
   def left; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#506
+  # source://prism/lib/prism/node.rb#506
   sig { returns(String) }
   def operator; end
 
@@ -593,7 +593,7 @@ class Prism::AlternationPatternNode < ::Prism::Node
   #     foo => bar | baz
   #                ^
   #
-  # source://prism//lib/prism/node.rb#499
+  # source://prism/lib/prism/node.rb#499
   sig { returns(Prism::Location) }
   def operator_loc; end
 
@@ -602,20 +602,20 @@ class Prism::AlternationPatternNode < ::Prism::Node
   #     foo => bar | baz
   #                  ^^^
   #
-  # source://prism//lib/prism/node.rb#493
+  # source://prism/lib/prism/node.rb#493
   sig { returns(Prism::Node) }
   def right; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#516
+  # source://prism/lib/prism/node.rb#516
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#521
+    # source://prism/lib/prism/node.rb#521
     def type; end
   end
 end
@@ -625,13 +625,13 @@ end
 #     left and right
 #     ^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#539
+# source://prism/lib/prism/node.rb#539
 class Prism::AndNode < ::Prism::Node
   # Initialize a new AndNode node.
   #
   # @return [AndNode] a new instance of AndNode
   #
-  # source://prism//lib/prism/node.rb#541
+  # source://prism/lib/prism/node.rb#541
   sig do
     params(
       source: Prism::Source,
@@ -648,36 +648,36 @@ class Prism::AndNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#634
+  # source://prism/lib/prism/node.rb#634
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#552
+  # source://prism/lib/prism/node.rb#552
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#557
+  # source://prism/lib/prism/node.rb#557
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#567
+  # source://prism/lib/prism/node.rb#567
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#562
+  # source://prism/lib/prism/node.rb#562
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?left: Prism::node, ?right: Prism::node, ?operator_loc: Location) -> AndNode
   #
-  # source://prism//lib/prism/node.rb#572
+  # source://prism/lib/prism/node.rb#572
   sig do
     params(
       node_id: Integer,
@@ -693,13 +693,13 @@ class Prism::AndNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#557
+  # source://prism/lib/prism/node.rb#557
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, left: Prism::node, right: Prism::node, operator_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#580
+  # source://prism/lib/prism/node.rb#580
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -708,7 +708,7 @@ class Prism::AndNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#618
+  # source://prism/lib/prism/node.rb#618
   sig { override.returns(String) }
   def inspect; end
 
@@ -720,13 +720,13 @@ class Prism::AndNode < ::Prism::Node
   #     1 && 2
   #     ^
   #
-  # source://prism//lib/prism/node.rb#591
+  # source://prism/lib/prism/node.rb#591
   sig { returns(Prism::Node) }
   def left; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#613
+  # source://prism/lib/prism/node.rb#613
   sig { returns(String) }
   def operator; end
 
@@ -735,7 +735,7 @@ class Prism::AndNode < ::Prism::Node
   #     left and right
   #          ^^^
   #
-  # source://prism//lib/prism/node.rb#606
+  # source://prism/lib/prism/node.rb#606
   sig { returns(Prism::Location) }
   def operator_loc; end
 
@@ -747,20 +747,20 @@ class Prism::AndNode < ::Prism::Node
   #     1 and 2
   #           ^
   #
-  # source://prism//lib/prism/node.rb#600
+  # source://prism/lib/prism/node.rb#600
   sig { returns(Prism::Node) }
   def right; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#623
+  # source://prism/lib/prism/node.rb#623
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#628
+    # source://prism/lib/prism/node.rb#628
     def type; end
   end
 end
@@ -770,13 +770,13 @@ end
 #     return foo, bar, baz
 #            ^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#646
+# source://prism/lib/prism/node.rb#646
 class Prism::ArgumentsNode < ::Prism::Node
   # Initialize a new ArgumentsNode node.
   #
   # @return [ArgumentsNode] a new instance of ArgumentsNode
   #
-  # source://prism//lib/prism/node.rb#648
+  # source://prism/lib/prism/node.rb#648
   sig do
     params(
       source: Prism::Source,
@@ -791,36 +791,36 @@ class Prism::ArgumentsNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#734
+  # source://prism/lib/prism/node.rb#734
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#657
+  # source://prism/lib/prism/node.rb#657
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader arguments: Array[Prism::node]
   #
-  # source://prism//lib/prism/node.rb#715
+  # source://prism/lib/prism/node.rb#715
   sig { returns(T::Array[Prism::Node]) }
   def arguments; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#662
+  # source://prism/lib/prism/node.rb#662
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#672
+  # source://prism/lib/prism/node.rb#672
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#667
+  # source://prism/lib/prism/node.rb#667
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
@@ -828,7 +828,7 @@ class Prism::ArgumentsNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#690
+  # source://prism/lib/prism/node.rb#690
   sig { returns(T::Boolean) }
   def contains_forwarding?; end
 
@@ -836,7 +836,7 @@ class Prism::ArgumentsNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#700
+  # source://prism/lib/prism/node.rb#700
   sig { returns(T::Boolean) }
   def contains_keyword_splat?; end
 
@@ -844,7 +844,7 @@ class Prism::ArgumentsNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#695
+  # source://prism/lib/prism/node.rb#695
   sig { returns(T::Boolean) }
   def contains_keywords?; end
 
@@ -852,7 +852,7 @@ class Prism::ArgumentsNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#710
+  # source://prism/lib/prism/node.rb#710
   sig { returns(T::Boolean) }
   def contains_multiple_splats?; end
 
@@ -860,13 +860,13 @@ class Prism::ArgumentsNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#705
+  # source://prism/lib/prism/node.rb#705
   sig { returns(T::Boolean) }
   def contains_splat?; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?arguments: Array[Prism::node]) -> ArgumentsNode
   #
-  # source://prism//lib/prism/node.rb#677
+  # source://prism/lib/prism/node.rb#677
   sig do
     params(
       node_id: Integer,
@@ -880,13 +880,13 @@ class Prism::ArgumentsNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#662
+  # source://prism/lib/prism/node.rb#662
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, arguments: Array[Prism::node] }
   #
-  # source://prism//lib/prism/node.rb#685
+  # source://prism/lib/prism/node.rb#685
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -895,52 +895,52 @@ class Prism::ArgumentsNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#718
+  # source://prism/lib/prism/node.rb#718
   sig { override.returns(String) }
   def inspect; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#723
+  # source://prism/lib/prism/node.rb#723
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#728
+    # source://prism/lib/prism/node.rb#728
     def type; end
   end
 end
 
 # Flags for arguments nodes.
 #
-# source://prism//lib/prism/node.rb#16684
+# source://prism/lib/prism/node.rb#16684
 module Prism::ArgumentsNodeFlags; end
 
 # if the arguments contain forwarding
 #
-# source://prism//lib/prism/node.rb#16686
+# source://prism/lib/prism/node.rb#16686
 Prism::ArgumentsNodeFlags::CONTAINS_FORWARDING = T.let(T.unsafe(nil), Integer)
 
 # if the arguments contain keywords
 #
-# source://prism//lib/prism/node.rb#16689
+# source://prism/lib/prism/node.rb#16689
 Prism::ArgumentsNodeFlags::CONTAINS_KEYWORDS = T.let(T.unsafe(nil), Integer)
 
 # if the arguments contain a keyword splat
 #
-# source://prism//lib/prism/node.rb#16692
+# source://prism/lib/prism/node.rb#16692
 Prism::ArgumentsNodeFlags::CONTAINS_KEYWORD_SPLAT = T.let(T.unsafe(nil), Integer)
 
 # if the arguments contain multiple splats
 #
-# source://prism//lib/prism/node.rb#16698
+# source://prism/lib/prism/node.rb#16698
 Prism::ArgumentsNodeFlags::CONTAINS_MULTIPLE_SPLATS = T.let(T.unsafe(nil), Integer)
 
 # if the arguments contain a splat
 #
-# source://prism//lib/prism/node.rb#16695
+# source://prism/lib/prism/node.rb#16695
 Prism::ArgumentsNodeFlags::CONTAINS_SPLAT = T.let(T.unsafe(nil), Integer)
 
 # Represents an array literal. This can be a regular array using brackets or a special array using % like %w or %i.
@@ -948,13 +948,13 @@ Prism::ArgumentsNodeFlags::CONTAINS_SPLAT = T.let(T.unsafe(nil), Integer)
 #     [1, 2, 3]
 #     ^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#746
+# source://prism/lib/prism/node.rb#746
 class Prism::ArrayNode < ::Prism::Node
   # Initialize a new ArrayNode node.
   #
   # @return [ArrayNode] a new instance of ArrayNode
   #
-  # source://prism//lib/prism/node.rb#748
+  # source://prism/lib/prism/node.rb#748
   sig do
     params(
       source: Prism::Source,
@@ -971,24 +971,24 @@ class Prism::ArrayNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#862
+  # source://prism/lib/prism/node.rb#862
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#759
+  # source://prism/lib/prism/node.rb#759
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#764
+  # source://prism/lib/prism/node.rb#764
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String?
   #
-  # source://prism//lib/prism/node.rb#841
+  # source://prism/lib/prism/node.rb#841
   sig { returns(T.nilable(String)) }
   def closing; end
 
@@ -999,19 +999,19 @@ class Prism::ArrayNode < ::Prism::Node
   #     %I(apple orange banana) # ")"
   #     foo = 1, 2, 3           # nil
   #
-  # source://prism//lib/prism/node.rb#823
+  # source://prism/lib/prism/node.rb#823
   sig { returns(T.nilable(Prism::Location)) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#774
+  # source://prism/lib/prism/node.rb#774
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#769
+  # source://prism/lib/prism/node.rb#769
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
@@ -1019,13 +1019,13 @@ class Prism::ArrayNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#792
+  # source://prism/lib/prism/node.rb#792
   sig { returns(T::Boolean) }
   def contains_splat?; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?elements: Array[Prism::node], ?opening_loc: Location?, ?closing_loc: Location?) -> ArrayNode
   #
-  # source://prism//lib/prism/node.rb#779
+  # source://prism/lib/prism/node.rb#779
   sig do
     params(
       node_id: Integer,
@@ -1041,19 +1041,19 @@ class Prism::ArrayNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#764
+  # source://prism/lib/prism/node.rb#764
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, elements: Array[Prism::node], opening_loc: Location?, closing_loc: Location? }
   #
-  # source://prism//lib/prism/node.rb#787
+  # source://prism/lib/prism/node.rb#787
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # Represent the list of zero or more [non-void expressions](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression) within the array.
   #
-  # source://prism//lib/prism/node.rb#797
+  # source://prism/lib/prism/node.rb#797
   sig { returns(T::Array[Prism::Node]) }
   def elements; end
 
@@ -1062,13 +1062,13 @@ class Prism::ArrayNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#846
+  # source://prism/lib/prism/node.rb#846
   sig { override.returns(String) }
   def inspect; end
 
   # def opening: () -> String?
   #
-  # source://prism//lib/prism/node.rb#836
+  # source://prism/lib/prism/node.rb#836
   sig { returns(T.nilable(String)) }
   def opening; end
 
@@ -1079,32 +1079,32 @@ class Prism::ArrayNode < ::Prism::Node
   #     %I(apple orange banana) # "%I("
   #     foo = 1, 2, 3           # nil
   #
-  # source://prism//lib/prism/node.rb#805
+  # source://prism/lib/prism/node.rb#805
   sig { returns(T.nilable(Prism::Location)) }
   def opening_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#851
+  # source://prism/lib/prism/node.rb#851
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#856
+    # source://prism/lib/prism/node.rb#856
     def type; end
   end
 end
 
 # Flags for array nodes.
 #
-# source://prism//lib/prism/node.rb#16702
+# source://prism/lib/prism/node.rb#16702
 module Prism::ArrayNodeFlags; end
 
 # if array contains splat nodes
 #
-# source://prism//lib/prism/node.rb#16704
+# source://prism/lib/prism/node.rb#16704
 Prism::ArrayNodeFlags::CONTAINS_SPLAT = T.let(T.unsafe(nil), Integer)
 
 # Represents an array pattern in pattern matching.
@@ -1124,13 +1124,13 @@ Prism::ArrayNodeFlags::CONTAINS_SPLAT = T.let(T.unsafe(nil), Integer)
 #     foo in Bar[1, 2, 3]
 #     ^^^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#888
+# source://prism/lib/prism/node.rb#888
 class Prism::ArrayPatternNode < ::Prism::Node
   # Initialize a new ArrayPatternNode node.
   #
   # @return [ArrayPatternNode] a new instance of ArrayPatternNode
   #
-  # source://prism//lib/prism/node.rb#890
+  # source://prism/lib/prism/node.rb#890
   sig do
     params(
       source: Prism::Source,
@@ -1150,54 +1150,54 @@ class Prism::ArrayPatternNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#1006
+  # source://prism/lib/prism/node.rb#1006
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#904
+  # source://prism/lib/prism/node.rb#904
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#909
+  # source://prism/lib/prism/node.rb#909
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String?
   #
-  # source://prism//lib/prism/node.rb#985
+  # source://prism/lib/prism/node.rb#985
   sig { returns(T.nilable(String)) }
   def closing; end
 
   # attr_reader closing_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#967
+  # source://prism/lib/prism/node.rb#967
   sig { returns(T.nilable(Prism::Location)) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#924
+  # source://prism/lib/prism/node.rb#924
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#914
+  # source://prism/lib/prism/node.rb#914
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # attr_reader constant: ConstantReadNode | ConstantPathNode | nil
   #
-  # source://prism//lib/prism/node.rb#942
+  # source://prism/lib/prism/node.rb#942
   sig { returns(T.nilable(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode))) }
   def constant; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?constant: ConstantReadNode | ConstantPathNode | nil, ?requireds: Array[Prism::node], ?rest: Prism::node?, ?posts: Array[Prism::node], ?opening_loc: Location?, ?closing_loc: Location?) -> ArrayPatternNode
   #
-  # source://prism//lib/prism/node.rb#929
+  # source://prism/lib/prism/node.rb#929
   sig do
     params(
       node_id: Integer,
@@ -1216,13 +1216,13 @@ class Prism::ArrayPatternNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#909
+  # source://prism/lib/prism/node.rb#909
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, constant: ConstantReadNode | ConstantPathNode | nil, requireds: Array[Prism::node], rest: Prism::node?, posts: Array[Prism::node], opening_loc: Location?, closing_loc: Location? }
   #
-  # source://prism//lib/prism/node.rb#937
+  # source://prism/lib/prism/node.rb#937
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -1231,50 +1231,50 @@ class Prism::ArrayPatternNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#990
+  # source://prism/lib/prism/node.rb#990
   sig { override.returns(String) }
   def inspect; end
 
   # def opening: () -> String?
   #
-  # source://prism//lib/prism/node.rb#980
+  # source://prism/lib/prism/node.rb#980
   sig { returns(T.nilable(String)) }
   def opening; end
 
   # attr_reader opening_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#954
+  # source://prism/lib/prism/node.rb#954
   sig { returns(T.nilable(Prism::Location)) }
   def opening_loc; end
 
   # attr_reader posts: Array[Prism::node]
   #
-  # source://prism//lib/prism/node.rb#951
+  # source://prism/lib/prism/node.rb#951
   sig { returns(T::Array[Prism::Node]) }
   def posts; end
 
   # attr_reader requireds: Array[Prism::node]
   #
-  # source://prism//lib/prism/node.rb#945
+  # source://prism/lib/prism/node.rb#945
   sig { returns(T::Array[Prism::Node]) }
   def requireds; end
 
   # attr_reader rest: Prism::node?
   #
-  # source://prism//lib/prism/node.rb#948
+  # source://prism/lib/prism/node.rb#948
   sig { returns(T.nilable(Prism::Node)) }
   def rest; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#995
+  # source://prism/lib/prism/node.rb#995
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#1000
+    # source://prism/lib/prism/node.rb#1000
     def type; end
   end
 end
@@ -1284,13 +1284,13 @@ end
 #     { a => b }
 #       ^^^^^^
 #
-# source://prism//lib/prism/node.rb#1023
+# source://prism/lib/prism/node.rb#1023
 class Prism::AssocNode < ::Prism::Node
   # Initialize a new AssocNode node.
   #
   # @return [AssocNode] a new instance of AssocNode
   #
-  # source://prism//lib/prism/node.rb#1025
+  # source://prism/lib/prism/node.rb#1025
   sig do
     params(
       source: Prism::Source,
@@ -1307,36 +1307,36 @@ class Prism::AssocNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#1127
+  # source://prism/lib/prism/node.rb#1127
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#1036
+  # source://prism/lib/prism/node.rb#1036
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1041
+  # source://prism/lib/prism/node.rb#1041
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#1051
+  # source://prism/lib/prism/node.rb#1051
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#1046
+  # source://prism/lib/prism/node.rb#1046
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?key: Prism::node, ?value: Prism::node, ?operator_loc: Location?) -> AssocNode
   #
-  # source://prism//lib/prism/node.rb#1056
+  # source://prism/lib/prism/node.rb#1056
   sig do
     params(
       node_id: Integer,
@@ -1352,13 +1352,13 @@ class Prism::AssocNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1041
+  # source://prism/lib/prism/node.rb#1041
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, key: Prism::node, value: Prism::node, operator_loc: Location? }
   #
-  # source://prism//lib/prism/node.rb#1064
+  # source://prism/lib/prism/node.rb#1064
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -1367,7 +1367,7 @@ class Prism::AssocNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#1111
+  # source://prism/lib/prism/node.rb#1111
   sig { override.returns(String) }
   def inspect; end
 
@@ -1382,13 +1382,13 @@ class Prism::AssocNode < ::Prism::Node
   #     { def a; end => 1 }
   #       ^^^^^^^^^^
   #
-  # source://prism//lib/prism/node.rb#1078
+  # source://prism/lib/prism/node.rb#1078
   sig { returns(Prism::Node) }
   def key; end
 
   # def operator: () -> String?
   #
-  # source://prism//lib/prism/node.rb#1106
+  # source://prism/lib/prism/node.rb#1106
   sig { returns(T.nilable(String)) }
   def operator; end
 
@@ -1397,13 +1397,13 @@ class Prism::AssocNode < ::Prism::Node
   #     { foo => bar }
   #           ^^
   #
-  # source://prism//lib/prism/node.rb#1093
+  # source://prism/lib/prism/node.rb#1093
   sig { returns(T.nilable(Prism::Location)) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#1116
+  # source://prism/lib/prism/node.rb#1116
   sig { override.returns(Symbol) }
   def type; end
 
@@ -1415,14 +1415,14 @@ class Prism::AssocNode < ::Prism::Node
   #     { x: 1 }
   #          ^
   #
-  # source://prism//lib/prism/node.rb#1087
+  # source://prism/lib/prism/node.rb#1087
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#1121
+    # source://prism/lib/prism/node.rb#1121
     def type; end
   end
 end
@@ -1432,13 +1432,13 @@ end
 #     { **foo }
 #       ^^^^^
 #
-# source://prism//lib/prism/node.rb#1139
+# source://prism/lib/prism/node.rb#1139
 class Prism::AssocSplatNode < ::Prism::Node
   # Initialize a new AssocSplatNode node.
   #
   # @return [AssocSplatNode] a new instance of AssocSplatNode
   #
-  # source://prism//lib/prism/node.rb#1141
+  # source://prism/lib/prism/node.rb#1141
   sig do
     params(
       source: Prism::Source,
@@ -1454,36 +1454,36 @@ class Prism::AssocSplatNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#1223
+  # source://prism/lib/prism/node.rb#1223
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#1151
+  # source://prism/lib/prism/node.rb#1151
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1156
+  # source://prism/lib/prism/node.rb#1156
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#1168
+  # source://prism/lib/prism/node.rb#1168
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#1161
+  # source://prism/lib/prism/node.rb#1161
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: Prism::node?, ?operator_loc: Location) -> AssocSplatNode
   #
-  # source://prism//lib/prism/node.rb#1173
+  # source://prism/lib/prism/node.rb#1173
   sig do
     params(
       node_id: Integer,
@@ -1498,13 +1498,13 @@ class Prism::AssocSplatNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1156
+  # source://prism/lib/prism/node.rb#1156
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: Prism::node?, operator_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#1181
+  # source://prism/lib/prism/node.rb#1181
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -1513,13 +1513,13 @@ class Prism::AssocSplatNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#1207
+  # source://prism/lib/prism/node.rb#1207
   sig { override.returns(String) }
   def inspect; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#1202
+  # source://prism/lib/prism/node.rb#1202
   sig { returns(String) }
   def operator; end
 
@@ -1528,13 +1528,13 @@ class Prism::AssocSplatNode < ::Prism::Node
   #     { **x }
   #       ^^
   #
-  # source://prism//lib/prism/node.rb#1195
+  # source://prism/lib/prism/node.rb#1195
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#1212
+  # source://prism/lib/prism/node.rb#1212
   sig { override.returns(Symbol) }
   def type; end
 
@@ -1543,21 +1543,21 @@ class Prism::AssocSplatNode < ::Prism::Node
   #     { **foo }
   #         ^^^
   #
-  # source://prism//lib/prism/node.rb#1189
+  # source://prism/lib/prism/node.rb#1189
   sig { returns(T.nilable(Prism::Node)) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#1217
+    # source://prism/lib/prism/node.rb#1217
     def type; end
   end
 end
 
 # The FFI backend is used on other Ruby implementations.
 #
-# source://prism//lib/prism.rb#81
+# source://prism/lib/prism.rb#81
 Prism::BACKEND = T.let(T.unsafe(nil), Symbol)
 
 # Represents reading a reference to a field in the previous match.
@@ -1565,49 +1565,49 @@ Prism::BACKEND = T.let(T.unsafe(nil), Symbol)
 #     $'
 #     ^^
 #
-# source://prism//lib/prism/node.rb#1234
+# source://prism/lib/prism/node.rb#1234
 class Prism::BackReferenceReadNode < ::Prism::Node
   # Initialize a new BackReferenceReadNode node.
   #
   # @return [BackReferenceReadNode] a new instance of BackReferenceReadNode
   #
-  # source://prism//lib/prism/node.rb#1236
+  # source://prism/lib/prism/node.rb#1236
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
   def initialize(source, node_id, location, flags, name); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#1301
+  # source://prism/lib/prism/node.rb#1301
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#1245
+  # source://prism/lib/prism/node.rb#1245
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1250
+  # source://prism/lib/prism/node.rb#1250
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#1260
+  # source://prism/lib/prism/node.rb#1260
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#1255
+  # source://prism/lib/prism/node.rb#1255
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> BackReferenceReadNode
   #
-  # source://prism//lib/prism/node.rb#1265
+  # source://prism/lib/prism/node.rb#1265
   sig do
     params(
       node_id: Integer,
@@ -1621,13 +1621,13 @@ class Prism::BackReferenceReadNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1250
+  # source://prism/lib/prism/node.rb#1250
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
   #
-  # source://prism//lib/prism/node.rb#1273
+  # source://prism/lib/prism/node.rb#1273
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -1636,7 +1636,7 @@ class Prism::BackReferenceReadNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#1285
+  # source://prism/lib/prism/node.rb#1285
   sig { override.returns(String) }
   def inspect; end
 
@@ -1646,20 +1646,20 @@ class Prism::BackReferenceReadNode < ::Prism::Node
   #
   #     $+ # name `:$+`
   #
-  # source://prism//lib/prism/node.rb#1282
+  # source://prism/lib/prism/node.rb#1282
   sig { returns(Symbol) }
   def name; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#1290
+  # source://prism/lib/prism/node.rb#1290
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#1295
+    # source://prism/lib/prism/node.rb#1295
     def type; end
   end
 end
@@ -1669,24 +1669,24 @@ end
 # implement each one that they need. For a default implementation that
 # continues walking the tree, see the Visitor class.
 #
-# source://prism//lib/prism/visitor.rb#14
+# source://prism/lib/prism/visitor.rb#14
 class Prism::BasicVisitor
   # Calls `accept` on the given node if it is not `nil`, which in turn should
   # call back into this visitor by calling the appropriate `visit_*` method.
   #
-  # source://prism//lib/prism/visitor.rb#17
+  # source://prism/lib/prism/visitor.rb#17
   sig { params(node: T.nilable(Prism::Node)).void }
   def visit(node); end
 
   # Visits each node in `nodes` by calling `accept` on each one.
   #
-  # source://prism//lib/prism/visitor.rb#23
+  # source://prism/lib/prism/visitor.rb#23
   sig { params(nodes: T::Array[T.nilable(Prism::Node)]).void }
   def visit_all(nodes); end
 
   # Visits the child nodes of `node` by calling `accept` on each one.
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::Node).void }
   def visit_child_nodes(node); end
 end
@@ -1698,13 +1698,13 @@ end
 #     end
 #     ^^^^^
 #
-# source://prism//lib/prism/node.rb#1313
+# source://prism/lib/prism/node.rb#1313
 class Prism::BeginNode < ::Prism::Node
   # Initialize a new BeginNode node.
   #
   # @return [BeginNode] a new instance of BeginNode
   #
-  # source://prism//lib/prism/node.rb#1315
+  # source://prism/lib/prism/node.rb#1315
   sig do
     params(
       source: Prism::Source,
@@ -1724,48 +1724,48 @@ class Prism::BeginNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#1431
+  # source://prism/lib/prism/node.rb#1431
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#1329
+  # source://prism/lib/prism/node.rb#1329
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def begin_keyword: () -> String?
   #
-  # source://prism//lib/prism/node.rb#1405
+  # source://prism/lib/prism/node.rb#1405
   sig { returns(T.nilable(String)) }
   def begin_keyword; end
 
   # attr_reader begin_keyword_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#1367
+  # source://prism/lib/prism/node.rb#1367
   sig { returns(T.nilable(Prism::Location)) }
   def begin_keyword_loc; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1334
+  # source://prism/lib/prism/node.rb#1334
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#1349
+  # source://prism/lib/prism/node.rb#1349
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#1339
+  # source://prism/lib/prism/node.rb#1339
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?begin_keyword_loc: Location?, ?statements: StatementsNode?, ?rescue_clause: RescueNode?, ?else_clause: ElseNode?, ?ensure_clause: EnsureNode?, ?end_keyword_loc: Location?) -> BeginNode
   #
-  # source://prism//lib/prism/node.rb#1354
+  # source://prism/lib/prism/node.rb#1354
   sig do
     params(
       node_id: Integer,
@@ -1784,37 +1784,37 @@ class Prism::BeginNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1334
+  # source://prism/lib/prism/node.rb#1334
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, begin_keyword_loc: Location?, statements: StatementsNode?, rescue_clause: RescueNode?, else_clause: ElseNode?, ensure_clause: EnsureNode?, end_keyword_loc: Location? }
   #
-  # source://prism//lib/prism/node.rb#1362
+  # source://prism/lib/prism/node.rb#1362
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # attr_reader else_clause: ElseNode?
   #
-  # source://prism//lib/prism/node.rb#1386
+  # source://prism/lib/prism/node.rb#1386
   sig { returns(T.nilable(Prism::ElseNode)) }
   def else_clause; end
 
   # def end_keyword: () -> String?
   #
-  # source://prism//lib/prism/node.rb#1410
+  # source://prism/lib/prism/node.rb#1410
   sig { returns(T.nilable(String)) }
   def end_keyword; end
 
   # attr_reader end_keyword_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#1392
+  # source://prism/lib/prism/node.rb#1392
   sig { returns(T.nilable(Prism::Location)) }
   def end_keyword_loc; end
 
   # attr_reader ensure_clause: EnsureNode?
   #
-  # source://prism//lib/prism/node.rb#1389
+  # source://prism/lib/prism/node.rb#1389
   sig { returns(T.nilable(Prism::EnsureNode)) }
   def ensure_clause; end
 
@@ -1823,35 +1823,35 @@ class Prism::BeginNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#1415
+  # source://prism/lib/prism/node.rb#1415
   sig { override.returns(String) }
   def inspect; end
 
-  # source://prism//lib/prism/parse_result/newlines.rb#79
+  # source://prism/lib/prism/parse_result/newlines.rb#79
   def newline_flag!(lines); end
 
   # attr_reader rescue_clause: RescueNode?
   #
-  # source://prism//lib/prism/node.rb#1383
+  # source://prism/lib/prism/node.rb#1383
   sig { returns(T.nilable(Prism::RescueNode)) }
   def rescue_clause; end
 
   # attr_reader statements: StatementsNode?
   #
-  # source://prism//lib/prism/node.rb#1380
+  # source://prism/lib/prism/node.rb#1380
   sig { returns(T.nilable(Prism::StatementsNode)) }
   def statements; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#1420
+  # source://prism/lib/prism/node.rb#1420
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#1425
+    # source://prism/lib/prism/node.rb#1425
     def type; end
   end
 end
@@ -1861,13 +1861,13 @@ end
 #     bar(&args)
 #     ^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#1446
+# source://prism/lib/prism/node.rb#1446
 class Prism::BlockArgumentNode < ::Prism::Node
   # Initialize a new BlockArgumentNode node.
   #
   # @return [BlockArgumentNode] a new instance of BlockArgumentNode
   #
-  # source://prism//lib/prism/node.rb#1448
+  # source://prism/lib/prism/node.rb#1448
   sig do
     params(
       source: Prism::Source,
@@ -1883,36 +1883,36 @@ class Prism::BlockArgumentNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#1524
+  # source://prism/lib/prism/node.rb#1524
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#1458
+  # source://prism/lib/prism/node.rb#1458
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1463
+  # source://prism/lib/prism/node.rb#1463
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#1475
+  # source://prism/lib/prism/node.rb#1475
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#1468
+  # source://prism/lib/prism/node.rb#1468
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?expression: Prism::node?, ?operator_loc: Location) -> BlockArgumentNode
   #
-  # source://prism//lib/prism/node.rb#1480
+  # source://prism/lib/prism/node.rb#1480
   sig do
     params(
       node_id: Integer,
@@ -1927,19 +1927,19 @@ class Prism::BlockArgumentNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1463
+  # source://prism/lib/prism/node.rb#1463
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, expression: Prism::node?, operator_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#1488
+  # source://prism/lib/prism/node.rb#1488
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # attr_reader expression: Prism::node?
   #
-  # source://prism//lib/prism/node.rb#1493
+  # source://prism/lib/prism/node.rb#1493
   sig { returns(T.nilable(Prism::Node)) }
   def expression; end
 
@@ -1948,32 +1948,32 @@ class Prism::BlockArgumentNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#1508
+  # source://prism/lib/prism/node.rb#1508
   sig { override.returns(String) }
   def inspect; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#1503
+  # source://prism/lib/prism/node.rb#1503
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#1496
+  # source://prism/lib/prism/node.rb#1496
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#1513
+  # source://prism/lib/prism/node.rb#1513
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#1518
+    # source://prism/lib/prism/node.rb#1518
     def type; end
   end
 end
@@ -1983,49 +1983,49 @@ end
 #     a { |; b| }
 #            ^
 #
-# source://prism//lib/prism/node.rb#1535
+# source://prism/lib/prism/node.rb#1535
 class Prism::BlockLocalVariableNode < ::Prism::Node
   # Initialize a new BlockLocalVariableNode node.
   #
   # @return [BlockLocalVariableNode] a new instance of BlockLocalVariableNode
   #
-  # source://prism//lib/prism/node.rb#1537
+  # source://prism/lib/prism/node.rb#1537
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
   def initialize(source, node_id, location, flags, name); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#1603
+  # source://prism/lib/prism/node.rb#1603
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#1546
+  # source://prism/lib/prism/node.rb#1546
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1551
+  # source://prism/lib/prism/node.rb#1551
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#1561
+  # source://prism/lib/prism/node.rb#1561
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#1556
+  # source://prism/lib/prism/node.rb#1556
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> BlockLocalVariableNode
   #
-  # source://prism//lib/prism/node.rb#1566
+  # source://prism/lib/prism/node.rb#1566
   sig do
     params(
       node_id: Integer,
@@ -2039,13 +2039,13 @@ class Prism::BlockLocalVariableNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1551
+  # source://prism/lib/prism/node.rb#1551
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
   #
-  # source://prism//lib/prism/node.rb#1574
+  # source://prism/lib/prism/node.rb#1574
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -2054,13 +2054,13 @@ class Prism::BlockLocalVariableNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#1587
+  # source://prism/lib/prism/node.rb#1587
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#1584
+  # source://prism/lib/prism/node.rb#1584
   sig { returns(Symbol) }
   def name; end
 
@@ -2068,20 +2068,20 @@ class Prism::BlockLocalVariableNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#1579
+  # source://prism/lib/prism/node.rb#1579
   sig { returns(T::Boolean) }
   def repeated_parameter?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#1592
+  # source://prism/lib/prism/node.rb#1592
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#1597
+    # source://prism/lib/prism/node.rb#1597
     def type; end
   end
 end
@@ -2091,13 +2091,13 @@ end
 #     [1, 2, 3].each { |i| puts x }
 #                    ^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#1614
+# source://prism/lib/prism/node.rb#1614
 class Prism::BlockNode < ::Prism::Node
   # Initialize a new BlockNode node.
   #
   # @return [BlockNode] a new instance of BlockNode
   #
-  # source://prism//lib/prism/node.rb#1616
+  # source://prism/lib/prism/node.rb#1616
   sig do
     params(
       source: Prism::Source,
@@ -2116,54 +2116,54 @@ class Prism::BlockNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#1714
+  # source://prism/lib/prism/node.rb#1714
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#1629
+  # source://prism/lib/prism/node.rb#1629
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader body: StatementsNode | BeginNode | nil
   #
-  # source://prism//lib/prism/node.rb#1671
+  # source://prism/lib/prism/node.rb#1671
   sig { returns(T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))) }
   def body; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1634
+  # source://prism/lib/prism/node.rb#1634
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String
   #
-  # source://prism//lib/prism/node.rb#1693
+  # source://prism/lib/prism/node.rb#1693
   sig { returns(String) }
   def closing; end
 
   # attr_reader closing_loc: Location
   #
-  # source://prism//lib/prism/node.rb#1681
+  # source://prism/lib/prism/node.rb#1681
   sig { returns(Prism::Location) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#1647
+  # source://prism/lib/prism/node.rb#1647
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#1639
+  # source://prism/lib/prism/node.rb#1639
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?locals: Array[Symbol], ?parameters: BlockParametersNode | NumberedParametersNode | ItParametersNode | nil, ?body: StatementsNode | BeginNode | nil, ?opening_loc: Location, ?closing_loc: Location) -> BlockNode
   #
-  # source://prism//lib/prism/node.rb#1652
+  # source://prism/lib/prism/node.rb#1652
   sig do
     params(
       node_id: Integer,
@@ -2181,13 +2181,13 @@ class Prism::BlockNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1634
+  # source://prism/lib/prism/node.rb#1634
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, locals: Array[Symbol], parameters: BlockParametersNode | NumberedParametersNode | ItParametersNode | nil, body: StatementsNode | BeginNode | nil, opening_loc: Location, closing_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#1660
+  # source://prism/lib/prism/node.rb#1660
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -2196,44 +2196,44 @@ class Prism::BlockNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#1698
+  # source://prism/lib/prism/node.rb#1698
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader locals: Array[Symbol]
   #
-  # source://prism//lib/prism/node.rb#1665
+  # source://prism/lib/prism/node.rb#1665
   sig { returns(T::Array[Symbol]) }
   def locals; end
 
   # def opening: () -> String
   #
-  # source://prism//lib/prism/node.rb#1688
+  # source://prism/lib/prism/node.rb#1688
   sig { returns(String) }
   def opening; end
 
   # attr_reader opening_loc: Location
   #
-  # source://prism//lib/prism/node.rb#1674
+  # source://prism/lib/prism/node.rb#1674
   sig { returns(Prism::Location) }
   def opening_loc; end
 
   # attr_reader parameters: BlockParametersNode | NumberedParametersNode | ItParametersNode | nil
   #
-  # source://prism//lib/prism/node.rb#1668
+  # source://prism/lib/prism/node.rb#1668
   sig { returns(T.nilable(T.any(Prism::BlockParametersNode, Prism::NumberedParametersNode, Prism::ItParametersNode))) }
   def parameters; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#1703
+  # source://prism/lib/prism/node.rb#1703
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#1708
+    # source://prism/lib/prism/node.rb#1708
     def type; end
   end
 end
@@ -2244,13 +2244,13 @@ end
 #           ^^
 #     end
 #
-# source://prism//lib/prism/node.rb#1730
+# source://prism/lib/prism/node.rb#1730
 class Prism::BlockParameterNode < ::Prism::Node
   # Initialize a new BlockParameterNode node.
   #
   # @return [BlockParameterNode] a new instance of BlockParameterNode
   #
-  # source://prism//lib/prism/node.rb#1732
+  # source://prism/lib/prism/node.rb#1732
   sig do
     params(
       source: Prism::Source,
@@ -2267,36 +2267,36 @@ class Prism::BlockParameterNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#1825
+  # source://prism/lib/prism/node.rb#1825
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#1743
+  # source://prism/lib/prism/node.rb#1743
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1748
+  # source://prism/lib/prism/node.rb#1748
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#1758
+  # source://prism/lib/prism/node.rb#1758
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#1753
+  # source://prism/lib/prism/node.rb#1753
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol?, ?name_loc: Location?, ?operator_loc: Location) -> BlockParameterNode
   #
-  # source://prism//lib/prism/node.rb#1763
+  # source://prism/lib/prism/node.rb#1763
   sig do
     params(
       node_id: Integer,
@@ -2312,13 +2312,13 @@ class Prism::BlockParameterNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1748
+  # source://prism/lib/prism/node.rb#1748
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol?, name_loc: Location?, operator_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#1771
+  # source://prism/lib/prism/node.rb#1771
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -2327,31 +2327,31 @@ class Prism::BlockParameterNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#1809
+  # source://prism/lib/prism/node.rb#1809
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol?
   #
-  # source://prism//lib/prism/node.rb#1781
+  # source://prism/lib/prism/node.rb#1781
   sig { returns(T.nilable(Symbol)) }
   def name; end
 
   # attr_reader name_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#1784
+  # source://prism/lib/prism/node.rb#1784
   sig { returns(T.nilable(Prism::Location)) }
   def name_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#1804
+  # source://prism/lib/prism/node.rb#1804
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#1797
+  # source://prism/lib/prism/node.rb#1797
   sig { returns(Prism::Location) }
   def operator_loc; end
 
@@ -2359,20 +2359,20 @@ class Prism::BlockParameterNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#1776
+  # source://prism/lib/prism/node.rb#1776
   sig { returns(T::Boolean) }
   def repeated_parameter?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#1814
+  # source://prism/lib/prism/node.rb#1814
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#1819
+    # source://prism/lib/prism/node.rb#1819
     def type; end
   end
 end
@@ -2386,13 +2386,13 @@ end
 #            ^^^^^^^^^^^^^^^^^
 #     end
 #
-# source://prism//lib/prism/node.rb#1842
+# source://prism/lib/prism/node.rb#1842
 class Prism::BlockParametersNode < ::Prism::Node
   # Initialize a new BlockParametersNode node.
   #
   # @return [BlockParametersNode] a new instance of BlockParametersNode
   #
-  # source://prism//lib/prism/node.rb#1844
+  # source://prism/lib/prism/node.rb#1844
   sig do
     params(
       source: Prism::Source,
@@ -2410,48 +2410,48 @@ class Prism::BlockParametersNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#1950
+  # source://prism/lib/prism/node.rb#1950
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#1856
+  # source://prism/lib/prism/node.rb#1856
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1861
+  # source://prism/lib/prism/node.rb#1861
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String?
   #
-  # source://prism//lib/prism/node.rb#1929
+  # source://prism/lib/prism/node.rb#1929
   sig { returns(T.nilable(String)) }
   def closing; end
 
   # attr_reader closing_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#1911
+  # source://prism/lib/prism/node.rb#1911
   sig { returns(T.nilable(Prism::Location)) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#1874
+  # source://prism/lib/prism/node.rb#1874
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#1866
+  # source://prism/lib/prism/node.rb#1866
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?parameters: ParametersNode?, ?locals: Array[BlockLocalVariableNode], ?opening_loc: Location?, ?closing_loc: Location?) -> BlockParametersNode
   #
-  # source://prism//lib/prism/node.rb#1879
+  # source://prism/lib/prism/node.rb#1879
   sig do
     params(
       node_id: Integer,
@@ -2468,13 +2468,13 @@ class Prism::BlockParametersNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1861
+  # source://prism/lib/prism/node.rb#1861
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, parameters: ParametersNode?, locals: Array[BlockLocalVariableNode], opening_loc: Location?, closing_loc: Location? }
   #
-  # source://prism//lib/prism/node.rb#1887
+  # source://prism/lib/prism/node.rb#1887
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -2483,44 +2483,44 @@ class Prism::BlockParametersNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#1934
+  # source://prism/lib/prism/node.rb#1934
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader locals: Array[BlockLocalVariableNode]
   #
-  # source://prism//lib/prism/node.rb#1895
+  # source://prism/lib/prism/node.rb#1895
   sig { returns(T::Array[Prism::BlockLocalVariableNode]) }
   def locals; end
 
   # def opening: () -> String?
   #
-  # source://prism//lib/prism/node.rb#1924
+  # source://prism/lib/prism/node.rb#1924
   sig { returns(T.nilable(String)) }
   def opening; end
 
   # attr_reader opening_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#1898
+  # source://prism/lib/prism/node.rb#1898
   sig { returns(T.nilable(Prism::Location)) }
   def opening_loc; end
 
   # attr_reader parameters: ParametersNode?
   #
-  # source://prism//lib/prism/node.rb#1892
+  # source://prism/lib/prism/node.rb#1892
   sig { returns(T.nilable(Prism::ParametersNode)) }
   def parameters; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#1939
+  # source://prism/lib/prism/node.rb#1939
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#1944
+    # source://prism/lib/prism/node.rb#1944
     def type; end
   end
 end
@@ -2530,13 +2530,13 @@ end
 #     break foo
 #     ^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#1964
+# source://prism/lib/prism/node.rb#1964
 class Prism::BreakNode < ::Prism::Node
   # Initialize a new BreakNode node.
   #
   # @return [BreakNode] a new instance of BreakNode
   #
-  # source://prism//lib/prism/node.rb#1966
+  # source://prism/lib/prism/node.rb#1966
   sig do
     params(
       source: Prism::Source,
@@ -2552,12 +2552,12 @@ class Prism::BreakNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#2048
+  # source://prism/lib/prism/node.rb#2048
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#1976
+  # source://prism/lib/prism/node.rb#1976
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
@@ -2566,31 +2566,31 @@ class Prism::BreakNode < ::Prism::Node
   #     break foo
   #           ^^^
   #
-  # source://prism//lib/prism/node.rb#2014
+  # source://prism/lib/prism/node.rb#2014
   sig { returns(T.nilable(Prism::ArgumentsNode)) }
   def arguments; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1981
+  # source://prism/lib/prism/node.rb#1981
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#1993
+  # source://prism/lib/prism/node.rb#1993
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#1986
+  # source://prism/lib/prism/node.rb#1986
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?arguments: ArgumentsNode?, ?keyword_loc: Location) -> BreakNode
   #
-  # source://prism//lib/prism/node.rb#1998
+  # source://prism/lib/prism/node.rb#1998
   sig do
     params(
       node_id: Integer,
@@ -2605,13 +2605,13 @@ class Prism::BreakNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#1981
+  # source://prism/lib/prism/node.rb#1981
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, arguments: ArgumentsNode?, keyword_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#2006
+  # source://prism/lib/prism/node.rb#2006
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -2620,13 +2620,13 @@ class Prism::BreakNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#2032
+  # source://prism/lib/prism/node.rb#2032
   sig { override.returns(String) }
   def inspect; end
 
   # def keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#2027
+  # source://prism/lib/prism/node.rb#2027
   sig { returns(String) }
   def keyword; end
 
@@ -2635,20 +2635,20 @@ class Prism::BreakNode < ::Prism::Node
   #     break foo
   #     ^^^^^
   #
-  # source://prism//lib/prism/node.rb#2020
+  # source://prism/lib/prism/node.rb#2020
   sig { returns(Prism::Location) }
   def keyword_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#2037
+  # source://prism/lib/prism/node.rb#2037
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#2042
+    # source://prism/lib/prism/node.rb#2042
     def type; end
   end
 end
@@ -2658,13 +2658,13 @@ end
 #     foo.bar &&= value
 #     ^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#2059
+# source://prism/lib/prism/node.rb#2059
 class Prism::CallAndWriteNode < ::Prism::Node
   # Initialize a new CallAndWriteNode node.
   #
   # @return [CallAndWriteNode] a new instance of CallAndWriteNode
   #
-  # source://prism//lib/prism/node.rb#2061
+  # source://prism/lib/prism/node.rb#2061
   sig do
     params(
       source: Prism::Source,
@@ -2685,12 +2685,12 @@ class Prism::CallAndWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#2208
+  # source://prism/lib/prism/node.rb#2208
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#2076
+  # source://prism/lib/prism/node.rb#2076
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
@@ -2698,43 +2698,43 @@ class Prism::CallAndWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2122
+  # source://prism/lib/prism/node.rb#2122
   sig { returns(T::Boolean) }
   def attribute_write?; end
 
   # def call_operator: () -> String?
   #
-  # source://prism//lib/prism/node.rb#2177
+  # source://prism/lib/prism/node.rb#2177
   sig { returns(T.nilable(String)) }
   def call_operator; end
 
   # attr_reader call_operator_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#2135
+  # source://prism/lib/prism/node.rb#2135
   sig { returns(T.nilable(Prism::Location)) }
   def call_operator_loc; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#2081
+  # source://prism/lib/prism/node.rb#2081
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#2094
+  # source://prism/lib/prism/node.rb#2094
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#2086
+  # source://prism/lib/prism/node.rb#2086
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?message_loc: Location?, ?read_name: Symbol, ?write_name: Symbol, ?operator_loc: Location, ?value: Prism::node) -> CallAndWriteNode
   #
-  # source://prism//lib/prism/node.rb#2099
+  # source://prism/lib/prism/node.rb#2099
   sig do
     params(
       node_id: Integer,
@@ -2754,13 +2754,13 @@ class Prism::CallAndWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#2081
+  # source://prism/lib/prism/node.rb#2081
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, message_loc: Location?, read_name: Symbol, write_name: Symbol, operator_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#2107
+  # source://prism/lib/prism/node.rb#2107
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -2771,49 +2771,49 @@ class Prism::CallAndWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2127
+  # source://prism/lib/prism/node.rb#2127
   sig { returns(T::Boolean) }
   def ignore_visibility?; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#2192
+  # source://prism/lib/prism/node.rb#2192
   sig { override.returns(String) }
   def inspect; end
 
   # def message: () -> String?
   #
-  # source://prism//lib/prism/node.rb#2182
+  # source://prism/lib/prism/node.rb#2182
   sig { returns(T.nilable(String)) }
   def message; end
 
   # attr_reader message_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#2148
+  # source://prism/lib/prism/node.rb#2148
   sig { returns(T.nilable(Prism::Location)) }
   def message_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#2187
+  # source://prism/lib/prism/node.rb#2187
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#2167
+  # source://prism/lib/prism/node.rb#2167
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # attr_reader read_name: Symbol
   #
-  # source://prism//lib/prism/node.rb#2161
+  # source://prism/lib/prism/node.rb#2161
   sig { returns(Symbol) }
   def read_name; end
 
   # attr_reader receiver: Prism::node?
   #
-  # source://prism//lib/prism/node.rb#2132
+  # source://prism/lib/prism/node.rb#2132
   sig { returns(T.nilable(Prism::Node)) }
   def receiver; end
 
@@ -2821,19 +2821,19 @@ class Prism::CallAndWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2112
+  # source://prism/lib/prism/node.rb#2112
   sig { returns(T::Boolean) }
   def safe_navigation?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#2197
+  # source://prism/lib/prism/node.rb#2197
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#2174
+  # source://prism/lib/prism/node.rb#2174
   sig { returns(Prism::Node) }
   def value; end
 
@@ -2841,20 +2841,20 @@ class Prism::CallAndWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2117
+  # source://prism/lib/prism/node.rb#2117
   sig { returns(T::Boolean) }
   def variable_call?; end
 
   # attr_reader write_name: Symbol
   #
-  # source://prism//lib/prism/node.rb#2164
+  # source://prism/lib/prism/node.rb#2164
   sig { returns(Symbol) }
   def write_name; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#2202
+    # source://prism/lib/prism/node.rb#2202
     def type; end
   end
 end
@@ -2879,13 +2879,13 @@ end
 #     foo&.bar
 #     ^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#2240
+# source://prism/lib/prism/node.rb#2240
 class Prism::CallNode < ::Prism::Node
   # Initialize a new CallNode node.
   #
   # @return [CallNode] a new instance of CallNode
   #
-  # source://prism//lib/prism/node.rb#2242
+  # source://prism/lib/prism/node.rb#2242
   sig do
     params(
       source: Prism::Source,
@@ -2907,18 +2907,18 @@ class Prism::CallNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#2424
+  # source://prism/lib/prism/node.rb#2424
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#2258
+  # source://prism/lib/prism/node.rb#2258
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader arguments: ArgumentsNode?
   #
-  # source://prism//lib/prism/node.rb#2369
+  # source://prism/lib/prism/node.rb#2369
   sig { returns(T.nilable(Prism::ArgumentsNode)) }
   def arguments; end
 
@@ -2926,61 +2926,61 @@ class Prism::CallNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2305
+  # source://prism/lib/prism/node.rb#2305
   sig { returns(T::Boolean) }
   def attribute_write?; end
 
   # attr_reader block: BlockNode | BlockArgumentNode | nil
   #
-  # source://prism//lib/prism/node.rb#2385
+  # source://prism/lib/prism/node.rb#2385
   sig { returns(T.nilable(T.any(Prism::BlockNode, Prism::BlockArgumentNode))) }
   def block; end
 
   # def call_operator: () -> String?
   #
-  # source://prism//lib/prism/node.rb#2388
+  # source://prism/lib/prism/node.rb#2388
   sig { returns(T.nilable(String)) }
   def call_operator; end
 
   # attr_reader call_operator_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#2327
+  # source://prism/lib/prism/node.rb#2327
   sig { returns(T.nilable(Prism::Location)) }
   def call_operator_loc; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#2263
+  # source://prism/lib/prism/node.rb#2263
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String?
   #
-  # source://prism//lib/prism/node.rb#2403
+  # source://prism/lib/prism/node.rb#2403
   sig { returns(T.nilable(String)) }
   def closing; end
 
   # attr_reader closing_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#2372
+  # source://prism/lib/prism/node.rb#2372
   sig { returns(T.nilable(Prism::Location)) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#2277
+  # source://prism/lib/prism/node.rb#2277
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#2268
+  # source://prism/lib/prism/node.rb#2268
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?name: Symbol, ?message_loc: Location?, ?opening_loc: Location?, ?arguments: ArgumentsNode?, ?closing_loc: Location?, ?block: BlockNode | BlockArgumentNode | nil) -> CallNode
   #
-  # source://prism//lib/prism/node.rb#2282
+  # source://prism/lib/prism/node.rb#2282
   sig do
     params(
       node_id: Integer,
@@ -3001,13 +3001,13 @@ class Prism::CallNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#2263
+  # source://prism/lib/prism/node.rb#2263
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, name: Symbol, message_loc: Location?, opening_loc: Location?, arguments: ArgumentsNode?, closing_loc: Location?, block: BlockNode | BlockArgumentNode | nil }
   #
-  # source://prism//lib/prism/node.rb#2290
+  # source://prism/lib/prism/node.rb#2290
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -3024,7 +3024,7 @@ class Prism::CallNode < ::Prism::Node
   # sometimes you want the location of the full message including the inner
   # space and the = sign. This method provides that.
   #
-  # source://prism//lib/prism/node_ext.rb#331
+  # source://prism/lib/prism/node_ext.rb#331
   sig { returns(T.nilable(Prism::Location)) }
   def full_message_loc; end
 
@@ -3032,43 +3032,43 @@ class Prism::CallNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2310
+  # source://prism/lib/prism/node.rb#2310
   sig { returns(T::Boolean) }
   def ignore_visibility?; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#2408
+  # source://prism/lib/prism/node.rb#2408
   sig { override.returns(String) }
   def inspect; end
 
   # def message: () -> String?
   #
-  # source://prism//lib/prism/node.rb#2393
+  # source://prism/lib/prism/node.rb#2393
   sig { returns(T.nilable(String)) }
   def message; end
 
   # attr_reader message_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#2343
+  # source://prism/lib/prism/node.rb#2343
   sig { returns(T.nilable(Prism::Location)) }
   def message_loc; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#2340
+  # source://prism/lib/prism/node.rb#2340
   sig { returns(Symbol) }
   def name; end
 
   # def opening: () -> String?
   #
-  # source://prism//lib/prism/node.rb#2398
+  # source://prism/lib/prism/node.rb#2398
   sig { returns(T.nilable(String)) }
   def opening; end
 
   # attr_reader opening_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#2356
+  # source://prism/lib/prism/node.rb#2356
   sig { returns(T.nilable(Prism::Location)) }
   def opening_loc; end
 
@@ -3083,7 +3083,7 @@ class Prism::CallNode < ::Prism::Node
   #     foo + bar
   #     ^^^
   #
-  # source://prism//lib/prism/node.rb#2324
+  # source://prism/lib/prism/node.rb#2324
   sig { returns(T.nilable(Prism::Node)) }
   def receiver; end
 
@@ -3091,13 +3091,13 @@ class Prism::CallNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2295
+  # source://prism/lib/prism/node.rb#2295
   sig { returns(T::Boolean) }
   def safe_navigation?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#2413
+  # source://prism/lib/prism/node.rb#2413
   sig { override.returns(Symbol) }
   def type; end
 
@@ -3105,41 +3105,41 @@ class Prism::CallNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2300
+  # source://prism/lib/prism/node.rb#2300
   sig { returns(T::Boolean) }
   def variable_call?; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#2418
+    # source://prism/lib/prism/node.rb#2418
     def type; end
   end
 end
 
 # Flags for call nodes.
 #
-# source://prism//lib/prism/node.rb#16708
+# source://prism/lib/prism/node.rb#16708
 module Prism::CallNodeFlags; end
 
 # a call that is an attribute write, so the value being written should be returned
 #
-# source://prism//lib/prism/node.rb#16716
+# source://prism/lib/prism/node.rb#16716
 Prism::CallNodeFlags::ATTRIBUTE_WRITE = T.let(T.unsafe(nil), Integer)
 
 # a call that ignores method visibility
 #
-# source://prism//lib/prism/node.rb#16719
+# source://prism/lib/prism/node.rb#16719
 Prism::CallNodeFlags::IGNORE_VISIBILITY = T.let(T.unsafe(nil), Integer)
 
 # &. operator
 #
-# source://prism//lib/prism/node.rb#16710
+# source://prism/lib/prism/node.rb#16710
 Prism::CallNodeFlags::SAFE_NAVIGATION = T.let(T.unsafe(nil), Integer)
 
 # a call that could have been a local variable
 #
-# source://prism//lib/prism/node.rb#16713
+# source://prism/lib/prism/node.rb#16713
 Prism::CallNodeFlags::VARIABLE_CALL = T.let(T.unsafe(nil), Integer)
 
 # Represents the use of an assignment operator on a call.
@@ -3147,13 +3147,13 @@ Prism::CallNodeFlags::VARIABLE_CALL = T.let(T.unsafe(nil), Integer)
 #     foo.bar += baz
 #     ^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#2442
+# source://prism/lib/prism/node.rb#2442
 class Prism::CallOperatorWriteNode < ::Prism::Node
   # Initialize a new CallOperatorWriteNode node.
   #
   # @return [CallOperatorWriteNode] a new instance of CallOperatorWriteNode
   #
-  # source://prism//lib/prism/node.rb#2444
+  # source://prism/lib/prism/node.rb#2444
   sig do
     params(
       source: Prism::Source,
@@ -3175,12 +3175,12 @@ class Prism::CallOperatorWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#2590
+  # source://prism/lib/prism/node.rb#2590
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#2460
+  # source://prism/lib/prism/node.rb#2460
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
@@ -3188,55 +3188,55 @@ class Prism::CallOperatorWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2506
+  # source://prism/lib/prism/node.rb#2506
   sig { returns(T::Boolean) }
   def attribute_write?; end
 
   # attr_reader binary_operator: Symbol
   #
-  # source://prism//lib/prism/node.rb#2551
+  # source://prism/lib/prism/node.rb#2551
   sig { returns(Symbol) }
   def binary_operator; end
 
   # attr_reader binary_operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#2554
+  # source://prism/lib/prism/node.rb#2554
   sig { returns(Prism::Location) }
   def binary_operator_loc; end
 
   # def call_operator: () -> String?
   #
-  # source://prism//lib/prism/node.rb#2564
+  # source://prism/lib/prism/node.rb#2564
   sig { returns(T.nilable(String)) }
   def call_operator; end
 
   # attr_reader call_operator_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#2519
+  # source://prism/lib/prism/node.rb#2519
   sig { returns(T.nilable(Prism::Location)) }
   def call_operator_loc; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#2465
+  # source://prism/lib/prism/node.rb#2465
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#2478
+  # source://prism/lib/prism/node.rb#2478
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#2470
+  # source://prism/lib/prism/node.rb#2470
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?message_loc: Location?, ?read_name: Symbol, ?write_name: Symbol, ?binary_operator: Symbol, ?binary_operator_loc: Location, ?value: Prism::node) -> CallOperatorWriteNode
   #
-  # source://prism//lib/prism/node.rb#2483
+  # source://prism/lib/prism/node.rb#2483
   sig do
     params(
       node_id: Integer,
@@ -3257,13 +3257,13 @@ class Prism::CallOperatorWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#2465
+  # source://prism/lib/prism/node.rb#2465
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, message_loc: Location?, read_name: Symbol, write_name: Symbol, binary_operator: Symbol, binary_operator_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#2491
+  # source://prism/lib/prism/node.rb#2491
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -3274,49 +3274,49 @@ class Prism::CallOperatorWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2511
+  # source://prism/lib/prism/node.rb#2511
   sig { returns(T::Boolean) }
   def ignore_visibility?; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#2574
+  # source://prism/lib/prism/node.rb#2574
   sig { override.returns(String) }
   def inspect; end
 
   # def message: () -> String?
   #
-  # source://prism//lib/prism/node.rb#2569
+  # source://prism/lib/prism/node.rb#2569
   sig { returns(T.nilable(String)) }
   def message; end
 
   # attr_reader message_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#2532
+  # source://prism/lib/prism/node.rb#2532
   sig { returns(T.nilable(Prism::Location)) }
   def message_loc; end
 
   # Returns the binary operator used to modify the receiver. This method is
   # deprecated in favor of #binary_operator.
   #
-  # source://prism//lib/prism/node_ext.rb#339
+  # source://prism/lib/prism/node_ext.rb#339
   def operator; end
 
   # Returns the location of the binary operator used to modify the receiver.
   # This method is deprecated in favor of #binary_operator_loc.
   #
-  # source://prism//lib/prism/node_ext.rb#346
+  # source://prism/lib/prism/node_ext.rb#346
   def operator_loc; end
 
   # attr_reader read_name: Symbol
   #
-  # source://prism//lib/prism/node.rb#2545
+  # source://prism/lib/prism/node.rb#2545
   sig { returns(Symbol) }
   def read_name; end
 
   # attr_reader receiver: Prism::node?
   #
-  # source://prism//lib/prism/node.rb#2516
+  # source://prism/lib/prism/node.rb#2516
   sig { returns(T.nilable(Prism::Node)) }
   def receiver; end
 
@@ -3324,19 +3324,19 @@ class Prism::CallOperatorWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2496
+  # source://prism/lib/prism/node.rb#2496
   sig { returns(T::Boolean) }
   def safe_navigation?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#2579
+  # source://prism/lib/prism/node.rb#2579
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#2561
+  # source://prism/lib/prism/node.rb#2561
   sig { returns(Prism::Node) }
   def value; end
 
@@ -3344,20 +3344,20 @@ class Prism::CallOperatorWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2501
+  # source://prism/lib/prism/node.rb#2501
   sig { returns(T::Boolean) }
   def variable_call?; end
 
   # attr_reader write_name: Symbol
   #
-  # source://prism//lib/prism/node.rb#2548
+  # source://prism/lib/prism/node.rb#2548
   sig { returns(Symbol) }
   def write_name; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#2584
+    # source://prism/lib/prism/node.rb#2584
     def type; end
   end
 end
@@ -3367,13 +3367,13 @@ end
 #     foo.bar ||= value
 #     ^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#2608
+# source://prism/lib/prism/node.rb#2608
 class Prism::CallOrWriteNode < ::Prism::Node
   # Initialize a new CallOrWriteNode node.
   #
   # @return [CallOrWriteNode] a new instance of CallOrWriteNode
   #
-  # source://prism//lib/prism/node.rb#2610
+  # source://prism/lib/prism/node.rb#2610
   sig do
     params(
       source: Prism::Source,
@@ -3394,12 +3394,12 @@ class Prism::CallOrWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#2757
+  # source://prism/lib/prism/node.rb#2757
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#2625
+  # source://prism/lib/prism/node.rb#2625
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
@@ -3407,43 +3407,43 @@ class Prism::CallOrWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2671
+  # source://prism/lib/prism/node.rb#2671
   sig { returns(T::Boolean) }
   def attribute_write?; end
 
   # def call_operator: () -> String?
   #
-  # source://prism//lib/prism/node.rb#2726
+  # source://prism/lib/prism/node.rb#2726
   sig { returns(T.nilable(String)) }
   def call_operator; end
 
   # attr_reader call_operator_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#2684
+  # source://prism/lib/prism/node.rb#2684
   sig { returns(T.nilable(Prism::Location)) }
   def call_operator_loc; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#2630
+  # source://prism/lib/prism/node.rb#2630
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#2643
+  # source://prism/lib/prism/node.rb#2643
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#2635
+  # source://prism/lib/prism/node.rb#2635
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?message_loc: Location?, ?read_name: Symbol, ?write_name: Symbol, ?operator_loc: Location, ?value: Prism::node) -> CallOrWriteNode
   #
-  # source://prism//lib/prism/node.rb#2648
+  # source://prism/lib/prism/node.rb#2648
   sig do
     params(
       node_id: Integer,
@@ -3463,13 +3463,13 @@ class Prism::CallOrWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#2630
+  # source://prism/lib/prism/node.rb#2630
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, message_loc: Location?, read_name: Symbol, write_name: Symbol, operator_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#2656
+  # source://prism/lib/prism/node.rb#2656
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -3480,49 +3480,49 @@ class Prism::CallOrWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2676
+  # source://prism/lib/prism/node.rb#2676
   sig { returns(T::Boolean) }
   def ignore_visibility?; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#2741
+  # source://prism/lib/prism/node.rb#2741
   sig { override.returns(String) }
   def inspect; end
 
   # def message: () -> String?
   #
-  # source://prism//lib/prism/node.rb#2731
+  # source://prism/lib/prism/node.rb#2731
   sig { returns(T.nilable(String)) }
   def message; end
 
   # attr_reader message_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#2697
+  # source://prism/lib/prism/node.rb#2697
   sig { returns(T.nilable(Prism::Location)) }
   def message_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#2736
+  # source://prism/lib/prism/node.rb#2736
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#2716
+  # source://prism/lib/prism/node.rb#2716
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # attr_reader read_name: Symbol
   #
-  # source://prism//lib/prism/node.rb#2710
+  # source://prism/lib/prism/node.rb#2710
   sig { returns(Symbol) }
   def read_name; end
 
   # attr_reader receiver: Prism::node?
   #
-  # source://prism//lib/prism/node.rb#2681
+  # source://prism/lib/prism/node.rb#2681
   sig { returns(T.nilable(Prism::Node)) }
   def receiver; end
 
@@ -3530,19 +3530,19 @@ class Prism::CallOrWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2661
+  # source://prism/lib/prism/node.rb#2661
   sig { returns(T::Boolean) }
   def safe_navigation?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#2746
+  # source://prism/lib/prism/node.rb#2746
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#2723
+  # source://prism/lib/prism/node.rb#2723
   sig { returns(Prism::Node) }
   def value; end
 
@@ -3550,20 +3550,20 @@ class Prism::CallOrWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2666
+  # source://prism/lib/prism/node.rb#2666
   sig { returns(T::Boolean) }
   def variable_call?; end
 
   # attr_reader write_name: Symbol
   #
-  # source://prism//lib/prism/node.rb#2713
+  # source://prism/lib/prism/node.rb#2713
   sig { returns(Symbol) }
   def write_name; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#2751
+    # source://prism/lib/prism/node.rb#2751
     def type; end
   end
 end
@@ -3581,13 +3581,13 @@ end
 #     for foo.bar in baz do end
 #         ^^^^^^^
 #
-# source://prism//lib/prism/node.rb#2782
+# source://prism/lib/prism/node.rb#2782
 class Prism::CallTargetNode < ::Prism::Node
   # Initialize a new CallTargetNode node.
   #
   # @return [CallTargetNode] a new instance of CallTargetNode
   #
-  # source://prism//lib/prism/node.rb#2784
+  # source://prism/lib/prism/node.rb#2784
   sig do
     params(
       source: Prism::Source,
@@ -3605,12 +3605,12 @@ class Prism::CallTargetNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#2895
+  # source://prism/lib/prism/node.rb#2895
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#2796
+  # source://prism/lib/prism/node.rb#2796
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
@@ -3618,43 +3618,43 @@ class Prism::CallTargetNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2839
+  # source://prism/lib/prism/node.rb#2839
   sig { returns(T::Boolean) }
   def attribute_write?; end
 
   # def call_operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#2869
+  # source://prism/lib/prism/node.rb#2869
   sig { returns(String) }
   def call_operator; end
 
   # attr_reader call_operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#2852
+  # source://prism/lib/prism/node.rb#2852
   sig { returns(Prism::Location) }
   def call_operator_loc; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#2801
+  # source://prism/lib/prism/node.rb#2801
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#2811
+  # source://prism/lib/prism/node.rb#2811
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#2806
+  # source://prism/lib/prism/node.rb#2806
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node, ?call_operator_loc: Location, ?name: Symbol, ?message_loc: Location) -> CallTargetNode
   #
-  # source://prism//lib/prism/node.rb#2816
+  # source://prism/lib/prism/node.rb#2816
   sig do
     params(
       node_id: Integer,
@@ -3671,13 +3671,13 @@ class Prism::CallTargetNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#2801
+  # source://prism/lib/prism/node.rb#2801
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node, call_operator_loc: Location, name: Symbol, message_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#2824
+  # source://prism/lib/prism/node.rb#2824
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -3688,37 +3688,37 @@ class Prism::CallTargetNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2844
+  # source://prism/lib/prism/node.rb#2844
   sig { returns(T::Boolean) }
   def ignore_visibility?; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#2879
+  # source://prism/lib/prism/node.rb#2879
   sig { override.returns(String) }
   def inspect; end
 
   # def message: () -> String
   #
-  # source://prism//lib/prism/node.rb#2874
+  # source://prism/lib/prism/node.rb#2874
   sig { returns(String) }
   def message; end
 
   # attr_reader message_loc: Location
   #
-  # source://prism//lib/prism/node.rb#2862
+  # source://prism/lib/prism/node.rb#2862
   sig { returns(Prism::Location) }
   def message_loc; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#2859
+  # source://prism/lib/prism/node.rb#2859
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader receiver: Prism::node
   #
-  # source://prism//lib/prism/node.rb#2849
+  # source://prism/lib/prism/node.rb#2849
   sig { returns(Prism::Node) }
   def receiver; end
 
@@ -3726,13 +3726,13 @@ class Prism::CallTargetNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2829
+  # source://prism/lib/prism/node.rb#2829
   sig { returns(T::Boolean) }
   def safe_navigation?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#2884
+  # source://prism/lib/prism/node.rb#2884
   sig { override.returns(Symbol) }
   def type; end
 
@@ -3740,14 +3740,14 @@ class Prism::CallTargetNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#2834
+  # source://prism/lib/prism/node.rb#2834
   sig { returns(T::Boolean) }
   def variable_call?; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#2889
+    # source://prism/lib/prism/node.rb#2889
     def type; end
   end
 end
@@ -3757,13 +3757,13 @@ end
 #     foo => [bar => baz]
 #            ^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#2909
+# source://prism/lib/prism/node.rb#2909
 class Prism::CapturePatternNode < ::Prism::Node
   # Initialize a new CapturePatternNode node.
   #
   # @return [CapturePatternNode] a new instance of CapturePatternNode
   #
-  # source://prism//lib/prism/node.rb#2911
+  # source://prism/lib/prism/node.rb#2911
   sig do
     params(
       source: Prism::Source,
@@ -3780,36 +3780,36 @@ class Prism::CapturePatternNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#2989
+  # source://prism/lib/prism/node.rb#2989
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#2922
+  # source://prism/lib/prism/node.rb#2922
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#2927
+  # source://prism/lib/prism/node.rb#2927
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#2937
+  # source://prism/lib/prism/node.rb#2937
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#2932
+  # source://prism/lib/prism/node.rb#2932
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: Prism::node, ?target: LocalVariableTargetNode, ?operator_loc: Location) -> CapturePatternNode
   #
-  # source://prism//lib/prism/node.rb#2942
+  # source://prism/lib/prism/node.rb#2942
   sig do
     params(
       node_id: Integer,
@@ -3825,13 +3825,13 @@ class Prism::CapturePatternNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#2927
+  # source://prism/lib/prism/node.rb#2927
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: Prism::node, target: LocalVariableTargetNode, operator_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#2950
+  # source://prism/lib/prism/node.rb#2950
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -3840,44 +3840,44 @@ class Prism::CapturePatternNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#2973
+  # source://prism/lib/prism/node.rb#2973
   sig { override.returns(String) }
   def inspect; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#2968
+  # source://prism/lib/prism/node.rb#2968
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#2961
+  # source://prism/lib/prism/node.rb#2961
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # attr_reader target: LocalVariableTargetNode
   #
-  # source://prism//lib/prism/node.rb#2958
+  # source://prism/lib/prism/node.rb#2958
   sig { returns(Prism::LocalVariableTargetNode) }
   def target; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#2978
+  # source://prism/lib/prism/node.rb#2978
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#2955
+  # source://prism/lib/prism/node.rb#2955
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#2983
+    # source://prism/lib/prism/node.rb#2983
     def type; end
   end
 end
@@ -3889,13 +3889,13 @@ end
 #     end
 #     ^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#3003
+# source://prism/lib/prism/node.rb#3003
 class Prism::CaseMatchNode < ::Prism::Node
   # Initialize a new CaseMatchNode node.
   #
   # @return [CaseMatchNode] a new instance of CaseMatchNode
   #
-  # source://prism//lib/prism/node.rb#3005
+  # source://prism/lib/prism/node.rb#3005
   sig do
     params(
       source: Prism::Source,
@@ -3914,60 +3914,60 @@ class Prism::CaseMatchNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#3104
+  # source://prism/lib/prism/node.rb#3104
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#3018
+  # source://prism/lib/prism/node.rb#3018
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def case_keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#3078
+  # source://prism/lib/prism/node.rb#3078
   sig { returns(String) }
   def case_keyword; end
 
   # attr_reader case_keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#3064
+  # source://prism/lib/prism/node.rb#3064
   sig { returns(Prism::Location) }
   def case_keyword_loc; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3023
+  # source://prism/lib/prism/node.rb#3023
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#3037
+  # source://prism/lib/prism/node.rb#3037
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#3028
+  # source://prism/lib/prism/node.rb#3028
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # attr_reader conditions: Array[InNode]
   #
-  # source://prism//lib/prism/node.rb#3058
+  # source://prism/lib/prism/node.rb#3058
   sig { returns(T::Array[Prism::InNode]) }
   def conditions; end
 
   # Returns the else clause of the case match node. This method is deprecated
   # in favor of #else_clause.
   #
-  # source://prism//lib/prism/node_ext.rb#467
+  # source://prism/lib/prism/node_ext.rb#467
   def consequent; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?predicate: Prism::node?, ?conditions: Array[InNode], ?else_clause: ElseNode?, ?case_keyword_loc: Location, ?end_keyword_loc: Location) -> CaseMatchNode
   #
-  # source://prism//lib/prism/node.rb#3042
+  # source://prism/lib/prism/node.rb#3042
   sig do
     params(
       node_id: Integer,
@@ -3985,31 +3985,31 @@ class Prism::CaseMatchNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3023
+  # source://prism/lib/prism/node.rb#3023
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, predicate: Prism::node?, conditions: Array[InNode], else_clause: ElseNode?, case_keyword_loc: Location, end_keyword_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#3050
+  # source://prism/lib/prism/node.rb#3050
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # attr_reader else_clause: ElseNode?
   #
-  # source://prism//lib/prism/node.rb#3061
+  # source://prism/lib/prism/node.rb#3061
   sig { returns(T.nilable(Prism::ElseNode)) }
   def else_clause; end
 
   # def end_keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#3083
+  # source://prism/lib/prism/node.rb#3083
   sig { returns(String) }
   def end_keyword; end
 
   # attr_reader end_keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#3071
+  # source://prism/lib/prism/node.rb#3071
   sig { returns(Prism::Location) }
   def end_keyword_loc; end
 
@@ -4018,26 +4018,26 @@ class Prism::CaseMatchNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#3088
+  # source://prism/lib/prism/node.rb#3088
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader predicate: Prism::node?
   #
-  # source://prism//lib/prism/node.rb#3055
+  # source://prism/lib/prism/node.rb#3055
   sig { returns(T.nilable(Prism::Node)) }
   def predicate; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#3093
+  # source://prism/lib/prism/node.rb#3093
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#3098
+    # source://prism/lib/prism/node.rb#3098
     def type; end
   end
 end
@@ -4049,13 +4049,13 @@ end
 #     end
 #     ^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#3121
+# source://prism/lib/prism/node.rb#3121
 class Prism::CaseNode < ::Prism::Node
   # Initialize a new CaseNode node.
   #
   # @return [CaseNode] a new instance of CaseNode
   #
-  # source://prism//lib/prism/node.rb#3123
+  # source://prism/lib/prism/node.rb#3123
   sig do
     params(
       source: Prism::Source,
@@ -4074,60 +4074,60 @@ class Prism::CaseNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#3222
+  # source://prism/lib/prism/node.rb#3222
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#3136
+  # source://prism/lib/prism/node.rb#3136
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def case_keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#3196
+  # source://prism/lib/prism/node.rb#3196
   sig { returns(String) }
   def case_keyword; end
 
   # attr_reader case_keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#3182
+  # source://prism/lib/prism/node.rb#3182
   sig { returns(Prism::Location) }
   def case_keyword_loc; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3141
+  # source://prism/lib/prism/node.rb#3141
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#3155
+  # source://prism/lib/prism/node.rb#3155
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#3146
+  # source://prism/lib/prism/node.rb#3146
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # attr_reader conditions: Array[WhenNode]
   #
-  # source://prism//lib/prism/node.rb#3176
+  # source://prism/lib/prism/node.rb#3176
   sig { returns(T::Array[Prism::WhenNode]) }
   def conditions; end
 
   # Returns the else clause of the case node. This method is deprecated in
   # favor of #else_clause.
   #
-  # source://prism//lib/prism/node_ext.rb#476
+  # source://prism/lib/prism/node_ext.rb#476
   def consequent; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?predicate: Prism::node?, ?conditions: Array[WhenNode], ?else_clause: ElseNode?, ?case_keyword_loc: Location, ?end_keyword_loc: Location) -> CaseNode
   #
-  # source://prism//lib/prism/node.rb#3160
+  # source://prism/lib/prism/node.rb#3160
   sig do
     params(
       node_id: Integer,
@@ -4145,31 +4145,31 @@ class Prism::CaseNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3141
+  # source://prism/lib/prism/node.rb#3141
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, predicate: Prism::node?, conditions: Array[WhenNode], else_clause: ElseNode?, case_keyword_loc: Location, end_keyword_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#3168
+  # source://prism/lib/prism/node.rb#3168
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # attr_reader else_clause: ElseNode?
   #
-  # source://prism//lib/prism/node.rb#3179
+  # source://prism/lib/prism/node.rb#3179
   sig { returns(T.nilable(Prism::ElseNode)) }
   def else_clause; end
 
   # def end_keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#3201
+  # source://prism/lib/prism/node.rb#3201
   sig { returns(String) }
   def end_keyword; end
 
   # attr_reader end_keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#3189
+  # source://prism/lib/prism/node.rb#3189
   sig { returns(Prism::Location) }
   def end_keyword_loc; end
 
@@ -4178,26 +4178,26 @@ class Prism::CaseNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#3206
+  # source://prism/lib/prism/node.rb#3206
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader predicate: Prism::node?
   #
-  # source://prism//lib/prism/node.rb#3173
+  # source://prism/lib/prism/node.rb#3173
   sig { returns(T.nilable(Prism::Node)) }
   def predicate; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#3211
+  # source://prism/lib/prism/node.rb#3211
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#3216
+    # source://prism/lib/prism/node.rb#3216
     def type; end
   end
 end
@@ -4207,13 +4207,13 @@ end
 #     class Foo end
 #     ^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#3237
+# source://prism/lib/prism/node.rb#3237
 class Prism::ClassNode < ::Prism::Node
   # Initialize a new ClassNode node.
   #
   # @return [ClassNode] a new instance of ClassNode
   #
-  # source://prism//lib/prism/node.rb#3239
+  # source://prism/lib/prism/node.rb#3239
   sig do
     params(
       source: Prism::Source,
@@ -4235,60 +4235,60 @@ class Prism::ClassNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#3365
+  # source://prism/lib/prism/node.rb#3365
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#3255
+  # source://prism/lib/prism/node.rb#3255
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader body: StatementsNode | BeginNode | nil
   #
-  # source://prism//lib/prism/node.rb#3321
+  # source://prism/lib/prism/node.rb#3321
   sig { returns(T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))) }
   def body; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3260
+  # source://prism/lib/prism/node.rb#3260
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def class_keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#3334
+  # source://prism/lib/prism/node.rb#3334
   sig { returns(String) }
   def class_keyword; end
 
   # attr_reader class_keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#3295
+  # source://prism/lib/prism/node.rb#3295
   sig { returns(Prism::Location) }
   def class_keyword_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#3274
+  # source://prism/lib/prism/node.rb#3274
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#3265
+  # source://prism/lib/prism/node.rb#3265
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # attr_reader constant_path: ConstantReadNode | ConstantPathNode | CallNode
   #
-  # source://prism//lib/prism/node.rb#3302
+  # source://prism/lib/prism/node.rb#3302
   sig { returns(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode, Prism::CallNode)) }
   def constant_path; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?locals: Array[Symbol], ?class_keyword_loc: Location, ?constant_path: ConstantReadNode | ConstantPathNode | CallNode, ?inheritance_operator_loc: Location?, ?superclass: Prism::node?, ?body: StatementsNode | BeginNode | nil, ?end_keyword_loc: Location, ?name: Symbol) -> ClassNode
   #
-  # source://prism//lib/prism/node.rb#3279
+  # source://prism/lib/prism/node.rb#3279
   sig do
     params(
       node_id: Integer,
@@ -4309,25 +4309,25 @@ class Prism::ClassNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3260
+  # source://prism/lib/prism/node.rb#3260
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, locals: Array[Symbol], class_keyword_loc: Location, constant_path: ConstantReadNode | ConstantPathNode | CallNode, inheritance_operator_loc: Location?, superclass: Prism::node?, body: StatementsNode | BeginNode | nil, end_keyword_loc: Location, name: Symbol }
   #
-  # source://prism//lib/prism/node.rb#3287
+  # source://prism/lib/prism/node.rb#3287
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # def end_keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#3344
+  # source://prism/lib/prism/node.rb#3344
   sig { returns(String) }
   def end_keyword; end
 
   # attr_reader end_keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#3324
+  # source://prism/lib/prism/node.rb#3324
   sig { returns(Prism::Location) }
   def end_keyword_loc; end
 
@@ -4336,50 +4336,50 @@ class Prism::ClassNode < ::Prism::Node
 
   # def inheritance_operator: () -> String?
   #
-  # source://prism//lib/prism/node.rb#3339
+  # source://prism/lib/prism/node.rb#3339
   sig { returns(T.nilable(String)) }
   def inheritance_operator; end
 
   # attr_reader inheritance_operator_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#3305
+  # source://prism/lib/prism/node.rb#3305
   sig { returns(T.nilable(Prism::Location)) }
   def inheritance_operator_loc; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#3349
+  # source://prism/lib/prism/node.rb#3349
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader locals: Array[Symbol]
   #
-  # source://prism//lib/prism/node.rb#3292
+  # source://prism/lib/prism/node.rb#3292
   sig { returns(T::Array[Symbol]) }
   def locals; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#3331
+  # source://prism/lib/prism/node.rb#3331
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader superclass: Prism::node?
   #
-  # source://prism//lib/prism/node.rb#3318
+  # source://prism/lib/prism/node.rb#3318
   sig { returns(T.nilable(Prism::Node)) }
   def superclass; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#3354
+  # source://prism/lib/prism/node.rb#3354
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#3359
+    # source://prism/lib/prism/node.rb#3359
     def type; end
   end
 end
@@ -4389,13 +4389,13 @@ end
 #     @@target &&= value
 #     ^^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#3383
+# source://prism/lib/prism/node.rb#3383
 class Prism::ClassVariableAndWriteNode < ::Prism::Node
   # Initialize a new ClassVariableAndWriteNode node.
   #
   # @return [ClassVariableAndWriteNode] a new instance of ClassVariableAndWriteNode
   #
-  # source://prism//lib/prism/node.rb#3385
+  # source://prism/lib/prism/node.rb#3385
   sig do
     params(
       source: Prism::Source,
@@ -4413,36 +4413,36 @@ class Prism::ClassVariableAndWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#3471
+  # source://prism/lib/prism/node.rb#3471
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#3397
+  # source://prism/lib/prism/node.rb#3397
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3402
+  # source://prism/lib/prism/node.rb#3402
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#3412
+  # source://prism/lib/prism/node.rb#3412
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#3407
+  # source://prism/lib/prism/node.rb#3407
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> ClassVariableAndWriteNode
   #
-  # source://prism//lib/prism/node.rb#3417
+  # source://prism/lib/prism/node.rb#3417
   sig do
     params(
       node_id: Integer,
@@ -4459,17 +4459,17 @@ class Prism::ClassVariableAndWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3402
+  # source://prism/lib/prism/node.rb#3402
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#3425
+  # source://prism/lib/prism/node.rb#3425
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
-  # source://prism//lib/prism/desugar_compiler.rb#164
+  # source://prism/lib/prism/desugar_compiler.rb#164
   def desugar; end
 
   sig { override.returns(T::Array[Prism::Reflection::Field]) }
@@ -4477,50 +4477,50 @@ class Prism::ClassVariableAndWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#3455
+  # source://prism/lib/prism/node.rb#3455
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#3430
+  # source://prism/lib/prism/node.rb#3430
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#3433
+  # source://prism/lib/prism/node.rb#3433
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#3450
+  # source://prism/lib/prism/node.rb#3450
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#3440
+  # source://prism/lib/prism/node.rb#3440
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#3460
+  # source://prism/lib/prism/node.rb#3460
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#3447
+  # source://prism/lib/prism/node.rb#3447
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#3465
+    # source://prism/lib/prism/node.rb#3465
     def type; end
   end
 end
@@ -4530,13 +4530,13 @@ end
 #     @@target += value
 #     ^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#3484
+# source://prism/lib/prism/node.rb#3484
 class Prism::ClassVariableOperatorWriteNode < ::Prism::Node
   # Initialize a new ClassVariableOperatorWriteNode node.
   #
   # @return [ClassVariableOperatorWriteNode] a new instance of ClassVariableOperatorWriteNode
   #
-  # source://prism//lib/prism/node.rb#3486
+  # source://prism/lib/prism/node.rb#3486
   sig do
     params(
       source: Prism::Source,
@@ -4555,48 +4555,48 @@ class Prism::ClassVariableOperatorWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#3571
+  # source://prism/lib/prism/node.rb#3571
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#3499
+  # source://prism/lib/prism/node.rb#3499
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader binary_operator: Symbol
   #
-  # source://prism//lib/prism/node.rb#3552
+  # source://prism/lib/prism/node.rb#3552
   sig { returns(Symbol) }
   def binary_operator; end
 
   # attr_reader binary_operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#3542
+  # source://prism/lib/prism/node.rb#3542
   sig { returns(Prism::Location) }
   def binary_operator_loc; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3504
+  # source://prism/lib/prism/node.rb#3504
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#3514
+  # source://prism/lib/prism/node.rb#3514
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#3509
+  # source://prism/lib/prism/node.rb#3509
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol) -> ClassVariableOperatorWriteNode
   #
-  # source://prism//lib/prism/node.rb#3519
+  # source://prism/lib/prism/node.rb#3519
   sig do
     params(
       node_id: Integer,
@@ -4614,17 +4614,17 @@ class Prism::ClassVariableOperatorWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3504
+  # source://prism/lib/prism/node.rb#3504
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol }
   #
-  # source://prism//lib/prism/node.rb#3527
+  # source://prism/lib/prism/node.rb#3527
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
-  # source://prism//lib/prism/desugar_compiler.rb#176
+  # source://prism/lib/prism/desugar_compiler.rb#176
   def desugar; end
 
   sig { override.returns(T::Array[Prism::Reflection::Field]) }
@@ -4632,50 +4632,50 @@ class Prism::ClassVariableOperatorWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#3555
+  # source://prism/lib/prism/node.rb#3555
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#3532
+  # source://prism/lib/prism/node.rb#3532
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#3535
+  # source://prism/lib/prism/node.rb#3535
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # Returns the binary operator used to modify the receiver. This method is
   # deprecated in favor of #binary_operator.
   #
-  # source://prism//lib/prism/node_ext.rb#355
+  # source://prism/lib/prism/node_ext.rb#355
   def operator; end
 
   # Returns the location of the binary operator used to modify the receiver.
   # This method is deprecated in favor of #binary_operator_loc.
   #
-  # source://prism//lib/prism/node_ext.rb#362
+  # source://prism/lib/prism/node_ext.rb#362
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#3560
+  # source://prism/lib/prism/node.rb#3560
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#3549
+  # source://prism/lib/prism/node.rb#3549
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#3565
+    # source://prism/lib/prism/node.rb#3565
     def type; end
   end
 end
@@ -4685,13 +4685,13 @@ end
 #     @@target ||= value
 #     ^^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#3585
+# source://prism/lib/prism/node.rb#3585
 class Prism::ClassVariableOrWriteNode < ::Prism::Node
   # Initialize a new ClassVariableOrWriteNode node.
   #
   # @return [ClassVariableOrWriteNode] a new instance of ClassVariableOrWriteNode
   #
-  # source://prism//lib/prism/node.rb#3587
+  # source://prism/lib/prism/node.rb#3587
   sig do
     params(
       source: Prism::Source,
@@ -4709,36 +4709,36 @@ class Prism::ClassVariableOrWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#3673
+  # source://prism/lib/prism/node.rb#3673
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#3599
+  # source://prism/lib/prism/node.rb#3599
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3604
+  # source://prism/lib/prism/node.rb#3604
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#3614
+  # source://prism/lib/prism/node.rb#3614
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#3609
+  # source://prism/lib/prism/node.rb#3609
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> ClassVariableOrWriteNode
   #
-  # source://prism//lib/prism/node.rb#3619
+  # source://prism/lib/prism/node.rb#3619
   sig do
     params(
       node_id: Integer,
@@ -4755,17 +4755,17 @@ class Prism::ClassVariableOrWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3604
+  # source://prism/lib/prism/node.rb#3604
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#3627
+  # source://prism/lib/prism/node.rb#3627
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
-  # source://prism//lib/prism/desugar_compiler.rb#170
+  # source://prism/lib/prism/desugar_compiler.rb#170
   def desugar; end
 
   sig { override.returns(T::Array[Prism::Reflection::Field]) }
@@ -4773,50 +4773,50 @@ class Prism::ClassVariableOrWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#3657
+  # source://prism/lib/prism/node.rb#3657
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#3632
+  # source://prism/lib/prism/node.rb#3632
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#3635
+  # source://prism/lib/prism/node.rb#3635
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#3652
+  # source://prism/lib/prism/node.rb#3652
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#3642
+  # source://prism/lib/prism/node.rb#3642
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#3662
+  # source://prism/lib/prism/node.rb#3662
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#3649
+  # source://prism/lib/prism/node.rb#3649
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#3667
+    # source://prism/lib/prism/node.rb#3667
     def type; end
   end
 end
@@ -4826,49 +4826,49 @@ end
 #     @@foo
 #     ^^^^^
 #
-# source://prism//lib/prism/node.rb#3686
+# source://prism/lib/prism/node.rb#3686
 class Prism::ClassVariableReadNode < ::Prism::Node
   # Initialize a new ClassVariableReadNode node.
   #
   # @return [ClassVariableReadNode] a new instance of ClassVariableReadNode
   #
-  # source://prism//lib/prism/node.rb#3688
+  # source://prism/lib/prism/node.rb#3688
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
   def initialize(source, node_id, location, flags, name); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#3753
+  # source://prism/lib/prism/node.rb#3753
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#3697
+  # source://prism/lib/prism/node.rb#3697
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3702
+  # source://prism/lib/prism/node.rb#3702
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#3712
+  # source://prism/lib/prism/node.rb#3712
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#3707
+  # source://prism/lib/prism/node.rb#3707
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> ClassVariableReadNode
   #
-  # source://prism//lib/prism/node.rb#3717
+  # source://prism/lib/prism/node.rb#3717
   sig do
     params(
       node_id: Integer,
@@ -4882,13 +4882,13 @@ class Prism::ClassVariableReadNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3702
+  # source://prism/lib/prism/node.rb#3702
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
   #
-  # source://prism//lib/prism/node.rb#3725
+  # source://prism/lib/prism/node.rb#3725
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -4897,7 +4897,7 @@ class Prism::ClassVariableReadNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#3737
+  # source://prism/lib/prism/node.rb#3737
   sig { override.returns(String) }
   def inspect; end
 
@@ -4907,20 +4907,20 @@ class Prism::ClassVariableReadNode < ::Prism::Node
   #
   #     @@_test # name `:@@_test`
   #
-  # source://prism//lib/prism/node.rb#3734
+  # source://prism/lib/prism/node.rb#3734
   sig { returns(Symbol) }
   def name; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#3742
+  # source://prism/lib/prism/node.rb#3742
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#3747
+    # source://prism/lib/prism/node.rb#3747
     def type; end
   end
 end
@@ -4930,49 +4930,49 @@ end
 #     @@foo, @@bar = baz
 #     ^^^^^  ^^^^^
 #
-# source://prism//lib/prism/node.rb#3763
+# source://prism/lib/prism/node.rb#3763
 class Prism::ClassVariableTargetNode < ::Prism::Node
   # Initialize a new ClassVariableTargetNode node.
   #
   # @return [ClassVariableTargetNode] a new instance of ClassVariableTargetNode
   #
-  # source://prism//lib/prism/node.rb#3765
+  # source://prism/lib/prism/node.rb#3765
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
   def initialize(source, node_id, location, flags, name); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#3826
+  # source://prism/lib/prism/node.rb#3826
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#3774
+  # source://prism/lib/prism/node.rb#3774
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3779
+  # source://prism/lib/prism/node.rb#3779
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#3789
+  # source://prism/lib/prism/node.rb#3789
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#3784
+  # source://prism/lib/prism/node.rb#3784
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> ClassVariableTargetNode
   #
-  # source://prism//lib/prism/node.rb#3794
+  # source://prism/lib/prism/node.rb#3794
   sig do
     params(
       node_id: Integer,
@@ -4986,13 +4986,13 @@ class Prism::ClassVariableTargetNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3779
+  # source://prism/lib/prism/node.rb#3779
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
   #
-  # source://prism//lib/prism/node.rb#3802
+  # source://prism/lib/prism/node.rb#3802
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -5001,26 +5001,26 @@ class Prism::ClassVariableTargetNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#3810
+  # source://prism/lib/prism/node.rb#3810
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#3807
+  # source://prism/lib/prism/node.rb#3807
   sig { returns(Symbol) }
   def name; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#3815
+  # source://prism/lib/prism/node.rb#3815
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#3820
+    # source://prism/lib/prism/node.rb#3820
     def type; end
   end
 end
@@ -5030,13 +5030,13 @@ end
 #     @@foo = 1
 #     ^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#3836
+# source://prism/lib/prism/node.rb#3836
 class Prism::ClassVariableWriteNode < ::Prism::Node
   # Initialize a new ClassVariableWriteNode node.
   #
   # @return [ClassVariableWriteNode] a new instance of ClassVariableWriteNode
   #
-  # source://prism//lib/prism/node.rb#3838
+  # source://prism/lib/prism/node.rb#3838
   sig do
     params(
       source: Prism::Source,
@@ -5054,36 +5054,36 @@ class Prism::ClassVariableWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#3940
+  # source://prism/lib/prism/node.rb#3940
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#3850
+  # source://prism/lib/prism/node.rb#3850
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3855
+  # source://prism/lib/prism/node.rb#3855
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#3865
+  # source://prism/lib/prism/node.rb#3865
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#3860
+  # source://prism/lib/prism/node.rb#3860
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location) -> ClassVariableWriteNode
   #
-  # source://prism//lib/prism/node.rb#3870
+  # source://prism/lib/prism/node.rb#3870
   sig do
     params(
       node_id: Integer,
@@ -5100,13 +5100,13 @@ class Prism::ClassVariableWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3855
+  # source://prism/lib/prism/node.rb#3855
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#3878
+  # source://prism/lib/prism/node.rb#3878
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -5115,7 +5115,7 @@ class Prism::ClassVariableWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#3924
+  # source://prism/lib/prism/node.rb#3924
   sig { override.returns(String) }
   def inspect; end
 
@@ -5125,7 +5125,7 @@ class Prism::ClassVariableWriteNode < ::Prism::Node
   #
   #     @@_test = :test # name `@@_test`
   #
-  # source://prism//lib/prism/node.rb#3887
+  # source://prism/lib/prism/node.rb#3887
   sig { returns(Symbol) }
   def name; end
 
@@ -5134,13 +5134,13 @@ class Prism::ClassVariableWriteNode < ::Prism::Node
   #     @@foo = :bar
   #     ^^^^^
   #
-  # source://prism//lib/prism/node.rb#3893
+  # source://prism/lib/prism/node.rb#3893
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#3919
+  # source://prism/lib/prism/node.rb#3919
   sig { returns(String) }
   def operator; end
 
@@ -5149,13 +5149,13 @@ class Prism::ClassVariableWriteNode < ::Prism::Node
   #     @@foo = :bar
   #           ^
   #
-  # source://prism//lib/prism/node.rb#3912
+  # source://prism/lib/prism/node.rb#3912
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#3929
+  # source://prism/lib/prism/node.rb#3929
   sig { override.returns(Symbol) }
   def type; end
 
@@ -5167,14 +5167,14 @@ class Prism::ClassVariableWriteNode < ::Prism::Node
   #     @@_xyz = 123
   #              ^^^
   #
-  # source://prism//lib/prism/node.rb#3906
+  # source://prism/lib/prism/node.rb#3906
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#3934
+    # source://prism/lib/prism/node.rb#3934
     def type; end
   end
 end
@@ -5193,49 +5193,49 @@ end
 #   introduce some kind of LRU cache to limit the number of entries, but this
 #   has not yet been implemented.
 #
-# source://prism//lib/prism/parse_result.rb#172
+# source://prism/lib/prism/parse_result.rb#172
 class Prism::CodeUnitsCache
   # Initialize a new cache with the given source and encoding.
   #
   # @return [CodeUnitsCache] a new instance of CodeUnitsCache
   #
-  # source://prism//lib/prism/parse_result.rb#198
+  # source://prism/lib/prism/parse_result.rb#198
   sig { params(source: String, encoding: Encoding).void }
   def initialize(source, encoding); end
 
   # Retrieve the code units offset from the given byte offset.
   #
-  # source://prism//lib/prism/parse_result.rb#212
+  # source://prism/lib/prism/parse_result.rb#212
   sig { params(byte_offset: Integer).returns(Integer) }
   def [](byte_offset); end
 end
 
-# source://prism//lib/prism/parse_result.rb#184
+# source://prism/lib/prism/parse_result.rb#184
 class Prism::CodeUnitsCache::LengthCounter
   # @return [LengthCounter] a new instance of LengthCounter
   #
-  # source://prism//lib/prism/parse_result.rb#185
+  # source://prism/lib/prism/parse_result.rb#185
   def initialize(source, encoding); end
 
-  # source://prism//lib/prism/parse_result.rb#190
+  # source://prism/lib/prism/parse_result.rb#190
   def count(byte_offset, byte_length); end
 end
 
-# source://prism//lib/prism/parse_result.rb#173
+# source://prism/lib/prism/parse_result.rb#173
 class Prism::CodeUnitsCache::UTF16Counter
   # @return [UTF16Counter] a new instance of UTF16Counter
   #
-  # source://prism//lib/prism/parse_result.rb#174
+  # source://prism/lib/prism/parse_result.rb#174
   def initialize(source, encoding); end
 
-  # source://prism//lib/prism/parse_result.rb#179
+  # source://prism/lib/prism/parse_result.rb#179
   def count(byte_offset, byte_length); end
 end
 
 # This represents a comment that was encountered during parsing. It is the
 # base class for all comment types.
 #
-# source://prism//lib/prism/parse_result.rb#507
+# source://prism/lib/prism/parse_result.rb#507
 class Prism::Comment
   abstract!
 
@@ -5243,25 +5243,25 @@ class Prism::Comment
   #
   # @return [Comment] a new instance of Comment
   #
-  # source://prism//lib/prism/parse_result.rb#512
+  # source://prism/lib/prism/parse_result.rb#512
   sig { params(location: Prism::Location).void }
   def initialize(location); end
 
   # Implement the hash pattern matching interface for Comment.
   #
-  # source://prism//lib/prism/parse_result.rb#517
+  # source://prism/lib/prism/parse_result.rb#517
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # The location of this comment in the source.
   #
-  # source://prism//lib/prism/parse_result.rb#509
+  # source://prism/lib/prism/parse_result.rb#509
   sig { returns(Prism::Location) }
   def location; end
 
   # Returns the content of the comment by slicing it from the source code.
   #
-  # source://prism//lib/prism/parse_result.rb#522
+  # source://prism/lib/prism/parse_result.rb#522
   sig { returns(String) }
   def slice; end
 
@@ -5286,930 +5286,930 @@ end
 #     Prism.parse("1 + 2").value.accept(SExpressions.new)
 #     # => [:program, [[[:call, [[:integer], [:arguments, [[:integer]]]]]]]]
 #
-# source://prism//lib/prism/compiler.rb#27
+# source://prism/lib/prism/compiler.rb#27
 class Prism::Compiler < ::Prism::Visitor
   # Visit an individual node.
   #
-  # source://prism//lib/prism/compiler.rb#29
+  # source://prism/lib/prism/compiler.rb#29
   sig { params(node: T.nilable(Prism::Node)).returns(T.untyped) }
   def visit(node); end
 
   # Visit the child nodes of the given node.
   # Compile a AliasGlobalVariableNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_alias_global_variable_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a AliasMethodNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_alias_method_node(node); end
 
   # Visit a list of nodes.
   #
-  # source://prism//lib/prism/compiler.rb#34
+  # source://prism/lib/prism/compiler.rb#34
   sig { params(nodes: T::Array[T.nilable(Prism::Node)]).returns(T::Array[T.untyped]) }
   def visit_all(nodes); end
 
   # Visit the child nodes of the given node.
   # Compile a AlternationPatternNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_alternation_pattern_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a AndNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_and_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ArgumentsNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_arguments_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ArrayNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_array_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ArrayPatternNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_array_pattern_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a AssocNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_assoc_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a AssocSplatNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_assoc_splat_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a BackReferenceReadNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_back_reference_read_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a BeginNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_begin_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a BlockArgumentNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_block_argument_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a BlockLocalVariableNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_block_local_variable_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a BlockNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_block_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a BlockParameterNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_block_parameter_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a BlockParametersNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_block_parameters_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a BreakNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_break_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a CallAndWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_call_and_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a CallNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_call_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a CallOperatorWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_call_operator_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a CallOrWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_call_or_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a CallTargetNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_call_target_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a CapturePatternNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_capture_pattern_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a CaseMatchNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_case_match_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a CaseNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_case_node(node); end
 
   # Visit the child nodes of the given node.
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   sig { params(node: Prism::Node).returns(T::Array[T.untyped]) }
   def visit_child_nodes(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ClassNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_class_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ClassVariableAndWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_class_variable_and_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ClassVariableOperatorWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_class_variable_operator_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ClassVariableOrWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_class_variable_or_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ClassVariableReadNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_class_variable_read_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ClassVariableTargetNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_class_variable_target_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ClassVariableWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_class_variable_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ConstantAndWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_constant_and_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ConstantOperatorWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_constant_operator_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ConstantOrWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_constant_or_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ConstantPathAndWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_constant_path_and_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ConstantPathNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_constant_path_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ConstantPathOperatorWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_constant_path_operator_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ConstantPathOrWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_constant_path_or_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ConstantPathTargetNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_constant_path_target_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ConstantPathWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_constant_path_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ConstantReadNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_constant_read_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ConstantTargetNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_constant_target_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ConstantWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_constant_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a DefNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_def_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a DefinedNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_defined_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ElseNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_else_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a EmbeddedStatementsNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_embedded_statements_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a EmbeddedVariableNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_embedded_variable_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a EnsureNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_ensure_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a FalseNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_false_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a FindPatternNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_find_pattern_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a FlipFlopNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_flip_flop_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a FloatNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_float_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ForNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_for_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ForwardingArgumentsNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_forwarding_arguments_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ForwardingParameterNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_forwarding_parameter_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ForwardingSuperNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_forwarding_super_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a GlobalVariableAndWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_global_variable_and_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a GlobalVariableOperatorWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_global_variable_operator_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a GlobalVariableOrWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_global_variable_or_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a GlobalVariableReadNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_global_variable_read_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a GlobalVariableTargetNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_global_variable_target_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a GlobalVariableWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_global_variable_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a HashNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_hash_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a HashPatternNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_hash_pattern_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a IfNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_if_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ImaginaryNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_imaginary_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ImplicitNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_implicit_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ImplicitRestNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_implicit_rest_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a InNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_in_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a IndexAndWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_index_and_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a IndexOperatorWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_index_operator_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a IndexOrWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_index_or_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a IndexTargetNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_index_target_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a InstanceVariableAndWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_instance_variable_and_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a InstanceVariableOperatorWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_instance_variable_operator_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a InstanceVariableOrWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_instance_variable_or_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a InstanceVariableReadNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_instance_variable_read_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a InstanceVariableTargetNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_instance_variable_target_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a InstanceVariableWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_instance_variable_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a IntegerNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_integer_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a InterpolatedMatchLastLineNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_interpolated_match_last_line_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a InterpolatedRegularExpressionNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_interpolated_regular_expression_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a InterpolatedStringNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_interpolated_string_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a InterpolatedSymbolNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_interpolated_symbol_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a InterpolatedXStringNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_interpolated_x_string_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ItLocalVariableReadNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_it_local_variable_read_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ItParametersNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_it_parameters_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a KeywordHashNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_keyword_hash_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a KeywordRestParameterNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_keyword_rest_parameter_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a LambdaNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_lambda_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a LocalVariableAndWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_local_variable_and_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a LocalVariableOperatorWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_local_variable_operator_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a LocalVariableOrWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_local_variable_or_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a LocalVariableReadNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_local_variable_read_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a LocalVariableTargetNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_local_variable_target_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a LocalVariableWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_local_variable_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a MatchLastLineNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_match_last_line_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a MatchPredicateNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_match_predicate_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a MatchRequiredNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_match_required_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a MatchWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_match_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a MissingNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_missing_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ModuleNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_module_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a MultiTargetNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_multi_target_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a MultiWriteNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_multi_write_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a NextNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_next_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a NilNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_nil_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a NoKeywordsParameterNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_no_keywords_parameter_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a NumberedParametersNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_numbered_parameters_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a NumberedReferenceReadNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_numbered_reference_read_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a OptionalKeywordParameterNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_optional_keyword_parameter_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a OptionalParameterNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_optional_parameter_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a OrNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_or_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ParametersNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_parameters_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ParenthesesNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_parentheses_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a PinnedExpressionNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_pinned_expression_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a PinnedVariableNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_pinned_variable_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a PostExecutionNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_post_execution_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a PreExecutionNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_pre_execution_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ProgramNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_program_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a RangeNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_range_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a RationalNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_rational_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a RedoNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_redo_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a RegularExpressionNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_regular_expression_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a RequiredKeywordParameterNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_required_keyword_parameter_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a RequiredParameterNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_required_parameter_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a RescueModifierNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_rescue_modifier_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a RescueNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_rescue_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a RestParameterNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_rest_parameter_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a RetryNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_retry_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ReturnNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_return_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a SelfNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_self_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a ShareableConstantNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_shareable_constant_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a SingletonClassNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_singleton_class_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a SourceEncodingNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_source_encoding_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a SourceFileNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_source_file_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a SourceLineNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_source_line_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a SplatNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_splat_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a StatementsNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_statements_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a StringNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_string_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a SuperNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_super_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a SymbolNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_symbol_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a TrueNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_true_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a UndefNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_undef_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a UnlessNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_unless_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a UntilNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_until_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a WhenNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_when_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a WhileNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_while_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a XStringNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_x_string_node(node); end
 
   # Visit the child nodes of the given node.
   # Compile a YieldNode node
   #
-  # source://prism//lib/prism/compiler.rb#39
+  # source://prism/lib/prism/compiler.rb#39
   def visit_yield_node(node); end
 end
 
@@ -6218,13 +6218,13 @@ end
 #     Target &&= value
 #     ^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#3953
+# source://prism/lib/prism/node.rb#3953
 class Prism::ConstantAndWriteNode < ::Prism::Node
   # Initialize a new ConstantAndWriteNode node.
   #
   # @return [ConstantAndWriteNode] a new instance of ConstantAndWriteNode
   #
-  # source://prism//lib/prism/node.rb#3955
+  # source://prism/lib/prism/node.rb#3955
   sig do
     params(
       source: Prism::Source,
@@ -6242,36 +6242,36 @@ class Prism::ConstantAndWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#4041
+  # source://prism/lib/prism/node.rb#4041
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#3967
+  # source://prism/lib/prism/node.rb#3967
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3972
+  # source://prism/lib/prism/node.rb#3972
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#3982
+  # source://prism/lib/prism/node.rb#3982
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#3977
+  # source://prism/lib/prism/node.rb#3977
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> ConstantAndWriteNode
   #
-  # source://prism//lib/prism/node.rb#3987
+  # source://prism/lib/prism/node.rb#3987
   sig do
     params(
       node_id: Integer,
@@ -6288,17 +6288,17 @@ class Prism::ConstantAndWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#3972
+  # source://prism/lib/prism/node.rb#3972
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#3995
+  # source://prism/lib/prism/node.rb#3995
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
-  # source://prism//lib/prism/desugar_compiler.rb#182
+  # source://prism/lib/prism/desugar_compiler.rb#182
   def desugar; end
 
   sig { override.returns(T::Array[Prism::Reflection::Field]) }
@@ -6306,50 +6306,50 @@ class Prism::ConstantAndWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#4025
+  # source://prism/lib/prism/node.rb#4025
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#4000
+  # source://prism/lib/prism/node.rb#4000
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#4003
+  # source://prism/lib/prism/node.rb#4003
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#4020
+  # source://prism/lib/prism/node.rb#4020
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#4010
+  # source://prism/lib/prism/node.rb#4010
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#4030
+  # source://prism/lib/prism/node.rb#4030
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#4017
+  # source://prism/lib/prism/node.rb#4017
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#4035
+    # source://prism/lib/prism/node.rb#4035
     def type; end
   end
 end
@@ -6359,13 +6359,13 @@ end
 #     Target += value
 #     ^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#4054
+# source://prism/lib/prism/node.rb#4054
 class Prism::ConstantOperatorWriteNode < ::Prism::Node
   # Initialize a new ConstantOperatorWriteNode node.
   #
   # @return [ConstantOperatorWriteNode] a new instance of ConstantOperatorWriteNode
   #
-  # source://prism//lib/prism/node.rb#4056
+  # source://prism/lib/prism/node.rb#4056
   sig do
     params(
       source: Prism::Source,
@@ -6384,48 +6384,48 @@ class Prism::ConstantOperatorWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#4141
+  # source://prism/lib/prism/node.rb#4141
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#4069
+  # source://prism/lib/prism/node.rb#4069
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader binary_operator: Symbol
   #
-  # source://prism//lib/prism/node.rb#4122
+  # source://prism/lib/prism/node.rb#4122
   sig { returns(Symbol) }
   def binary_operator; end
 
   # attr_reader binary_operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#4112
+  # source://prism/lib/prism/node.rb#4112
   sig { returns(Prism::Location) }
   def binary_operator_loc; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4074
+  # source://prism/lib/prism/node.rb#4074
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#4084
+  # source://prism/lib/prism/node.rb#4084
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#4079
+  # source://prism/lib/prism/node.rb#4079
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol) -> ConstantOperatorWriteNode
   #
-  # source://prism//lib/prism/node.rb#4089
+  # source://prism/lib/prism/node.rb#4089
   sig do
     params(
       node_id: Integer,
@@ -6443,17 +6443,17 @@ class Prism::ConstantOperatorWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4074
+  # source://prism/lib/prism/node.rb#4074
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol }
   #
-  # source://prism//lib/prism/node.rb#4097
+  # source://prism/lib/prism/node.rb#4097
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
-  # source://prism//lib/prism/desugar_compiler.rb#194
+  # source://prism/lib/prism/desugar_compiler.rb#194
   def desugar; end
 
   sig { override.returns(T::Array[Prism::Reflection::Field]) }
@@ -6461,50 +6461,50 @@ class Prism::ConstantOperatorWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#4125
+  # source://prism/lib/prism/node.rb#4125
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#4102
+  # source://prism/lib/prism/node.rb#4102
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#4105
+  # source://prism/lib/prism/node.rb#4105
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # Returns the binary operator used to modify the receiver. This method is
   # deprecated in favor of #binary_operator.
   #
-  # source://prism//lib/prism/node_ext.rb#371
+  # source://prism/lib/prism/node_ext.rb#371
   def operator; end
 
   # Returns the location of the binary operator used to modify the receiver.
   # This method is deprecated in favor of #binary_operator_loc.
   #
-  # source://prism//lib/prism/node_ext.rb#378
+  # source://prism/lib/prism/node_ext.rb#378
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#4130
+  # source://prism/lib/prism/node.rb#4130
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#4119
+  # source://prism/lib/prism/node.rb#4119
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#4135
+    # source://prism/lib/prism/node.rb#4135
     def type; end
   end
 end
@@ -6514,13 +6514,13 @@ end
 #     Target ||= value
 #     ^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#4155
+# source://prism/lib/prism/node.rb#4155
 class Prism::ConstantOrWriteNode < ::Prism::Node
   # Initialize a new ConstantOrWriteNode node.
   #
   # @return [ConstantOrWriteNode] a new instance of ConstantOrWriteNode
   #
-  # source://prism//lib/prism/node.rb#4157
+  # source://prism/lib/prism/node.rb#4157
   sig do
     params(
       source: Prism::Source,
@@ -6538,36 +6538,36 @@ class Prism::ConstantOrWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#4243
+  # source://prism/lib/prism/node.rb#4243
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#4169
+  # source://prism/lib/prism/node.rb#4169
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4174
+  # source://prism/lib/prism/node.rb#4174
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#4184
+  # source://prism/lib/prism/node.rb#4184
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#4179
+  # source://prism/lib/prism/node.rb#4179
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> ConstantOrWriteNode
   #
-  # source://prism//lib/prism/node.rb#4189
+  # source://prism/lib/prism/node.rb#4189
   sig do
     params(
       node_id: Integer,
@@ -6584,17 +6584,17 @@ class Prism::ConstantOrWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4174
+  # source://prism/lib/prism/node.rb#4174
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#4197
+  # source://prism/lib/prism/node.rb#4197
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
-  # source://prism//lib/prism/desugar_compiler.rb#188
+  # source://prism/lib/prism/desugar_compiler.rb#188
   def desugar; end
 
   sig { override.returns(T::Array[Prism::Reflection::Field]) }
@@ -6602,50 +6602,50 @@ class Prism::ConstantOrWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#4227
+  # source://prism/lib/prism/node.rb#4227
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#4202
+  # source://prism/lib/prism/node.rb#4202
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#4205
+  # source://prism/lib/prism/node.rb#4205
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#4222
+  # source://prism/lib/prism/node.rb#4222
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#4212
+  # source://prism/lib/prism/node.rb#4212
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#4232
+  # source://prism/lib/prism/node.rb#4232
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#4219
+  # source://prism/lib/prism/node.rb#4219
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#4237
+    # source://prism/lib/prism/node.rb#4237
     def type; end
   end
 end
@@ -6655,13 +6655,13 @@ end
 #     Parent::Child &&= value
 #     ^^^^^^^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#4256
+# source://prism/lib/prism/node.rb#4256
 class Prism::ConstantPathAndWriteNode < ::Prism::Node
   # Initialize a new ConstantPathAndWriteNode node.
   #
   # @return [ConstantPathAndWriteNode] a new instance of ConstantPathAndWriteNode
   #
-  # source://prism//lib/prism/node.rb#4258
+  # source://prism/lib/prism/node.rb#4258
   sig do
     params(
       source: Prism::Source,
@@ -6678,36 +6678,36 @@ class Prism::ConstantPathAndWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#4336
+  # source://prism/lib/prism/node.rb#4336
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#4269
+  # source://prism/lib/prism/node.rb#4269
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4274
+  # source://prism/lib/prism/node.rb#4274
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#4284
+  # source://prism/lib/prism/node.rb#4284
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#4279
+  # source://prism/lib/prism/node.rb#4279
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?target: ConstantPathNode, ?operator_loc: Location, ?value: Prism::node) -> ConstantPathAndWriteNode
   #
-  # source://prism//lib/prism/node.rb#4289
+  # source://prism/lib/prism/node.rb#4289
   sig do
     params(
       node_id: Integer,
@@ -6723,13 +6723,13 @@ class Prism::ConstantPathAndWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4274
+  # source://prism/lib/prism/node.rb#4274
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, target: ConstantPathNode, operator_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#4297
+  # source://prism/lib/prism/node.rb#4297
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -6738,44 +6738,44 @@ class Prism::ConstantPathAndWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#4320
+  # source://prism/lib/prism/node.rb#4320
   sig { override.returns(String) }
   def inspect; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#4315
+  # source://prism/lib/prism/node.rb#4315
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#4305
+  # source://prism/lib/prism/node.rb#4305
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # attr_reader target: ConstantPathNode
   #
-  # source://prism//lib/prism/node.rb#4302
+  # source://prism/lib/prism/node.rb#4302
   sig { returns(Prism::ConstantPathNode) }
   def target; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#4325
+  # source://prism/lib/prism/node.rb#4325
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#4312
+  # source://prism/lib/prism/node.rb#4312
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#4330
+    # source://prism/lib/prism/node.rb#4330
     def type; end
   end
 end
@@ -6785,13 +6785,13 @@ end
 #     Foo::Bar
 #     ^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#4348
+# source://prism/lib/prism/node.rb#4348
 class Prism::ConstantPathNode < ::Prism::Node
   # Initialize a new ConstantPathNode node.
   #
   # @return [ConstantPathNode] a new instance of ConstantPathNode
   #
-  # source://prism//lib/prism/node.rb#4350
+  # source://prism/lib/prism/node.rb#4350
   sig do
     params(
       source: Prism::Source,
@@ -6809,12 +6809,12 @@ class Prism::ConstantPathNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#4459
+  # source://prism/lib/prism/node.rb#4459
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#4362
+  # source://prism/lib/prism/node.rb#4362
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
@@ -6822,30 +6822,30 @@ class Prism::ConstantPathNode < ::Prism::Node
   # constant read or a missing node. To not cause a breaking change, we
   # continue to supply that API.
   #
-  # source://prism//lib/prism/node_ext.rb#202
+  # source://prism/lib/prism/node_ext.rb#202
   def child; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4367
+  # source://prism/lib/prism/node.rb#4367
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#4379
+  # source://prism/lib/prism/node.rb#4379
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#4372
+  # source://prism/lib/prism/node.rb#4372
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?parent: Prism::node?, ?name: Symbol?, ?delimiter_loc: Location, ?name_loc: Location) -> ConstantPathNode
   #
-  # source://prism//lib/prism/node.rb#4384
+  # source://prism/lib/prism/node.rb#4384
   sig do
     params(
       node_id: Integer,
@@ -6862,19 +6862,19 @@ class Prism::ConstantPathNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4367
+  # source://prism/lib/prism/node.rb#4367
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, parent: Prism::node?, name: Symbol?, delimiter_loc: Location, name_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#4392
+  # source://prism/lib/prism/node.rb#4392
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # def delimiter: () -> String
   #
-  # source://prism//lib/prism/node.rb#4438
+  # source://prism/lib/prism/node.rb#4438
   sig { returns(String) }
   def delimiter; end
 
@@ -6886,7 +6886,7 @@ class Prism::ConstantPathNode < ::Prism::Node
   #     One::Two
   #        ^^
   #
-  # source://prism//lib/prism/node.rb#4418
+  # source://prism/lib/prism/node.rb#4418
   sig { returns(Prism::Location) }
   def delimiter_loc; end
 
@@ -6895,26 +6895,26 @@ class Prism::ConstantPathNode < ::Prism::Node
 
   # Returns the full name of this constant path. For example: "Foo::Bar"
   #
-  # source://prism//lib/prism/node_ext.rb#195
+  # source://prism/lib/prism/node_ext.rb#195
   sig { returns(String) }
   def full_name; end
 
   # Returns the list of parts for the full name of this constant path.
   # For example: [:Foo, :Bar]
   #
-  # source://prism//lib/prism/node_ext.rb#173
+  # source://prism/lib/prism/node_ext.rb#173
   sig { returns(T::Array[Symbol]) }
   def full_name_parts; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#4443
+  # source://prism/lib/prism/node.rb#4443
   sig { override.returns(String) }
   def inspect; end
 
   # The name of the constant being accessed. This could be `nil` in the event of a syntax error.
   #
-  # source://prism//lib/prism/node.rb#4409
+  # source://prism/lib/prism/node.rb#4409
   sig { returns(T.nilable(Symbol)) }
   def name; end
 
@@ -6926,7 +6926,7 @@ class Prism::ConstantPathNode < ::Prism::Node
   #     One::Two
   #          ^^^
   #
-  # source://prism//lib/prism/node.rb#4431
+  # source://prism/lib/prism/node.rb#4431
   sig { returns(Prism::Location) }
   def name_loc; end
 
@@ -6941,20 +6941,20 @@ class Prism::ConstantPathNode < ::Prism::Node
   #     a.b::C
   #     ^^^
   #
-  # source://prism//lib/prism/node.rb#4406
+  # source://prism/lib/prism/node.rb#4406
   sig { returns(T.nilable(Prism::Node)) }
   def parent; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#4448
+  # source://prism/lib/prism/node.rb#4448
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#4453
+    # source://prism/lib/prism/node.rb#4453
     def type; end
   end
 end
@@ -6966,14 +6966,14 @@ end
 # var::Bar::Baz -> raises because the first part of the constant path is a
 # local variable
 #
-# source://prism//lib/prism/node_ext.rb#164
+# source://prism/lib/prism/node_ext.rb#164
 class Prism::ConstantPathNode::DynamicPartsInConstantPathError < ::StandardError; end
 
 # An error class raised when missing nodes are found while computing a
 # constant path's full name. For example:
 # Foo:: -> raises because the constant path is missing the last part
 #
-# source://prism//lib/prism/node_ext.rb#169
+# source://prism/lib/prism/node_ext.rb#169
 class Prism::ConstantPathNode::MissingNodesInConstantPathError < ::StandardError; end
 
 # Represents assigning to a constant path using an operator that isn't `=`.
@@ -6981,13 +6981,13 @@ class Prism::ConstantPathNode::MissingNodesInConstantPathError < ::StandardError
 #     Parent::Child += value
 #     ^^^^^^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#4472
+# source://prism/lib/prism/node.rb#4472
 class Prism::ConstantPathOperatorWriteNode < ::Prism::Node
   # Initialize a new ConstantPathOperatorWriteNode node.
   #
   # @return [ConstantPathOperatorWriteNode] a new instance of ConstantPathOperatorWriteNode
   #
-  # source://prism//lib/prism/node.rb#4474
+  # source://prism/lib/prism/node.rb#4474
   sig do
     params(
       source: Prism::Source,
@@ -7005,48 +7005,48 @@ class Prism::ConstantPathOperatorWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#4551
+  # source://prism/lib/prism/node.rb#4551
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#4486
+  # source://prism/lib/prism/node.rb#4486
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader binary_operator: Symbol
   #
-  # source://prism//lib/prism/node.rb#4532
+  # source://prism/lib/prism/node.rb#4532
   sig { returns(Symbol) }
   def binary_operator; end
 
   # attr_reader binary_operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#4522
+  # source://prism/lib/prism/node.rb#4522
   sig { returns(Prism::Location) }
   def binary_operator_loc; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4491
+  # source://prism/lib/prism/node.rb#4491
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#4501
+  # source://prism/lib/prism/node.rb#4501
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#4496
+  # source://prism/lib/prism/node.rb#4496
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?target: ConstantPathNode, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol) -> ConstantPathOperatorWriteNode
   #
-  # source://prism//lib/prism/node.rb#4506
+  # source://prism/lib/prism/node.rb#4506
   sig do
     params(
       node_id: Integer,
@@ -7063,13 +7063,13 @@ class Prism::ConstantPathOperatorWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4491
+  # source://prism/lib/prism/node.rb#4491
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, target: ConstantPathNode, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol }
   #
-  # source://prism//lib/prism/node.rb#4514
+  # source://prism/lib/prism/node.rb#4514
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -7078,44 +7078,44 @@ class Prism::ConstantPathOperatorWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#4535
+  # source://prism/lib/prism/node.rb#4535
   sig { override.returns(String) }
   def inspect; end
 
   # Returns the binary operator used to modify the receiver. This method is
   # deprecated in favor of #binary_operator.
   #
-  # source://prism//lib/prism/node_ext.rb#387
+  # source://prism/lib/prism/node_ext.rb#387
   def operator; end
 
   # Returns the location of the binary operator used to modify the receiver.
   # This method is deprecated in favor of #binary_operator_loc.
   #
-  # source://prism//lib/prism/node_ext.rb#394
+  # source://prism/lib/prism/node_ext.rb#394
   def operator_loc; end
 
   # attr_reader target: ConstantPathNode
   #
-  # source://prism//lib/prism/node.rb#4519
+  # source://prism/lib/prism/node.rb#4519
   sig { returns(Prism::ConstantPathNode) }
   def target; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#4540
+  # source://prism/lib/prism/node.rb#4540
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#4529
+  # source://prism/lib/prism/node.rb#4529
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#4545
+    # source://prism/lib/prism/node.rb#4545
     def type; end
   end
 end
@@ -7125,13 +7125,13 @@ end
 #     Parent::Child ||= value
 #     ^^^^^^^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#4564
+# source://prism/lib/prism/node.rb#4564
 class Prism::ConstantPathOrWriteNode < ::Prism::Node
   # Initialize a new ConstantPathOrWriteNode node.
   #
   # @return [ConstantPathOrWriteNode] a new instance of ConstantPathOrWriteNode
   #
-  # source://prism//lib/prism/node.rb#4566
+  # source://prism/lib/prism/node.rb#4566
   sig do
     params(
       source: Prism::Source,
@@ -7148,36 +7148,36 @@ class Prism::ConstantPathOrWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#4644
+  # source://prism/lib/prism/node.rb#4644
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#4577
+  # source://prism/lib/prism/node.rb#4577
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4582
+  # source://prism/lib/prism/node.rb#4582
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#4592
+  # source://prism/lib/prism/node.rb#4592
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#4587
+  # source://prism/lib/prism/node.rb#4587
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?target: ConstantPathNode, ?operator_loc: Location, ?value: Prism::node) -> ConstantPathOrWriteNode
   #
-  # source://prism//lib/prism/node.rb#4597
+  # source://prism/lib/prism/node.rb#4597
   sig do
     params(
       node_id: Integer,
@@ -7193,13 +7193,13 @@ class Prism::ConstantPathOrWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4582
+  # source://prism/lib/prism/node.rb#4582
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, target: ConstantPathNode, operator_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#4605
+  # source://prism/lib/prism/node.rb#4605
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -7208,44 +7208,44 @@ class Prism::ConstantPathOrWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#4628
+  # source://prism/lib/prism/node.rb#4628
   sig { override.returns(String) }
   def inspect; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#4623
+  # source://prism/lib/prism/node.rb#4623
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#4613
+  # source://prism/lib/prism/node.rb#4613
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # attr_reader target: ConstantPathNode
   #
-  # source://prism//lib/prism/node.rb#4610
+  # source://prism/lib/prism/node.rb#4610
   sig { returns(Prism::ConstantPathNode) }
   def target; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#4633
+  # source://prism/lib/prism/node.rb#4633
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#4620
+  # source://prism/lib/prism/node.rb#4620
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#4638
+    # source://prism/lib/prism/node.rb#4638
     def type; end
   end
 end
@@ -7255,13 +7255,13 @@ end
 #     Foo::Foo, Bar::Bar = baz
 #     ^^^^^^^^  ^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#4656
+# source://prism/lib/prism/node.rb#4656
 class Prism::ConstantPathTargetNode < ::Prism::Node
   # Initialize a new ConstantPathTargetNode node.
   #
   # @return [ConstantPathTargetNode] a new instance of ConstantPathTargetNode
   #
-  # source://prism//lib/prism/node.rb#4658
+  # source://prism/lib/prism/node.rb#4658
   sig do
     params(
       source: Prism::Source,
@@ -7279,12 +7279,12 @@ class Prism::ConstantPathTargetNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#4746
+  # source://prism/lib/prism/node.rb#4746
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#4670
+  # source://prism/lib/prism/node.rb#4670
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
@@ -7292,30 +7292,30 @@ class Prism::ConstantPathTargetNode < ::Prism::Node
   # constant read or a missing node. To not cause a breaking change, we
   # continue to supply that API.
   #
-  # source://prism//lib/prism/node_ext.rb#243
+  # source://prism/lib/prism/node_ext.rb#243
   def child; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4675
+  # source://prism/lib/prism/node.rb#4675
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#4687
+  # source://prism/lib/prism/node.rb#4687
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#4680
+  # source://prism/lib/prism/node.rb#4680
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?parent: Prism::node?, ?name: Symbol?, ?delimiter_loc: Location, ?name_loc: Location) -> ConstantPathTargetNode
   #
-  # source://prism//lib/prism/node.rb#4692
+  # source://prism/lib/prism/node.rb#4692
   sig do
     params(
       node_id: Integer,
@@ -7332,25 +7332,25 @@ class Prism::ConstantPathTargetNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4675
+  # source://prism/lib/prism/node.rb#4675
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, parent: Prism::node?, name: Symbol?, delimiter_loc: Location, name_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#4700
+  # source://prism/lib/prism/node.rb#4700
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # def delimiter: () -> String
   #
-  # source://prism//lib/prism/node.rb#4725
+  # source://prism/lib/prism/node.rb#4725
   sig { returns(String) }
   def delimiter; end
 
   # attr_reader delimiter_loc: Location
   #
-  # source://prism//lib/prism/node.rb#4711
+  # source://prism/lib/prism/node.rb#4711
   sig { returns(Prism::Location) }
   def delimiter_loc; end
 
@@ -7359,51 +7359,51 @@ class Prism::ConstantPathTargetNode < ::Prism::Node
 
   # Returns the full name of this constant path. For example: "Foo::Bar"
   #
-  # source://prism//lib/prism/node_ext.rb#236
+  # source://prism/lib/prism/node_ext.rb#236
   sig { returns(String) }
   def full_name; end
 
   # Returns the list of parts for the full name of this constant path.
   # For example: [:Foo, :Bar]
   #
-  # source://prism//lib/prism/node_ext.rb#216
+  # source://prism/lib/prism/node_ext.rb#216
   sig { returns(T::Array[Symbol]) }
   def full_name_parts; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#4730
+  # source://prism/lib/prism/node.rb#4730
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol?
   #
-  # source://prism//lib/prism/node.rb#4708
+  # source://prism/lib/prism/node.rb#4708
   sig { returns(T.nilable(Symbol)) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#4718
+  # source://prism/lib/prism/node.rb#4718
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # attr_reader parent: Prism::node?
   #
-  # source://prism//lib/prism/node.rb#4705
+  # source://prism/lib/prism/node.rb#4705
   sig { returns(T.nilable(Prism::Node)) }
   def parent; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#4735
+  # source://prism/lib/prism/node.rb#4735
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#4740
+    # source://prism/lib/prism/node.rb#4740
     def type; end
   end
 end
@@ -7419,13 +7419,13 @@ end
 #     ::Foo::Bar = 1
 #     ^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#4765
+# source://prism/lib/prism/node.rb#4765
 class Prism::ConstantPathWriteNode < ::Prism::Node
   # Initialize a new ConstantPathWriteNode node.
   #
   # @return [ConstantPathWriteNode] a new instance of ConstantPathWriteNode
   #
-  # source://prism//lib/prism/node.rb#4767
+  # source://prism/lib/prism/node.rb#4767
   sig do
     params(
       source: Prism::Source,
@@ -7442,36 +7442,36 @@ class Prism::ConstantPathWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#4857
+  # source://prism/lib/prism/node.rb#4857
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#4778
+  # source://prism/lib/prism/node.rb#4778
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4783
+  # source://prism/lib/prism/node.rb#4783
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#4793
+  # source://prism/lib/prism/node.rb#4793
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#4788
+  # source://prism/lib/prism/node.rb#4788
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?target: ConstantPathNode, ?operator_loc: Location, ?value: Prism::node) -> ConstantPathWriteNode
   #
-  # source://prism//lib/prism/node.rb#4798
+  # source://prism/lib/prism/node.rb#4798
   sig do
     params(
       node_id: Integer,
@@ -7487,13 +7487,13 @@ class Prism::ConstantPathWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4783
+  # source://prism/lib/prism/node.rb#4783
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, target: ConstantPathNode, operator_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#4806
+  # source://prism/lib/prism/node.rb#4806
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -7502,13 +7502,13 @@ class Prism::ConstantPathWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#4841
+  # source://prism/lib/prism/node.rb#4841
   sig { override.returns(String) }
   def inspect; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#4836
+  # source://prism/lib/prism/node.rb#4836
   sig { returns(String) }
   def operator; end
 
@@ -7517,7 +7517,7 @@ class Prism::ConstantPathWriteNode < ::Prism::Node
   #     ::ABC = 123
   #           ^
   #
-  # source://prism//lib/prism/node.rb#4823
+  # source://prism/lib/prism/node.rb#4823
   sig { returns(Prism::Location) }
   def operator_loc; end
 
@@ -7529,13 +7529,13 @@ class Prism::ConstantPathWriteNode < ::Prism::Node
   #     ::Foo = :abc
   #     ^^^^^
   #
-  # source://prism//lib/prism/node.rb#4817
+  # source://prism/lib/prism/node.rb#4817
   sig { returns(Prism::ConstantPathNode) }
   def target; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#4846
+  # source://prism/lib/prism/node.rb#4846
   sig { override.returns(Symbol) }
   def type; end
 
@@ -7544,14 +7544,14 @@ class Prism::ConstantPathWriteNode < ::Prism::Node
   #     FOO::BAR = :abc
   #                ^^^^
   #
-  # source://prism//lib/prism/node.rb#4833
+  # source://prism/lib/prism/node.rb#4833
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#4851
+    # source://prism/lib/prism/node.rb#4851
     def type; end
   end
 end
@@ -7561,49 +7561,49 @@ end
 #     Foo
 #     ^^^
 #
-# source://prism//lib/prism/node.rb#4869
+# source://prism/lib/prism/node.rb#4869
 class Prism::ConstantReadNode < ::Prism::Node
   # Initialize a new ConstantReadNode node.
   #
   # @return [ConstantReadNode] a new instance of ConstantReadNode
   #
-  # source://prism//lib/prism/node.rb#4871
+  # source://prism/lib/prism/node.rb#4871
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
   def initialize(source, node_id, location, flags, name); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#4936
+  # source://prism/lib/prism/node.rb#4936
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#4880
+  # source://prism/lib/prism/node.rb#4880
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4885
+  # source://prism/lib/prism/node.rb#4885
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#4895
+  # source://prism/lib/prism/node.rb#4895
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#4890
+  # source://prism/lib/prism/node.rb#4890
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> ConstantReadNode
   #
-  # source://prism//lib/prism/node.rb#4900
+  # source://prism/lib/prism/node.rb#4900
   sig do
     params(
       node_id: Integer,
@@ -7617,13 +7617,13 @@ class Prism::ConstantReadNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4885
+  # source://prism/lib/prism/node.rb#4885
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
   #
-  # source://prism//lib/prism/node.rb#4908
+  # source://prism/lib/prism/node.rb#4908
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -7632,20 +7632,20 @@ class Prism::ConstantReadNode < ::Prism::Node
 
   # Returns the full name of this constant. For example: "Foo"
   #
-  # source://prism//lib/prism/node_ext.rb#139
+  # source://prism/lib/prism/node_ext.rb#139
   sig { returns(String) }
   def full_name; end
 
   # Returns the list of parts for the full name of this constant.
   # For example: [:Foo]
   #
-  # source://prism//lib/prism/node_ext.rb#134
+  # source://prism/lib/prism/node_ext.rb#134
   sig { returns(T::Array[Symbol]) }
   def full_name_parts; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#4920
+  # source://prism/lib/prism/node.rb#4920
   sig { override.returns(String) }
   def inspect; end
 
@@ -7655,20 +7655,20 @@ class Prism::ConstantReadNode < ::Prism::Node
   #
   #     SOME_CONSTANT  # name `:SOME_CONSTANT`
   #
-  # source://prism//lib/prism/node.rb#4917
+  # source://prism/lib/prism/node.rb#4917
   sig { returns(Symbol) }
   def name; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#4925
+  # source://prism/lib/prism/node.rb#4925
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#4930
+    # source://prism/lib/prism/node.rb#4930
     def type; end
   end
 end
@@ -7678,49 +7678,49 @@ end
 #     Foo, Bar = baz
 #     ^^^  ^^^
 #
-# source://prism//lib/prism/node.rb#4946
+# source://prism/lib/prism/node.rb#4946
 class Prism::ConstantTargetNode < ::Prism::Node
   # Initialize a new ConstantTargetNode node.
   #
   # @return [ConstantTargetNode] a new instance of ConstantTargetNode
   #
-  # source://prism//lib/prism/node.rb#4948
+  # source://prism/lib/prism/node.rb#4948
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
   def initialize(source, node_id, location, flags, name); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#5009
+  # source://prism/lib/prism/node.rb#5009
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#4957
+  # source://prism/lib/prism/node.rb#4957
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4962
+  # source://prism/lib/prism/node.rb#4962
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#4972
+  # source://prism/lib/prism/node.rb#4972
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#4967
+  # source://prism/lib/prism/node.rb#4967
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> ConstantTargetNode
   #
-  # source://prism//lib/prism/node.rb#4977
+  # source://prism/lib/prism/node.rb#4977
   sig do
     params(
       node_id: Integer,
@@ -7734,13 +7734,13 @@ class Prism::ConstantTargetNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#4962
+  # source://prism/lib/prism/node.rb#4962
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
   #
-  # source://prism//lib/prism/node.rb#4985
+  # source://prism/lib/prism/node.rb#4985
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -7749,39 +7749,39 @@ class Prism::ConstantTargetNode < ::Prism::Node
 
   # Returns the full name of this constant. For example: "Foo"
   #
-  # source://prism//lib/prism/node_ext.rb#262
+  # source://prism/lib/prism/node_ext.rb#262
   sig { returns(String) }
   def full_name; end
 
   # Returns the list of parts for the full name of this constant.
   # For example: [:Foo]
   #
-  # source://prism//lib/prism/node_ext.rb#257
+  # source://prism/lib/prism/node_ext.rb#257
   sig { returns(T::Array[Symbol]) }
   def full_name_parts; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#4993
+  # source://prism/lib/prism/node.rb#4993
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#4990
+  # source://prism/lib/prism/node.rb#4990
   sig { returns(Symbol) }
   def name; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#4998
+  # source://prism/lib/prism/node.rb#4998
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#5003
+    # source://prism/lib/prism/node.rb#5003
     def type; end
   end
 end
@@ -7791,13 +7791,13 @@ end
 #     Foo = 1
 #     ^^^^^^^
 #
-# source://prism//lib/prism/node.rb#5019
+# source://prism/lib/prism/node.rb#5019
 class Prism::ConstantWriteNode < ::Prism::Node
   # Initialize a new ConstantWriteNode node.
   #
   # @return [ConstantWriteNode] a new instance of ConstantWriteNode
   #
-  # source://prism//lib/prism/node.rb#5021
+  # source://prism/lib/prism/node.rb#5021
   sig do
     params(
       source: Prism::Source,
@@ -7815,36 +7815,36 @@ class Prism::ConstantWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#5123
+  # source://prism/lib/prism/node.rb#5123
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#5033
+  # source://prism/lib/prism/node.rb#5033
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#5038
+  # source://prism/lib/prism/node.rb#5038
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#5048
+  # source://prism/lib/prism/node.rb#5048
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#5043
+  # source://prism/lib/prism/node.rb#5043
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location) -> ConstantWriteNode
   #
-  # source://prism//lib/prism/node.rb#5053
+  # source://prism/lib/prism/node.rb#5053
   sig do
     params(
       node_id: Integer,
@@ -7861,13 +7861,13 @@ class Prism::ConstantWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#5038
+  # source://prism/lib/prism/node.rb#5038
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#5061
+  # source://prism/lib/prism/node.rb#5061
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -7876,20 +7876,20 @@ class Prism::ConstantWriteNode < ::Prism::Node
 
   # Returns the full name of this constant. For example: "Foo"
   #
-  # source://prism//lib/prism/node_ext.rb#152
+  # source://prism/lib/prism/node_ext.rb#152
   sig { returns(String) }
   def full_name; end
 
   # Returns the list of parts for the full name of this constant.
   # For example: [:Foo]
   #
-  # source://prism//lib/prism/node_ext.rb#147
+  # source://prism/lib/prism/node_ext.rb#147
   sig { returns(T::Array[Symbol]) }
   def full_name_parts; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#5107
+  # source://prism/lib/prism/node.rb#5107
   sig { override.returns(String) }
   def inspect; end
 
@@ -7899,7 +7899,7 @@ class Prism::ConstantWriteNode < ::Prism::Node
   #
   #     XYZ = 1    # name `:XYZ`
   #
-  # source://prism//lib/prism/node.rb#5070
+  # source://prism/lib/prism/node.rb#5070
   sig { returns(Symbol) }
   def name; end
 
@@ -7908,13 +7908,13 @@ class Prism::ConstantWriteNode < ::Prism::Node
   #     FOO = 1
   #     ^^^
   #
-  # source://prism//lib/prism/node.rb#5076
+  # source://prism/lib/prism/node.rb#5076
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#5102
+  # source://prism/lib/prism/node.rb#5102
   sig { returns(String) }
   def operator; end
 
@@ -7923,13 +7923,13 @@ class Prism::ConstantWriteNode < ::Prism::Node
   #     FOO = :bar
   #         ^
   #
-  # source://prism//lib/prism/node.rb#5095
+  # source://prism/lib/prism/node.rb#5095
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#5112
+  # source://prism/lib/prism/node.rb#5112
   sig { override.returns(Symbol) }
   def type; end
 
@@ -7941,14 +7941,14 @@ class Prism::ConstantWriteNode < ::Prism::Node
   #     MyClass = Class.new
   #               ^^^^^^^^^
   #
-  # source://prism//lib/prism/node.rb#5089
+  # source://prism/lib/prism/node.rb#5089
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#5117
+    # source://prism/lib/prism/node.rb#5117
     def type; end
   end
 end
@@ -8005,13 +8005,13 @@ end
 #
 # This is mostly helpful in the context of generating trees programmatically.
 #
-# source://prism//lib/prism/dsl.rb#61
+# source://prism/lib/prism/dsl.rb#61
 module Prism::DSL
   extend ::Prism::DSL
 
   # Create a new AliasGlobalVariableNode node.
   #
-  # source://prism//lib/prism/dsl.rb#77
+  # source://prism/lib/prism/dsl.rb#77
   sig do
     params(
       source: Prism::Source,
@@ -8027,7 +8027,7 @@ module Prism::DSL
 
   # Create a new AliasMethodNode node.
   #
-  # source://prism//lib/prism/dsl.rb#82
+  # source://prism/lib/prism/dsl.rb#82
   sig do
     params(
       source: Prism::Source,
@@ -8043,7 +8043,7 @@ module Prism::DSL
 
   # Create a new AlternationPatternNode node.
   #
-  # source://prism//lib/prism/dsl.rb#87
+  # source://prism/lib/prism/dsl.rb#87
   sig do
     params(
       source: Prism::Source,
@@ -8059,7 +8059,7 @@ module Prism::DSL
 
   # Create a new AndNode node.
   #
-  # source://prism//lib/prism/dsl.rb#92
+  # source://prism/lib/prism/dsl.rb#92
   sig do
     params(
       source: Prism::Source,
@@ -8075,7 +8075,7 @@ module Prism::DSL
 
   # Create a new ArgumentsNode node.
   #
-  # source://prism//lib/prism/dsl.rb#97
+  # source://prism/lib/prism/dsl.rb#97
   sig do
     params(
       source: Prism::Source,
@@ -8089,13 +8089,13 @@ module Prism::DSL
 
   # Retrieve the value of one of the ArgumentsNodeFlags flags.
   #
-  # source://prism//lib/prism/dsl.rb#832
+  # source://prism/lib/prism/dsl.rb#832
   sig { params(name: Symbol).returns(Integer) }
   def arguments_node_flag(name); end
 
   # Create a new ArrayNode node.
   #
-  # source://prism//lib/prism/dsl.rb#102
+  # source://prism/lib/prism/dsl.rb#102
   sig do
     params(
       source: Prism::Source,
@@ -8111,13 +8111,13 @@ module Prism::DSL
 
   # Retrieve the value of one of the ArrayNodeFlags flags.
   #
-  # source://prism//lib/prism/dsl.rb#844
+  # source://prism/lib/prism/dsl.rb#844
   sig { params(name: Symbol).returns(Integer) }
   def array_node_flag(name); end
 
   # Create a new ArrayPatternNode node.
   #
-  # source://prism//lib/prism/dsl.rb#107
+  # source://prism/lib/prism/dsl.rb#107
   sig do
     params(
       source: Prism::Source,
@@ -8136,7 +8136,7 @@ module Prism::DSL
 
   # Create a new AssocNode node.
   #
-  # source://prism//lib/prism/dsl.rb#112
+  # source://prism/lib/prism/dsl.rb#112
   sig do
     params(
       source: Prism::Source,
@@ -8152,7 +8152,7 @@ module Prism::DSL
 
   # Create a new AssocSplatNode node.
   #
-  # source://prism//lib/prism/dsl.rb#117
+  # source://prism/lib/prism/dsl.rb#117
   sig do
     params(
       source: Prism::Source,
@@ -8167,7 +8167,7 @@ module Prism::DSL
 
   # Create a new BackReferenceReadNode node.
   #
-  # source://prism//lib/prism/dsl.rb#122
+  # source://prism/lib/prism/dsl.rb#122
   sig do
     params(
       source: Prism::Source,
@@ -8181,7 +8181,7 @@ module Prism::DSL
 
   # Create a new BeginNode node.
   #
-  # source://prism//lib/prism/dsl.rb#127
+  # source://prism/lib/prism/dsl.rb#127
   sig do
     params(
       source: Prism::Source,
@@ -8200,7 +8200,7 @@ module Prism::DSL
 
   # Create a new BlockArgumentNode node.
   #
-  # source://prism//lib/prism/dsl.rb#132
+  # source://prism/lib/prism/dsl.rb#132
   sig do
     params(
       source: Prism::Source,
@@ -8215,7 +8215,7 @@ module Prism::DSL
 
   # Create a new BlockLocalVariableNode node.
   #
-  # source://prism//lib/prism/dsl.rb#137
+  # source://prism/lib/prism/dsl.rb#137
   sig do
     params(
       source: Prism::Source,
@@ -8229,7 +8229,7 @@ module Prism::DSL
 
   # Create a new BlockNode node.
   #
-  # source://prism//lib/prism/dsl.rb#142
+  # source://prism/lib/prism/dsl.rb#142
   sig do
     params(
       source: Prism::Source,
@@ -8247,7 +8247,7 @@ module Prism::DSL
 
   # Create a new BlockParameterNode node.
   #
-  # source://prism//lib/prism/dsl.rb#147
+  # source://prism/lib/prism/dsl.rb#147
   sig do
     params(
       source: Prism::Source,
@@ -8263,7 +8263,7 @@ module Prism::DSL
 
   # Create a new BlockParametersNode node.
   #
-  # source://prism//lib/prism/dsl.rb#152
+  # source://prism/lib/prism/dsl.rb#152
   sig do
     params(
       source: Prism::Source,
@@ -8280,7 +8280,7 @@ module Prism::DSL
 
   # Create a new BreakNode node.
   #
-  # source://prism//lib/prism/dsl.rb#157
+  # source://prism/lib/prism/dsl.rb#157
   sig do
     params(
       source: Prism::Source,
@@ -8295,7 +8295,7 @@ module Prism::DSL
 
   # Create a new CallAndWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#162
+  # source://prism/lib/prism/dsl.rb#162
   sig do
     params(
       source: Prism::Source,
@@ -8315,7 +8315,7 @@ module Prism::DSL
 
   # Create a new CallNode node.
   #
-  # source://prism//lib/prism/dsl.rb#167
+  # source://prism/lib/prism/dsl.rb#167
   sig do
     params(
       source: Prism::Source,
@@ -8336,13 +8336,13 @@ module Prism::DSL
 
   # Retrieve the value of one of the CallNodeFlags flags.
   #
-  # source://prism//lib/prism/dsl.rb#852
+  # source://prism/lib/prism/dsl.rb#852
   sig { params(name: Symbol).returns(Integer) }
   def call_node_flag(name); end
 
   # Create a new CallOperatorWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#172
+  # source://prism/lib/prism/dsl.rb#172
   sig do
     params(
       source: Prism::Source,
@@ -8363,7 +8363,7 @@ module Prism::DSL
 
   # Create a new CallOrWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#177
+  # source://prism/lib/prism/dsl.rb#177
   sig do
     params(
       source: Prism::Source,
@@ -8383,7 +8383,7 @@ module Prism::DSL
 
   # Create a new CallTargetNode node.
   #
-  # source://prism//lib/prism/dsl.rb#182
+  # source://prism/lib/prism/dsl.rb#182
   sig do
     params(
       source: Prism::Source,
@@ -8400,7 +8400,7 @@ module Prism::DSL
 
   # Create a new CapturePatternNode node.
   #
-  # source://prism//lib/prism/dsl.rb#187
+  # source://prism/lib/prism/dsl.rb#187
   sig do
     params(
       source: Prism::Source,
@@ -8416,7 +8416,7 @@ module Prism::DSL
 
   # Create a new CaseMatchNode node.
   #
-  # source://prism//lib/prism/dsl.rb#192
+  # source://prism/lib/prism/dsl.rb#192
   sig do
     params(
       source: Prism::Source,
@@ -8434,7 +8434,7 @@ module Prism::DSL
 
   # Create a new CaseNode node.
   #
-  # source://prism//lib/prism/dsl.rb#197
+  # source://prism/lib/prism/dsl.rb#197
   sig do
     params(
       source: Prism::Source,
@@ -8452,7 +8452,7 @@ module Prism::DSL
 
   # Create a new ClassNode node.
   #
-  # source://prism//lib/prism/dsl.rb#202
+  # source://prism/lib/prism/dsl.rb#202
   sig do
     params(
       source: Prism::Source,
@@ -8473,7 +8473,7 @@ module Prism::DSL
 
   # Create a new ClassVariableAndWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#207
+  # source://prism/lib/prism/dsl.rb#207
   sig do
     params(
       source: Prism::Source,
@@ -8490,7 +8490,7 @@ module Prism::DSL
 
   # Create a new ClassVariableOperatorWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#212
+  # source://prism/lib/prism/dsl.rb#212
   sig do
     params(
       source: Prism::Source,
@@ -8508,7 +8508,7 @@ module Prism::DSL
 
   # Create a new ClassVariableOrWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#217
+  # source://prism/lib/prism/dsl.rb#217
   sig do
     params(
       source: Prism::Source,
@@ -8525,7 +8525,7 @@ module Prism::DSL
 
   # Create a new ClassVariableReadNode node.
   #
-  # source://prism//lib/prism/dsl.rb#222
+  # source://prism/lib/prism/dsl.rb#222
   sig do
     params(
       source: Prism::Source,
@@ -8539,7 +8539,7 @@ module Prism::DSL
 
   # Create a new ClassVariableTargetNode node.
   #
-  # source://prism//lib/prism/dsl.rb#227
+  # source://prism/lib/prism/dsl.rb#227
   sig do
     params(
       source: Prism::Source,
@@ -8553,7 +8553,7 @@ module Prism::DSL
 
   # Create a new ClassVariableWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#232
+  # source://prism/lib/prism/dsl.rb#232
   sig do
     params(
       source: Prism::Source,
@@ -8570,7 +8570,7 @@ module Prism::DSL
 
   # Create a new ConstantAndWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#237
+  # source://prism/lib/prism/dsl.rb#237
   sig do
     params(
       source: Prism::Source,
@@ -8587,7 +8587,7 @@ module Prism::DSL
 
   # Create a new ConstantOperatorWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#242
+  # source://prism/lib/prism/dsl.rb#242
   sig do
     params(
       source: Prism::Source,
@@ -8605,7 +8605,7 @@ module Prism::DSL
 
   # Create a new ConstantOrWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#247
+  # source://prism/lib/prism/dsl.rb#247
   sig do
     params(
       source: Prism::Source,
@@ -8622,7 +8622,7 @@ module Prism::DSL
 
   # Create a new ConstantPathAndWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#252
+  # source://prism/lib/prism/dsl.rb#252
   sig do
     params(
       source: Prism::Source,
@@ -8638,7 +8638,7 @@ module Prism::DSL
 
   # Create a new ConstantPathNode node.
   #
-  # source://prism//lib/prism/dsl.rb#257
+  # source://prism/lib/prism/dsl.rb#257
   sig do
     params(
       source: Prism::Source,
@@ -8655,7 +8655,7 @@ module Prism::DSL
 
   # Create a new ConstantPathOperatorWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#262
+  # source://prism/lib/prism/dsl.rb#262
   sig do
     params(
       source: Prism::Source,
@@ -8672,7 +8672,7 @@ module Prism::DSL
 
   # Create a new ConstantPathOrWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#267
+  # source://prism/lib/prism/dsl.rb#267
   sig do
     params(
       source: Prism::Source,
@@ -8688,7 +8688,7 @@ module Prism::DSL
 
   # Create a new ConstantPathTargetNode node.
   #
-  # source://prism//lib/prism/dsl.rb#272
+  # source://prism/lib/prism/dsl.rb#272
   sig do
     params(
       source: Prism::Source,
@@ -8705,7 +8705,7 @@ module Prism::DSL
 
   # Create a new ConstantPathWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#277
+  # source://prism/lib/prism/dsl.rb#277
   sig do
     params(
       source: Prism::Source,
@@ -8721,7 +8721,7 @@ module Prism::DSL
 
   # Create a new ConstantReadNode node.
   #
-  # source://prism//lib/prism/dsl.rb#282
+  # source://prism/lib/prism/dsl.rb#282
   sig do
     params(
       source: Prism::Source,
@@ -8735,7 +8735,7 @@ module Prism::DSL
 
   # Create a new ConstantTargetNode node.
   #
-  # source://prism//lib/prism/dsl.rb#287
+  # source://prism/lib/prism/dsl.rb#287
   sig do
     params(
       source: Prism::Source,
@@ -8749,7 +8749,7 @@ module Prism::DSL
 
   # Create a new ConstantWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#292
+  # source://prism/lib/prism/dsl.rb#292
   sig do
     params(
       source: Prism::Source,
@@ -8766,7 +8766,7 @@ module Prism::DSL
 
   # Create a new DefNode node.
   #
-  # source://prism//lib/prism/dsl.rb#297
+  # source://prism/lib/prism/dsl.rb#297
   sig do
     params(
       source: Prism::Source,
@@ -8791,7 +8791,7 @@ module Prism::DSL
 
   # Create a new DefinedNode node.
   #
-  # source://prism//lib/prism/dsl.rb#302
+  # source://prism/lib/prism/dsl.rb#302
   sig do
     params(
       source: Prism::Source,
@@ -8808,7 +8808,7 @@ module Prism::DSL
 
   # Create a new ElseNode node.
   #
-  # source://prism//lib/prism/dsl.rb#307
+  # source://prism/lib/prism/dsl.rb#307
   sig do
     params(
       source: Prism::Source,
@@ -8824,7 +8824,7 @@ module Prism::DSL
 
   # Create a new EmbeddedStatementsNode node.
   #
-  # source://prism//lib/prism/dsl.rb#312
+  # source://prism/lib/prism/dsl.rb#312
   sig do
     params(
       source: Prism::Source,
@@ -8840,7 +8840,7 @@ module Prism::DSL
 
   # Create a new EmbeddedVariableNode node.
   #
-  # source://prism//lib/prism/dsl.rb#317
+  # source://prism/lib/prism/dsl.rb#317
   sig do
     params(
       source: Prism::Source,
@@ -8855,13 +8855,13 @@ module Prism::DSL
 
   # Retrieve the value of one of the EncodingFlags flags.
   #
-  # source://prism//lib/prism/dsl.rb#863
+  # source://prism/lib/prism/dsl.rb#863
   sig { params(name: Symbol).returns(Integer) }
   def encoding_flag(name); end
 
   # Create a new EnsureNode node.
   #
-  # source://prism//lib/prism/dsl.rb#322
+  # source://prism/lib/prism/dsl.rb#322
   sig do
     params(
       source: Prism::Source,
@@ -8877,7 +8877,7 @@ module Prism::DSL
 
   # Create a new FalseNode node.
   #
-  # source://prism//lib/prism/dsl.rb#327
+  # source://prism/lib/prism/dsl.rb#327
   sig do
     params(
       source: Prism::Source,
@@ -8890,7 +8890,7 @@ module Prism::DSL
 
   # Create a new FindPatternNode node.
   #
-  # source://prism//lib/prism/dsl.rb#332
+  # source://prism/lib/prism/dsl.rb#332
   sig do
     params(
       source: Prism::Source,
@@ -8909,7 +8909,7 @@ module Prism::DSL
 
   # Create a new FlipFlopNode node.
   #
-  # source://prism//lib/prism/dsl.rb#337
+  # source://prism/lib/prism/dsl.rb#337
   sig do
     params(
       source: Prism::Source,
@@ -8925,7 +8925,7 @@ module Prism::DSL
 
   # Create a new FloatNode node.
   #
-  # source://prism//lib/prism/dsl.rb#342
+  # source://prism/lib/prism/dsl.rb#342
   sig do
     params(
       source: Prism::Source,
@@ -8939,7 +8939,7 @@ module Prism::DSL
 
   # Create a new ForNode node.
   #
-  # source://prism//lib/prism/dsl.rb#347
+  # source://prism/lib/prism/dsl.rb#347
   sig do
     params(
       source: Prism::Source,
@@ -8959,7 +8959,7 @@ module Prism::DSL
 
   # Create a new ForwardingArgumentsNode node.
   #
-  # source://prism//lib/prism/dsl.rb#352
+  # source://prism/lib/prism/dsl.rb#352
   sig do
     params(
       source: Prism::Source,
@@ -8972,7 +8972,7 @@ module Prism::DSL
 
   # Create a new ForwardingParameterNode node.
   #
-  # source://prism//lib/prism/dsl.rb#357
+  # source://prism/lib/prism/dsl.rb#357
   sig do
     params(
       source: Prism::Source,
@@ -8985,7 +8985,7 @@ module Prism::DSL
 
   # Create a new ForwardingSuperNode node.
   #
-  # source://prism//lib/prism/dsl.rb#362
+  # source://prism/lib/prism/dsl.rb#362
   sig do
     params(
       source: Prism::Source,
@@ -8999,7 +8999,7 @@ module Prism::DSL
 
   # Create a new GlobalVariableAndWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#367
+  # source://prism/lib/prism/dsl.rb#367
   sig do
     params(
       source: Prism::Source,
@@ -9016,7 +9016,7 @@ module Prism::DSL
 
   # Create a new GlobalVariableOperatorWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#372
+  # source://prism/lib/prism/dsl.rb#372
   sig do
     params(
       source: Prism::Source,
@@ -9034,7 +9034,7 @@ module Prism::DSL
 
   # Create a new GlobalVariableOrWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#377
+  # source://prism/lib/prism/dsl.rb#377
   sig do
     params(
       source: Prism::Source,
@@ -9051,7 +9051,7 @@ module Prism::DSL
 
   # Create a new GlobalVariableReadNode node.
   #
-  # source://prism//lib/prism/dsl.rb#382
+  # source://prism/lib/prism/dsl.rb#382
   sig do
     params(
       source: Prism::Source,
@@ -9065,7 +9065,7 @@ module Prism::DSL
 
   # Create a new GlobalVariableTargetNode node.
   #
-  # source://prism//lib/prism/dsl.rb#387
+  # source://prism/lib/prism/dsl.rb#387
   sig do
     params(
       source: Prism::Source,
@@ -9079,7 +9079,7 @@ module Prism::DSL
 
   # Create a new GlobalVariableWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#392
+  # source://prism/lib/prism/dsl.rb#392
   sig do
     params(
       source: Prism::Source,
@@ -9096,7 +9096,7 @@ module Prism::DSL
 
   # Create a new HashNode node.
   #
-  # source://prism//lib/prism/dsl.rb#397
+  # source://prism/lib/prism/dsl.rb#397
   sig do
     params(
       source: Prism::Source,
@@ -9112,7 +9112,7 @@ module Prism::DSL
 
   # Create a new HashPatternNode node.
   #
-  # source://prism//lib/prism/dsl.rb#402
+  # source://prism/lib/prism/dsl.rb#402
   sig do
     params(
       source: Prism::Source,
@@ -9130,7 +9130,7 @@ module Prism::DSL
 
   # Create a new IfNode node.
   #
-  # source://prism//lib/prism/dsl.rb#407
+  # source://prism/lib/prism/dsl.rb#407
   sig do
     params(
       source: Prism::Source,
@@ -9149,7 +9149,7 @@ module Prism::DSL
 
   # Create a new ImaginaryNode node.
   #
-  # source://prism//lib/prism/dsl.rb#412
+  # source://prism/lib/prism/dsl.rb#412
   sig do
     params(
       source: Prism::Source,
@@ -9163,7 +9163,7 @@ module Prism::DSL
 
   # Create a new ImplicitNode node.
   #
-  # source://prism//lib/prism/dsl.rb#417
+  # source://prism/lib/prism/dsl.rb#417
   sig do
     params(
       source: Prism::Source,
@@ -9177,7 +9177,7 @@ module Prism::DSL
 
   # Create a new ImplicitRestNode node.
   #
-  # source://prism//lib/prism/dsl.rb#422
+  # source://prism/lib/prism/dsl.rb#422
   sig do
     params(
       source: Prism::Source,
@@ -9190,7 +9190,7 @@ module Prism::DSL
 
   # Create a new InNode node.
   #
-  # source://prism//lib/prism/dsl.rb#427
+  # source://prism/lib/prism/dsl.rb#427
   sig do
     params(
       source: Prism::Source,
@@ -9207,7 +9207,7 @@ module Prism::DSL
 
   # Create a new IndexAndWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#432
+  # source://prism/lib/prism/dsl.rb#432
   sig do
     params(
       source: Prism::Source,
@@ -9228,7 +9228,7 @@ module Prism::DSL
 
   # Create a new IndexOperatorWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#437
+  # source://prism/lib/prism/dsl.rb#437
   sig do
     params(
       source: Prism::Source,
@@ -9250,7 +9250,7 @@ module Prism::DSL
 
   # Create a new IndexOrWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#442
+  # source://prism/lib/prism/dsl.rb#442
   sig do
     params(
       source: Prism::Source,
@@ -9271,7 +9271,7 @@ module Prism::DSL
 
   # Create a new IndexTargetNode node.
   #
-  # source://prism//lib/prism/dsl.rb#447
+  # source://prism/lib/prism/dsl.rb#447
   sig do
     params(
       source: Prism::Source,
@@ -9289,7 +9289,7 @@ module Prism::DSL
 
   # Create a new InstanceVariableAndWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#452
+  # source://prism/lib/prism/dsl.rb#452
   sig do
     params(
       source: Prism::Source,
@@ -9306,7 +9306,7 @@ module Prism::DSL
 
   # Create a new InstanceVariableOperatorWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#457
+  # source://prism/lib/prism/dsl.rb#457
   sig do
     params(
       source: Prism::Source,
@@ -9324,7 +9324,7 @@ module Prism::DSL
 
   # Create a new InstanceVariableOrWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#462
+  # source://prism/lib/prism/dsl.rb#462
   sig do
     params(
       source: Prism::Source,
@@ -9341,7 +9341,7 @@ module Prism::DSL
 
   # Create a new InstanceVariableReadNode node.
   #
-  # source://prism//lib/prism/dsl.rb#467
+  # source://prism/lib/prism/dsl.rb#467
   sig do
     params(
       source: Prism::Source,
@@ -9355,7 +9355,7 @@ module Prism::DSL
 
   # Create a new InstanceVariableTargetNode node.
   #
-  # source://prism//lib/prism/dsl.rb#472
+  # source://prism/lib/prism/dsl.rb#472
   sig do
     params(
       source: Prism::Source,
@@ -9369,7 +9369,7 @@ module Prism::DSL
 
   # Create a new InstanceVariableWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#477
+  # source://prism/lib/prism/dsl.rb#477
   sig do
     params(
       source: Prism::Source,
@@ -9386,13 +9386,13 @@ module Prism::DSL
 
   # Retrieve the value of one of the IntegerBaseFlags flags.
   #
-  # source://prism//lib/prism/dsl.rb#872
+  # source://prism/lib/prism/dsl.rb#872
   sig { params(name: Symbol).returns(Integer) }
   def integer_base_flag(name); end
 
   # Create a new IntegerNode node.
   #
-  # source://prism//lib/prism/dsl.rb#482
+  # source://prism/lib/prism/dsl.rb#482
   sig do
     params(
       source: Prism::Source,
@@ -9406,7 +9406,7 @@ module Prism::DSL
 
   # Create a new InterpolatedMatchLastLineNode node.
   #
-  # source://prism//lib/prism/dsl.rb#487
+  # source://prism/lib/prism/dsl.rb#487
   sig do
     params(
       source: Prism::Source,
@@ -9422,7 +9422,7 @@ module Prism::DSL
 
   # Create a new InterpolatedRegularExpressionNode node.
   #
-  # source://prism//lib/prism/dsl.rb#492
+  # source://prism/lib/prism/dsl.rb#492
   sig do
     params(
       source: Prism::Source,
@@ -9438,7 +9438,7 @@ module Prism::DSL
 
   # Create a new InterpolatedStringNode node.
   #
-  # source://prism//lib/prism/dsl.rb#497
+  # source://prism/lib/prism/dsl.rb#497
   sig do
     params(
       source: Prism::Source,
@@ -9454,13 +9454,13 @@ module Prism::DSL
 
   # Retrieve the value of one of the InterpolatedStringNodeFlags flags.
   #
-  # source://prism//lib/prism/dsl.rb#883
+  # source://prism/lib/prism/dsl.rb#883
   sig { params(name: Symbol).returns(Integer) }
   def interpolated_string_node_flag(name); end
 
   # Create a new InterpolatedSymbolNode node.
   #
-  # source://prism//lib/prism/dsl.rb#502
+  # source://prism/lib/prism/dsl.rb#502
   sig do
     params(
       source: Prism::Source,
@@ -9476,7 +9476,7 @@ module Prism::DSL
 
   # Create a new InterpolatedXStringNode node.
   #
-  # source://prism//lib/prism/dsl.rb#507
+  # source://prism/lib/prism/dsl.rb#507
   sig do
     params(
       source: Prism::Source,
@@ -9492,7 +9492,7 @@ module Prism::DSL
 
   # Create a new ItLocalVariableReadNode node.
   #
-  # source://prism//lib/prism/dsl.rb#512
+  # source://prism/lib/prism/dsl.rb#512
   sig do
     params(
       source: Prism::Source,
@@ -9505,7 +9505,7 @@ module Prism::DSL
 
   # Create a new ItParametersNode node.
   #
-  # source://prism//lib/prism/dsl.rb#517
+  # source://prism/lib/prism/dsl.rb#517
   sig do
     params(
       source: Prism::Source,
@@ -9518,7 +9518,7 @@ module Prism::DSL
 
   # Create a new KeywordHashNode node.
   #
-  # source://prism//lib/prism/dsl.rb#522
+  # source://prism/lib/prism/dsl.rb#522
   sig do
     params(
       source: Prism::Source,
@@ -9532,13 +9532,13 @@ module Prism::DSL
 
   # Retrieve the value of one of the KeywordHashNodeFlags flags.
   #
-  # source://prism//lib/prism/dsl.rb#892
+  # source://prism/lib/prism/dsl.rb#892
   sig { params(name: Symbol).returns(Integer) }
   def keyword_hash_node_flag(name); end
 
   # Create a new KeywordRestParameterNode node.
   #
-  # source://prism//lib/prism/dsl.rb#527
+  # source://prism/lib/prism/dsl.rb#527
   sig do
     params(
       source: Prism::Source,
@@ -9554,7 +9554,7 @@ module Prism::DSL
 
   # Create a new LambdaNode node.
   #
-  # source://prism//lib/prism/dsl.rb#532
+  # source://prism/lib/prism/dsl.rb#532
   sig do
     params(
       source: Prism::Source,
@@ -9573,7 +9573,7 @@ module Prism::DSL
 
   # Create a new LocalVariableAndWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#537
+  # source://prism/lib/prism/dsl.rb#537
   sig do
     params(
       source: Prism::Source,
@@ -9591,7 +9591,7 @@ module Prism::DSL
 
   # Create a new LocalVariableOperatorWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#542
+  # source://prism/lib/prism/dsl.rb#542
   sig do
     params(
       source: Prism::Source,
@@ -9610,7 +9610,7 @@ module Prism::DSL
 
   # Create a new LocalVariableOrWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#547
+  # source://prism/lib/prism/dsl.rb#547
   sig do
     params(
       source: Prism::Source,
@@ -9628,7 +9628,7 @@ module Prism::DSL
 
   # Create a new LocalVariableReadNode node.
   #
-  # source://prism//lib/prism/dsl.rb#552
+  # source://prism/lib/prism/dsl.rb#552
   sig do
     params(
       source: Prism::Source,
@@ -9643,7 +9643,7 @@ module Prism::DSL
 
   # Create a new LocalVariableTargetNode node.
   #
-  # source://prism//lib/prism/dsl.rb#557
+  # source://prism/lib/prism/dsl.rb#557
   sig do
     params(
       source: Prism::Source,
@@ -9658,7 +9658,7 @@ module Prism::DSL
 
   # Create a new LocalVariableWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#562
+  # source://prism/lib/prism/dsl.rb#562
   sig do
     params(
       source: Prism::Source,
@@ -9676,19 +9676,19 @@ module Prism::DSL
 
   # Create a new Location object.
   #
-  # source://prism//lib/prism/dsl.rb#72
+  # source://prism/lib/prism/dsl.rb#72
   sig { params(source: Prism::Source, start_offset: Integer, length: Integer).returns(Prism::Location) }
   def location(source: T.unsafe(nil), start_offset: T.unsafe(nil), length: T.unsafe(nil)); end
 
   # Retrieve the value of one of the LoopFlags flags.
   #
-  # source://prism//lib/prism/dsl.rb#900
+  # source://prism/lib/prism/dsl.rb#900
   sig { params(name: Symbol).returns(Integer) }
   def loop_flag(name); end
 
   # Create a new MatchLastLineNode node.
   #
-  # source://prism//lib/prism/dsl.rb#567
+  # source://prism/lib/prism/dsl.rb#567
   sig do
     params(
       source: Prism::Source,
@@ -9705,7 +9705,7 @@ module Prism::DSL
 
   # Create a new MatchPredicateNode node.
   #
-  # source://prism//lib/prism/dsl.rb#572
+  # source://prism/lib/prism/dsl.rb#572
   sig do
     params(
       source: Prism::Source,
@@ -9721,7 +9721,7 @@ module Prism::DSL
 
   # Create a new MatchRequiredNode node.
   #
-  # source://prism//lib/prism/dsl.rb#577
+  # source://prism/lib/prism/dsl.rb#577
   sig do
     params(
       source: Prism::Source,
@@ -9737,7 +9737,7 @@ module Prism::DSL
 
   # Create a new MatchWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#582
+  # source://prism/lib/prism/dsl.rb#582
   sig do
     params(
       source: Prism::Source,
@@ -9752,7 +9752,7 @@ module Prism::DSL
 
   # Create a new MissingNode node.
   #
-  # source://prism//lib/prism/dsl.rb#587
+  # source://prism/lib/prism/dsl.rb#587
   sig do
     params(
       source: Prism::Source,
@@ -9765,7 +9765,7 @@ module Prism::DSL
 
   # Create a new ModuleNode node.
   #
-  # source://prism//lib/prism/dsl.rb#592
+  # source://prism/lib/prism/dsl.rb#592
   sig do
     params(
       source: Prism::Source,
@@ -9784,7 +9784,7 @@ module Prism::DSL
 
   # Create a new MultiTargetNode node.
   #
-  # source://prism//lib/prism/dsl.rb#597
+  # source://prism/lib/prism/dsl.rb#597
   sig do
     params(
       source: Prism::Source,
@@ -9802,7 +9802,7 @@ module Prism::DSL
 
   # Create a new MultiWriteNode node.
   #
-  # source://prism//lib/prism/dsl.rb#602
+  # source://prism/lib/prism/dsl.rb#602
   sig do
     params(
       source: Prism::Source,
@@ -9822,7 +9822,7 @@ module Prism::DSL
 
   # Create a new NextNode node.
   #
-  # source://prism//lib/prism/dsl.rb#607
+  # source://prism/lib/prism/dsl.rb#607
   sig do
     params(
       source: Prism::Source,
@@ -9837,7 +9837,7 @@ module Prism::DSL
 
   # Create a new NilNode node.
   #
-  # source://prism//lib/prism/dsl.rb#612
+  # source://prism/lib/prism/dsl.rb#612
   sig do
     params(
       source: Prism::Source,
@@ -9850,7 +9850,7 @@ module Prism::DSL
 
   # Create a new NoKeywordsParameterNode node.
   #
-  # source://prism//lib/prism/dsl.rb#617
+  # source://prism/lib/prism/dsl.rb#617
   sig do
     params(
       source: Prism::Source,
@@ -9865,7 +9865,7 @@ module Prism::DSL
 
   # Create a new NumberedParametersNode node.
   #
-  # source://prism//lib/prism/dsl.rb#622
+  # source://prism/lib/prism/dsl.rb#622
   sig do
     params(
       source: Prism::Source,
@@ -9879,7 +9879,7 @@ module Prism::DSL
 
   # Create a new NumberedReferenceReadNode node.
   #
-  # source://prism//lib/prism/dsl.rb#627
+  # source://prism/lib/prism/dsl.rb#627
   sig do
     params(
       source: Prism::Source,
@@ -9893,7 +9893,7 @@ module Prism::DSL
 
   # Create a new OptionalKeywordParameterNode node.
   #
-  # source://prism//lib/prism/dsl.rb#632
+  # source://prism/lib/prism/dsl.rb#632
   sig do
     params(
       source: Prism::Source,
@@ -9909,7 +9909,7 @@ module Prism::DSL
 
   # Create a new OptionalParameterNode node.
   #
-  # source://prism//lib/prism/dsl.rb#637
+  # source://prism/lib/prism/dsl.rb#637
   sig do
     params(
       source: Prism::Source,
@@ -9926,7 +9926,7 @@ module Prism::DSL
 
   # Create a new OrNode node.
   #
-  # source://prism//lib/prism/dsl.rb#642
+  # source://prism/lib/prism/dsl.rb#642
   sig do
     params(
       source: Prism::Source,
@@ -9942,13 +9942,13 @@ module Prism::DSL
 
   # Retrieve the value of one of the ParameterFlags flags.
   #
-  # source://prism//lib/prism/dsl.rb#908
+  # source://prism/lib/prism/dsl.rb#908
   sig { params(name: Symbol).returns(Integer) }
   def parameter_flag(name); end
 
   # Create a new ParametersNode node.
   #
-  # source://prism//lib/prism/dsl.rb#647
+  # source://prism/lib/prism/dsl.rb#647
   sig do
     params(
       source: Prism::Source,
@@ -9968,7 +9968,7 @@ module Prism::DSL
 
   # Create a new ParenthesesNode node.
   #
-  # source://prism//lib/prism/dsl.rb#652
+  # source://prism/lib/prism/dsl.rb#652
   sig do
     params(
       source: Prism::Source,
@@ -9984,7 +9984,7 @@ module Prism::DSL
 
   # Create a new PinnedExpressionNode node.
   #
-  # source://prism//lib/prism/dsl.rb#657
+  # source://prism/lib/prism/dsl.rb#657
   sig do
     params(
       source: Prism::Source,
@@ -10001,7 +10001,7 @@ module Prism::DSL
 
   # Create a new PinnedVariableNode node.
   #
-  # source://prism//lib/prism/dsl.rb#662
+  # source://prism/lib/prism/dsl.rb#662
   sig do
     params(
       source: Prism::Source,
@@ -10016,7 +10016,7 @@ module Prism::DSL
 
   # Create a new PostExecutionNode node.
   #
-  # source://prism//lib/prism/dsl.rb#667
+  # source://prism/lib/prism/dsl.rb#667
   sig do
     params(
       source: Prism::Source,
@@ -10033,7 +10033,7 @@ module Prism::DSL
 
   # Create a new PreExecutionNode node.
   #
-  # source://prism//lib/prism/dsl.rb#672
+  # source://prism/lib/prism/dsl.rb#672
   sig do
     params(
       source: Prism::Source,
@@ -10050,7 +10050,7 @@ module Prism::DSL
 
   # Create a new ProgramNode node.
   #
-  # source://prism//lib/prism/dsl.rb#677
+  # source://prism/lib/prism/dsl.rb#677
   sig do
     params(
       source: Prism::Source,
@@ -10065,13 +10065,13 @@ module Prism::DSL
 
   # Retrieve the value of one of the RangeFlags flags.
   #
-  # source://prism//lib/prism/dsl.rb#916
+  # source://prism/lib/prism/dsl.rb#916
   sig { params(name: Symbol).returns(Integer) }
   def range_flag(name); end
 
   # Create a new RangeNode node.
   #
-  # source://prism//lib/prism/dsl.rb#682
+  # source://prism/lib/prism/dsl.rb#682
   sig do
     params(
       source: Prism::Source,
@@ -10087,7 +10087,7 @@ module Prism::DSL
 
   # Create a new RationalNode node.
   #
-  # source://prism//lib/prism/dsl.rb#687
+  # source://prism/lib/prism/dsl.rb#687
   sig do
     params(
       source: Prism::Source,
@@ -10102,7 +10102,7 @@ module Prism::DSL
 
   # Create a new RedoNode node.
   #
-  # source://prism//lib/prism/dsl.rb#692
+  # source://prism/lib/prism/dsl.rb#692
   sig do
     params(
       source: Prism::Source,
@@ -10115,13 +10115,13 @@ module Prism::DSL
 
   # Retrieve the value of one of the RegularExpressionFlags flags.
   #
-  # source://prism//lib/prism/dsl.rb#924
+  # source://prism/lib/prism/dsl.rb#924
   sig { params(name: Symbol).returns(Integer) }
   def regular_expression_flag(name); end
 
   # Create a new RegularExpressionNode node.
   #
-  # source://prism//lib/prism/dsl.rb#697
+  # source://prism/lib/prism/dsl.rb#697
   sig do
     params(
       source: Prism::Source,
@@ -10138,7 +10138,7 @@ module Prism::DSL
 
   # Create a new RequiredKeywordParameterNode node.
   #
-  # source://prism//lib/prism/dsl.rb#702
+  # source://prism/lib/prism/dsl.rb#702
   sig do
     params(
       source: Prism::Source,
@@ -10153,7 +10153,7 @@ module Prism::DSL
 
   # Create a new RequiredParameterNode node.
   #
-  # source://prism//lib/prism/dsl.rb#707
+  # source://prism/lib/prism/dsl.rb#707
   sig do
     params(
       source: Prism::Source,
@@ -10167,7 +10167,7 @@ module Prism::DSL
 
   # Create a new RescueModifierNode node.
   #
-  # source://prism//lib/prism/dsl.rb#712
+  # source://prism/lib/prism/dsl.rb#712
   sig do
     params(
       source: Prism::Source,
@@ -10183,7 +10183,7 @@ module Prism::DSL
 
   # Create a new RescueNode node.
   #
-  # source://prism//lib/prism/dsl.rb#717
+  # source://prism/lib/prism/dsl.rb#717
   sig do
     params(
       source: Prism::Source,
@@ -10202,7 +10202,7 @@ module Prism::DSL
 
   # Create a new RestParameterNode node.
   #
-  # source://prism//lib/prism/dsl.rb#722
+  # source://prism/lib/prism/dsl.rb#722
   sig do
     params(
       source: Prism::Source,
@@ -10218,7 +10218,7 @@ module Prism::DSL
 
   # Create a new RetryNode node.
   #
-  # source://prism//lib/prism/dsl.rb#727
+  # source://prism/lib/prism/dsl.rb#727
   sig do
     params(
       source: Prism::Source,
@@ -10231,7 +10231,7 @@ module Prism::DSL
 
   # Create a new ReturnNode node.
   #
-  # source://prism//lib/prism/dsl.rb#732
+  # source://prism/lib/prism/dsl.rb#732
   sig do
     params(
       source: Prism::Source,
@@ -10246,7 +10246,7 @@ module Prism::DSL
 
   # Create a new SelfNode node.
   #
-  # source://prism//lib/prism/dsl.rb#737
+  # source://prism/lib/prism/dsl.rb#737
   sig do
     params(
       source: Prism::Source,
@@ -10259,7 +10259,7 @@ module Prism::DSL
 
   # Create a new ShareableConstantNode node.
   #
-  # source://prism//lib/prism/dsl.rb#742
+  # source://prism/lib/prism/dsl.rb#742
   sig do
     params(
       source: Prism::Source,
@@ -10273,13 +10273,13 @@ module Prism::DSL
 
   # Retrieve the value of one of the ShareableConstantNodeFlags flags.
   #
-  # source://prism//lib/prism/dsl.rb#942
+  # source://prism/lib/prism/dsl.rb#942
   sig { params(name: Symbol).returns(Integer) }
   def shareable_constant_node_flag(name); end
 
   # Create a new SingletonClassNode node.
   #
-  # source://prism//lib/prism/dsl.rb#747
+  # source://prism/lib/prism/dsl.rb#747
   sig do
     params(
       source: Prism::Source,
@@ -10298,13 +10298,13 @@ module Prism::DSL
 
   # Create a new Source object.
   #
-  # source://prism//lib/prism/dsl.rb#67
+  # source://prism/lib/prism/dsl.rb#67
   sig { params(string: String).returns(Prism::Source) }
   def source(string); end
 
   # Create a new SourceEncodingNode node.
   #
-  # source://prism//lib/prism/dsl.rb#752
+  # source://prism/lib/prism/dsl.rb#752
   sig do
     params(
       source: Prism::Source,
@@ -10317,7 +10317,7 @@ module Prism::DSL
 
   # Create a new SourceFileNode node.
   #
-  # source://prism//lib/prism/dsl.rb#757
+  # source://prism/lib/prism/dsl.rb#757
   sig do
     params(
       source: Prism::Source,
@@ -10331,7 +10331,7 @@ module Prism::DSL
 
   # Create a new SourceLineNode node.
   #
-  # source://prism//lib/prism/dsl.rb#762
+  # source://prism/lib/prism/dsl.rb#762
   sig do
     params(
       source: Prism::Source,
@@ -10344,7 +10344,7 @@ module Prism::DSL
 
   # Create a new SplatNode node.
   #
-  # source://prism//lib/prism/dsl.rb#767
+  # source://prism/lib/prism/dsl.rb#767
   sig do
     params(
       source: Prism::Source,
@@ -10359,7 +10359,7 @@ module Prism::DSL
 
   # Create a new StatementsNode node.
   #
-  # source://prism//lib/prism/dsl.rb#772
+  # source://prism/lib/prism/dsl.rb#772
   sig do
     params(
       source: Prism::Source,
@@ -10373,13 +10373,13 @@ module Prism::DSL
 
   # Retrieve the value of one of the StringFlags flags.
   #
-  # source://prism//lib/prism/dsl.rb#952
+  # source://prism/lib/prism/dsl.rb#952
   sig { params(name: Symbol).returns(Integer) }
   def string_flag(name); end
 
   # Create a new StringNode node.
   #
-  # source://prism//lib/prism/dsl.rb#777
+  # source://prism/lib/prism/dsl.rb#777
   sig do
     params(
       source: Prism::Source,
@@ -10396,7 +10396,7 @@ module Prism::DSL
 
   # Create a new SuperNode node.
   #
-  # source://prism//lib/prism/dsl.rb#782
+  # source://prism/lib/prism/dsl.rb#782
   sig do
     params(
       source: Prism::Source,
@@ -10414,13 +10414,13 @@ module Prism::DSL
 
   # Retrieve the value of one of the SymbolFlags flags.
   #
-  # source://prism//lib/prism/dsl.rb#963
+  # source://prism/lib/prism/dsl.rb#963
   sig { params(name: Symbol).returns(Integer) }
   def symbol_flag(name); end
 
   # Create a new SymbolNode node.
   #
-  # source://prism//lib/prism/dsl.rb#787
+  # source://prism/lib/prism/dsl.rb#787
   sig do
     params(
       source: Prism::Source,
@@ -10437,7 +10437,7 @@ module Prism::DSL
 
   # Create a new TrueNode node.
   #
-  # source://prism//lib/prism/dsl.rb#792
+  # source://prism/lib/prism/dsl.rb#792
   sig do
     params(
       source: Prism::Source,
@@ -10450,7 +10450,7 @@ module Prism::DSL
 
   # Create a new UndefNode node.
   #
-  # source://prism//lib/prism/dsl.rb#797
+  # source://prism/lib/prism/dsl.rb#797
   sig do
     params(
       source: Prism::Source,
@@ -10465,7 +10465,7 @@ module Prism::DSL
 
   # Create a new UnlessNode node.
   #
-  # source://prism//lib/prism/dsl.rb#802
+  # source://prism/lib/prism/dsl.rb#802
   sig do
     params(
       source: Prism::Source,
@@ -10484,7 +10484,7 @@ module Prism::DSL
 
   # Create a new UntilNode node.
   #
-  # source://prism//lib/prism/dsl.rb#807
+  # source://prism/lib/prism/dsl.rb#807
   sig do
     params(
       source: Prism::Source,
@@ -10501,7 +10501,7 @@ module Prism::DSL
 
   # Create a new WhenNode node.
   #
-  # source://prism//lib/prism/dsl.rb#812
+  # source://prism/lib/prism/dsl.rb#812
   sig do
     params(
       source: Prism::Source,
@@ -10518,7 +10518,7 @@ module Prism::DSL
 
   # Create a new WhileNode node.
   #
-  # source://prism//lib/prism/dsl.rb#817
+  # source://prism/lib/prism/dsl.rb#817
   sig do
     params(
       source: Prism::Source,
@@ -10535,7 +10535,7 @@ module Prism::DSL
 
   # Create a new XStringNode node.
   #
-  # source://prism//lib/prism/dsl.rb#822
+  # source://prism/lib/prism/dsl.rb#822
   sig do
     params(
       source: Prism::Source,
@@ -10552,7 +10552,7 @@ module Prism::DSL
 
   # Create a new YieldNode node.
   #
-  # source://prism//lib/prism/dsl.rb#827
+  # source://prism/lib/prism/dsl.rb#827
   sig do
     params(
       source: Prism::Source,
@@ -10572,21 +10572,21 @@ module Prism::DSL
   # The default location object that gets attached to nodes if no location is
   # specified, which uses the given source.
   #
-  # source://prism//lib/prism/dsl.rb#982
+  # source://prism/lib/prism/dsl.rb#982
   sig { returns(Prism::Location) }
   def default_location; end
 
   # The default node that gets attached to nodes if no node is specified for a
   # required node field.
   #
-  # source://prism//lib/prism/dsl.rb#988
+  # source://prism/lib/prism/dsl.rb#988
   sig { params(source: Prism::Source, location: Prism::Location).returns(Prism::Node) }
   def default_node(source, location); end
 
   # The default source object that gets attached to nodes and locations if no
   # source is specified.
   #
-  # source://prism//lib/prism/dsl.rb#976
+  # source://prism/lib/prism/dsl.rb#976
   sig { returns(Prism::Source) }
   def default_source; end
 end
@@ -10597,13 +10597,13 @@ end
 #     end
 #     ^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#5137
+# source://prism/lib/prism/node.rb#5137
 class Prism::DefNode < ::Prism::Node
   # Initialize a new DefNode node.
   #
   # @return [DefNode] a new instance of DefNode
   #
-  # source://prism//lib/prism/node.rb#5139
+  # source://prism/lib/prism/node.rb#5139
   sig do
     params(
       source: Prism::Source,
@@ -10629,42 +10629,42 @@ class Prism::DefNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#5336
+  # source://prism/lib/prism/node.rb#5336
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#5159
+  # source://prism/lib/prism/node.rb#5159
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader body: StatementsNode | BeginNode | nil
   #
-  # source://prism//lib/prism/node.rb#5212
+  # source://prism/lib/prism/node.rb#5212
   sig { returns(T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))) }
   def body; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#5164
+  # source://prism/lib/prism/node.rb#5164
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#5178
+  # source://prism/lib/prism/node.rb#5178
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#5169
+  # source://prism/lib/prism/node.rb#5169
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?receiver: Prism::node?, ?parameters: ParametersNode?, ?body: StatementsNode | BeginNode | nil, ?locals: Array[Symbol], ?def_keyword_loc: Location, ?operator_loc: Location?, ?lparen_loc: Location?, ?rparen_loc: Location?, ?equal_loc: Location?, ?end_keyword_loc: Location?) -> DefNode
   #
-  # source://prism//lib/prism/node.rb#5183
+  # source://prism/lib/prism/node.rb#5183
   sig do
     params(
       node_id: Integer,
@@ -10689,49 +10689,49 @@ class Prism::DefNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#5164
+  # source://prism/lib/prism/node.rb#5164
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, receiver: Prism::node?, parameters: ParametersNode?, body: StatementsNode | BeginNode | nil, locals: Array[Symbol], def_keyword_loc: Location, operator_loc: Location?, lparen_loc: Location?, rparen_loc: Location?, equal_loc: Location?, end_keyword_loc: Location? }
   #
-  # source://prism//lib/prism/node.rb#5191
+  # source://prism/lib/prism/node.rb#5191
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # def def_keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#5290
+  # source://prism/lib/prism/node.rb#5290
   sig { returns(String) }
   def def_keyword; end
 
   # attr_reader def_keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#5218
+  # source://prism/lib/prism/node.rb#5218
   sig { returns(Prism::Location) }
   def def_keyword_loc; end
 
   # def end_keyword: () -> String?
   #
-  # source://prism//lib/prism/node.rb#5315
+  # source://prism/lib/prism/node.rb#5315
   sig { returns(T.nilable(String)) }
   def end_keyword; end
 
   # attr_reader end_keyword_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#5277
+  # source://prism/lib/prism/node.rb#5277
   sig { returns(T.nilable(Prism::Location)) }
   def end_keyword_loc; end
 
   # def equal: () -> String?
   #
-  # source://prism//lib/prism/node.rb#5310
+  # source://prism/lib/prism/node.rb#5310
   sig { returns(T.nilable(String)) }
   def equal; end
 
   # attr_reader equal_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#5264
+  # source://prism/lib/prism/node.rb#5264
   sig { returns(T.nilable(Prism::Location)) }
   def equal_loc; end
 
@@ -10740,86 +10740,86 @@ class Prism::DefNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#5320
+  # source://prism/lib/prism/node.rb#5320
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader locals: Array[Symbol]
   #
-  # source://prism//lib/prism/node.rb#5215
+  # source://prism/lib/prism/node.rb#5215
   sig { returns(T::Array[Symbol]) }
   def locals; end
 
   # def lparen: () -> String?
   #
-  # source://prism//lib/prism/node.rb#5300
+  # source://prism/lib/prism/node.rb#5300
   sig { returns(T.nilable(String)) }
   def lparen; end
 
   # attr_reader lparen_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#5238
+  # source://prism/lib/prism/node.rb#5238
   sig { returns(T.nilable(Prism::Location)) }
   def lparen_loc; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#5196
+  # source://prism/lib/prism/node.rb#5196
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#5199
+  # source://prism/lib/prism/node.rb#5199
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # def operator: () -> String?
   #
-  # source://prism//lib/prism/node.rb#5295
+  # source://prism/lib/prism/node.rb#5295
   sig { returns(T.nilable(String)) }
   def operator; end
 
   # attr_reader operator_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#5225
+  # source://prism/lib/prism/node.rb#5225
   sig { returns(T.nilable(Prism::Location)) }
   def operator_loc; end
 
   # attr_reader parameters: ParametersNode?
   #
-  # source://prism//lib/prism/node.rb#5209
+  # source://prism/lib/prism/node.rb#5209
   sig { returns(T.nilable(Prism::ParametersNode)) }
   def parameters; end
 
   # attr_reader receiver: Prism::node?
   #
-  # source://prism//lib/prism/node.rb#5206
+  # source://prism/lib/prism/node.rb#5206
   sig { returns(T.nilable(Prism::Node)) }
   def receiver; end
 
   # def rparen: () -> String?
   #
-  # source://prism//lib/prism/node.rb#5305
+  # source://prism/lib/prism/node.rb#5305
   sig { returns(T.nilable(String)) }
   def rparen; end
 
   # attr_reader rparen_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#5251
+  # source://prism/lib/prism/node.rb#5251
   sig { returns(T.nilable(Prism::Location)) }
   def rparen_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#5325
+  # source://prism/lib/prism/node.rb#5325
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#5330
+    # source://prism/lib/prism/node.rb#5330
     def type; end
   end
 end
@@ -10829,13 +10829,13 @@ end
 #     defined?(a)
 #     ^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#5358
+# source://prism/lib/prism/node.rb#5358
 class Prism::DefinedNode < ::Prism::Node
   # Initialize a new DefinedNode node.
   #
   # @return [DefinedNode] a new instance of DefinedNode
   #
-  # source://prism//lib/prism/node.rb#5360
+  # source://prism/lib/prism/node.rb#5360
   sig do
     params(
       source: Prism::Source,
@@ -10853,36 +10853,36 @@ class Prism::DefinedNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#5472
+  # source://prism/lib/prism/node.rb#5472
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#5372
+  # source://prism/lib/prism/node.rb#5372
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#5377
+  # source://prism/lib/prism/node.rb#5377
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#5387
+  # source://prism/lib/prism/node.rb#5387
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#5382
+  # source://prism/lib/prism/node.rb#5382
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?lparen_loc: Location?, ?value: Prism::node, ?rparen_loc: Location?, ?keyword_loc: Location) -> DefinedNode
   #
-  # source://prism//lib/prism/node.rb#5392
+  # source://prism/lib/prism/node.rb#5392
   sig do
     params(
       node_id: Integer,
@@ -10899,13 +10899,13 @@ class Prism::DefinedNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#5377
+  # source://prism/lib/prism/node.rb#5377
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, lparen_loc: Location?, value: Prism::node, rparen_loc: Location?, keyword_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#5400
+  # source://prism/lib/prism/node.rb#5400
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -10914,110 +10914,110 @@ class Prism::DefinedNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#5456
+  # source://prism/lib/prism/node.rb#5456
   sig { override.returns(String) }
   def inspect; end
 
   # def keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#5451
+  # source://prism/lib/prism/node.rb#5451
   sig { returns(String) }
   def keyword; end
 
   # attr_reader keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#5434
+  # source://prism/lib/prism/node.rb#5434
   sig { returns(Prism::Location) }
   def keyword_loc; end
 
   # def lparen: () -> String?
   #
-  # source://prism//lib/prism/node.rb#5441
+  # source://prism/lib/prism/node.rb#5441
   sig { returns(T.nilable(String)) }
   def lparen; end
 
   # attr_reader lparen_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#5405
+  # source://prism/lib/prism/node.rb#5405
   sig { returns(T.nilable(Prism::Location)) }
   def lparen_loc; end
 
   # def rparen: () -> String?
   #
-  # source://prism//lib/prism/node.rb#5446
+  # source://prism/lib/prism/node.rb#5446
   sig { returns(T.nilable(String)) }
   def rparen; end
 
   # attr_reader rparen_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#5421
+  # source://prism/lib/prism/node.rb#5421
   sig { returns(T.nilable(Prism::Location)) }
   def rparen_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#5461
+  # source://prism/lib/prism/node.rb#5461
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#5418
+  # source://prism/lib/prism/node.rb#5418
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#5466
+    # source://prism/lib/prism/node.rb#5466
     def type; end
   end
 end
 
-# source://prism//lib/prism/desugar_compiler.rb#4
+# source://prism/lib/prism/desugar_compiler.rb#4
 class Prism::DesugarAndWriteNode
   include ::Prism::DSL
 
   # @return [DesugarAndWriteNode] a new instance of DesugarAndWriteNode
   #
-  # source://prism//lib/prism/desugar_compiler.rb#9
+  # source://prism/lib/prism/desugar_compiler.rb#9
   def initialize(node, default_source, read_class, write_class, **arguments); end
 
   # Returns the value of attribute arguments.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#7
+  # source://prism/lib/prism/desugar_compiler.rb#7
   def arguments; end
 
   # Desugar `x &&= y` to `x && x = y`
   #
-  # source://prism//lib/prism/desugar_compiler.rb#18
+  # source://prism/lib/prism/desugar_compiler.rb#18
   def compile; end
 
   # Returns the value of attribute default_source.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#7
+  # source://prism/lib/prism/desugar_compiler.rb#7
   def default_source; end
 
   # Returns the value of attribute node.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#7
+  # source://prism/lib/prism/desugar_compiler.rb#7
   def node; end
 
   # Returns the value of attribute read_class.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#7
+  # source://prism/lib/prism/desugar_compiler.rb#7
   def read_class; end
 
   # Returns the value of attribute write_class.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#7
+  # source://prism/lib/prism/desugar_compiler.rb#7
   def write_class; end
 end
 
 # DesugarCompiler is a compiler that desugars Ruby code into a more primitive
 # form. This is useful for consumers that want to deal with fewer node types.
 #
-# source://prism//lib/prism/desugar_compiler.rb#255
+# source://prism/lib/prism/desugar_compiler.rb#255
 class Prism::DesugarCompiler < ::Prism::MutationCompiler
   # @@foo &&= bar
   #
@@ -11025,7 +11025,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler
   #
   # @@foo && @@foo = bar
   #
-  # source://prism//lib/prism/desugar_compiler.rb#261
+  # source://prism/lib/prism/desugar_compiler.rb#261
   def visit_class_variable_and_write_node(node); end
 
   # @@foo += bar
@@ -11034,7 +11034,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler
   #
   # @@foo = @@foo + bar
   #
-  # source://prism//lib/prism/desugar_compiler.rb#279
+  # source://prism/lib/prism/desugar_compiler.rb#279
   def visit_class_variable_operator_write_node(node); end
 
   # @@foo ||= bar
@@ -11043,7 +11043,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler
   #
   # defined?(@@foo) ? @@foo : @@foo = bar
   #
-  # source://prism//lib/prism/desugar_compiler.rb#270
+  # source://prism/lib/prism/desugar_compiler.rb#270
   def visit_class_variable_or_write_node(node); end
 
   # Foo &&= bar
@@ -11052,7 +11052,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler
   #
   # Foo && Foo = bar
   #
-  # source://prism//lib/prism/desugar_compiler.rb#288
+  # source://prism/lib/prism/desugar_compiler.rb#288
   def visit_constant_and_write_node(node); end
 
   # Foo += bar
@@ -11061,7 +11061,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler
   #
   # Foo = Foo + bar
   #
-  # source://prism//lib/prism/desugar_compiler.rb#306
+  # source://prism/lib/prism/desugar_compiler.rb#306
   def visit_constant_operator_write_node(node); end
 
   # Foo ||= bar
@@ -11070,7 +11070,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler
   #
   # defined?(Foo) ? Foo : Foo = bar
   #
-  # source://prism//lib/prism/desugar_compiler.rb#297
+  # source://prism/lib/prism/desugar_compiler.rb#297
   def visit_constant_or_write_node(node); end
 
   # $foo &&= bar
@@ -11079,7 +11079,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler
   #
   # $foo && $foo = bar
   #
-  # source://prism//lib/prism/desugar_compiler.rb#315
+  # source://prism/lib/prism/desugar_compiler.rb#315
   def visit_global_variable_and_write_node(node); end
 
   # $foo += bar
@@ -11088,7 +11088,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler
   #
   # $foo = $foo + bar
   #
-  # source://prism//lib/prism/desugar_compiler.rb#333
+  # source://prism/lib/prism/desugar_compiler.rb#333
   def visit_global_variable_operator_write_node(node); end
 
   # $foo ||= bar
@@ -11097,22 +11097,22 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler
   #
   # defined?($foo) ? $foo : $foo = bar
   #
-  # source://prism//lib/prism/desugar_compiler.rb#324
+  # source://prism/lib/prism/desugar_compiler.rb#324
   def visit_global_variable_or_write_node(node); end
 
   # becomes
   #
-  # source://prism//lib/prism/desugar_compiler.rb#342
+  # source://prism/lib/prism/desugar_compiler.rb#342
   def visit_instance_variable_and_write_node(node); end
 
   # becomes
   #
-  # source://prism//lib/prism/desugar_compiler.rb#360
+  # source://prism/lib/prism/desugar_compiler.rb#360
   def visit_instance_variable_operator_write_node(node); end
 
   # becomes
   #
-  # source://prism//lib/prism/desugar_compiler.rb#351
+  # source://prism/lib/prism/desugar_compiler.rb#351
   def visit_instance_variable_or_write_node(node); end
 
   # foo &&= bar
@@ -11121,7 +11121,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler
   #
   # foo && foo = bar
   #
-  # source://prism//lib/prism/desugar_compiler.rb#369
+  # source://prism/lib/prism/desugar_compiler.rb#369
   def visit_local_variable_and_write_node(node); end
 
   # foo += bar
@@ -11130,7 +11130,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler
   #
   # foo = foo + bar
   #
-  # source://prism//lib/prism/desugar_compiler.rb#387
+  # source://prism/lib/prism/desugar_compiler.rb#387
   def visit_local_variable_operator_write_node(node); end
 
   # foo ||= bar
@@ -11139,127 +11139,127 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler
   #
   # foo || foo = bar
   #
-  # source://prism//lib/prism/desugar_compiler.rb#378
+  # source://prism/lib/prism/desugar_compiler.rb#378
   def visit_local_variable_or_write_node(node); end
 end
 
-# source://prism//lib/prism/desugar_compiler.rb#86
+# source://prism/lib/prism/desugar_compiler.rb#86
 class Prism::DesugarOperatorWriteNode
   include ::Prism::DSL
 
   # @return [DesugarOperatorWriteNode] a new instance of DesugarOperatorWriteNode
   #
-  # source://prism//lib/prism/desugar_compiler.rb#91
+  # source://prism/lib/prism/desugar_compiler.rb#91
   def initialize(node, default_source, read_class, write_class, **arguments); end
 
   # Returns the value of attribute arguments.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#89
+  # source://prism/lib/prism/desugar_compiler.rb#89
   def arguments; end
 
   # Desugar `x += y` to `x = x + y`
   #
-  # source://prism//lib/prism/desugar_compiler.rb#100
+  # source://prism/lib/prism/desugar_compiler.rb#100
   def compile; end
 
   # Returns the value of attribute default_source.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#89
+  # source://prism/lib/prism/desugar_compiler.rb#89
   def default_source; end
 
   # Returns the value of attribute node.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#89
+  # source://prism/lib/prism/desugar_compiler.rb#89
   def node; end
 
   # Returns the value of attribute read_class.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#89
+  # source://prism/lib/prism/desugar_compiler.rb#89
   def read_class; end
 
   # Returns the value of attribute write_class.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#89
+  # source://prism/lib/prism/desugar_compiler.rb#89
   def write_class; end
 end
 
-# source://prism//lib/prism/desugar_compiler.rb#35
+# source://prism/lib/prism/desugar_compiler.rb#35
 class Prism::DesugarOrWriteDefinedNode
   include ::Prism::DSL
 
   # @return [DesugarOrWriteDefinedNode] a new instance of DesugarOrWriteDefinedNode
   #
-  # source://prism//lib/prism/desugar_compiler.rb#40
+  # source://prism/lib/prism/desugar_compiler.rb#40
   def initialize(node, default_source, read_class, write_class, **arguments); end
 
   # Returns the value of attribute arguments.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#38
+  # source://prism/lib/prism/desugar_compiler.rb#38
   def arguments; end
 
   # Desugar `x ||= y` to `defined?(x) ? x : x = y`
   #
-  # source://prism//lib/prism/desugar_compiler.rb#49
+  # source://prism/lib/prism/desugar_compiler.rb#49
   def compile; end
 
   # Returns the value of attribute default_source.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#38
+  # source://prism/lib/prism/desugar_compiler.rb#38
   def default_source; end
 
   # Returns the value of attribute node.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#38
+  # source://prism/lib/prism/desugar_compiler.rb#38
   def node; end
 
   # Returns the value of attribute read_class.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#38
+  # source://prism/lib/prism/desugar_compiler.rb#38
   def read_class; end
 
   # Returns the value of attribute write_class.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#38
+  # source://prism/lib/prism/desugar_compiler.rb#38
   def write_class; end
 end
 
-# source://prism//lib/prism/desugar_compiler.rb#130
+# source://prism/lib/prism/desugar_compiler.rb#130
 class Prism::DesugarOrWriteNode
   include ::Prism::DSL
 
   # @return [DesugarOrWriteNode] a new instance of DesugarOrWriteNode
   #
-  # source://prism//lib/prism/desugar_compiler.rb#135
+  # source://prism/lib/prism/desugar_compiler.rb#135
   def initialize(node, default_source, read_class, write_class, **arguments); end
 
   # Returns the value of attribute arguments.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#133
+  # source://prism/lib/prism/desugar_compiler.rb#133
   def arguments; end
 
   # Desugar `x ||= y` to `x || x = y`
   #
-  # source://prism//lib/prism/desugar_compiler.rb#144
+  # source://prism/lib/prism/desugar_compiler.rb#144
   def compile; end
 
   # Returns the value of attribute default_source.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#133
+  # source://prism/lib/prism/desugar_compiler.rb#133
   def default_source; end
 
   # Returns the value of attribute node.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#133
+  # source://prism/lib/prism/desugar_compiler.rb#133
   def node; end
 
   # Returns the value of attribute read_class.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#133
+  # source://prism/lib/prism/desugar_compiler.rb#133
   def read_class; end
 
   # Returns the value of attribute write_class.
   #
-  # source://prism//lib/prism/desugar_compiler.rb#133
+  # source://prism/lib/prism/desugar_compiler.rb#133
   def write_class; end
 end
 
@@ -11295,2491 +11295,2491 @@ end
 #     integer = result.value.statements.body.first.receiver.receiver
 #     dispatcher.dispatch_once(integer)
 #
-# source://prism//lib/prism/dispatcher.rb#42
+# source://prism/lib/prism/dispatcher.rb#42
 class Prism::Dispatcher < ::Prism::Visitor
   # Initialize a new dispatcher.
   #
   # @return [Dispatcher] a new instance of Dispatcher
   #
-  # source://prism//lib/prism/dispatcher.rb#47
+  # source://prism/lib/prism/dispatcher.rb#47
   def initialize; end
 
   # Walks `root` dispatching events to all registered listeners.
   #
   # def dispatch: (Node) -> void
   #
-  # source://prism//lib/prism/visitor.rb#17
+  # source://prism/lib/prism/visitor.rb#17
   def dispatch(node); end
 
   # Dispatches a single event for `node` to all registered listeners.
   #
   # def dispatch_once: (Node) -> void
   #
-  # source://prism//lib/prism/dispatcher.rb#66
+  # source://prism/lib/prism/dispatcher.rb#66
   def dispatch_once(node); end
 
   # attr_reader listeners: Hash[Symbol, Array[Listener]]
   #
-  # source://prism//lib/prism/dispatcher.rb#44
+  # source://prism/lib/prism/dispatcher.rb#44
   def listeners; end
 
   # Register a listener for one or more events.
   #
   # def register: (Listener, *Symbol) -> void
   #
-  # source://prism//lib/prism/dispatcher.rb#54
+  # source://prism/lib/prism/dispatcher.rb#54
   def register(listener, *events); end
 
   # Dispatch enter and leave events for AliasGlobalVariableNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#72
+  # source://prism/lib/prism/dispatcher.rb#72
   def visit_alias_global_variable_node(node); end
 
   # Dispatch enter and leave events for AliasMethodNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#80
+  # source://prism/lib/prism/dispatcher.rb#80
   def visit_alias_method_node(node); end
 
   # Dispatch enter and leave events for AlternationPatternNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#88
+  # source://prism/lib/prism/dispatcher.rb#88
   def visit_alternation_pattern_node(node); end
 
   # Dispatch enter and leave events for AndNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#96
+  # source://prism/lib/prism/dispatcher.rb#96
   def visit_and_node(node); end
 
   # Dispatch enter and leave events for ArgumentsNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#104
+  # source://prism/lib/prism/dispatcher.rb#104
   def visit_arguments_node(node); end
 
   # Dispatch enter and leave events for ArrayNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#112
+  # source://prism/lib/prism/dispatcher.rb#112
   def visit_array_node(node); end
 
   # Dispatch enter and leave events for ArrayPatternNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#120
+  # source://prism/lib/prism/dispatcher.rb#120
   def visit_array_pattern_node(node); end
 
   # Dispatch enter and leave events for AssocNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#128
+  # source://prism/lib/prism/dispatcher.rb#128
   def visit_assoc_node(node); end
 
   # Dispatch enter and leave events for AssocSplatNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#136
+  # source://prism/lib/prism/dispatcher.rb#136
   def visit_assoc_splat_node(node); end
 
   # Dispatch enter and leave events for BackReferenceReadNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#144
+  # source://prism/lib/prism/dispatcher.rb#144
   def visit_back_reference_read_node(node); end
 
   # Dispatch enter and leave events for BeginNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#152
+  # source://prism/lib/prism/dispatcher.rb#152
   def visit_begin_node(node); end
 
   # Dispatch enter and leave events for BlockArgumentNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#160
+  # source://prism/lib/prism/dispatcher.rb#160
   def visit_block_argument_node(node); end
 
   # Dispatch enter and leave events for BlockLocalVariableNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#168
+  # source://prism/lib/prism/dispatcher.rb#168
   def visit_block_local_variable_node(node); end
 
   # Dispatch enter and leave events for BlockNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#176
+  # source://prism/lib/prism/dispatcher.rb#176
   def visit_block_node(node); end
 
   # Dispatch enter and leave events for BlockParameterNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#184
+  # source://prism/lib/prism/dispatcher.rb#184
   def visit_block_parameter_node(node); end
 
   # Dispatch enter and leave events for BlockParametersNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#192
+  # source://prism/lib/prism/dispatcher.rb#192
   def visit_block_parameters_node(node); end
 
   # Dispatch enter and leave events for BreakNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#200
+  # source://prism/lib/prism/dispatcher.rb#200
   def visit_break_node(node); end
 
   # Dispatch enter and leave events for CallAndWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#208
+  # source://prism/lib/prism/dispatcher.rb#208
   def visit_call_and_write_node(node); end
 
   # Dispatch enter and leave events for CallNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#216
+  # source://prism/lib/prism/dispatcher.rb#216
   def visit_call_node(node); end
 
   # Dispatch enter and leave events for CallOperatorWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#224
+  # source://prism/lib/prism/dispatcher.rb#224
   def visit_call_operator_write_node(node); end
 
   # Dispatch enter and leave events for CallOrWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#232
+  # source://prism/lib/prism/dispatcher.rb#232
   def visit_call_or_write_node(node); end
 
   # Dispatch enter and leave events for CallTargetNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#240
+  # source://prism/lib/prism/dispatcher.rb#240
   def visit_call_target_node(node); end
 
   # Dispatch enter and leave events for CapturePatternNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#248
+  # source://prism/lib/prism/dispatcher.rb#248
   def visit_capture_pattern_node(node); end
 
   # Dispatch enter and leave events for CaseMatchNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#256
+  # source://prism/lib/prism/dispatcher.rb#256
   def visit_case_match_node(node); end
 
   # Dispatch enter and leave events for CaseNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#264
+  # source://prism/lib/prism/dispatcher.rb#264
   def visit_case_node(node); end
 
   # Dispatch enter and leave events for ClassNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#272
+  # source://prism/lib/prism/dispatcher.rb#272
   def visit_class_node(node); end
 
   # Dispatch enter and leave events for ClassVariableAndWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#280
+  # source://prism/lib/prism/dispatcher.rb#280
   def visit_class_variable_and_write_node(node); end
 
   # Dispatch enter and leave events for ClassVariableOperatorWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#288
+  # source://prism/lib/prism/dispatcher.rb#288
   def visit_class_variable_operator_write_node(node); end
 
   # Dispatch enter and leave events for ClassVariableOrWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#296
+  # source://prism/lib/prism/dispatcher.rb#296
   def visit_class_variable_or_write_node(node); end
 
   # Dispatch enter and leave events for ClassVariableReadNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#304
+  # source://prism/lib/prism/dispatcher.rb#304
   def visit_class_variable_read_node(node); end
 
   # Dispatch enter and leave events for ClassVariableTargetNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#312
+  # source://prism/lib/prism/dispatcher.rb#312
   def visit_class_variable_target_node(node); end
 
   # Dispatch enter and leave events for ClassVariableWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#320
+  # source://prism/lib/prism/dispatcher.rb#320
   def visit_class_variable_write_node(node); end
 
   # Dispatch enter and leave events for ConstantAndWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#328
+  # source://prism/lib/prism/dispatcher.rb#328
   def visit_constant_and_write_node(node); end
 
   # Dispatch enter and leave events for ConstantOperatorWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#336
+  # source://prism/lib/prism/dispatcher.rb#336
   def visit_constant_operator_write_node(node); end
 
   # Dispatch enter and leave events for ConstantOrWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#344
+  # source://prism/lib/prism/dispatcher.rb#344
   def visit_constant_or_write_node(node); end
 
   # Dispatch enter and leave events for ConstantPathAndWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#352
+  # source://prism/lib/prism/dispatcher.rb#352
   def visit_constant_path_and_write_node(node); end
 
   # Dispatch enter and leave events for ConstantPathNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#360
+  # source://prism/lib/prism/dispatcher.rb#360
   def visit_constant_path_node(node); end
 
   # Dispatch enter and leave events for ConstantPathOperatorWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#368
+  # source://prism/lib/prism/dispatcher.rb#368
   def visit_constant_path_operator_write_node(node); end
 
   # Dispatch enter and leave events for ConstantPathOrWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#376
+  # source://prism/lib/prism/dispatcher.rb#376
   def visit_constant_path_or_write_node(node); end
 
   # Dispatch enter and leave events for ConstantPathTargetNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#384
+  # source://prism/lib/prism/dispatcher.rb#384
   def visit_constant_path_target_node(node); end
 
   # Dispatch enter and leave events for ConstantPathWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#392
+  # source://prism/lib/prism/dispatcher.rb#392
   def visit_constant_path_write_node(node); end
 
   # Dispatch enter and leave events for ConstantReadNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#400
+  # source://prism/lib/prism/dispatcher.rb#400
   def visit_constant_read_node(node); end
 
   # Dispatch enter and leave events for ConstantTargetNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#408
+  # source://prism/lib/prism/dispatcher.rb#408
   def visit_constant_target_node(node); end
 
   # Dispatch enter and leave events for ConstantWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#416
+  # source://prism/lib/prism/dispatcher.rb#416
   def visit_constant_write_node(node); end
 
   # Dispatch enter and leave events for DefNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#424
+  # source://prism/lib/prism/dispatcher.rb#424
   def visit_def_node(node); end
 
   # Dispatch enter and leave events for DefinedNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#432
+  # source://prism/lib/prism/dispatcher.rb#432
   def visit_defined_node(node); end
 
   # Dispatch enter and leave events for ElseNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#440
+  # source://prism/lib/prism/dispatcher.rb#440
   def visit_else_node(node); end
 
   # Dispatch enter and leave events for EmbeddedStatementsNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#448
+  # source://prism/lib/prism/dispatcher.rb#448
   def visit_embedded_statements_node(node); end
 
   # Dispatch enter and leave events for EmbeddedVariableNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#456
+  # source://prism/lib/prism/dispatcher.rb#456
   def visit_embedded_variable_node(node); end
 
   # Dispatch enter and leave events for EnsureNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#464
+  # source://prism/lib/prism/dispatcher.rb#464
   def visit_ensure_node(node); end
 
   # Dispatch enter and leave events for FalseNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#472
+  # source://prism/lib/prism/dispatcher.rb#472
   def visit_false_node(node); end
 
   # Dispatch enter and leave events for FindPatternNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#480
+  # source://prism/lib/prism/dispatcher.rb#480
   def visit_find_pattern_node(node); end
 
   # Dispatch enter and leave events for FlipFlopNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#488
+  # source://prism/lib/prism/dispatcher.rb#488
   def visit_flip_flop_node(node); end
 
   # Dispatch enter and leave events for FloatNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#496
+  # source://prism/lib/prism/dispatcher.rb#496
   def visit_float_node(node); end
 
   # Dispatch enter and leave events for ForNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#504
+  # source://prism/lib/prism/dispatcher.rb#504
   def visit_for_node(node); end
 
   # Dispatch enter and leave events for ForwardingArgumentsNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#512
+  # source://prism/lib/prism/dispatcher.rb#512
   def visit_forwarding_arguments_node(node); end
 
   # Dispatch enter and leave events for ForwardingParameterNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#520
+  # source://prism/lib/prism/dispatcher.rb#520
   def visit_forwarding_parameter_node(node); end
 
   # Dispatch enter and leave events for ForwardingSuperNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#528
+  # source://prism/lib/prism/dispatcher.rb#528
   def visit_forwarding_super_node(node); end
 
   # Dispatch enter and leave events for GlobalVariableAndWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#536
+  # source://prism/lib/prism/dispatcher.rb#536
   def visit_global_variable_and_write_node(node); end
 
   # Dispatch enter and leave events for GlobalVariableOperatorWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#544
+  # source://prism/lib/prism/dispatcher.rb#544
   def visit_global_variable_operator_write_node(node); end
 
   # Dispatch enter and leave events for GlobalVariableOrWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#552
+  # source://prism/lib/prism/dispatcher.rb#552
   def visit_global_variable_or_write_node(node); end
 
   # Dispatch enter and leave events for GlobalVariableReadNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#560
+  # source://prism/lib/prism/dispatcher.rb#560
   def visit_global_variable_read_node(node); end
 
   # Dispatch enter and leave events for GlobalVariableTargetNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#568
+  # source://prism/lib/prism/dispatcher.rb#568
   def visit_global_variable_target_node(node); end
 
   # Dispatch enter and leave events for GlobalVariableWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#576
+  # source://prism/lib/prism/dispatcher.rb#576
   def visit_global_variable_write_node(node); end
 
   # Dispatch enter and leave events for HashNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#584
+  # source://prism/lib/prism/dispatcher.rb#584
   def visit_hash_node(node); end
 
   # Dispatch enter and leave events for HashPatternNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#592
+  # source://prism/lib/prism/dispatcher.rb#592
   def visit_hash_pattern_node(node); end
 
   # Dispatch enter and leave events for IfNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#600
+  # source://prism/lib/prism/dispatcher.rb#600
   def visit_if_node(node); end
 
   # Dispatch enter and leave events for ImaginaryNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#608
+  # source://prism/lib/prism/dispatcher.rb#608
   def visit_imaginary_node(node); end
 
   # Dispatch enter and leave events for ImplicitNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#616
+  # source://prism/lib/prism/dispatcher.rb#616
   def visit_implicit_node(node); end
 
   # Dispatch enter and leave events for ImplicitRestNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#624
+  # source://prism/lib/prism/dispatcher.rb#624
   def visit_implicit_rest_node(node); end
 
   # Dispatch enter and leave events for InNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#632
+  # source://prism/lib/prism/dispatcher.rb#632
   def visit_in_node(node); end
 
   # Dispatch enter and leave events for IndexAndWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#640
+  # source://prism/lib/prism/dispatcher.rb#640
   def visit_index_and_write_node(node); end
 
   # Dispatch enter and leave events for IndexOperatorWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#648
+  # source://prism/lib/prism/dispatcher.rb#648
   def visit_index_operator_write_node(node); end
 
   # Dispatch enter and leave events for IndexOrWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#656
+  # source://prism/lib/prism/dispatcher.rb#656
   def visit_index_or_write_node(node); end
 
   # Dispatch enter and leave events for IndexTargetNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#664
+  # source://prism/lib/prism/dispatcher.rb#664
   def visit_index_target_node(node); end
 
   # Dispatch enter and leave events for InstanceVariableAndWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#672
+  # source://prism/lib/prism/dispatcher.rb#672
   def visit_instance_variable_and_write_node(node); end
 
   # Dispatch enter and leave events for InstanceVariableOperatorWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#680
+  # source://prism/lib/prism/dispatcher.rb#680
   def visit_instance_variable_operator_write_node(node); end
 
   # Dispatch enter and leave events for InstanceVariableOrWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#688
+  # source://prism/lib/prism/dispatcher.rb#688
   def visit_instance_variable_or_write_node(node); end
 
   # Dispatch enter and leave events for InstanceVariableReadNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#696
+  # source://prism/lib/prism/dispatcher.rb#696
   def visit_instance_variable_read_node(node); end
 
   # Dispatch enter and leave events for InstanceVariableTargetNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#704
+  # source://prism/lib/prism/dispatcher.rb#704
   def visit_instance_variable_target_node(node); end
 
   # Dispatch enter and leave events for InstanceVariableWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#712
+  # source://prism/lib/prism/dispatcher.rb#712
   def visit_instance_variable_write_node(node); end
 
   # Dispatch enter and leave events for IntegerNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#720
+  # source://prism/lib/prism/dispatcher.rb#720
   def visit_integer_node(node); end
 
   # Dispatch enter and leave events for InterpolatedMatchLastLineNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#728
+  # source://prism/lib/prism/dispatcher.rb#728
   def visit_interpolated_match_last_line_node(node); end
 
   # Dispatch enter and leave events for InterpolatedRegularExpressionNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#736
+  # source://prism/lib/prism/dispatcher.rb#736
   def visit_interpolated_regular_expression_node(node); end
 
   # Dispatch enter and leave events for InterpolatedStringNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#744
+  # source://prism/lib/prism/dispatcher.rb#744
   def visit_interpolated_string_node(node); end
 
   # Dispatch enter and leave events for InterpolatedSymbolNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#752
+  # source://prism/lib/prism/dispatcher.rb#752
   def visit_interpolated_symbol_node(node); end
 
   # Dispatch enter and leave events for InterpolatedXStringNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#760
+  # source://prism/lib/prism/dispatcher.rb#760
   def visit_interpolated_x_string_node(node); end
 
   # Dispatch enter and leave events for ItLocalVariableReadNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#768
+  # source://prism/lib/prism/dispatcher.rb#768
   def visit_it_local_variable_read_node(node); end
 
   # Dispatch enter and leave events for ItParametersNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#776
+  # source://prism/lib/prism/dispatcher.rb#776
   def visit_it_parameters_node(node); end
 
   # Dispatch enter and leave events for KeywordHashNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#784
+  # source://prism/lib/prism/dispatcher.rb#784
   def visit_keyword_hash_node(node); end
 
   # Dispatch enter and leave events for KeywordRestParameterNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#792
+  # source://prism/lib/prism/dispatcher.rb#792
   def visit_keyword_rest_parameter_node(node); end
 
   # Dispatch enter and leave events for LambdaNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#800
+  # source://prism/lib/prism/dispatcher.rb#800
   def visit_lambda_node(node); end
 
   # Dispatch enter and leave events for LocalVariableAndWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#808
+  # source://prism/lib/prism/dispatcher.rb#808
   def visit_local_variable_and_write_node(node); end
 
   # Dispatch enter and leave events for LocalVariableOperatorWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#816
+  # source://prism/lib/prism/dispatcher.rb#816
   def visit_local_variable_operator_write_node(node); end
 
   # Dispatch enter and leave events for LocalVariableOrWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#824
+  # source://prism/lib/prism/dispatcher.rb#824
   def visit_local_variable_or_write_node(node); end
 
   # Dispatch enter and leave events for LocalVariableReadNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#832
+  # source://prism/lib/prism/dispatcher.rb#832
   def visit_local_variable_read_node(node); end
 
   # Dispatch enter and leave events for LocalVariableTargetNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#840
+  # source://prism/lib/prism/dispatcher.rb#840
   def visit_local_variable_target_node(node); end
 
   # Dispatch enter and leave events for LocalVariableWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#848
+  # source://prism/lib/prism/dispatcher.rb#848
   def visit_local_variable_write_node(node); end
 
   # Dispatch enter and leave events for MatchLastLineNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#856
+  # source://prism/lib/prism/dispatcher.rb#856
   def visit_match_last_line_node(node); end
 
   # Dispatch enter and leave events for MatchPredicateNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#864
+  # source://prism/lib/prism/dispatcher.rb#864
   def visit_match_predicate_node(node); end
 
   # Dispatch enter and leave events for MatchRequiredNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#872
+  # source://prism/lib/prism/dispatcher.rb#872
   def visit_match_required_node(node); end
 
   # Dispatch enter and leave events for MatchWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#880
+  # source://prism/lib/prism/dispatcher.rb#880
   def visit_match_write_node(node); end
 
   # Dispatch enter and leave events for MissingNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#888
+  # source://prism/lib/prism/dispatcher.rb#888
   def visit_missing_node(node); end
 
   # Dispatch enter and leave events for ModuleNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#896
+  # source://prism/lib/prism/dispatcher.rb#896
   def visit_module_node(node); end
 
   # Dispatch enter and leave events for MultiTargetNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#904
+  # source://prism/lib/prism/dispatcher.rb#904
   def visit_multi_target_node(node); end
 
   # Dispatch enter and leave events for MultiWriteNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#912
+  # source://prism/lib/prism/dispatcher.rb#912
   def visit_multi_write_node(node); end
 
   # Dispatch enter and leave events for NextNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#920
+  # source://prism/lib/prism/dispatcher.rb#920
   def visit_next_node(node); end
 
   # Dispatch enter and leave events for NilNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#928
+  # source://prism/lib/prism/dispatcher.rb#928
   def visit_nil_node(node); end
 
   # Dispatch enter and leave events for NoKeywordsParameterNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#936
+  # source://prism/lib/prism/dispatcher.rb#936
   def visit_no_keywords_parameter_node(node); end
 
   # Dispatch enter and leave events for NumberedParametersNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#944
+  # source://prism/lib/prism/dispatcher.rb#944
   def visit_numbered_parameters_node(node); end
 
   # Dispatch enter and leave events for NumberedReferenceReadNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#952
+  # source://prism/lib/prism/dispatcher.rb#952
   def visit_numbered_reference_read_node(node); end
 
   # Dispatch enter and leave events for OptionalKeywordParameterNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#960
+  # source://prism/lib/prism/dispatcher.rb#960
   def visit_optional_keyword_parameter_node(node); end
 
   # Dispatch enter and leave events for OptionalParameterNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#968
+  # source://prism/lib/prism/dispatcher.rb#968
   def visit_optional_parameter_node(node); end
 
   # Dispatch enter and leave events for OrNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#976
+  # source://prism/lib/prism/dispatcher.rb#976
   def visit_or_node(node); end
 
   # Dispatch enter and leave events for ParametersNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#984
+  # source://prism/lib/prism/dispatcher.rb#984
   def visit_parameters_node(node); end
 
   # Dispatch enter and leave events for ParenthesesNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#992
+  # source://prism/lib/prism/dispatcher.rb#992
   def visit_parentheses_node(node); end
 
   # Dispatch enter and leave events for PinnedExpressionNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1000
+  # source://prism/lib/prism/dispatcher.rb#1000
   def visit_pinned_expression_node(node); end
 
   # Dispatch enter and leave events for PinnedVariableNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1008
+  # source://prism/lib/prism/dispatcher.rb#1008
   def visit_pinned_variable_node(node); end
 
   # Dispatch enter and leave events for PostExecutionNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1016
+  # source://prism/lib/prism/dispatcher.rb#1016
   def visit_post_execution_node(node); end
 
   # Dispatch enter and leave events for PreExecutionNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1024
+  # source://prism/lib/prism/dispatcher.rb#1024
   def visit_pre_execution_node(node); end
 
   # Dispatch enter and leave events for ProgramNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1032
+  # source://prism/lib/prism/dispatcher.rb#1032
   def visit_program_node(node); end
 
   # Dispatch enter and leave events for RangeNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1040
+  # source://prism/lib/prism/dispatcher.rb#1040
   def visit_range_node(node); end
 
   # Dispatch enter and leave events for RationalNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1048
+  # source://prism/lib/prism/dispatcher.rb#1048
   def visit_rational_node(node); end
 
   # Dispatch enter and leave events for RedoNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1056
+  # source://prism/lib/prism/dispatcher.rb#1056
   def visit_redo_node(node); end
 
   # Dispatch enter and leave events for RegularExpressionNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1064
+  # source://prism/lib/prism/dispatcher.rb#1064
   def visit_regular_expression_node(node); end
 
   # Dispatch enter and leave events for RequiredKeywordParameterNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1072
+  # source://prism/lib/prism/dispatcher.rb#1072
   def visit_required_keyword_parameter_node(node); end
 
   # Dispatch enter and leave events for RequiredParameterNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1080
+  # source://prism/lib/prism/dispatcher.rb#1080
   def visit_required_parameter_node(node); end
 
   # Dispatch enter and leave events for RescueModifierNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1088
+  # source://prism/lib/prism/dispatcher.rb#1088
   def visit_rescue_modifier_node(node); end
 
   # Dispatch enter and leave events for RescueNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1096
+  # source://prism/lib/prism/dispatcher.rb#1096
   def visit_rescue_node(node); end
 
   # Dispatch enter and leave events for RestParameterNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1104
+  # source://prism/lib/prism/dispatcher.rb#1104
   def visit_rest_parameter_node(node); end
 
   # Dispatch enter and leave events for RetryNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1112
+  # source://prism/lib/prism/dispatcher.rb#1112
   def visit_retry_node(node); end
 
   # Dispatch enter and leave events for ReturnNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1120
+  # source://prism/lib/prism/dispatcher.rb#1120
   def visit_return_node(node); end
 
   # Dispatch enter and leave events for SelfNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1128
+  # source://prism/lib/prism/dispatcher.rb#1128
   def visit_self_node(node); end
 
   # Dispatch enter and leave events for ShareableConstantNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1136
+  # source://prism/lib/prism/dispatcher.rb#1136
   def visit_shareable_constant_node(node); end
 
   # Dispatch enter and leave events for SingletonClassNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1144
+  # source://prism/lib/prism/dispatcher.rb#1144
   def visit_singleton_class_node(node); end
 
   # Dispatch enter and leave events for SourceEncodingNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1152
+  # source://prism/lib/prism/dispatcher.rb#1152
   def visit_source_encoding_node(node); end
 
   # Dispatch enter and leave events for SourceFileNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1160
+  # source://prism/lib/prism/dispatcher.rb#1160
   def visit_source_file_node(node); end
 
   # Dispatch enter and leave events for SourceLineNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1168
+  # source://prism/lib/prism/dispatcher.rb#1168
   def visit_source_line_node(node); end
 
   # Dispatch enter and leave events for SplatNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1176
+  # source://prism/lib/prism/dispatcher.rb#1176
   def visit_splat_node(node); end
 
   # Dispatch enter and leave events for StatementsNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1184
+  # source://prism/lib/prism/dispatcher.rb#1184
   def visit_statements_node(node); end
 
   # Dispatch enter and leave events for StringNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1192
+  # source://prism/lib/prism/dispatcher.rb#1192
   def visit_string_node(node); end
 
   # Dispatch enter and leave events for SuperNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1200
+  # source://prism/lib/prism/dispatcher.rb#1200
   def visit_super_node(node); end
 
   # Dispatch enter and leave events for SymbolNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1208
+  # source://prism/lib/prism/dispatcher.rb#1208
   def visit_symbol_node(node); end
 
   # Dispatch enter and leave events for TrueNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1216
+  # source://prism/lib/prism/dispatcher.rb#1216
   def visit_true_node(node); end
 
   # Dispatch enter and leave events for UndefNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1224
+  # source://prism/lib/prism/dispatcher.rb#1224
   def visit_undef_node(node); end
 
   # Dispatch enter and leave events for UnlessNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1232
+  # source://prism/lib/prism/dispatcher.rb#1232
   def visit_unless_node(node); end
 
   # Dispatch enter and leave events for UntilNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1240
+  # source://prism/lib/prism/dispatcher.rb#1240
   def visit_until_node(node); end
 
   # Dispatch enter and leave events for WhenNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1248
+  # source://prism/lib/prism/dispatcher.rb#1248
   def visit_when_node(node); end
 
   # Dispatch enter and leave events for WhileNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1256
+  # source://prism/lib/prism/dispatcher.rb#1256
   def visit_while_node(node); end
 
   # Dispatch enter and leave events for XStringNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1264
+  # source://prism/lib/prism/dispatcher.rb#1264
   def visit_x_string_node(node); end
 
   # Dispatch enter and leave events for YieldNode nodes and continue
   # walking the tree.
   #
-  # source://prism//lib/prism/dispatcher.rb#1272
+  # source://prism/lib/prism/dispatcher.rb#1272
   def visit_yield_node(node); end
 end
 
-# source://prism//lib/prism/dispatcher.rb#1278
+# source://prism/lib/prism/dispatcher.rb#1278
 class Prism::Dispatcher::DispatchOnce < ::Prism::Visitor
   # @return [DispatchOnce] a new instance of DispatchOnce
   #
-  # source://prism//lib/prism/dispatcher.rb#1281
+  # source://prism/lib/prism/dispatcher.rb#1281
   def initialize(listeners); end
 
   # Returns the value of attribute listeners.
   #
-  # source://prism//lib/prism/dispatcher.rb#1279
+  # source://prism/lib/prism/dispatcher.rb#1279
   def listeners; end
 
   # Dispatch enter and leave events for AliasGlobalVariableNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1286
+  # source://prism/lib/prism/dispatcher.rb#1286
   def visit_alias_global_variable_node(node); end
 
   # Dispatch enter and leave events for AliasMethodNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1292
+  # source://prism/lib/prism/dispatcher.rb#1292
   def visit_alias_method_node(node); end
 
   # Dispatch enter and leave events for AlternationPatternNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1298
+  # source://prism/lib/prism/dispatcher.rb#1298
   def visit_alternation_pattern_node(node); end
 
   # Dispatch enter and leave events for AndNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1304
+  # source://prism/lib/prism/dispatcher.rb#1304
   def visit_and_node(node); end
 
   # Dispatch enter and leave events for ArgumentsNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1310
+  # source://prism/lib/prism/dispatcher.rb#1310
   def visit_arguments_node(node); end
 
   # Dispatch enter and leave events for ArrayNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1316
+  # source://prism/lib/prism/dispatcher.rb#1316
   def visit_array_node(node); end
 
   # Dispatch enter and leave events for ArrayPatternNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1322
+  # source://prism/lib/prism/dispatcher.rb#1322
   def visit_array_pattern_node(node); end
 
   # Dispatch enter and leave events for AssocNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1328
+  # source://prism/lib/prism/dispatcher.rb#1328
   def visit_assoc_node(node); end
 
   # Dispatch enter and leave events for AssocSplatNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1334
+  # source://prism/lib/prism/dispatcher.rb#1334
   def visit_assoc_splat_node(node); end
 
   # Dispatch enter and leave events for BackReferenceReadNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1340
+  # source://prism/lib/prism/dispatcher.rb#1340
   def visit_back_reference_read_node(node); end
 
   # Dispatch enter and leave events for BeginNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1346
+  # source://prism/lib/prism/dispatcher.rb#1346
   def visit_begin_node(node); end
 
   # Dispatch enter and leave events for BlockArgumentNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1352
+  # source://prism/lib/prism/dispatcher.rb#1352
   def visit_block_argument_node(node); end
 
   # Dispatch enter and leave events for BlockLocalVariableNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1358
+  # source://prism/lib/prism/dispatcher.rb#1358
   def visit_block_local_variable_node(node); end
 
   # Dispatch enter and leave events for BlockNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1364
+  # source://prism/lib/prism/dispatcher.rb#1364
   def visit_block_node(node); end
 
   # Dispatch enter and leave events for BlockParameterNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1370
+  # source://prism/lib/prism/dispatcher.rb#1370
   def visit_block_parameter_node(node); end
 
   # Dispatch enter and leave events for BlockParametersNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1376
+  # source://prism/lib/prism/dispatcher.rb#1376
   def visit_block_parameters_node(node); end
 
   # Dispatch enter and leave events for BreakNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1382
+  # source://prism/lib/prism/dispatcher.rb#1382
   def visit_break_node(node); end
 
   # Dispatch enter and leave events for CallAndWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1388
+  # source://prism/lib/prism/dispatcher.rb#1388
   def visit_call_and_write_node(node); end
 
   # Dispatch enter and leave events for CallNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1394
+  # source://prism/lib/prism/dispatcher.rb#1394
   def visit_call_node(node); end
 
   # Dispatch enter and leave events for CallOperatorWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1400
+  # source://prism/lib/prism/dispatcher.rb#1400
   def visit_call_operator_write_node(node); end
 
   # Dispatch enter and leave events for CallOrWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1406
+  # source://prism/lib/prism/dispatcher.rb#1406
   def visit_call_or_write_node(node); end
 
   # Dispatch enter and leave events for CallTargetNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1412
+  # source://prism/lib/prism/dispatcher.rb#1412
   def visit_call_target_node(node); end
 
   # Dispatch enter and leave events for CapturePatternNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1418
+  # source://prism/lib/prism/dispatcher.rb#1418
   def visit_capture_pattern_node(node); end
 
   # Dispatch enter and leave events for CaseMatchNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1424
+  # source://prism/lib/prism/dispatcher.rb#1424
   def visit_case_match_node(node); end
 
   # Dispatch enter and leave events for CaseNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1430
+  # source://prism/lib/prism/dispatcher.rb#1430
   def visit_case_node(node); end
 
   # Dispatch enter and leave events for ClassNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1436
+  # source://prism/lib/prism/dispatcher.rb#1436
   def visit_class_node(node); end
 
   # Dispatch enter and leave events for ClassVariableAndWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1442
+  # source://prism/lib/prism/dispatcher.rb#1442
   def visit_class_variable_and_write_node(node); end
 
   # Dispatch enter and leave events for ClassVariableOperatorWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1448
+  # source://prism/lib/prism/dispatcher.rb#1448
   def visit_class_variable_operator_write_node(node); end
 
   # Dispatch enter and leave events for ClassVariableOrWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1454
+  # source://prism/lib/prism/dispatcher.rb#1454
   def visit_class_variable_or_write_node(node); end
 
   # Dispatch enter and leave events for ClassVariableReadNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1460
+  # source://prism/lib/prism/dispatcher.rb#1460
   def visit_class_variable_read_node(node); end
 
   # Dispatch enter and leave events for ClassVariableTargetNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1466
+  # source://prism/lib/prism/dispatcher.rb#1466
   def visit_class_variable_target_node(node); end
 
   # Dispatch enter and leave events for ClassVariableWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1472
+  # source://prism/lib/prism/dispatcher.rb#1472
   def visit_class_variable_write_node(node); end
 
   # Dispatch enter and leave events for ConstantAndWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1478
+  # source://prism/lib/prism/dispatcher.rb#1478
   def visit_constant_and_write_node(node); end
 
   # Dispatch enter and leave events for ConstantOperatorWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1484
+  # source://prism/lib/prism/dispatcher.rb#1484
   def visit_constant_operator_write_node(node); end
 
   # Dispatch enter and leave events for ConstantOrWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1490
+  # source://prism/lib/prism/dispatcher.rb#1490
   def visit_constant_or_write_node(node); end
 
   # Dispatch enter and leave events for ConstantPathAndWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1496
+  # source://prism/lib/prism/dispatcher.rb#1496
   def visit_constant_path_and_write_node(node); end
 
   # Dispatch enter and leave events for ConstantPathNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1502
+  # source://prism/lib/prism/dispatcher.rb#1502
   def visit_constant_path_node(node); end
 
   # Dispatch enter and leave events for ConstantPathOperatorWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1508
+  # source://prism/lib/prism/dispatcher.rb#1508
   def visit_constant_path_operator_write_node(node); end
 
   # Dispatch enter and leave events for ConstantPathOrWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1514
+  # source://prism/lib/prism/dispatcher.rb#1514
   def visit_constant_path_or_write_node(node); end
 
   # Dispatch enter and leave events for ConstantPathTargetNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1520
+  # source://prism/lib/prism/dispatcher.rb#1520
   def visit_constant_path_target_node(node); end
 
   # Dispatch enter and leave events for ConstantPathWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1526
+  # source://prism/lib/prism/dispatcher.rb#1526
   def visit_constant_path_write_node(node); end
 
   # Dispatch enter and leave events for ConstantReadNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1532
+  # source://prism/lib/prism/dispatcher.rb#1532
   def visit_constant_read_node(node); end
 
   # Dispatch enter and leave events for ConstantTargetNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1538
+  # source://prism/lib/prism/dispatcher.rb#1538
   def visit_constant_target_node(node); end
 
   # Dispatch enter and leave events for ConstantWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1544
+  # source://prism/lib/prism/dispatcher.rb#1544
   def visit_constant_write_node(node); end
 
   # Dispatch enter and leave events for DefNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1550
+  # source://prism/lib/prism/dispatcher.rb#1550
   def visit_def_node(node); end
 
   # Dispatch enter and leave events for DefinedNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1556
+  # source://prism/lib/prism/dispatcher.rb#1556
   def visit_defined_node(node); end
 
   # Dispatch enter and leave events for ElseNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1562
+  # source://prism/lib/prism/dispatcher.rb#1562
   def visit_else_node(node); end
 
   # Dispatch enter and leave events for EmbeddedStatementsNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1568
+  # source://prism/lib/prism/dispatcher.rb#1568
   def visit_embedded_statements_node(node); end
 
   # Dispatch enter and leave events for EmbeddedVariableNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1574
+  # source://prism/lib/prism/dispatcher.rb#1574
   def visit_embedded_variable_node(node); end
 
   # Dispatch enter and leave events for EnsureNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1580
+  # source://prism/lib/prism/dispatcher.rb#1580
   def visit_ensure_node(node); end
 
   # Dispatch enter and leave events for FalseNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1586
+  # source://prism/lib/prism/dispatcher.rb#1586
   def visit_false_node(node); end
 
   # Dispatch enter and leave events for FindPatternNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1592
+  # source://prism/lib/prism/dispatcher.rb#1592
   def visit_find_pattern_node(node); end
 
   # Dispatch enter and leave events for FlipFlopNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1598
+  # source://prism/lib/prism/dispatcher.rb#1598
   def visit_flip_flop_node(node); end
 
   # Dispatch enter and leave events for FloatNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1604
+  # source://prism/lib/prism/dispatcher.rb#1604
   def visit_float_node(node); end
 
   # Dispatch enter and leave events for ForNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1610
+  # source://prism/lib/prism/dispatcher.rb#1610
   def visit_for_node(node); end
 
   # Dispatch enter and leave events for ForwardingArgumentsNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1616
+  # source://prism/lib/prism/dispatcher.rb#1616
   def visit_forwarding_arguments_node(node); end
 
   # Dispatch enter and leave events for ForwardingParameterNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1622
+  # source://prism/lib/prism/dispatcher.rb#1622
   def visit_forwarding_parameter_node(node); end
 
   # Dispatch enter and leave events for ForwardingSuperNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1628
+  # source://prism/lib/prism/dispatcher.rb#1628
   def visit_forwarding_super_node(node); end
 
   # Dispatch enter and leave events for GlobalVariableAndWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1634
+  # source://prism/lib/prism/dispatcher.rb#1634
   def visit_global_variable_and_write_node(node); end
 
   # Dispatch enter and leave events for GlobalVariableOperatorWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1640
+  # source://prism/lib/prism/dispatcher.rb#1640
   def visit_global_variable_operator_write_node(node); end
 
   # Dispatch enter and leave events for GlobalVariableOrWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1646
+  # source://prism/lib/prism/dispatcher.rb#1646
   def visit_global_variable_or_write_node(node); end
 
   # Dispatch enter and leave events for GlobalVariableReadNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1652
+  # source://prism/lib/prism/dispatcher.rb#1652
   def visit_global_variable_read_node(node); end
 
   # Dispatch enter and leave events for GlobalVariableTargetNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1658
+  # source://prism/lib/prism/dispatcher.rb#1658
   def visit_global_variable_target_node(node); end
 
   # Dispatch enter and leave events for GlobalVariableWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1664
+  # source://prism/lib/prism/dispatcher.rb#1664
   def visit_global_variable_write_node(node); end
 
   # Dispatch enter and leave events for HashNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1670
+  # source://prism/lib/prism/dispatcher.rb#1670
   def visit_hash_node(node); end
 
   # Dispatch enter and leave events for HashPatternNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1676
+  # source://prism/lib/prism/dispatcher.rb#1676
   def visit_hash_pattern_node(node); end
 
   # Dispatch enter and leave events for IfNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1682
+  # source://prism/lib/prism/dispatcher.rb#1682
   def visit_if_node(node); end
 
   # Dispatch enter and leave events for ImaginaryNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1688
+  # source://prism/lib/prism/dispatcher.rb#1688
   def visit_imaginary_node(node); end
 
   # Dispatch enter and leave events for ImplicitNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1694
+  # source://prism/lib/prism/dispatcher.rb#1694
   def visit_implicit_node(node); end
 
   # Dispatch enter and leave events for ImplicitRestNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1700
+  # source://prism/lib/prism/dispatcher.rb#1700
   def visit_implicit_rest_node(node); end
 
   # Dispatch enter and leave events for InNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1706
+  # source://prism/lib/prism/dispatcher.rb#1706
   def visit_in_node(node); end
 
   # Dispatch enter and leave events for IndexAndWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1712
+  # source://prism/lib/prism/dispatcher.rb#1712
   def visit_index_and_write_node(node); end
 
   # Dispatch enter and leave events for IndexOperatorWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1718
+  # source://prism/lib/prism/dispatcher.rb#1718
   def visit_index_operator_write_node(node); end
 
   # Dispatch enter and leave events for IndexOrWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1724
+  # source://prism/lib/prism/dispatcher.rb#1724
   def visit_index_or_write_node(node); end
 
   # Dispatch enter and leave events for IndexTargetNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1730
+  # source://prism/lib/prism/dispatcher.rb#1730
   def visit_index_target_node(node); end
 
   # Dispatch enter and leave events for InstanceVariableAndWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1736
+  # source://prism/lib/prism/dispatcher.rb#1736
   def visit_instance_variable_and_write_node(node); end
 
   # Dispatch enter and leave events for InstanceVariableOperatorWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1742
+  # source://prism/lib/prism/dispatcher.rb#1742
   def visit_instance_variable_operator_write_node(node); end
 
   # Dispatch enter and leave events for InstanceVariableOrWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1748
+  # source://prism/lib/prism/dispatcher.rb#1748
   def visit_instance_variable_or_write_node(node); end
 
   # Dispatch enter and leave events for InstanceVariableReadNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1754
+  # source://prism/lib/prism/dispatcher.rb#1754
   def visit_instance_variable_read_node(node); end
 
   # Dispatch enter and leave events for InstanceVariableTargetNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1760
+  # source://prism/lib/prism/dispatcher.rb#1760
   def visit_instance_variable_target_node(node); end
 
   # Dispatch enter and leave events for InstanceVariableWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1766
+  # source://prism/lib/prism/dispatcher.rb#1766
   def visit_instance_variable_write_node(node); end
 
   # Dispatch enter and leave events for IntegerNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1772
+  # source://prism/lib/prism/dispatcher.rb#1772
   def visit_integer_node(node); end
 
   # Dispatch enter and leave events for InterpolatedMatchLastLineNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1778
+  # source://prism/lib/prism/dispatcher.rb#1778
   def visit_interpolated_match_last_line_node(node); end
 
   # Dispatch enter and leave events for InterpolatedRegularExpressionNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1784
+  # source://prism/lib/prism/dispatcher.rb#1784
   def visit_interpolated_regular_expression_node(node); end
 
   # Dispatch enter and leave events for InterpolatedStringNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1790
+  # source://prism/lib/prism/dispatcher.rb#1790
   def visit_interpolated_string_node(node); end
 
   # Dispatch enter and leave events for InterpolatedSymbolNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1796
+  # source://prism/lib/prism/dispatcher.rb#1796
   def visit_interpolated_symbol_node(node); end
 
   # Dispatch enter and leave events for InterpolatedXStringNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1802
+  # source://prism/lib/prism/dispatcher.rb#1802
   def visit_interpolated_x_string_node(node); end
 
   # Dispatch enter and leave events for ItLocalVariableReadNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1808
+  # source://prism/lib/prism/dispatcher.rb#1808
   def visit_it_local_variable_read_node(node); end
 
   # Dispatch enter and leave events for ItParametersNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1814
+  # source://prism/lib/prism/dispatcher.rb#1814
   def visit_it_parameters_node(node); end
 
   # Dispatch enter and leave events for KeywordHashNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1820
+  # source://prism/lib/prism/dispatcher.rb#1820
   def visit_keyword_hash_node(node); end
 
   # Dispatch enter and leave events for KeywordRestParameterNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1826
+  # source://prism/lib/prism/dispatcher.rb#1826
   def visit_keyword_rest_parameter_node(node); end
 
   # Dispatch enter and leave events for LambdaNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1832
+  # source://prism/lib/prism/dispatcher.rb#1832
   def visit_lambda_node(node); end
 
   # Dispatch enter and leave events for LocalVariableAndWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1838
+  # source://prism/lib/prism/dispatcher.rb#1838
   def visit_local_variable_and_write_node(node); end
 
   # Dispatch enter and leave events for LocalVariableOperatorWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1844
+  # source://prism/lib/prism/dispatcher.rb#1844
   def visit_local_variable_operator_write_node(node); end
 
   # Dispatch enter and leave events for LocalVariableOrWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1850
+  # source://prism/lib/prism/dispatcher.rb#1850
   def visit_local_variable_or_write_node(node); end
 
   # Dispatch enter and leave events for LocalVariableReadNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1856
+  # source://prism/lib/prism/dispatcher.rb#1856
   def visit_local_variable_read_node(node); end
 
   # Dispatch enter and leave events for LocalVariableTargetNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1862
+  # source://prism/lib/prism/dispatcher.rb#1862
   def visit_local_variable_target_node(node); end
 
   # Dispatch enter and leave events for LocalVariableWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1868
+  # source://prism/lib/prism/dispatcher.rb#1868
   def visit_local_variable_write_node(node); end
 
   # Dispatch enter and leave events for MatchLastLineNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1874
+  # source://prism/lib/prism/dispatcher.rb#1874
   def visit_match_last_line_node(node); end
 
   # Dispatch enter and leave events for MatchPredicateNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1880
+  # source://prism/lib/prism/dispatcher.rb#1880
   def visit_match_predicate_node(node); end
 
   # Dispatch enter and leave events for MatchRequiredNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1886
+  # source://prism/lib/prism/dispatcher.rb#1886
   def visit_match_required_node(node); end
 
   # Dispatch enter and leave events for MatchWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1892
+  # source://prism/lib/prism/dispatcher.rb#1892
   def visit_match_write_node(node); end
 
   # Dispatch enter and leave events for MissingNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1898
+  # source://prism/lib/prism/dispatcher.rb#1898
   def visit_missing_node(node); end
 
   # Dispatch enter and leave events for ModuleNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1904
+  # source://prism/lib/prism/dispatcher.rb#1904
   def visit_module_node(node); end
 
   # Dispatch enter and leave events for MultiTargetNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1910
+  # source://prism/lib/prism/dispatcher.rb#1910
   def visit_multi_target_node(node); end
 
   # Dispatch enter and leave events for MultiWriteNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1916
+  # source://prism/lib/prism/dispatcher.rb#1916
   def visit_multi_write_node(node); end
 
   # Dispatch enter and leave events for NextNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1922
+  # source://prism/lib/prism/dispatcher.rb#1922
   def visit_next_node(node); end
 
   # Dispatch enter and leave events for NilNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1928
+  # source://prism/lib/prism/dispatcher.rb#1928
   def visit_nil_node(node); end
 
   # Dispatch enter and leave events for NoKeywordsParameterNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1934
+  # source://prism/lib/prism/dispatcher.rb#1934
   def visit_no_keywords_parameter_node(node); end
 
   # Dispatch enter and leave events for NumberedParametersNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1940
+  # source://prism/lib/prism/dispatcher.rb#1940
   def visit_numbered_parameters_node(node); end
 
   # Dispatch enter and leave events for NumberedReferenceReadNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1946
+  # source://prism/lib/prism/dispatcher.rb#1946
   def visit_numbered_reference_read_node(node); end
 
   # Dispatch enter and leave events for OptionalKeywordParameterNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1952
+  # source://prism/lib/prism/dispatcher.rb#1952
   def visit_optional_keyword_parameter_node(node); end
 
   # Dispatch enter and leave events for OptionalParameterNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1958
+  # source://prism/lib/prism/dispatcher.rb#1958
   def visit_optional_parameter_node(node); end
 
   # Dispatch enter and leave events for OrNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1964
+  # source://prism/lib/prism/dispatcher.rb#1964
   def visit_or_node(node); end
 
   # Dispatch enter and leave events for ParametersNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1970
+  # source://prism/lib/prism/dispatcher.rb#1970
   def visit_parameters_node(node); end
 
   # Dispatch enter and leave events for ParenthesesNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1976
+  # source://prism/lib/prism/dispatcher.rb#1976
   def visit_parentheses_node(node); end
 
   # Dispatch enter and leave events for PinnedExpressionNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1982
+  # source://prism/lib/prism/dispatcher.rb#1982
   def visit_pinned_expression_node(node); end
 
   # Dispatch enter and leave events for PinnedVariableNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1988
+  # source://prism/lib/prism/dispatcher.rb#1988
   def visit_pinned_variable_node(node); end
 
   # Dispatch enter and leave events for PostExecutionNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#1994
+  # source://prism/lib/prism/dispatcher.rb#1994
   def visit_post_execution_node(node); end
 
   # Dispatch enter and leave events for PreExecutionNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2000
+  # source://prism/lib/prism/dispatcher.rb#2000
   def visit_pre_execution_node(node); end
 
   # Dispatch enter and leave events for ProgramNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2006
+  # source://prism/lib/prism/dispatcher.rb#2006
   def visit_program_node(node); end
 
   # Dispatch enter and leave events for RangeNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2012
+  # source://prism/lib/prism/dispatcher.rb#2012
   def visit_range_node(node); end
 
   # Dispatch enter and leave events for RationalNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2018
+  # source://prism/lib/prism/dispatcher.rb#2018
   def visit_rational_node(node); end
 
   # Dispatch enter and leave events for RedoNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2024
+  # source://prism/lib/prism/dispatcher.rb#2024
   def visit_redo_node(node); end
 
   # Dispatch enter and leave events for RegularExpressionNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2030
+  # source://prism/lib/prism/dispatcher.rb#2030
   def visit_regular_expression_node(node); end
 
   # Dispatch enter and leave events for RequiredKeywordParameterNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2036
+  # source://prism/lib/prism/dispatcher.rb#2036
   def visit_required_keyword_parameter_node(node); end
 
   # Dispatch enter and leave events for RequiredParameterNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2042
+  # source://prism/lib/prism/dispatcher.rb#2042
   def visit_required_parameter_node(node); end
 
   # Dispatch enter and leave events for RescueModifierNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2048
+  # source://prism/lib/prism/dispatcher.rb#2048
   def visit_rescue_modifier_node(node); end
 
   # Dispatch enter and leave events for RescueNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2054
+  # source://prism/lib/prism/dispatcher.rb#2054
   def visit_rescue_node(node); end
 
   # Dispatch enter and leave events for RestParameterNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2060
+  # source://prism/lib/prism/dispatcher.rb#2060
   def visit_rest_parameter_node(node); end
 
   # Dispatch enter and leave events for RetryNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2066
+  # source://prism/lib/prism/dispatcher.rb#2066
   def visit_retry_node(node); end
 
   # Dispatch enter and leave events for ReturnNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2072
+  # source://prism/lib/prism/dispatcher.rb#2072
   def visit_return_node(node); end
 
   # Dispatch enter and leave events for SelfNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2078
+  # source://prism/lib/prism/dispatcher.rb#2078
   def visit_self_node(node); end
 
   # Dispatch enter and leave events for ShareableConstantNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2084
+  # source://prism/lib/prism/dispatcher.rb#2084
   def visit_shareable_constant_node(node); end
 
   # Dispatch enter and leave events for SingletonClassNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2090
+  # source://prism/lib/prism/dispatcher.rb#2090
   def visit_singleton_class_node(node); end
 
   # Dispatch enter and leave events for SourceEncodingNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2096
+  # source://prism/lib/prism/dispatcher.rb#2096
   def visit_source_encoding_node(node); end
 
   # Dispatch enter and leave events for SourceFileNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2102
+  # source://prism/lib/prism/dispatcher.rb#2102
   def visit_source_file_node(node); end
 
   # Dispatch enter and leave events for SourceLineNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2108
+  # source://prism/lib/prism/dispatcher.rb#2108
   def visit_source_line_node(node); end
 
   # Dispatch enter and leave events for SplatNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2114
+  # source://prism/lib/prism/dispatcher.rb#2114
   def visit_splat_node(node); end
 
   # Dispatch enter and leave events for StatementsNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2120
+  # source://prism/lib/prism/dispatcher.rb#2120
   def visit_statements_node(node); end
 
   # Dispatch enter and leave events for StringNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2126
+  # source://prism/lib/prism/dispatcher.rb#2126
   def visit_string_node(node); end
 
   # Dispatch enter and leave events for SuperNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2132
+  # source://prism/lib/prism/dispatcher.rb#2132
   def visit_super_node(node); end
 
   # Dispatch enter and leave events for SymbolNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2138
+  # source://prism/lib/prism/dispatcher.rb#2138
   def visit_symbol_node(node); end
 
   # Dispatch enter and leave events for TrueNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2144
+  # source://prism/lib/prism/dispatcher.rb#2144
   def visit_true_node(node); end
 
   # Dispatch enter and leave events for UndefNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2150
+  # source://prism/lib/prism/dispatcher.rb#2150
   def visit_undef_node(node); end
 
   # Dispatch enter and leave events for UnlessNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2156
+  # source://prism/lib/prism/dispatcher.rb#2156
   def visit_unless_node(node); end
 
   # Dispatch enter and leave events for UntilNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2162
+  # source://prism/lib/prism/dispatcher.rb#2162
   def visit_until_node(node); end
 
   # Dispatch enter and leave events for WhenNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2168
+  # source://prism/lib/prism/dispatcher.rb#2168
   def visit_when_node(node); end
 
   # Dispatch enter and leave events for WhileNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2174
+  # source://prism/lib/prism/dispatcher.rb#2174
   def visit_while_node(node); end
 
   # Dispatch enter and leave events for XStringNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2180
+  # source://prism/lib/prism/dispatcher.rb#2180
   def visit_x_string_node(node); end
 
   # Dispatch enter and leave events for YieldNode nodes.
   #
-  # source://prism//lib/prism/dispatcher.rb#2186
+  # source://prism/lib/prism/dispatcher.rb#2186
   def visit_yield_node(node); end
 end
 
 # This visitor provides the ability to call Node#to_dot, which converts a
 # subtree into a graphviz dot graph.
 #
-# source://prism//lib/prism/dot_visitor.rb#14
+# source://prism/lib/prism/dot_visitor.rb#14
 class Prism::DotVisitor < ::Prism::Visitor
   # Initialize a new dot visitor.
   #
   # @return [DotVisitor] a new instance of DotVisitor
   #
-  # source://prism//lib/prism/dot_visitor.rb#106
+  # source://prism/lib/prism/dot_visitor.rb#106
   def initialize; end
 
   # The digraph that is being built.
   #
-  # source://prism//lib/prism/dot_visitor.rb#103
+  # source://prism/lib/prism/dot_visitor.rb#103
   def digraph; end
 
   # Convert this visitor into a graphviz dot graph string.
   #
-  # source://prism//lib/prism/dot_visitor.rb#111
+  # source://prism/lib/prism/dot_visitor.rb#111
   def to_dot; end
 
   # Visit a AliasGlobalVariableNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#116
+  # source://prism/lib/prism/dot_visitor.rb#116
   def visit_alias_global_variable_node(node); end
 
   # Visit a AliasMethodNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#141
+  # source://prism/lib/prism/dot_visitor.rb#141
   def visit_alias_method_node(node); end
 
   # Visit a AlternationPatternNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#166
+  # source://prism/lib/prism/dot_visitor.rb#166
   def visit_alternation_pattern_node(node); end
 
   # Visit a AndNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#191
+  # source://prism/lib/prism/dot_visitor.rb#191
   def visit_and_node(node); end
 
   # Visit a ArgumentsNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#216
+  # source://prism/lib/prism/dot_visitor.rb#216
   def visit_arguments_node(node); end
 
   # Visit a ArrayNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#246
+  # source://prism/lib/prism/dot_visitor.rb#246
   def visit_array_node(node); end
 
   # Visit a ArrayPatternNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#286
+  # source://prism/lib/prism/dot_visitor.rb#286
   def visit_array_pattern_node(node); end
 
   # Visit a AssocNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#348
+  # source://prism/lib/prism/dot_visitor.rb#348
   def visit_assoc_node(node); end
 
   # Visit a AssocSplatNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#375
+  # source://prism/lib/prism/dot_visitor.rb#375
   def visit_assoc_splat_node(node); end
 
   # Visit a BackReferenceReadNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#398
+  # source://prism/lib/prism/dot_visitor.rb#398
   def visit_back_reference_read_node(node); end
 
   # Visit a BeginNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#415
+  # source://prism/lib/prism/dot_visitor.rb#415
   def visit_begin_node(node); end
 
   # Visit a BlockArgumentNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#463
+  # source://prism/lib/prism/dot_visitor.rb#463
   def visit_block_argument_node(node); end
 
   # Visit a BlockLocalVariableNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#486
+  # source://prism/lib/prism/dot_visitor.rb#486
   def visit_block_local_variable_node(node); end
 
   # Visit a BlockNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#506
+  # source://prism/lib/prism/dot_visitor.rb#506
   def visit_block_node(node); end
 
   # Visit a BlockParameterNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#541
+  # source://prism/lib/prism/dot_visitor.rb#541
   def visit_block_parameter_node(node); end
 
   # Visit a BlockParametersNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#569
+  # source://prism/lib/prism/dot_visitor.rb#569
   def visit_block_parameters_node(node); end
 
   # Visit a BreakNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#612
+  # source://prism/lib/prism/dot_visitor.rb#612
   def visit_break_node(node); end
 
   # Visit a CallAndWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#635
+  # source://prism/lib/prism/dot_visitor.rb#635
   def visit_call_and_write_node(node); end
 
   # Visit a CallNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#681
+  # source://prism/lib/prism/dot_visitor.rb#681
   def visit_call_node(node); end
 
   # Visit a CallOperatorWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#739
+  # source://prism/lib/prism/dot_visitor.rb#739
   def visit_call_operator_write_node(node); end
 
   # Visit a CallOrWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#788
+  # source://prism/lib/prism/dot_visitor.rb#788
   def visit_call_or_write_node(node); end
 
   # Visit a CallTargetNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#834
+  # source://prism/lib/prism/dot_visitor.rb#834
   def visit_call_target_node(node); end
 
   # Visit a CapturePatternNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#864
+  # source://prism/lib/prism/dot_visitor.rb#864
   def visit_capture_pattern_node(node); end
 
   # Visit a CaseMatchNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#889
+  # source://prism/lib/prism/dot_visitor.rb#889
   def visit_case_match_node(node); end
 
   # Visit a CaseNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#934
+  # source://prism/lib/prism/dot_visitor.rb#934
   def visit_case_node(node); end
 
   # Visit a ClassNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#979
+  # source://prism/lib/prism/dot_visitor.rb#979
   def visit_class_node(node); end
 
   # Visit a ClassVariableAndWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1026
+  # source://prism/lib/prism/dot_visitor.rb#1026
   def visit_class_variable_and_write_node(node); end
 
   # Visit a ClassVariableOperatorWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1053
+  # source://prism/lib/prism/dot_visitor.rb#1053
   def visit_class_variable_operator_write_node(node); end
 
   # Visit a ClassVariableOrWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1083
+  # source://prism/lib/prism/dot_visitor.rb#1083
   def visit_class_variable_or_write_node(node); end
 
   # Visit a ClassVariableReadNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1110
+  # source://prism/lib/prism/dot_visitor.rb#1110
   def visit_class_variable_read_node(node); end
 
   # Visit a ClassVariableTargetNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1127
+  # source://prism/lib/prism/dot_visitor.rb#1127
   def visit_class_variable_target_node(node); end
 
   # Visit a ClassVariableWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1144
+  # source://prism/lib/prism/dot_visitor.rb#1144
   def visit_class_variable_write_node(node); end
 
   # Visit a ConstantAndWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1171
+  # source://prism/lib/prism/dot_visitor.rb#1171
   def visit_constant_and_write_node(node); end
 
   # Visit a ConstantOperatorWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1198
+  # source://prism/lib/prism/dot_visitor.rb#1198
   def visit_constant_operator_write_node(node); end
 
   # Visit a ConstantOrWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1228
+  # source://prism/lib/prism/dot_visitor.rb#1228
   def visit_constant_or_write_node(node); end
 
   # Visit a ConstantPathAndWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1255
+  # source://prism/lib/prism/dot_visitor.rb#1255
   def visit_constant_path_and_write_node(node); end
 
   # Visit a ConstantPathNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1280
+  # source://prism/lib/prism/dot_visitor.rb#1280
   def visit_constant_path_node(node); end
 
   # Visit a ConstantPathOperatorWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1309
+  # source://prism/lib/prism/dot_visitor.rb#1309
   def visit_constant_path_operator_write_node(node); end
 
   # Visit a ConstantPathOrWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1337
+  # source://prism/lib/prism/dot_visitor.rb#1337
   def visit_constant_path_or_write_node(node); end
 
   # Visit a ConstantPathTargetNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1362
+  # source://prism/lib/prism/dot_visitor.rb#1362
   def visit_constant_path_target_node(node); end
 
   # Visit a ConstantPathWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1391
+  # source://prism/lib/prism/dot_visitor.rb#1391
   def visit_constant_path_write_node(node); end
 
   # Visit a ConstantReadNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1416
+  # source://prism/lib/prism/dot_visitor.rb#1416
   def visit_constant_read_node(node); end
 
   # Visit a ConstantTargetNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1433
+  # source://prism/lib/prism/dot_visitor.rb#1433
   def visit_constant_target_node(node); end
 
   # Visit a ConstantWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1450
+  # source://prism/lib/prism/dot_visitor.rb#1450
   def visit_constant_write_node(node); end
 
   # Visit a DefNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1477
+  # source://prism/lib/prism/dot_visitor.rb#1477
   def visit_def_node(node); end
 
   # Visit a DefinedNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1546
+  # source://prism/lib/prism/dot_visitor.rb#1546
   def visit_defined_node(node); end
 
   # Visit a ElseNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1577
+  # source://prism/lib/prism/dot_visitor.rb#1577
   def visit_else_node(node); end
 
   # Visit a EmbeddedStatementsNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1605
+  # source://prism/lib/prism/dot_visitor.rb#1605
   def visit_embedded_statements_node(node); end
 
   # Visit a EmbeddedVariableNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1631
+  # source://prism/lib/prism/dot_visitor.rb#1631
   def visit_embedded_variable_node(node); end
 
   # Visit a EnsureNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1652
+  # source://prism/lib/prism/dot_visitor.rb#1652
   def visit_ensure_node(node); end
 
   # Visit a FalseNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1678
+  # source://prism/lib/prism/dot_visitor.rb#1678
   def visit_false_node(node); end
 
   # Visit a FindPatternNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1692
+  # source://prism/lib/prism/dot_visitor.rb#1692
   def visit_find_pattern_node(node); end
 
   # Visit a FlipFlopNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1743
+  # source://prism/lib/prism/dot_visitor.rb#1743
   def visit_flip_flop_node(node); end
 
   # Visit a FloatNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1775
+  # source://prism/lib/prism/dot_visitor.rb#1775
   def visit_float_node(node); end
 
   # Visit a ForNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1792
+  # source://prism/lib/prism/dot_visitor.rb#1792
   def visit_for_node(node); end
 
   # Visit a ForwardingArgumentsNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1834
+  # source://prism/lib/prism/dot_visitor.rb#1834
   def visit_forwarding_arguments_node(node); end
 
   # Visit a ForwardingParameterNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1848
+  # source://prism/lib/prism/dot_visitor.rb#1848
   def visit_forwarding_parameter_node(node); end
 
   # Visit a ForwardingSuperNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1862
+  # source://prism/lib/prism/dot_visitor.rb#1862
   def visit_forwarding_super_node(node); end
 
   # Visit a GlobalVariableAndWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1882
+  # source://prism/lib/prism/dot_visitor.rb#1882
   def visit_global_variable_and_write_node(node); end
 
   # Visit a GlobalVariableOperatorWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1909
+  # source://prism/lib/prism/dot_visitor.rb#1909
   def visit_global_variable_operator_write_node(node); end
 
   # Visit a GlobalVariableOrWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1939
+  # source://prism/lib/prism/dot_visitor.rb#1939
   def visit_global_variable_or_write_node(node); end
 
   # Visit a GlobalVariableReadNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1966
+  # source://prism/lib/prism/dot_visitor.rb#1966
   def visit_global_variable_read_node(node); end
 
   # Visit a GlobalVariableTargetNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#1983
+  # source://prism/lib/prism/dot_visitor.rb#1983
   def visit_global_variable_target_node(node); end
 
   # Visit a GlobalVariableWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2000
+  # source://prism/lib/prism/dot_visitor.rb#2000
   def visit_global_variable_write_node(node); end
 
   # Visit a HashNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2027
+  # source://prism/lib/prism/dot_visitor.rb#2027
   def visit_hash_node(node); end
 
   # Visit a HashPatternNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2060
+  # source://prism/lib/prism/dot_visitor.rb#2060
   def visit_hash_pattern_node(node); end
 
   # Visit a IfNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2109
+  # source://prism/lib/prism/dot_visitor.rb#2109
   def visit_if_node(node); end
 
   # Visit a ImaginaryNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2154
+  # source://prism/lib/prism/dot_visitor.rb#2154
   def visit_imaginary_node(node); end
 
   # Visit a ImplicitNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2172
+  # source://prism/lib/prism/dot_visitor.rb#2172
   def visit_implicit_node(node); end
 
   # Visit a ImplicitRestNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2190
+  # source://prism/lib/prism/dot_visitor.rb#2190
   def visit_implicit_rest_node(node); end
 
   # Visit a InNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2204
+  # source://prism/lib/prism/dot_visitor.rb#2204
   def visit_in_node(node); end
 
   # Visit a IndexAndWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2236
+  # source://prism/lib/prism/dot_visitor.rb#2236
   def visit_index_and_write_node(node); end
 
   # Visit a IndexOperatorWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2289
+  # source://prism/lib/prism/dot_visitor.rb#2289
   def visit_index_operator_write_node(node); end
 
   # Visit a IndexOrWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2345
+  # source://prism/lib/prism/dot_visitor.rb#2345
   def visit_index_or_write_node(node); end
 
   # Visit a IndexTargetNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2398
+  # source://prism/lib/prism/dot_visitor.rb#2398
   def visit_index_target_node(node); end
 
   # Visit a InstanceVariableAndWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2437
+  # source://prism/lib/prism/dot_visitor.rb#2437
   def visit_instance_variable_and_write_node(node); end
 
   # Visit a InstanceVariableOperatorWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2464
+  # source://prism/lib/prism/dot_visitor.rb#2464
   def visit_instance_variable_operator_write_node(node); end
 
   # Visit a InstanceVariableOrWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2494
+  # source://prism/lib/prism/dot_visitor.rb#2494
   def visit_instance_variable_or_write_node(node); end
 
   # Visit a InstanceVariableReadNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2521
+  # source://prism/lib/prism/dot_visitor.rb#2521
   def visit_instance_variable_read_node(node); end
 
   # Visit a InstanceVariableTargetNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2538
+  # source://prism/lib/prism/dot_visitor.rb#2538
   def visit_instance_variable_target_node(node); end
 
   # Visit a InstanceVariableWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2555
+  # source://prism/lib/prism/dot_visitor.rb#2555
   def visit_instance_variable_write_node(node); end
 
   # Visit a IntegerNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2582
+  # source://prism/lib/prism/dot_visitor.rb#2582
   def visit_integer_node(node); end
 
   # Visit a InterpolatedMatchLastLineNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2602
+  # source://prism/lib/prism/dot_visitor.rb#2602
   def visit_interpolated_match_last_line_node(node); end
 
   # Visit a InterpolatedRegularExpressionNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2638
+  # source://prism/lib/prism/dot_visitor.rb#2638
   def visit_interpolated_regular_expression_node(node); end
 
   # Visit a InterpolatedStringNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2674
+  # source://prism/lib/prism/dot_visitor.rb#2674
   def visit_interpolated_string_node(node); end
 
   # Visit a InterpolatedSymbolNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2714
+  # source://prism/lib/prism/dot_visitor.rb#2714
   def visit_interpolated_symbol_node(node); end
 
   # Visit a InterpolatedXStringNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2751
+  # source://prism/lib/prism/dot_visitor.rb#2751
   def visit_interpolated_x_string_node(node); end
 
   # Visit a ItLocalVariableReadNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2784
+  # source://prism/lib/prism/dot_visitor.rb#2784
   def visit_it_local_variable_read_node(node); end
 
   # Visit a ItParametersNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2798
+  # source://prism/lib/prism/dot_visitor.rb#2798
   def visit_it_parameters_node(node); end
 
   # Visit a KeywordHashNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2812
+  # source://prism/lib/prism/dot_visitor.rb#2812
   def visit_keyword_hash_node(node); end
 
   # Visit a KeywordRestParameterNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2842
+  # source://prism/lib/prism/dot_visitor.rb#2842
   def visit_keyword_rest_parameter_node(node); end
 
   # Visit a LambdaNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2870
+  # source://prism/lib/prism/dot_visitor.rb#2870
   def visit_lambda_node(node); end
 
   # Visit a LocalVariableAndWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2908
+  # source://prism/lib/prism/dot_visitor.rb#2908
   def visit_local_variable_and_write_node(node); end
 
   # Visit a LocalVariableOperatorWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2938
+  # source://prism/lib/prism/dot_visitor.rb#2938
   def visit_local_variable_operator_write_node(node); end
 
   # Visit a LocalVariableOrWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#2971
+  # source://prism/lib/prism/dot_visitor.rb#2971
   def visit_local_variable_or_write_node(node); end
 
   # Visit a LocalVariableReadNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3001
+  # source://prism/lib/prism/dot_visitor.rb#3001
   def visit_local_variable_read_node(node); end
 
   # Visit a LocalVariableTargetNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3021
+  # source://prism/lib/prism/dot_visitor.rb#3021
   def visit_local_variable_target_node(node); end
 
   # Visit a LocalVariableWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3041
+  # source://prism/lib/prism/dot_visitor.rb#3041
   def visit_local_variable_write_node(node); end
 
   # Visit a MatchLastLineNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3071
+  # source://prism/lib/prism/dot_visitor.rb#3071
   def visit_match_last_line_node(node); end
 
   # Visit a MatchPredicateNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3100
+  # source://prism/lib/prism/dot_visitor.rb#3100
   def visit_match_predicate_node(node); end
 
   # Visit a MatchRequiredNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3125
+  # source://prism/lib/prism/dot_visitor.rb#3125
   def visit_match_required_node(node); end
 
   # Visit a MatchWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3150
+  # source://prism/lib/prism/dot_visitor.rb#3150
   def visit_match_write_node(node); end
 
   # Visit a MissingNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3181
+  # source://prism/lib/prism/dot_visitor.rb#3181
   def visit_missing_node(node); end
 
   # Visit a ModuleNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3195
+  # source://prism/lib/prism/dot_visitor.rb#3195
   def visit_module_node(node); end
 
   # Visit a MultiTargetNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3231
+  # source://prism/lib/prism/dot_visitor.rb#3231
   def visit_multi_target_node(node); end
 
   # Visit a MultiWriteNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3287
+  # source://prism/lib/prism/dot_visitor.rb#3287
   def visit_multi_write_node(node); end
 
   # Visit a NextNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3350
+  # source://prism/lib/prism/dot_visitor.rb#3350
   def visit_next_node(node); end
 
   # Visit a NilNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3373
+  # source://prism/lib/prism/dot_visitor.rb#3373
   def visit_nil_node(node); end
 
   # Visit a NoKeywordsParameterNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3387
+  # source://prism/lib/prism/dot_visitor.rb#3387
   def visit_no_keywords_parameter_node(node); end
 
   # Visit a NumberedParametersNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3407
+  # source://prism/lib/prism/dot_visitor.rb#3407
   def visit_numbered_parameters_node(node); end
 
   # Visit a NumberedReferenceReadNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3424
+  # source://prism/lib/prism/dot_visitor.rb#3424
   def visit_numbered_reference_read_node(node); end
 
   # Visit a OptionalKeywordParameterNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3441
+  # source://prism/lib/prism/dot_visitor.rb#3441
   def visit_optional_keyword_parameter_node(node); end
 
   # Visit a OptionalParameterNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3468
+  # source://prism/lib/prism/dot_visitor.rb#3468
   def visit_optional_parameter_node(node); end
 
   # Visit a OrNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3498
+  # source://prism/lib/prism/dot_visitor.rb#3498
   def visit_or_node(node); end
 
   # Visit a ParametersNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3523
+  # source://prism/lib/prism/dot_visitor.rb#3523
   def visit_parameters_node(node); end
 
   # Visit a ParenthesesNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3607
+  # source://prism/lib/prism/dot_visitor.rb#3607
   def visit_parentheses_node(node); end
 
   # Visit a PinnedExpressionNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3633
+  # source://prism/lib/prism/dot_visitor.rb#3633
   def visit_pinned_expression_node(node); end
 
   # Visit a PinnedVariableNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3660
+  # source://prism/lib/prism/dot_visitor.rb#3660
   def visit_pinned_variable_node(node); end
 
   # Visit a PostExecutionNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3681
+  # source://prism/lib/prism/dot_visitor.rb#3681
   def visit_post_execution_node(node); end
 
   # Visit a PreExecutionNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3710
+  # source://prism/lib/prism/dot_visitor.rb#3710
   def visit_pre_execution_node(node); end
 
   # Visit a ProgramNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3739
+  # source://prism/lib/prism/dot_visitor.rb#3739
   def visit_program_node(node); end
 
   # Visit a RangeNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3760
+  # source://prism/lib/prism/dot_visitor.rb#3760
   def visit_range_node(node); end
 
   # Visit a RationalNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3792
+  # source://prism/lib/prism/dot_visitor.rb#3792
   def visit_rational_node(node); end
 
   # Visit a RedoNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3815
+  # source://prism/lib/prism/dot_visitor.rb#3815
   def visit_redo_node(node); end
 
   # Visit a RegularExpressionNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3829
+  # source://prism/lib/prism/dot_visitor.rb#3829
   def visit_regular_expression_node(node); end
 
   # Visit a RequiredKeywordParameterNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3858
+  # source://prism/lib/prism/dot_visitor.rb#3858
   def visit_required_keyword_parameter_node(node); end
 
   # Visit a RequiredParameterNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3881
+  # source://prism/lib/prism/dot_visitor.rb#3881
   def visit_required_parameter_node(node); end
 
   # Visit a RescueModifierNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3901
+  # source://prism/lib/prism/dot_visitor.rb#3901
   def visit_rescue_modifier_node(node); end
 
   # Visit a RescueNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3926
+  # source://prism/lib/prism/dot_visitor.rb#3926
   def visit_rescue_node(node); end
 
   # Visit a RestParameterNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#3979
+  # source://prism/lib/prism/dot_visitor.rb#3979
   def visit_rest_parameter_node(node); end
 
   # Visit a RetryNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4007
+  # source://prism/lib/prism/dot_visitor.rb#4007
   def visit_retry_node(node); end
 
   # Visit a ReturnNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4021
+  # source://prism/lib/prism/dot_visitor.rb#4021
   def visit_return_node(node); end
 
   # Visit a SelfNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4044
+  # source://prism/lib/prism/dot_visitor.rb#4044
   def visit_self_node(node); end
 
   # Visit a ShareableConstantNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4058
+  # source://prism/lib/prism/dot_visitor.rb#4058
   def visit_shareable_constant_node(node); end
 
   # Visit a SingletonClassNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4079
+  # source://prism/lib/prism/dot_visitor.rb#4079
   def visit_singleton_class_node(node); end
 
   # Visit a SourceEncodingNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4115
+  # source://prism/lib/prism/dot_visitor.rb#4115
   def visit_source_encoding_node(node); end
 
   # Visit a SourceFileNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4129
+  # source://prism/lib/prism/dot_visitor.rb#4129
   def visit_source_file_node(node); end
 
   # Visit a SourceLineNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4149
+  # source://prism/lib/prism/dot_visitor.rb#4149
   def visit_source_line_node(node); end
 
   # Visit a SplatNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4163
+  # source://prism/lib/prism/dot_visitor.rb#4163
   def visit_splat_node(node); end
 
   # Visit a StatementsNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4186
+  # source://prism/lib/prism/dot_visitor.rb#4186
   def visit_statements_node(node); end
 
   # Visit a StringNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4213
+  # source://prism/lib/prism/dot_visitor.rb#4213
   def visit_string_node(node); end
 
   # Visit a SuperNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4246
+  # source://prism/lib/prism/dot_visitor.rb#4246
   def visit_super_node(node); end
 
   # Visit a SymbolNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4285
+  # source://prism/lib/prism/dot_visitor.rb#4285
   def visit_symbol_node(node); end
 
   # Visit a TrueNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4320
+  # source://prism/lib/prism/dot_visitor.rb#4320
   def visit_true_node(node); end
 
   # Visit a UndefNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4334
+  # source://prism/lib/prism/dot_visitor.rb#4334
   def visit_undef_node(node); end
 
   # Visit a UnlessNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4364
+  # source://prism/lib/prism/dot_visitor.rb#4364
   def visit_unless_node(node); end
 
   # Visit a UntilNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4407
+  # source://prism/lib/prism/dot_visitor.rb#4407
   def visit_until_node(node); end
 
   # Visit a WhenNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4442
+  # source://prism/lib/prism/dot_visitor.rb#4442
   def visit_when_node(node); end
 
   # Visit a WhileNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4483
+  # source://prism/lib/prism/dot_visitor.rb#4483
   def visit_while_node(node); end
 
   # Visit a XStringNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4518
+  # source://prism/lib/prism/dot_visitor.rb#4518
   def visit_x_string_node(node); end
 
   # Visit a YieldNode node.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4547
+  # source://prism/lib/prism/dot_visitor.rb#4547
   def visit_yield_node(node); end
 
   private
@@ -13787,180 +13787,180 @@ class Prism::DotVisitor < ::Prism::Visitor
   # Inspect a node that has arguments_node_flags flags to display the flags as a
   # comma-separated list.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4593
+  # source://prism/lib/prism/dot_visitor.rb#4593
   def arguments_node_flags_inspect(node); end
 
   # Inspect a node that has array_node_flags flags to display the flags as a
   # comma-separated list.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4605
+  # source://prism/lib/prism/dot_visitor.rb#4605
   def array_node_flags_inspect(node); end
 
   # Inspect a node that has call_node_flags flags to display the flags as a
   # comma-separated list.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4613
+  # source://prism/lib/prism/dot_visitor.rb#4613
   def call_node_flags_inspect(node); end
 
   # Inspect a node that has encoding_flags flags to display the flags as a
   # comma-separated list.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4624
+  # source://prism/lib/prism/dot_visitor.rb#4624
   def encoding_flags_inspect(node); end
 
   # Inspect a node that has integer_base_flags flags to display the flags as a
   # comma-separated list.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4633
+  # source://prism/lib/prism/dot_visitor.rb#4633
   def integer_base_flags_inspect(node); end
 
   # Inspect a node that has interpolated_string_node_flags flags to display the flags as a
   # comma-separated list.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4644
+  # source://prism/lib/prism/dot_visitor.rb#4644
   def interpolated_string_node_flags_inspect(node); end
 
   # Inspect a node that has keyword_hash_node_flags flags to display the flags as a
   # comma-separated list.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4653
+  # source://prism/lib/prism/dot_visitor.rb#4653
   def keyword_hash_node_flags_inspect(node); end
 
   # Inspect a location to display the start and end line and column numbers.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4587
+  # source://prism/lib/prism/dot_visitor.rb#4587
   def location_inspect(location); end
 
   # Inspect a node that has loop_flags flags to display the flags as a
   # comma-separated list.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4661
+  # source://prism/lib/prism/dot_visitor.rb#4661
   def loop_flags_inspect(node); end
 
   # Generate a unique node ID for a node throughout the digraph.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4582
+  # source://prism/lib/prism/dot_visitor.rb#4582
   def node_id(node); end
 
   # Inspect a node that has parameter_flags flags to display the flags as a
   # comma-separated list.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4669
+  # source://prism/lib/prism/dot_visitor.rb#4669
   def parameter_flags_inspect(node); end
 
   # Inspect a node that has range_flags flags to display the flags as a
   # comma-separated list.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4677
+  # source://prism/lib/prism/dot_visitor.rb#4677
   def range_flags_inspect(node); end
 
   # Inspect a node that has regular_expression_flags flags to display the flags as a
   # comma-separated list.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4685
+  # source://prism/lib/prism/dot_visitor.rb#4685
   def regular_expression_flags_inspect(node); end
 
   # Inspect a node that has shareable_constant_node_flags flags to display the flags as a
   # comma-separated list.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4703
+  # source://prism/lib/prism/dot_visitor.rb#4703
   def shareable_constant_node_flags_inspect(node); end
 
   # Inspect a node that has string_flags flags to display the flags as a
   # comma-separated list.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4713
+  # source://prism/lib/prism/dot_visitor.rb#4713
   def string_flags_inspect(node); end
 
   # Inspect a node that has symbol_flags flags to display the flags as a
   # comma-separated list.
   #
-  # source://prism//lib/prism/dot_visitor.rb#4724
+  # source://prism/lib/prism/dot_visitor.rb#4724
   def symbol_flags_inspect(node); end
 end
 
-# source://prism//lib/prism/dot_visitor.rb#59
+# source://prism/lib/prism/dot_visitor.rb#59
 class Prism::DotVisitor::Digraph
   # @return [Digraph] a new instance of Digraph
   #
-  # source://prism//lib/prism/dot_visitor.rb#62
+  # source://prism/lib/prism/dot_visitor.rb#62
   def initialize; end
 
-  # source://prism//lib/prism/dot_visitor.rb#76
+  # source://prism/lib/prism/dot_visitor.rb#76
   def edge(value); end
 
   # Returns the value of attribute edges.
   #
-  # source://prism//lib/prism/dot_visitor.rb#60
+  # source://prism/lib/prism/dot_visitor.rb#60
   def edges; end
 
-  # source://prism//lib/prism/dot_visitor.rb#68
+  # source://prism/lib/prism/dot_visitor.rb#68
   def node(value); end
 
   # Returns the value of attribute nodes.
   #
-  # source://prism//lib/prism/dot_visitor.rb#60
+  # source://prism/lib/prism/dot_visitor.rb#60
   def nodes; end
 
-  # source://prism//lib/prism/dot_visitor.rb#80
+  # source://prism/lib/prism/dot_visitor.rb#80
   def to_dot; end
 
-  # source://prism//lib/prism/dot_visitor.rb#72
+  # source://prism/lib/prism/dot_visitor.rb#72
   def waypoint(value); end
 
   # Returns the value of attribute waypoints.
   #
-  # source://prism//lib/prism/dot_visitor.rb#60
+  # source://prism/lib/prism/dot_visitor.rb#60
   def waypoints; end
 end
 
-# source://prism//lib/prism/dot_visitor.rb#15
+# source://prism/lib/prism/dot_visitor.rb#15
 class Prism::DotVisitor::Field
   # @return [Field] a new instance of Field
   #
-  # source://prism//lib/prism/dot_visitor.rb#18
+  # source://prism/lib/prism/dot_visitor.rb#18
   def initialize(name, value, port); end
 
   # Returns the value of attribute name.
   #
-  # source://prism//lib/prism/dot_visitor.rb#16
+  # source://prism/lib/prism/dot_visitor.rb#16
   def name; end
 
   # Returns the value of attribute port.
   #
-  # source://prism//lib/prism/dot_visitor.rb#16
+  # source://prism/lib/prism/dot_visitor.rb#16
   def port; end
 
-  # source://prism//lib/prism/dot_visitor.rb#24
+  # source://prism/lib/prism/dot_visitor.rb#24
   def to_dot; end
 
   # Returns the value of attribute value.
   #
-  # source://prism//lib/prism/dot_visitor.rb#16
+  # source://prism/lib/prism/dot_visitor.rb#16
   def value; end
 end
 
-# source://prism//lib/prism/dot_visitor.rb#33
+# source://prism/lib/prism/dot_visitor.rb#33
 class Prism::DotVisitor::Table
   # @return [Table] a new instance of Table
   #
-  # source://prism//lib/prism/dot_visitor.rb#36
+  # source://prism/lib/prism/dot_visitor.rb#36
   def initialize(name); end
 
-  # source://prism//lib/prism/dot_visitor.rb#41
+  # source://prism/lib/prism/dot_visitor.rb#41
   def field(name, value = T.unsafe(nil), port: T.unsafe(nil)); end
 
   # Returns the value of attribute fields.
   #
-  # source://prism//lib/prism/dot_visitor.rb#34
+  # source://prism/lib/prism/dot_visitor.rb#34
   def fields; end
 
   # Returns the value of attribute name.
   #
-  # source://prism//lib/prism/dot_visitor.rb#34
+  # source://prism/lib/prism/dot_visitor.rb#34
   def name; end
 
-  # source://prism//lib/prism/dot_visitor.rb#45
+  # source://prism/lib/prism/dot_visitor.rb#45
   def to_dot; end
 end
 
@@ -13969,13 +13969,13 @@ end
 #     if a then b else c end
 #                 ^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#5485
+# source://prism/lib/prism/node.rb#5485
 class Prism::ElseNode < ::Prism::Node
   # Initialize a new ElseNode node.
   #
   # @return [ElseNode] a new instance of ElseNode
   #
-  # source://prism//lib/prism/node.rb#5487
+  # source://prism/lib/prism/node.rb#5487
   sig do
     params(
       source: Prism::Source,
@@ -13992,36 +13992,36 @@ class Prism::ElseNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#5582
+  # source://prism/lib/prism/node.rb#5582
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#5498
+  # source://prism/lib/prism/node.rb#5498
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#5503
+  # source://prism/lib/prism/node.rb#5503
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#5515
+  # source://prism/lib/prism/node.rb#5515
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#5508
+  # source://prism/lib/prism/node.rb#5508
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?else_keyword_loc: Location, ?statements: StatementsNode?, ?end_keyword_loc: Location?) -> ElseNode
   #
-  # source://prism//lib/prism/node.rb#5520
+  # source://prism/lib/prism/node.rb#5520
   sig do
     params(
       node_id: Integer,
@@ -14037,37 +14037,37 @@ class Prism::ElseNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#5503
+  # source://prism/lib/prism/node.rb#5503
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, else_keyword_loc: Location, statements: StatementsNode?, end_keyword_loc: Location? }
   #
-  # source://prism//lib/prism/node.rb#5528
+  # source://prism/lib/prism/node.rb#5528
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # def else_keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#5556
+  # source://prism/lib/prism/node.rb#5556
   sig { returns(String) }
   def else_keyword; end
 
   # attr_reader else_keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#5533
+  # source://prism/lib/prism/node.rb#5533
   sig { returns(Prism::Location) }
   def else_keyword_loc; end
 
   # def end_keyword: () -> String?
   #
-  # source://prism//lib/prism/node.rb#5561
+  # source://prism/lib/prism/node.rb#5561
   sig { returns(T.nilable(String)) }
   def end_keyword; end
 
   # attr_reader end_keyword_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#5543
+  # source://prism/lib/prism/node.rb#5543
   sig { returns(T.nilable(Prism::Location)) }
   def end_keyword_loc; end
 
@@ -14076,26 +14076,26 @@ class Prism::ElseNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#5566
+  # source://prism/lib/prism/node.rb#5566
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader statements: StatementsNode?
   #
-  # source://prism//lib/prism/node.rb#5540
+  # source://prism/lib/prism/node.rb#5540
   sig { returns(T.nilable(Prism::StatementsNode)) }
   def statements; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#5571
+  # source://prism/lib/prism/node.rb#5571
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#5576
+    # source://prism/lib/prism/node.rb#5576
     def type; end
   end
 end
@@ -14103,11 +14103,11 @@ end
 # EmbDocComment objects correspond to comments that are surrounded by =begin
 # and =end.
 #
-# source://prism//lib/prism/parse_result.rb#544
+# source://prism/lib/prism/parse_result.rb#544
 class Prism::EmbDocComment < ::Prism::Comment
   # Returns a string representation of this comment.
   #
-  # source://prism//lib/prism/parse_result.rb#551
+  # source://prism/lib/prism/parse_result.rb#551
   sig { returns(String) }
   def inspect; end
 
@@ -14115,7 +14115,7 @@ class Prism::EmbDocComment < ::Prism::Comment
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/parse_result.rb#546
+  # source://prism/lib/prism/parse_result.rb#546
   sig { override.returns(T::Boolean) }
   def trailing?; end
 end
@@ -14125,13 +14125,13 @@ end
 #     "foo #{bar}"
 #          ^^^^^^
 #
-# source://prism//lib/prism/node.rb#5594
+# source://prism/lib/prism/node.rb#5594
 class Prism::EmbeddedStatementsNode < ::Prism::Node
   # Initialize a new EmbeddedStatementsNode node.
   #
   # @return [EmbeddedStatementsNode] a new instance of EmbeddedStatementsNode
   #
-  # source://prism//lib/prism/node.rb#5596
+  # source://prism/lib/prism/node.rb#5596
   sig do
     params(
       source: Prism::Source,
@@ -14148,48 +14148,48 @@ class Prism::EmbeddedStatementsNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#5685
+  # source://prism/lib/prism/node.rb#5685
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#5607
+  # source://prism/lib/prism/node.rb#5607
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#5612
+  # source://prism/lib/prism/node.rb#5612
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String
   #
-  # source://prism//lib/prism/node.rb#5664
+  # source://prism/lib/prism/node.rb#5664
   sig { returns(String) }
   def closing; end
 
   # attr_reader closing_loc: Location
   #
-  # source://prism//lib/prism/node.rb#5652
+  # source://prism/lib/prism/node.rb#5652
   sig { returns(Prism::Location) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#5624
+  # source://prism/lib/prism/node.rb#5624
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#5617
+  # source://prism/lib/prism/node.rb#5617
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?statements: StatementsNode?, ?closing_loc: Location) -> EmbeddedStatementsNode
   #
-  # source://prism//lib/prism/node.rb#5629
+  # source://prism/lib/prism/node.rb#5629
   sig do
     params(
       node_id: Integer,
@@ -14205,13 +14205,13 @@ class Prism::EmbeddedStatementsNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#5612
+  # source://prism/lib/prism/node.rb#5612
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, statements: StatementsNode?, closing_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#5637
+  # source://prism/lib/prism/node.rb#5637
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -14220,38 +14220,38 @@ class Prism::EmbeddedStatementsNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#5669
+  # source://prism/lib/prism/node.rb#5669
   sig { override.returns(String) }
   def inspect; end
 
   # def opening: () -> String
   #
-  # source://prism//lib/prism/node.rb#5659
+  # source://prism/lib/prism/node.rb#5659
   sig { returns(String) }
   def opening; end
 
   # attr_reader opening_loc: Location
   #
-  # source://prism//lib/prism/node.rb#5642
+  # source://prism/lib/prism/node.rb#5642
   sig { returns(Prism::Location) }
   def opening_loc; end
 
   # attr_reader statements: StatementsNode?
   #
-  # source://prism//lib/prism/node.rb#5649
+  # source://prism/lib/prism/node.rb#5649
   sig { returns(T.nilable(Prism::StatementsNode)) }
   def statements; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#5674
+  # source://prism/lib/prism/node.rb#5674
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#5679
+    # source://prism/lib/prism/node.rb#5679
     def type; end
   end
 end
@@ -14261,13 +14261,13 @@ end
 #     "foo #@bar"
 #          ^^^^^
 #
-# source://prism//lib/prism/node.rb#5697
+# source://prism/lib/prism/node.rb#5697
 class Prism::EmbeddedVariableNode < ::Prism::Node
   # Initialize a new EmbeddedVariableNode node.
   #
   # @return [EmbeddedVariableNode] a new instance of EmbeddedVariableNode
   #
-  # source://prism//lib/prism/node.rb#5699
+  # source://prism/lib/prism/node.rb#5699
   sig do
     params(
       source: Prism::Source,
@@ -14283,36 +14283,36 @@ class Prism::EmbeddedVariableNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#5773
+  # source://prism/lib/prism/node.rb#5773
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#5709
+  # source://prism/lib/prism/node.rb#5709
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#5714
+  # source://prism/lib/prism/node.rb#5714
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#5724
+  # source://prism/lib/prism/node.rb#5724
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#5719
+  # source://prism/lib/prism/node.rb#5719
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?operator_loc: Location, ?variable: InstanceVariableReadNode | ClassVariableReadNode | GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode) -> EmbeddedVariableNode
   #
-  # source://prism//lib/prism/node.rb#5729
+  # source://prism/lib/prism/node.rb#5729
   sig do
     params(
       node_id: Integer,
@@ -14327,13 +14327,13 @@ class Prism::EmbeddedVariableNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#5714
+  # source://prism/lib/prism/node.rb#5714
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, operator_loc: Location, variable: InstanceVariableReadNode | ClassVariableReadNode | GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode }
   #
-  # source://prism//lib/prism/node.rb#5737
+  # source://prism/lib/prism/node.rb#5737
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -14342,31 +14342,31 @@ class Prism::EmbeddedVariableNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#5757
+  # source://prism/lib/prism/node.rb#5757
   sig { override.returns(String) }
   def inspect; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#5752
+  # source://prism/lib/prism/node.rb#5752
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#5742
+  # source://prism/lib/prism/node.rb#5742
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#5762
+  # source://prism/lib/prism/node.rb#5762
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader variable: InstanceVariableReadNode | ClassVariableReadNode | GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode
   #
-  # source://prism//lib/prism/node.rb#5749
+  # source://prism/lib/prism/node.rb#5749
   sig do
     returns(T.any(Prism::InstanceVariableReadNode, Prism::ClassVariableReadNode, Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode))
   end
@@ -14375,24 +14375,24 @@ class Prism::EmbeddedVariableNode < ::Prism::Node
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#5767
+    # source://prism/lib/prism/node.rb#5767
     def type; end
   end
 end
 
 # Flags for nodes that have unescaped content.
 #
-# source://prism//lib/prism/node.rb#16723
+# source://prism/lib/prism/node.rb#16723
 module Prism::EncodingFlags; end
 
 # internal bytes forced the encoding to binary
 #
-# source://prism//lib/prism/node.rb#16728
+# source://prism/lib/prism/node.rb#16728
 Prism::EncodingFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer)
 
 # internal bytes forced the encoding to UTF-8
 #
-# source://prism//lib/prism/node.rb#16725
+# source://prism/lib/prism/node.rb#16725
 Prism::EncodingFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer)
 
 # Represents an `ensure` clause in a `begin` statement.
@@ -14404,13 +14404,13 @@ Prism::EncodingFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer)
 #       bar
 #     end
 #
-# source://prism//lib/prism/node.rb#5788
+# source://prism/lib/prism/node.rb#5788
 class Prism::EnsureNode < ::Prism::Node
   # Initialize a new EnsureNode node.
   #
   # @return [EnsureNode] a new instance of EnsureNode
   #
-  # source://prism//lib/prism/node.rb#5790
+  # source://prism/lib/prism/node.rb#5790
   sig do
     params(
       source: Prism::Source,
@@ -14427,36 +14427,36 @@ class Prism::EnsureNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#5879
+  # source://prism/lib/prism/node.rb#5879
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#5801
+  # source://prism/lib/prism/node.rb#5801
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#5806
+  # source://prism/lib/prism/node.rb#5806
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#5818
+  # source://prism/lib/prism/node.rb#5818
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#5811
+  # source://prism/lib/prism/node.rb#5811
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?ensure_keyword_loc: Location, ?statements: StatementsNode?, ?end_keyword_loc: Location) -> EnsureNode
   #
-  # source://prism//lib/prism/node.rb#5823
+  # source://prism/lib/prism/node.rb#5823
   sig do
     params(
       node_id: Integer,
@@ -14472,37 +14472,37 @@ class Prism::EnsureNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#5806
+  # source://prism/lib/prism/node.rb#5806
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, ensure_keyword_loc: Location, statements: StatementsNode?, end_keyword_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#5831
+  # source://prism/lib/prism/node.rb#5831
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # def end_keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#5858
+  # source://prism/lib/prism/node.rb#5858
   sig { returns(String) }
   def end_keyword; end
 
   # attr_reader end_keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#5846
+  # source://prism/lib/prism/node.rb#5846
   sig { returns(Prism::Location) }
   def end_keyword_loc; end
 
   # def ensure_keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#5853
+  # source://prism/lib/prism/node.rb#5853
   sig { returns(String) }
   def ensure_keyword; end
 
   # attr_reader ensure_keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#5836
+  # source://prism/lib/prism/node.rb#5836
   sig { returns(Prism::Location) }
   def ensure_keyword_loc; end
 
@@ -14511,26 +14511,26 @@ class Prism::EnsureNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#5863
+  # source://prism/lib/prism/node.rb#5863
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader statements: StatementsNode?
   #
-  # source://prism//lib/prism/node.rb#5843
+  # source://prism/lib/prism/node.rb#5843
   sig { returns(T.nilable(Prism::StatementsNode)) }
   def statements; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#5868
+  # source://prism/lib/prism/node.rb#5868
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#5873
+    # source://prism/lib/prism/node.rb#5873
     def type; end
   end
 end
@@ -14540,62 +14540,62 @@ end
 #     false
 #     ^^^^^
 #
-# source://prism//lib/prism/node.rb#5891
+# source://prism/lib/prism/node.rb#5891
 class Prism::FalseNode < ::Prism::Node
   # Initialize a new FalseNode node.
   #
   # @return [FalseNode] a new instance of FalseNode
   #
-  # source://prism//lib/prism/node.rb#5893
+  # source://prism/lib/prism/node.rb#5893
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
   def initialize(source, node_id, location, flags); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#5950
+  # source://prism/lib/prism/node.rb#5950
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#5901
+  # source://prism/lib/prism/node.rb#5901
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#5906
+  # source://prism/lib/prism/node.rb#5906
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#5916
+  # source://prism/lib/prism/node.rb#5916
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#5911
+  # source://prism/lib/prism/node.rb#5911
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> FalseNode
   #
-  # source://prism//lib/prism/node.rb#5921
+  # source://prism/lib/prism/node.rb#5921
   sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::FalseNode) }
   def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end
 
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#5906
+  # source://prism/lib/prism/node.rb#5906
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
   #
-  # source://prism//lib/prism/node.rb#5929
+  # source://prism/lib/prism/node.rb#5929
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -14604,20 +14604,20 @@ class Prism::FalseNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#5934
+  # source://prism/lib/prism/node.rb#5934
   sig { override.returns(String) }
   def inspect; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#5939
+  # source://prism/lib/prism/node.rb#5939
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#5944
+    # source://prism/lib/prism/node.rb#5944
     def type; end
   end
 end
@@ -14633,13 +14633,13 @@ end
 #     foo in Foo(*bar, baz, *qux)
 #            ^^^^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#5965
+# source://prism/lib/prism/node.rb#5965
 class Prism::FindPatternNode < ::Prism::Node
   # Initialize a new FindPatternNode node.
   #
   # @return [FindPatternNode] a new instance of FindPatternNode
   #
-  # source://prism//lib/prism/node.rb#5967
+  # source://prism/lib/prism/node.rb#5967
   sig do
     params(
       source: Prism::Source,
@@ -14659,54 +14659,54 @@ class Prism::FindPatternNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#6083
+  # source://prism/lib/prism/node.rb#6083
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#5981
+  # source://prism/lib/prism/node.rb#5981
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#5986
+  # source://prism/lib/prism/node.rb#5986
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String?
   #
-  # source://prism//lib/prism/node.rb#6062
+  # source://prism/lib/prism/node.rb#6062
   sig { returns(T.nilable(String)) }
   def closing; end
 
   # attr_reader closing_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#6044
+  # source://prism/lib/prism/node.rb#6044
   sig { returns(T.nilable(Prism::Location)) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#6001
+  # source://prism/lib/prism/node.rb#6001
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#5991
+  # source://prism/lib/prism/node.rb#5991
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # attr_reader constant: ConstantReadNode | ConstantPathNode | nil
   #
-  # source://prism//lib/prism/node.rb#6019
+  # source://prism/lib/prism/node.rb#6019
   sig { returns(T.nilable(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode))) }
   def constant; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?constant: ConstantReadNode | ConstantPathNode | nil, ?left: SplatNode, ?requireds: Array[Prism::node], ?right: SplatNode | MissingNode, ?opening_loc: Location?, ?closing_loc: Location?) -> FindPatternNode
   #
-  # source://prism//lib/prism/node.rb#6006
+  # source://prism/lib/prism/node.rb#6006
   sig do
     params(
       node_id: Integer,
@@ -14725,13 +14725,13 @@ class Prism::FindPatternNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#5986
+  # source://prism/lib/prism/node.rb#5986
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, constant: ConstantReadNode | ConstantPathNode | nil, left: SplatNode, requireds: Array[Prism::node], right: SplatNode | MissingNode, opening_loc: Location?, closing_loc: Location? }
   #
-  # source://prism//lib/prism/node.rb#6014
+  # source://prism/lib/prism/node.rb#6014
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -14740,50 +14740,50 @@ class Prism::FindPatternNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#6067
+  # source://prism/lib/prism/node.rb#6067
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader left: SplatNode
   #
-  # source://prism//lib/prism/node.rb#6022
+  # source://prism/lib/prism/node.rb#6022
   sig { returns(Prism::SplatNode) }
   def left; end
 
   # def opening: () -> String?
   #
-  # source://prism//lib/prism/node.rb#6057
+  # source://prism/lib/prism/node.rb#6057
   sig { returns(T.nilable(String)) }
   def opening; end
 
   # attr_reader opening_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#6031
+  # source://prism/lib/prism/node.rb#6031
   sig { returns(T.nilable(Prism::Location)) }
   def opening_loc; end
 
   # attr_reader requireds: Array[Prism::node]
   #
-  # source://prism//lib/prism/node.rb#6025
+  # source://prism/lib/prism/node.rb#6025
   sig { returns(T::Array[Prism::Node]) }
   def requireds; end
 
   # attr_reader right: SplatNode | MissingNode
   #
-  # source://prism//lib/prism/node.rb#6028
+  # source://prism/lib/prism/node.rb#6028
   sig { returns(T.any(Prism::SplatNode, Prism::MissingNode)) }
   def right; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#6072
+  # source://prism/lib/prism/node.rb#6072
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#6077
+    # source://prism/lib/prism/node.rb#6077
     def type; end
   end
 end
@@ -14793,13 +14793,13 @@ end
 #     baz if foo .. bar
 #            ^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#6099
+# source://prism/lib/prism/node.rb#6099
 class Prism::FlipFlopNode < ::Prism::Node
   # Initialize a new FlipFlopNode node.
   #
   # @return [FlipFlopNode] a new instance of FlipFlopNode
   #
-  # source://prism//lib/prism/node.rb#6101
+  # source://prism/lib/prism/node.rb#6101
   sig do
     params(
       source: Prism::Source,
@@ -14816,36 +14816,36 @@ class Prism::FlipFlopNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#6187
+  # source://prism/lib/prism/node.rb#6187
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#6112
+  # source://prism/lib/prism/node.rb#6112
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6117
+  # source://prism/lib/prism/node.rb#6117
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#6130
+  # source://prism/lib/prism/node.rb#6130
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#6122
+  # source://prism/lib/prism/node.rb#6122
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?left: Prism::node?, ?right: Prism::node?, ?operator_loc: Location) -> FlipFlopNode
   #
-  # source://prism//lib/prism/node.rb#6135
+  # source://prism/lib/prism/node.rb#6135
   sig do
     params(
       node_id: Integer,
@@ -14861,13 +14861,13 @@ class Prism::FlipFlopNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6117
+  # source://prism/lib/prism/node.rb#6117
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, left: Prism::node?, right: Prism::node?, operator_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#6143
+  # source://prism/lib/prism/node.rb#6143
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -14875,7 +14875,7 @@ class Prism::FlipFlopNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#6148
+  # source://prism/lib/prism/node.rb#6148
   sig { returns(T::Boolean) }
   def exclude_end?; end
 
@@ -14884,44 +14884,44 @@ class Prism::FlipFlopNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#6171
+  # source://prism/lib/prism/node.rb#6171
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader left: Prism::node?
   #
-  # source://prism//lib/prism/node.rb#6153
+  # source://prism/lib/prism/node.rb#6153
   sig { returns(T.nilable(Prism::Node)) }
   def left; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#6166
+  # source://prism/lib/prism/node.rb#6166
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#6159
+  # source://prism/lib/prism/node.rb#6159
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # attr_reader right: Prism::node?
   #
-  # source://prism//lib/prism/node.rb#6156
+  # source://prism/lib/prism/node.rb#6156
   sig { returns(T.nilable(Prism::Node)) }
   def right; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#6176
+  # source://prism/lib/prism/node.rb#6176
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#6181
+    # source://prism/lib/prism/node.rb#6181
     def type; end
   end
 end
@@ -14931,62 +14931,62 @@ end
 #     1.0
 #     ^^^
 #
-# source://prism//lib/prism/node.rb#6200
+# source://prism/lib/prism/node.rb#6200
 class Prism::FloatNode < ::Prism::Node
   # Initialize a new FloatNode node.
   #
   # @return [FloatNode] a new instance of FloatNode
   #
-  # source://prism//lib/prism/node.rb#6202
+  # source://prism/lib/prism/node.rb#6202
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, value: Float).void }
   def initialize(source, node_id, location, flags, value); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#6263
+  # source://prism/lib/prism/node.rb#6263
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#6211
+  # source://prism/lib/prism/node.rb#6211
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6216
+  # source://prism/lib/prism/node.rb#6216
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#6226
+  # source://prism/lib/prism/node.rb#6226
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#6221
+  # source://prism/lib/prism/node.rb#6221
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: Float) -> FloatNode
   #
-  # source://prism//lib/prism/node.rb#6231
+  # source://prism/lib/prism/node.rb#6231
   sig { params(node_id: Integer, location: Prism::Location, flags: Integer, value: Float).returns(Prism::FloatNode) }
   def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), value: T.unsafe(nil)); end
 
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6216
+  # source://prism/lib/prism/node.rb#6216
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: Float }
   #
-  # source://prism//lib/prism/node.rb#6239
+  # source://prism/lib/prism/node.rb#6239
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -14995,26 +14995,26 @@ class Prism::FloatNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#6247
+  # source://prism/lib/prism/node.rb#6247
   sig { override.returns(String) }
   def inspect; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#6252
+  # source://prism/lib/prism/node.rb#6252
   sig { override.returns(Symbol) }
   def type; end
 
   # The value of the floating point number as a Float.
   #
-  # source://prism//lib/prism/node.rb#6244
+  # source://prism/lib/prism/node.rb#6244
   sig { returns(Float) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#6257
+    # source://prism/lib/prism/node.rb#6257
     def type; end
   end
 end
@@ -15024,13 +15024,13 @@ end
 #     for i in a end
 #     ^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#6273
+# source://prism/lib/prism/node.rb#6273
 class Prism::ForNode < ::Prism::Node
   # Initialize a new ForNode node.
   #
   # @return [ForNode] a new instance of ForNode
   #
-  # source://prism//lib/prism/node.rb#6275
+  # source://prism/lib/prism/node.rb#6275
   sig do
     params(
       source: Prism::Source,
@@ -15051,18 +15051,18 @@ class Prism::ForNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#6429
+  # source://prism/lib/prism/node.rb#6429
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#6290
+  # source://prism/lib/prism/node.rb#6290
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6295
+  # source://prism/lib/prism/node.rb#6295
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
@@ -15071,25 +15071,25 @@ class Prism::ForNode < ::Prism::Node
   #     for i in a end
   #              ^
   #
-  # source://prism//lib/prism/node.rb#6336
+  # source://prism/lib/prism/node.rb#6336
   sig { returns(Prism::Node) }
   def collection; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#6309
+  # source://prism/lib/prism/node.rb#6309
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#6300
+  # source://prism/lib/prism/node.rb#6300
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?index: LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | BackReferenceReadNode | NumberedReferenceReadNode | MissingNode, ?collection: Prism::node, ?statements: StatementsNode?, ?for_keyword_loc: Location, ?in_keyword_loc: Location, ?do_keyword_loc: Location?, ?end_keyword_loc: Location) -> ForNode
   #
-  # source://prism//lib/prism/node.rb#6314
+  # source://prism/lib/prism/node.rb#6314
   sig do
     params(
       node_id: Integer,
@@ -15109,19 +15109,19 @@ class Prism::ForNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6295
+  # source://prism/lib/prism/node.rb#6295
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, index: LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | BackReferenceReadNode | NumberedReferenceReadNode | MissingNode, collection: Prism::node, statements: StatementsNode?, for_keyword_loc: Location, in_keyword_loc: Location, do_keyword_loc: Location?, end_keyword_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#6322
+  # source://prism/lib/prism/node.rb#6322
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # def do_keyword: () -> String?
   #
-  # source://prism//lib/prism/node.rb#6403
+  # source://prism/lib/prism/node.rb#6403
   sig { returns(T.nilable(String)) }
   def do_keyword; end
 
@@ -15130,13 +15130,13 @@ class Prism::ForNode < ::Prism::Node
   #     for i in a do end
   #                ^^
   #
-  # source://prism//lib/prism/node.rb#6370
+  # source://prism/lib/prism/node.rb#6370
   sig { returns(T.nilable(Prism::Location)) }
   def do_keyword_loc; end
 
   # def end_keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#6408
+  # source://prism/lib/prism/node.rb#6408
   sig { returns(String) }
   def end_keyword; end
 
@@ -15145,7 +15145,7 @@ class Prism::ForNode < ::Prism::Node
   #     for i in a end
   #                ^^^
   #
-  # source://prism//lib/prism/node.rb#6386
+  # source://prism/lib/prism/node.rb#6386
   sig { returns(Prism::Location) }
   def end_keyword_loc; end
 
@@ -15154,7 +15154,7 @@ class Prism::ForNode < ::Prism::Node
 
   # def for_keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#6393
+  # source://prism/lib/prism/node.rb#6393
   sig { returns(String) }
   def for_keyword; end
 
@@ -15163,13 +15163,13 @@ class Prism::ForNode < ::Prism::Node
   #     for i in a end
   #     ^^^
   #
-  # source://prism//lib/prism/node.rb#6350
+  # source://prism/lib/prism/node.rb#6350
   sig { returns(Prism::Location) }
   def for_keyword_loc; end
 
   # def in_keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#6398
+  # source://prism/lib/prism/node.rb#6398
   sig { returns(String) }
   def in_keyword; end
 
@@ -15178,7 +15178,7 @@ class Prism::ForNode < ::Prism::Node
   #     for i in a end
   #           ^^
   #
-  # source://prism//lib/prism/node.rb#6360
+  # source://prism/lib/prism/node.rb#6360
   sig { returns(Prism::Location) }
   def in_keyword_loc; end
 
@@ -15187,7 +15187,7 @@ class Prism::ForNode < ::Prism::Node
   #     for i in a end
   #         ^
   #
-  # source://prism//lib/prism/node.rb#6330
+  # source://prism/lib/prism/node.rb#6330
   sig do
     returns(T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::MissingNode))
   end
@@ -15195,7 +15195,7 @@ class Prism::ForNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#6413
+  # source://prism/lib/prism/node.rb#6413
   sig { override.returns(String) }
   def inspect; end
 
@@ -15206,20 +15206,20 @@ class Prism::ForNode < ::Prism::Node
   #       ^^^^^^
   #     end
   #
-  # source://prism//lib/prism/node.rb#6344
+  # source://prism/lib/prism/node.rb#6344
   sig { returns(T.nilable(Prism::StatementsNode)) }
   def statements; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#6418
+  # source://prism/lib/prism/node.rb#6418
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#6423
+    # source://prism/lib/prism/node.rb#6423
     def type; end
   end
 end
@@ -15231,62 +15231,62 @@ end
 #           ^^^
 #     end
 #
-# source://prism//lib/prism/node.rb#6447
+# source://prism/lib/prism/node.rb#6447
 class Prism::ForwardingArgumentsNode < ::Prism::Node
   # Initialize a new ForwardingArgumentsNode node.
   #
   # @return [ForwardingArgumentsNode] a new instance of ForwardingArgumentsNode
   #
-  # source://prism//lib/prism/node.rb#6449
+  # source://prism/lib/prism/node.rb#6449
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
   def initialize(source, node_id, location, flags); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#6506
+  # source://prism/lib/prism/node.rb#6506
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#6457
+  # source://prism/lib/prism/node.rb#6457
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6462
+  # source://prism/lib/prism/node.rb#6462
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#6472
+  # source://prism/lib/prism/node.rb#6472
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#6467
+  # source://prism/lib/prism/node.rb#6467
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> ForwardingArgumentsNode
   #
-  # source://prism//lib/prism/node.rb#6477
+  # source://prism/lib/prism/node.rb#6477
   sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::ForwardingArgumentsNode) }
   def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end
 
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6462
+  # source://prism/lib/prism/node.rb#6462
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
   #
-  # source://prism//lib/prism/node.rb#6485
+  # source://prism/lib/prism/node.rb#6485
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -15295,20 +15295,20 @@ class Prism::ForwardingArgumentsNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#6490
+  # source://prism/lib/prism/node.rb#6490
   sig { override.returns(String) }
   def inspect; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#6495
+  # source://prism/lib/prism/node.rb#6495
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#6500
+    # source://prism/lib/prism/node.rb#6500
     def type; end
   end
 end
@@ -15319,62 +15319,62 @@ end
 #             ^^^
 #     end
 #
-# source://prism//lib/prism/node.rb#6516
+# source://prism/lib/prism/node.rb#6516
 class Prism::ForwardingParameterNode < ::Prism::Node
   # Initialize a new ForwardingParameterNode node.
   #
   # @return [ForwardingParameterNode] a new instance of ForwardingParameterNode
   #
-  # source://prism//lib/prism/node.rb#6518
+  # source://prism/lib/prism/node.rb#6518
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
   def initialize(source, node_id, location, flags); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#6575
+  # source://prism/lib/prism/node.rb#6575
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#6526
+  # source://prism/lib/prism/node.rb#6526
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6531
+  # source://prism/lib/prism/node.rb#6531
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#6541
+  # source://prism/lib/prism/node.rb#6541
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#6536
+  # source://prism/lib/prism/node.rb#6536
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> ForwardingParameterNode
   #
-  # source://prism//lib/prism/node.rb#6546
+  # source://prism/lib/prism/node.rb#6546
   sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::ForwardingParameterNode) }
   def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end
 
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6531
+  # source://prism/lib/prism/node.rb#6531
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
   #
-  # source://prism//lib/prism/node.rb#6554
+  # source://prism/lib/prism/node.rb#6554
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -15383,20 +15383,20 @@ class Prism::ForwardingParameterNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#6559
+  # source://prism/lib/prism/node.rb#6559
   sig { override.returns(String) }
   def inspect; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#6564
+  # source://prism/lib/prism/node.rb#6564
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#6569
+    # source://prism/lib/prism/node.rb#6569
     def type; end
   end
 end
@@ -15406,13 +15406,13 @@ end
 #     super
 #     ^^^^^
 #
-# source://prism//lib/prism/node.rb#6584
+# source://prism/lib/prism/node.rb#6584
 class Prism::ForwardingSuperNode < ::Prism::Node
   # Initialize a new ForwardingSuperNode node.
   #
   # @return [ForwardingSuperNode] a new instance of ForwardingSuperNode
   #
-  # source://prism//lib/prism/node.rb#6586
+  # source://prism/lib/prism/node.rb#6586
   sig do
     params(
       source: Prism::Source,
@@ -15427,42 +15427,42 @@ class Prism::ForwardingSuperNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#6649
+  # source://prism/lib/prism/node.rb#6649
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#6595
+  # source://prism/lib/prism/node.rb#6595
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader block: BlockNode?
   #
-  # source://prism//lib/prism/node.rb#6630
+  # source://prism/lib/prism/node.rb#6630
   sig { returns(T.nilable(Prism::BlockNode)) }
   def block; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6600
+  # source://prism/lib/prism/node.rb#6600
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#6612
+  # source://prism/lib/prism/node.rb#6612
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#6605
+  # source://prism/lib/prism/node.rb#6605
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?block: BlockNode?) -> ForwardingSuperNode
   #
-  # source://prism//lib/prism/node.rb#6617
+  # source://prism/lib/prism/node.rb#6617
   sig do
     params(
       node_id: Integer,
@@ -15476,13 +15476,13 @@ class Prism::ForwardingSuperNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6600
+  # source://prism/lib/prism/node.rb#6600
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, block: BlockNode? }
   #
-  # source://prism//lib/prism/node.rb#6625
+  # source://prism/lib/prism/node.rb#6625
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -15491,20 +15491,20 @@ class Prism::ForwardingSuperNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#6633
+  # source://prism/lib/prism/node.rb#6633
   sig { override.returns(String) }
   def inspect; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#6638
+  # source://prism/lib/prism/node.rb#6638
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#6643
+    # source://prism/lib/prism/node.rb#6643
     def type; end
   end
 end
@@ -15514,13 +15514,13 @@ end
 #     $target &&= value
 #     ^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#6659
+# source://prism/lib/prism/node.rb#6659
 class Prism::GlobalVariableAndWriteNode < ::Prism::Node
   # Initialize a new GlobalVariableAndWriteNode node.
   #
   # @return [GlobalVariableAndWriteNode] a new instance of GlobalVariableAndWriteNode
   #
-  # source://prism//lib/prism/node.rb#6661
+  # source://prism/lib/prism/node.rb#6661
   sig do
     params(
       source: Prism::Source,
@@ -15538,36 +15538,36 @@ class Prism::GlobalVariableAndWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#6747
+  # source://prism/lib/prism/node.rb#6747
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#6673
+  # source://prism/lib/prism/node.rb#6673
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6678
+  # source://prism/lib/prism/node.rb#6678
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#6688
+  # source://prism/lib/prism/node.rb#6688
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#6683
+  # source://prism/lib/prism/node.rb#6683
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> GlobalVariableAndWriteNode
   #
-  # source://prism//lib/prism/node.rb#6693
+  # source://prism/lib/prism/node.rb#6693
   sig do
     params(
       node_id: Integer,
@@ -15584,17 +15584,17 @@ class Prism::GlobalVariableAndWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6678
+  # source://prism/lib/prism/node.rb#6678
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#6701
+  # source://prism/lib/prism/node.rb#6701
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
-  # source://prism//lib/prism/desugar_compiler.rb#200
+  # source://prism/lib/prism/desugar_compiler.rb#200
   def desugar; end
 
   sig { override.returns(T::Array[Prism::Reflection::Field]) }
@@ -15602,50 +15602,50 @@ class Prism::GlobalVariableAndWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#6731
+  # source://prism/lib/prism/node.rb#6731
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#6706
+  # source://prism/lib/prism/node.rb#6706
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#6709
+  # source://prism/lib/prism/node.rb#6709
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#6726
+  # source://prism/lib/prism/node.rb#6726
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#6716
+  # source://prism/lib/prism/node.rb#6716
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#6736
+  # source://prism/lib/prism/node.rb#6736
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#6723
+  # source://prism/lib/prism/node.rb#6723
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#6741
+    # source://prism/lib/prism/node.rb#6741
     def type; end
   end
 end
@@ -15655,13 +15655,13 @@ end
 #     $target += value
 #     ^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#6760
+# source://prism/lib/prism/node.rb#6760
 class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node
   # Initialize a new GlobalVariableOperatorWriteNode node.
   #
   # @return [GlobalVariableOperatorWriteNode] a new instance of GlobalVariableOperatorWriteNode
   #
-  # source://prism//lib/prism/node.rb#6762
+  # source://prism/lib/prism/node.rb#6762
   sig do
     params(
       source: Prism::Source,
@@ -15680,48 +15680,48 @@ class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#6847
+  # source://prism/lib/prism/node.rb#6847
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#6775
+  # source://prism/lib/prism/node.rb#6775
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader binary_operator: Symbol
   #
-  # source://prism//lib/prism/node.rb#6828
+  # source://prism/lib/prism/node.rb#6828
   sig { returns(Symbol) }
   def binary_operator; end
 
   # attr_reader binary_operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#6818
+  # source://prism/lib/prism/node.rb#6818
   sig { returns(Prism::Location) }
   def binary_operator_loc; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6780
+  # source://prism/lib/prism/node.rb#6780
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#6790
+  # source://prism/lib/prism/node.rb#6790
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#6785
+  # source://prism/lib/prism/node.rb#6785
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol) -> GlobalVariableOperatorWriteNode
   #
-  # source://prism//lib/prism/node.rb#6795
+  # source://prism/lib/prism/node.rb#6795
   sig do
     params(
       node_id: Integer,
@@ -15739,17 +15739,17 @@ class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6780
+  # source://prism/lib/prism/node.rb#6780
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol }
   #
-  # source://prism//lib/prism/node.rb#6803
+  # source://prism/lib/prism/node.rb#6803
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
-  # source://prism//lib/prism/desugar_compiler.rb#212
+  # source://prism/lib/prism/desugar_compiler.rb#212
   def desugar; end
 
   sig { override.returns(T::Array[Prism::Reflection::Field]) }
@@ -15757,50 +15757,50 @@ class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#6831
+  # source://prism/lib/prism/node.rb#6831
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#6808
+  # source://prism/lib/prism/node.rb#6808
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#6811
+  # source://prism/lib/prism/node.rb#6811
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # Returns the binary operator used to modify the receiver. This method is
   # deprecated in favor of #binary_operator.
   #
-  # source://prism//lib/prism/node_ext.rb#403
+  # source://prism/lib/prism/node_ext.rb#403
   def operator; end
 
   # Returns the location of the binary operator used to modify the receiver.
   # This method is deprecated in favor of #binary_operator_loc.
   #
-  # source://prism//lib/prism/node_ext.rb#410
+  # source://prism/lib/prism/node_ext.rb#410
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#6836
+  # source://prism/lib/prism/node.rb#6836
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#6825
+  # source://prism/lib/prism/node.rb#6825
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#6841
+    # source://prism/lib/prism/node.rb#6841
     def type; end
   end
 end
@@ -15810,13 +15810,13 @@ end
 #     $target ||= value
 #     ^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#6861
+# source://prism/lib/prism/node.rb#6861
 class Prism::GlobalVariableOrWriteNode < ::Prism::Node
   # Initialize a new GlobalVariableOrWriteNode node.
   #
   # @return [GlobalVariableOrWriteNode] a new instance of GlobalVariableOrWriteNode
   #
-  # source://prism//lib/prism/node.rb#6863
+  # source://prism/lib/prism/node.rb#6863
   sig do
     params(
       source: Prism::Source,
@@ -15834,36 +15834,36 @@ class Prism::GlobalVariableOrWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#6949
+  # source://prism/lib/prism/node.rb#6949
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#6875
+  # source://prism/lib/prism/node.rb#6875
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6880
+  # source://prism/lib/prism/node.rb#6880
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#6890
+  # source://prism/lib/prism/node.rb#6890
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#6885
+  # source://prism/lib/prism/node.rb#6885
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> GlobalVariableOrWriteNode
   #
-  # source://prism//lib/prism/node.rb#6895
+  # source://prism/lib/prism/node.rb#6895
   sig do
     params(
       node_id: Integer,
@@ -15880,17 +15880,17 @@ class Prism::GlobalVariableOrWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6880
+  # source://prism/lib/prism/node.rb#6880
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#6903
+  # source://prism/lib/prism/node.rb#6903
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
-  # source://prism//lib/prism/desugar_compiler.rb#206
+  # source://prism/lib/prism/desugar_compiler.rb#206
   def desugar; end
 
   sig { override.returns(T::Array[Prism::Reflection::Field]) }
@@ -15898,50 +15898,50 @@ class Prism::GlobalVariableOrWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#6933
+  # source://prism/lib/prism/node.rb#6933
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#6908
+  # source://prism/lib/prism/node.rb#6908
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#6911
+  # source://prism/lib/prism/node.rb#6911
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#6928
+  # source://prism/lib/prism/node.rb#6928
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#6918
+  # source://prism/lib/prism/node.rb#6918
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#6938
+  # source://prism/lib/prism/node.rb#6938
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#6925
+  # source://prism/lib/prism/node.rb#6925
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#6943
+    # source://prism/lib/prism/node.rb#6943
     def type; end
   end
 end
@@ -15951,49 +15951,49 @@ end
 #     $foo
 #     ^^^^
 #
-# source://prism//lib/prism/node.rb#6962
+# source://prism/lib/prism/node.rb#6962
 class Prism::GlobalVariableReadNode < ::Prism::Node
   # Initialize a new GlobalVariableReadNode node.
   #
   # @return [GlobalVariableReadNode] a new instance of GlobalVariableReadNode
   #
-  # source://prism//lib/prism/node.rb#6964
+  # source://prism/lib/prism/node.rb#6964
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
   def initialize(source, node_id, location, flags, name); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#7029
+  # source://prism/lib/prism/node.rb#7029
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#6973
+  # source://prism/lib/prism/node.rb#6973
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6978
+  # source://prism/lib/prism/node.rb#6978
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#6988
+  # source://prism/lib/prism/node.rb#6988
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#6983
+  # source://prism/lib/prism/node.rb#6983
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> GlobalVariableReadNode
   #
-  # source://prism//lib/prism/node.rb#6993
+  # source://prism/lib/prism/node.rb#6993
   sig do
     params(
       node_id: Integer,
@@ -16007,13 +16007,13 @@ class Prism::GlobalVariableReadNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#6978
+  # source://prism/lib/prism/node.rb#6978
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
   #
-  # source://prism//lib/prism/node.rb#7001
+  # source://prism/lib/prism/node.rb#7001
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -16022,7 +16022,7 @@ class Prism::GlobalVariableReadNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#7013
+  # source://prism/lib/prism/node.rb#7013
   sig { override.returns(String) }
   def inspect; end
 
@@ -16032,20 +16032,20 @@ class Prism::GlobalVariableReadNode < ::Prism::Node
   #
   #     $_Test # name `:$_Test`
   #
-  # source://prism//lib/prism/node.rb#7010
+  # source://prism/lib/prism/node.rb#7010
   sig { returns(Symbol) }
   def name; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#7018
+  # source://prism/lib/prism/node.rb#7018
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#7023
+    # source://prism/lib/prism/node.rb#7023
     def type; end
   end
 end
@@ -16055,49 +16055,49 @@ end
 #     $foo, $bar = baz
 #     ^^^^  ^^^^
 #
-# source://prism//lib/prism/node.rb#7039
+# source://prism/lib/prism/node.rb#7039
 class Prism::GlobalVariableTargetNode < ::Prism::Node
   # Initialize a new GlobalVariableTargetNode node.
   #
   # @return [GlobalVariableTargetNode] a new instance of GlobalVariableTargetNode
   #
-  # source://prism//lib/prism/node.rb#7041
+  # source://prism/lib/prism/node.rb#7041
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
   def initialize(source, node_id, location, flags, name); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#7102
+  # source://prism/lib/prism/node.rb#7102
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#7050
+  # source://prism/lib/prism/node.rb#7050
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#7055
+  # source://prism/lib/prism/node.rb#7055
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#7065
+  # source://prism/lib/prism/node.rb#7065
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#7060
+  # source://prism/lib/prism/node.rb#7060
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> GlobalVariableTargetNode
   #
-  # source://prism//lib/prism/node.rb#7070
+  # source://prism/lib/prism/node.rb#7070
   sig do
     params(
       node_id: Integer,
@@ -16111,13 +16111,13 @@ class Prism::GlobalVariableTargetNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#7055
+  # source://prism/lib/prism/node.rb#7055
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
   #
-  # source://prism//lib/prism/node.rb#7078
+  # source://prism/lib/prism/node.rb#7078
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -16126,26 +16126,26 @@ class Prism::GlobalVariableTargetNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#7086
+  # source://prism/lib/prism/node.rb#7086
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#7083
+  # source://prism/lib/prism/node.rb#7083
   sig { returns(Symbol) }
   def name; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#7091
+  # source://prism/lib/prism/node.rb#7091
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#7096
+    # source://prism/lib/prism/node.rb#7096
     def type; end
   end
 end
@@ -16155,13 +16155,13 @@ end
 #     $foo = 1
 #     ^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#7112
+# source://prism/lib/prism/node.rb#7112
 class Prism::GlobalVariableWriteNode < ::Prism::Node
   # Initialize a new GlobalVariableWriteNode node.
   #
   # @return [GlobalVariableWriteNode] a new instance of GlobalVariableWriteNode
   #
-  # source://prism//lib/prism/node.rb#7114
+  # source://prism/lib/prism/node.rb#7114
   sig do
     params(
       source: Prism::Source,
@@ -16179,36 +16179,36 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#7216
+  # source://prism/lib/prism/node.rb#7216
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#7126
+  # source://prism/lib/prism/node.rb#7126
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#7131
+  # source://prism/lib/prism/node.rb#7131
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#7141
+  # source://prism/lib/prism/node.rb#7141
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#7136
+  # source://prism/lib/prism/node.rb#7136
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location) -> GlobalVariableWriteNode
   #
-  # source://prism//lib/prism/node.rb#7146
+  # source://prism/lib/prism/node.rb#7146
   sig do
     params(
       node_id: Integer,
@@ -16225,13 +16225,13 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#7131
+  # source://prism/lib/prism/node.rb#7131
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#7154
+  # source://prism/lib/prism/node.rb#7154
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -16240,7 +16240,7 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#7200
+  # source://prism/lib/prism/node.rb#7200
   sig { override.returns(String) }
   def inspect; end
 
@@ -16250,7 +16250,7 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node
   #
   #     $_Test = 123 # name `:$_Test`
   #
-  # source://prism//lib/prism/node.rb#7163
+  # source://prism/lib/prism/node.rb#7163
   sig { returns(Symbol) }
   def name; end
 
@@ -16259,13 +16259,13 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node
   #     $foo = :bar
   #     ^^^^
   #
-  # source://prism//lib/prism/node.rb#7169
+  # source://prism/lib/prism/node.rb#7169
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#7195
+  # source://prism/lib/prism/node.rb#7195
   sig { returns(String) }
   def operator; end
 
@@ -16274,13 +16274,13 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node
   #     $foo = :bar
   #          ^
   #
-  # source://prism//lib/prism/node.rb#7188
+  # source://prism/lib/prism/node.rb#7188
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#7205
+  # source://prism/lib/prism/node.rb#7205
   sig { override.returns(Symbol) }
   def type; end
 
@@ -16292,14 +16292,14 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node
   #     $-xyz = 123
   #             ^^^
   #
-  # source://prism//lib/prism/node.rb#7182
+  # source://prism/lib/prism/node.rb#7182
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#7210
+    # source://prism/lib/prism/node.rb#7210
     def type; end
   end
 end
@@ -16309,13 +16309,13 @@ end
 #     { a => b }
 #     ^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#7229
+# source://prism/lib/prism/node.rb#7229
 class Prism::HashNode < ::Prism::Node
   # Initialize a new HashNode node.
   #
   # @return [HashNode] a new instance of HashNode
   #
-  # source://prism//lib/prism/node.rb#7231
+  # source://prism/lib/prism/node.rb#7231
   sig do
     params(
       source: Prism::Source,
@@ -16332,24 +16332,24 @@ class Prism::HashNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#7330
+  # source://prism/lib/prism/node.rb#7330
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#7242
+  # source://prism/lib/prism/node.rb#7242
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#7247
+  # source://prism/lib/prism/node.rb#7247
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String
   #
-  # source://prism//lib/prism/node.rb#7309
+  # source://prism/lib/prism/node.rb#7309
   sig { returns(String) }
   def closing; end
 
@@ -16358,25 +16358,25 @@ class Prism::HashNode < ::Prism::Node
   #     { a => b }
   #              ^
   #
-  # source://prism//lib/prism/node.rb#7297
+  # source://prism/lib/prism/node.rb#7297
   sig { returns(Prism::Location) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#7257
+  # source://prism/lib/prism/node.rb#7257
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#7252
+  # source://prism/lib/prism/node.rb#7252
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?elements: Array[AssocNode | AssocSplatNode], ?closing_loc: Location) -> HashNode
   #
-  # source://prism//lib/prism/node.rb#7262
+  # source://prism/lib/prism/node.rb#7262
   sig do
     params(
       node_id: Integer,
@@ -16392,13 +16392,13 @@ class Prism::HashNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#7247
+  # source://prism/lib/prism/node.rb#7247
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, elements: Array[AssocNode | AssocSplatNode], closing_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#7270
+  # source://prism/lib/prism/node.rb#7270
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -16410,7 +16410,7 @@ class Prism::HashNode < ::Prism::Node
   #     { **foo }
   #       ^^^^^
   #
-  # source://prism//lib/prism/node.rb#7291
+  # source://prism/lib/prism/node.rb#7291
   sig { returns(T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)]) }
   def elements; end
 
@@ -16419,13 +16419,13 @@ class Prism::HashNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#7314
+  # source://prism/lib/prism/node.rb#7314
   sig { override.returns(String) }
   def inspect; end
 
   # def opening: () -> String
   #
-  # source://prism//lib/prism/node.rb#7304
+  # source://prism/lib/prism/node.rb#7304
   sig { returns(String) }
   def opening; end
 
@@ -16434,20 +16434,20 @@ class Prism::HashNode < ::Prism::Node
   #     { a => b }
   #     ^
   #
-  # source://prism//lib/prism/node.rb#7278
+  # source://prism/lib/prism/node.rb#7278
   sig { returns(Prism::Location) }
   def opening_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#7319
+  # source://prism/lib/prism/node.rb#7319
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#7324
+    # source://prism/lib/prism/node.rb#7324
     def type; end
   end
 end
@@ -16460,13 +16460,13 @@ end
 #     foo => { a: 1, b: 2, **c }
 #            ^^^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#7346
+# source://prism/lib/prism/node.rb#7346
 class Prism::HashPatternNode < ::Prism::Node
   # Initialize a new HashPatternNode node.
   #
   # @return [HashPatternNode] a new instance of HashPatternNode
   #
-  # source://prism//lib/prism/node.rb#7348
+  # source://prism/lib/prism/node.rb#7348
   sig do
     params(
       source: Prism::Source,
@@ -16485,54 +16485,54 @@ class Prism::HashPatternNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#7459
+  # source://prism/lib/prism/node.rb#7459
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#7361
+  # source://prism/lib/prism/node.rb#7361
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#7366
+  # source://prism/lib/prism/node.rb#7366
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String?
   #
-  # source://prism//lib/prism/node.rb#7438
+  # source://prism/lib/prism/node.rb#7438
   sig { returns(T.nilable(String)) }
   def closing; end
 
   # attr_reader closing_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#7420
+  # source://prism/lib/prism/node.rb#7420
   sig { returns(T.nilable(Prism::Location)) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#7380
+  # source://prism/lib/prism/node.rb#7380
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#7371
+  # source://prism/lib/prism/node.rb#7371
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # attr_reader constant: ConstantReadNode | ConstantPathNode | nil
   #
-  # source://prism//lib/prism/node.rb#7398
+  # source://prism/lib/prism/node.rb#7398
   sig { returns(T.nilable(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode))) }
   def constant; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?constant: ConstantReadNode | ConstantPathNode | nil, ?elements: Array[AssocNode], ?rest: AssocSplatNode | NoKeywordsParameterNode | nil, ?opening_loc: Location?, ?closing_loc: Location?) -> HashPatternNode
   #
-  # source://prism//lib/prism/node.rb#7385
+  # source://prism/lib/prism/node.rb#7385
   sig do
     params(
       node_id: Integer,
@@ -16550,19 +16550,19 @@ class Prism::HashPatternNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#7366
+  # source://prism/lib/prism/node.rb#7366
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, constant: ConstantReadNode | ConstantPathNode | nil, elements: Array[AssocNode], rest: AssocSplatNode | NoKeywordsParameterNode | nil, opening_loc: Location?, closing_loc: Location? }
   #
-  # source://prism//lib/prism/node.rb#7393
+  # source://prism/lib/prism/node.rb#7393
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # attr_reader elements: Array[AssocNode]
   #
-  # source://prism//lib/prism/node.rb#7401
+  # source://prism/lib/prism/node.rb#7401
   sig { returns(T::Array[Prism::AssocNode]) }
   def elements; end
 
@@ -16571,49 +16571,49 @@ class Prism::HashPatternNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#7443
+  # source://prism/lib/prism/node.rb#7443
   sig { override.returns(String) }
   def inspect; end
 
   # def opening: () -> String?
   #
-  # source://prism//lib/prism/node.rb#7433
+  # source://prism/lib/prism/node.rb#7433
   sig { returns(T.nilable(String)) }
   def opening; end
 
   # attr_reader opening_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#7407
+  # source://prism/lib/prism/node.rb#7407
   sig { returns(T.nilable(Prism::Location)) }
   def opening_loc; end
 
   # attr_reader rest: AssocSplatNode | NoKeywordsParameterNode | nil
   #
-  # source://prism//lib/prism/node.rb#7404
+  # source://prism/lib/prism/node.rb#7404
   sig { returns(T.nilable(T.any(Prism::AssocSplatNode, Prism::NoKeywordsParameterNode))) }
   def rest; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#7448
+  # source://prism/lib/prism/node.rb#7448
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#7453
+    # source://prism/lib/prism/node.rb#7453
     def type; end
   end
 end
 
-# source://prism//lib/prism/node_ext.rb#52
+# source://prism/lib/prism/node_ext.rb#52
 module Prism::HeredocQuery
   # Returns true if this node was represented as a heredoc in the source code.
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node_ext.rb#54
+  # source://prism/lib/prism/node_ext.rb#54
   def heredoc?; end
 end
 
@@ -16628,13 +16628,13 @@ end
 #     foo ? bar : baz
 #     ^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#7480
+# source://prism/lib/prism/node.rb#7480
 class Prism::IfNode < ::Prism::Node
   # Initialize a new IfNode node.
   #
   # @return [IfNode] a new instance of IfNode
   #
-  # source://prism//lib/prism/node.rb#7482
+  # source://prism/lib/prism/node.rb#7482
   sig do
     params(
       source: Prism::Source,
@@ -16654,42 +16654,42 @@ class Prism::IfNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#7658
+  # source://prism/lib/prism/node.rb#7658
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#7496
+  # source://prism/lib/prism/node.rb#7496
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#7501
+  # source://prism/lib/prism/node.rb#7501
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#7515
+  # source://prism/lib/prism/node.rb#7515
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#7506
+  # source://prism/lib/prism/node.rb#7506
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # Returns the subsequent if/elsif/else clause of the if node. This method is
   # deprecated in favor of #subsequent.
   #
-  # source://prism//lib/prism/node_ext.rb#485
+  # source://prism/lib/prism/node_ext.rb#485
   def consequent; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?if_keyword_loc: Location?, ?predicate: Prism::node, ?then_keyword_loc: Location?, ?statements: StatementsNode?, ?subsequent: ElseNode | IfNode | nil, ?end_keyword_loc: Location?) -> IfNode
   #
-  # source://prism//lib/prism/node.rb#7520
+  # source://prism/lib/prism/node.rb#7520
   sig do
     params(
       node_id: Integer,
@@ -16708,19 +16708,19 @@ class Prism::IfNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#7501
+  # source://prism/lib/prism/node.rb#7501
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, if_keyword_loc: Location?, predicate: Prism::node, then_keyword_loc: Location?, statements: StatementsNode?, subsequent: ElseNode | IfNode | nil, end_keyword_loc: Location? }
   #
-  # source://prism//lib/prism/node.rb#7528
+  # source://prism/lib/prism/node.rb#7528
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # def end_keyword: () -> String?
   #
-  # source://prism//lib/prism/node.rb#7637
+  # source://prism/lib/prism/node.rb#7637
   sig { returns(T.nilable(String)) }
   def end_keyword; end
 
@@ -16731,7 +16731,7 @@ class Prism::IfNode < ::Prism::Node
   #     end
   #     ^^^
   #
-  # source://prism//lib/prism/node.rb#7614
+  # source://prism/lib/prism/node.rb#7614
   sig { returns(T.nilable(Prism::Location)) }
   def end_keyword_loc; end
 
@@ -16740,7 +16740,7 @@ class Prism::IfNode < ::Prism::Node
 
   # def if_keyword: () -> String?
   #
-  # source://prism//lib/prism/node.rb#7627
+  # source://prism/lib/prism/node.rb#7627
   sig { returns(T.nilable(String)) }
   def if_keyword; end
 
@@ -16751,17 +16751,17 @@ class Prism::IfNode < ::Prism::Node
   #
   # The `if_keyword_loc` field will be `nil` when the `IfNode` represents a ternary expression.
   #
-  # source://prism//lib/prism/node.rb#7538
+  # source://prism/lib/prism/node.rb#7538
   sig { returns(T.nilable(Prism::Location)) }
   def if_keyword_loc; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#7642
+  # source://prism/lib/prism/node.rb#7642
   sig { override.returns(String) }
   def inspect; end
 
-  # source://prism//lib/prism/parse_result/newlines.rb#91
+  # source://prism/lib/prism/parse_result/newlines.rb#91
   def newline_flag!(lines); end
 
   # The node for the condition the `IfNode` is testing.
@@ -16777,7 +16777,7 @@ class Prism::IfNode < ::Prism::Node
   #     foo ? bar : baz
   #     ^^^
   #
-  # source://prism//lib/prism/node.rb#7562
+  # source://prism/lib/prism/node.rb#7562
   sig { returns(Prism::Node) }
   def predicate; end
 
@@ -16790,7 +16790,7 @@ class Prism::IfNode < ::Prism::Node
   #       ^^^
   #     end
   #
-  # source://prism//lib/prism/node.rb#7591
+  # source://prism/lib/prism/node.rb#7591
   sig { returns(T.nilable(Prism::StatementsNode)) }
   def statements; end
 
@@ -16808,13 +16808,13 @@ class Prism::IfNode < ::Prism::Node
   #     if foo then bar else baz end
   #                     ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/node.rb#7606
+  # source://prism/lib/prism/node.rb#7606
   sig { returns(T.nilable(T.any(Prism::ElseNode, Prism::IfNode))) }
   def subsequent; end
 
   # def then_keyword: () -> String?
   #
-  # source://prism//lib/prism/node.rb#7632
+  # source://prism/lib/prism/node.rb#7632
   sig { returns(T.nilable(String)) }
   def then_keyword; end
 
@@ -16826,20 +16826,20 @@ class Prism::IfNode < ::Prism::Node
   #     a ? b : c
   #       ^
   #
-  # source://prism//lib/prism/node.rb#7571
+  # source://prism/lib/prism/node.rb#7571
   sig { returns(T.nilable(Prism::Location)) }
   def then_keyword_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#7647
+  # source://prism/lib/prism/node.rb#7647
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#7652
+    # source://prism/lib/prism/node.rb#7652
     def type; end
   end
 end
@@ -16849,13 +16849,13 @@ end
 #     1.0i
 #     ^^^^
 #
-# source://prism//lib/prism/node.rb#7673
+# source://prism/lib/prism/node.rb#7673
 class Prism::ImaginaryNode < ::Prism::Node
   # Initialize a new ImaginaryNode node.
   #
   # @return [ImaginaryNode] a new instance of ImaginaryNode
   #
-  # source://prism//lib/prism/node.rb#7675
+  # source://prism/lib/prism/node.rb#7675
   sig do
     params(
       source: Prism::Source,
@@ -16870,36 +16870,36 @@ class Prism::ImaginaryNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#7736
+  # source://prism/lib/prism/node.rb#7736
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#7684
+  # source://prism/lib/prism/node.rb#7684
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#7689
+  # source://prism/lib/prism/node.rb#7689
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#7699
+  # source://prism/lib/prism/node.rb#7699
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#7694
+  # source://prism/lib/prism/node.rb#7694
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?numeric: FloatNode | IntegerNode | RationalNode) -> ImaginaryNode
   #
-  # source://prism//lib/prism/node.rb#7704
+  # source://prism/lib/prism/node.rb#7704
   sig do
     params(
       node_id: Integer,
@@ -16913,13 +16913,13 @@ class Prism::ImaginaryNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#7689
+  # source://prism/lib/prism/node.rb#7689
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, numeric: FloatNode | IntegerNode | RationalNode }
   #
-  # source://prism//lib/prism/node.rb#7712
+  # source://prism/lib/prism/node.rb#7712
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -16928,32 +16928,32 @@ class Prism::ImaginaryNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#7720
+  # source://prism/lib/prism/node.rb#7720
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader numeric: FloatNode | IntegerNode | RationalNode
   #
-  # source://prism//lib/prism/node.rb#7717
+  # source://prism/lib/prism/node.rb#7717
   sig { returns(T.any(Prism::FloatNode, Prism::IntegerNode, Prism::RationalNode)) }
   def numeric; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#7725
+  # source://prism/lib/prism/node.rb#7725
   sig { override.returns(Symbol) }
   def type; end
 
   # Returns the value of the node as a Ruby Complex.
   #
-  # source://prism//lib/prism/node_ext.rb#107
+  # source://prism/lib/prism/node_ext.rb#107
   sig { returns(Complex) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#7730
+    # source://prism/lib/prism/node.rb#7730
     def type; end
   end
 end
@@ -16969,13 +16969,13 @@ end
 #     foo in { bar: }
 #              ^^^^
 #
-# source://prism//lib/prism/node.rb#7752
+# source://prism/lib/prism/node.rb#7752
 class Prism::ImplicitNode < ::Prism::Node
   # Initialize a new ImplicitNode node.
   #
   # @return [ImplicitNode] a new instance of ImplicitNode
   #
-  # source://prism//lib/prism/node.rb#7754
+  # source://prism/lib/prism/node.rb#7754
   sig do
     params(
       source: Prism::Source,
@@ -16990,36 +16990,36 @@ class Prism::ImplicitNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#7815
+  # source://prism/lib/prism/node.rb#7815
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#7763
+  # source://prism/lib/prism/node.rb#7763
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#7768
+  # source://prism/lib/prism/node.rb#7768
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#7778
+  # source://prism/lib/prism/node.rb#7778
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#7773
+  # source://prism/lib/prism/node.rb#7773
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: LocalVariableReadNode | CallNode | ConstantReadNode | LocalVariableTargetNode) -> ImplicitNode
   #
-  # source://prism//lib/prism/node.rb#7783
+  # source://prism/lib/prism/node.rb#7783
   sig do
     params(
       node_id: Integer,
@@ -17033,13 +17033,13 @@ class Prism::ImplicitNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#7768
+  # source://prism/lib/prism/node.rb#7768
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: LocalVariableReadNode | CallNode | ConstantReadNode | LocalVariableTargetNode }
   #
-  # source://prism//lib/prism/node.rb#7791
+  # source://prism/lib/prism/node.rb#7791
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -17048,19 +17048,19 @@ class Prism::ImplicitNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#7799
+  # source://prism/lib/prism/node.rb#7799
   sig { override.returns(String) }
   def inspect; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#7804
+  # source://prism/lib/prism/node.rb#7804
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: LocalVariableReadNode | CallNode | ConstantReadNode | LocalVariableTargetNode
   #
-  # source://prism//lib/prism/node.rb#7796
+  # source://prism/lib/prism/node.rb#7796
   sig do
     returns(T.any(Prism::LocalVariableReadNode, Prism::CallNode, Prism::ConstantReadNode, Prism::LocalVariableTargetNode))
   end
@@ -17069,7 +17069,7 @@ class Prism::ImplicitNode < ::Prism::Node
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#7809
+    # source://prism/lib/prism/node.rb#7809
     def type; end
   end
 end
@@ -17088,62 +17088,62 @@ end
 #     foo, = bar
 #        ^
 #
-# source://prism//lib/prism/node.rb#7834
+# source://prism/lib/prism/node.rb#7834
 class Prism::ImplicitRestNode < ::Prism::Node
   # Initialize a new ImplicitRestNode node.
   #
   # @return [ImplicitRestNode] a new instance of ImplicitRestNode
   #
-  # source://prism//lib/prism/node.rb#7836
+  # source://prism/lib/prism/node.rb#7836
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
   def initialize(source, node_id, location, flags); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#7893
+  # source://prism/lib/prism/node.rb#7893
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#7844
+  # source://prism/lib/prism/node.rb#7844
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#7849
+  # source://prism/lib/prism/node.rb#7849
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#7859
+  # source://prism/lib/prism/node.rb#7859
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#7854
+  # source://prism/lib/prism/node.rb#7854
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> ImplicitRestNode
   #
-  # source://prism//lib/prism/node.rb#7864
+  # source://prism/lib/prism/node.rb#7864
   sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::ImplicitRestNode) }
   def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end
 
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#7849
+  # source://prism/lib/prism/node.rb#7849
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
   #
-  # source://prism//lib/prism/node.rb#7872
+  # source://prism/lib/prism/node.rb#7872
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -17152,20 +17152,20 @@ class Prism::ImplicitRestNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#7877
+  # source://prism/lib/prism/node.rb#7877
   sig { override.returns(String) }
   def inspect; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#7882
+  # source://prism/lib/prism/node.rb#7882
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#7887
+    # source://prism/lib/prism/node.rb#7887
     def type; end
   end
 end
@@ -17175,13 +17175,13 @@ end
 #     case a; in b then c end
 #             ^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#7902
+# source://prism/lib/prism/node.rb#7902
 class Prism::InNode < ::Prism::Node
   # Initialize a new InNode node.
   #
   # @return [InNode] a new instance of InNode
   #
-  # source://prism//lib/prism/node.rb#7904
+  # source://prism/lib/prism/node.rb#7904
   sig do
     params(
       source: Prism::Source,
@@ -17199,36 +17199,36 @@ class Prism::InNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#8004
+  # source://prism/lib/prism/node.rb#8004
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#7916
+  # source://prism/lib/prism/node.rb#7916
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#7921
+  # source://prism/lib/prism/node.rb#7921
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#7934
+  # source://prism/lib/prism/node.rb#7934
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#7926
+  # source://prism/lib/prism/node.rb#7926
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?pattern: Prism::node, ?statements: StatementsNode?, ?in_loc: Location, ?then_loc: Location?) -> InNode
   #
-  # source://prism//lib/prism/node.rb#7939
+  # source://prism/lib/prism/node.rb#7939
   sig do
     params(
       node_id: Integer,
@@ -17245,13 +17245,13 @@ class Prism::InNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#7921
+  # source://prism/lib/prism/node.rb#7921
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, pattern: Prism::node, statements: StatementsNode?, in_loc: Location, then_loc: Location? }
   #
-  # source://prism//lib/prism/node.rb#7947
+  # source://prism/lib/prism/node.rb#7947
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -17260,56 +17260,56 @@ class Prism::InNode < ::Prism::Node
 
   # def in: () -> String
   #
-  # source://prism//lib/prism/node.rb#7978
+  # source://prism/lib/prism/node.rb#7978
   sig { returns(String) }
   def in; end
 
   # attr_reader in_loc: Location
   #
-  # source://prism//lib/prism/node.rb#7958
+  # source://prism/lib/prism/node.rb#7958
   sig { returns(Prism::Location) }
   def in_loc; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#7988
+  # source://prism/lib/prism/node.rb#7988
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader pattern: Prism::node
   #
-  # source://prism//lib/prism/node.rb#7952
+  # source://prism/lib/prism/node.rb#7952
   sig { returns(Prism::Node) }
   def pattern; end
 
   # attr_reader statements: StatementsNode?
   #
-  # source://prism//lib/prism/node.rb#7955
+  # source://prism/lib/prism/node.rb#7955
   sig { returns(T.nilable(Prism::StatementsNode)) }
   def statements; end
 
   # def then: () -> String?
   #
-  # source://prism//lib/prism/node.rb#7983
+  # source://prism/lib/prism/node.rb#7983
   sig { returns(T.nilable(String)) }
   def then; end
 
   # attr_reader then_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#7965
+  # source://prism/lib/prism/node.rb#7965
   sig { returns(T.nilable(Prism::Location)) }
   def then_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#7993
+  # source://prism/lib/prism/node.rb#7993
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#7998
+    # source://prism/lib/prism/node.rb#7998
     def type; end
   end
 end
@@ -17319,13 +17319,13 @@ end
 #     foo.bar[baz] &&= value
 #     ^^^^^^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#8017
+# source://prism/lib/prism/node.rb#8017
 class Prism::IndexAndWriteNode < ::Prism::Node
   # Initialize a new IndexAndWriteNode node.
   #
   # @return [IndexAndWriteNode] a new instance of IndexAndWriteNode
   #
-  # source://prism//lib/prism/node.rb#8019
+  # source://prism/lib/prism/node.rb#8019
   sig do
     params(
       source: Prism::Source,
@@ -17347,18 +17347,18 @@ class Prism::IndexAndWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#8175
+  # source://prism/lib/prism/node.rb#8175
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#8035
+  # source://prism/lib/prism/node.rb#8035
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader arguments: ArgumentsNode?
   #
-  # source://prism//lib/prism/node.rb#8116
+  # source://prism/lib/prism/node.rb#8116
   sig { returns(T.nilable(Prism::ArgumentsNode)) }
   def arguments; end
 
@@ -17366,61 +17366,61 @@ class Prism::IndexAndWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#8083
+  # source://prism/lib/prism/node.rb#8083
   sig { returns(T::Boolean) }
   def attribute_write?; end
 
   # attr_reader block: BlockArgumentNode?
   #
-  # source://prism//lib/prism/node.rb#8126
+  # source://prism/lib/prism/node.rb#8126
   sig { returns(T.nilable(Prism::BlockArgumentNode)) }
   def block; end
 
   # def call_operator: () -> String?
   #
-  # source://prism//lib/prism/node.rb#8139
+  # source://prism/lib/prism/node.rb#8139
   sig { returns(T.nilable(String)) }
   def call_operator; end
 
   # attr_reader call_operator_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#8096
+  # source://prism/lib/prism/node.rb#8096
   sig { returns(T.nilable(Prism::Location)) }
   def call_operator_loc; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#8040
+  # source://prism/lib/prism/node.rb#8040
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String
   #
-  # source://prism//lib/prism/node.rb#8149
+  # source://prism/lib/prism/node.rb#8149
   sig { returns(String) }
   def closing; end
 
   # attr_reader closing_loc: Location
   #
-  # source://prism//lib/prism/node.rb#8119
+  # source://prism/lib/prism/node.rb#8119
   sig { returns(Prism::Location) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#8055
+  # source://prism/lib/prism/node.rb#8055
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#8045
+  # source://prism/lib/prism/node.rb#8045
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: BlockArgumentNode?, ?operator_loc: Location, ?value: Prism::node) -> IndexAndWriteNode
   #
-  # source://prism//lib/prism/node.rb#8060
+  # source://prism/lib/prism/node.rb#8060
   sig do
     params(
       node_id: Integer,
@@ -17441,13 +17441,13 @@ class Prism::IndexAndWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#8040
+  # source://prism/lib/prism/node.rb#8040
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: BlockArgumentNode?, operator_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#8068
+  # source://prism/lib/prism/node.rb#8068
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -17458,43 +17458,43 @@ class Prism::IndexAndWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#8088
+  # source://prism/lib/prism/node.rb#8088
   sig { returns(T::Boolean) }
   def ignore_visibility?; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#8159
+  # source://prism/lib/prism/node.rb#8159
   sig { override.returns(String) }
   def inspect; end
 
   # def opening: () -> String
   #
-  # source://prism//lib/prism/node.rb#8144
+  # source://prism/lib/prism/node.rb#8144
   sig { returns(String) }
   def opening; end
 
   # attr_reader opening_loc: Location
   #
-  # source://prism//lib/prism/node.rb#8109
+  # source://prism/lib/prism/node.rb#8109
   sig { returns(Prism::Location) }
   def opening_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#8154
+  # source://prism/lib/prism/node.rb#8154
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#8129
+  # source://prism/lib/prism/node.rb#8129
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # attr_reader receiver: Prism::node?
   #
-  # source://prism//lib/prism/node.rb#8093
+  # source://prism/lib/prism/node.rb#8093
   sig { returns(T.nilable(Prism::Node)) }
   def receiver; end
 
@@ -17502,19 +17502,19 @@ class Prism::IndexAndWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#8073
+  # source://prism/lib/prism/node.rb#8073
   sig { returns(T::Boolean) }
   def safe_navigation?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#8164
+  # source://prism/lib/prism/node.rb#8164
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#8136
+  # source://prism/lib/prism/node.rb#8136
   sig { returns(Prism::Node) }
   def value; end
 
@@ -17522,14 +17522,14 @@ class Prism::IndexAndWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#8078
+  # source://prism/lib/prism/node.rb#8078
   sig { returns(T::Boolean) }
   def variable_call?; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#8169
+    # source://prism/lib/prism/node.rb#8169
     def type; end
   end
 end
@@ -17539,13 +17539,13 @@ end
 #     foo.bar[baz] += value
 #     ^^^^^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#8193
+# source://prism/lib/prism/node.rb#8193
 class Prism::IndexOperatorWriteNode < ::Prism::Node
   # Initialize a new IndexOperatorWriteNode node.
   #
   # @return [IndexOperatorWriteNode] a new instance of IndexOperatorWriteNode
   #
-  # source://prism//lib/prism/node.rb#8195
+  # source://prism/lib/prism/node.rb#8195
   sig do
     params(
       source: Prism::Source,
@@ -17568,18 +17568,18 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#8350
+  # source://prism/lib/prism/node.rb#8350
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#8212
+  # source://prism/lib/prism/node.rb#8212
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader arguments: ArgumentsNode?
   #
-  # source://prism//lib/prism/node.rb#8293
+  # source://prism/lib/prism/node.rb#8293
   sig { returns(T.nilable(Prism::ArgumentsNode)) }
   def arguments; end
 
@@ -17587,73 +17587,73 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#8260
+  # source://prism/lib/prism/node.rb#8260
   sig { returns(T::Boolean) }
   def attribute_write?; end
 
   # attr_reader binary_operator: Symbol
   #
-  # source://prism//lib/prism/node.rb#8306
+  # source://prism/lib/prism/node.rb#8306
   sig { returns(Symbol) }
   def binary_operator; end
 
   # attr_reader binary_operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#8309
+  # source://prism/lib/prism/node.rb#8309
   sig { returns(Prism::Location) }
   def binary_operator_loc; end
 
   # attr_reader block: BlockArgumentNode?
   #
-  # source://prism//lib/prism/node.rb#8303
+  # source://prism/lib/prism/node.rb#8303
   sig { returns(T.nilable(Prism::BlockArgumentNode)) }
   def block; end
 
   # def call_operator: () -> String?
   #
-  # source://prism//lib/prism/node.rb#8319
+  # source://prism/lib/prism/node.rb#8319
   sig { returns(T.nilable(String)) }
   def call_operator; end
 
   # attr_reader call_operator_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#8273
+  # source://prism/lib/prism/node.rb#8273
   sig { returns(T.nilable(Prism::Location)) }
   def call_operator_loc; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#8217
+  # source://prism/lib/prism/node.rb#8217
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String
   #
-  # source://prism//lib/prism/node.rb#8329
+  # source://prism/lib/prism/node.rb#8329
   sig { returns(String) }
   def closing; end
 
   # attr_reader closing_loc: Location
   #
-  # source://prism//lib/prism/node.rb#8296
+  # source://prism/lib/prism/node.rb#8296
   sig { returns(Prism::Location) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#8232
+  # source://prism/lib/prism/node.rb#8232
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#8222
+  # source://prism/lib/prism/node.rb#8222
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: BlockArgumentNode?, ?binary_operator: Symbol, ?binary_operator_loc: Location, ?value: Prism::node) -> IndexOperatorWriteNode
   #
-  # source://prism//lib/prism/node.rb#8237
+  # source://prism/lib/prism/node.rb#8237
   sig do
     params(
       node_id: Integer,
@@ -17675,13 +17675,13 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#8217
+  # source://prism/lib/prism/node.rb#8217
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: BlockArgumentNode?, binary_operator: Symbol, binary_operator_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#8245
+  # source://prism/lib/prism/node.rb#8245
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -17692,43 +17692,43 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#8265
+  # source://prism/lib/prism/node.rb#8265
   sig { returns(T::Boolean) }
   def ignore_visibility?; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#8334
+  # source://prism/lib/prism/node.rb#8334
   sig { override.returns(String) }
   def inspect; end
 
   # def opening: () -> String
   #
-  # source://prism//lib/prism/node.rb#8324
+  # source://prism/lib/prism/node.rb#8324
   sig { returns(String) }
   def opening; end
 
   # attr_reader opening_loc: Location
   #
-  # source://prism//lib/prism/node.rb#8286
+  # source://prism/lib/prism/node.rb#8286
   sig { returns(Prism::Location) }
   def opening_loc; end
 
   # Returns the binary operator used to modify the receiver. This method is
   # deprecated in favor of #binary_operator.
   #
-  # source://prism//lib/prism/node_ext.rb#419
+  # source://prism/lib/prism/node_ext.rb#419
   def operator; end
 
   # Returns the location of the binary operator used to modify the receiver.
   # This method is deprecated in favor of #binary_operator_loc.
   #
-  # source://prism//lib/prism/node_ext.rb#426
+  # source://prism/lib/prism/node_ext.rb#426
   def operator_loc; end
 
   # attr_reader receiver: Prism::node?
   #
-  # source://prism//lib/prism/node.rb#8270
+  # source://prism/lib/prism/node.rb#8270
   sig { returns(T.nilable(Prism::Node)) }
   def receiver; end
 
@@ -17736,19 +17736,19 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#8250
+  # source://prism/lib/prism/node.rb#8250
   sig { returns(T::Boolean) }
   def safe_navigation?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#8339
+  # source://prism/lib/prism/node.rb#8339
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#8316
+  # source://prism/lib/prism/node.rb#8316
   sig { returns(Prism::Node) }
   def value; end
 
@@ -17756,14 +17756,14 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#8255
+  # source://prism/lib/prism/node.rb#8255
   sig { returns(T::Boolean) }
   def variable_call?; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#8344
+    # source://prism/lib/prism/node.rb#8344
     def type; end
   end
 end
@@ -17773,13 +17773,13 @@ end
 #     foo.bar[baz] ||= value
 #     ^^^^^^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#8369
+# source://prism/lib/prism/node.rb#8369
 class Prism::IndexOrWriteNode < ::Prism::Node
   # Initialize a new IndexOrWriteNode node.
   #
   # @return [IndexOrWriteNode] a new instance of IndexOrWriteNode
   #
-  # source://prism//lib/prism/node.rb#8371
+  # source://prism/lib/prism/node.rb#8371
   sig do
     params(
       source: Prism::Source,
@@ -17801,18 +17801,18 @@ class Prism::IndexOrWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#8527
+  # source://prism/lib/prism/node.rb#8527
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#8387
+  # source://prism/lib/prism/node.rb#8387
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader arguments: ArgumentsNode?
   #
-  # source://prism//lib/prism/node.rb#8468
+  # source://prism/lib/prism/node.rb#8468
   sig { returns(T.nilable(Prism::ArgumentsNode)) }
   def arguments; end
 
@@ -17820,61 +17820,61 @@ class Prism::IndexOrWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#8435
+  # source://prism/lib/prism/node.rb#8435
   sig { returns(T::Boolean) }
   def attribute_write?; end
 
   # attr_reader block: BlockArgumentNode?
   #
-  # source://prism//lib/prism/node.rb#8478
+  # source://prism/lib/prism/node.rb#8478
   sig { returns(T.nilable(Prism::BlockArgumentNode)) }
   def block; end
 
   # def call_operator: () -> String?
   #
-  # source://prism//lib/prism/node.rb#8491
+  # source://prism/lib/prism/node.rb#8491
   sig { returns(T.nilable(String)) }
   def call_operator; end
 
   # attr_reader call_operator_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#8448
+  # source://prism/lib/prism/node.rb#8448
   sig { returns(T.nilable(Prism::Location)) }
   def call_operator_loc; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#8392
+  # source://prism/lib/prism/node.rb#8392
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String
   #
-  # source://prism//lib/prism/node.rb#8501
+  # source://prism/lib/prism/node.rb#8501
   sig { returns(String) }
   def closing; end
 
   # attr_reader closing_loc: Location
   #
-  # source://prism//lib/prism/node.rb#8471
+  # source://prism/lib/prism/node.rb#8471
   sig { returns(Prism::Location) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#8407
+  # source://prism/lib/prism/node.rb#8407
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#8397
+  # source://prism/lib/prism/node.rb#8397
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: BlockArgumentNode?, ?operator_loc: Location, ?value: Prism::node) -> IndexOrWriteNode
   #
-  # source://prism//lib/prism/node.rb#8412
+  # source://prism/lib/prism/node.rb#8412
   sig do
     params(
       node_id: Integer,
@@ -17895,13 +17895,13 @@ class Prism::IndexOrWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#8392
+  # source://prism/lib/prism/node.rb#8392
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: BlockArgumentNode?, operator_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#8420
+  # source://prism/lib/prism/node.rb#8420
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -17912,43 +17912,43 @@ class Prism::IndexOrWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#8440
+  # source://prism/lib/prism/node.rb#8440
   sig { returns(T::Boolean) }
   def ignore_visibility?; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#8511
+  # source://prism/lib/prism/node.rb#8511
   sig { override.returns(String) }
   def inspect; end
 
   # def opening: () -> String
   #
-  # source://prism//lib/prism/node.rb#8496
+  # source://prism/lib/prism/node.rb#8496
   sig { returns(String) }
   def opening; end
 
   # attr_reader opening_loc: Location
   #
-  # source://prism//lib/prism/node.rb#8461
+  # source://prism/lib/prism/node.rb#8461
   sig { returns(Prism::Location) }
   def opening_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#8506
+  # source://prism/lib/prism/node.rb#8506
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#8481
+  # source://prism/lib/prism/node.rb#8481
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # attr_reader receiver: Prism::node?
   #
-  # source://prism//lib/prism/node.rb#8445
+  # source://prism/lib/prism/node.rb#8445
   sig { returns(T.nilable(Prism::Node)) }
   def receiver; end
 
@@ -17956,19 +17956,19 @@ class Prism::IndexOrWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#8425
+  # source://prism/lib/prism/node.rb#8425
   sig { returns(T::Boolean) }
   def safe_navigation?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#8516
+  # source://prism/lib/prism/node.rb#8516
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#8488
+  # source://prism/lib/prism/node.rb#8488
   sig { returns(Prism::Node) }
   def value; end
 
@@ -17976,14 +17976,14 @@ class Prism::IndexOrWriteNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#8430
+  # source://prism/lib/prism/node.rb#8430
   sig { returns(T::Boolean) }
   def variable_call?; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#8521
+    # source://prism/lib/prism/node.rb#8521
     def type; end
   end
 end
@@ -18001,13 +18001,13 @@ end
 #     for foo[bar] in baz do end
 #         ^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#8553
+# source://prism/lib/prism/node.rb#8553
 class Prism::IndexTargetNode < ::Prism::Node
   # Initialize a new IndexTargetNode node.
   #
   # @return [IndexTargetNode] a new instance of IndexTargetNode
   #
-  # source://prism//lib/prism/node.rb#8555
+  # source://prism/lib/prism/node.rb#8555
   sig do
     params(
       source: Prism::Source,
@@ -18026,18 +18026,18 @@ class Prism::IndexTargetNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#8674
+  # source://prism/lib/prism/node.rb#8674
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#8568
+  # source://prism/lib/prism/node.rb#8568
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader arguments: ArgumentsNode?
   #
-  # source://prism//lib/prism/node.rb#8635
+  # source://prism/lib/prism/node.rb#8635
   sig { returns(T.nilable(Prism::ArgumentsNode)) }
   def arguments; end
 
@@ -18045,49 +18045,49 @@ class Prism::IndexTargetNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#8615
+  # source://prism/lib/prism/node.rb#8615
   sig { returns(T::Boolean) }
   def attribute_write?; end
 
   # attr_reader block: BlockArgumentNode?
   #
-  # source://prism//lib/prism/node.rb#8645
+  # source://prism/lib/prism/node.rb#8645
   sig { returns(T.nilable(Prism::BlockArgumentNode)) }
   def block; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#8573
+  # source://prism/lib/prism/node.rb#8573
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String
   #
-  # source://prism//lib/prism/node.rb#8653
+  # source://prism/lib/prism/node.rb#8653
   sig { returns(String) }
   def closing; end
 
   # attr_reader closing_loc: Location
   #
-  # source://prism//lib/prism/node.rb#8638
+  # source://prism/lib/prism/node.rb#8638
   sig { returns(Prism::Location) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#8587
+  # source://prism/lib/prism/node.rb#8587
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#8578
+  # source://prism/lib/prism/node.rb#8578
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: BlockArgumentNode?) -> IndexTargetNode
   #
-  # source://prism//lib/prism/node.rb#8592
+  # source://prism/lib/prism/node.rb#8592
   sig do
     params(
       node_id: Integer,
@@ -18105,13 +18105,13 @@ class Prism::IndexTargetNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#8573
+  # source://prism/lib/prism/node.rb#8573
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: BlockArgumentNode? }
   #
-  # source://prism//lib/prism/node.rb#8600
+  # source://prism/lib/prism/node.rb#8600
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -18122,31 +18122,31 @@ class Prism::IndexTargetNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#8620
+  # source://prism/lib/prism/node.rb#8620
   sig { returns(T::Boolean) }
   def ignore_visibility?; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#8658
+  # source://prism/lib/prism/node.rb#8658
   sig { override.returns(String) }
   def inspect; end
 
   # def opening: () -> String
   #
-  # source://prism//lib/prism/node.rb#8648
+  # source://prism/lib/prism/node.rb#8648
   sig { returns(String) }
   def opening; end
 
   # attr_reader opening_loc: Location
   #
-  # source://prism//lib/prism/node.rb#8628
+  # source://prism/lib/prism/node.rb#8628
   sig { returns(Prism::Location) }
   def opening_loc; end
 
   # attr_reader receiver: Prism::node
   #
-  # source://prism//lib/prism/node.rb#8625
+  # source://prism/lib/prism/node.rb#8625
   sig { returns(Prism::Node) }
   def receiver; end
 
@@ -18154,13 +18154,13 @@ class Prism::IndexTargetNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#8605
+  # source://prism/lib/prism/node.rb#8605
   sig { returns(T::Boolean) }
   def safe_navigation?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#8663
+  # source://prism/lib/prism/node.rb#8663
   sig { override.returns(Symbol) }
   def type; end
 
@@ -18168,14 +18168,14 @@ class Prism::IndexTargetNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#8610
+  # source://prism/lib/prism/node.rb#8610
   sig { returns(T::Boolean) }
   def variable_call?; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#8668
+    # source://prism/lib/prism/node.rb#8668
     def type; end
   end
 end
@@ -18183,11 +18183,11 @@ end
 # InlineComment objects are the most common. They correspond to comments in
 # the source file like this one that start with #.
 #
-# source://prism//lib/prism/parse_result.rb#529
+# source://prism/lib/prism/parse_result.rb#529
 class Prism::InlineComment < ::Prism::Comment
   # Returns a string representation of this comment.
   #
-  # source://prism//lib/prism/parse_result.rb#537
+  # source://prism/lib/prism/parse_result.rb#537
   sig { returns(String) }
   def inspect; end
 
@@ -18196,7 +18196,7 @@ class Prism::InlineComment < ::Prism::Comment
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/parse_result.rb#532
+  # source://prism/lib/prism/parse_result.rb#532
   sig { override.returns(T::Boolean) }
   def trailing?; end
 end
@@ -18204,804 +18204,804 @@ end
 # This visitor is responsible for composing the strings that get returned by
 # the various #inspect methods defined on each of the nodes.
 #
-# source://prism//lib/prism/inspect_visitor.rb#12
+# source://prism/lib/prism/inspect_visitor.rb#12
 class Prism::InspectVisitor < ::Prism::Visitor
   # Initializes a new instance of the InspectVisitor.
   #
   # @return [InspectVisitor] a new instance of InspectVisitor
   #
-  # source://prism//lib/prism/inspect_visitor.rb#35
+  # source://prism/lib/prism/inspect_visitor.rb#35
   sig { params(indent: String).void }
   def initialize(indent = T.unsafe(nil)); end
 
   # The list of commands that we need to execute in order to compose the
   # final string.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#32
+  # source://prism/lib/prism/inspect_visitor.rb#32
   def commands; end
 
   # Compose the final string.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#48
+  # source://prism/lib/prism/inspect_visitor.rb#48
   sig { returns(String) }
   def compose; end
 
   # The current prefix string.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#28
+  # source://prism/lib/prism/inspect_visitor.rb#28
   def indent; end
 
   # Inspect a AliasGlobalVariableNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#77
+  # source://prism/lib/prism/inspect_visitor.rb#77
   def visit_alias_global_variable_node(node); end
 
   # Inspect a AliasMethodNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#89
+  # source://prism/lib/prism/inspect_visitor.rb#89
   def visit_alias_method_node(node); end
 
   # Inspect a AlternationPatternNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#101
+  # source://prism/lib/prism/inspect_visitor.rb#101
   def visit_alternation_pattern_node(node); end
 
   # Inspect a AndNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#113
+  # source://prism/lib/prism/inspect_visitor.rb#113
   def visit_and_node(node); end
 
   # Inspect a ArgumentsNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#125
+  # source://prism/lib/prism/inspect_visitor.rb#125
   def visit_arguments_node(node); end
 
   # Inspect a ArrayNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#141
+  # source://prism/lib/prism/inspect_visitor.rb#141
   def visit_array_node(node); end
 
   # Inspect a ArrayPatternNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#159
+  # source://prism/lib/prism/inspect_visitor.rb#159
   def visit_array_pattern_node(node); end
 
   # Inspect a AssocNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#198
+  # source://prism/lib/prism/inspect_visitor.rb#198
   def visit_assoc_node(node); end
 
   # Inspect a AssocSplatNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#210
+  # source://prism/lib/prism/inspect_visitor.rb#210
   def visit_assoc_splat_node(node); end
 
   # Inspect a BackReferenceReadNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#224
+  # source://prism/lib/prism/inspect_visitor.rb#224
   def visit_back_reference_read_node(node); end
 
   # Inspect a BeginNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#232
+  # source://prism/lib/prism/inspect_visitor.rb#232
   def visit_begin_node(node); end
 
   # Inspect a BlockArgumentNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#265
+  # source://prism/lib/prism/inspect_visitor.rb#265
   def visit_block_argument_node(node); end
 
   # Inspect a BlockLocalVariableNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#279
+  # source://prism/lib/prism/inspect_visitor.rb#279
   def visit_block_local_variable_node(node); end
 
   # Inspect a BlockNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#287
+  # source://prism/lib/prism/inspect_visitor.rb#287
   def visit_block_node(node); end
 
   # Inspect a BlockParameterNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#309
+  # source://prism/lib/prism/inspect_visitor.rb#309
   def visit_block_parameter_node(node); end
 
   # Inspect a BlockParametersNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#323
+  # source://prism/lib/prism/inspect_visitor.rb#323
   def visit_block_parameters_node(node); end
 
   # Inspect a BreakNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#347
+  # source://prism/lib/prism/inspect_visitor.rb#347
   def visit_break_node(node); end
 
   # Inspect a CallAndWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#361
+  # source://prism/lib/prism/inspect_visitor.rb#361
   def visit_call_and_write_node(node); end
 
   # Inspect a CallNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#381
+  # source://prism/lib/prism/inspect_visitor.rb#381
   def visit_call_node(node); end
 
   # Inspect a CallOperatorWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#411
+  # source://prism/lib/prism/inspect_visitor.rb#411
   def visit_call_operator_write_node(node); end
 
   # Inspect a CallOrWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#432
+  # source://prism/lib/prism/inspect_visitor.rb#432
   def visit_call_or_write_node(node); end
 
   # Inspect a CallTargetNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#452
+  # source://prism/lib/prism/inspect_visitor.rb#452
   def visit_call_target_node(node); end
 
   # Inspect a CapturePatternNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#464
+  # source://prism/lib/prism/inspect_visitor.rb#464
   def visit_capture_pattern_node(node); end
 
   # Inspect a CaseMatchNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#476
+  # source://prism/lib/prism/inspect_visitor.rb#476
   def visit_case_match_node(node); end
 
   # Inspect a CaseNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#506
+  # source://prism/lib/prism/inspect_visitor.rb#506
   def visit_case_node(node); end
 
   # Inspect a ClassNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#536
+  # source://prism/lib/prism/inspect_visitor.rb#536
   def visit_class_node(node); end
 
   # Inspect a ClassVariableAndWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#562
+  # source://prism/lib/prism/inspect_visitor.rb#562
   def visit_class_variable_and_write_node(node); end
 
   # Inspect a ClassVariableOperatorWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#574
+  # source://prism/lib/prism/inspect_visitor.rb#574
   def visit_class_variable_operator_write_node(node); end
 
   # Inspect a ClassVariableOrWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#587
+  # source://prism/lib/prism/inspect_visitor.rb#587
   def visit_class_variable_or_write_node(node); end
 
   # Inspect a ClassVariableReadNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#599
+  # source://prism/lib/prism/inspect_visitor.rb#599
   def visit_class_variable_read_node(node); end
 
   # Inspect a ClassVariableTargetNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#607
+  # source://prism/lib/prism/inspect_visitor.rb#607
   def visit_class_variable_target_node(node); end
 
   # Inspect a ClassVariableWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#615
+  # source://prism/lib/prism/inspect_visitor.rb#615
   def visit_class_variable_write_node(node); end
 
   # Inspect a ConstantAndWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#627
+  # source://prism/lib/prism/inspect_visitor.rb#627
   def visit_constant_and_write_node(node); end
 
   # Inspect a ConstantOperatorWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#639
+  # source://prism/lib/prism/inspect_visitor.rb#639
   def visit_constant_operator_write_node(node); end
 
   # Inspect a ConstantOrWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#652
+  # source://prism/lib/prism/inspect_visitor.rb#652
   def visit_constant_or_write_node(node); end
 
   # Inspect a ConstantPathAndWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#664
+  # source://prism/lib/prism/inspect_visitor.rb#664
   def visit_constant_path_and_write_node(node); end
 
   # Inspect a ConstantPathNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#676
+  # source://prism/lib/prism/inspect_visitor.rb#676
   def visit_constant_path_node(node); end
 
   # Inspect a ConstantPathOperatorWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#696
+  # source://prism/lib/prism/inspect_visitor.rb#696
   def visit_constant_path_operator_write_node(node); end
 
   # Inspect a ConstantPathOrWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#709
+  # source://prism/lib/prism/inspect_visitor.rb#709
   def visit_constant_path_or_write_node(node); end
 
   # Inspect a ConstantPathTargetNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#721
+  # source://prism/lib/prism/inspect_visitor.rb#721
   def visit_constant_path_target_node(node); end
 
   # Inspect a ConstantPathWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#741
+  # source://prism/lib/prism/inspect_visitor.rb#741
   def visit_constant_path_write_node(node); end
 
   # Inspect a ConstantReadNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#753
+  # source://prism/lib/prism/inspect_visitor.rb#753
   def visit_constant_read_node(node); end
 
   # Inspect a ConstantTargetNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#761
+  # source://prism/lib/prism/inspect_visitor.rb#761
   def visit_constant_target_node(node); end
 
   # Inspect a ConstantWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#769
+  # source://prism/lib/prism/inspect_visitor.rb#769
   def visit_constant_write_node(node); end
 
   # Inspect a DefNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#781
+  # source://prism/lib/prism/inspect_visitor.rb#781
   def visit_def_node(node); end
 
   # Inspect a DefinedNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#815
+  # source://prism/lib/prism/inspect_visitor.rb#815
   def visit_defined_node(node); end
 
   # Inspect a ElseNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#827
+  # source://prism/lib/prism/inspect_visitor.rb#827
   def visit_else_node(node); end
 
   # Inspect a EmbeddedStatementsNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#842
+  # source://prism/lib/prism/inspect_visitor.rb#842
   def visit_embedded_statements_node(node); end
 
   # Inspect a EmbeddedVariableNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#857
+  # source://prism/lib/prism/inspect_visitor.rb#857
   def visit_embedded_variable_node(node); end
 
   # Inspect a EnsureNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#867
+  # source://prism/lib/prism/inspect_visitor.rb#867
   def visit_ensure_node(node); end
 
   # Inspect a FalseNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#882
+  # source://prism/lib/prism/inspect_visitor.rb#882
   def visit_false_node(node); end
 
   # Inspect a FindPatternNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#889
+  # source://prism/lib/prism/inspect_visitor.rb#889
   def visit_find_pattern_node(node); end
 
   # Inspect a FlipFlopNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#917
+  # source://prism/lib/prism/inspect_visitor.rb#917
   def visit_flip_flop_node(node); end
 
   # Inspect a FloatNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#937
+  # source://prism/lib/prism/inspect_visitor.rb#937
   def visit_float_node(node); end
 
   # Inspect a ForNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#945
+  # source://prism/lib/prism/inspect_visitor.rb#945
   def visit_for_node(node); end
 
   # Inspect a ForwardingArgumentsNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#966
+  # source://prism/lib/prism/inspect_visitor.rb#966
   def visit_forwarding_arguments_node(node); end
 
   # Inspect a ForwardingParameterNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#973
+  # source://prism/lib/prism/inspect_visitor.rb#973
   def visit_forwarding_parameter_node(node); end
 
   # Inspect a ForwardingSuperNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#980
+  # source://prism/lib/prism/inspect_visitor.rb#980
   def visit_forwarding_super_node(node); end
 
   # Inspect a GlobalVariableAndWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#993
+  # source://prism/lib/prism/inspect_visitor.rb#993
   def visit_global_variable_and_write_node(node); end
 
   # Inspect a GlobalVariableOperatorWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1005
+  # source://prism/lib/prism/inspect_visitor.rb#1005
   def visit_global_variable_operator_write_node(node); end
 
   # Inspect a GlobalVariableOrWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1018
+  # source://prism/lib/prism/inspect_visitor.rb#1018
   def visit_global_variable_or_write_node(node); end
 
   # Inspect a GlobalVariableReadNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1030
+  # source://prism/lib/prism/inspect_visitor.rb#1030
   def visit_global_variable_read_node(node); end
 
   # Inspect a GlobalVariableTargetNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1038
+  # source://prism/lib/prism/inspect_visitor.rb#1038
   def visit_global_variable_target_node(node); end
 
   # Inspect a GlobalVariableWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1046
+  # source://prism/lib/prism/inspect_visitor.rb#1046
   def visit_global_variable_write_node(node); end
 
   # Inspect a HashNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1058
+  # source://prism/lib/prism/inspect_visitor.rb#1058
   def visit_hash_node(node); end
 
   # Inspect a HashPatternNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1076
+  # source://prism/lib/prism/inspect_visitor.rb#1076
   def visit_hash_pattern_node(node); end
 
   # Inspect a IfNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1106
+  # source://prism/lib/prism/inspect_visitor.rb#1106
   def visit_if_node(node); end
 
   # Inspect a ImaginaryNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1130
+  # source://prism/lib/prism/inspect_visitor.rb#1130
   def visit_imaginary_node(node); end
 
   # Inspect a ImplicitNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1139
+  # source://prism/lib/prism/inspect_visitor.rb#1139
   def visit_implicit_node(node); end
 
   # Inspect a ImplicitRestNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1148
+  # source://prism/lib/prism/inspect_visitor.rb#1148
   def visit_implicit_rest_node(node); end
 
   # Inspect a InNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1155
+  # source://prism/lib/prism/inspect_visitor.rb#1155
   def visit_in_node(node); end
 
   # Inspect a IndexAndWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1172
+  # source://prism/lib/prism/inspect_visitor.rb#1172
   def visit_index_and_write_node(node); end
 
   # Inspect a IndexOperatorWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1203
+  # source://prism/lib/prism/inspect_visitor.rb#1203
   def visit_index_operator_write_node(node); end
 
   # Inspect a IndexOrWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1235
+  # source://prism/lib/prism/inspect_visitor.rb#1235
   def visit_index_or_write_node(node); end
 
   # Inspect a IndexTargetNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1266
+  # source://prism/lib/prism/inspect_visitor.rb#1266
   def visit_index_target_node(node); end
 
   # Inspect a InstanceVariableAndWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1289
+  # source://prism/lib/prism/inspect_visitor.rb#1289
   def visit_instance_variable_and_write_node(node); end
 
   # Inspect a InstanceVariableOperatorWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1301
+  # source://prism/lib/prism/inspect_visitor.rb#1301
   def visit_instance_variable_operator_write_node(node); end
 
   # Inspect a InstanceVariableOrWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1314
+  # source://prism/lib/prism/inspect_visitor.rb#1314
   def visit_instance_variable_or_write_node(node); end
 
   # Inspect a InstanceVariableReadNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1326
+  # source://prism/lib/prism/inspect_visitor.rb#1326
   def visit_instance_variable_read_node(node); end
 
   # Inspect a InstanceVariableTargetNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1334
+  # source://prism/lib/prism/inspect_visitor.rb#1334
   def visit_instance_variable_target_node(node); end
 
   # Inspect a InstanceVariableWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1342
+  # source://prism/lib/prism/inspect_visitor.rb#1342
   def visit_instance_variable_write_node(node); end
 
   # Inspect a IntegerNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1354
+  # source://prism/lib/prism/inspect_visitor.rb#1354
   def visit_integer_node(node); end
 
   # Inspect a InterpolatedMatchLastLineNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1362
+  # source://prism/lib/prism/inspect_visitor.rb#1362
   def visit_interpolated_match_last_line_node(node); end
 
   # Inspect a InterpolatedRegularExpressionNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1380
+  # source://prism/lib/prism/inspect_visitor.rb#1380
   def visit_interpolated_regular_expression_node(node); end
 
   # Inspect a InterpolatedStringNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1398
+  # source://prism/lib/prism/inspect_visitor.rb#1398
   def visit_interpolated_string_node(node); end
 
   # Inspect a InterpolatedSymbolNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1416
+  # source://prism/lib/prism/inspect_visitor.rb#1416
   def visit_interpolated_symbol_node(node); end
 
   # Inspect a InterpolatedXStringNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1434
+  # source://prism/lib/prism/inspect_visitor.rb#1434
   def visit_interpolated_x_string_node(node); end
 
   # Inspect a ItLocalVariableReadNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1452
+  # source://prism/lib/prism/inspect_visitor.rb#1452
   def visit_it_local_variable_read_node(node); end
 
   # Inspect a ItParametersNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1459
+  # source://prism/lib/prism/inspect_visitor.rb#1459
   def visit_it_parameters_node(node); end
 
   # Inspect a KeywordHashNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1466
+  # source://prism/lib/prism/inspect_visitor.rb#1466
   def visit_keyword_hash_node(node); end
 
   # Inspect a KeywordRestParameterNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1482
+  # source://prism/lib/prism/inspect_visitor.rb#1482
   def visit_keyword_rest_parameter_node(node); end
 
   # Inspect a LambdaNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1496
+  # source://prism/lib/prism/inspect_visitor.rb#1496
   def visit_lambda_node(node); end
 
   # Inspect a LocalVariableAndWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1519
+  # source://prism/lib/prism/inspect_visitor.rb#1519
   def visit_local_variable_and_write_node(node); end
 
   # Inspect a LocalVariableOperatorWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1532
+  # source://prism/lib/prism/inspect_visitor.rb#1532
   def visit_local_variable_operator_write_node(node); end
 
   # Inspect a LocalVariableOrWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1546
+  # source://prism/lib/prism/inspect_visitor.rb#1546
   def visit_local_variable_or_write_node(node); end
 
   # Inspect a LocalVariableReadNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1559
+  # source://prism/lib/prism/inspect_visitor.rb#1559
   def visit_local_variable_read_node(node); end
 
   # Inspect a LocalVariableTargetNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1568
+  # source://prism/lib/prism/inspect_visitor.rb#1568
   def visit_local_variable_target_node(node); end
 
   # Inspect a LocalVariableWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1577
+  # source://prism/lib/prism/inspect_visitor.rb#1577
   def visit_local_variable_write_node(node); end
 
   # Inspect a MatchLastLineNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1590
+  # source://prism/lib/prism/inspect_visitor.rb#1590
   def visit_match_last_line_node(node); end
 
   # Inspect a MatchPredicateNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1601
+  # source://prism/lib/prism/inspect_visitor.rb#1601
   def visit_match_predicate_node(node); end
 
   # Inspect a MatchRequiredNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1613
+  # source://prism/lib/prism/inspect_visitor.rb#1613
   def visit_match_required_node(node); end
 
   # Inspect a MatchWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1625
+  # source://prism/lib/prism/inspect_visitor.rb#1625
   def visit_match_write_node(node); end
 
   # Inspect a MissingNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1643
+  # source://prism/lib/prism/inspect_visitor.rb#1643
   def visit_missing_node(node); end
 
   # Inspect a ModuleNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1650
+  # source://prism/lib/prism/inspect_visitor.rb#1650
   def visit_module_node(node); end
 
   # Inspect a MultiTargetNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1669
+  # source://prism/lib/prism/inspect_visitor.rb#1669
   def visit_multi_target_node(node); end
 
   # Inspect a MultiWriteNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1702
+  # source://prism/lib/prism/inspect_visitor.rb#1702
   def visit_multi_write_node(node); end
 
   # Inspect a NextNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1738
+  # source://prism/lib/prism/inspect_visitor.rb#1738
   def visit_next_node(node); end
 
   # Inspect a NilNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1752
+  # source://prism/lib/prism/inspect_visitor.rb#1752
   def visit_nil_node(node); end
 
   # Inspect a NoKeywordsParameterNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1759
+  # source://prism/lib/prism/inspect_visitor.rb#1759
   def visit_no_keywords_parameter_node(node); end
 
   # Inspect a NumberedParametersNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1768
+  # source://prism/lib/prism/inspect_visitor.rb#1768
   def visit_numbered_parameters_node(node); end
 
   # Inspect a NumberedReferenceReadNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1776
+  # source://prism/lib/prism/inspect_visitor.rb#1776
   def visit_numbered_reference_read_node(node); end
 
   # Inspect a OptionalKeywordParameterNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1784
+  # source://prism/lib/prism/inspect_visitor.rb#1784
   def visit_optional_keyword_parameter_node(node); end
 
   # Inspect a OptionalParameterNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1795
+  # source://prism/lib/prism/inspect_visitor.rb#1795
   def visit_optional_parameter_node(node); end
 
   # Inspect a OrNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1807
+  # source://prism/lib/prism/inspect_visitor.rb#1807
   def visit_or_node(node); end
 
   # Inspect a ParametersNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1819
+  # source://prism/lib/prism/inspect_visitor.rb#1819
   def visit_parameters_node(node); end
 
   # Inspect a ParenthesesNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1880
+  # source://prism/lib/prism/inspect_visitor.rb#1880
   def visit_parentheses_node(node); end
 
   # Inspect a PinnedExpressionNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1895
+  # source://prism/lib/prism/inspect_visitor.rb#1895
   def visit_pinned_expression_node(node); end
 
   # Inspect a PinnedVariableNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1907
+  # source://prism/lib/prism/inspect_visitor.rb#1907
   def visit_pinned_variable_node(node); end
 
   # Inspect a PostExecutionNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1917
+  # source://prism/lib/prism/inspect_visitor.rb#1917
   def visit_post_execution_node(node); end
 
   # Inspect a PreExecutionNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1933
+  # source://prism/lib/prism/inspect_visitor.rb#1933
   def visit_pre_execution_node(node); end
 
   # Inspect a ProgramNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1949
+  # source://prism/lib/prism/inspect_visitor.rb#1949
   def visit_program_node(node); end
 
   # Inspect a RangeNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1959
+  # source://prism/lib/prism/inspect_visitor.rb#1959
   def visit_range_node(node); end
 
   # Inspect a RationalNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1979
+  # source://prism/lib/prism/inspect_visitor.rb#1979
   def visit_rational_node(node); end
 
   # Inspect a RedoNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1988
+  # source://prism/lib/prism/inspect_visitor.rb#1988
   def visit_redo_node(node); end
 
   # Inspect a RegularExpressionNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#1995
+  # source://prism/lib/prism/inspect_visitor.rb#1995
   def visit_regular_expression_node(node); end
 
   # Inspect a RequiredKeywordParameterNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2006
+  # source://prism/lib/prism/inspect_visitor.rb#2006
   def visit_required_keyword_parameter_node(node); end
 
   # Inspect a RequiredParameterNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2015
+  # source://prism/lib/prism/inspect_visitor.rb#2015
   def visit_required_parameter_node(node); end
 
   # Inspect a RescueModifierNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2023
+  # source://prism/lib/prism/inspect_visitor.rb#2023
   def visit_rescue_modifier_node(node); end
 
   # Inspect a RescueNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2035
+  # source://prism/lib/prism/inspect_visitor.rb#2035
   def visit_rescue_node(node); end
 
   # Inspect a RestParameterNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2071
+  # source://prism/lib/prism/inspect_visitor.rb#2071
   def visit_rest_parameter_node(node); end
 
   # Inspect a RetryNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2085
+  # source://prism/lib/prism/inspect_visitor.rb#2085
   def visit_retry_node(node); end
 
   # Inspect a ReturnNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2092
+  # source://prism/lib/prism/inspect_visitor.rb#2092
   def visit_return_node(node); end
 
   # Inspect a SelfNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2106
+  # source://prism/lib/prism/inspect_visitor.rb#2106
   def visit_self_node(node); end
 
   # Inspect a ShareableConstantNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2113
+  # source://prism/lib/prism/inspect_visitor.rb#2113
   def visit_shareable_constant_node(node); end
 
   # Inspect a SingletonClassNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2122
+  # source://prism/lib/prism/inspect_visitor.rb#2122
   def visit_singleton_class_node(node); end
 
   # Inspect a SourceEncodingNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2141
+  # source://prism/lib/prism/inspect_visitor.rb#2141
   def visit_source_encoding_node(node); end
 
   # Inspect a SourceFileNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2148
+  # source://prism/lib/prism/inspect_visitor.rb#2148
   def visit_source_file_node(node); end
 
   # Inspect a SourceLineNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2156
+  # source://prism/lib/prism/inspect_visitor.rb#2156
   def visit_source_line_node(node); end
 
   # Inspect a SplatNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2163
+  # source://prism/lib/prism/inspect_visitor.rb#2163
   def visit_splat_node(node); end
 
   # Inspect a StatementsNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2177
+  # source://prism/lib/prism/inspect_visitor.rb#2177
   def visit_statements_node(node); end
 
   # Inspect a StringNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2193
+  # source://prism/lib/prism/inspect_visitor.rb#2193
   def visit_string_node(node); end
 
   # Inspect a SuperNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2204
+  # source://prism/lib/prism/inspect_visitor.rb#2204
   def visit_super_node(node); end
 
   # Inspect a SymbolNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2226
+  # source://prism/lib/prism/inspect_visitor.rb#2226
   def visit_symbol_node(node); end
 
   # Inspect a TrueNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2237
+  # source://prism/lib/prism/inspect_visitor.rb#2237
   def visit_true_node(node); end
 
   # Inspect a UndefNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2244
+  # source://prism/lib/prism/inspect_visitor.rb#2244
   def visit_undef_node(node); end
 
   # Inspect a UnlessNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2261
+  # source://prism/lib/prism/inspect_visitor.rb#2261
   def visit_unless_node(node); end
 
   # Inspect a UntilNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2285
+  # source://prism/lib/prism/inspect_visitor.rb#2285
   def visit_until_node(node); end
 
   # Inspect a WhenNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2302
+  # source://prism/lib/prism/inspect_visitor.rb#2302
   def visit_when_node(node); end
 
   # Inspect a WhileNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2326
+  # source://prism/lib/prism/inspect_visitor.rb#2326
   def visit_while_node(node); end
 
   # Inspect a XStringNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2343
+  # source://prism/lib/prism/inspect_visitor.rb#2343
   def visit_x_string_node(node); end
 
   # Inspect a YieldNode node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2354
+  # source://prism/lib/prism/inspect_visitor.rb#2354
   def visit_yield_node(node); end
 
   private
 
   # Compose a string representing the given inner location field.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2378
+  # source://prism/lib/prism/inspect_visitor.rb#2378
   def inspect_location(location); end
 
   # Compose a header for the given node.
   #
-  # source://prism//lib/prism/inspect_visitor.rb#2372
+  # source://prism/lib/prism/inspect_visitor.rb#2372
   def inspect_node(name, node); end
 
   class << self
     # Compose an inspect string for the given node.
     #
-    # source://prism//lib/prism/inspect_visitor.rb#41
+    # source://prism/lib/prism/inspect_visitor.rb#41
     sig { params(node: Prism::Node).returns(String) }
     def compose(node); end
   end
@@ -19012,14 +19012,14 @@ end
 # when we hit an element in that list. In this case, we have a special
 # command that replaces the subsequent indent with the given value.
 #
-# source://prism//lib/prism/inspect_visitor.rb#17
+# source://prism/lib/prism/inspect_visitor.rb#17
 class Prism::InspectVisitor::Replace
   # @return [Replace] a new instance of Replace
   #
-  # source://prism//lib/prism/inspect_visitor.rb#20
+  # source://prism/lib/prism/inspect_visitor.rb#20
   def initialize(value); end
 
-  # source://prism//lib/prism/inspect_visitor.rb#18
+  # source://prism/lib/prism/inspect_visitor.rb#18
   def value; end
 end
 
@@ -19028,13 +19028,13 @@ end
 #     @target &&= value
 #     ^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#8689
+# source://prism/lib/prism/node.rb#8689
 class Prism::InstanceVariableAndWriteNode < ::Prism::Node
   # Initialize a new InstanceVariableAndWriteNode node.
   #
   # @return [InstanceVariableAndWriteNode] a new instance of InstanceVariableAndWriteNode
   #
-  # source://prism//lib/prism/node.rb#8691
+  # source://prism/lib/prism/node.rb#8691
   sig do
     params(
       source: Prism::Source,
@@ -19052,36 +19052,36 @@ class Prism::InstanceVariableAndWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#8777
+  # source://prism/lib/prism/node.rb#8777
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#8703
+  # source://prism/lib/prism/node.rb#8703
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#8708
+  # source://prism/lib/prism/node.rb#8708
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#8718
+  # source://prism/lib/prism/node.rb#8718
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#8713
+  # source://prism/lib/prism/node.rb#8713
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> InstanceVariableAndWriteNode
   #
-  # source://prism//lib/prism/node.rb#8723
+  # source://prism/lib/prism/node.rb#8723
   sig do
     params(
       node_id: Integer,
@@ -19098,17 +19098,17 @@ class Prism::InstanceVariableAndWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#8708
+  # source://prism/lib/prism/node.rb#8708
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#8731
+  # source://prism/lib/prism/node.rb#8731
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
-  # source://prism//lib/prism/desugar_compiler.rb#218
+  # source://prism/lib/prism/desugar_compiler.rb#218
   def desugar; end
 
   sig { override.returns(T::Array[Prism::Reflection::Field]) }
@@ -19116,50 +19116,50 @@ class Prism::InstanceVariableAndWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#8761
+  # source://prism/lib/prism/node.rb#8761
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#8736
+  # source://prism/lib/prism/node.rb#8736
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#8739
+  # source://prism/lib/prism/node.rb#8739
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#8756
+  # source://prism/lib/prism/node.rb#8756
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#8746
+  # source://prism/lib/prism/node.rb#8746
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#8766
+  # source://prism/lib/prism/node.rb#8766
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#8753
+  # source://prism/lib/prism/node.rb#8753
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#8771
+    # source://prism/lib/prism/node.rb#8771
     def type; end
   end
 end
@@ -19169,13 +19169,13 @@ end
 #     @target += value
 #     ^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#8790
+# source://prism/lib/prism/node.rb#8790
 class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node
   # Initialize a new InstanceVariableOperatorWriteNode node.
   #
   # @return [InstanceVariableOperatorWriteNode] a new instance of InstanceVariableOperatorWriteNode
   #
-  # source://prism//lib/prism/node.rb#8792
+  # source://prism/lib/prism/node.rb#8792
   sig do
     params(
       source: Prism::Source,
@@ -19194,48 +19194,48 @@ class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#8877
+  # source://prism/lib/prism/node.rb#8877
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#8805
+  # source://prism/lib/prism/node.rb#8805
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader binary_operator: Symbol
   #
-  # source://prism//lib/prism/node.rb#8858
+  # source://prism/lib/prism/node.rb#8858
   sig { returns(Symbol) }
   def binary_operator; end
 
   # attr_reader binary_operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#8848
+  # source://prism/lib/prism/node.rb#8848
   sig { returns(Prism::Location) }
   def binary_operator_loc; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#8810
+  # source://prism/lib/prism/node.rb#8810
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#8820
+  # source://prism/lib/prism/node.rb#8820
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#8815
+  # source://prism/lib/prism/node.rb#8815
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol) -> InstanceVariableOperatorWriteNode
   #
-  # source://prism//lib/prism/node.rb#8825
+  # source://prism/lib/prism/node.rb#8825
   sig do
     params(
       node_id: Integer,
@@ -19253,17 +19253,17 @@ class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#8810
+  # source://prism/lib/prism/node.rb#8810
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol }
   #
-  # source://prism//lib/prism/node.rb#8833
+  # source://prism/lib/prism/node.rb#8833
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
-  # source://prism//lib/prism/desugar_compiler.rb#230
+  # source://prism/lib/prism/desugar_compiler.rb#230
   def desugar; end
 
   sig { override.returns(T::Array[Prism::Reflection::Field]) }
@@ -19271,50 +19271,50 @@ class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#8861
+  # source://prism/lib/prism/node.rb#8861
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#8838
+  # source://prism/lib/prism/node.rb#8838
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#8841
+  # source://prism/lib/prism/node.rb#8841
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # Returns the binary operator used to modify the receiver. This method is
   # deprecated in favor of #binary_operator.
   #
-  # source://prism//lib/prism/node_ext.rb#435
+  # source://prism/lib/prism/node_ext.rb#435
   def operator; end
 
   # Returns the location of the binary operator used to modify the receiver.
   # This method is deprecated in favor of #binary_operator_loc.
   #
-  # source://prism//lib/prism/node_ext.rb#442
+  # source://prism/lib/prism/node_ext.rb#442
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#8866
+  # source://prism/lib/prism/node.rb#8866
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#8855
+  # source://prism/lib/prism/node.rb#8855
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#8871
+    # source://prism/lib/prism/node.rb#8871
     def type; end
   end
 end
@@ -19324,13 +19324,13 @@ end
 #     @target ||= value
 #     ^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#8891
+# source://prism/lib/prism/node.rb#8891
 class Prism::InstanceVariableOrWriteNode < ::Prism::Node
   # Initialize a new InstanceVariableOrWriteNode node.
   #
   # @return [InstanceVariableOrWriteNode] a new instance of InstanceVariableOrWriteNode
   #
-  # source://prism//lib/prism/node.rb#8893
+  # source://prism/lib/prism/node.rb#8893
   sig do
     params(
       source: Prism::Source,
@@ -19348,36 +19348,36 @@ class Prism::InstanceVariableOrWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#8979
+  # source://prism/lib/prism/node.rb#8979
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#8905
+  # source://prism/lib/prism/node.rb#8905
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#8910
+  # source://prism/lib/prism/node.rb#8910
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#8920
+  # source://prism/lib/prism/node.rb#8920
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#8915
+  # source://prism/lib/prism/node.rb#8915
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> InstanceVariableOrWriteNode
   #
-  # source://prism//lib/prism/node.rb#8925
+  # source://prism/lib/prism/node.rb#8925
   sig do
     params(
       node_id: Integer,
@@ -19394,17 +19394,17 @@ class Prism::InstanceVariableOrWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#8910
+  # source://prism/lib/prism/node.rb#8910
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#8933
+  # source://prism/lib/prism/node.rb#8933
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
-  # source://prism//lib/prism/desugar_compiler.rb#224
+  # source://prism/lib/prism/desugar_compiler.rb#224
   def desugar; end
 
   sig { override.returns(T::Array[Prism::Reflection::Field]) }
@@ -19412,50 +19412,50 @@ class Prism::InstanceVariableOrWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#8963
+  # source://prism/lib/prism/node.rb#8963
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#8938
+  # source://prism/lib/prism/node.rb#8938
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#8941
+  # source://prism/lib/prism/node.rb#8941
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#8958
+  # source://prism/lib/prism/node.rb#8958
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#8948
+  # source://prism/lib/prism/node.rb#8948
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#8968
+  # source://prism/lib/prism/node.rb#8968
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#8955
+  # source://prism/lib/prism/node.rb#8955
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#8973
+    # source://prism/lib/prism/node.rb#8973
     def type; end
   end
 end
@@ -19465,49 +19465,49 @@ end
 #     @foo
 #     ^^^^
 #
-# source://prism//lib/prism/node.rb#8992
+# source://prism/lib/prism/node.rb#8992
 class Prism::InstanceVariableReadNode < ::Prism::Node
   # Initialize a new InstanceVariableReadNode node.
   #
   # @return [InstanceVariableReadNode] a new instance of InstanceVariableReadNode
   #
-  # source://prism//lib/prism/node.rb#8994
+  # source://prism/lib/prism/node.rb#8994
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
   def initialize(source, node_id, location, flags, name); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#9059
+  # source://prism/lib/prism/node.rb#9059
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#9003
+  # source://prism/lib/prism/node.rb#9003
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#9008
+  # source://prism/lib/prism/node.rb#9008
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#9018
+  # source://prism/lib/prism/node.rb#9018
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#9013
+  # source://prism/lib/prism/node.rb#9013
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> InstanceVariableReadNode
   #
-  # source://prism//lib/prism/node.rb#9023
+  # source://prism/lib/prism/node.rb#9023
   sig do
     params(
       node_id: Integer,
@@ -19521,13 +19521,13 @@ class Prism::InstanceVariableReadNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#9008
+  # source://prism/lib/prism/node.rb#9008
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
   #
-  # source://prism//lib/prism/node.rb#9031
+  # source://prism/lib/prism/node.rb#9031
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -19536,7 +19536,7 @@ class Prism::InstanceVariableReadNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#9043
+  # source://prism/lib/prism/node.rb#9043
   sig { override.returns(String) }
   def inspect; end
 
@@ -19546,20 +19546,20 @@ class Prism::InstanceVariableReadNode < ::Prism::Node
   #
   #     @_test # name `:@_test`
   #
-  # source://prism//lib/prism/node.rb#9040
+  # source://prism/lib/prism/node.rb#9040
   sig { returns(Symbol) }
   def name; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#9048
+  # source://prism/lib/prism/node.rb#9048
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#9053
+    # source://prism/lib/prism/node.rb#9053
     def type; end
   end
 end
@@ -19569,49 +19569,49 @@ end
 #     @foo, @bar = baz
 #     ^^^^  ^^^^
 #
-# source://prism//lib/prism/node.rb#9069
+# source://prism/lib/prism/node.rb#9069
 class Prism::InstanceVariableTargetNode < ::Prism::Node
   # Initialize a new InstanceVariableTargetNode node.
   #
   # @return [InstanceVariableTargetNode] a new instance of InstanceVariableTargetNode
   #
-  # source://prism//lib/prism/node.rb#9071
+  # source://prism/lib/prism/node.rb#9071
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
   def initialize(source, node_id, location, flags, name); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#9132
+  # source://prism/lib/prism/node.rb#9132
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#9080
+  # source://prism/lib/prism/node.rb#9080
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#9085
+  # source://prism/lib/prism/node.rb#9085
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#9095
+  # source://prism/lib/prism/node.rb#9095
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#9090
+  # source://prism/lib/prism/node.rb#9090
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> InstanceVariableTargetNode
   #
-  # source://prism//lib/prism/node.rb#9100
+  # source://prism/lib/prism/node.rb#9100
   sig do
     params(
       node_id: Integer,
@@ -19625,13 +19625,13 @@ class Prism::InstanceVariableTargetNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#9085
+  # source://prism/lib/prism/node.rb#9085
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
   #
-  # source://prism//lib/prism/node.rb#9108
+  # source://prism/lib/prism/node.rb#9108
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -19640,26 +19640,26 @@ class Prism::InstanceVariableTargetNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#9116
+  # source://prism/lib/prism/node.rb#9116
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#9113
+  # source://prism/lib/prism/node.rb#9113
   sig { returns(Symbol) }
   def name; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#9121
+  # source://prism/lib/prism/node.rb#9121
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#9126
+    # source://prism/lib/prism/node.rb#9126
     def type; end
   end
 end
@@ -19669,13 +19669,13 @@ end
 #     @foo = 1
 #     ^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#9142
+# source://prism/lib/prism/node.rb#9142
 class Prism::InstanceVariableWriteNode < ::Prism::Node
   # Initialize a new InstanceVariableWriteNode node.
   #
   # @return [InstanceVariableWriteNode] a new instance of InstanceVariableWriteNode
   #
-  # source://prism//lib/prism/node.rb#9144
+  # source://prism/lib/prism/node.rb#9144
   sig do
     params(
       source: Prism::Source,
@@ -19693,36 +19693,36 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#9246
+  # source://prism/lib/prism/node.rb#9246
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#9156
+  # source://prism/lib/prism/node.rb#9156
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#9161
+  # source://prism/lib/prism/node.rb#9161
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#9171
+  # source://prism/lib/prism/node.rb#9171
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#9166
+  # source://prism/lib/prism/node.rb#9166
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location) -> InstanceVariableWriteNode
   #
-  # source://prism//lib/prism/node.rb#9176
+  # source://prism/lib/prism/node.rb#9176
   sig do
     params(
       node_id: Integer,
@@ -19739,13 +19739,13 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#9161
+  # source://prism/lib/prism/node.rb#9161
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#9184
+  # source://prism/lib/prism/node.rb#9184
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -19754,7 +19754,7 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#9230
+  # source://prism/lib/prism/node.rb#9230
   sig { override.returns(String) }
   def inspect; end
 
@@ -19764,7 +19764,7 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node
   #
   #     @_foo = "bar" # name `@_foo`
   #
-  # source://prism//lib/prism/node.rb#9193
+  # source://prism/lib/prism/node.rb#9193
   sig { returns(Symbol) }
   def name; end
 
@@ -19773,13 +19773,13 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node
   #     @_x = 1
   #     ^^^
   #
-  # source://prism//lib/prism/node.rb#9199
+  # source://prism/lib/prism/node.rb#9199
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#9225
+  # source://prism/lib/prism/node.rb#9225
   sig { returns(String) }
   def operator; end
 
@@ -19788,13 +19788,13 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node
   #     @x = y
   #        ^
   #
-  # source://prism//lib/prism/node.rb#9218
+  # source://prism/lib/prism/node.rb#9218
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#9235
+  # source://prism/lib/prism/node.rb#9235
   sig { override.returns(Symbol) }
   def type; end
 
@@ -19806,41 +19806,41 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node
   #     @_x = 1234
   #           ^^^^
   #
-  # source://prism//lib/prism/node.rb#9212
+  # source://prism/lib/prism/node.rb#9212
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#9240
+    # source://prism/lib/prism/node.rb#9240
     def type; end
   end
 end
 
 # Flags for integer nodes that correspond to the base of the integer.
 #
-# source://prism//lib/prism/node.rb#16732
+# source://prism/lib/prism/node.rb#16732
 module Prism::IntegerBaseFlags; end
 
 # 0b prefix
 #
-# source://prism//lib/prism/node.rb#16734
+# source://prism/lib/prism/node.rb#16734
 Prism::IntegerBaseFlags::BINARY = T.let(T.unsafe(nil), Integer)
 
 # 0d or no prefix
 #
-# source://prism//lib/prism/node.rb#16737
+# source://prism/lib/prism/node.rb#16737
 Prism::IntegerBaseFlags::DECIMAL = T.let(T.unsafe(nil), Integer)
 
 # 0x prefix
 #
-# source://prism//lib/prism/node.rb#16743
+# source://prism/lib/prism/node.rb#16743
 Prism::IntegerBaseFlags::HEXADECIMAL = T.let(T.unsafe(nil), Integer)
 
 # 0o or 0 prefix
 #
-# source://prism//lib/prism/node.rb#16740
+# source://prism/lib/prism/node.rb#16740
 Prism::IntegerBaseFlags::OCTAL = T.let(T.unsafe(nil), Integer)
 
 # Represents an integer number literal.
@@ -19848,13 +19848,13 @@ Prism::IntegerBaseFlags::OCTAL = T.let(T.unsafe(nil), Integer)
 #     1
 #     ^
 #
-# source://prism//lib/prism/node.rb#9259
+# source://prism/lib/prism/node.rb#9259
 class Prism::IntegerNode < ::Prism::Node
   # Initialize a new IntegerNode node.
   #
   # @return [IntegerNode] a new instance of IntegerNode
   #
-  # source://prism//lib/prism/node.rb#9261
+  # source://prism/lib/prism/node.rb#9261
   sig do
     params(
       source: Prism::Source,
@@ -19869,12 +19869,12 @@ class Prism::IntegerNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#9342
+  # source://prism/lib/prism/node.rb#9342
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#9270
+  # source://prism/lib/prism/node.rb#9270
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
@@ -19882,31 +19882,31 @@ class Prism::IntegerNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9303
+  # source://prism/lib/prism/node.rb#9303
   sig { returns(T::Boolean) }
   def binary?; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#9275
+  # source://prism/lib/prism/node.rb#9275
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#9285
+  # source://prism/lib/prism/node.rb#9285
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#9280
+  # source://prism/lib/prism/node.rb#9280
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: Integer) -> IntegerNode
   #
-  # source://prism//lib/prism/node.rb#9290
+  # source://prism/lib/prism/node.rb#9290
   sig do
     params(
       node_id: Integer,
@@ -19921,20 +19921,20 @@ class Prism::IntegerNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9308
+  # source://prism/lib/prism/node.rb#9308
   sig { returns(T::Boolean) }
   def decimal?; end
 
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#9275
+  # source://prism/lib/prism/node.rb#9275
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: Integer }
   #
-  # source://prism//lib/prism/node.rb#9298
+  # source://prism/lib/prism/node.rb#9298
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -19945,13 +19945,13 @@ class Prism::IntegerNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9318
+  # source://prism/lib/prism/node.rb#9318
   sig { returns(T::Boolean) }
   def hexadecimal?; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#9326
+  # source://prism/lib/prism/node.rb#9326
   sig { override.returns(String) }
   def inspect; end
 
@@ -19959,26 +19959,26 @@ class Prism::IntegerNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9313
+  # source://prism/lib/prism/node.rb#9313
   sig { returns(T::Boolean) }
   def octal?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#9331
+  # source://prism/lib/prism/node.rb#9331
   sig { override.returns(Symbol) }
   def type; end
 
   # The value of the integer literal as a number.
   #
-  # source://prism//lib/prism/node.rb#9323
+  # source://prism/lib/prism/node.rb#9323
   sig { returns(Integer) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#9336
+    # source://prism/lib/prism/node.rb#9336
     def type; end
   end
 end
@@ -19988,7 +19988,7 @@ end
 #     if /foo #{bar} baz/ then end
 #        ^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#9353
+# source://prism/lib/prism/node.rb#9353
 class Prism::InterpolatedMatchLastLineNode < ::Prism::Node
   include ::Prism::RegularExpressionOptions
 
@@ -19996,7 +19996,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node
   #
   # @return [InterpolatedMatchLastLineNode] a new instance of InterpolatedMatchLastLineNode
   #
-  # source://prism//lib/prism/node.rb#9355
+  # source://prism/lib/prism/node.rb#9355
   sig do
     params(
       source: Prism::Source,
@@ -20013,12 +20013,12 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#9497
+  # source://prism/lib/prism/node.rb#9497
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#9366
+  # source://prism/lib/prism/node.rb#9366
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
@@ -20026,43 +20026,43 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9424
+  # source://prism/lib/prism/node.rb#9424
   sig { returns(T::Boolean) }
   def ascii_8bit?; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#9371
+  # source://prism/lib/prism/node.rb#9371
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String
   #
-  # source://prism//lib/prism/node.rb#9476
+  # source://prism/lib/prism/node.rb#9476
   sig { returns(String) }
   def closing; end
 
   # attr_reader closing_loc: Location
   #
-  # source://prism//lib/prism/node.rb#9464
+  # source://prism/lib/prism/node.rb#9464
   sig { returns(Prism::Location) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#9381
+  # source://prism/lib/prism/node.rb#9381
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#9376
+  # source://prism/lib/prism/node.rb#9376
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location) -> InterpolatedMatchLastLineNode
   #
-  # source://prism//lib/prism/node.rb#9386
+  # source://prism/lib/prism/node.rb#9386
   sig do
     params(
       node_id: Integer,
@@ -20078,13 +20078,13 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#9371
+  # source://prism/lib/prism/node.rb#9371
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#9394
+  # source://prism/lib/prism/node.rb#9394
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -20092,7 +20092,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9419
+  # source://prism/lib/prism/node.rb#9419
   sig { returns(T::Boolean) }
   def euc_jp?; end
 
@@ -20100,7 +20100,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9404
+  # source://prism/lib/prism/node.rb#9404
   sig { returns(T::Boolean) }
   def extended?; end
 
@@ -20111,7 +20111,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9444
+  # source://prism/lib/prism/node.rb#9444
   sig { returns(T::Boolean) }
   def forced_binary_encoding?; end
 
@@ -20119,7 +20119,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9449
+  # source://prism/lib/prism/node.rb#9449
   sig { returns(T::Boolean) }
   def forced_us_ascii_encoding?; end
 
@@ -20127,7 +20127,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9439
+  # source://prism/lib/prism/node.rb#9439
   sig { returns(T::Boolean) }
   def forced_utf8_encoding?; end
 
@@ -20135,13 +20135,13 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9399
+  # source://prism/lib/prism/node.rb#9399
   sig { returns(T::Boolean) }
   def ignore_case?; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#9481
+  # source://prism/lib/prism/node.rb#9481
   sig { override.returns(String) }
   def inspect; end
 
@@ -20149,30 +20149,30 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9409
+  # source://prism/lib/prism/node.rb#9409
   sig { returns(T::Boolean) }
   def multi_line?; end
 
-  # source://prism//lib/prism/parse_result/newlines.rb#121
+  # source://prism/lib/prism/parse_result/newlines.rb#121
   def newline_flag!(lines); end
 
   # def once?: () -> bool
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9414
+  # source://prism/lib/prism/node.rb#9414
   sig { returns(T::Boolean) }
   def once?; end
 
   # def opening: () -> String
   #
-  # source://prism//lib/prism/node.rb#9471
+  # source://prism/lib/prism/node.rb#9471
   sig { returns(String) }
   def opening; end
 
   # attr_reader opening_loc: Location
   #
-  # source://prism//lib/prism/node.rb#9454
+  # source://prism/lib/prism/node.rb#9454
   sig { returns(Prism::Location) }
   def opening_loc; end
 
@@ -20181,13 +20181,13 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node
 
   # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode]
   #
-  # source://prism//lib/prism/node.rb#9461
+  # source://prism/lib/prism/node.rb#9461
   sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) }
   def parts; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#9486
+  # source://prism/lib/prism/node.rb#9486
   sig { override.returns(Symbol) }
   def type; end
 
@@ -20195,7 +20195,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9434
+  # source://prism/lib/prism/node.rb#9434
   sig { returns(T::Boolean) }
   def utf_8?; end
 
@@ -20203,14 +20203,14 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9429
+  # source://prism/lib/prism/node.rb#9429
   sig { returns(T::Boolean) }
   def windows_31j?; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#9491
+    # source://prism/lib/prism/node.rb#9491
     def type; end
   end
 end
@@ -20220,7 +20220,7 @@ end
 #     /foo #{bar} baz/
 #     ^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#9511
+# source://prism/lib/prism/node.rb#9511
 class Prism::InterpolatedRegularExpressionNode < ::Prism::Node
   include ::Prism::RegularExpressionOptions
 
@@ -20228,7 +20228,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node
   #
   # @return [InterpolatedRegularExpressionNode] a new instance of InterpolatedRegularExpressionNode
   #
-  # source://prism//lib/prism/node.rb#9513
+  # source://prism/lib/prism/node.rb#9513
   sig do
     params(
       source: Prism::Source,
@@ -20245,12 +20245,12 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#9655
+  # source://prism/lib/prism/node.rb#9655
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#9524
+  # source://prism/lib/prism/node.rb#9524
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
@@ -20258,43 +20258,43 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9582
+  # source://prism/lib/prism/node.rb#9582
   sig { returns(T::Boolean) }
   def ascii_8bit?; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#9529
+  # source://prism/lib/prism/node.rb#9529
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String
   #
-  # source://prism//lib/prism/node.rb#9634
+  # source://prism/lib/prism/node.rb#9634
   sig { returns(String) }
   def closing; end
 
   # attr_reader closing_loc: Location
   #
-  # source://prism//lib/prism/node.rb#9622
+  # source://prism/lib/prism/node.rb#9622
   sig { returns(Prism::Location) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#9539
+  # source://prism/lib/prism/node.rb#9539
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#9534
+  # source://prism/lib/prism/node.rb#9534
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location) -> InterpolatedRegularExpressionNode
   #
-  # source://prism//lib/prism/node.rb#9544
+  # source://prism/lib/prism/node.rb#9544
   sig do
     params(
       node_id: Integer,
@@ -20310,13 +20310,13 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#9529
+  # source://prism/lib/prism/node.rb#9529
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#9552
+  # source://prism/lib/prism/node.rb#9552
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -20324,7 +20324,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9577
+  # source://prism/lib/prism/node.rb#9577
   sig { returns(T::Boolean) }
   def euc_jp?; end
 
@@ -20332,7 +20332,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9562
+  # source://prism/lib/prism/node.rb#9562
   sig { returns(T::Boolean) }
   def extended?; end
 
@@ -20343,7 +20343,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9602
+  # source://prism/lib/prism/node.rb#9602
   sig { returns(T::Boolean) }
   def forced_binary_encoding?; end
 
@@ -20351,7 +20351,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9607
+  # source://prism/lib/prism/node.rb#9607
   sig { returns(T::Boolean) }
   def forced_us_ascii_encoding?; end
 
@@ -20359,7 +20359,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9597
+  # source://prism/lib/prism/node.rb#9597
   sig { returns(T::Boolean) }
   def forced_utf8_encoding?; end
 
@@ -20367,13 +20367,13 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9557
+  # source://prism/lib/prism/node.rb#9557
   sig { returns(T::Boolean) }
   def ignore_case?; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#9639
+  # source://prism/lib/prism/node.rb#9639
   sig { override.returns(String) }
   def inspect; end
 
@@ -20381,30 +20381,30 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9567
+  # source://prism/lib/prism/node.rb#9567
   sig { returns(T::Boolean) }
   def multi_line?; end
 
-  # source://prism//lib/prism/parse_result/newlines.rb#128
+  # source://prism/lib/prism/parse_result/newlines.rb#128
   def newline_flag!(lines); end
 
   # def once?: () -> bool
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9572
+  # source://prism/lib/prism/node.rb#9572
   sig { returns(T::Boolean) }
   def once?; end
 
   # def opening: () -> String
   #
-  # source://prism//lib/prism/node.rb#9629
+  # source://prism/lib/prism/node.rb#9629
   sig { returns(String) }
   def opening; end
 
   # attr_reader opening_loc: Location
   #
-  # source://prism//lib/prism/node.rb#9612
+  # source://prism/lib/prism/node.rb#9612
   sig { returns(Prism::Location) }
   def opening_loc; end
 
@@ -20413,13 +20413,13 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node
 
   # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode]
   #
-  # source://prism//lib/prism/node.rb#9619
+  # source://prism/lib/prism/node.rb#9619
   sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) }
   def parts; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#9644
+  # source://prism/lib/prism/node.rb#9644
   sig { override.returns(Symbol) }
   def type; end
 
@@ -20427,7 +20427,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9592
+  # source://prism/lib/prism/node.rb#9592
   sig { returns(T::Boolean) }
   def utf_8?; end
 
@@ -20435,14 +20435,14 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9587
+  # source://prism/lib/prism/node.rb#9587
   sig { returns(T::Boolean) }
   def windows_31j?; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#9649
+    # source://prism/lib/prism/node.rb#9649
     def type; end
   end
 end
@@ -20452,7 +20452,7 @@ end
 #     "foo #{bar} baz"
 #     ^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#9669
+# source://prism/lib/prism/node.rb#9669
 class Prism::InterpolatedStringNode < ::Prism::Node
   include ::Prism::HeredocQuery
 
@@ -20460,7 +20460,7 @@ class Prism::InterpolatedStringNode < ::Prism::Node
   #
   # @return [InterpolatedStringNode] a new instance of InterpolatedStringNode
   #
-  # source://prism//lib/prism/node.rb#9671
+  # source://prism/lib/prism/node.rb#9671
   sig do
     params(
       source: Prism::Source,
@@ -20477,48 +20477,48 @@ class Prism::InterpolatedStringNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#9780
+  # source://prism/lib/prism/node.rb#9780
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#9682
+  # source://prism/lib/prism/node.rb#9682
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#9687
+  # source://prism/lib/prism/node.rb#9687
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String?
   #
-  # source://prism//lib/prism/node.rb#9759
+  # source://prism/lib/prism/node.rb#9759
   sig { returns(T.nilable(String)) }
   def closing; end
 
   # attr_reader closing_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#9741
+  # source://prism/lib/prism/node.rb#9741
   sig { returns(T.nilable(Prism::Location)) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#9697
+  # source://prism/lib/prism/node.rb#9697
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#9692
+  # source://prism/lib/prism/node.rb#9692
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location?, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode | InterpolatedStringNode], ?closing_loc: Location?) -> InterpolatedStringNode
   #
-  # source://prism//lib/prism/node.rb#9702
+  # source://prism/lib/prism/node.rb#9702
   sig do
     params(
       node_id: Integer,
@@ -20534,13 +20534,13 @@ class Prism::InterpolatedStringNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#9687
+  # source://prism/lib/prism/node.rb#9687
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location?, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode | InterpolatedStringNode], closing_loc: Location? }
   #
-  # source://prism//lib/prism/node.rb#9710
+  # source://prism/lib/prism/node.rb#9710
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -20551,7 +20551,7 @@ class Prism::InterpolatedStringNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9715
+  # source://prism/lib/prism/node.rb#9715
   sig { returns(T::Boolean) }
   def frozen?; end
 
@@ -20560,7 +20560,7 @@ class Prism::InterpolatedStringNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#9764
+  # source://prism/lib/prism/node.rb#9764
   sig { override.returns(String) }
   def inspect; end
 
@@ -20568,28 +20568,28 @@ class Prism::InterpolatedStringNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#9720
+  # source://prism/lib/prism/node.rb#9720
   sig { returns(T::Boolean) }
   def mutable?; end
 
-  # source://prism//lib/prism/parse_result/newlines.rb#135
+  # source://prism/lib/prism/parse_result/newlines.rb#135
   def newline_flag!(lines); end
 
   # def opening: () -> String?
   #
-  # source://prism//lib/prism/node.rb#9754
+  # source://prism/lib/prism/node.rb#9754
   sig { returns(T.nilable(String)) }
   def opening; end
 
   # attr_reader opening_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#9725
+  # source://prism/lib/prism/node.rb#9725
   sig { returns(T.nilable(Prism::Location)) }
   def opening_loc; end
 
   # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode | InterpolatedStringNode]
   #
-  # source://prism//lib/prism/node.rb#9738
+  # source://prism/lib/prism/node.rb#9738
   sig do
     returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode, Prism::InterpolatedStringNode)])
   end
@@ -20597,27 +20597,27 @@ class Prism::InterpolatedStringNode < ::Prism::Node
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#9769
+  # source://prism/lib/prism/node.rb#9769
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#9774
+    # source://prism/lib/prism/node.rb#9774
     def type; end
   end
 end
 
 # Flags for interpolated string nodes that indicated mutability if they are also marked as literals.
 #
-# source://prism//lib/prism/node.rb#16747
+# source://prism/lib/prism/node.rb#16747
 module Prism::InterpolatedStringNodeFlags; end
 
-# source://prism//lib/prism/node.rb#16749
+# source://prism/lib/prism/node.rb#16749
 Prism::InterpolatedStringNodeFlags::FROZEN = T.let(T.unsafe(nil), Integer)
 
-# source://prism//lib/prism/node.rb#16752
+# source://prism/lib/prism/node.rb#16752
 Prism::InterpolatedStringNodeFlags::MUTABLE = T.let(T.unsafe(nil), Integer)
 
 # Represents a symbol literal that contains interpolation.
@@ -20625,13 +20625,13 @@ Prism::InterpolatedStringNodeFlags::MUTABLE = T.let(T.unsafe(nil), Integer)
 #     :"foo #{bar} baz"
 #     ^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#9794
+# source://prism/lib/prism/node.rb#9794
 class Prism::InterpolatedSymbolNode < ::Prism::Node
   # Initialize a new InterpolatedSymbolNode node.
   #
   # @return [InterpolatedSymbolNode] a new instance of InterpolatedSymbolNode
   #
-  # source://prism//lib/prism/node.rb#9796
+  # source://prism/lib/prism/node.rb#9796
   sig do
     params(
       source: Prism::Source,
@@ -20648,48 +20648,48 @@ class Prism::InterpolatedSymbolNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#9895
+  # source://prism/lib/prism/node.rb#9895
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#9807
+  # source://prism/lib/prism/node.rb#9807
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#9812
+  # source://prism/lib/prism/node.rb#9812
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String?
   #
-  # source://prism//lib/prism/node.rb#9874
+  # source://prism/lib/prism/node.rb#9874
   sig { returns(T.nilable(String)) }
   def closing; end
 
   # attr_reader closing_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#9856
+  # source://prism/lib/prism/node.rb#9856
   sig { returns(T.nilable(Prism::Location)) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#9822
+  # source://prism/lib/prism/node.rb#9822
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#9817
+  # source://prism/lib/prism/node.rb#9817
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location?, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location?) -> InterpolatedSymbolNode
   #
-  # source://prism//lib/prism/node.rb#9827
+  # source://prism/lib/prism/node.rb#9827
   sig do
     params(
       node_id: Integer,
@@ -20705,13 +20705,13 @@ class Prism::InterpolatedSymbolNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#9812
+  # source://prism/lib/prism/node.rb#9812
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location?, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location? }
   #
-  # source://prism//lib/prism/node.rb#9835
+  # source://prism/lib/prism/node.rb#9835
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -20720,41 +20720,41 @@ class Prism::InterpolatedSymbolNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#9879
+  # source://prism/lib/prism/node.rb#9879
   sig { override.returns(String) }
   def inspect; end
 
-  # source://prism//lib/prism/parse_result/newlines.rb#142
+  # source://prism/lib/prism/parse_result/newlines.rb#142
   def newline_flag!(lines); end
 
   # def opening: () -> String?
   #
-  # source://prism//lib/prism/node.rb#9869
+  # source://prism/lib/prism/node.rb#9869
   sig { returns(T.nilable(String)) }
   def opening; end
 
   # attr_reader opening_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#9840
+  # source://prism/lib/prism/node.rb#9840
   sig { returns(T.nilable(Prism::Location)) }
   def opening_loc; end
 
   # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode]
   #
-  # source://prism//lib/prism/node.rb#9853
+  # source://prism/lib/prism/node.rb#9853
   sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) }
   def parts; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#9884
+  # source://prism/lib/prism/node.rb#9884
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#9889
+    # source://prism/lib/prism/node.rb#9889
     def type; end
   end
 end
@@ -20764,7 +20764,7 @@ end
 #     `foo #{bar} baz`
 #     ^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#9908
+# source://prism/lib/prism/node.rb#9908
 class Prism::InterpolatedXStringNode < ::Prism::Node
   include ::Prism::HeredocQuery
 
@@ -20772,7 +20772,7 @@ class Prism::InterpolatedXStringNode < ::Prism::Node
   #
   # @return [InterpolatedXStringNode] a new instance of InterpolatedXStringNode
   #
-  # source://prism//lib/prism/node.rb#9910
+  # source://prism/lib/prism/node.rb#9910
   sig do
     params(
       source: Prism::Source,
@@ -20789,48 +20789,48 @@ class Prism::InterpolatedXStringNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#9997
+  # source://prism/lib/prism/node.rb#9997
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#9921
+  # source://prism/lib/prism/node.rb#9921
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#9926
+  # source://prism/lib/prism/node.rb#9926
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String
   #
-  # source://prism//lib/prism/node.rb#9976
+  # source://prism/lib/prism/node.rb#9976
   sig { returns(String) }
   def closing; end
 
   # attr_reader closing_loc: Location
   #
-  # source://prism//lib/prism/node.rb#9964
+  # source://prism/lib/prism/node.rb#9964
   sig { returns(Prism::Location) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#9936
+  # source://prism/lib/prism/node.rb#9936
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#9931
+  # source://prism/lib/prism/node.rb#9931
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location) -> InterpolatedXStringNode
   #
-  # source://prism//lib/prism/node.rb#9941
+  # source://prism/lib/prism/node.rb#9941
   sig do
     params(
       node_id: Integer,
@@ -20846,13 +20846,13 @@ class Prism::InterpolatedXStringNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#9926
+  # source://prism/lib/prism/node.rb#9926
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#9949
+  # source://prism/lib/prism/node.rb#9949
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -20864,41 +20864,41 @@ class Prism::InterpolatedXStringNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#9981
+  # source://prism/lib/prism/node.rb#9981
   sig { override.returns(String) }
   def inspect; end
 
-  # source://prism//lib/prism/parse_result/newlines.rb#149
+  # source://prism/lib/prism/parse_result/newlines.rb#149
   def newline_flag!(lines); end
 
   # def opening: () -> String
   #
-  # source://prism//lib/prism/node.rb#9971
+  # source://prism/lib/prism/node.rb#9971
   sig { returns(String) }
   def opening; end
 
   # attr_reader opening_loc: Location
   #
-  # source://prism//lib/prism/node.rb#9954
+  # source://prism/lib/prism/node.rb#9954
   sig { returns(Prism::Location) }
   def opening_loc; end
 
   # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode]
   #
-  # source://prism//lib/prism/node.rb#9961
+  # source://prism/lib/prism/node.rb#9961
   sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) }
   def parts; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#9986
+  # source://prism/lib/prism/node.rb#9986
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#9991
+    # source://prism/lib/prism/node.rb#9991
     def type; end
   end
 end
@@ -20908,62 +20908,62 @@ end
 #     -> { it }
 #          ^^
 #
-# source://prism//lib/prism/node.rb#10010
+# source://prism/lib/prism/node.rb#10010
 class Prism::ItLocalVariableReadNode < ::Prism::Node
   # Initialize a new ItLocalVariableReadNode node.
   #
   # @return [ItLocalVariableReadNode] a new instance of ItLocalVariableReadNode
   #
-  # source://prism//lib/prism/node.rb#10012
+  # source://prism/lib/prism/node.rb#10012
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
   def initialize(source, node_id, location, flags); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#10069
+  # source://prism/lib/prism/node.rb#10069
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#10020
+  # source://prism/lib/prism/node.rb#10020
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10025
+  # source://prism/lib/prism/node.rb#10025
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#10035
+  # source://prism/lib/prism/node.rb#10035
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#10030
+  # source://prism/lib/prism/node.rb#10030
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> ItLocalVariableReadNode
   #
-  # source://prism//lib/prism/node.rb#10040
+  # source://prism/lib/prism/node.rb#10040
   sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::ItLocalVariableReadNode) }
   def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end
 
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10025
+  # source://prism/lib/prism/node.rb#10025
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
   #
-  # source://prism//lib/prism/node.rb#10048
+  # source://prism/lib/prism/node.rb#10048
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -20972,20 +20972,20 @@ class Prism::ItLocalVariableReadNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#10053
+  # source://prism/lib/prism/node.rb#10053
   sig { override.returns(String) }
   def inspect; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#10058
+  # source://prism/lib/prism/node.rb#10058
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#10063
+    # source://prism/lib/prism/node.rb#10063
     def type; end
   end
 end
@@ -20995,62 +20995,62 @@ end
 #     -> { it + it }
 #     ^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#10078
+# source://prism/lib/prism/node.rb#10078
 class Prism::ItParametersNode < ::Prism::Node
   # Initialize a new ItParametersNode node.
   #
   # @return [ItParametersNode] a new instance of ItParametersNode
   #
-  # source://prism//lib/prism/node.rb#10080
+  # source://prism/lib/prism/node.rb#10080
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
   def initialize(source, node_id, location, flags); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#10137
+  # source://prism/lib/prism/node.rb#10137
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#10088
+  # source://prism/lib/prism/node.rb#10088
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10093
+  # source://prism/lib/prism/node.rb#10093
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#10103
+  # source://prism/lib/prism/node.rb#10103
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#10098
+  # source://prism/lib/prism/node.rb#10098
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> ItParametersNode
   #
-  # source://prism//lib/prism/node.rb#10108
+  # source://prism/lib/prism/node.rb#10108
   sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::ItParametersNode) }
   def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end
 
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10093
+  # source://prism/lib/prism/node.rb#10093
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
   #
-  # source://prism//lib/prism/node.rb#10116
+  # source://prism/lib/prism/node.rb#10116
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -21059,20 +21059,20 @@ class Prism::ItParametersNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#10121
+  # source://prism/lib/prism/node.rb#10121
   sig { override.returns(String) }
   def inspect; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#10126
+  # source://prism/lib/prism/node.rb#10126
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#10131
+    # source://prism/lib/prism/node.rb#10131
     def type; end
   end
 end
@@ -21082,13 +21082,13 @@ end
 #     foo(a: b)
 #         ^^^^
 #
-# source://prism//lib/prism/node.rb#10146
+# source://prism/lib/prism/node.rb#10146
 class Prism::KeywordHashNode < ::Prism::Node
   # Initialize a new KeywordHashNode node.
   #
   # @return [KeywordHashNode] a new instance of KeywordHashNode
   #
-  # source://prism//lib/prism/node.rb#10148
+  # source://prism/lib/prism/node.rb#10148
   sig do
     params(
       source: Prism::Source,
@@ -21103,36 +21103,36 @@ class Prism::KeywordHashNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#10214
+  # source://prism/lib/prism/node.rb#10214
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#10157
+  # source://prism/lib/prism/node.rb#10157
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10162
+  # source://prism/lib/prism/node.rb#10162
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#10172
+  # source://prism/lib/prism/node.rb#10172
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#10167
+  # source://prism/lib/prism/node.rb#10167
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?elements: Array[AssocNode | AssocSplatNode]) -> KeywordHashNode
   #
-  # source://prism//lib/prism/node.rb#10177
+  # source://prism/lib/prism/node.rb#10177
   sig do
     params(
       node_id: Integer,
@@ -21146,19 +21146,19 @@ class Prism::KeywordHashNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10162
+  # source://prism/lib/prism/node.rb#10162
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, elements: Array[AssocNode | AssocSplatNode] }
   #
-  # source://prism//lib/prism/node.rb#10185
+  # source://prism/lib/prism/node.rb#10185
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # attr_reader elements: Array[AssocNode | AssocSplatNode]
   #
-  # source://prism//lib/prism/node.rb#10195
+  # source://prism/lib/prism/node.rb#10195
   sig { returns(T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)]) }
   def elements; end
 
@@ -21167,7 +21167,7 @@ class Prism::KeywordHashNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#10198
+  # source://prism/lib/prism/node.rb#10198
   sig { override.returns(String) }
   def inspect; end
 
@@ -21175,32 +21175,32 @@ class Prism::KeywordHashNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#10190
+  # source://prism/lib/prism/node.rb#10190
   sig { returns(T::Boolean) }
   def symbol_keys?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#10203
+  # source://prism/lib/prism/node.rb#10203
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#10208
+    # source://prism/lib/prism/node.rb#10208
     def type; end
   end
 end
 
 # Flags for keyword hash nodes.
 #
-# source://prism//lib/prism/node.rb#16756
+# source://prism/lib/prism/node.rb#16756
 module Prism::KeywordHashNodeFlags; end
 
 # a keyword hash which only has `AssocNode` elements all with symbol keys, which means the elements can be treated as keyword arguments
 #
-# source://prism//lib/prism/node.rb#16758
+# source://prism/lib/prism/node.rb#16758
 Prism::KeywordHashNodeFlags::SYMBOL_KEYS = T.let(T.unsafe(nil), Integer)
 
 # Represents a keyword rest parameter to a method, block, or lambda definition.
@@ -21209,13 +21209,13 @@ Prism::KeywordHashNodeFlags::SYMBOL_KEYS = T.let(T.unsafe(nil), Integer)
 #           ^^^
 #     end
 #
-# source://prism//lib/prism/node.rb#10227
+# source://prism/lib/prism/node.rb#10227
 class Prism::KeywordRestParameterNode < ::Prism::Node
   # Initialize a new KeywordRestParameterNode node.
   #
   # @return [KeywordRestParameterNode] a new instance of KeywordRestParameterNode
   #
-  # source://prism//lib/prism/node.rb#10229
+  # source://prism/lib/prism/node.rb#10229
   sig do
     params(
       source: Prism::Source,
@@ -21232,36 +21232,36 @@ class Prism::KeywordRestParameterNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#10322
+  # source://prism/lib/prism/node.rb#10322
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#10240
+  # source://prism/lib/prism/node.rb#10240
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10245
+  # source://prism/lib/prism/node.rb#10245
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#10255
+  # source://prism/lib/prism/node.rb#10255
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#10250
+  # source://prism/lib/prism/node.rb#10250
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol?, ?name_loc: Location?, ?operator_loc: Location) -> KeywordRestParameterNode
   #
-  # source://prism//lib/prism/node.rb#10260
+  # source://prism/lib/prism/node.rb#10260
   sig do
     params(
       node_id: Integer,
@@ -21277,13 +21277,13 @@ class Prism::KeywordRestParameterNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10245
+  # source://prism/lib/prism/node.rb#10245
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol?, name_loc: Location?, operator_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#10268
+  # source://prism/lib/prism/node.rb#10268
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -21292,31 +21292,31 @@ class Prism::KeywordRestParameterNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#10306
+  # source://prism/lib/prism/node.rb#10306
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol?
   #
-  # source://prism//lib/prism/node.rb#10278
+  # source://prism/lib/prism/node.rb#10278
   sig { returns(T.nilable(Symbol)) }
   def name; end
 
   # attr_reader name_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#10281
+  # source://prism/lib/prism/node.rb#10281
   sig { returns(T.nilable(Prism::Location)) }
   def name_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#10301
+  # source://prism/lib/prism/node.rb#10301
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#10294
+  # source://prism/lib/prism/node.rb#10294
   sig { returns(Prism::Location) }
   def operator_loc; end
 
@@ -21324,20 +21324,20 @@ class Prism::KeywordRestParameterNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#10273
+  # source://prism/lib/prism/node.rb#10273
   sig { returns(T::Boolean) }
   def repeated_parameter?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#10311
+  # source://prism/lib/prism/node.rb#10311
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#10316
+    # source://prism/lib/prism/node.rb#10316
     def type; end
   end
 end
@@ -21347,13 +21347,13 @@ end
 #     ->(value) { value * 2 }
 #     ^^^^^^^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#10335
+# source://prism/lib/prism/node.rb#10335
 class Prism::LambdaNode < ::Prism::Node
   # Initialize a new LambdaNode node.
   #
   # @return [LambdaNode] a new instance of LambdaNode
   #
-  # source://prism//lib/prism/node.rb#10337
+  # source://prism/lib/prism/node.rb#10337
   sig do
     params(
       source: Prism::Source,
@@ -21373,54 +21373,54 @@ class Prism::LambdaNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#10448
+  # source://prism/lib/prism/node.rb#10448
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#10351
+  # source://prism/lib/prism/node.rb#10351
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader body: StatementsNode | BeginNode | nil
   #
-  # source://prism//lib/prism/node.rb#10414
+  # source://prism/lib/prism/node.rb#10414
   sig { returns(T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))) }
   def body; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10356
+  # source://prism/lib/prism/node.rb#10356
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String
   #
-  # source://prism//lib/prism/node.rb#10427
+  # source://prism/lib/prism/node.rb#10427
   sig { returns(String) }
   def closing; end
 
   # attr_reader closing_loc: Location
   #
-  # source://prism//lib/prism/node.rb#10404
+  # source://prism/lib/prism/node.rb#10404
   sig { returns(Prism::Location) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#10369
+  # source://prism/lib/prism/node.rb#10369
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#10361
+  # source://prism/lib/prism/node.rb#10361
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?locals: Array[Symbol], ?operator_loc: Location, ?opening_loc: Location, ?closing_loc: Location, ?parameters: BlockParametersNode | NumberedParametersNode | ItParametersNode | nil, ?body: StatementsNode | BeginNode | nil) -> LambdaNode
   #
-  # source://prism//lib/prism/node.rb#10374
+  # source://prism/lib/prism/node.rb#10374
   sig do
     params(
       node_id: Integer,
@@ -21439,13 +21439,13 @@ class Prism::LambdaNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10356
+  # source://prism/lib/prism/node.rb#10356
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, locals: Array[Symbol], operator_loc: Location, opening_loc: Location, closing_loc: Location, parameters: BlockParametersNode | NumberedParametersNode | ItParametersNode | nil, body: StatementsNode | BeginNode | nil }
   #
-  # source://prism//lib/prism/node.rb#10382
+  # source://prism/lib/prism/node.rb#10382
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -21454,56 +21454,56 @@ class Prism::LambdaNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#10432
+  # source://prism/lib/prism/node.rb#10432
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader locals: Array[Symbol]
   #
-  # source://prism//lib/prism/node.rb#10387
+  # source://prism/lib/prism/node.rb#10387
   sig { returns(T::Array[Symbol]) }
   def locals; end
 
   # def opening: () -> String
   #
-  # source://prism//lib/prism/node.rb#10422
+  # source://prism/lib/prism/node.rb#10422
   sig { returns(String) }
   def opening; end
 
   # attr_reader opening_loc: Location
   #
-  # source://prism//lib/prism/node.rb#10397
+  # source://prism/lib/prism/node.rb#10397
   sig { returns(Prism::Location) }
   def opening_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#10417
+  # source://prism/lib/prism/node.rb#10417
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#10390
+  # source://prism/lib/prism/node.rb#10390
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # attr_reader parameters: BlockParametersNode | NumberedParametersNode | ItParametersNode | nil
   #
-  # source://prism//lib/prism/node.rb#10411
+  # source://prism/lib/prism/node.rb#10411
   sig { returns(T.nilable(T.any(Prism::BlockParametersNode, Prism::NumberedParametersNode, Prism::ItParametersNode))) }
   def parameters; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#10437
+  # source://prism/lib/prism/node.rb#10437
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#10442
+    # source://prism/lib/prism/node.rb#10442
     def type; end
   end
 end
@@ -21514,33 +21514,33 @@ end
 # generally lines up. However, there are a few cases that require special
 # handling.
 #
-# source://prism//lib/prism/lex_compat.rb#12
+# source://prism/lib/prism/lex_compat.rb#12
 class Prism::LexCompat
   # @return [LexCompat] a new instance of LexCompat
   #
-  # source://prism//lib/prism/lex_compat.rb#619
+  # source://prism/lib/prism/lex_compat.rb#619
   def initialize(source, **options); end
 
   # Returns the value of attribute options.
   #
-  # source://prism//lib/prism/lex_compat.rb#617
+  # source://prism/lib/prism/lex_compat.rb#617
   def options; end
 
-  # source://prism//lib/prism/lex_compat.rb#624
+  # source://prism/lib/prism/lex_compat.rb#624
   def result; end
 
   # Returns the value of attribute source.
   #
-  # source://prism//lib/prism/lex_compat.rb#617
+  # source://prism/lib/prism/lex_compat.rb#617
   def source; end
 end
 
 # Ripper doesn't include the rest of the token in the event, so we need to
 # trim it down to just the content on the first line when comparing.
 #
-# source://prism//lib/prism/lex_compat.rb#230
+# source://prism/lib/prism/lex_compat.rb#230
 class Prism::LexCompat::EndContentToken < ::Prism::LexCompat::Token
-  # source://prism//lib/prism/lex_compat.rb#231
+  # source://prism/lib/prism/lex_compat.rb#231
   def ==(other); end
 end
 
@@ -21548,13 +21548,13 @@ end
 # heredoc that should be appended onto the list of tokens when the heredoc
 # closes.
 #
-# source://prism//lib/prism/lex_compat.rb#291
+# source://prism/lib/prism/lex_compat.rb#291
 module Prism::LexCompat::Heredoc
   class << self
     # Here we will split between the two types of heredocs and return the
     # object that will store their tokens.
     #
-    # source://prism//lib/prism/lex_compat.rb#603
+    # source://prism/lib/prism/lex_compat.rb#603
     def build(opening); end
   end
 end
@@ -21563,23 +21563,23 @@ end
 # that need to be split on "\\\n" to mimic Ripper's behavior. We also need
 # to keep track of the state that the heredoc was opened in.
 #
-# source://prism//lib/prism/lex_compat.rb#315
+# source://prism/lib/prism/lex_compat.rb#315
 class Prism::LexCompat::Heredoc::DashHeredoc
   # @return [DashHeredoc] a new instance of DashHeredoc
   #
-  # source://prism//lib/prism/lex_compat.rb#318
+  # source://prism/lib/prism/lex_compat.rb#318
   def initialize(split); end
 
-  # source://prism//lib/prism/lex_compat.rb#323
+  # source://prism/lib/prism/lex_compat.rb#323
   def <<(token); end
 
-  # source://prism//lib/prism/lex_compat.rb#316
+  # source://prism/lib/prism/lex_compat.rb#316
   def split; end
 
-  # source://prism//lib/prism/lex_compat.rb#327
+  # source://prism/lib/prism/lex_compat.rb#327
   def to_a; end
 
-  # source://prism//lib/prism/lex_compat.rb#316
+  # source://prism/lib/prism/lex_compat.rb#316
   def tokens; end
 end
 
@@ -21594,45 +21594,45 @@ end
 # some extra manipulation on the tokens to make them match Ripper's
 # output by mirroring the dedent logic that Ripper uses.
 #
-# source://prism//lib/prism/lex_compat.rb#374
+# source://prism/lib/prism/lex_compat.rb#374
 class Prism::LexCompat::Heredoc::DedentingHeredoc
   # @return [DedentingHeredoc] a new instance of DedentingHeredoc
   #
-  # source://prism//lib/prism/lex_compat.rb#379
+  # source://prism/lib/prism/lex_compat.rb#379
   def initialize; end
 
   # As tokens are coming in, we track the minimum amount of common leading
   # whitespace on plain string content tokens. This allows us to later
   # remove that amount of whitespace from the beginning of each line.
   #
-  # source://prism//lib/prism/lex_compat.rb#390
+  # source://prism/lib/prism/lex_compat.rb#390
   def <<(token); end
 
   # Returns the value of attribute dedent.
   #
-  # source://prism//lib/prism/lex_compat.rb#377
+  # source://prism/lib/prism/lex_compat.rb#377
   def dedent; end
 
   # Returns the value of attribute dedent_next.
   #
-  # source://prism//lib/prism/lex_compat.rb#377
+  # source://prism/lib/prism/lex_compat.rb#377
   def dedent_next; end
 
   # Returns the value of attribute embexpr_balance.
   #
-  # source://prism//lib/prism/lex_compat.rb#377
+  # source://prism/lib/prism/lex_compat.rb#377
   def embexpr_balance; end
 
-  # source://prism//lib/prism/lex_compat.rb#427
+  # source://prism/lib/prism/lex_compat.rb#427
   def to_a; end
 
   # Returns the value of attribute tokens.
   #
-  # source://prism//lib/prism/lex_compat.rb#377
+  # source://prism/lib/prism/lex_compat.rb#377
   def tokens; end
 end
 
-# source://prism//lib/prism/lex_compat.rb#375
+# source://prism/lib/prism/lex_compat.rb#375
 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.
@@ -21640,20 +21640,20 @@ Prism::LexCompat::Heredoc::DedentingHeredoc::TAB_WIDTH = T.let(T.unsafe(nil), In
 # order back into the token stream and set the state of the last token to
 # the state that the heredoc was opened in.
 #
-# source://prism//lib/prism/lex_compat.rb#296
+# source://prism/lib/prism/lex_compat.rb#296
 class Prism::LexCompat::Heredoc::PlainHeredoc
   # @return [PlainHeredoc] a new instance of PlainHeredoc
   #
-  # source://prism//lib/prism/lex_compat.rb#299
+  # source://prism/lib/prism/lex_compat.rb#299
   def initialize; end
 
-  # source://prism//lib/prism/lex_compat.rb#303
+  # source://prism/lib/prism/lex_compat.rb#303
   def <<(token); end
 
-  # source://prism//lib/prism/lex_compat.rb#307
+  # source://prism/lib/prism/lex_compat.rb#307
   def to_a; end
 
-  # source://prism//lib/prism/lex_compat.rb#297
+  # source://prism/lib/prism/lex_compat.rb#297
   def tokens; end
 end
 
@@ -21662,27 +21662,27 @@ end
 # through named captures in regular expressions). In that case we don't
 # compare the state.
 #
-# source://prism//lib/prism/lex_compat.rb#248
+# source://prism/lib/prism/lex_compat.rb#248
 class Prism::LexCompat::IdentToken < ::Prism::LexCompat::Token
-  # source://prism//lib/prism/lex_compat.rb#249
+  # source://prism/lib/prism/lex_compat.rb#249
   def ==(other); end
 end
 
 # Tokens where state should be ignored
 # used for :on_comment, :on_heredoc_end, :on_embexpr_end
 #
-# source://prism//lib/prism/lex_compat.rb#238
+# source://prism/lib/prism/lex_compat.rb#238
 class Prism::LexCompat::IgnoreStateToken < ::Prism::LexCompat::Token
-  # source://prism//lib/prism/lex_compat.rb#239
+  # source://prism/lib/prism/lex_compat.rb#239
   def ==(other); end
 end
 
 # Ignored newlines can occasionally have a LABEL state attached to them, so
 # we compare the state differently here.
 #
-# source://prism//lib/prism/lex_compat.rb#259
+# source://prism/lib/prism/lex_compat.rb#259
 class Prism::LexCompat::IgnoredNewlineToken < ::Prism::LexCompat::Token
-  # source://prism//lib/prism/lex_compat.rb#260
+  # source://prism/lib/prism/lex_compat.rb#260
   def ==(other); end
 end
 
@@ -21695,9 +21695,9 @@ end
 # more accurately, so we need to allow comparing against both END and
 # END|LABEL.
 #
-# source://prism//lib/prism/lex_compat.rb#279
+# source://prism/lib/prism/lex_compat.rb#279
 class Prism::LexCompat::ParamToken < ::Prism::LexCompat::Token
-  # source://prism//lib/prism/lex_compat.rb#280
+  # source://prism/lib/prism/lex_compat.rb#280
   def ==(other); end
 end
 
@@ -21705,28 +21705,28 @@ end
 # many-to-one mapping because we split up our token types, whereas Ripper
 # tends to group them.
 #
-# source://prism//lib/prism/lex_compat.rb#33
+# source://prism/lib/prism/lex_compat.rb#33
 Prism::LexCompat::RIPPER = T.let(T.unsafe(nil), Hash)
 
 # A result class specialized for holding tokens produced by the lexer.
 #
-# source://prism//lib/prism/lex_compat.rb#14
+# source://prism/lib/prism/lex_compat.rb#14
 class Prism::LexCompat::Result < ::Prism::Result
   # Create a new lex compat result object with the given values.
   #
   # @return [Result] a new instance of Result
   #
-  # source://prism//lib/prism/lex_compat.rb#19
+  # source://prism/lib/prism/lex_compat.rb#19
   def initialize(value, comments, magic_comments, data_loc, errors, warnings, source); end
 
   # Implement the hash pattern matching interface for Result.
   #
-  # source://prism//lib/prism/lex_compat.rb#25
+  # source://prism/lib/prism/lex_compat.rb#25
   def deconstruct_keys(keys); end
 
   # The list of tokens that were produced by the lexer.
   #
-  # source://prism//lib/prism/lex_compat.rb#16
+  # source://prism/lib/prism/lex_compat.rb#16
   def value; end
 end
 
@@ -21734,38 +21734,38 @@ end
 # However, we add a couple of convenience methods onto them to make them a
 # little easier to work with. We delegate all other methods to the array.
 #
-# source://prism//lib/prism/lex_compat.rb#204
+# source://prism/lib/prism/lex_compat.rb#204
 class Prism::LexCompat::Token < ::SimpleDelegator
   # The type of the token.
   #
-  # source://prism//lib/prism/lex_compat.rb#213
+  # source://prism/lib/prism/lex_compat.rb#213
   def event; end
 
   # The location of the token in the source.
   #
-  # source://prism//lib/prism/lex_compat.rb#208
+  # source://prism/lib/prism/lex_compat.rb#208
   def location; end
 
   # The state of the lexer when this token was produced.
   #
-  # source://prism//lib/prism/lex_compat.rb#223
+  # source://prism/lib/prism/lex_compat.rb#223
   def state; end
 
   # The slice of the source that this token represents.
   #
-  # source://prism//lib/prism/lex_compat.rb#218
+  # source://prism/lib/prism/lex_compat.rb#218
   def value; end
 end
 
 # This is a result specific to the `lex` and `lex_file` methods.
 #
-# source://prism//lib/prism/parse_result.rb#764
+# source://prism/lib/prism/parse_result.rb#764
 class Prism::LexResult < ::Prism::Result
   # Create a new lex result object with the given values.
   #
   # @return [LexResult] a new instance of LexResult
   #
-  # source://prism//lib/prism/parse_result.rb#769
+  # source://prism/lib/prism/parse_result.rb#769
   sig do
     params(
       value: T::Array[T.untyped],
@@ -21781,13 +21781,13 @@ class Prism::LexResult < ::Prism::Result
 
   # Implement the hash pattern matching interface for LexResult.
   #
-  # source://prism//lib/prism/parse_result.rb#775
+  # source://prism/lib/prism/parse_result.rb#775
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # The list of tokens that were parsed from the source code.
   #
-  # source://prism//lib/prism/parse_result.rb#766
+  # source://prism/lib/prism/parse_result.rb#766
   sig { returns(T::Array[T.untyped]) }
   def value; end
 end
@@ -21795,22 +21795,22 @@ end
 # This is a class that wraps the Ripper lexer to produce almost exactly the
 # same tokens.
 #
-# source://prism//lib/prism/lex_compat.rb#872
+# source://prism/lib/prism/lex_compat.rb#872
 class Prism::LexRipper
   # @return [LexRipper] a new instance of LexRipper
   #
-  # source://prism//lib/prism/lex_compat.rb#875
+  # source://prism/lib/prism/lex_compat.rb#875
   def initialize(source); end
 
-  # source://prism//lib/prism/lex_compat.rb#879
+  # source://prism/lib/prism/lex_compat.rb#879
   def result; end
 
-  # source://prism//lib/prism/lex_compat.rb#873
+  # source://prism/lib/prism/lex_compat.rb#873
   def source; end
 
   private
 
-  # source://prism//lib/prism/lex_compat.rb#913
+  # source://prism/lib/prism/lex_compat.rb#913
   def lex(source); end
 end
 
@@ -21819,13 +21819,13 @@ end
 #     target &&= value
 #     ^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#10464
+# source://prism/lib/prism/node.rb#10464
 class Prism::LocalVariableAndWriteNode < ::Prism::Node
   # Initialize a new LocalVariableAndWriteNode node.
   #
   # @return [LocalVariableAndWriteNode] a new instance of LocalVariableAndWriteNode
   #
-  # source://prism//lib/prism/node.rb#10466
+  # source://prism/lib/prism/node.rb#10466
   sig do
     params(
       source: Prism::Source,
@@ -21844,36 +21844,36 @@ class Prism::LocalVariableAndWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#10556
+  # source://prism/lib/prism/node.rb#10556
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#10479
+  # source://prism/lib/prism/node.rb#10479
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10484
+  # source://prism/lib/prism/node.rb#10484
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#10494
+  # source://prism/lib/prism/node.rb#10494
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#10489
+  # source://prism/lib/prism/node.rb#10489
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?name: Symbol, ?depth: Integer) -> LocalVariableAndWriteNode
   #
-  # source://prism//lib/prism/node.rb#10499
+  # source://prism/lib/prism/node.rb#10499
   sig do
     params(
       node_id: Integer,
@@ -21891,23 +21891,23 @@ class Prism::LocalVariableAndWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10484
+  # source://prism/lib/prism/node.rb#10484
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name_loc: Location, operator_loc: Location, value: Prism::node, name: Symbol, depth: Integer }
   #
-  # source://prism//lib/prism/node.rb#10507
+  # source://prism/lib/prism/node.rb#10507
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # attr_reader depth: Integer
   #
-  # source://prism//lib/prism/node.rb#10532
+  # source://prism/lib/prism/node.rb#10532
   sig { returns(Integer) }
   def depth; end
 
-  # source://prism//lib/prism/desugar_compiler.rb#236
+  # source://prism/lib/prism/desugar_compiler.rb#236
   def desugar; end
 
   sig { override.returns(T::Array[Prism::Reflection::Field]) }
@@ -21915,50 +21915,50 @@ class Prism::LocalVariableAndWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#10540
+  # source://prism/lib/prism/node.rb#10540
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#10529
+  # source://prism/lib/prism/node.rb#10529
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#10512
+  # source://prism/lib/prism/node.rb#10512
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#10535
+  # source://prism/lib/prism/node.rb#10535
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#10519
+  # source://prism/lib/prism/node.rb#10519
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#10545
+  # source://prism/lib/prism/node.rb#10545
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#10526
+  # source://prism/lib/prism/node.rb#10526
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#10550
+    # source://prism/lib/prism/node.rb#10550
     def type; end
   end
 end
@@ -21968,13 +21968,13 @@ end
 #     target += value
 #     ^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#10570
+# source://prism/lib/prism/node.rb#10570
 class Prism::LocalVariableOperatorWriteNode < ::Prism::Node
   # Initialize a new LocalVariableOperatorWriteNode node.
   #
   # @return [LocalVariableOperatorWriteNode] a new instance of LocalVariableOperatorWriteNode
   #
-  # source://prism//lib/prism/node.rb#10572
+  # source://prism/lib/prism/node.rb#10572
   sig do
     params(
       source: Prism::Source,
@@ -21994,48 +21994,48 @@ class Prism::LocalVariableOperatorWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#10661
+  # source://prism/lib/prism/node.rb#10661
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#10586
+  # source://prism/lib/prism/node.rb#10586
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader binary_operator: Symbol
   #
-  # source://prism//lib/prism/node.rb#10639
+  # source://prism/lib/prism/node.rb#10639
   sig { returns(Symbol) }
   def binary_operator; end
 
   # attr_reader binary_operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#10626
+  # source://prism/lib/prism/node.rb#10626
   sig { returns(Prism::Location) }
   def binary_operator_loc; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10591
+  # source://prism/lib/prism/node.rb#10591
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#10601
+  # source://prism/lib/prism/node.rb#10601
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#10596
+  # source://prism/lib/prism/node.rb#10596
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?name: Symbol, ?binary_operator: Symbol, ?depth: Integer) -> LocalVariableOperatorWriteNode
   #
-  # source://prism//lib/prism/node.rb#10606
+  # source://prism/lib/prism/node.rb#10606
   sig do
     params(
       node_id: Integer,
@@ -22054,23 +22054,23 @@ class Prism::LocalVariableOperatorWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10591
+  # source://prism/lib/prism/node.rb#10591
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name_loc: Location, binary_operator_loc: Location, value: Prism::node, name: Symbol, binary_operator: Symbol, depth: Integer }
   #
-  # source://prism//lib/prism/node.rb#10614
+  # source://prism/lib/prism/node.rb#10614
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # attr_reader depth: Integer
   #
-  # source://prism//lib/prism/node.rb#10642
+  # source://prism/lib/prism/node.rb#10642
   sig { returns(Integer) }
   def depth; end
 
-  # source://prism//lib/prism/desugar_compiler.rb#248
+  # source://prism/lib/prism/desugar_compiler.rb#248
   def desugar; end
 
   sig { override.returns(T::Array[Prism::Reflection::Field]) }
@@ -22078,50 +22078,50 @@ class Prism::LocalVariableOperatorWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#10645
+  # source://prism/lib/prism/node.rb#10645
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#10636
+  # source://prism/lib/prism/node.rb#10636
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#10619
+  # source://prism/lib/prism/node.rb#10619
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # Returns the binary operator used to modify the receiver. This method is
   # deprecated in favor of #binary_operator.
   #
-  # source://prism//lib/prism/node_ext.rb#451
+  # source://prism/lib/prism/node_ext.rb#451
   def operator; end
 
   # Returns the location of the binary operator used to modify the receiver.
   # This method is deprecated in favor of #binary_operator_loc.
   #
-  # source://prism//lib/prism/node_ext.rb#458
+  # source://prism/lib/prism/node_ext.rb#458
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#10650
+  # source://prism/lib/prism/node.rb#10650
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#10633
+  # source://prism/lib/prism/node.rb#10633
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#10655
+    # source://prism/lib/prism/node.rb#10655
     def type; end
   end
 end
@@ -22131,13 +22131,13 @@ end
 #     target ||= value
 #     ^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#10676
+# source://prism/lib/prism/node.rb#10676
 class Prism::LocalVariableOrWriteNode < ::Prism::Node
   # Initialize a new LocalVariableOrWriteNode node.
   #
   # @return [LocalVariableOrWriteNode] a new instance of LocalVariableOrWriteNode
   #
-  # source://prism//lib/prism/node.rb#10678
+  # source://prism/lib/prism/node.rb#10678
   sig do
     params(
       source: Prism::Source,
@@ -22156,36 +22156,36 @@ class Prism::LocalVariableOrWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#10768
+  # source://prism/lib/prism/node.rb#10768
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#10691
+  # source://prism/lib/prism/node.rb#10691
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10696
+  # source://prism/lib/prism/node.rb#10696
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#10706
+  # source://prism/lib/prism/node.rb#10706
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#10701
+  # source://prism/lib/prism/node.rb#10701
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?name: Symbol, ?depth: Integer) -> LocalVariableOrWriteNode
   #
-  # source://prism//lib/prism/node.rb#10711
+  # source://prism/lib/prism/node.rb#10711
   sig do
     params(
       node_id: Integer,
@@ -22203,23 +22203,23 @@ class Prism::LocalVariableOrWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10696
+  # source://prism/lib/prism/node.rb#10696
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name_loc: Location, operator_loc: Location, value: Prism::node, name: Symbol, depth: Integer }
   #
-  # source://prism//lib/prism/node.rb#10719
+  # source://prism/lib/prism/node.rb#10719
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # attr_reader depth: Integer
   #
-  # source://prism//lib/prism/node.rb#10744
+  # source://prism/lib/prism/node.rb#10744
   sig { returns(Integer) }
   def depth; end
 
-  # source://prism//lib/prism/desugar_compiler.rb#242
+  # source://prism/lib/prism/desugar_compiler.rb#242
   def desugar; end
 
   sig { override.returns(T::Array[Prism::Reflection::Field]) }
@@ -22227,50 +22227,50 @@ class Prism::LocalVariableOrWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#10752
+  # source://prism/lib/prism/node.rb#10752
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#10741
+  # source://prism/lib/prism/node.rb#10741
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#10724
+  # source://prism/lib/prism/node.rb#10724
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#10747
+  # source://prism/lib/prism/node.rb#10747
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#10731
+  # source://prism/lib/prism/node.rb#10731
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#10757
+  # source://prism/lib/prism/node.rb#10757
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#10738
+  # source://prism/lib/prism/node.rb#10738
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#10762
+    # source://prism/lib/prism/node.rb#10762
     def type; end
   end
 end
@@ -22280,13 +22280,13 @@ end
 #     foo
 #     ^^^
 #
-# source://prism//lib/prism/node.rb#10782
+# source://prism/lib/prism/node.rb#10782
 class Prism::LocalVariableReadNode < ::Prism::Node
   # Initialize a new LocalVariableReadNode node.
   #
   # @return [LocalVariableReadNode] a new instance of LocalVariableReadNode
   #
-  # source://prism//lib/prism/node.rb#10784
+  # source://prism/lib/prism/node.rb#10784
   sig do
     params(
       source: Prism::Source,
@@ -22302,36 +22302,36 @@ class Prism::LocalVariableReadNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#10863
+  # source://prism/lib/prism/node.rb#10863
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#10794
+  # source://prism/lib/prism/node.rb#10794
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10799
+  # source://prism/lib/prism/node.rb#10799
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#10809
+  # source://prism/lib/prism/node.rb#10809
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#10804
+  # source://prism/lib/prism/node.rb#10804
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?depth: Integer) -> LocalVariableReadNode
   #
-  # source://prism//lib/prism/node.rb#10814
+  # source://prism/lib/prism/node.rb#10814
   sig do
     params(
       node_id: Integer,
@@ -22346,13 +22346,13 @@ class Prism::LocalVariableReadNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10799
+  # source://prism/lib/prism/node.rb#10799
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, depth: Integer }
   #
-  # source://prism//lib/prism/node.rb#10822
+  # source://prism/lib/prism/node.rb#10822
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -22364,7 +22364,7 @@ class Prism::LocalVariableReadNode < ::Prism::Node
   #
   # The specific rules for calculating the depth may differ from individual Ruby implementations, as they are not specified by the language. For more information, see [the Prism documentation](https://github.com/ruby/prism/blob/main/docs/local_variable_depth.md).
   #
-  # source://prism//lib/prism/node.rb#10844
+  # source://prism/lib/prism/node.rb#10844
   sig { returns(Integer) }
   def depth; end
 
@@ -22373,7 +22373,7 @@ class Prism::LocalVariableReadNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#10847
+  # source://prism/lib/prism/node.rb#10847
   sig { override.returns(String) }
   def inspect; end
 
@@ -22387,20 +22387,20 @@ class Prism::LocalVariableReadNode < ::Prism::Node
   #
   #     _1     # name `:_1`
   #
-  # source://prism//lib/prism/node.rb#10835
+  # source://prism/lib/prism/node.rb#10835
   sig { returns(Symbol) }
   def name; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#10852
+  # source://prism/lib/prism/node.rb#10852
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#10857
+    # source://prism/lib/prism/node.rb#10857
     def type; end
   end
 end
@@ -22410,13 +22410,13 @@ end
 #     foo, bar = baz
 #     ^^^  ^^^
 #
-# source://prism//lib/prism/node.rb#10874
+# source://prism/lib/prism/node.rb#10874
 class Prism::LocalVariableTargetNode < ::Prism::Node
   # Initialize a new LocalVariableTargetNode node.
   #
   # @return [LocalVariableTargetNode] a new instance of LocalVariableTargetNode
   #
-  # source://prism//lib/prism/node.rb#10876
+  # source://prism/lib/prism/node.rb#10876
   sig do
     params(
       source: Prism::Source,
@@ -22432,36 +22432,36 @@ class Prism::LocalVariableTargetNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#10941
+  # source://prism/lib/prism/node.rb#10941
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#10886
+  # source://prism/lib/prism/node.rb#10886
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10891
+  # source://prism/lib/prism/node.rb#10891
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#10901
+  # source://prism/lib/prism/node.rb#10901
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#10896
+  # source://prism/lib/prism/node.rb#10896
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?depth: Integer) -> LocalVariableTargetNode
   #
-  # source://prism//lib/prism/node.rb#10906
+  # source://prism/lib/prism/node.rb#10906
   sig do
     params(
       node_id: Integer,
@@ -22476,19 +22476,19 @@ class Prism::LocalVariableTargetNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10891
+  # source://prism/lib/prism/node.rb#10891
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, depth: Integer }
   #
-  # source://prism//lib/prism/node.rb#10914
+  # source://prism/lib/prism/node.rb#10914
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # attr_reader depth: Integer
   #
-  # source://prism//lib/prism/node.rb#10922
+  # source://prism/lib/prism/node.rb#10922
   sig { returns(Integer) }
   def depth; end
 
@@ -22497,26 +22497,26 @@ class Prism::LocalVariableTargetNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#10925
+  # source://prism/lib/prism/node.rb#10925
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#10919
+  # source://prism/lib/prism/node.rb#10919
   sig { returns(Symbol) }
   def name; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#10930
+  # source://prism/lib/prism/node.rb#10930
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#10935
+    # source://prism/lib/prism/node.rb#10935
     def type; end
   end
 end
@@ -22526,13 +22526,13 @@ end
 #     foo = 1
 #     ^^^^^^^
 #
-# source://prism//lib/prism/node.rb#10952
+# source://prism/lib/prism/node.rb#10952
 class Prism::LocalVariableWriteNode < ::Prism::Node
   # Initialize a new LocalVariableWriteNode node.
   #
   # @return [LocalVariableWriteNode] a new instance of LocalVariableWriteNode
   #
-  # source://prism//lib/prism/node.rb#10954
+  # source://prism/lib/prism/node.rb#10954
   sig do
     params(
       source: Prism::Source,
@@ -22551,36 +22551,36 @@ class Prism::LocalVariableWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#11070
+  # source://prism/lib/prism/node.rb#11070
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#10967
+  # source://prism/lib/prism/node.rb#10967
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10972
+  # source://prism/lib/prism/node.rb#10972
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#10982
+  # source://prism/lib/prism/node.rb#10982
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#10977
+  # source://prism/lib/prism/node.rb#10977
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?depth: Integer, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location) -> LocalVariableWriteNode
   #
-  # source://prism//lib/prism/node.rb#10987
+  # source://prism/lib/prism/node.rb#10987
   sig do
     params(
       node_id: Integer,
@@ -22598,13 +22598,13 @@ class Prism::LocalVariableWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#10972
+  # source://prism/lib/prism/node.rb#10972
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, depth: Integer, name_loc: Location, value: Prism::node, operator_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#10995
+  # source://prism/lib/prism/node.rb#10995
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -22616,7 +22616,7 @@ class Prism::LocalVariableWriteNode < ::Prism::Node
   #
   # The specific rules for calculating the depth may differ from individual Ruby implementations, as they are not specified by the language. For more information, see [the Prism documentation](https://github.com/ruby/prism/blob/main/docs/local_variable_depth.md).
   #
-  # source://prism//lib/prism/node.rb#11013
+  # source://prism/lib/prism/node.rb#11013
   sig { returns(Integer) }
   def depth; end
 
@@ -22625,7 +22625,7 @@ class Prism::LocalVariableWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#11054
+  # source://prism/lib/prism/node.rb#11054
   sig { override.returns(String) }
   def inspect; end
 
@@ -22635,7 +22635,7 @@ class Prism::LocalVariableWriteNode < ::Prism::Node
   #
   #     abc = 123  # name `:abc`
   #
-  # source://prism//lib/prism/node.rb#11004
+  # source://prism/lib/prism/node.rb#11004
   sig { returns(Symbol) }
   def name; end
 
@@ -22644,13 +22644,13 @@ class Prism::LocalVariableWriteNode < ::Prism::Node
   #     foo = :bar
   #     ^^^
   #
-  # source://prism//lib/prism/node.rb#11019
+  # source://prism/lib/prism/node.rb#11019
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#11049
+  # source://prism/lib/prism/node.rb#11049
   sig { returns(String) }
   def operator; end
 
@@ -22659,13 +22659,13 @@ class Prism::LocalVariableWriteNode < ::Prism::Node
   #     x = :y
   #       ^
   #
-  # source://prism//lib/prism/node.rb#11042
+  # source://prism/lib/prism/node.rb#11042
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#11059
+  # source://prism/lib/prism/node.rb#11059
   sig { override.returns(Symbol) }
   def type; end
 
@@ -22681,34 +22681,34 @@ class Prism::LocalVariableWriteNode < ::Prism::Node
   #
   #     foo = foo
   #
-  # source://prism//lib/prism/node.rb#11036
+  # source://prism/lib/prism/node.rb#11036
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#11064
+    # source://prism/lib/prism/node.rb#11064
     def type; end
   end
 end
 
 # This represents a location in the source.
 #
-# source://prism//lib/prism/parse_result.rb#273
+# source://prism/lib/prism/parse_result.rb#273
 class Prism::Location
   # Create a new location object with the given source, start byte offset, and
   # byte length.
   #
   # @return [Location] a new instance of Location
   #
-  # source://prism//lib/prism/parse_result.rb#288
+  # source://prism/lib/prism/parse_result.rb#288
   sig { params(source: Prism::Source, start_offset: Integer, length: Integer).void }
   def initialize(source, start_offset, length); end
 
   # Returns true if the given other location is equal to this location.
   #
-  # source://prism//lib/prism/parse_result.rb#476
+  # source://prism/lib/prism/parse_result.rb#476
   sig { params(other: T.untyped).returns(T::Boolean) }
   def ==(other); end
 
@@ -22716,14 +22716,14 @@ class Prism::Location
   # that occurs after this location on the same line, and return the new
   # location. This will raise an error if the string does not exist.
   #
-  # source://prism//lib/prism/parse_result.rb#495
+  # source://prism/lib/prism/parse_result.rb#495
   sig { params(string: String).returns(Prism::Location) }
   def adjoin(string); end
 
   # The end column in code units using the given cache to fetch or calculate
   # the value.
   #
-  # source://prism//lib/prism/parse_result.rb#461
+  # source://prism/lib/prism/parse_result.rb#461
   sig do
     params(
       cache: T.any(Prism::CodeUnitsCache, T.proc.params(byte_offset: Integer).returns(Integer))
@@ -22734,7 +22734,7 @@ class Prism::Location
   # The end offset from the start of the file in code units using the given
   # cache to fetch or calculate the value.
   #
-  # source://prism//lib/prism/parse_result.rb#397
+  # source://prism/lib/prism/parse_result.rb#397
   sig do
     params(
       cache: T.any(Prism::CodeUnitsCache, T.proc.params(byte_offset: Integer).returns(Integer))
@@ -22745,7 +22745,7 @@ class Prism::Location
   # The start column in code units using the given cache to fetch or calculate
   # the value.
   #
-  # source://prism//lib/prism/parse_result.rb#437
+  # source://prism/lib/prism/parse_result.rb#437
   sig do
     params(
       cache: T.any(Prism::CodeUnitsCache, T.proc.params(byte_offset: Integer).returns(Integer))
@@ -22756,7 +22756,7 @@ class Prism::Location
   # The start offset from the start of the file in code units using the given
   # cache to fetch or calculate the value.
   #
-  # source://prism//lib/prism/parse_result.rb#375
+  # source://prism/lib/prism/parse_result.rb#375
   sig do
     params(
       cache: T.any(Prism::CodeUnitsCache, T.proc.params(byte_offset: Integer).returns(Integer))
@@ -22766,78 +22766,78 @@ class Prism::Location
 
   # Returns a new location that is the result of chopping off the last byte.
   #
-  # source://prism//lib/prism/parse_result.rb#334
+  # source://prism/lib/prism/parse_result.rb#334
   sig { returns(Prism::Location) }
   def chop; end
 
   # Returns all comments that are associated with this location (both leading
   # and trailing comments).
   #
-  # source://prism//lib/prism/parse_result.rb#324
+  # source://prism/lib/prism/parse_result.rb#324
   sig { returns(T::Array[Prism::Comment]) }
   def comments; end
 
   # Create a new location object with the given options.
   #
-  # source://prism//lib/prism/parse_result.rb#329
+  # source://prism/lib/prism/parse_result.rb#329
   sig { params(source: Prism::Source, start_offset: Integer, length: Integer).returns(Prism::Location) }
   def copy(source: T.unsafe(nil), start_offset: T.unsafe(nil), length: T.unsafe(nil)); end
 
   # Implement the hash pattern matching interface for Location.
   #
-  # source://prism//lib/prism/parse_result.rb#466
+  # source://prism/lib/prism/parse_result.rb#466
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # The column number in characters where this location ends from the start of
   # the line.
   #
-  # source://prism//lib/prism/parse_result.rb#449
+  # source://prism/lib/prism/parse_result.rb#449
   sig { returns(Integer) }
   def end_character_column; end
 
   # The character offset from the beginning of the source where this location
   # ends.
   #
-  # source://prism//lib/prism/parse_result.rb#386
+  # source://prism/lib/prism/parse_result.rb#386
   sig { returns(Integer) }
   def end_character_offset; end
 
   # The column number in code units of the given encoding where this location
   # ends from the start of the line.
   #
-  # source://prism//lib/prism/parse_result.rb#455
+  # source://prism/lib/prism/parse_result.rb#455
   sig { params(encoding: Encoding).returns(Integer) }
   def end_code_units_column(encoding = T.unsafe(nil)); end
 
   # The offset from the start of the file in code units of the given encoding.
   #
-  # source://prism//lib/prism/parse_result.rb#391
+  # source://prism/lib/prism/parse_result.rb#391
   sig { params(encoding: Encoding).returns(Integer) }
   def end_code_units_offset(encoding = T.unsafe(nil)); end
 
   # The column number in bytes where this location ends from the start of the
   # line.
   #
-  # source://prism//lib/prism/parse_result.rb#443
+  # source://prism/lib/prism/parse_result.rb#443
   sig { returns(Integer) }
   def end_column; end
 
   # The line number where this location ends.
   #
-  # source://prism//lib/prism/parse_result.rb#413
+  # source://prism/lib/prism/parse_result.rb#413
   sig { returns(Integer) }
   def end_line; end
 
   # The byte offset from the beginning of the source where this location ends.
   #
-  # source://prism//lib/prism/parse_result.rb#380
+  # source://prism/lib/prism/parse_result.rb#380
   sig { returns(Integer) }
   def end_offset; end
 
   # Returns a string representation of this location.
   #
-  # source://prism//lib/prism/parse_result.rb#339
+  # source://prism/lib/prism/parse_result.rb#339
   sig { returns(String) }
   def inspect; end
 
@@ -22845,38 +22845,38 @@ class Prism::Location
   # other location. Raises an error if this location is not before the other
   # location or if they don't share the same source.
   #
-  # source://prism//lib/prism/parse_result.rb#485
+  # source://prism/lib/prism/parse_result.rb#485
   sig { params(other: Prism::Location).returns(Prism::Location) }
   def join(other); end
 
   # Attach a comment to the leading comments of this location.
   #
-  # source://prism//lib/prism/parse_result.rb#307
+  # source://prism/lib/prism/parse_result.rb#307
   sig { params(comment: Prism::Comment).void }
   def leading_comment(comment); end
 
   # These are the comments that are associated with this location that exist
   # before the start of this location.
   #
-  # source://prism//lib/prism/parse_result.rb#302
+  # source://prism/lib/prism/parse_result.rb#302
   sig { returns(T::Array[Prism::Comment]) }
   def leading_comments; end
 
   # The length of this location in bytes.
   #
-  # source://prism//lib/prism/parse_result.rb#284
+  # source://prism/lib/prism/parse_result.rb#284
   sig { returns(Integer) }
   def length; end
 
   # Implement the pretty print interface for Location.
   #
-  # source://prism//lib/prism/parse_result.rb#471
+  # source://prism/lib/prism/parse_result.rb#471
   sig { params(q: T.untyped).void }
   def pretty_print(q); end
 
   # The source code that this location represents.
   #
-  # source://prism//lib/prism/parse_result.rb#349
+  # source://prism/lib/prism/parse_result.rb#349
   sig { returns(String) }
   def slice; end
 
@@ -22884,78 +22884,78 @@ class Prism::Location
   # of the line that this location starts on to the end of the line that this
   # location ends on.
   #
-  # source://prism//lib/prism/parse_result.rb#356
+  # source://prism/lib/prism/parse_result.rb#356
   def slice_lines; end
 
   # Returns all of the lines of the source code associated with this location.
   #
-  # source://prism//lib/prism/parse_result.rb#344
+  # source://prism/lib/prism/parse_result.rb#344
   sig { returns(T::Array[String]) }
   def source_lines; end
 
   # The column number in characters where this location ends from the start of
   # the line.
   #
-  # source://prism//lib/prism/parse_result.rb#425
+  # source://prism/lib/prism/parse_result.rb#425
   sig { returns(Integer) }
   def start_character_column; end
 
   # The character offset from the beginning of the source where this location
   # starts.
   #
-  # source://prism//lib/prism/parse_result.rb#364
+  # source://prism/lib/prism/parse_result.rb#364
   sig { returns(Integer) }
   def start_character_offset; end
 
   # The column number in code units of the given encoding where this location
   # starts from the start of the line.
   #
-  # source://prism//lib/prism/parse_result.rb#431
+  # source://prism/lib/prism/parse_result.rb#431
   sig { params(encoding: Encoding).returns(Integer) }
   def start_code_units_column(encoding = T.unsafe(nil)); end
 
   # The offset from the start of the file in code units of the given encoding.
   #
-  # source://prism//lib/prism/parse_result.rb#369
+  # source://prism/lib/prism/parse_result.rb#369
   sig { params(encoding: Encoding).returns(Integer) }
   def start_code_units_offset(encoding = T.unsafe(nil)); end
 
   # The column number in bytes where this location starts from the start of
   # the line.
   #
-  # source://prism//lib/prism/parse_result.rb#419
+  # source://prism/lib/prism/parse_result.rb#419
   sig { returns(Integer) }
   def start_column; end
 
   # The line number where this location starts.
   #
-  # source://prism//lib/prism/parse_result.rb#402
+  # source://prism/lib/prism/parse_result.rb#402
   sig { returns(Integer) }
   def start_line; end
 
   # The content of the line where this location starts before this location.
   #
-  # source://prism//lib/prism/parse_result.rb#407
+  # source://prism/lib/prism/parse_result.rb#407
   sig { returns(String) }
   def start_line_slice; end
 
   # The byte offset from the beginning of the source where this location
   # starts.
   #
-  # source://prism//lib/prism/parse_result.rb#281
+  # source://prism/lib/prism/parse_result.rb#281
   sig { returns(Integer) }
   def start_offset; end
 
   # Attach a comment to the trailing comments of this location.
   #
-  # source://prism//lib/prism/parse_result.rb#318
+  # source://prism/lib/prism/parse_result.rb#318
   sig { params(comment: Prism::Comment).void }
   def trailing_comment(comment); end
 
   # These are the comments that are associated with this location that exist
   # after the end of this location.
   #
-  # source://prism//lib/prism/parse_result.rb#313
+  # source://prism/lib/prism/parse_result.rb#313
   sig { returns(T::Array[Prism::Comment]) }
   def trailing_comments; end
 
@@ -22964,66 +22964,66 @@ class Prism::Location
   # A Source object that is used to determine more information from the given
   # offset and length.
   #
-  # source://prism//lib/prism/parse_result.rb#276
+  # source://prism/lib/prism/parse_result.rb#276
   sig { returns(Prism::Source) }
   def source; end
 end
 
 # Flags for while and until loop nodes.
 #
-# source://prism//lib/prism/node.rb#16762
+# source://prism/lib/prism/node.rb#16762
 module Prism::LoopFlags; end
 
 # a loop after a begin statement, so the body is executed first before the condition
 #
-# source://prism//lib/prism/node.rb#16764
+# source://prism/lib/prism/node.rb#16764
 Prism::LoopFlags::BEGIN_MODIFIER = T.let(T.unsafe(nil), Integer)
 
 # This represents a magic comment that was encountered during parsing.
 #
-# source://prism//lib/prism/parse_result.rb#557
+# source://prism/lib/prism/parse_result.rb#557
 class Prism::MagicComment
   # Create a new magic comment object with the given key and value locations.
   #
   # @return [MagicComment] a new instance of MagicComment
   #
-  # source://prism//lib/prism/parse_result.rb#565
+  # source://prism/lib/prism/parse_result.rb#565
   sig { params(key_loc: Prism::Location, value_loc: Prism::Location).void }
   def initialize(key_loc, value_loc); end
 
   # Implement the hash pattern matching interface for MagicComment.
   #
-  # source://prism//lib/prism/parse_result.rb#581
+  # source://prism/lib/prism/parse_result.rb#581
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # Returns a string representation of this magic comment.
   #
-  # source://prism//lib/prism/parse_result.rb#586
+  # source://prism/lib/prism/parse_result.rb#586
   sig { returns(String) }
   def inspect; end
 
   # Returns the key of the magic comment by slicing it from the source code.
   #
-  # source://prism//lib/prism/parse_result.rb#571
+  # source://prism/lib/prism/parse_result.rb#571
   sig { returns(String) }
   def key; end
 
   # A Location object representing the location of the key in the source.
   #
-  # source://prism//lib/prism/parse_result.rb#559
+  # source://prism/lib/prism/parse_result.rb#559
   sig { returns(Prism::Location) }
   def key_loc; end
 
   # Returns the value of the magic comment by slicing it from the source code.
   #
-  # source://prism//lib/prism/parse_result.rb#576
+  # source://prism/lib/prism/parse_result.rb#576
   sig { returns(String) }
   def value; end
 
   # A Location object representing the location of the value in the source.
   #
-  # source://prism//lib/prism/parse_result.rb#562
+  # source://prism/lib/prism/parse_result.rb#562
   sig { returns(Prism::Location) }
   def value_loc; end
 end
@@ -23033,7 +23033,7 @@ end
 #     if /foo/i then end
 #        ^^^^^^
 #
-# source://prism//lib/prism/node.rb#11084
+# source://prism/lib/prism/node.rb#11084
 class Prism::MatchLastLineNode < ::Prism::Node
   include ::Prism::RegularExpressionOptions
 
@@ -23041,7 +23041,7 @@ class Prism::MatchLastLineNode < ::Prism::Node
   #
   # @return [MatchLastLineNode] a new instance of MatchLastLineNode
   #
-  # source://prism//lib/prism/node.rb#11086
+  # source://prism/lib/prism/node.rb#11086
   sig do
     params(
       source: Prism::Source,
@@ -23059,12 +23059,12 @@ class Prism::MatchLastLineNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#11241
+  # source://prism/lib/prism/node.rb#11241
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#11098
+  # source://prism/lib/prism/node.rb#11098
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
@@ -23072,55 +23072,55 @@ class Prism::MatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#11156
+  # source://prism/lib/prism/node.rb#11156
   sig { returns(T::Boolean) }
   def ascii_8bit?; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#11103
+  # source://prism/lib/prism/node.rb#11103
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String
   #
-  # source://prism//lib/prism/node.rb#11220
+  # source://prism/lib/prism/node.rb#11220
   sig { returns(String) }
   def closing; end
 
   # attr_reader closing_loc: Location
   #
-  # source://prism//lib/prism/node.rb#11200
+  # source://prism/lib/prism/node.rb#11200
   sig { returns(Prism::Location) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#11113
+  # source://prism/lib/prism/node.rb#11113
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#11108
+  # source://prism/lib/prism/node.rb#11108
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def content: () -> String
   #
-  # source://prism//lib/prism/node.rb#11215
+  # source://prism/lib/prism/node.rb#11215
   sig { returns(String) }
   def content; end
 
   # attr_reader content_loc: Location
   #
-  # source://prism//lib/prism/node.rb#11193
+  # source://prism/lib/prism/node.rb#11193
   sig { returns(Prism::Location) }
   def content_loc; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?content_loc: Location, ?closing_loc: Location, ?unescaped: String) -> MatchLastLineNode
   #
-  # source://prism//lib/prism/node.rb#11118
+  # source://prism/lib/prism/node.rb#11118
   sig do
     params(
       node_id: Integer,
@@ -23137,13 +23137,13 @@ class Prism::MatchLastLineNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#11103
+  # source://prism/lib/prism/node.rb#11103
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String }
   #
-  # source://prism//lib/prism/node.rb#11126
+  # source://prism/lib/prism/node.rb#11126
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -23151,7 +23151,7 @@ class Prism::MatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#11151
+  # source://prism/lib/prism/node.rb#11151
   sig { returns(T::Boolean) }
   def euc_jp?; end
 
@@ -23159,7 +23159,7 @@ class Prism::MatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#11136
+  # source://prism/lib/prism/node.rb#11136
   sig { returns(T::Boolean) }
   def extended?; end
 
@@ -23170,7 +23170,7 @@ class Prism::MatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#11176
+  # source://prism/lib/prism/node.rb#11176
   sig { returns(T::Boolean) }
   def forced_binary_encoding?; end
 
@@ -23178,7 +23178,7 @@ class Prism::MatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#11181
+  # source://prism/lib/prism/node.rb#11181
   sig { returns(T::Boolean) }
   def forced_us_ascii_encoding?; end
 
@@ -23186,7 +23186,7 @@ class Prism::MatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#11171
+  # source://prism/lib/prism/node.rb#11171
   sig { returns(T::Boolean) }
   def forced_utf8_encoding?; end
 
@@ -23194,13 +23194,13 @@ class Prism::MatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#11131
+  # source://prism/lib/prism/node.rb#11131
   sig { returns(T::Boolean) }
   def ignore_case?; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#11225
+  # source://prism/lib/prism/node.rb#11225
   sig { override.returns(String) }
   def inspect; end
 
@@ -23208,7 +23208,7 @@ class Prism::MatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#11141
+  # source://prism/lib/prism/node.rb#11141
   sig { returns(T::Boolean) }
   def multi_line?; end
 
@@ -23216,19 +23216,19 @@ class Prism::MatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#11146
+  # source://prism/lib/prism/node.rb#11146
   sig { returns(T::Boolean) }
   def once?; end
 
   # def opening: () -> String
   #
-  # source://prism//lib/prism/node.rb#11210
+  # source://prism/lib/prism/node.rb#11210
   sig { returns(String) }
   def opening; end
 
   # attr_reader opening_loc: Location
   #
-  # source://prism//lib/prism/node.rb#11186
+  # source://prism/lib/prism/node.rb#11186
   sig { returns(Prism::Location) }
   def opening_loc; end
 
@@ -23237,13 +23237,13 @@ class Prism::MatchLastLineNode < ::Prism::Node
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#11230
+  # source://prism/lib/prism/node.rb#11230
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader unescaped: String
   #
-  # source://prism//lib/prism/node.rb#11207
+  # source://prism/lib/prism/node.rb#11207
   sig { returns(String) }
   def unescaped; end
 
@@ -23251,7 +23251,7 @@ class Prism::MatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#11166
+  # source://prism/lib/prism/node.rb#11166
   sig { returns(T::Boolean) }
   def utf_8?; end
 
@@ -23259,14 +23259,14 @@ class Prism::MatchLastLineNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#11161
+  # source://prism/lib/prism/node.rb#11161
   sig { returns(T::Boolean) }
   def windows_31j?; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#11235
+    # source://prism/lib/prism/node.rb#11235
     def type; end
   end
 end
@@ -23276,13 +23276,13 @@ end
 #     foo in bar
 #     ^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#11255
+# source://prism/lib/prism/node.rb#11255
 class Prism::MatchPredicateNode < ::Prism::Node
   # Initialize a new MatchPredicateNode node.
   #
   # @return [MatchPredicateNode] a new instance of MatchPredicateNode
   #
-  # source://prism//lib/prism/node.rb#11257
+  # source://prism/lib/prism/node.rb#11257
   sig do
     params(
       source: Prism::Source,
@@ -23299,36 +23299,36 @@ class Prism::MatchPredicateNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#11335
+  # source://prism/lib/prism/node.rb#11335
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#11268
+  # source://prism/lib/prism/node.rb#11268
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#11273
+  # source://prism/lib/prism/node.rb#11273
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#11283
+  # source://prism/lib/prism/node.rb#11283
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#11278
+  # source://prism/lib/prism/node.rb#11278
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: Prism::node, ?pattern: Prism::node, ?operator_loc: Location) -> MatchPredicateNode
   #
-  # source://prism//lib/prism/node.rb#11288
+  # source://prism/lib/prism/node.rb#11288
   sig do
     params(
       node_id: Integer,
@@ -23344,13 +23344,13 @@ class Prism::MatchPredicateNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#11273
+  # source://prism/lib/prism/node.rb#11273
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: Prism::node, pattern: Prism::node, operator_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#11296
+  # source://prism/lib/prism/node.rb#11296
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -23359,44 +23359,44 @@ class Prism::MatchPredicateNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#11319
+  # source://prism/lib/prism/node.rb#11319
   sig { override.returns(String) }
   def inspect; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#11314
+  # source://prism/lib/prism/node.rb#11314
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#11307
+  # source://prism/lib/prism/node.rb#11307
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # attr_reader pattern: Prism::node
   #
-  # source://prism//lib/prism/node.rb#11304
+  # source://prism/lib/prism/node.rb#11304
   sig { returns(Prism::Node) }
   def pattern; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#11324
+  # source://prism/lib/prism/node.rb#11324
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#11301
+  # source://prism/lib/prism/node.rb#11301
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#11329
+    # source://prism/lib/prism/node.rb#11329
     def type; end
   end
 end
@@ -23406,13 +23406,13 @@ end
 #     foo => bar
 #     ^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#11347
+# source://prism/lib/prism/node.rb#11347
 class Prism::MatchRequiredNode < ::Prism::Node
   # Initialize a new MatchRequiredNode node.
   #
   # @return [MatchRequiredNode] a new instance of MatchRequiredNode
   #
-  # source://prism//lib/prism/node.rb#11349
+  # source://prism/lib/prism/node.rb#11349
   sig do
     params(
       source: Prism::Source,
@@ -23429,36 +23429,36 @@ class Prism::MatchRequiredNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#11427
+  # source://prism/lib/prism/node.rb#11427
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#11360
+  # source://prism/lib/prism/node.rb#11360
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#11365
+  # source://prism/lib/prism/node.rb#11365
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#11375
+  # source://prism/lib/prism/node.rb#11375
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#11370
+  # source://prism/lib/prism/node.rb#11370
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: Prism::node, ?pattern: Prism::node, ?operator_loc: Location) -> MatchRequiredNode
   #
-  # source://prism//lib/prism/node.rb#11380
+  # source://prism/lib/prism/node.rb#11380
   sig do
     params(
       node_id: Integer,
@@ -23474,13 +23474,13 @@ class Prism::MatchRequiredNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#11365
+  # source://prism/lib/prism/node.rb#11365
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: Prism::node, pattern: Prism::node, operator_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#11388
+  # source://prism/lib/prism/node.rb#11388
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -23489,44 +23489,44 @@ class Prism::MatchRequiredNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#11411
+  # source://prism/lib/prism/node.rb#11411
   sig { override.returns(String) }
   def inspect; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#11406
+  # source://prism/lib/prism/node.rb#11406
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#11399
+  # source://prism/lib/prism/node.rb#11399
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # attr_reader pattern: Prism::node
   #
-  # source://prism//lib/prism/node.rb#11396
+  # source://prism/lib/prism/node.rb#11396
   sig { returns(Prism::Node) }
   def pattern; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#11416
+  # source://prism/lib/prism/node.rb#11416
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#11393
+  # source://prism/lib/prism/node.rb#11393
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#11421
+    # source://prism/lib/prism/node.rb#11421
     def type; end
   end
 end
@@ -23536,13 +23536,13 @@ end
 #     /(?<foo>bar)/ =~ baz
 #     ^^^^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#11439
+# source://prism/lib/prism/node.rb#11439
 class Prism::MatchWriteNode < ::Prism::Node
   # Initialize a new MatchWriteNode node.
   #
   # @return [MatchWriteNode] a new instance of MatchWriteNode
   #
-  # source://prism//lib/prism/node.rb#11441
+  # source://prism/lib/prism/node.rb#11441
   sig do
     params(
       source: Prism::Source,
@@ -23558,42 +23558,42 @@ class Prism::MatchWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#11506
+  # source://prism/lib/prism/node.rb#11506
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#11451
+  # source://prism/lib/prism/node.rb#11451
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader call: CallNode
   #
-  # source://prism//lib/prism/node.rb#11484
+  # source://prism/lib/prism/node.rb#11484
   sig { returns(Prism::CallNode) }
   def call; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#11456
+  # source://prism/lib/prism/node.rb#11456
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#11466
+  # source://prism/lib/prism/node.rb#11466
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#11461
+  # source://prism/lib/prism/node.rb#11461
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?call: CallNode, ?targets: Array[LocalVariableTargetNode]) -> MatchWriteNode
   #
-  # source://prism//lib/prism/node.rb#11471
+  # source://prism/lib/prism/node.rb#11471
   sig do
     params(
       node_id: Integer,
@@ -23608,13 +23608,13 @@ class Prism::MatchWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#11456
+  # source://prism/lib/prism/node.rb#11456
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, call: CallNode, targets: Array[LocalVariableTargetNode] }
   #
-  # source://prism//lib/prism/node.rb#11479
+  # source://prism/lib/prism/node.rb#11479
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -23623,88 +23623,88 @@ class Prism::MatchWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#11490
+  # source://prism/lib/prism/node.rb#11490
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader targets: Array[LocalVariableTargetNode]
   #
-  # source://prism//lib/prism/node.rb#11487
+  # source://prism/lib/prism/node.rb#11487
   sig { returns(T::Array[Prism::LocalVariableTargetNode]) }
   def targets; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#11495
+  # source://prism/lib/prism/node.rb#11495
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#11500
+    # source://prism/lib/prism/node.rb#11500
     def type; end
   end
 end
 
 # Represents a node that is missing from the source and results in a syntax error.
 #
-# source://prism//lib/prism/node.rb#11515
+# source://prism/lib/prism/node.rb#11515
 class Prism::MissingNode < ::Prism::Node
   # Initialize a new MissingNode node.
   #
   # @return [MissingNode] a new instance of MissingNode
   #
-  # source://prism//lib/prism/node.rb#11517
+  # source://prism/lib/prism/node.rb#11517
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
   def initialize(source, node_id, location, flags); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#11574
+  # source://prism/lib/prism/node.rb#11574
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#11525
+  # source://prism/lib/prism/node.rb#11525
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#11530
+  # source://prism/lib/prism/node.rb#11530
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#11540
+  # source://prism/lib/prism/node.rb#11540
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#11535
+  # source://prism/lib/prism/node.rb#11535
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> MissingNode
   #
-  # source://prism//lib/prism/node.rb#11545
+  # source://prism/lib/prism/node.rb#11545
   sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::MissingNode) }
   def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end
 
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#11530
+  # source://prism/lib/prism/node.rb#11530
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
   #
-  # source://prism//lib/prism/node.rb#11553
+  # source://prism/lib/prism/node.rb#11553
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -23713,20 +23713,20 @@ class Prism::MissingNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#11558
+  # source://prism/lib/prism/node.rb#11558
   sig { override.returns(String) }
   def inspect; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#11563
+  # source://prism/lib/prism/node.rb#11563
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#11568
+    # source://prism/lib/prism/node.rb#11568
     def type; end
   end
 end
@@ -23736,13 +23736,13 @@ end
 #     module Foo end
 #     ^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#11583
+# source://prism/lib/prism/node.rb#11583
 class Prism::ModuleNode < ::Prism::Node
   # Initialize a new ModuleNode node.
   #
   # @return [ModuleNode] a new instance of ModuleNode
   #
-  # source://prism//lib/prism/node.rb#11585
+  # source://prism/lib/prism/node.rb#11585
   sig do
     params(
       source: Prism::Source,
@@ -23762,48 +23762,48 @@ class Prism::ModuleNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#11687
+  # source://prism/lib/prism/node.rb#11687
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#11599
+  # source://prism/lib/prism/node.rb#11599
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader body: StatementsNode | BeginNode | nil
   #
-  # source://prism//lib/prism/node.rb#11648
+  # source://prism/lib/prism/node.rb#11648
   sig { returns(T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))) }
   def body; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#11604
+  # source://prism/lib/prism/node.rb#11604
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#11617
+  # source://prism/lib/prism/node.rb#11617
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#11609
+  # source://prism/lib/prism/node.rb#11609
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # attr_reader constant_path: ConstantReadNode | ConstantPathNode | MissingNode
   #
-  # source://prism//lib/prism/node.rb#11645
+  # source://prism/lib/prism/node.rb#11645
   sig { returns(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode, Prism::MissingNode)) }
   def constant_path; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?locals: Array[Symbol], ?module_keyword_loc: Location, ?constant_path: ConstantReadNode | ConstantPathNode | MissingNode, ?body: StatementsNode | BeginNode | nil, ?end_keyword_loc: Location, ?name: Symbol) -> ModuleNode
   #
-  # source://prism//lib/prism/node.rb#11622
+  # source://prism/lib/prism/node.rb#11622
   sig do
     params(
       node_id: Integer,
@@ -23822,25 +23822,25 @@ class Prism::ModuleNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#11604
+  # source://prism/lib/prism/node.rb#11604
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, locals: Array[Symbol], module_keyword_loc: Location, constant_path: ConstantReadNode | ConstantPathNode | MissingNode, body: StatementsNode | BeginNode | nil, end_keyword_loc: Location, name: Symbol }
   #
-  # source://prism//lib/prism/node.rb#11630
+  # source://prism/lib/prism/node.rb#11630
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # def end_keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#11666
+  # source://prism/lib/prism/node.rb#11666
   sig { returns(String) }
   def end_keyword; end
 
   # attr_reader end_keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#11651
+  # source://prism/lib/prism/node.rb#11651
   sig { returns(Prism::Location) }
   def end_keyword_loc; end
 
@@ -23849,44 +23849,44 @@ class Prism::ModuleNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#11671
+  # source://prism/lib/prism/node.rb#11671
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader locals: Array[Symbol]
   #
-  # source://prism//lib/prism/node.rb#11635
+  # source://prism/lib/prism/node.rb#11635
   sig { returns(T::Array[Symbol]) }
   def locals; end
 
   # def module_keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#11661
+  # source://prism/lib/prism/node.rb#11661
   sig { returns(String) }
   def module_keyword; end
 
   # attr_reader module_keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#11638
+  # source://prism/lib/prism/node.rb#11638
   sig { returns(Prism::Location) }
   def module_keyword_loc; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#11658
+  # source://prism/lib/prism/node.rb#11658
   sig { returns(Symbol) }
   def name; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#11676
+  # source://prism/lib/prism/node.rb#11676
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#11681
+    # source://prism/lib/prism/node.rb#11681
     def type; end
   end
 end
@@ -23901,13 +23901,13 @@ end
 #     for a, b in [[1, 2], [3, 4]]
 #         ^^^^
 #
-# source://prism//lib/prism/node.rb#11708
+# source://prism/lib/prism/node.rb#11708
 class Prism::MultiTargetNode < ::Prism::Node
   # Initialize a new MultiTargetNode node.
   #
   # @return [MultiTargetNode] a new instance of MultiTargetNode
   #
-  # source://prism//lib/prism/node.rb#11710
+  # source://prism/lib/prism/node.rb#11710
   sig do
     params(
       source: Prism::Source,
@@ -23926,36 +23926,36 @@ class Prism::MultiTargetNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#11851
+  # source://prism/lib/prism/node.rb#11851
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#11723
+  # source://prism/lib/prism/node.rb#11723
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#11728
+  # source://prism/lib/prism/node.rb#11728
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#11742
+  # source://prism/lib/prism/node.rb#11742
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#11733
+  # source://prism/lib/prism/node.rb#11733
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode], ?rest: ImplicitRestNode | SplatNode | nil, ?rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode], ?lparen_loc: Location?, ?rparen_loc: Location?) -> MultiTargetNode
   #
-  # source://prism//lib/prism/node.rb#11747
+  # source://prism/lib/prism/node.rb#11747
   sig do
     params(
       node_id: Integer,
@@ -23973,13 +23973,13 @@ class Prism::MultiTargetNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#11728
+  # source://prism/lib/prism/node.rb#11728
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode], rest: ImplicitRestNode | SplatNode | nil, rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode], lparen_loc: Location?, rparen_loc: Location? }
   #
-  # source://prism//lib/prism/node.rb#11755
+  # source://prism/lib/prism/node.rb#11755
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -23988,7 +23988,7 @@ class Prism::MultiTargetNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#11835
+  # source://prism/lib/prism/node.rb#11835
   sig { override.returns(String) }
   def inspect; end
 
@@ -24002,7 +24002,7 @@ class Prism::MultiTargetNode < ::Prism::Node
   #     a, (b, c) = 1, 2, 3, 4, 5
   #         ^^^^
   #
-  # source://prism//lib/prism/node.rb#11768
+  # source://prism/lib/prism/node.rb#11768
   sig do
     returns(T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::RequiredParameterNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)])
   end
@@ -24010,7 +24010,7 @@ class Prism::MultiTargetNode < ::Prism::Node
 
   # def lparen: () -> String?
   #
-  # source://prism//lib/prism/node.rb#11825
+  # source://prism/lib/prism/node.rb#11825
   sig { returns(T.nilable(String)) }
   def lparen; end
 
@@ -24019,7 +24019,7 @@ class Prism::MultiTargetNode < ::Prism::Node
   #     a, (b, c) = 1, 2, 3
   #        ^
   #
-  # source://prism//lib/prism/node.rb#11796
+  # source://prism/lib/prism/node.rb#11796
   sig { returns(T.nilable(Prism::Location)) }
   def lparen_loc; end
 
@@ -24038,7 +24038,7 @@ class Prism::MultiTargetNode < ::Prism::Node
   #     a, (b,) = 1, 2, 3, 4
   #          ^
   #
-  # source://prism//lib/prism/node.rb#11784
+  # source://prism/lib/prism/node.rb#11784
   sig { returns(T.nilable(T.any(Prism::ImplicitRestNode, Prism::SplatNode))) }
   def rest; end
 
@@ -24047,7 +24047,7 @@ class Prism::MultiTargetNode < ::Prism::Node
   #     a, (*, b, c) = 1, 2, 3, 4, 5
   #            ^^^^
   #
-  # source://prism//lib/prism/node.rb#11790
+  # source://prism/lib/prism/node.rb#11790
   sig do
     returns(T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::RequiredParameterNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)])
   end
@@ -24055,7 +24055,7 @@ class Prism::MultiTargetNode < ::Prism::Node
 
   # def rparen: () -> String?
   #
-  # source://prism//lib/prism/node.rb#11830
+  # source://prism/lib/prism/node.rb#11830
   sig { returns(T.nilable(String)) }
   def rparen; end
 
@@ -24064,20 +24064,20 @@ class Prism::MultiTargetNode < ::Prism::Node
   #     a, (b, c) = 1, 2, 3
   #             ^
   #
-  # source://prism//lib/prism/node.rb#11812
+  # source://prism/lib/prism/node.rb#11812
   sig { returns(T.nilable(Prism::Location)) }
   def rparen_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#11840
+  # source://prism/lib/prism/node.rb#11840
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#11845
+    # source://prism/lib/prism/node.rb#11845
     def type; end
   end
 end
@@ -24087,13 +24087,13 @@ end
 #     a, b, c = 1, 2, 3
 #     ^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#11867
+# source://prism/lib/prism/node.rb#11867
 class Prism::MultiWriteNode < ::Prism::Node
   # Initialize a new MultiWriteNode node.
   #
   # @return [MultiWriteNode] a new instance of MultiWriteNode
   #
-  # source://prism//lib/prism/node.rb#11869
+  # source://prism/lib/prism/node.rb#11869
   sig do
     params(
       source: Prism::Source,
@@ -24114,36 +24114,36 @@ class Prism::MultiWriteNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#12034
+  # source://prism/lib/prism/node.rb#12034
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#11884
+  # source://prism/lib/prism/node.rb#11884
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#11889
+  # source://prism/lib/prism/node.rb#11889
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#11904
+  # source://prism/lib/prism/node.rb#11904
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#11894
+  # source://prism/lib/prism/node.rb#11894
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | BackReferenceReadNode | NumberedReferenceReadNode], ?rest: ImplicitRestNode | SplatNode | nil, ?rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | BackReferenceReadNode | NumberedReferenceReadNode], ?lparen_loc: Location?, ?rparen_loc: Location?, ?operator_loc: Location, ?value: Prism::node) -> MultiWriteNode
   #
-  # source://prism//lib/prism/node.rb#11909
+  # source://prism/lib/prism/node.rb#11909
   sig do
     params(
       node_id: Integer,
@@ -24163,13 +24163,13 @@ class Prism::MultiWriteNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#11889
+  # source://prism/lib/prism/node.rb#11889
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | BackReferenceReadNode | NumberedReferenceReadNode], rest: ImplicitRestNode | SplatNode | nil, rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | BackReferenceReadNode | NumberedReferenceReadNode], lparen_loc: Location?, rparen_loc: Location?, operator_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#11917
+  # source://prism/lib/prism/node.rb#11917
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -24178,7 +24178,7 @@ class Prism::MultiWriteNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#12018
+  # source://prism/lib/prism/node.rb#12018
   sig { override.returns(String) }
   def inspect; end
 
@@ -24192,7 +24192,7 @@ class Prism::MultiWriteNode < ::Prism::Node
   #     a, b, c = 1, 2, 3, 4, 5
   #     ^^^^^^^
   #
-  # source://prism//lib/prism/node.rb#11930
+  # source://prism/lib/prism/node.rb#11930
   sig do
     returns(T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)])
   end
@@ -24200,7 +24200,7 @@ class Prism::MultiWriteNode < ::Prism::Node
 
   # def lparen: () -> String?
   #
-  # source://prism//lib/prism/node.rb#12003
+  # source://prism/lib/prism/node.rb#12003
   sig { returns(T.nilable(String)) }
   def lparen; end
 
@@ -24209,13 +24209,13 @@ class Prism::MultiWriteNode < ::Prism::Node
   #     (a, b, c) = 1, 2, 3
   #     ^
   #
-  # source://prism//lib/prism/node.rb#11958
+  # source://prism/lib/prism/node.rb#11958
   sig { returns(T.nilable(Prism::Location)) }
   def lparen_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#12013
+  # source://prism/lib/prism/node.rb#12013
   sig { returns(String) }
   def operator; end
 
@@ -24224,7 +24224,7 @@ class Prism::MultiWriteNode < ::Prism::Node
   #     a, b, c = 1, 2, 3
   #             ^
   #
-  # source://prism//lib/prism/node.rb#11990
+  # source://prism/lib/prism/node.rb#11990
   sig { returns(Prism::Location) }
   def operator_loc; end
 
@@ -24243,7 +24243,7 @@ class Prism::MultiWriteNode < ::Prism::Node
   #     a, b, = 1, 2, 3, 4
   #         ^
   #
-  # source://prism//lib/prism/node.rb#11946
+  # source://prism/lib/prism/node.rb#11946
   sig { returns(T.nilable(T.any(Prism::ImplicitRestNode, Prism::SplatNode))) }
   def rest; end
 
@@ -24252,7 +24252,7 @@ class Prism::MultiWriteNode < ::Prism::Node
   #     a, *, b, c = 1, 2, 3, 4, 5
   #           ^^^^
   #
-  # source://prism//lib/prism/node.rb#11952
+  # source://prism/lib/prism/node.rb#11952
   sig do
     returns(T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)])
   end
@@ -24260,7 +24260,7 @@ class Prism::MultiWriteNode < ::Prism::Node
 
   # def rparen: () -> String?
   #
-  # source://prism//lib/prism/node.rb#12008
+  # source://prism/lib/prism/node.rb#12008
   sig { returns(T.nilable(String)) }
   def rparen; end
 
@@ -24269,13 +24269,13 @@ class Prism::MultiWriteNode < ::Prism::Node
   #     (a, b, c) = 1, 2, 3
   #             ^
   #
-  # source://prism//lib/prism/node.rb#11974
+  # source://prism/lib/prism/node.rb#11974
   sig { returns(T.nilable(Prism::Location)) }
   def rparen_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#12023
+  # source://prism/lib/prism/node.rb#12023
   sig { override.returns(Symbol) }
   def type; end
 
@@ -24284,14 +24284,14 @@ class Prism::MultiWriteNode < ::Prism::Node
   #     a, b, c = 1, 2, 3
   #               ^^^^^^^
   #
-  # source://prism//lib/prism/node.rb#12000
+  # source://prism/lib/prism/node.rb#12000
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#12028
+    # source://prism/lib/prism/node.rb#12028
     def type; end
   end
 end
@@ -24300,761 +24300,761 @@ end
 # visited. This is useful for consumers that want to mutate the tree, as you
 # can change subtrees in place without effecting the rest of the tree.
 #
-# source://prism//lib/prism/mutation_compiler.rb#13
+# source://prism/lib/prism/mutation_compiler.rb#13
 class Prism::MutationCompiler < ::Prism::Compiler
   # Copy a AliasGlobalVariableNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#15
+  # source://prism/lib/prism/mutation_compiler.rb#15
   def visit_alias_global_variable_node(node); end
 
   # Copy a AliasMethodNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#20
+  # source://prism/lib/prism/mutation_compiler.rb#20
   def visit_alias_method_node(node); end
 
   # Copy a AlternationPatternNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#25
+  # source://prism/lib/prism/mutation_compiler.rb#25
   def visit_alternation_pattern_node(node); end
 
   # Copy a AndNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#30
+  # source://prism/lib/prism/mutation_compiler.rb#30
   def visit_and_node(node); end
 
   # Copy a ArgumentsNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#35
+  # source://prism/lib/prism/mutation_compiler.rb#35
   def visit_arguments_node(node); end
 
   # Copy a ArrayNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#40
+  # source://prism/lib/prism/mutation_compiler.rb#40
   def visit_array_node(node); end
 
   # Copy a ArrayPatternNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#45
+  # source://prism/lib/prism/mutation_compiler.rb#45
   def visit_array_pattern_node(node); end
 
   # Copy a AssocNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#50
+  # source://prism/lib/prism/mutation_compiler.rb#50
   def visit_assoc_node(node); end
 
   # Copy a AssocSplatNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#55
+  # source://prism/lib/prism/mutation_compiler.rb#55
   def visit_assoc_splat_node(node); end
 
   # Copy a BackReferenceReadNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#60
+  # source://prism/lib/prism/mutation_compiler.rb#60
   def visit_back_reference_read_node(node); end
 
   # Copy a BeginNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#65
+  # source://prism/lib/prism/mutation_compiler.rb#65
   def visit_begin_node(node); end
 
   # Copy a BlockArgumentNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#70
+  # source://prism/lib/prism/mutation_compiler.rb#70
   def visit_block_argument_node(node); end
 
   # Copy a BlockLocalVariableNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#75
+  # source://prism/lib/prism/mutation_compiler.rb#75
   def visit_block_local_variable_node(node); end
 
   # Copy a BlockNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#80
+  # source://prism/lib/prism/mutation_compiler.rb#80
   def visit_block_node(node); end
 
   # Copy a BlockParameterNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#85
+  # source://prism/lib/prism/mutation_compiler.rb#85
   def visit_block_parameter_node(node); end
 
   # Copy a BlockParametersNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#90
+  # source://prism/lib/prism/mutation_compiler.rb#90
   def visit_block_parameters_node(node); end
 
   # Copy a BreakNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#95
+  # source://prism/lib/prism/mutation_compiler.rb#95
   def visit_break_node(node); end
 
   # Copy a CallAndWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#100
+  # source://prism/lib/prism/mutation_compiler.rb#100
   def visit_call_and_write_node(node); end
 
   # Copy a CallNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#105
+  # source://prism/lib/prism/mutation_compiler.rb#105
   def visit_call_node(node); end
 
   # Copy a CallOperatorWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#110
+  # source://prism/lib/prism/mutation_compiler.rb#110
   def visit_call_operator_write_node(node); end
 
   # Copy a CallOrWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#115
+  # source://prism/lib/prism/mutation_compiler.rb#115
   def visit_call_or_write_node(node); end
 
   # Copy a CallTargetNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#120
+  # source://prism/lib/prism/mutation_compiler.rb#120
   def visit_call_target_node(node); end
 
   # Copy a CapturePatternNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#125
+  # source://prism/lib/prism/mutation_compiler.rb#125
   def visit_capture_pattern_node(node); end
 
   # Copy a CaseMatchNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#130
+  # source://prism/lib/prism/mutation_compiler.rb#130
   def visit_case_match_node(node); end
 
   # Copy a CaseNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#135
+  # source://prism/lib/prism/mutation_compiler.rb#135
   def visit_case_node(node); end
 
   # Copy a ClassNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#140
+  # source://prism/lib/prism/mutation_compiler.rb#140
   def visit_class_node(node); end
 
   # Copy a ClassVariableAndWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#145
+  # source://prism/lib/prism/mutation_compiler.rb#145
   def visit_class_variable_and_write_node(node); end
 
   # Copy a ClassVariableOperatorWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#150
+  # source://prism/lib/prism/mutation_compiler.rb#150
   def visit_class_variable_operator_write_node(node); end
 
   # Copy a ClassVariableOrWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#155
+  # source://prism/lib/prism/mutation_compiler.rb#155
   def visit_class_variable_or_write_node(node); end
 
   # Copy a ClassVariableReadNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#160
+  # source://prism/lib/prism/mutation_compiler.rb#160
   def visit_class_variable_read_node(node); end
 
   # Copy a ClassVariableTargetNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#165
+  # source://prism/lib/prism/mutation_compiler.rb#165
   def visit_class_variable_target_node(node); end
 
   # Copy a ClassVariableWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#170
+  # source://prism/lib/prism/mutation_compiler.rb#170
   def visit_class_variable_write_node(node); end
 
   # Copy a ConstantAndWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#175
+  # source://prism/lib/prism/mutation_compiler.rb#175
   def visit_constant_and_write_node(node); end
 
   # Copy a ConstantOperatorWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#180
+  # source://prism/lib/prism/mutation_compiler.rb#180
   def visit_constant_operator_write_node(node); end
 
   # Copy a ConstantOrWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#185
+  # source://prism/lib/prism/mutation_compiler.rb#185
   def visit_constant_or_write_node(node); end
 
   # Copy a ConstantPathAndWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#190
+  # source://prism/lib/prism/mutation_compiler.rb#190
   def visit_constant_path_and_write_node(node); end
 
   # Copy a ConstantPathNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#195
+  # source://prism/lib/prism/mutation_compiler.rb#195
   def visit_constant_path_node(node); end
 
   # Copy a ConstantPathOperatorWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#200
+  # source://prism/lib/prism/mutation_compiler.rb#200
   def visit_constant_path_operator_write_node(node); end
 
   # Copy a ConstantPathOrWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#205
+  # source://prism/lib/prism/mutation_compiler.rb#205
   def visit_constant_path_or_write_node(node); end
 
   # Copy a ConstantPathTargetNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#210
+  # source://prism/lib/prism/mutation_compiler.rb#210
   def visit_constant_path_target_node(node); end
 
   # Copy a ConstantPathWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#215
+  # source://prism/lib/prism/mutation_compiler.rb#215
   def visit_constant_path_write_node(node); end
 
   # Copy a ConstantReadNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#220
+  # source://prism/lib/prism/mutation_compiler.rb#220
   def visit_constant_read_node(node); end
 
   # Copy a ConstantTargetNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#225
+  # source://prism/lib/prism/mutation_compiler.rb#225
   def visit_constant_target_node(node); end
 
   # Copy a ConstantWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#230
+  # source://prism/lib/prism/mutation_compiler.rb#230
   def visit_constant_write_node(node); end
 
   # Copy a DefNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#235
+  # source://prism/lib/prism/mutation_compiler.rb#235
   def visit_def_node(node); end
 
   # Copy a DefinedNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#240
+  # source://prism/lib/prism/mutation_compiler.rb#240
   def visit_defined_node(node); end
 
   # Copy a ElseNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#245
+  # source://prism/lib/prism/mutation_compiler.rb#245
   def visit_else_node(node); end
 
   # Copy a EmbeddedStatementsNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#250
+  # source://prism/lib/prism/mutation_compiler.rb#250
   def visit_embedded_statements_node(node); end
 
   # Copy a EmbeddedVariableNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#255
+  # source://prism/lib/prism/mutation_compiler.rb#255
   def visit_embedded_variable_node(node); end
 
   # Copy a EnsureNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#260
+  # source://prism/lib/prism/mutation_compiler.rb#260
   def visit_ensure_node(node); end
 
   # Copy a FalseNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#265
+  # source://prism/lib/prism/mutation_compiler.rb#265
   def visit_false_node(node); end
 
   # Copy a FindPatternNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#270
+  # source://prism/lib/prism/mutation_compiler.rb#270
   def visit_find_pattern_node(node); end
 
   # Copy a FlipFlopNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#275
+  # source://prism/lib/prism/mutation_compiler.rb#275
   def visit_flip_flop_node(node); end
 
   # Copy a FloatNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#280
+  # source://prism/lib/prism/mutation_compiler.rb#280
   def visit_float_node(node); end
 
   # Copy a ForNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#285
+  # source://prism/lib/prism/mutation_compiler.rb#285
   def visit_for_node(node); end
 
   # Copy a ForwardingArgumentsNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#290
+  # source://prism/lib/prism/mutation_compiler.rb#290
   def visit_forwarding_arguments_node(node); end
 
   # Copy a ForwardingParameterNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#295
+  # source://prism/lib/prism/mutation_compiler.rb#295
   def visit_forwarding_parameter_node(node); end
 
   # Copy a ForwardingSuperNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#300
+  # source://prism/lib/prism/mutation_compiler.rb#300
   def visit_forwarding_super_node(node); end
 
   # Copy a GlobalVariableAndWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#305
+  # source://prism/lib/prism/mutation_compiler.rb#305
   def visit_global_variable_and_write_node(node); end
 
   # Copy a GlobalVariableOperatorWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#310
+  # source://prism/lib/prism/mutation_compiler.rb#310
   def visit_global_variable_operator_write_node(node); end
 
   # Copy a GlobalVariableOrWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#315
+  # source://prism/lib/prism/mutation_compiler.rb#315
   def visit_global_variable_or_write_node(node); end
 
   # Copy a GlobalVariableReadNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#320
+  # source://prism/lib/prism/mutation_compiler.rb#320
   def visit_global_variable_read_node(node); end
 
   # Copy a GlobalVariableTargetNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#325
+  # source://prism/lib/prism/mutation_compiler.rb#325
   def visit_global_variable_target_node(node); end
 
   # Copy a GlobalVariableWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#330
+  # source://prism/lib/prism/mutation_compiler.rb#330
   def visit_global_variable_write_node(node); end
 
   # Copy a HashNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#335
+  # source://prism/lib/prism/mutation_compiler.rb#335
   def visit_hash_node(node); end
 
   # Copy a HashPatternNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#340
+  # source://prism/lib/prism/mutation_compiler.rb#340
   def visit_hash_pattern_node(node); end
 
   # Copy a IfNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#345
+  # source://prism/lib/prism/mutation_compiler.rb#345
   def visit_if_node(node); end
 
   # Copy a ImaginaryNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#350
+  # source://prism/lib/prism/mutation_compiler.rb#350
   def visit_imaginary_node(node); end
 
   # Copy a ImplicitNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#355
+  # source://prism/lib/prism/mutation_compiler.rb#355
   def visit_implicit_node(node); end
 
   # Copy a ImplicitRestNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#360
+  # source://prism/lib/prism/mutation_compiler.rb#360
   def visit_implicit_rest_node(node); end
 
   # Copy a InNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#365
+  # source://prism/lib/prism/mutation_compiler.rb#365
   def visit_in_node(node); end
 
   # Copy a IndexAndWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#370
+  # source://prism/lib/prism/mutation_compiler.rb#370
   def visit_index_and_write_node(node); end
 
   # Copy a IndexOperatorWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#375
+  # source://prism/lib/prism/mutation_compiler.rb#375
   def visit_index_operator_write_node(node); end
 
   # Copy a IndexOrWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#380
+  # source://prism/lib/prism/mutation_compiler.rb#380
   def visit_index_or_write_node(node); end
 
   # Copy a IndexTargetNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#385
+  # source://prism/lib/prism/mutation_compiler.rb#385
   def visit_index_target_node(node); end
 
   # Copy a InstanceVariableAndWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#390
+  # source://prism/lib/prism/mutation_compiler.rb#390
   def visit_instance_variable_and_write_node(node); end
 
   # Copy a InstanceVariableOperatorWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#395
+  # source://prism/lib/prism/mutation_compiler.rb#395
   def visit_instance_variable_operator_write_node(node); end
 
   # Copy a InstanceVariableOrWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#400
+  # source://prism/lib/prism/mutation_compiler.rb#400
   def visit_instance_variable_or_write_node(node); end
 
   # Copy a InstanceVariableReadNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#405
+  # source://prism/lib/prism/mutation_compiler.rb#405
   def visit_instance_variable_read_node(node); end
 
   # Copy a InstanceVariableTargetNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#410
+  # source://prism/lib/prism/mutation_compiler.rb#410
   def visit_instance_variable_target_node(node); end
 
   # Copy a InstanceVariableWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#415
+  # source://prism/lib/prism/mutation_compiler.rb#415
   def visit_instance_variable_write_node(node); end
 
   # Copy a IntegerNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#420
+  # source://prism/lib/prism/mutation_compiler.rb#420
   def visit_integer_node(node); end
 
   # Copy a InterpolatedMatchLastLineNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#425
+  # source://prism/lib/prism/mutation_compiler.rb#425
   def visit_interpolated_match_last_line_node(node); end
 
   # Copy a InterpolatedRegularExpressionNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#430
+  # source://prism/lib/prism/mutation_compiler.rb#430
   def visit_interpolated_regular_expression_node(node); end
 
   # Copy a InterpolatedStringNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#435
+  # source://prism/lib/prism/mutation_compiler.rb#435
   def visit_interpolated_string_node(node); end
 
   # Copy a InterpolatedSymbolNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#440
+  # source://prism/lib/prism/mutation_compiler.rb#440
   def visit_interpolated_symbol_node(node); end
 
   # Copy a InterpolatedXStringNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#445
+  # source://prism/lib/prism/mutation_compiler.rb#445
   def visit_interpolated_x_string_node(node); end
 
   # Copy a ItLocalVariableReadNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#450
+  # source://prism/lib/prism/mutation_compiler.rb#450
   def visit_it_local_variable_read_node(node); end
 
   # Copy a ItParametersNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#455
+  # source://prism/lib/prism/mutation_compiler.rb#455
   def visit_it_parameters_node(node); end
 
   # Copy a KeywordHashNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#460
+  # source://prism/lib/prism/mutation_compiler.rb#460
   def visit_keyword_hash_node(node); end
 
   # Copy a KeywordRestParameterNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#465
+  # source://prism/lib/prism/mutation_compiler.rb#465
   def visit_keyword_rest_parameter_node(node); end
 
   # Copy a LambdaNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#470
+  # source://prism/lib/prism/mutation_compiler.rb#470
   def visit_lambda_node(node); end
 
   # Copy a LocalVariableAndWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#475
+  # source://prism/lib/prism/mutation_compiler.rb#475
   def visit_local_variable_and_write_node(node); end
 
   # Copy a LocalVariableOperatorWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#480
+  # source://prism/lib/prism/mutation_compiler.rb#480
   def visit_local_variable_operator_write_node(node); end
 
   # Copy a LocalVariableOrWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#485
+  # source://prism/lib/prism/mutation_compiler.rb#485
   def visit_local_variable_or_write_node(node); end
 
   # Copy a LocalVariableReadNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#490
+  # source://prism/lib/prism/mutation_compiler.rb#490
   def visit_local_variable_read_node(node); end
 
   # Copy a LocalVariableTargetNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#495
+  # source://prism/lib/prism/mutation_compiler.rb#495
   def visit_local_variable_target_node(node); end
 
   # Copy a LocalVariableWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#500
+  # source://prism/lib/prism/mutation_compiler.rb#500
   def visit_local_variable_write_node(node); end
 
   # Copy a MatchLastLineNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#505
+  # source://prism/lib/prism/mutation_compiler.rb#505
   def visit_match_last_line_node(node); end
 
   # Copy a MatchPredicateNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#510
+  # source://prism/lib/prism/mutation_compiler.rb#510
   def visit_match_predicate_node(node); end
 
   # Copy a MatchRequiredNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#515
+  # source://prism/lib/prism/mutation_compiler.rb#515
   def visit_match_required_node(node); end
 
   # Copy a MatchWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#520
+  # source://prism/lib/prism/mutation_compiler.rb#520
   def visit_match_write_node(node); end
 
   # Copy a MissingNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#525
+  # source://prism/lib/prism/mutation_compiler.rb#525
   def visit_missing_node(node); end
 
   # Copy a ModuleNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#530
+  # source://prism/lib/prism/mutation_compiler.rb#530
   def visit_module_node(node); end
 
   # Copy a MultiTargetNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#535
+  # source://prism/lib/prism/mutation_compiler.rb#535
   def visit_multi_target_node(node); end
 
   # Copy a MultiWriteNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#540
+  # source://prism/lib/prism/mutation_compiler.rb#540
   def visit_multi_write_node(node); end
 
   # Copy a NextNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#545
+  # source://prism/lib/prism/mutation_compiler.rb#545
   def visit_next_node(node); end
 
   # Copy a NilNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#550
+  # source://prism/lib/prism/mutation_compiler.rb#550
   def visit_nil_node(node); end
 
   # Copy a NoKeywordsParameterNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#555
+  # source://prism/lib/prism/mutation_compiler.rb#555
   def visit_no_keywords_parameter_node(node); end
 
   # Copy a NumberedParametersNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#560
+  # source://prism/lib/prism/mutation_compiler.rb#560
   def visit_numbered_parameters_node(node); end
 
   # Copy a NumberedReferenceReadNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#565
+  # source://prism/lib/prism/mutation_compiler.rb#565
   def visit_numbered_reference_read_node(node); end
 
   # Copy a OptionalKeywordParameterNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#570
+  # source://prism/lib/prism/mutation_compiler.rb#570
   def visit_optional_keyword_parameter_node(node); end
 
   # Copy a OptionalParameterNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#575
+  # source://prism/lib/prism/mutation_compiler.rb#575
   def visit_optional_parameter_node(node); end
 
   # Copy a OrNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#580
+  # source://prism/lib/prism/mutation_compiler.rb#580
   def visit_or_node(node); end
 
   # Copy a ParametersNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#585
+  # source://prism/lib/prism/mutation_compiler.rb#585
   def visit_parameters_node(node); end
 
   # Copy a ParenthesesNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#590
+  # source://prism/lib/prism/mutation_compiler.rb#590
   def visit_parentheses_node(node); end
 
   # Copy a PinnedExpressionNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#595
+  # source://prism/lib/prism/mutation_compiler.rb#595
   def visit_pinned_expression_node(node); end
 
   # Copy a PinnedVariableNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#600
+  # source://prism/lib/prism/mutation_compiler.rb#600
   def visit_pinned_variable_node(node); end
 
   # Copy a PostExecutionNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#605
+  # source://prism/lib/prism/mutation_compiler.rb#605
   def visit_post_execution_node(node); end
 
   # Copy a PreExecutionNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#610
+  # source://prism/lib/prism/mutation_compiler.rb#610
   def visit_pre_execution_node(node); end
 
   # Copy a ProgramNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#615
+  # source://prism/lib/prism/mutation_compiler.rb#615
   def visit_program_node(node); end
 
   # Copy a RangeNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#620
+  # source://prism/lib/prism/mutation_compiler.rb#620
   def visit_range_node(node); end
 
   # Copy a RationalNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#625
+  # source://prism/lib/prism/mutation_compiler.rb#625
   def visit_rational_node(node); end
 
   # Copy a RedoNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#630
+  # source://prism/lib/prism/mutation_compiler.rb#630
   def visit_redo_node(node); end
 
   # Copy a RegularExpressionNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#635
+  # source://prism/lib/prism/mutation_compiler.rb#635
   def visit_regular_expression_node(node); end
 
   # Copy a RequiredKeywordParameterNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#640
+  # source://prism/lib/prism/mutation_compiler.rb#640
   def visit_required_keyword_parameter_node(node); end
 
   # Copy a RequiredParameterNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#645
+  # source://prism/lib/prism/mutation_compiler.rb#645
   def visit_required_parameter_node(node); end
 
   # Copy a RescueModifierNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#650
+  # source://prism/lib/prism/mutation_compiler.rb#650
   def visit_rescue_modifier_node(node); end
 
   # Copy a RescueNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#655
+  # source://prism/lib/prism/mutation_compiler.rb#655
   def visit_rescue_node(node); end
 
   # Copy a RestParameterNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#660
+  # source://prism/lib/prism/mutation_compiler.rb#660
   def visit_rest_parameter_node(node); end
 
   # Copy a RetryNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#665
+  # source://prism/lib/prism/mutation_compiler.rb#665
   def visit_retry_node(node); end
 
   # Copy a ReturnNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#670
+  # source://prism/lib/prism/mutation_compiler.rb#670
   def visit_return_node(node); end
 
   # Copy a SelfNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#675
+  # source://prism/lib/prism/mutation_compiler.rb#675
   def visit_self_node(node); end
 
   # Copy a ShareableConstantNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#680
+  # source://prism/lib/prism/mutation_compiler.rb#680
   def visit_shareable_constant_node(node); end
 
   # Copy a SingletonClassNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#685
+  # source://prism/lib/prism/mutation_compiler.rb#685
   def visit_singleton_class_node(node); end
 
   # Copy a SourceEncodingNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#690
+  # source://prism/lib/prism/mutation_compiler.rb#690
   def visit_source_encoding_node(node); end
 
   # Copy a SourceFileNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#695
+  # source://prism/lib/prism/mutation_compiler.rb#695
   def visit_source_file_node(node); end
 
   # Copy a SourceLineNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#700
+  # source://prism/lib/prism/mutation_compiler.rb#700
   def visit_source_line_node(node); end
 
   # Copy a SplatNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#705
+  # source://prism/lib/prism/mutation_compiler.rb#705
   def visit_splat_node(node); end
 
   # Copy a StatementsNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#710
+  # source://prism/lib/prism/mutation_compiler.rb#710
   def visit_statements_node(node); end
 
   # Copy a StringNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#715
+  # source://prism/lib/prism/mutation_compiler.rb#715
   def visit_string_node(node); end
 
   # Copy a SuperNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#720
+  # source://prism/lib/prism/mutation_compiler.rb#720
   def visit_super_node(node); end
 
   # Copy a SymbolNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#725
+  # source://prism/lib/prism/mutation_compiler.rb#725
   def visit_symbol_node(node); end
 
   # Copy a TrueNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#730
+  # source://prism/lib/prism/mutation_compiler.rb#730
   def visit_true_node(node); end
 
   # Copy a UndefNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#735
+  # source://prism/lib/prism/mutation_compiler.rb#735
   def visit_undef_node(node); end
 
   # Copy a UnlessNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#740
+  # source://prism/lib/prism/mutation_compiler.rb#740
   def visit_unless_node(node); end
 
   # Copy a UntilNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#745
+  # source://prism/lib/prism/mutation_compiler.rb#745
   def visit_until_node(node); end
 
   # Copy a WhenNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#750
+  # source://prism/lib/prism/mutation_compiler.rb#750
   def visit_when_node(node); end
 
   # Copy a WhileNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#755
+  # source://prism/lib/prism/mutation_compiler.rb#755
   def visit_while_node(node); end
 
   # Copy a XStringNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#760
+  # source://prism/lib/prism/mutation_compiler.rb#760
   def visit_x_string_node(node); end
 
   # Copy a YieldNode node
   #
-  # source://prism//lib/prism/mutation_compiler.rb#765
+  # source://prism/lib/prism/mutation_compiler.rb#765
   def visit_yield_node(node); end
 end
 
@@ -25063,13 +25063,13 @@ end
 #     next 1
 #     ^^^^^^
 #
-# source://prism//lib/prism/node.rb#12052
+# source://prism/lib/prism/node.rb#12052
 class Prism::NextNode < ::Prism::Node
   # Initialize a new NextNode node.
   #
   # @return [NextNode] a new instance of NextNode
   #
-  # source://prism//lib/prism/node.rb#12054
+  # source://prism/lib/prism/node.rb#12054
   sig do
     params(
       source: Prism::Source,
@@ -25085,42 +25085,42 @@ class Prism::NextNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#12130
+  # source://prism/lib/prism/node.rb#12130
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#12064
+  # source://prism/lib/prism/node.rb#12064
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader arguments: ArgumentsNode?
   #
-  # source://prism//lib/prism/node.rb#12099
+  # source://prism/lib/prism/node.rb#12099
   sig { returns(T.nilable(Prism::ArgumentsNode)) }
   def arguments; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12069
+  # source://prism/lib/prism/node.rb#12069
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#12081
+  # source://prism/lib/prism/node.rb#12081
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#12074
+  # source://prism/lib/prism/node.rb#12074
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?arguments: ArgumentsNode?, ?keyword_loc: Location) -> NextNode
   #
-  # source://prism//lib/prism/node.rb#12086
+  # source://prism/lib/prism/node.rb#12086
   sig do
     params(
       node_id: Integer,
@@ -25135,13 +25135,13 @@ class Prism::NextNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12069
+  # source://prism/lib/prism/node.rb#12069
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, arguments: ArgumentsNode?, keyword_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#12094
+  # source://prism/lib/prism/node.rb#12094
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -25150,32 +25150,32 @@ class Prism::NextNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#12114
+  # source://prism/lib/prism/node.rb#12114
   sig { override.returns(String) }
   def inspect; end
 
   # def keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#12109
+  # source://prism/lib/prism/node.rb#12109
   sig { returns(String) }
   def keyword; end
 
   # attr_reader keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#12102
+  # source://prism/lib/prism/node.rb#12102
   sig { returns(Prism::Location) }
   def keyword_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#12119
+  # source://prism/lib/prism/node.rb#12119
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#12124
+    # source://prism/lib/prism/node.rb#12124
     def type; end
   end
 end
@@ -25185,62 +25185,62 @@ end
 #     nil
 #     ^^^
 #
-# source://prism//lib/prism/node.rb#12141
+# source://prism/lib/prism/node.rb#12141
 class Prism::NilNode < ::Prism::Node
   # Initialize a new NilNode node.
   #
   # @return [NilNode] a new instance of NilNode
   #
-  # source://prism//lib/prism/node.rb#12143
+  # source://prism/lib/prism/node.rb#12143
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
   def initialize(source, node_id, location, flags); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#12200
+  # source://prism/lib/prism/node.rb#12200
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#12151
+  # source://prism/lib/prism/node.rb#12151
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12156
+  # source://prism/lib/prism/node.rb#12156
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#12166
+  # source://prism/lib/prism/node.rb#12166
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#12161
+  # source://prism/lib/prism/node.rb#12161
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> NilNode
   #
-  # source://prism//lib/prism/node.rb#12171
+  # source://prism/lib/prism/node.rb#12171
   sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::NilNode) }
   def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end
 
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12156
+  # source://prism/lib/prism/node.rb#12156
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
   #
-  # source://prism//lib/prism/node.rb#12179
+  # source://prism/lib/prism/node.rb#12179
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -25249,20 +25249,20 @@ class Prism::NilNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#12184
+  # source://prism/lib/prism/node.rb#12184
   sig { override.returns(String) }
   def inspect; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#12189
+  # source://prism/lib/prism/node.rb#12189
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#12194
+    # source://prism/lib/prism/node.rb#12194
     def type; end
   end
 end
@@ -25273,13 +25273,13 @@ end
 #           ^^^^^
 #     end
 #
-# source://prism//lib/prism/node.rb#12210
+# source://prism/lib/prism/node.rb#12210
 class Prism::NoKeywordsParameterNode < ::Prism::Node
   # Initialize a new NoKeywordsParameterNode node.
   #
   # @return [NoKeywordsParameterNode] a new instance of NoKeywordsParameterNode
   #
-  # source://prism//lib/prism/node.rb#12212
+  # source://prism/lib/prism/node.rb#12212
   sig do
     params(
       source: Prism::Source,
@@ -25295,36 +25295,36 @@ class Prism::NoKeywordsParameterNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#12295
+  # source://prism/lib/prism/node.rb#12295
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#12222
+  # source://prism/lib/prism/node.rb#12222
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12227
+  # source://prism/lib/prism/node.rb#12227
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#12237
+  # source://prism/lib/prism/node.rb#12237
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#12232
+  # source://prism/lib/prism/node.rb#12232
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?operator_loc: Location, ?keyword_loc: Location) -> NoKeywordsParameterNode
   #
-  # source://prism//lib/prism/node.rb#12242
+  # source://prism/lib/prism/node.rb#12242
   sig do
     params(
       node_id: Integer,
@@ -25339,13 +25339,13 @@ class Prism::NoKeywordsParameterNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12227
+  # source://prism/lib/prism/node.rb#12227
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, operator_loc: Location, keyword_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#12250
+  # source://prism/lib/prism/node.rb#12250
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -25354,44 +25354,44 @@ class Prism::NoKeywordsParameterNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#12279
+  # source://prism/lib/prism/node.rb#12279
   sig { override.returns(String) }
   def inspect; end
 
   # def keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#12274
+  # source://prism/lib/prism/node.rb#12274
   sig { returns(String) }
   def keyword; end
 
   # attr_reader keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#12262
+  # source://prism/lib/prism/node.rb#12262
   sig { returns(Prism::Location) }
   def keyword_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#12269
+  # source://prism/lib/prism/node.rb#12269
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#12255
+  # source://prism/lib/prism/node.rb#12255
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#12284
+  # source://prism/lib/prism/node.rb#12284
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#12289
+    # source://prism/lib/prism/node.rb#12289
     def type; end
   end
 end
@@ -25399,7 +25399,7 @@ end
 # This represents a node in the tree. It is the parent class of all of the
 # various node types.
 #
-# source://prism//lib/prism/node.rb#12
+# source://prism/lib/prism/node.rb#12
 class Prism::Node
   abstract!
 
@@ -25407,7 +25407,7 @@ class Prism::Node
   #
   # @raise [NoMethodError]
   #
-  # source://prism//lib/prism/node.rb#169
+  # source://prism/lib/prism/node.rb#169
   sig { abstract.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
@@ -25417,7 +25417,7 @@ class Prism::Node
   #
   #     node.breadth_first_search { |node| node.node_id == node_id }
   #
-  # source://prism//lib/prism/node.rb#139
+  # source://prism/lib/prism/node.rb#139
   sig { params(block: T.proc.params(node: Prism::Node).returns(T::Boolean)).returns(T.nilable(Prism::Node)) }
   def breadth_first_search(&block); end
 
@@ -25426,7 +25426,7 @@ class Prism::Node
   #
   # @raise [NoMethodError]
   #
-  # source://prism//lib/prism/node.rb#175
+  # source://prism/lib/prism/node.rb#175
   sig { abstract.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
@@ -25435,7 +25435,7 @@ class Prism::Node
   #
   # @raise [NoMethodError]
   #
-  # source://prism//lib/prism/node.rb#189
+  # source://prism/lib/prism/node.rb#189
   sig { abstract.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
@@ -25444,7 +25444,7 @@ class Prism::Node
   #
   # @raise [NoMethodError]
   #
-  # source://prism//lib/prism/node.rb#183
+  # source://prism/lib/prism/node.rb#183
   sig { abstract.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
@@ -25453,17 +25453,17 @@ class Prism::Node
   #
   # @raise [NoMethodError]
   #
-  # source://prism//lib/prism/node.rb#175
+  # source://prism/lib/prism/node.rb#175
   sig { abstract.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
-  # source://prism//lib/prism/node_ext.rb#7
+  # source://prism/lib/prism/node_ext.rb#7
   def deprecated(*replacements); end
 
   # The end offset of the node in the source. This method is effectively a
   # delegate method to the location object.
   #
-  # source://prism//lib/prism/node.rb#40
+  # source://prism/lib/prism/node.rb#40
   sig { returns(Integer) }
   def end_offset; end
 
@@ -25474,14 +25474,14 @@ class Prism::Node
   #
   # @raise [NoMethodError]
   #
-  # source://prism//lib/prism/node.rb#194
+  # source://prism/lib/prism/node.rb#194
   sig { abstract.returns(String) }
   def inspect; end
 
   # A Location instance that represents the location of this node in the
   # source.
   #
-  # source://prism//lib/prism/node.rb#25
+  # source://prism/lib/prism/node.rb#25
   sig { returns(Prism::Location) }
   def location; end
 
@@ -25489,16 +25489,16 @@ class Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#72
+  # source://prism/lib/prism/node.rb#72
   sig { returns(T::Boolean) }
   def newline?; end
 
-  # source://prism//lib/prism/parse_result/newlines.rb#69
+  # source://prism/lib/prism/parse_result/newlines.rb#69
   def newline_flag!(lines); end
 
   # @return [Boolean]
   #
-  # source://prism//lib/prism/parse_result/newlines.rb#65
+  # source://prism/lib/prism/parse_result/newlines.rb#65
   def newline_flag?; end
 
   # A unique identifier for this node. This is used in a very specific
@@ -25506,14 +25506,14 @@ class Prism::Node
   # having to keep around the syntax tree in memory. This unique identifier
   # will be consistent across multiple parses of the same source code.
   #
-  # source://prism//lib/prism/node.rb#21
+  # source://prism/lib/prism/node.rb#21
   sig { returns(Integer) }
   def node_id; end
 
   # Similar to inspect, but respects the current level of indentation given by
   # the pretty print object.
   #
-  # source://prism//lib/prism/node.rb#83
+  # source://prism/lib/prism/node.rb#83
   sig { params(q: T.untyped).void }
   def pretty_print(q); end
 
@@ -25521,13 +25521,13 @@ class Prism::Node
   # An alias for source_lines, used to mimic the API from
   # RubyVM::AbstractSyntaxTree to make it easier to migrate.
   #
-  # source://prism//lib/prism/node.rb#46
+  # source://prism/lib/prism/node.rb#46
   sig { returns(T::Array[String]) }
   def script_lines; end
 
   # Slice the location of the node from the source.
   #
-  # source://prism//lib/prism/node.rb#55
+  # source://prism/lib/prism/node.rb#55
   sig { returns(String) }
   def slice; end
 
@@ -25535,20 +25535,20 @@ class Prism::Node
   # of the line that the location starts on, ending at the end of the line
   # that the location ends on.
   #
-  # source://prism//lib/prism/node.rb#62
+  # source://prism/lib/prism/node.rb#62
   sig { returns(String) }
   def slice_lines; end
 
   # Returns all of the lines of the source code associated with this node.
   #
-  # source://prism//lib/prism/node.rb#46
+  # source://prism/lib/prism/node.rb#46
   sig { returns(T::Array[String]) }
   def source_lines; end
 
   # The start offset of the node in the source. This method is effectively a
   # delegate method to the location object.
   #
-  # source://prism//lib/prism/node.rb#33
+  # source://prism/lib/prism/node.rb#33
   sig { returns(Integer) }
   def start_offset; end
 
@@ -25556,13 +25556,13 @@ class Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#77
+  # source://prism/lib/prism/node.rb#77
   sig { returns(T::Boolean) }
   def static_literal?; end
 
   # Convert this node into a graphviz dot graph string.
   #
-  # source://prism//lib/prism/node.rb#91
+  # source://prism/lib/prism/node.rb#91
   sig { returns(String) }
   def to_dot; end
 
@@ -25573,7 +25573,7 @@ class Prism::Node
   # Important to note is that the column given to this method should be in
   # bytes, as opposed to characters or code units.
   #
-  # source://prism//lib/prism/node.rb#102
+  # source://prism/lib/prism/node.rb#102
   sig { params(line: Integer, column: Integer).returns(T::Array[Prism::Node]) }
   def tunnel(line, column); end
 
@@ -25592,7 +25592,7 @@ class Prism::Node
   #
   # @raise [NoMethodError]
   #
-  # source://prism//lib/prism/node.rb#210
+  # source://prism/lib/prism/node.rb#210
   sig { abstract.returns(Symbol) }
   def type; end
 
@@ -25601,7 +25601,7 @@ class Prism::Node
   # An bitset of flags for this node. There are certain flags that are common
   # for all nodes, and then some nodes have specific flags.
   #
-  # source://prism//lib/prism/node.rb#68
+  # source://prism/lib/prism/node.rb#68
   sig { returns(Integer) }
   def flags; end
 
@@ -25609,7 +25609,7 @@ class Prism::Node
 
   # A pointer to the source that this node was created from.
   #
-  # source://prism//lib/prism/node.rb#14
+  # source://prism/lib/prism/node.rb#14
   sig { returns(Prism::Source) }
   def source; end
 
@@ -25620,7 +25620,7 @@ class Prism::Node
     #
     # @raise [NoMethodError]
     #
-    # source://prism//lib/prism/node.rb#153
+    # source://prism/lib/prism/node.rb#153
     def fields; end
 
     # Similar to #type, this method returns a symbol that you can use for
@@ -25630,26 +25630,26 @@ class Prism::Node
     #
     # @raise [NoMethodError]
     #
-    # source://prism//lib/prism/node.rb#218
+    # source://prism/lib/prism/node.rb#218
     def type; end
   end
 end
 
 # The flags that are common to all nodes.
 #
-# source://prism//lib/prism/node.rb#16855
+# source://prism/lib/prism/node.rb#16855
 module Prism::NodeFlags; end
 
 # A flag to indicate that the node is a candidate to emit a :line event
 # through tracepoint when compiled.
 #
-# source://prism//lib/prism/node.rb#16858
+# source://prism/lib/prism/node.rb#16858
 Prism::NodeFlags::NEWLINE = T.let(T.unsafe(nil), Integer)
 
 # A flag to indicate that the value that the node represents is a value that
 # can be determined at parse-time.
 #
-# source://prism//lib/prism/node.rb#16862
+# source://prism/lib/prism/node.rb#16862
 Prism::NodeFlags::STATIC_LITERAL = T.let(T.unsafe(nil), Integer)
 
 # Represents an implicit set of parameters through the use of numbered parameters within a block or lambda.
@@ -25657,13 +25657,13 @@ Prism::NodeFlags::STATIC_LITERAL = T.let(T.unsafe(nil), Integer)
 #     -> { _1 + _2 }
 #     ^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#12306
+# source://prism/lib/prism/node.rb#12306
 class Prism::NumberedParametersNode < ::Prism::Node
   # Initialize a new NumberedParametersNode node.
   #
   # @return [NumberedParametersNode] a new instance of NumberedParametersNode
   #
-  # source://prism//lib/prism/node.rb#12308
+  # source://prism/lib/prism/node.rb#12308
   sig do
     params(
       source: Prism::Source,
@@ -25678,36 +25678,36 @@ class Prism::NumberedParametersNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#12369
+  # source://prism/lib/prism/node.rb#12369
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#12317
+  # source://prism/lib/prism/node.rb#12317
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12322
+  # source://prism/lib/prism/node.rb#12322
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#12332
+  # source://prism/lib/prism/node.rb#12332
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#12327
+  # source://prism/lib/prism/node.rb#12327
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?maximum: Integer) -> NumberedParametersNode
   #
-  # source://prism//lib/prism/node.rb#12337
+  # source://prism/lib/prism/node.rb#12337
   sig do
     params(
       node_id: Integer,
@@ -25721,13 +25721,13 @@ class Prism::NumberedParametersNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12322
+  # source://prism/lib/prism/node.rb#12322
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, maximum: Integer }
   #
-  # source://prism//lib/prism/node.rb#12345
+  # source://prism/lib/prism/node.rb#12345
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -25736,26 +25736,26 @@ class Prism::NumberedParametersNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#12353
+  # source://prism/lib/prism/node.rb#12353
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader maximum: Integer
   #
-  # source://prism//lib/prism/node.rb#12350
+  # source://prism/lib/prism/node.rb#12350
   sig { returns(Integer) }
   def maximum; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#12358
+  # source://prism/lib/prism/node.rb#12358
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#12363
+    # source://prism/lib/prism/node.rb#12363
     def type; end
   end
 end
@@ -25765,13 +25765,13 @@ end
 #     $1
 #     ^^
 #
-# source://prism//lib/prism/node.rb#12379
+# source://prism/lib/prism/node.rb#12379
 class Prism::NumberedReferenceReadNode < ::Prism::Node
   # Initialize a new NumberedReferenceReadNode node.
   #
   # @return [NumberedReferenceReadNode] a new instance of NumberedReferenceReadNode
   #
-  # source://prism//lib/prism/node.rb#12381
+  # source://prism/lib/prism/node.rb#12381
   sig do
     params(
       source: Prism::Source,
@@ -25786,36 +25786,36 @@ class Prism::NumberedReferenceReadNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#12448
+  # source://prism/lib/prism/node.rb#12448
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#12390
+  # source://prism/lib/prism/node.rb#12390
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12395
+  # source://prism/lib/prism/node.rb#12395
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#12405
+  # source://prism/lib/prism/node.rb#12405
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#12400
+  # source://prism/lib/prism/node.rb#12400
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?number: Integer) -> NumberedReferenceReadNode
   #
-  # source://prism//lib/prism/node.rb#12410
+  # source://prism/lib/prism/node.rb#12410
   sig do
     params(
       node_id: Integer,
@@ -25829,13 +25829,13 @@ class Prism::NumberedReferenceReadNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12395
+  # source://prism/lib/prism/node.rb#12395
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, number: Integer }
   #
-  # source://prism//lib/prism/node.rb#12418
+  # source://prism/lib/prism/node.rb#12418
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -25844,7 +25844,7 @@ class Prism::NumberedReferenceReadNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#12432
+  # source://prism/lib/prism/node.rb#12432
   sig { override.returns(String) }
   def inspect; end
 
@@ -25856,20 +25856,20 @@ class Prism::NumberedReferenceReadNode < ::Prism::Node
   #
   #     $4294967296 # number `0`
   #
-  # source://prism//lib/prism/node.rb#12429
+  # source://prism/lib/prism/node.rb#12429
   sig { returns(Integer) }
   def number; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#12437
+  # source://prism/lib/prism/node.rb#12437
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#12442
+    # source://prism/lib/prism/node.rb#12442
     def type; end
   end
 end
@@ -25880,13 +25880,13 @@ end
 #           ^^^^
 #     end
 #
-# source://prism//lib/prism/node.rb#12459
+# source://prism/lib/prism/node.rb#12459
 class Prism::OptionalKeywordParameterNode < ::Prism::Node
   # Initialize a new OptionalKeywordParameterNode node.
   #
   # @return [OptionalKeywordParameterNode] a new instance of OptionalKeywordParameterNode
   #
-  # source://prism//lib/prism/node.rb#12461
+  # source://prism/lib/prism/node.rb#12461
   sig do
     params(
       source: Prism::Source,
@@ -25903,36 +25903,36 @@ class Prism::OptionalKeywordParameterNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#12539
+  # source://prism/lib/prism/node.rb#12539
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#12472
+  # source://prism/lib/prism/node.rb#12472
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12477
+  # source://prism/lib/prism/node.rb#12477
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#12487
+  # source://prism/lib/prism/node.rb#12487
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#12482
+  # source://prism/lib/prism/node.rb#12482
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?value: Prism::node) -> OptionalKeywordParameterNode
   #
-  # source://prism//lib/prism/node.rb#12492
+  # source://prism/lib/prism/node.rb#12492
   sig do
     params(
       node_id: Integer,
@@ -25948,13 +25948,13 @@ class Prism::OptionalKeywordParameterNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12477
+  # source://prism/lib/prism/node.rb#12477
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#12500
+  # source://prism/lib/prism/node.rb#12500
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -25963,19 +25963,19 @@ class Prism::OptionalKeywordParameterNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#12523
+  # source://prism/lib/prism/node.rb#12523
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#12510
+  # source://prism/lib/prism/node.rb#12510
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#12513
+  # source://prism/lib/prism/node.rb#12513
   sig { returns(Prism::Location) }
   def name_loc; end
 
@@ -25983,26 +25983,26 @@ class Prism::OptionalKeywordParameterNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#12505
+  # source://prism/lib/prism/node.rb#12505
   sig { returns(T::Boolean) }
   def repeated_parameter?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#12528
+  # source://prism/lib/prism/node.rb#12528
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#12520
+  # source://prism/lib/prism/node.rb#12520
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#12533
+    # source://prism/lib/prism/node.rb#12533
     def type; end
   end
 end
@@ -26013,13 +26013,13 @@ end
 #           ^^^^^
 #     end
 #
-# source://prism//lib/prism/node.rb#12553
+# source://prism/lib/prism/node.rb#12553
 class Prism::OptionalParameterNode < ::Prism::Node
   # Initialize a new OptionalParameterNode node.
   #
   # @return [OptionalParameterNode] a new instance of OptionalParameterNode
   #
-  # source://prism//lib/prism/node.rb#12555
+  # source://prism/lib/prism/node.rb#12555
   sig do
     params(
       source: Prism::Source,
@@ -26037,36 +26037,36 @@ class Prism::OptionalParameterNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#12646
+  # source://prism/lib/prism/node.rb#12646
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#12567
+  # source://prism/lib/prism/node.rb#12567
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12572
+  # source://prism/lib/prism/node.rb#12572
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#12582
+  # source://prism/lib/prism/node.rb#12582
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#12577
+  # source://prism/lib/prism/node.rb#12577
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> OptionalParameterNode
   #
-  # source://prism//lib/prism/node.rb#12587
+  # source://prism/lib/prism/node.rb#12587
   sig do
     params(
       node_id: Integer,
@@ -26083,13 +26083,13 @@ class Prism::OptionalParameterNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12572
+  # source://prism/lib/prism/node.rb#12572
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#12595
+  # source://prism/lib/prism/node.rb#12595
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -26098,31 +26098,31 @@ class Prism::OptionalParameterNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#12630
+  # source://prism/lib/prism/node.rb#12630
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#12605
+  # source://prism/lib/prism/node.rb#12605
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#12608
+  # source://prism/lib/prism/node.rb#12608
   sig { returns(Prism::Location) }
   def name_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#12625
+  # source://prism/lib/prism/node.rb#12625
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#12615
+  # source://prism/lib/prism/node.rb#12615
   sig { returns(Prism::Location) }
   def operator_loc; end
 
@@ -26130,26 +26130,26 @@ class Prism::OptionalParameterNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#12600
+  # source://prism/lib/prism/node.rb#12600
   sig { returns(T::Boolean) }
   def repeated_parameter?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#12635
+  # source://prism/lib/prism/node.rb#12635
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader value: Prism::node
   #
-  # source://prism//lib/prism/node.rb#12622
+  # source://prism/lib/prism/node.rb#12622
   sig { returns(Prism::Node) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#12640
+    # source://prism/lib/prism/node.rb#12640
     def type; end
   end
 end
@@ -26159,13 +26159,13 @@ end
 #     left or right
 #     ^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#12660
+# source://prism/lib/prism/node.rb#12660
 class Prism::OrNode < ::Prism::Node
   # Initialize a new OrNode node.
   #
   # @return [OrNode] a new instance of OrNode
   #
-  # source://prism//lib/prism/node.rb#12662
+  # source://prism/lib/prism/node.rb#12662
   sig do
     params(
       source: Prism::Source,
@@ -26182,36 +26182,36 @@ class Prism::OrNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#12755
+  # source://prism/lib/prism/node.rb#12755
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#12673
+  # source://prism/lib/prism/node.rb#12673
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12678
+  # source://prism/lib/prism/node.rb#12678
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#12688
+  # source://prism/lib/prism/node.rb#12688
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#12683
+  # source://prism/lib/prism/node.rb#12683
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?left: Prism::node, ?right: Prism::node, ?operator_loc: Location) -> OrNode
   #
-  # source://prism//lib/prism/node.rb#12693
+  # source://prism/lib/prism/node.rb#12693
   sig do
     params(
       node_id: Integer,
@@ -26227,13 +26227,13 @@ class Prism::OrNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12678
+  # source://prism/lib/prism/node.rb#12678
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, left: Prism::node, right: Prism::node, operator_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#12701
+  # source://prism/lib/prism/node.rb#12701
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -26242,7 +26242,7 @@ class Prism::OrNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#12739
+  # source://prism/lib/prism/node.rb#12739
   sig { override.returns(String) }
   def inspect; end
 
@@ -26254,13 +26254,13 @@ class Prism::OrNode < ::Prism::Node
   #     1 || 2
   #     ^
   #
-  # source://prism//lib/prism/node.rb#12712
+  # source://prism/lib/prism/node.rb#12712
   sig { returns(Prism::Node) }
   def left; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#12734
+  # source://prism/lib/prism/node.rb#12734
   sig { returns(String) }
   def operator; end
 
@@ -26269,7 +26269,7 @@ class Prism::OrNode < ::Prism::Node
   #     left or right
   #          ^^
   #
-  # source://prism//lib/prism/node.rb#12727
+  # source://prism/lib/prism/node.rb#12727
   sig { returns(Prism::Location) }
   def operator_loc; end
 
@@ -26281,274 +26281,274 @@ class Prism::OrNode < ::Prism::Node
   #     1 or 2
   #          ^
   #
-  # source://prism//lib/prism/node.rb#12721
+  # source://prism/lib/prism/node.rb#12721
   sig { returns(Prism::Node) }
   def right; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#12744
+  # source://prism/lib/prism/node.rb#12744
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#12749
+    # source://prism/lib/prism/node.rb#12749
     def type; end
   end
 end
 
 # A parser for the pack template language.
 #
-# source://prism//lib/prism/pack.rb#6
+# source://prism/lib/prism/pack.rb#6
 module Prism::Pack
   class << self
     def parse(_arg0, _arg1, _arg2); end
   end
 end
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::AGNOSTIC_ENDIAN = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::BACK = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::BER = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::BIG_ENDIAN = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::COMMENT = T.let(T.unsafe(nil), Symbol)
 
 # A directive in the pack template language.
 #
-# source://prism//lib/prism/pack.rb#60
+# source://prism/lib/prism/pack.rb#60
 class Prism::Pack::Directive
   # Initialize a new directive with the given values.
   #
   # @return [Directive] a new instance of Directive
   #
-  # source://prism//lib/prism/pack.rb#89
+  # source://prism/lib/prism/pack.rb#89
   def initialize(version, variant, source, type, signed, endian, size, length_type, length); end
 
   # Provide a human-readable description of the directive.
   #
-  # source://prism//lib/prism/pack.rb#131
+  # source://prism/lib/prism/pack.rb#131
   def describe; end
 
   # The type of endianness of the directive.
   #
-  # source://prism//lib/prism/pack.rb#77
+  # source://prism/lib/prism/pack.rb#77
   def endian; end
 
   # The length of this directive (used for integers).
   #
-  # source://prism//lib/prism/pack.rb#86
+  # source://prism/lib/prism/pack.rb#86
   def length; end
 
   # The length type of this directive (used for integers).
   #
-  # source://prism//lib/prism/pack.rb#83
+  # source://prism/lib/prism/pack.rb#83
   def length_type; end
 
   # The type of signedness of the directive.
   #
-  # source://prism//lib/prism/pack.rb#74
+  # source://prism/lib/prism/pack.rb#74
   def signed; end
 
   # The size of the directive.
   #
-  # source://prism//lib/prism/pack.rb#80
+  # source://prism/lib/prism/pack.rb#80
   def size; end
 
   # A byteslice of the source string that this directive represents.
   #
-  # source://prism//lib/prism/pack.rb#68
+  # source://prism/lib/prism/pack.rb#68
   def source; end
 
   # The type of the directive.
   #
-  # source://prism//lib/prism/pack.rb#71
+  # source://prism/lib/prism/pack.rb#71
   def type; end
 
   # A symbol representing whether or not we are packing or unpacking.
   #
-  # source://prism//lib/prism/pack.rb#65
+  # source://prism/lib/prism/pack.rb#65
   def variant; end
 
   # A symbol representing the version of Ruby.
   #
-  # source://prism//lib/prism/pack.rb#62
+  # source://prism/lib/prism/pack.rb#62
   def version; end
 end
 
 # The descriptions of the various types of endianness.
 #
-# source://prism//lib/prism/pack.rb#102
+# source://prism/lib/prism/pack.rb#102
 Prism::Pack::Directive::ENDIAN_DESCRIPTIONS = T.let(T.unsafe(nil), Hash)
 
 # The descriptions of the various types of signedness.
 #
-# source://prism//lib/prism/pack.rb#111
+# source://prism/lib/prism/pack.rb#111
 Prism::Pack::Directive::SIGNED_DESCRIPTIONS = T.let(T.unsafe(nil), Hash)
 
 # The descriptions of the various types of sizes.
 #
-# source://prism//lib/prism/pack.rb#118
+# source://prism/lib/prism/pack.rb#118
 Prism::Pack::Directive::SIZE_DESCRIPTIONS = T.let(T.unsafe(nil), Hash)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::ENDIAN_NA = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::FLOAT = T.let(T.unsafe(nil), Symbol)
 
 # The result of parsing a pack template.
 #
-# source://prism//lib/prism/pack.rb#198
+# source://prism/lib/prism/pack.rb#198
 class Prism::Pack::Format
   # Create a new Format with the given directives and encoding.
   #
   # @return [Format] a new instance of Format
   #
-  # source://prism//lib/prism/pack.rb#206
+  # source://prism/lib/prism/pack.rb#206
   def initialize(directives, encoding); end
 
   # Provide a human-readable description of the format.
   #
-  # source://prism//lib/prism/pack.rb#212
+  # source://prism/lib/prism/pack.rb#212
   def describe; end
 
   # A list of the directives in the template.
   #
-  # source://prism//lib/prism/pack.rb#200
+  # source://prism/lib/prism/pack.rb#200
   def directives; end
 
   # The encoding of the template.
   #
-  # source://prism//lib/prism/pack.rb#203
+  # source://prism/lib/prism/pack.rb#203
   def encoding; end
 end
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::INTEGER = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::LENGTH_FIXED = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::LENGTH_MAX = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::LENGTH_NA = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::LENGTH_RELATIVE = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::LITTLE_ENDIAN = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::MOVE = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::NATIVE_ENDIAN = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::NULL = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::SIGNED = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::SIGNED_NA = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::SIZE_16 = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::SIZE_32 = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::SIZE_64 = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::SIZE_8 = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::SIZE_INT = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::SIZE_LONG = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::SIZE_LONG_LONG = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::SIZE_NA = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::SIZE_P = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::SIZE_SHORT = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::SPACE = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::STRING_BASE64 = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::STRING_FIXED = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::STRING_HEX_HIGH = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::STRING_HEX_LOW = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::STRING_LSB = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::STRING_MIME = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::STRING_MSB = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::STRING_NULL_PADDED = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::STRING_NULL_TERMINATED = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::STRING_POINTER = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::STRING_SPACE_PADDED = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::STRING_UU = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::UNSIGNED = T.let(T.unsafe(nil), Symbol)
 
-# source://prism//lib/prism/pack.rb#56
+# source://prism/lib/prism/pack.rb#56
 Prism::Pack::UTF8 = T.let(T.unsafe(nil), Symbol)
 
 # Flags for parameter nodes.
 #
-# source://prism//lib/prism/node.rb#16768
+# source://prism/lib/prism/node.rb#16768
 module Prism::ParameterFlags; end
 
 # a parameter name that has been repeated in the method signature
 #
-# source://prism//lib/prism/node.rb#16770
+# source://prism/lib/prism/node.rb#16770
 Prism::ParameterFlags::REPEATED_PARAMETER = T.let(T.unsafe(nil), Integer)
 
 # Represents the list of parameters on a method, block, or lambda definition.
@@ -26557,13 +26557,13 @@ Prism::ParameterFlags::REPEATED_PARAMETER = T.let(T.unsafe(nil), Integer)
 #           ^^^^^^^
 #     end
 #
-# source://prism//lib/prism/node.rb#12768
+# source://prism/lib/prism/node.rb#12768
 class Prism::ParametersNode < ::Prism::Node
   # Initialize a new ParametersNode node.
   #
   # @return [ParametersNode] a new instance of ParametersNode
   #
-  # source://prism//lib/prism/node.rb#12770
+  # source://prism/lib/prism/node.rb#12770
   sig do
     params(
       source: Prism::Source,
@@ -26584,42 +26584,42 @@ class Prism::ParametersNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#12863
+  # source://prism/lib/prism/node.rb#12863
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#12785
+  # source://prism/lib/prism/node.rb#12785
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader block: BlockParameterNode?
   #
-  # source://prism//lib/prism/node.rb#12844
+  # source://prism/lib/prism/node.rb#12844
   sig { returns(T.nilable(Prism::BlockParameterNode)) }
   def block; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12790
+  # source://prism/lib/prism/node.rb#12790
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#12808
+  # source://prism/lib/prism/node.rb#12808
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#12795
+  # source://prism/lib/prism/node.rb#12795
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?requireds: Array[RequiredParameterNode | MultiTargetNode], ?optionals: Array[OptionalParameterNode], ?rest: RestParameterNode | ImplicitRestNode | nil, ?posts: Array[RequiredParameterNode | MultiTargetNode | KeywordRestParameterNode | NoKeywordsParameterNode | ForwardingParameterNode], ?keywords: Array[RequiredKeywordParameterNode | OptionalKeywordParameterNode], ?keyword_rest: KeywordRestParameterNode | ForwardingParameterNode | NoKeywordsParameterNode | nil, ?block: BlockParameterNode?) -> ParametersNode
   #
-  # source://prism//lib/prism/node.rb#12813
+  # source://prism/lib/prism/node.rb#12813
   sig do
     params(
       node_id: Integer,
@@ -26639,13 +26639,13 @@ class Prism::ParametersNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12790
+  # source://prism/lib/prism/node.rb#12790
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, requireds: Array[RequiredParameterNode | MultiTargetNode], optionals: Array[OptionalParameterNode], rest: RestParameterNode | ImplicitRestNode | nil, posts: Array[RequiredParameterNode | MultiTargetNode | KeywordRestParameterNode | NoKeywordsParameterNode | ForwardingParameterNode], keywords: Array[RequiredKeywordParameterNode | OptionalKeywordParameterNode], keyword_rest: KeywordRestParameterNode | ForwardingParameterNode | NoKeywordsParameterNode | nil, block: BlockParameterNode? }
   #
-  # source://prism//lib/prism/node.rb#12821
+  # source://prism/lib/prism/node.rb#12821
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -26654,13 +26654,13 @@ class Prism::ParametersNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#12847
+  # source://prism/lib/prism/node.rb#12847
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader keyword_rest: KeywordRestParameterNode | ForwardingParameterNode | NoKeywordsParameterNode | nil
   #
-  # source://prism//lib/prism/node.rb#12841
+  # source://prism/lib/prism/node.rb#12841
   sig do
     returns(T.nilable(T.any(Prism::KeywordRestParameterNode, Prism::ForwardingParameterNode, Prism::NoKeywordsParameterNode)))
   end
@@ -26668,19 +26668,19 @@ class Prism::ParametersNode < ::Prism::Node
 
   # attr_reader keywords: Array[RequiredKeywordParameterNode | OptionalKeywordParameterNode]
   #
-  # source://prism//lib/prism/node.rb#12838
+  # source://prism/lib/prism/node.rb#12838
   sig { returns(T::Array[T.any(Prism::RequiredKeywordParameterNode, Prism::OptionalKeywordParameterNode)]) }
   def keywords; end
 
   # attr_reader optionals: Array[OptionalParameterNode]
   #
-  # source://prism//lib/prism/node.rb#12829
+  # source://prism/lib/prism/node.rb#12829
   sig { returns(T::Array[Prism::OptionalParameterNode]) }
   def optionals; end
 
   # attr_reader posts: Array[RequiredParameterNode | MultiTargetNode | KeywordRestParameterNode | NoKeywordsParameterNode | ForwardingParameterNode]
   #
-  # source://prism//lib/prism/node.rb#12835
+  # source://prism/lib/prism/node.rb#12835
   sig do
     returns(T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode, Prism::KeywordRestParameterNode, Prism::NoKeywordsParameterNode, Prism::ForwardingParameterNode)])
   end
@@ -26688,32 +26688,32 @@ class Prism::ParametersNode < ::Prism::Node
 
   # attr_reader requireds: Array[RequiredParameterNode | MultiTargetNode]
   #
-  # source://prism//lib/prism/node.rb#12826
+  # source://prism/lib/prism/node.rb#12826
   sig { returns(T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode)]) }
   def requireds; end
 
   # attr_reader rest: RestParameterNode | ImplicitRestNode | nil
   #
-  # source://prism//lib/prism/node.rb#12832
+  # source://prism/lib/prism/node.rb#12832
   sig { returns(T.nilable(T.any(Prism::RestParameterNode, Prism::ImplicitRestNode))) }
   def rest; end
 
   # Mirrors the Method#parameters method.
   #
-  # source://prism//lib/prism/node_ext.rb#269
+  # source://prism/lib/prism/node_ext.rb#269
   sig { returns(T::Array[T.any([Symbol, Symbol], [Symbol])]) }
   def signature; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#12852
+  # source://prism/lib/prism/node.rb#12852
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#12857
+    # source://prism/lib/prism/node.rb#12857
     def type; end
   end
 end
@@ -26723,13 +26723,13 @@ end
 #     (10 + 34)
 #     ^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#12883
+# source://prism/lib/prism/node.rb#12883
 class Prism::ParenthesesNode < ::Prism::Node
   # Initialize a new ParenthesesNode node.
   #
   # @return [ParenthesesNode] a new instance of ParenthesesNode
   #
-  # source://prism//lib/prism/node.rb#12885
+  # source://prism/lib/prism/node.rb#12885
   sig do
     params(
       source: Prism::Source,
@@ -26746,54 +26746,54 @@ class Prism::ParenthesesNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#12974
+  # source://prism/lib/prism/node.rb#12974
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#12896
+  # source://prism/lib/prism/node.rb#12896
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader body: Prism::node?
   #
-  # source://prism//lib/prism/node.rb#12931
+  # source://prism/lib/prism/node.rb#12931
   sig { returns(T.nilable(Prism::Node)) }
   def body; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12901
+  # source://prism/lib/prism/node.rb#12901
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String
   #
-  # source://prism//lib/prism/node.rb#12953
+  # source://prism/lib/prism/node.rb#12953
   sig { returns(String) }
   def closing; end
 
   # attr_reader closing_loc: Location
   #
-  # source://prism//lib/prism/node.rb#12941
+  # source://prism/lib/prism/node.rb#12941
   sig { returns(Prism::Location) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#12913
+  # source://prism/lib/prism/node.rb#12913
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#12906
+  # source://prism/lib/prism/node.rb#12906
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?body: Prism::node?, ?opening_loc: Location, ?closing_loc: Location) -> ParenthesesNode
   #
-  # source://prism//lib/prism/node.rb#12918
+  # source://prism/lib/prism/node.rb#12918
   sig do
     params(
       node_id: Integer,
@@ -26809,13 +26809,13 @@ class Prism::ParenthesesNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#12901
+  # source://prism/lib/prism/node.rb#12901
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, body: Prism::node?, opening_loc: Location, closing_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#12926
+  # source://prism/lib/prism/node.rb#12926
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -26824,98 +26824,98 @@ class Prism::ParenthesesNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#12958
+  # source://prism/lib/prism/node.rb#12958
   sig { override.returns(String) }
   def inspect; end
 
-  # source://prism//lib/prism/parse_result/newlines.rb#85
+  # source://prism/lib/prism/parse_result/newlines.rb#85
   def newline_flag!(lines); end
 
   # def opening: () -> String
   #
-  # source://prism//lib/prism/node.rb#12948
+  # source://prism/lib/prism/node.rb#12948
   sig { returns(String) }
   def opening; end
 
   # attr_reader opening_loc: Location
   #
-  # source://prism//lib/prism/node.rb#12934
+  # source://prism/lib/prism/node.rb#12934
   sig { returns(Prism::Location) }
   def opening_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#12963
+  # source://prism/lib/prism/node.rb#12963
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#12968
+    # source://prism/lib/prism/node.rb#12968
     def type; end
   end
 end
 
 # This represents an error that was encountered during parsing.
 #
-# source://prism//lib/prism/parse_result.rb#592
+# source://prism/lib/prism/parse_result.rb#592
 class Prism::ParseError
   # Create a new error object with the given message and location.
   #
   # @return [ParseError] a new instance of ParseError
   #
-  # source://prism//lib/prism/parse_result.rb#607
+  # source://prism/lib/prism/parse_result.rb#607
   sig { params(type: Symbol, message: String, location: Prism::Location, level: Symbol).void }
   def initialize(type, message, location, level); end
 
   # Implement the hash pattern matching interface for ParseError.
   #
-  # source://prism//lib/prism/parse_result.rb#615
+  # source://prism/lib/prism/parse_result.rb#615
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # Returns a string representation of this error.
   #
-  # source://prism//lib/prism/parse_result.rb#620
+  # source://prism/lib/prism/parse_result.rb#620
   sig { returns(String) }
   def inspect; end
 
   # The level of this error.
   #
-  # source://prism//lib/prism/parse_result.rb#604
+  # source://prism/lib/prism/parse_result.rb#604
   sig { returns(Symbol) }
   def level; end
 
   # A Location object representing the location of this error in the source.
   #
-  # source://prism//lib/prism/parse_result.rb#601
+  # source://prism/lib/prism/parse_result.rb#601
   sig { returns(Prism::Location) }
   def location; end
 
   # The message associated with this error.
   #
-  # source://prism//lib/prism/parse_result.rb#598
+  # source://prism/lib/prism/parse_result.rb#598
   sig { returns(String) }
   def message; end
 
   # The type of error. This is an _internal_ symbol that is used for
   # communicating with translation layers. It is not meant to be public API.
   #
-  # source://prism//lib/prism/parse_result.rb#595
+  # source://prism/lib/prism/parse_result.rb#595
   sig { returns(Symbol) }
   def type; end
 end
 
 # This is a result specific to the `parse_lex` and `parse_lex_file` methods.
 #
-# source://prism//lib/prism/parse_result.rb#781
+# source://prism/lib/prism/parse_result.rb#781
 class Prism::ParseLexResult < ::Prism::Result
   # Create a new parse lex result object with the given values.
   #
   # @return [ParseLexResult] a new instance of ParseLexResult
   #
-  # source://prism//lib/prism/parse_result.rb#787
+  # source://prism/lib/prism/parse_result.rb#787
   sig do
     params(
       value: [Prism::ProgramNode, T::Array[T.untyped]],
@@ -26931,27 +26931,27 @@ class Prism::ParseLexResult < ::Prism::Result
 
   # Implement the hash pattern matching interface for ParseLexResult.
   #
-  # source://prism//lib/prism/parse_result.rb#793
+  # source://prism/lib/prism/parse_result.rb#793
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # A tuple of the syntax tree and the list of tokens that were parsed from
   # the source code.
   #
-  # source://prism//lib/prism/parse_result.rb#784
+  # source://prism/lib/prism/parse_result.rb#784
   sig { returns([Prism::ProgramNode, T::Array[T.untyped]]) }
   def value; end
 end
 
 # This is a result specific to the `parse` and `parse_file` methods.
 #
-# source://prism//lib/prism/parse_result.rb#722
+# source://prism/lib/prism/parse_result.rb#722
 class Prism::ParseResult < ::Prism::Result
   # Create a new parse result object with the given values.
   #
   # @return [ParseResult] a new instance of ParseResult
   #
-  # source://prism//lib/prism/parse_result.rb#735
+  # source://prism/lib/prism/parse_result.rb#735
   sig do
     params(
       value: Prism::ProgramNode,
@@ -26967,30 +26967,30 @@ class Prism::ParseResult < ::Prism::Result
 
   # Attach the list of comments to their respective locations in the tree.
   #
-  # source://prism//lib/prism/parse_result.rb#746
+  # source://prism/lib/prism/parse_result.rb#746
   def attach_comments!; end
 
   # Implement the hash pattern matching interface for ParseResult.
   #
-  # source://prism//lib/prism/parse_result.rb#741
+  # source://prism/lib/prism/parse_result.rb#741
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # Returns a string representation of the syntax tree with the errors
   # displayed inline.
   #
-  # source://prism//lib/prism/parse_result.rb#758
+  # source://prism/lib/prism/parse_result.rb#758
   def errors_format; end
 
   # Walk the tree and mark nodes that are on a new line, loosely emulating
   # the behavior of CRuby's `:line` tracepoint event.
   #
-  # source://prism//lib/prism/parse_result.rb#752
+  # source://prism/lib/prism/parse_result.rb#752
   def mark_newlines!; end
 
   # The syntax tree that was parsed from the source code.
   #
-  # source://prism//lib/prism/parse_result.rb#732
+  # source://prism/lib/prism/parse_result.rb#732
   sig { returns(Prism::ProgramNode) }
   def value; end
 end
@@ -27010,25 +27010,25 @@ end
 # the comment. Otherwise it will favor attaching to the nearest location
 # that is after the comment.
 #
-# source://prism//lib/prism/parse_result/comments.rb#19
+# source://prism/lib/prism/parse_result/comments.rb#19
 class Prism::ParseResult::Comments
   # Create a new Comments object that will attach comments to the given
   # parse result.
   #
   # @return [Comments] a new instance of Comments
   #
-  # source://prism//lib/prism/parse_result/comments.rb#86
+  # source://prism/lib/prism/parse_result/comments.rb#86
   def initialize(parse_result); end
 
   # Attach the comments to their respective locations in the tree by
   # mutating the parse result.
   #
-  # source://prism//lib/prism/parse_result/comments.rb#92
+  # source://prism/lib/prism/parse_result/comments.rb#92
   def attach!; end
 
   # The parse result that we are attaching comments to.
   #
-  # source://prism//lib/prism/parse_result/comments.rb#82
+  # source://prism/lib/prism/parse_result/comments.rb#82
   def parse_result; end
 
   private
@@ -27036,92 +27036,92 @@ class Prism::ParseResult::Comments
   # Responsible for finding the nearest targets to the given comment within
   # the context of the given encapsulating node.
   #
-  # source://prism//lib/prism/parse_result/comments.rb#119
+  # source://prism/lib/prism/parse_result/comments.rb#119
   def nearest_targets(node, comment); end
 end
 
 # A target for attaching comments that is based on a location field on a
 # node. For example, the `end` token of a ClassNode.
 #
-# source://prism//lib/prism/parse_result/comments.rb#53
+# source://prism/lib/prism/parse_result/comments.rb#53
 class Prism::ParseResult::Comments::LocationTarget
   # @return [LocationTarget] a new instance of LocationTarget
   #
-  # source://prism//lib/prism/parse_result/comments.rb#56
+  # source://prism/lib/prism/parse_result/comments.rb#56
   def initialize(location); end
 
   # @return [Boolean]
   #
-  # source://prism//lib/prism/parse_result/comments.rb#68
+  # source://prism/lib/prism/parse_result/comments.rb#68
   def encloses?(comment); end
 
-  # source://prism//lib/prism/parse_result/comments.rb#64
+  # source://prism/lib/prism/parse_result/comments.rb#64
   def end_offset; end
 
-  # source://prism//lib/prism/parse_result/comments.rb#72
+  # source://prism/lib/prism/parse_result/comments.rb#72
   def leading_comment(comment); end
 
-  # source://prism//lib/prism/parse_result/comments.rb#54
+  # source://prism/lib/prism/parse_result/comments.rb#54
   def location; end
 
-  # source://prism//lib/prism/parse_result/comments.rb#60
+  # source://prism/lib/prism/parse_result/comments.rb#60
   def start_offset; end
 
-  # source://prism//lib/prism/parse_result/comments.rb#76
+  # source://prism/lib/prism/parse_result/comments.rb#76
   def trailing_comment(comment); end
 end
 
 # A target for attaching comments that is based on a specific node's
 # location.
 #
-# source://prism//lib/prism/parse_result/comments.rb#22
+# source://prism/lib/prism/parse_result/comments.rb#22
 class Prism::ParseResult::Comments::NodeTarget
   # @return [NodeTarget] a new instance of NodeTarget
   #
-  # source://prism//lib/prism/parse_result/comments.rb#25
+  # source://prism/lib/prism/parse_result/comments.rb#25
   def initialize(node); end
 
   # @return [Boolean]
   #
-  # source://prism//lib/prism/parse_result/comments.rb#37
+  # source://prism/lib/prism/parse_result/comments.rb#37
   def encloses?(comment); end
 
-  # source://prism//lib/prism/parse_result/comments.rb#33
+  # source://prism/lib/prism/parse_result/comments.rb#33
   def end_offset; end
 
-  # source://prism//lib/prism/parse_result/comments.rb#42
+  # source://prism/lib/prism/parse_result/comments.rb#42
   def leading_comment(comment); end
 
-  # source://prism//lib/prism/parse_result/comments.rb#23
+  # source://prism/lib/prism/parse_result/comments.rb#23
   def node; end
 
-  # source://prism//lib/prism/parse_result/comments.rb#29
+  # source://prism/lib/prism/parse_result/comments.rb#29
   def start_offset; end
 
-  # source://prism//lib/prism/parse_result/comments.rb#46
+  # source://prism/lib/prism/parse_result/comments.rb#46
   def trailing_comment(comment); end
 end
 
 # An object to represent the set of errors on a parse result. This object
 # can be used to format the errors in a human-readable way.
 #
-# source://prism//lib/prism/parse_result/errors.rb#9
+# source://prism/lib/prism/parse_result/errors.rb#9
 class Prism::ParseResult::Errors
   # Initialize a new set of errors from the given parse result.
   #
   # @return [Errors] a new instance of Errors
   #
-  # source://prism//lib/prism/parse_result/errors.rb#14
+  # source://prism/lib/prism/parse_result/errors.rb#14
   def initialize(parse_result); end
 
   # Formats the errors in a human-readable way and return them as a string.
   #
-  # source://prism//lib/prism/parse_result/errors.rb#19
+  # source://prism/lib/prism/parse_result/errors.rb#19
   def format; end
 
   # The parse result that contains the errors.
   #
-  # source://prism//lib/prism/parse_result/errors.rb#11
+  # source://prism/lib/prism/parse_result/errors.rb#11
   def parse_result; end
 end
 
@@ -27146,87 +27146,87 @@ end
 # that case. We do that to avoid storing the extra `@newline` instance
 # variable on every node if we don't need it.
 #
-# source://prism//lib/prism/parse_result/newlines.rb#25
+# source://prism/lib/prism/parse_result/newlines.rb#25
 class Prism::ParseResult::Newlines < ::Prism::Visitor
   # Create a new Newlines visitor with the given newline offsets.
   #
   # @return [Newlines] a new instance of Newlines
   #
-  # source://prism//lib/prism/parse_result/newlines.rb#27
+  # source://prism/lib/prism/parse_result/newlines.rb#27
   def initialize(lines); end
 
   # Permit block/lambda nodes to mark newlines within themselves.
   #
-  # source://prism//lib/prism/parse_result/newlines.rb#33
+  # source://prism/lib/prism/parse_result/newlines.rb#33
   def visit_block_node(node); end
 
   # Mark if/unless nodes as newlines.
   #
-  # source://prism//lib/prism/parse_result/newlines.rb#47
+  # source://prism/lib/prism/parse_result/newlines.rb#47
   def visit_if_node(node); end
 
   # Permit block/lambda nodes to mark newlines within themselves.
   #
-  # source://prism//lib/prism/parse_result/newlines.rb#33
+  # source://prism/lib/prism/parse_result/newlines.rb#33
   def visit_lambda_node(node); end
 
   # Permit statements lists to mark newlines within themselves.
   #
-  # source://prism//lib/prism/parse_result/newlines.rb#55
+  # source://prism/lib/prism/parse_result/newlines.rb#55
   def visit_statements_node(node); end
 
   # Mark if/unless nodes as newlines.
   #
-  # source://prism//lib/prism/parse_result/newlines.rb#47
+  # source://prism/lib/prism/parse_result/newlines.rb#47
   def visit_unless_node(node); end
 end
 
 # This represents a warning that was encountered during parsing.
 #
-# source://prism//lib/prism/parse_result.rb#626
+# source://prism/lib/prism/parse_result.rb#626
 class Prism::ParseWarning
   # Create a new warning object with the given message and location.
   #
   # @return [ParseWarning] a new instance of ParseWarning
   #
-  # source://prism//lib/prism/parse_result.rb#641
+  # source://prism/lib/prism/parse_result.rb#641
   sig { params(type: Symbol, message: String, location: Prism::Location, level: Symbol).void }
   def initialize(type, message, location, level); end
 
   # Implement the hash pattern matching interface for ParseWarning.
   #
-  # source://prism//lib/prism/parse_result.rb#649
+  # source://prism/lib/prism/parse_result.rb#649
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # Returns a string representation of this warning.
   #
-  # source://prism//lib/prism/parse_result.rb#654
+  # source://prism/lib/prism/parse_result.rb#654
   sig { returns(String) }
   def inspect; end
 
   # The level of this warning.
   #
-  # source://prism//lib/prism/parse_result.rb#638
+  # source://prism/lib/prism/parse_result.rb#638
   sig { returns(Symbol) }
   def level; end
 
   # A Location object representing the location of this warning in the source.
   #
-  # source://prism//lib/prism/parse_result.rb#635
+  # source://prism/lib/prism/parse_result.rb#635
   sig { returns(Prism::Location) }
   def location; end
 
   # The message associated with this warning.
   #
-  # source://prism//lib/prism/parse_result.rb#632
+  # source://prism/lib/prism/parse_result.rb#632
   sig { returns(String) }
   def message; end
 
   # The type of warning. This is an _internal_ symbol that is used for
   # communicating with translation layers. It is not meant to be public API.
   #
-  # source://prism//lib/prism/parse_result.rb#629
+  # source://prism/lib/prism/parse_result.rb#629
   sig { returns(Symbol) }
   def type; end
 end
@@ -27265,14 +27265,14 @@ end
 # do not yet support) then a Prism::Pattern::CompilationError will be
 # raised.
 #
-# source://prism//lib/prism/pattern.rb#37
+# source://prism/lib/prism/pattern.rb#37
 class Prism::Pattern
   # Create a new pattern with the given query. The query should be a string
   # containing a Ruby pattern matching expression.
   #
   # @return [Pattern] a new instance of Pattern
   #
-  # source://prism//lib/prism/pattern.rb#63
+  # source://prism/lib/prism/pattern.rb#63
   def initialize(query); end
 
   # Compile the query into a callable object that can be used to match against
@@ -27280,12 +27280,12 @@ class Prism::Pattern
   #
   # @raise [CompilationError]
   #
-  # source://prism//lib/prism/pattern.rb#70
+  # source://prism/lib/prism/pattern.rb#70
   def compile; end
 
   # The query that this pattern was initialized with.
   #
-  # source://prism//lib/prism/pattern.rb#59
+  # source://prism/lib/prism/pattern.rb#59
   def query; end
 
   # Scan the given node and all of its children for nodes that match the
@@ -27293,7 +27293,7 @@ class Prism::Pattern
   # matches the pattern. If no block is given, an enumerator will be returned
   # that will yield each node that matches the pattern.
   #
-  # source://prism//lib/prism/pattern.rb#86
+  # source://prism/lib/prism/pattern.rb#86
   def scan(root); end
 
   private
@@ -27301,94 +27301,94 @@ class Prism::Pattern
   # Shortcut for combining two procs into one that returns true if both return
   # true.
   #
-  # source://prism//lib/prism/pattern.rb#102
+  # source://prism/lib/prism/pattern.rb#102
   def combine_and(left, right); end
 
   # Shortcut for combining two procs into one that returns true if either
   # returns true.
   #
-  # source://prism//lib/prism/pattern.rb#108
+  # source://prism/lib/prism/pattern.rb#108
   def combine_or(left, right); end
 
   # in foo | bar
   #
-  # source://prism//lib/prism/pattern.rb#143
+  # source://prism/lib/prism/pattern.rb#143
   def compile_alternation_pattern_node(node); end
 
   # in [foo, bar, baz]
   #
-  # source://prism//lib/prism/pattern.rb#118
+  # source://prism/lib/prism/pattern.rb#118
   def compile_array_pattern_node(node); end
 
   # Compile a name associated with a constant.
   #
-  # source://prism//lib/prism/pattern.rb#168
+  # source://prism/lib/prism/pattern.rb#168
   def compile_constant_name(node, name); end
 
   # in Prism::ConstantReadNode
   #
-  # source://prism//lib/prism/pattern.rb#148
+  # source://prism/lib/prism/pattern.rb#148
   def compile_constant_path_node(node); end
 
   # in ConstantReadNode
   # in String
   #
-  # source://prism//lib/prism/pattern.rb#163
+  # source://prism/lib/prism/pattern.rb#163
   def compile_constant_read_node(node); end
 
   # Raise an error because the given node is not supported.
   #
   # @raise [CompilationError]
   #
-  # source://prism//lib/prism/pattern.rb#113
+  # source://prism/lib/prism/pattern.rb#113
   def compile_error(node); end
 
   # in InstanceVariableReadNode[name: Symbol]
   # in { name: Symbol }
   #
-  # source://prism//lib/prism/pattern.rb#184
+  # source://prism/lib/prism/pattern.rb#184
   def compile_hash_pattern_node(node); end
 
   # in nil
   #
-  # source://prism//lib/prism/pattern.rb#214
+  # source://prism/lib/prism/pattern.rb#214
   def compile_nil_node(node); end
 
   # Compile any kind of node. Dispatch out to the individual compilation
   # methods based on the type of node.
   #
-  # source://prism//lib/prism/pattern.rb#243
+  # source://prism/lib/prism/pattern.rb#243
   def compile_node(node); end
 
   # in /foo/
   #
-  # source://prism//lib/prism/pattern.rb#219
+  # source://prism/lib/prism/pattern.rb#219
   def compile_regular_expression_node(node); end
 
   # in ""
   # in "foo"
   #
-  # source://prism//lib/prism/pattern.rb#227
+  # source://prism/lib/prism/pattern.rb#227
   def compile_string_node(node); end
 
   # in :+
   # in :foo
   #
-  # source://prism//lib/prism/pattern.rb#235
+  # source://prism/lib/prism/pattern.rb#235
   def compile_symbol_node(node); end
 end
 
 # Raised when the query given to a pattern is either invalid Ruby syntax or
 # is using syntax that we don't yet support.
 #
-# source://prism//lib/prism/pattern.rb#40
+# source://prism/lib/prism/pattern.rb#40
 class Prism::Pattern::CompilationError < ::StandardError
   # Create a new CompilationError with the given representation of the node
   # that caused the error.
   #
   # @return [CompilationError] a new instance of CompilationError
   #
-  # source://prism//lib/prism/pattern.rb#43
+  # source://prism/lib/prism/pattern.rb#43
   def initialize(repr); end
 end
 
@@ -27397,13 +27397,13 @@ end
 #     foo in ^(bar)
 #            ^^^^^^
 #
-# source://prism//lib/prism/node.rb#12986
+# source://prism/lib/prism/node.rb#12986
 class Prism::PinnedExpressionNode < ::Prism::Node
   # Initialize a new PinnedExpressionNode node.
   #
   # @return [PinnedExpressionNode] a new instance of PinnedExpressionNode
   #
-  # source://prism//lib/prism/node.rb#12988
+  # source://prism/lib/prism/node.rb#12988
   sig do
     params(
       source: Prism::Source,
@@ -27421,36 +27421,36 @@ class Prism::PinnedExpressionNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#13088
+  # source://prism/lib/prism/node.rb#13088
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#13000
+  # source://prism/lib/prism/node.rb#13000
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13005
+  # source://prism/lib/prism/node.rb#13005
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#13015
+  # source://prism/lib/prism/node.rb#13015
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#13010
+  # source://prism/lib/prism/node.rb#13010
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?expression: Prism::node, ?operator_loc: Location, ?lparen_loc: Location, ?rparen_loc: Location) -> PinnedExpressionNode
   #
-  # source://prism//lib/prism/node.rb#13020
+  # source://prism/lib/prism/node.rb#13020
   sig do
     params(
       node_id: Integer,
@@ -27467,19 +27467,19 @@ class Prism::PinnedExpressionNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13005
+  # source://prism/lib/prism/node.rb#13005
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, expression: Prism::node, operator_loc: Location, lparen_loc: Location, rparen_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#13028
+  # source://prism/lib/prism/node.rb#13028
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # attr_reader expression: Prism::node
   #
-  # source://prism//lib/prism/node.rb#13033
+  # source://prism/lib/prism/node.rb#13033
   sig { returns(Prism::Node) }
   def expression; end
 
@@ -27488,56 +27488,56 @@ class Prism::PinnedExpressionNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#13072
+  # source://prism/lib/prism/node.rb#13072
   sig { override.returns(String) }
   def inspect; end
 
   # def lparen: () -> String
   #
-  # source://prism//lib/prism/node.rb#13062
+  # source://prism/lib/prism/node.rb#13062
   sig { returns(String) }
   def lparen; end
 
   # attr_reader lparen_loc: Location
   #
-  # source://prism//lib/prism/node.rb#13043
+  # source://prism/lib/prism/node.rb#13043
   sig { returns(Prism::Location) }
   def lparen_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#13057
+  # source://prism/lib/prism/node.rb#13057
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#13036
+  # source://prism/lib/prism/node.rb#13036
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # def rparen: () -> String
   #
-  # source://prism//lib/prism/node.rb#13067
+  # source://prism/lib/prism/node.rb#13067
   sig { returns(String) }
   def rparen; end
 
   # attr_reader rparen_loc: Location
   #
-  # source://prism//lib/prism/node.rb#13050
+  # source://prism/lib/prism/node.rb#13050
   sig { returns(Prism::Location) }
   def rparen_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#13077
+  # source://prism/lib/prism/node.rb#13077
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#13082
+    # source://prism/lib/prism/node.rb#13082
     def type; end
   end
 end
@@ -27547,13 +27547,13 @@ end
 #     foo in ^bar
 #            ^^^^
 #
-# source://prism//lib/prism/node.rb#13101
+# source://prism/lib/prism/node.rb#13101
 class Prism::PinnedVariableNode < ::Prism::Node
   # Initialize a new PinnedVariableNode node.
   #
   # @return [PinnedVariableNode] a new instance of PinnedVariableNode
   #
-  # source://prism//lib/prism/node.rb#13103
+  # source://prism/lib/prism/node.rb#13103
   sig do
     params(
       source: Prism::Source,
@@ -27569,36 +27569,36 @@ class Prism::PinnedVariableNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#13177
+  # source://prism/lib/prism/node.rb#13177
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#13113
+  # source://prism/lib/prism/node.rb#13113
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13118
+  # source://prism/lib/prism/node.rb#13118
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#13128
+  # source://prism/lib/prism/node.rb#13128
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#13123
+  # source://prism/lib/prism/node.rb#13123
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?variable: LocalVariableReadNode | InstanceVariableReadNode | ClassVariableReadNode | GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode | ItLocalVariableReadNode | MissingNode, ?operator_loc: Location) -> PinnedVariableNode
   #
-  # source://prism//lib/prism/node.rb#13133
+  # source://prism/lib/prism/node.rb#13133
   sig do
     params(
       node_id: Integer,
@@ -27613,13 +27613,13 @@ class Prism::PinnedVariableNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13118
+  # source://prism/lib/prism/node.rb#13118
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, variable: LocalVariableReadNode | InstanceVariableReadNode | ClassVariableReadNode | GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode | ItLocalVariableReadNode | MissingNode, operator_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#13141
+  # source://prism/lib/prism/node.rb#13141
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -27628,31 +27628,31 @@ class Prism::PinnedVariableNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#13161
+  # source://prism/lib/prism/node.rb#13161
   sig { override.returns(String) }
   def inspect; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#13156
+  # source://prism/lib/prism/node.rb#13156
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#13149
+  # source://prism/lib/prism/node.rb#13149
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#13166
+  # source://prism/lib/prism/node.rb#13166
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader variable: LocalVariableReadNode | InstanceVariableReadNode | ClassVariableReadNode | GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode | ItLocalVariableReadNode | MissingNode
   #
-  # source://prism//lib/prism/node.rb#13146
+  # source://prism/lib/prism/node.rb#13146
   sig do
     returns(T.any(Prism::LocalVariableReadNode, Prism::InstanceVariableReadNode, Prism::ClassVariableReadNode, Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::ItLocalVariableReadNode, Prism::MissingNode))
   end
@@ -27661,7 +27661,7 @@ class Prism::PinnedVariableNode < ::Prism::Node
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#13171
+    # source://prism/lib/prism/node.rb#13171
     def type; end
   end
 end
@@ -27671,13 +27671,13 @@ end
 #     END { foo }
 #     ^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#13188
+# source://prism/lib/prism/node.rb#13188
 class Prism::PostExecutionNode < ::Prism::Node
   # Initialize a new PostExecutionNode node.
   #
   # @return [PostExecutionNode] a new instance of PostExecutionNode
   #
-  # source://prism//lib/prism/node.rb#13190
+  # source://prism/lib/prism/node.rb#13190
   sig do
     params(
       source: Prism::Source,
@@ -27695,48 +27695,48 @@ class Prism::PostExecutionNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#13292
+  # source://prism/lib/prism/node.rb#13292
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#13202
+  # source://prism/lib/prism/node.rb#13202
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13207
+  # source://prism/lib/prism/node.rb#13207
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String
   #
-  # source://prism//lib/prism/node.rb#13271
+  # source://prism/lib/prism/node.rb#13271
   sig { returns(String) }
   def closing; end
 
   # attr_reader closing_loc: Location
   #
-  # source://prism//lib/prism/node.rb#13254
+  # source://prism/lib/prism/node.rb#13254
   sig { returns(Prism::Location) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#13219
+  # source://prism/lib/prism/node.rb#13219
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#13212
+  # source://prism/lib/prism/node.rb#13212
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?statements: StatementsNode?, ?keyword_loc: Location, ?opening_loc: Location, ?closing_loc: Location) -> PostExecutionNode
   #
-  # source://prism//lib/prism/node.rb#13224
+  # source://prism/lib/prism/node.rb#13224
   sig do
     params(
       node_id: Integer,
@@ -27753,13 +27753,13 @@ class Prism::PostExecutionNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13207
+  # source://prism/lib/prism/node.rb#13207
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, statements: StatementsNode?, keyword_loc: Location, opening_loc: Location, closing_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#13232
+  # source://prism/lib/prism/node.rb#13232
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -27768,50 +27768,50 @@ class Prism::PostExecutionNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#13276
+  # source://prism/lib/prism/node.rb#13276
   sig { override.returns(String) }
   def inspect; end
 
   # def keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#13261
+  # source://prism/lib/prism/node.rb#13261
   sig { returns(String) }
   def keyword; end
 
   # attr_reader keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#13240
+  # source://prism/lib/prism/node.rb#13240
   sig { returns(Prism::Location) }
   def keyword_loc; end
 
   # def opening: () -> String
   #
-  # source://prism//lib/prism/node.rb#13266
+  # source://prism/lib/prism/node.rb#13266
   sig { returns(String) }
   def opening; end
 
   # attr_reader opening_loc: Location
   #
-  # source://prism//lib/prism/node.rb#13247
+  # source://prism/lib/prism/node.rb#13247
   sig { returns(Prism::Location) }
   def opening_loc; end
 
   # attr_reader statements: StatementsNode?
   #
-  # source://prism//lib/prism/node.rb#13237
+  # source://prism/lib/prism/node.rb#13237
   sig { returns(T.nilable(Prism::StatementsNode)) }
   def statements; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#13281
+  # source://prism/lib/prism/node.rb#13281
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#13286
+    # source://prism/lib/prism/node.rb#13286
     def type; end
   end
 end
@@ -27821,13 +27821,13 @@ end
 #     BEGIN { foo }
 #     ^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#13305
+# source://prism/lib/prism/node.rb#13305
 class Prism::PreExecutionNode < ::Prism::Node
   # Initialize a new PreExecutionNode node.
   #
   # @return [PreExecutionNode] a new instance of PreExecutionNode
   #
-  # source://prism//lib/prism/node.rb#13307
+  # source://prism/lib/prism/node.rb#13307
   sig do
     params(
       source: Prism::Source,
@@ -27845,48 +27845,48 @@ class Prism::PreExecutionNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#13409
+  # source://prism/lib/prism/node.rb#13409
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#13319
+  # source://prism/lib/prism/node.rb#13319
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13324
+  # source://prism/lib/prism/node.rb#13324
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String
   #
-  # source://prism//lib/prism/node.rb#13388
+  # source://prism/lib/prism/node.rb#13388
   sig { returns(String) }
   def closing; end
 
   # attr_reader closing_loc: Location
   #
-  # source://prism//lib/prism/node.rb#13371
+  # source://prism/lib/prism/node.rb#13371
   sig { returns(Prism::Location) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#13336
+  # source://prism/lib/prism/node.rb#13336
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#13329
+  # source://prism/lib/prism/node.rb#13329
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?statements: StatementsNode?, ?keyword_loc: Location, ?opening_loc: Location, ?closing_loc: Location) -> PreExecutionNode
   #
-  # source://prism//lib/prism/node.rb#13341
+  # source://prism/lib/prism/node.rb#13341
   sig do
     params(
       node_id: Integer,
@@ -27903,13 +27903,13 @@ class Prism::PreExecutionNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13324
+  # source://prism/lib/prism/node.rb#13324
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, statements: StatementsNode?, keyword_loc: Location, opening_loc: Location, closing_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#13349
+  # source://prism/lib/prism/node.rb#13349
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -27918,63 +27918,63 @@ class Prism::PreExecutionNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#13393
+  # source://prism/lib/prism/node.rb#13393
   sig { override.returns(String) }
   def inspect; end
 
   # def keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#13378
+  # source://prism/lib/prism/node.rb#13378
   sig { returns(String) }
   def keyword; end
 
   # attr_reader keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#13357
+  # source://prism/lib/prism/node.rb#13357
   sig { returns(Prism::Location) }
   def keyword_loc; end
 
   # def opening: () -> String
   #
-  # source://prism//lib/prism/node.rb#13383
+  # source://prism/lib/prism/node.rb#13383
   sig { returns(String) }
   def opening; end
 
   # attr_reader opening_loc: Location
   #
-  # source://prism//lib/prism/node.rb#13364
+  # source://prism/lib/prism/node.rb#13364
   sig { returns(Prism::Location) }
   def opening_loc; end
 
   # attr_reader statements: StatementsNode?
   #
-  # source://prism//lib/prism/node.rb#13354
+  # source://prism/lib/prism/node.rb#13354
   sig { returns(T.nilable(Prism::StatementsNode)) }
   def statements; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#13398
+  # source://prism/lib/prism/node.rb#13398
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#13403
+    # source://prism/lib/prism/node.rb#13403
     def type; end
   end
 end
 
 # The top level node of any parse tree.
 #
-# source://prism//lib/prism/node.rb#13419
+# source://prism/lib/prism/node.rb#13419
 class Prism::ProgramNode < ::Prism::Node
   # Initialize a new ProgramNode node.
   #
   # @return [ProgramNode] a new instance of ProgramNode
   #
-  # source://prism//lib/prism/node.rb#13421
+  # source://prism/lib/prism/node.rb#13421
   sig do
     params(
       source: Prism::Source,
@@ -27990,36 +27990,36 @@ class Prism::ProgramNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#13486
+  # source://prism/lib/prism/node.rb#13486
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#13431
+  # source://prism/lib/prism/node.rb#13431
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13436
+  # source://prism/lib/prism/node.rb#13436
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#13446
+  # source://prism/lib/prism/node.rb#13446
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#13441
+  # source://prism/lib/prism/node.rb#13441
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?locals: Array[Symbol], ?statements: StatementsNode) -> ProgramNode
   #
-  # source://prism//lib/prism/node.rb#13451
+  # source://prism/lib/prism/node.rb#13451
   sig do
     params(
       node_id: Integer,
@@ -28034,13 +28034,13 @@ class Prism::ProgramNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13436
+  # source://prism/lib/prism/node.rb#13436
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, locals: Array[Symbol], statements: StatementsNode }
   #
-  # source://prism//lib/prism/node.rb#13459
+  # source://prism/lib/prism/node.rb#13459
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -28049,44 +28049,44 @@ class Prism::ProgramNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#13470
+  # source://prism/lib/prism/node.rb#13470
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader locals: Array[Symbol]
   #
-  # source://prism//lib/prism/node.rb#13464
+  # source://prism/lib/prism/node.rb#13464
   sig { returns(T::Array[Symbol]) }
   def locals; end
 
   # attr_reader statements: StatementsNode
   #
-  # source://prism//lib/prism/node.rb#13467
+  # source://prism/lib/prism/node.rb#13467
   sig { returns(Prism::StatementsNode) }
   def statements; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#13475
+  # source://prism/lib/prism/node.rb#13475
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#13480
+    # source://prism/lib/prism/node.rb#13480
     def type; end
   end
 end
 
 # Flags for range and flip-flop nodes.
 #
-# source://prism//lib/prism/node.rb#16774
+# source://prism/lib/prism/node.rb#16774
 module Prism::RangeFlags; end
 
 # ... operator
 #
-# source://prism//lib/prism/node.rb#16776
+# source://prism/lib/prism/node.rb#16776
 Prism::RangeFlags::EXCLUDE_END = T.let(T.unsafe(nil), Integer)
 
 # Represents the use of the `..` or `...` operators.
@@ -28097,13 +28097,13 @@ Prism::RangeFlags::EXCLUDE_END = T.let(T.unsafe(nil), Integer)
 #     c if a =~ /left/ ... b =~ /right/
 #          ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#13501
+# source://prism/lib/prism/node.rb#13501
 class Prism::RangeNode < ::Prism::Node
   # Initialize a new RangeNode node.
   #
   # @return [RangeNode] a new instance of RangeNode
   #
-  # source://prism//lib/prism/node.rb#13503
+  # source://prism/lib/prism/node.rb#13503
   sig do
     params(
       source: Prism::Source,
@@ -28120,36 +28120,36 @@ class Prism::RangeNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#13602
+  # source://prism/lib/prism/node.rb#13602
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#13514
+  # source://prism/lib/prism/node.rb#13514
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13519
+  # source://prism/lib/prism/node.rb#13519
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#13532
+  # source://prism/lib/prism/node.rb#13532
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#13524
+  # source://prism/lib/prism/node.rb#13524
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?left: Prism::node?, ?right: Prism::node?, ?operator_loc: Location) -> RangeNode
   #
-  # source://prism//lib/prism/node.rb#13537
+  # source://prism/lib/prism/node.rb#13537
   sig do
     params(
       node_id: Integer,
@@ -28165,13 +28165,13 @@ class Prism::RangeNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13519
+  # source://prism/lib/prism/node.rb#13519
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, left: Prism::node?, right: Prism::node?, operator_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#13545
+  # source://prism/lib/prism/node.rb#13545
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -28179,7 +28179,7 @@ class Prism::RangeNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#13550
+  # source://prism/lib/prism/node.rb#13550
   sig { returns(T::Boolean) }
   def exclude_end?; end
 
@@ -28188,7 +28188,7 @@ class Prism::RangeNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#13586
+  # source://prism/lib/prism/node.rb#13586
   sig { override.returns(String) }
   def inspect; end
 
@@ -28200,19 +28200,19 @@ class Prism::RangeNode < ::Prism::Node
   #     hello...goodbye
   #     ^^^^^
   #
-  # source://prism//lib/prism/node.rb#13561
+  # source://prism/lib/prism/node.rb#13561
   sig { returns(T.nilable(Prism::Node)) }
   def left; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#13581
+  # source://prism/lib/prism/node.rb#13581
   sig { returns(String) }
   def operator; end
 
   # The location of the `..` or `...` operator.
   #
-  # source://prism//lib/prism/node.rb#13574
+  # source://prism/lib/prism/node.rb#13574
   sig { returns(Prism::Location) }
   def operator_loc; end
 
@@ -28225,20 +28225,20 @@ class Prism::RangeNode < ::Prism::Node
   #         ^^^
   # If neither right-hand or left-hand side was included, this will be a MissingNode.
   #
-  # source://prism//lib/prism/node.rb#13571
+  # source://prism/lib/prism/node.rb#13571
   sig { returns(T.nilable(Prism::Node)) }
   def right; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#13591
+  # source://prism/lib/prism/node.rb#13591
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#13596
+    # source://prism/lib/prism/node.rb#13596
     def type; end
   end
 end
@@ -28248,13 +28248,13 @@ end
 #     1.0r
 #     ^^^^
 #
-# source://prism//lib/prism/node.rb#13615
+# source://prism/lib/prism/node.rb#13615
 class Prism::RationalNode < ::Prism::Node
   # Initialize a new RationalNode node.
   #
   # @return [RationalNode] a new instance of RationalNode
   #
-  # source://prism//lib/prism/node.rb#13617
+  # source://prism/lib/prism/node.rb#13617
   sig do
     params(
       source: Prism::Source,
@@ -28270,12 +28270,12 @@ class Prism::RationalNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#13706
+  # source://prism/lib/prism/node.rb#13706
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#13627
+  # source://prism/lib/prism/node.rb#13627
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
@@ -28283,31 +28283,31 @@ class Prism::RationalNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#13660
+  # source://prism/lib/prism/node.rb#13660
   sig { returns(T::Boolean) }
   def binary?; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13632
+  # source://prism/lib/prism/node.rb#13632
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#13642
+  # source://prism/lib/prism/node.rb#13642
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#13637
+  # source://prism/lib/prism/node.rb#13637
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?numerator: Integer, ?denominator: Integer) -> RationalNode
   #
-  # source://prism//lib/prism/node.rb#13647
+  # source://prism/lib/prism/node.rb#13647
   sig do
     params(
       node_id: Integer,
@@ -28323,20 +28323,20 @@ class Prism::RationalNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#13665
+  # source://prism/lib/prism/node.rb#13665
   sig { returns(T::Boolean) }
   def decimal?; end
 
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13632
+  # source://prism/lib/prism/node.rb#13632
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, numerator: Integer, denominator: Integer }
   #
-  # source://prism//lib/prism/node.rb#13655
+  # source://prism/lib/prism/node.rb#13655
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -28344,7 +28344,7 @@ class Prism::RationalNode < ::Prism::Node
   #
   #     1.5r # denominator 2
   #
-  # source://prism//lib/prism/node.rb#13687
+  # source://prism/lib/prism/node.rb#13687
   sig { returns(Integer) }
   def denominator; end
 
@@ -28355,13 +28355,13 @@ class Prism::RationalNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#13675
+  # source://prism/lib/prism/node.rb#13675
   sig { returns(T::Boolean) }
   def hexadecimal?; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#13690
+  # source://prism/lib/prism/node.rb#13690
   sig { override.returns(String) }
   def inspect; end
 
@@ -28369,40 +28369,40 @@ class Prism::RationalNode < ::Prism::Node
   #
   #     1.5r # numerator 3
   #
-  # source://prism//lib/prism/node.rb#13682
+  # source://prism/lib/prism/node.rb#13682
   sig { returns(Integer) }
   def numerator; end
 
   # Returns the value of the node as an IntegerNode or a FloatNode. This
   # method is deprecated in favor of #value or #numerator/#denominator.
   #
-  # source://prism//lib/prism/node_ext.rb#120
+  # source://prism/lib/prism/node_ext.rb#120
   def numeric; end
 
   # def octal?: () -> bool
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#13670
+  # source://prism/lib/prism/node.rb#13670
   sig { returns(T::Boolean) }
   def octal?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#13695
+  # source://prism/lib/prism/node.rb#13695
   sig { override.returns(Symbol) }
   def type; end
 
   # Returns the value of the node as a Ruby Rational.
   #
-  # source://prism//lib/prism/node_ext.rb#114
+  # source://prism/lib/prism/node_ext.rb#114
   sig { returns(Rational) }
   def value; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#13700
+    # source://prism/lib/prism/node.rb#13700
     def type; end
   end
 end
@@ -28412,62 +28412,62 @@ end
 #     redo
 #     ^^^^
 #
-# source://prism//lib/prism/node.rb#13718
+# source://prism/lib/prism/node.rb#13718
 class Prism::RedoNode < ::Prism::Node
   # Initialize a new RedoNode node.
   #
   # @return [RedoNode] a new instance of RedoNode
   #
-  # source://prism//lib/prism/node.rb#13720
+  # source://prism/lib/prism/node.rb#13720
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
   def initialize(source, node_id, location, flags); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#13777
+  # source://prism/lib/prism/node.rb#13777
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#13728
+  # source://prism/lib/prism/node.rb#13728
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13733
+  # source://prism/lib/prism/node.rb#13733
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#13743
+  # source://prism/lib/prism/node.rb#13743
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#13738
+  # source://prism/lib/prism/node.rb#13738
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> RedoNode
   #
-  # source://prism//lib/prism/node.rb#13748
+  # source://prism/lib/prism/node.rb#13748
   sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::RedoNode) }
   def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end
 
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13733
+  # source://prism/lib/prism/node.rb#13733
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
   #
-  # source://prism//lib/prism/node.rb#13756
+  # source://prism/lib/prism/node.rb#13756
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -28476,20 +28476,20 @@ class Prism::RedoNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#13761
+  # source://prism/lib/prism/node.rb#13761
   sig { override.returns(String) }
   def inspect; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#13766
+  # source://prism/lib/prism/node.rb#13766
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#13771
+    # source://prism/lib/prism/node.rb#13771
     def type; end
   end
 end
@@ -28498,12 +28498,12 @@ end
 # the syntax tree itself, as opposed to looking at a single syntax tree. This
 # is useful in metaprogramming contexts.
 #
-# source://prism//lib/prism/reflection.rb#13
+# source://prism/lib/prism/reflection.rb#13
 module Prism::Reflection
   class << self
     # Returns the fields for the given node.
     #
-    # source://prism//lib/prism/reflection.rb#104
+    # source://prism/lib/prism/reflection.rb#104
     sig { params(node: T.class_of(Prism::Node)).returns(T::Array[Prism::Reflection::Field]) }
     def fields_for(node); end
   end
@@ -28513,31 +28513,31 @@ end
 # represents an identifier found within the source. It resolves to a symbol
 # in Ruby.
 #
-# source://prism//lib/prism/reflection.rb#45
+# source://prism/lib/prism/reflection.rb#45
 class Prism::Reflection::ConstantField < ::Prism::Reflection::Field; end
 
 # A constant list field represents a list of constant values on a node. It
 # resolves to an array of symbols in Ruby.
 #
-# source://prism//lib/prism/reflection.rb#55
+# source://prism/lib/prism/reflection.rb#55
 class Prism::Reflection::ConstantListField < ::Prism::Reflection::Field; end
 
 # A field represents a single piece of data on a node. It is the base class
 # for all other field types.
 #
-# source://prism//lib/prism/reflection.rb#16
+# source://prism/lib/prism/reflection.rb#16
 class Prism::Reflection::Field
   # Initializes the field with the given name.
   #
   # @return [Field] a new instance of Field
   #
-  # source://prism//lib/prism/reflection.rb#21
+  # source://prism/lib/prism/reflection.rb#21
   sig { params(name: Symbol).void }
   def initialize(name); end
 
   # The name of the field.
   #
-  # source://prism//lib/prism/reflection.rb#18
+  # source://prism/lib/prism/reflection.rb#18
   sig { returns(Symbol) }
   def name; end
 end
@@ -28547,19 +28547,19 @@ end
 # node because the integer is kept private. Instead, the various flags in
 # the bitset should be accessed through their query methods.
 #
-# source://prism//lib/prism/reflection.rb#92
+# source://prism/lib/prism/reflection.rb#92
 class Prism::Reflection::FlagsField < ::Prism::Reflection::Field
   # Initializes the flags field with the given name and flags.
   #
   # @return [FlagsField] a new instance of FlagsField
   #
-  # source://prism//lib/prism/reflection.rb#97
+  # source://prism/lib/prism/reflection.rb#97
   sig { params(name: Symbol, flags: T::Array[Symbol]).void }
   def initialize(name, flags); end
 
   # The names of the flags in the bitset.
   #
-  # source://prism//lib/prism/reflection.rb#94
+  # source://prism/lib/prism/reflection.rb#94
   sig { returns(T::Array[Symbol]) }
   def flags; end
 end
@@ -28568,120 +28568,120 @@ end
 # used exclusively to represent the value of a floating point literal. It
 # resolves to a Float in Ruby.
 #
-# source://prism//lib/prism/reflection.rb#85
+# source://prism/lib/prism/reflection.rb#85
 class Prism::Reflection::FloatField < ::Prism::Reflection::Field; end
 
 # An integer field represents an integer value. It is used to represent the
 # value of an integer literal, the depth of local variables, and the number
 # of a numbered reference. It resolves to an Integer in Ruby.
 #
-# source://prism//lib/prism/reflection.rb#79
+# source://prism/lib/prism/reflection.rb#79
 class Prism::Reflection::IntegerField < ::Prism::Reflection::Field; end
 
 # A location field represents the location of some part of the node in the
 # source code. For example, the location of a keyword or an operator. It
 # resolves to a Prism::Location in Ruby.
 #
-# source://prism//lib/prism/reflection.rb#67
+# source://prism/lib/prism/reflection.rb#67
 class Prism::Reflection::LocationField < ::Prism::Reflection::Field; end
 
 # A node field represents a single child node in the syntax tree. It
 # resolves to a Prism::Node in Ruby.
 #
-# source://prism//lib/prism/reflection.rb#28
+# source://prism/lib/prism/reflection.rb#28
 class Prism::Reflection::NodeField < ::Prism::Reflection::Field; end
 
 # A node list field represents a list of child nodes in the syntax tree. It
 # resolves to an array of Prism::Node instances in Ruby.
 #
-# source://prism//lib/prism/reflection.rb#39
+# source://prism/lib/prism/reflection.rb#39
 class Prism::Reflection::NodeListField < ::Prism::Reflection::Field; end
 
 # An optional constant field represents a constant value on a node that may
 # or may not be present. It resolves to either a symbol or nil in Ruby.
 #
-# source://prism//lib/prism/reflection.rb#50
+# source://prism/lib/prism/reflection.rb#50
 class Prism::Reflection::OptionalConstantField < ::Prism::Reflection::Field; end
 
 # An optional location field represents the location of some part of the
 # node in the source code that may or may not be present. It resolves to
 # either a Prism::Location or nil in Ruby.
 #
-# source://prism//lib/prism/reflection.rb#73
+# source://prism/lib/prism/reflection.rb#73
 class Prism::Reflection::OptionalLocationField < ::Prism::Reflection::Field; end
 
 # An optional node field represents a single child node in the syntax tree
 # that may or may not be present. It resolves to either a Prism::Node or nil
 # in Ruby.
 #
-# source://prism//lib/prism/reflection.rb#34
+# source://prism/lib/prism/reflection.rb#34
 class Prism::Reflection::OptionalNodeField < ::Prism::Reflection::Field; end
 
 # A string field represents a string value on a node. It almost always
 # represents the unescaped value of a string-like literal. It resolves to a
 # string in Ruby.
 #
-# source://prism//lib/prism/reflection.rb#61
+# source://prism/lib/prism/reflection.rb#61
 class Prism::Reflection::StringField < ::Prism::Reflection::Field; end
 
 # Flags for regular expression and match last line nodes.
 #
-# source://prism//lib/prism/node.rb#16780
+# source://prism/lib/prism/node.rb#16780
 module Prism::RegularExpressionFlags; end
 
 # n - forces the ASCII-8BIT encoding
 #
-# source://prism//lib/prism/node.rb#16797
+# source://prism/lib/prism/node.rb#16797
 Prism::RegularExpressionFlags::ASCII_8BIT = T.let(T.unsafe(nil), Integer)
 
 # e - forces the EUC-JP encoding
 #
-# source://prism//lib/prism/node.rb#16794
+# source://prism/lib/prism/node.rb#16794
 Prism::RegularExpressionFlags::EUC_JP = T.let(T.unsafe(nil), Integer)
 
 # x - ignores whitespace and allows comments in regular expressions
 #
-# source://prism//lib/prism/node.rb#16785
+# source://prism/lib/prism/node.rb#16785
 Prism::RegularExpressionFlags::EXTENDED = T.let(T.unsafe(nil), Integer)
 
 # internal bytes forced the encoding to binary
 #
-# source://prism//lib/prism/node.rb#16809
+# source://prism/lib/prism/node.rb#16809
 Prism::RegularExpressionFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer)
 
 # internal bytes forced the encoding to US-ASCII
 #
-# source://prism//lib/prism/node.rb#16812
+# source://prism/lib/prism/node.rb#16812
 Prism::RegularExpressionFlags::FORCED_US_ASCII_ENCODING = T.let(T.unsafe(nil), Integer)
 
 # internal bytes forced the encoding to UTF-8
 #
-# source://prism//lib/prism/node.rb#16806
+# source://prism/lib/prism/node.rb#16806
 Prism::RegularExpressionFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer)
 
 # i - ignores the case of characters when matching
 #
-# source://prism//lib/prism/node.rb#16782
+# source://prism/lib/prism/node.rb#16782
 Prism::RegularExpressionFlags::IGNORE_CASE = T.let(T.unsafe(nil), Integer)
 
 # m - allows $ to match the end of lines within strings
 #
-# source://prism//lib/prism/node.rb#16788
+# source://prism/lib/prism/node.rb#16788
 Prism::RegularExpressionFlags::MULTI_LINE = T.let(T.unsafe(nil), Integer)
 
 # o - only interpolates values into the regular expression once
 #
-# source://prism//lib/prism/node.rb#16791
+# source://prism/lib/prism/node.rb#16791
 Prism::RegularExpressionFlags::ONCE = T.let(T.unsafe(nil), Integer)
 
 # u - forces the UTF-8 encoding
 #
-# source://prism//lib/prism/node.rb#16803
+# source://prism/lib/prism/node.rb#16803
 Prism::RegularExpressionFlags::UTF_8 = T.let(T.unsafe(nil), Integer)
 
 # s - forces the Windows-31J encoding
 #
-# source://prism//lib/prism/node.rb#16800
+# source://prism/lib/prism/node.rb#16800
 Prism::RegularExpressionFlags::WINDOWS_31J = T.let(T.unsafe(nil), Integer)
 
 # Represents a regular expression literal with no interpolation.
@@ -28689,7 +28689,7 @@ Prism::RegularExpressionFlags::WINDOWS_31J = T.let(T.unsafe(nil), Integer)
 #     /foo/i
 #     ^^^^^^
 #
-# source://prism//lib/prism/node.rb#13786
+# source://prism/lib/prism/node.rb#13786
 class Prism::RegularExpressionNode < ::Prism::Node
   include ::Prism::RegularExpressionOptions
 
@@ -28697,7 +28697,7 @@ class Prism::RegularExpressionNode < ::Prism::Node
   #
   # @return [RegularExpressionNode] a new instance of RegularExpressionNode
   #
-  # source://prism//lib/prism/node.rb#13788
+  # source://prism/lib/prism/node.rb#13788
   sig do
     params(
       source: Prism::Source,
@@ -28715,12 +28715,12 @@ class Prism::RegularExpressionNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#13943
+  # source://prism/lib/prism/node.rb#13943
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#13800
+  # source://prism/lib/prism/node.rb#13800
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
@@ -28728,55 +28728,55 @@ class Prism::RegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#13858
+  # source://prism/lib/prism/node.rb#13858
   sig { returns(T::Boolean) }
   def ascii_8bit?; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13805
+  # source://prism/lib/prism/node.rb#13805
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String
   #
-  # source://prism//lib/prism/node.rb#13922
+  # source://prism/lib/prism/node.rb#13922
   sig { returns(String) }
   def closing; end
 
   # attr_reader closing_loc: Location
   #
-  # source://prism//lib/prism/node.rb#13902
+  # source://prism/lib/prism/node.rb#13902
   sig { returns(Prism::Location) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#13815
+  # source://prism/lib/prism/node.rb#13815
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#13810
+  # source://prism/lib/prism/node.rb#13810
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def content: () -> String
   #
-  # source://prism//lib/prism/node.rb#13917
+  # source://prism/lib/prism/node.rb#13917
   sig { returns(String) }
   def content; end
 
   # attr_reader content_loc: Location
   #
-  # source://prism//lib/prism/node.rb#13895
+  # source://prism/lib/prism/node.rb#13895
   sig { returns(Prism::Location) }
   def content_loc; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?content_loc: Location, ?closing_loc: Location, ?unescaped: String) -> RegularExpressionNode
   #
-  # source://prism//lib/prism/node.rb#13820
+  # source://prism/lib/prism/node.rb#13820
   sig do
     params(
       node_id: Integer,
@@ -28793,13 +28793,13 @@ class Prism::RegularExpressionNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13805
+  # source://prism/lib/prism/node.rb#13805
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String }
   #
-  # source://prism//lib/prism/node.rb#13828
+  # source://prism/lib/prism/node.rb#13828
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -28807,7 +28807,7 @@ class Prism::RegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#13853
+  # source://prism/lib/prism/node.rb#13853
   sig { returns(T::Boolean) }
   def euc_jp?; end
 
@@ -28815,7 +28815,7 @@ class Prism::RegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#13838
+  # source://prism/lib/prism/node.rb#13838
   sig { returns(T::Boolean) }
   def extended?; end
 
@@ -28826,7 +28826,7 @@ class Prism::RegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#13878
+  # source://prism/lib/prism/node.rb#13878
   sig { returns(T::Boolean) }
   def forced_binary_encoding?; end
 
@@ -28834,7 +28834,7 @@ class Prism::RegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#13883
+  # source://prism/lib/prism/node.rb#13883
   sig { returns(T::Boolean) }
   def forced_us_ascii_encoding?; end
 
@@ -28842,7 +28842,7 @@ class Prism::RegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#13873
+  # source://prism/lib/prism/node.rb#13873
   sig { returns(T::Boolean) }
   def forced_utf8_encoding?; end
 
@@ -28850,13 +28850,13 @@ class Prism::RegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#13833
+  # source://prism/lib/prism/node.rb#13833
   sig { returns(T::Boolean) }
   def ignore_case?; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#13927
+  # source://prism/lib/prism/node.rb#13927
   sig { override.returns(String) }
   def inspect; end
 
@@ -28864,7 +28864,7 @@ class Prism::RegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#13843
+  # source://prism/lib/prism/node.rb#13843
   sig { returns(T::Boolean) }
   def multi_line?; end
 
@@ -28872,19 +28872,19 @@ class Prism::RegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#13848
+  # source://prism/lib/prism/node.rb#13848
   sig { returns(T::Boolean) }
   def once?; end
 
   # def opening: () -> String
   #
-  # source://prism//lib/prism/node.rb#13912
+  # source://prism/lib/prism/node.rb#13912
   sig { returns(String) }
   def opening; end
 
   # attr_reader opening_loc: Location
   #
-  # source://prism//lib/prism/node.rb#13888
+  # source://prism/lib/prism/node.rb#13888
   sig { returns(Prism::Location) }
   def opening_loc; end
 
@@ -28893,13 +28893,13 @@ class Prism::RegularExpressionNode < ::Prism::Node
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#13932
+  # source://prism/lib/prism/node.rb#13932
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader unescaped: String
   #
-  # source://prism//lib/prism/node.rb#13909
+  # source://prism/lib/prism/node.rb#13909
   sig { returns(String) }
   def unescaped; end
 
@@ -28907,7 +28907,7 @@ class Prism::RegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#13868
+  # source://prism/lib/prism/node.rb#13868
   sig { returns(T::Boolean) }
   def utf_8?; end
 
@@ -28915,24 +28915,24 @@ class Prism::RegularExpressionNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#13863
+  # source://prism/lib/prism/node.rb#13863
   sig { returns(T::Boolean) }
   def windows_31j?; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#13937
+    # source://prism/lib/prism/node.rb#13937
     def type; end
   end
 end
 
-# source://prism//lib/prism/node_ext.rb#20
+# source://prism/lib/prism/node_ext.rb#20
 module Prism::RegularExpressionOptions
   # Returns a numeric value that represents the flags that were used to create
   # the regular expression.
   #
-  # source://prism//lib/prism/node_ext.rb#23
+  # source://prism/lib/prism/node_ext.rb#23
   def options; end
 end
 
@@ -28942,13 +28942,13 @@ end
 #           ^^
 #     end
 #
-# source://prism//lib/prism/node.rb#13958
+# source://prism/lib/prism/node.rb#13958
 class Prism::RequiredKeywordParameterNode < ::Prism::Node
   # Initialize a new RequiredKeywordParameterNode node.
   #
   # @return [RequiredKeywordParameterNode] a new instance of RequiredKeywordParameterNode
   #
-  # source://prism//lib/prism/node.rb#13960
+  # source://prism/lib/prism/node.rb#13960
   sig do
     params(
       source: Prism::Source,
@@ -28964,36 +28964,36 @@ class Prism::RequiredKeywordParameterNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#14034
+  # source://prism/lib/prism/node.rb#14034
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#13970
+  # source://prism/lib/prism/node.rb#13970
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13975
+  # source://prism/lib/prism/node.rb#13975
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#13985
+  # source://prism/lib/prism/node.rb#13985
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#13980
+  # source://prism/lib/prism/node.rb#13980
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location) -> RequiredKeywordParameterNode
   #
-  # source://prism//lib/prism/node.rb#13990
+  # source://prism/lib/prism/node.rb#13990
   sig do
     params(
       node_id: Integer,
@@ -29008,13 +29008,13 @@ class Prism::RequiredKeywordParameterNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#13975
+  # source://prism/lib/prism/node.rb#13975
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#13998
+  # source://prism/lib/prism/node.rb#13998
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -29023,19 +29023,19 @@ class Prism::RequiredKeywordParameterNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#14018
+  # source://prism/lib/prism/node.rb#14018
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#14008
+  # source://prism/lib/prism/node.rb#14008
   sig { returns(Symbol) }
   def name; end
 
   # attr_reader name_loc: Location
   #
-  # source://prism//lib/prism/node.rb#14011
+  # source://prism/lib/prism/node.rb#14011
   sig { returns(Prism::Location) }
   def name_loc; end
 
@@ -29043,20 +29043,20 @@ class Prism::RequiredKeywordParameterNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#14003
+  # source://prism/lib/prism/node.rb#14003
   sig { returns(T::Boolean) }
   def repeated_parameter?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#14023
+  # source://prism/lib/prism/node.rb#14023
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#14028
+    # source://prism/lib/prism/node.rb#14028
     def type; end
   end
 end
@@ -29067,49 +29067,49 @@ end
 #           ^
 #     end
 #
-# source://prism//lib/prism/node.rb#14047
+# source://prism/lib/prism/node.rb#14047
 class Prism::RequiredParameterNode < ::Prism::Node
   # Initialize a new RequiredParameterNode node.
   #
   # @return [RequiredParameterNode] a new instance of RequiredParameterNode
   #
-  # source://prism//lib/prism/node.rb#14049
+  # source://prism/lib/prism/node.rb#14049
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
   def initialize(source, node_id, location, flags, name); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#14115
+  # source://prism/lib/prism/node.rb#14115
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#14058
+  # source://prism/lib/prism/node.rb#14058
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14063
+  # source://prism/lib/prism/node.rb#14063
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#14073
+  # source://prism/lib/prism/node.rb#14073
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#14068
+  # source://prism/lib/prism/node.rb#14068
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> RequiredParameterNode
   #
-  # source://prism//lib/prism/node.rb#14078
+  # source://prism/lib/prism/node.rb#14078
   sig do
     params(
       node_id: Integer,
@@ -29123,13 +29123,13 @@ class Prism::RequiredParameterNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14063
+  # source://prism/lib/prism/node.rb#14063
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
   #
-  # source://prism//lib/prism/node.rb#14086
+  # source://prism/lib/prism/node.rb#14086
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -29138,13 +29138,13 @@ class Prism::RequiredParameterNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#14099
+  # source://prism/lib/prism/node.rb#14099
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol
   #
-  # source://prism//lib/prism/node.rb#14096
+  # source://prism/lib/prism/node.rb#14096
   sig { returns(Symbol) }
   def name; end
 
@@ -29152,20 +29152,20 @@ class Prism::RequiredParameterNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#14091
+  # source://prism/lib/prism/node.rb#14091
   sig { returns(T::Boolean) }
   def repeated_parameter?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#14104
+  # source://prism/lib/prism/node.rb#14104
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#14109
+    # source://prism/lib/prism/node.rb#14109
     def type; end
   end
 end
@@ -29175,13 +29175,13 @@ end
 #     foo rescue nil
 #     ^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#14126
+# source://prism/lib/prism/node.rb#14126
 class Prism::RescueModifierNode < ::Prism::Node
   # Initialize a new RescueModifierNode node.
   #
   # @return [RescueModifierNode] a new instance of RescueModifierNode
   #
-  # source://prism//lib/prism/node.rb#14128
+  # source://prism/lib/prism/node.rb#14128
   sig do
     params(
       source: Prism::Source,
@@ -29198,36 +29198,36 @@ class Prism::RescueModifierNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#14206
+  # source://prism/lib/prism/node.rb#14206
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#14139
+  # source://prism/lib/prism/node.rb#14139
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14144
+  # source://prism/lib/prism/node.rb#14144
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#14154
+  # source://prism/lib/prism/node.rb#14154
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#14149
+  # source://prism/lib/prism/node.rb#14149
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?expression: Prism::node, ?keyword_loc: Location, ?rescue_expression: Prism::node) -> RescueModifierNode
   #
-  # source://prism//lib/prism/node.rb#14159
+  # source://prism/lib/prism/node.rb#14159
   sig do
     params(
       node_id: Integer,
@@ -29243,19 +29243,19 @@ class Prism::RescueModifierNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14144
+  # source://prism/lib/prism/node.rb#14144
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, expression: Prism::node, keyword_loc: Location, rescue_expression: Prism::node }
   #
-  # source://prism//lib/prism/node.rb#14167
+  # source://prism/lib/prism/node.rb#14167
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # attr_reader expression: Prism::node
   #
-  # source://prism//lib/prism/node.rb#14172
+  # source://prism/lib/prism/node.rb#14172
   sig { returns(Prism::Node) }
   def expression; end
 
@@ -29264,41 +29264,41 @@ class Prism::RescueModifierNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#14190
+  # source://prism/lib/prism/node.rb#14190
   sig { override.returns(String) }
   def inspect; end
 
   # def keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#14185
+  # source://prism/lib/prism/node.rb#14185
   sig { returns(String) }
   def keyword; end
 
   # attr_reader keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#14175
+  # source://prism/lib/prism/node.rb#14175
   sig { returns(Prism::Location) }
   def keyword_loc; end
 
-  # source://prism//lib/prism/parse_result/newlines.rb#115
+  # source://prism/lib/prism/parse_result/newlines.rb#115
   def newline_flag!(lines); end
 
   # attr_reader rescue_expression: Prism::node
   #
-  # source://prism//lib/prism/node.rb#14182
+  # source://prism/lib/prism/node.rb#14182
   sig { returns(Prism::Node) }
   def rescue_expression; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#14195
+  # source://prism/lib/prism/node.rb#14195
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#14200
+    # source://prism/lib/prism/node.rb#14200
     def type; end
   end
 end
@@ -29313,13 +29313,13 @@ end
 #
 # `Foo, *splat, Bar` are in the `exceptions` field. `ex` is in the `reference` field.
 #
-# source://prism//lib/prism/node.rb#14223
+# source://prism/lib/prism/node.rb#14223
 class Prism::RescueNode < ::Prism::Node
   # Initialize a new RescueNode node.
   #
   # @return [RescueNode] a new instance of RescueNode
   #
-  # source://prism//lib/prism/node.rb#14225
+  # source://prism/lib/prism/node.rb#14225
   sig do
     params(
       source: Prism::Source,
@@ -29339,42 +29339,42 @@ class Prism::RescueNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#14335
+  # source://prism/lib/prism/node.rb#14335
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#14239
+  # source://prism/lib/prism/node.rb#14239
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14244
+  # source://prism/lib/prism/node.rb#14244
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#14259
+  # source://prism/lib/prism/node.rb#14259
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#14249
+  # source://prism/lib/prism/node.rb#14249
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # Returns the subsequent rescue clause of the rescue node. This method is
   # deprecated in favor of #subsequent.
   #
-  # source://prism//lib/prism/node_ext.rb#494
+  # source://prism/lib/prism/node_ext.rb#494
   def consequent; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?exceptions: Array[Prism::node], ?operator_loc: Location?, ?reference: LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | BackReferenceReadNode | NumberedReferenceReadNode | MissingNode | nil, ?statements: StatementsNode?, ?subsequent: RescueNode?) -> RescueNode
   #
-  # source://prism//lib/prism/node.rb#14264
+  # source://prism/lib/prism/node.rb#14264
   sig do
     params(
       node_id: Integer,
@@ -29393,19 +29393,19 @@ class Prism::RescueNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14244
+  # source://prism/lib/prism/node.rb#14244
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, exceptions: Array[Prism::node], operator_loc: Location?, reference: LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | BackReferenceReadNode | NumberedReferenceReadNode | MissingNode | nil, statements: StatementsNode?, subsequent: RescueNode? }
   #
-  # source://prism//lib/prism/node.rb#14272
+  # source://prism/lib/prism/node.rb#14272
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # attr_reader exceptions: Array[Prism::node]
   #
-  # source://prism//lib/prism/node.rb#14284
+  # source://prism/lib/prism/node.rb#14284
   sig { returns(T::Array[Prism::Node]) }
   def exceptions; end
 
@@ -29414,37 +29414,37 @@ class Prism::RescueNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#14319
+  # source://prism/lib/prism/node.rb#14319
   sig { override.returns(String) }
   def inspect; end
 
   # def keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#14309
+  # source://prism/lib/prism/node.rb#14309
   sig { returns(String) }
   def keyword; end
 
   # attr_reader keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#14277
+  # source://prism/lib/prism/node.rb#14277
   sig { returns(Prism::Location) }
   def keyword_loc; end
 
   # def operator: () -> String?
   #
-  # source://prism//lib/prism/node.rb#14314
+  # source://prism/lib/prism/node.rb#14314
   sig { returns(T.nilable(String)) }
   def operator; end
 
   # attr_reader operator_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#14287
+  # source://prism/lib/prism/node.rb#14287
   sig { returns(T.nilable(Prism::Location)) }
   def operator_loc; end
 
   # attr_reader reference: LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | BackReferenceReadNode | NumberedReferenceReadNode | MissingNode | nil
   #
-  # source://prism//lib/prism/node.rb#14300
+  # source://prism/lib/prism/node.rb#14300
   sig do
     returns(T.nilable(T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::MissingNode)))
   end
@@ -29452,26 +29452,26 @@ class Prism::RescueNode < ::Prism::Node
 
   # attr_reader statements: StatementsNode?
   #
-  # source://prism//lib/prism/node.rb#14303
+  # source://prism/lib/prism/node.rb#14303
   sig { returns(T.nilable(Prism::StatementsNode)) }
   def statements; end
 
   # attr_reader subsequent: RescueNode?
   #
-  # source://prism//lib/prism/node.rb#14306
+  # source://prism/lib/prism/node.rb#14306
   sig { returns(T.nilable(Prism::RescueNode)) }
   def subsequent; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#14324
+  # source://prism/lib/prism/node.rb#14324
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#14329
+    # source://prism/lib/prism/node.rb#14329
     def type; end
   end
 end
@@ -29482,13 +29482,13 @@ end
 #           ^^
 #     end
 #
-# source://prism//lib/prism/node.rb#14352
+# source://prism/lib/prism/node.rb#14352
 class Prism::RestParameterNode < ::Prism::Node
   # Initialize a new RestParameterNode node.
   #
   # @return [RestParameterNode] a new instance of RestParameterNode
   #
-  # source://prism//lib/prism/node.rb#14354
+  # source://prism/lib/prism/node.rb#14354
   sig do
     params(
       source: Prism::Source,
@@ -29505,36 +29505,36 @@ class Prism::RestParameterNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#14447
+  # source://prism/lib/prism/node.rb#14447
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#14365
+  # source://prism/lib/prism/node.rb#14365
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14370
+  # source://prism/lib/prism/node.rb#14370
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#14380
+  # source://prism/lib/prism/node.rb#14380
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#14375
+  # source://prism/lib/prism/node.rb#14375
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol?, ?name_loc: Location?, ?operator_loc: Location) -> RestParameterNode
   #
-  # source://prism//lib/prism/node.rb#14385
+  # source://prism/lib/prism/node.rb#14385
   sig do
     params(
       node_id: Integer,
@@ -29550,13 +29550,13 @@ class Prism::RestParameterNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14370
+  # source://prism/lib/prism/node.rb#14370
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol?, name_loc: Location?, operator_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#14393
+  # source://prism/lib/prism/node.rb#14393
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -29565,31 +29565,31 @@ class Prism::RestParameterNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#14431
+  # source://prism/lib/prism/node.rb#14431
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader name: Symbol?
   #
-  # source://prism//lib/prism/node.rb#14403
+  # source://prism/lib/prism/node.rb#14403
   sig { returns(T.nilable(Symbol)) }
   def name; end
 
   # attr_reader name_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#14406
+  # source://prism/lib/prism/node.rb#14406
   sig { returns(T.nilable(Prism::Location)) }
   def name_loc; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#14426
+  # source://prism/lib/prism/node.rb#14426
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#14419
+  # source://prism/lib/prism/node.rb#14419
   sig { returns(Prism::Location) }
   def operator_loc; end
 
@@ -29597,20 +29597,20 @@ class Prism::RestParameterNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#14398
+  # source://prism/lib/prism/node.rb#14398
   sig { returns(T::Boolean) }
   def repeated_parameter?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#14436
+  # source://prism/lib/prism/node.rb#14436
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#14441
+    # source://prism/lib/prism/node.rb#14441
     def type; end
   end
 end
@@ -29619,13 +29619,13 @@ end
 # the requested structure, any comments that were encounters, and any errors
 # that were encountered.
 #
-# source://prism//lib/prism/parse_result.rb#662
+# source://prism/lib/prism/parse_result.rb#662
 class Prism::Result
   # Create a new result object with the given values.
   #
   # @return [Result] a new instance of Result
   #
-  # source://prism//lib/prism/parse_result.rb#684
+  # source://prism/lib/prism/parse_result.rb#684
   sig do
     params(
       comments: T::Array[Prism::Comment],
@@ -29640,7 +29640,7 @@ class Prism::Result
 
   # Create a code units cache for the given encoding.
   #
-  # source://prism//lib/prism/parse_result.rb#716
+  # source://prism/lib/prism/parse_result.rb#716
   sig do
     params(
       encoding: Encoding
@@ -29650,7 +29650,7 @@ class Prism::Result
 
   # The list of comments that were encountered during parsing.
   #
-  # source://prism//lib/prism/parse_result.rb#664
+  # source://prism/lib/prism/parse_result.rb#664
   sig { returns(T::Array[Prism::Comment]) }
   def comments; end
 
@@ -29658,25 +29658,25 @@ class Prism::Result
   # and the rest of the content of the file. This content is loaded into the
   # DATA constant when the file being parsed is the main file being executed.
   #
-  # source://prism//lib/prism/parse_result.rb#672
+  # source://prism/lib/prism/parse_result.rb#672
   sig { returns(T.nilable(Prism::Location)) }
   def data_loc; end
 
   # Implement the hash pattern matching interface for Result.
   #
-  # source://prism//lib/prism/parse_result.rb#694
+  # source://prism/lib/prism/parse_result.rb#694
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # Returns the encoding of the source code that was parsed.
   #
-  # source://prism//lib/prism/parse_result.rb#699
+  # source://prism/lib/prism/parse_result.rb#699
   sig { returns(Encoding) }
   def encoding; end
 
   # The list of errors that were generated during parsing.
   #
-  # source://prism//lib/prism/parse_result.rb#675
+  # source://prism/lib/prism/parse_result.rb#675
   sig { returns(T::Array[Prism::ParseError]) }
   def errors; end
 
@@ -29685,19 +29685,19 @@ class Prism::Result
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/parse_result.rb#711
+  # source://prism/lib/prism/parse_result.rb#711
   sig { returns(T::Boolean) }
   def failure?; end
 
   # The list of magic comments that were encountered during parsing.
   #
-  # source://prism//lib/prism/parse_result.rb#667
+  # source://prism/lib/prism/parse_result.rb#667
   sig { returns(T::Array[Prism::MagicComment]) }
   def magic_comments; end
 
   # A Source instance that represents the source code that was parsed.
   #
-  # source://prism//lib/prism/parse_result.rb#681
+  # source://prism/lib/prism/parse_result.rb#681
   sig { returns(Prism::Source) }
   def source; end
 
@@ -29706,13 +29706,13 @@ class Prism::Result
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/parse_result.rb#705
+  # source://prism/lib/prism/parse_result.rb#705
   sig { returns(T::Boolean) }
   def success?; end
 
   # The list of warnings that were generated during parsing.
   #
-  # source://prism//lib/prism/parse_result.rb#678
+  # source://prism/lib/prism/parse_result.rb#678
   sig { returns(T::Array[Prism::ParseWarning]) }
   def warnings; end
 end
@@ -29722,62 +29722,62 @@ end
 #     retry
 #     ^^^^^
 #
-# source://prism//lib/prism/node.rb#14460
+# source://prism/lib/prism/node.rb#14460
 class Prism::RetryNode < ::Prism::Node
   # Initialize a new RetryNode node.
   #
   # @return [RetryNode] a new instance of RetryNode
   #
-  # source://prism//lib/prism/node.rb#14462
+  # source://prism/lib/prism/node.rb#14462
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
   def initialize(source, node_id, location, flags); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#14519
+  # source://prism/lib/prism/node.rb#14519
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#14470
+  # source://prism/lib/prism/node.rb#14470
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14475
+  # source://prism/lib/prism/node.rb#14475
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#14485
+  # source://prism/lib/prism/node.rb#14485
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#14480
+  # source://prism/lib/prism/node.rb#14480
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> RetryNode
   #
-  # source://prism//lib/prism/node.rb#14490
+  # source://prism/lib/prism/node.rb#14490
   sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::RetryNode) }
   def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end
 
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14475
+  # source://prism/lib/prism/node.rb#14475
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
   #
-  # source://prism//lib/prism/node.rb#14498
+  # source://prism/lib/prism/node.rb#14498
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -29786,20 +29786,20 @@ class Prism::RetryNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#14503
+  # source://prism/lib/prism/node.rb#14503
   sig { override.returns(String) }
   def inspect; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#14508
+  # source://prism/lib/prism/node.rb#14508
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#14513
+    # source://prism/lib/prism/node.rb#14513
     def type; end
   end
 end
@@ -29809,13 +29809,13 @@ end
 #     return 1
 #     ^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#14528
+# source://prism/lib/prism/node.rb#14528
 class Prism::ReturnNode < ::Prism::Node
   # Initialize a new ReturnNode node.
   #
   # @return [ReturnNode] a new instance of ReturnNode
   #
-  # source://prism//lib/prism/node.rb#14530
+  # source://prism/lib/prism/node.rb#14530
   sig do
     params(
       source: Prism::Source,
@@ -29831,42 +29831,42 @@ class Prism::ReturnNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#14606
+  # source://prism/lib/prism/node.rb#14606
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#14540
+  # source://prism/lib/prism/node.rb#14540
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader arguments: ArgumentsNode?
   #
-  # source://prism//lib/prism/node.rb#14582
+  # source://prism/lib/prism/node.rb#14582
   sig { returns(T.nilable(Prism::ArgumentsNode)) }
   def arguments; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14545
+  # source://prism/lib/prism/node.rb#14545
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#14557
+  # source://prism/lib/prism/node.rb#14557
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#14550
+  # source://prism/lib/prism/node.rb#14550
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?arguments: ArgumentsNode?) -> ReturnNode
   #
-  # source://prism//lib/prism/node.rb#14562
+  # source://prism/lib/prism/node.rb#14562
   sig do
     params(
       node_id: Integer,
@@ -29881,13 +29881,13 @@ class Prism::ReturnNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14545
+  # source://prism/lib/prism/node.rb#14545
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, arguments: ArgumentsNode? }
   #
-  # source://prism//lib/prism/node.rb#14570
+  # source://prism/lib/prism/node.rb#14570
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -29896,32 +29896,32 @@ class Prism::ReturnNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#14590
+  # source://prism/lib/prism/node.rb#14590
   sig { override.returns(String) }
   def inspect; end
 
   # def keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#14585
+  # source://prism/lib/prism/node.rb#14585
   sig { returns(String) }
   def keyword; end
 
   # attr_reader keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#14575
+  # source://prism/lib/prism/node.rb#14575
   sig { returns(Prism::Location) }
   def keyword_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#14595
+  # source://prism/lib/prism/node.rb#14595
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#14600
+    # source://prism/lib/prism/node.rb#14600
     def type; end
   end
 end
@@ -29931,62 +29931,62 @@ end
 #     self
 #     ^^^^
 #
-# source://prism//lib/prism/node.rb#14617
+# source://prism/lib/prism/node.rb#14617
 class Prism::SelfNode < ::Prism::Node
   # Initialize a new SelfNode node.
   #
   # @return [SelfNode] a new instance of SelfNode
   #
-  # source://prism//lib/prism/node.rb#14619
+  # source://prism/lib/prism/node.rb#14619
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
   def initialize(source, node_id, location, flags); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#14676
+  # source://prism/lib/prism/node.rb#14676
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#14627
+  # source://prism/lib/prism/node.rb#14627
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14632
+  # source://prism/lib/prism/node.rb#14632
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#14642
+  # source://prism/lib/prism/node.rb#14642
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#14637
+  # source://prism/lib/prism/node.rb#14637
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> SelfNode
   #
-  # source://prism//lib/prism/node.rb#14647
+  # source://prism/lib/prism/node.rb#14647
   sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::SelfNode) }
   def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end
 
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14632
+  # source://prism/lib/prism/node.rb#14632
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
   #
-  # source://prism//lib/prism/node.rb#14655
+  # source://prism/lib/prism/node.rb#14655
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -29995,208 +29995,208 @@ class Prism::SelfNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#14660
+  # source://prism/lib/prism/node.rb#14660
   sig { override.returns(String) }
   def inspect; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#14665
+  # source://prism/lib/prism/node.rb#14665
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#14670
+    # source://prism/lib/prism/node.rb#14670
     def type; end
   end
 end
 
 # A module responsible for deserializing parse results.
 #
-# source://prism//lib/prism/serialize.rb#14
+# source://prism/lib/prism/serialize.rb#14
 module Prism::Serialize
   class << self
     # Deserialize the AST represented by the given string into a parse result.
     #
-    # source://prism//lib/prism/serialize.rb#28
+    # source://prism/lib/prism/serialize.rb#28
     def load(input, serialized); end
 
     # Deserialize the tokens represented by the given string into a parse
     # result.
     #
-    # source://prism//lib/prism/serialize.rb#51
+    # source://prism/lib/prism/serialize.rb#51
     def load_tokens(source, serialized); end
   end
 end
 
-# source://prism//lib/prism/serialize.rb#55
+# source://prism/lib/prism/serialize.rb#55
 class Prism::Serialize::Loader
   # @return [Loader] a new instance of Loader
   #
-  # source://prism//lib/prism/serialize.rb#91
+  # source://prism/lib/prism/serialize.rb#91
   def initialize(source, serialized); end
 
   # Returns the value of attribute constant_pool.
   #
-  # source://prism//lib/prism/serialize.rb#88
+  # source://prism/lib/prism/serialize.rb#88
   def constant_pool; end
 
   # Returns the value of attribute constant_pool_offset.
   #
-  # source://prism//lib/prism/serialize.rb#88
+  # source://prism/lib/prism/serialize.rb#88
   def constant_pool_offset; end
 
   # Returns the value of attribute encoding.
   #
-  # source://prism//lib/prism/serialize.rb#87
+  # source://prism/lib/prism/serialize.rb#87
   def encoding; end
 
   # Returns the value of attribute input.
   #
-  # source://prism//lib/prism/serialize.rb#87
+  # source://prism/lib/prism/serialize.rb#87
   def input; end
 
   # Returns the value of attribute io.
   #
-  # source://prism//lib/prism/serialize.rb#87
+  # source://prism/lib/prism/serialize.rb#87
   def io; end
 
-  # source://prism//lib/prism/serialize.rb#129
+  # source://prism/lib/prism/serialize.rb#129
   def load_comments; end
 
-  # source://prism//lib/prism/serialize.rb#115
+  # source://prism/lib/prism/serialize.rb#115
   def load_encoding; end
 
-  # source://prism//lib/prism/serialize.rb#106
+  # source://prism/lib/prism/serialize.rb#106
   def load_header; end
 
-  # source://prism//lib/prism/serialize.rb#125
+  # source://prism/lib/prism/serialize.rb#125
   def load_line_offsets; end
 
-  # source://prism//lib/prism/serialize.rb#462
+  # source://prism/lib/prism/serialize.rb#462
   def load_metadata; end
 
-  # source://prism//lib/prism/serialize.rb#496
+  # source://prism/lib/prism/serialize.rb#496
   def load_nodes; end
 
-  # source://prism//lib/prism/serialize.rb#510
+  # source://prism/lib/prism/serialize.rb#510
   def load_result; end
 
-  # source://prism//lib/prism/serialize.rb#121
+  # source://prism/lib/prism/serialize.rb#121
   def load_start_line; end
 
-  # source://prism//lib/prism/serialize.rb#471
+  # source://prism/lib/prism/serialize.rb#471
   def load_tokens; end
 
-  # source://prism//lib/prism/serialize.rb#484
+  # source://prism/lib/prism/serialize.rb#484
   def load_tokens_result; end
 
   # Returns the value of attribute serialized.
   #
-  # source://prism//lib/prism/serialize.rb#87
+  # source://prism/lib/prism/serialize.rb#87
   def serialized; end
 
   # Returns the value of attribute source.
   #
-  # source://prism//lib/prism/serialize.rb#88
+  # source://prism/lib/prism/serialize.rb#88
   def source; end
 
   # Returns the value of attribute start_line.
   #
-  # source://prism//lib/prism/serialize.rb#89
+  # source://prism/lib/prism/serialize.rb#89
   def start_line; end
 
   private
 
-  # source://prism//lib/prism/serialize.rb#596
+  # source://prism/lib/prism/serialize.rb#596
   def load_constant(index); end
 
-  # source://prism//lib/prism/serialize.rb#549
+  # source://prism/lib/prism/serialize.rb#549
   def load_double; end
 
-  # source://prism//lib/prism/serialize.rb#564
+  # source://prism/lib/prism/serialize.rb#564
   def load_embedded_string; end
 
-  # source://prism//lib/prism/serialize.rb#626
+  # source://prism/lib/prism/serialize.rb#626
   def load_error_level; end
 
-  # source://prism//lib/prism/serialize.rb#538
+  # source://prism/lib/prism/serialize.rb#538
   def load_integer; end
 
-  # source://prism//lib/prism/serialize.rb#580
+  # source://prism/lib/prism/serialize.rb#580
   def load_location; end
 
-  # source://prism//lib/prism/serialize.rb#584
+  # source://prism/lib/prism/serialize.rb#584
   def load_location_object; end
 
-  # source://prism//lib/prism/serialize.rb#655
+  # source://prism/lib/prism/serialize.rb#655
   def load_node; end
 
-  # source://prism//lib/prism/serialize.rb#621
+  # source://prism/lib/prism/serialize.rb#621
   def load_optional_constant; end
 
-  # source://prism//lib/prism/serialize.rb#588
+  # source://prism/lib/prism/serialize.rb#588
   def load_optional_location; end
 
-  # source://prism//lib/prism/serialize.rb#592
+  # source://prism/lib/prism/serialize.rb#592
   def load_optional_location_object; end
 
-  # source://prism//lib/prism/serialize.rb#557
+  # source://prism/lib/prism/serialize.rb#557
   def load_optional_node; end
 
-  # source://prism//lib/prism/serialize.rb#617
+  # source://prism/lib/prism/serialize.rb#617
   def load_required_constant; end
 
-  # source://prism//lib/prism/serialize.rb#568
+  # source://prism/lib/prism/serialize.rb#568
   def load_string; end
 
-  # source://prism//lib/prism/serialize.rb#553
+  # source://prism/lib/prism/serialize.rb#553
   def load_uint32; end
 
-  # source://prism//lib/prism/serialize.rb#533
+  # source://prism/lib/prism/serialize.rb#533
   def load_varsint; end
 
   # variable-length integer using https://en.wikipedia.org/wiki/LEB128
   # This is also what protobuf uses: https://protobuf.dev/programming-guides/encoding/#varints
   #
-  # source://prism//lib/prism/serialize.rb#519
+  # source://prism/lib/prism/serialize.rb#519
   def load_varuint; end
 
-  # source://prism//lib/prism/serialize.rb#641
+  # source://prism/lib/prism/serialize.rb#641
   def load_warning_level; end
 end
 
-# source://prism//lib/prism/serialize.rb#138
+# source://prism/lib/prism/serialize.rb#138
 Prism::Serialize::Loader::DIAGNOSTIC_TYPES = T.let(T.unsafe(nil), Array)
 
 # StringIO is synchronized and that adds a high overhead on TruffleRuby.
 #
-# source://prism//lib/prism/serialize.rb#83
+# source://prism/lib/prism/serialize.rb#83
 Prism::Serialize::Loader::FastStringIO = StringIO
 
 # The major version of prism that we are expecting to find in the serialized
 # strings.
 #
-# source://prism//lib/prism/serialize.rb#17
+# source://prism/lib/prism/serialize.rb#17
 Prism::Serialize::MAJOR_VERSION = T.let(T.unsafe(nil), Integer)
 
 # The minor version of prism that we are expecting to find in the serialized
 # strings.
 #
-# source://prism//lib/prism/serialize.rb#21
+# source://prism/lib/prism/serialize.rb#21
 Prism::Serialize::MINOR_VERSION = T.let(T.unsafe(nil), Integer)
 
 # The patch version of prism that we are expecting to find in the serialized
 # strings.
 #
-# source://prism//lib/prism/serialize.rb#25
+# source://prism/lib/prism/serialize.rb#25
 Prism::Serialize::PATCH_VERSION = T.let(T.unsafe(nil), Integer)
 
 # The token types that can be indexed by their enum values.
 #
-# source://prism//lib/prism/serialize.rb#1737
+# source://prism/lib/prism/serialize.rb#1737
 Prism::Serialize::TOKEN_TYPES = T.let(T.unsafe(nil), Array)
 
 # This node wraps a constant write to indicate that when the value is written, it should have its shareability state modified.
@@ -30204,13 +30204,13 @@ Prism::Serialize::TOKEN_TYPES = T.let(T.unsafe(nil), Array)
 #     C = { a: 1 }
 #     ^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#14686
+# source://prism/lib/prism/node.rb#14686
 class Prism::ShareableConstantNode < ::Prism::Node
   # Initialize a new ShareableConstantNode node.
   #
   # @return [ShareableConstantNode] a new instance of ShareableConstantNode
   #
-  # source://prism//lib/prism/node.rb#14688
+  # source://prism/lib/prism/node.rb#14688
   sig do
     params(
       source: Prism::Source,
@@ -30225,36 +30225,36 @@ class Prism::ShareableConstantNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#14764
+  # source://prism/lib/prism/node.rb#14764
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#14697
+  # source://prism/lib/prism/node.rb#14697
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14702
+  # source://prism/lib/prism/node.rb#14702
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#14712
+  # source://prism/lib/prism/node.rb#14712
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#14707
+  # source://prism/lib/prism/node.rb#14707
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?write: ConstantWriteNode | ConstantAndWriteNode | ConstantOrWriteNode | ConstantOperatorWriteNode | ConstantPathWriteNode | ConstantPathAndWriteNode | ConstantPathOrWriteNode | ConstantPathOperatorWriteNode) -> ShareableConstantNode
   #
-  # source://prism//lib/prism/node.rb#14717
+  # source://prism/lib/prism/node.rb#14717
   sig do
     params(
       node_id: Integer,
@@ -30268,13 +30268,13 @@ class Prism::ShareableConstantNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14702
+  # source://prism/lib/prism/node.rb#14702
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, write: ConstantWriteNode | ConstantAndWriteNode | ConstantOrWriteNode | ConstantOperatorWriteNode | ConstantPathWriteNode | ConstantPathAndWriteNode | ConstantPathOrWriteNode | ConstantPathOperatorWriteNode }
   #
-  # source://prism//lib/prism/node.rb#14725
+  # source://prism/lib/prism/node.rb#14725
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -30282,7 +30282,7 @@ class Prism::ShareableConstantNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#14740
+  # source://prism/lib/prism/node.rb#14740
   sig { returns(T::Boolean) }
   def experimental_copy?; end
 
@@ -30290,7 +30290,7 @@ class Prism::ShareableConstantNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#14735
+  # source://prism/lib/prism/node.rb#14735
   sig { returns(T::Boolean) }
   def experimental_everything?; end
 
@@ -30299,7 +30299,7 @@ class Prism::ShareableConstantNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#14748
+  # source://prism/lib/prism/node.rb#14748
   sig { override.returns(String) }
   def inspect; end
 
@@ -30307,19 +30307,19 @@ class Prism::ShareableConstantNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#14730
+  # source://prism/lib/prism/node.rb#14730
   sig { returns(T::Boolean) }
   def literal?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#14753
+  # source://prism/lib/prism/node.rb#14753
   sig { override.returns(Symbol) }
   def type; end
 
   # The constant write that should be modified with the shareability state.
   #
-  # source://prism//lib/prism/node.rb#14745
+  # source://prism/lib/prism/node.rb#14745
   sig do
     returns(T.any(Prism::ConstantWriteNode, Prism::ConstantAndWriteNode, Prism::ConstantOrWriteNode, Prism::ConstantOperatorWriteNode, Prism::ConstantPathWriteNode, Prism::ConstantPathAndWriteNode, Prism::ConstantPathOrWriteNode, Prism::ConstantPathOperatorWriteNode))
   end
@@ -30328,29 +30328,29 @@ class Prism::ShareableConstantNode < ::Prism::Node
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#14758
+    # source://prism/lib/prism/node.rb#14758
     def type; end
   end
 end
 
 # Flags for shareable constant nodes.
 #
-# source://prism//lib/prism/node.rb#16816
+# source://prism/lib/prism/node.rb#16816
 module Prism::ShareableConstantNodeFlags; end
 
 # constant writes that should be modified with shareable constant value experimental copy
 #
-# source://prism//lib/prism/node.rb#16824
+# source://prism/lib/prism/node.rb#16824
 Prism::ShareableConstantNodeFlags::EXPERIMENTAL_COPY = T.let(T.unsafe(nil), Integer)
 
 # constant writes that should be modified with shareable constant value experimental everything
 #
-# source://prism//lib/prism/node.rb#16821
+# source://prism/lib/prism/node.rb#16821
 Prism::ShareableConstantNodeFlags::EXPERIMENTAL_EVERYTHING = T.let(T.unsafe(nil), Integer)
 
 # constant writes that should be modified with shareable constant value literal
 #
-# source://prism//lib/prism/node.rb#16818
+# source://prism/lib/prism/node.rb#16818
 Prism::ShareableConstantNodeFlags::LITERAL = T.let(T.unsafe(nil), Integer)
 
 # Represents a singleton class declaration involving the `class` keyword.
@@ -30358,13 +30358,13 @@ Prism::ShareableConstantNodeFlags::LITERAL = T.let(T.unsafe(nil), Integer)
 #     class << self end
 #     ^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#14775
+# source://prism/lib/prism/node.rb#14775
 class Prism::SingletonClassNode < ::Prism::Node
   # Initialize a new SingletonClassNode node.
   #
   # @return [SingletonClassNode] a new instance of SingletonClassNode
   #
-  # source://prism//lib/prism/node.rb#14777
+  # source://prism/lib/prism/node.rb#14777
   sig do
     params(
       source: Prism::Source,
@@ -30384,54 +30384,54 @@ class Prism::SingletonClassNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#14888
+  # source://prism/lib/prism/node.rb#14888
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#14791
+  # source://prism/lib/prism/node.rb#14791
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader body: StatementsNode | BeginNode | nil
   #
-  # source://prism//lib/prism/node.rb#14847
+  # source://prism/lib/prism/node.rb#14847
   sig { returns(T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))) }
   def body; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14796
+  # source://prism/lib/prism/node.rb#14796
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def class_keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#14857
+  # source://prism/lib/prism/node.rb#14857
   sig { returns(String) }
   def class_keyword; end
 
   # attr_reader class_keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#14830
+  # source://prism/lib/prism/node.rb#14830
   sig { returns(Prism::Location) }
   def class_keyword_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#14809
+  # source://prism/lib/prism/node.rb#14809
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#14801
+  # source://prism/lib/prism/node.rb#14801
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?locals: Array[Symbol], ?class_keyword_loc: Location, ?operator_loc: Location, ?expression: Prism::node, ?body: StatementsNode | BeginNode | nil, ?end_keyword_loc: Location) -> SingletonClassNode
   #
-  # source://prism//lib/prism/node.rb#14814
+  # source://prism/lib/prism/node.rb#14814
   sig do
     params(
       node_id: Integer,
@@ -30450,31 +30450,31 @@ class Prism::SingletonClassNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14796
+  # source://prism/lib/prism/node.rb#14796
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, locals: Array[Symbol], class_keyword_loc: Location, operator_loc: Location, expression: Prism::node, body: StatementsNode | BeginNode | nil, end_keyword_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#14822
+  # source://prism/lib/prism/node.rb#14822
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # def end_keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#14867
+  # source://prism/lib/prism/node.rb#14867
   sig { returns(String) }
   def end_keyword; end
 
   # attr_reader end_keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#14850
+  # source://prism/lib/prism/node.rb#14850
   sig { returns(Prism::Location) }
   def end_keyword_loc; end
 
   # attr_reader expression: Prism::node
   #
-  # source://prism//lib/prism/node.rb#14844
+  # source://prism/lib/prism/node.rb#14844
   sig { returns(Prism::Node) }
   def expression; end
 
@@ -30483,38 +30483,38 @@ class Prism::SingletonClassNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#14872
+  # source://prism/lib/prism/node.rb#14872
   sig { override.returns(String) }
   def inspect; end
 
   # attr_reader locals: Array[Symbol]
   #
-  # source://prism//lib/prism/node.rb#14827
+  # source://prism/lib/prism/node.rb#14827
   sig { returns(T::Array[Symbol]) }
   def locals; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#14862
+  # source://prism/lib/prism/node.rb#14862
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#14837
+  # source://prism/lib/prism/node.rb#14837
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#14877
+  # source://prism/lib/prism/node.rb#14877
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#14882
+    # source://prism/lib/prism/node.rb#14882
     def type; end
   end
 end
@@ -30523,32 +30523,32 @@ end
 # conjunction with locations to allow them to resolve line numbers and source
 # ranges.
 #
-# source://prism//lib/prism/parse_result.rb#7
+# source://prism/lib/prism/parse_result.rb#7
 class Prism::Source
   # Create a new source object with the given source code.
   #
   # @return [Source] a new instance of Source
   #
-  # source://prism//lib/prism/parse_result.rb#45
+  # source://prism/lib/prism/parse_result.rb#45
   sig { params(source: String, start_line: Integer, offsets: T::Array[Integer]).void }
   def initialize(source, start_line = T.unsafe(nil), offsets = T.unsafe(nil)); end
 
   # Return the column number in characters for the given byte offset.
   #
-  # source://prism//lib/prism/parse_result.rb#97
+  # source://prism/lib/prism/parse_result.rb#97
   sig { params(byte_offset: Integer).returns(Integer) }
   def character_column(byte_offset); end
 
   # Return the character offset for the given byte offset.
   #
-  # source://prism//lib/prism/parse_result.rb#92
+  # source://prism/lib/prism/parse_result.rb#92
   sig { params(byte_offset: Integer).returns(Integer) }
   def character_offset(byte_offset); end
 
   # Generate a cache that targets a specific encoding for calculating code
   # unit offsets.
   #
-  # source://prism//lib/prism/parse_result.rb#125
+  # source://prism/lib/prism/parse_result.rb#125
   sig do
     params(
       encoding: Encoding
@@ -30559,7 +30559,7 @@ class Prism::Source
   # Returns the column number in code units for the given encoding for the
   # given byte offset.
   #
-  # source://prism//lib/prism/parse_result.rb#131
+  # source://prism/lib/prism/parse_result.rb#131
   sig { params(byte_offset: Integer, encoding: Encoding).returns(Integer) }
   def code_units_column(byte_offset, encoding); end
 
@@ -30576,71 +30576,71 @@ class Prism::Source
   # boundary. Second, it's possible that the source code will contain a
   # character that has no equivalent in the given encoding.
   #
-  # source://prism//lib/prism/parse_result.rb#113
+  # source://prism/lib/prism/parse_result.rb#113
   sig { params(byte_offset: Integer, encoding: Encoding).returns(Integer) }
   def code_units_offset(byte_offset, encoding); end
 
   # Return the column number for the given byte offset.
   #
-  # source://prism//lib/prism/parse_result.rb#87
+  # source://prism/lib/prism/parse_result.rb#87
   sig { params(byte_offset: Integer).returns(Integer) }
   def column(byte_offset); end
 
   # Returns the encoding of the source code, which is set by parameters to the
   # parser or by the encoding magic comment.
   #
-  # source://prism//lib/prism/parse_result.rb#53
+  # source://prism/lib/prism/parse_result.rb#53
   sig { returns(Encoding) }
   def encoding; end
 
   # Binary search through the offsets to find the line number for the given
   # byte offset.
   #
-  # source://prism//lib/prism/parse_result.rb#70
+  # source://prism/lib/prism/parse_result.rb#70
   sig { params(byte_offset: Integer).returns(Integer) }
   def line(byte_offset); end
 
   # Returns the byte offset of the end of the line corresponding to the given
   # byte offset.
   #
-  # source://prism//lib/prism/parse_result.rb#82
+  # source://prism/lib/prism/parse_result.rb#82
   def line_end(byte_offset); end
 
   # Return the byte offset of the start of the line corresponding to the given
   # byte offset.
   #
-  # source://prism//lib/prism/parse_result.rb#76
+  # source://prism/lib/prism/parse_result.rb#76
   sig { params(byte_offset: Integer).returns(Integer) }
   def line_start(byte_offset); end
 
   # Returns the lines of the source code as an array of strings.
   #
-  # source://prism//lib/prism/parse_result.rb#58
+  # source://prism/lib/prism/parse_result.rb#58
   sig { returns(T::Array[String]) }
   def lines; end
 
   # The list of newline byte offsets in the source code.
   #
-  # source://prism//lib/prism/parse_result.rb#42
+  # source://prism/lib/prism/parse_result.rb#42
   sig { returns(T::Array[Integer]) }
   def offsets; end
 
   # Perform a byteslice on the source code using the given byte offset and
   # byte length.
   #
-  # source://prism//lib/prism/parse_result.rb#64
+  # source://prism/lib/prism/parse_result.rb#64
   sig { params(byte_offset: Integer, length: Integer).returns(String) }
   def slice(byte_offset, length); end
 
   # The source code that this source object represents.
   #
-  # source://prism//lib/prism/parse_result.rb#36
+  # source://prism/lib/prism/parse_result.rb#36
   sig { returns(String) }
   def source; end
 
   # The line number where this source starts.
   #
-  # source://prism//lib/prism/parse_result.rb#39
+  # source://prism/lib/prism/parse_result.rb#39
   sig { returns(Integer) }
   def start_line; end
 
@@ -30649,7 +30649,7 @@ class Prism::Source
   # Binary search through the offsets to find the line number for the given
   # byte offset.
   #
-  # source://prism//lib/prism/parse_result.rb#139
+  # source://prism/lib/prism/parse_result.rb#139
   def find_line(byte_offset); end
 
   class << self
@@ -30658,7 +30658,7 @@ class Prism::Source
     # specialized and more performant `ASCIISource` if no multibyte characters
     # are present in the source code.
     #
-    # source://prism//lib/prism/parse_result.rb#12
+    # source://prism/lib/prism/parse_result.rb#12
     def for(source, start_line = T.unsafe(nil), offsets = T.unsafe(nil)); end
   end
 end
@@ -30668,62 +30668,62 @@ end
 #     __ENCODING__
 #     ^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#14904
+# source://prism/lib/prism/node.rb#14904
 class Prism::SourceEncodingNode < ::Prism::Node
   # Initialize a new SourceEncodingNode node.
   #
   # @return [SourceEncodingNode] a new instance of SourceEncodingNode
   #
-  # source://prism//lib/prism/node.rb#14906
+  # source://prism/lib/prism/node.rb#14906
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
   def initialize(source, node_id, location, flags); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#14963
+  # source://prism/lib/prism/node.rb#14963
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#14914
+  # source://prism/lib/prism/node.rb#14914
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14919
+  # source://prism/lib/prism/node.rb#14919
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#14929
+  # source://prism/lib/prism/node.rb#14929
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#14924
+  # source://prism/lib/prism/node.rb#14924
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> SourceEncodingNode
   #
-  # source://prism//lib/prism/node.rb#14934
+  # source://prism/lib/prism/node.rb#14934
   sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::SourceEncodingNode) }
   def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end
 
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14919
+  # source://prism/lib/prism/node.rb#14919
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
   #
-  # source://prism//lib/prism/node.rb#14942
+  # source://prism/lib/prism/node.rb#14942
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -30732,20 +30732,20 @@ class Prism::SourceEncodingNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#14947
+  # source://prism/lib/prism/node.rb#14947
   sig { override.returns(String) }
   def inspect; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#14952
+  # source://prism/lib/prism/node.rb#14952
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#14957
+    # source://prism/lib/prism/node.rb#14957
     def type; end
   end
 end
@@ -30755,13 +30755,13 @@ end
 #     __FILE__
 #     ^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#14972
+# source://prism/lib/prism/node.rb#14972
 class Prism::SourceFileNode < ::Prism::Node
   # Initialize a new SourceFileNode node.
   #
   # @return [SourceFileNode] a new instance of SourceFileNode
   #
-  # source://prism//lib/prism/node.rb#14974
+  # source://prism/lib/prism/node.rb#14974
   sig do
     params(
       source: Prism::Source,
@@ -30776,36 +30776,36 @@ class Prism::SourceFileNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#15055
+  # source://prism/lib/prism/node.rb#15055
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#14983
+  # source://prism/lib/prism/node.rb#14983
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14988
+  # source://prism/lib/prism/node.rb#14988
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#14998
+  # source://prism/lib/prism/node.rb#14998
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#14993
+  # source://prism/lib/prism/node.rb#14993
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?filepath: String) -> SourceFileNode
   #
-  # source://prism//lib/prism/node.rb#15003
+  # source://prism/lib/prism/node.rb#15003
   sig do
     params(
       node_id: Integer,
@@ -30819,13 +30819,13 @@ class Prism::SourceFileNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#14988
+  # source://prism/lib/prism/node.rb#14988
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, filepath: String }
   #
-  # source://prism//lib/prism/node.rb#15011
+  # source://prism/lib/prism/node.rb#15011
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -30834,7 +30834,7 @@ class Prism::SourceFileNode < ::Prism::Node
 
   # Represents the file path being parsed. This corresponds directly to the `filepath` option given to the various `Prism::parse*` APIs.
   #
-  # source://prism//lib/prism/node.rb#15036
+  # source://prism/lib/prism/node.rb#15036
   sig { returns(String) }
   def filepath; end
 
@@ -30842,7 +30842,7 @@ class Prism::SourceFileNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#15021
+  # source://prism/lib/prism/node.rb#15021
   sig { returns(T::Boolean) }
   def forced_binary_encoding?; end
 
@@ -30850,7 +30850,7 @@ class Prism::SourceFileNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#15016
+  # source://prism/lib/prism/node.rb#15016
   sig { returns(T::Boolean) }
   def forced_utf8_encoding?; end
 
@@ -30858,13 +30858,13 @@ class Prism::SourceFileNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#15026
+  # source://prism/lib/prism/node.rb#15026
   sig { returns(T::Boolean) }
   def frozen?; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#15039
+  # source://prism/lib/prism/node.rb#15039
   sig { override.returns(String) }
   def inspect; end
 
@@ -30872,20 +30872,20 @@ class Prism::SourceFileNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#15031
+  # source://prism/lib/prism/node.rb#15031
   sig { returns(T::Boolean) }
   def mutable?; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#15044
+  # source://prism/lib/prism/node.rb#15044
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#15049
+    # source://prism/lib/prism/node.rb#15049
     def type; end
   end
 end
@@ -30895,62 +30895,62 @@ end
 #     __LINE__
 #     ^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#15066
+# source://prism/lib/prism/node.rb#15066
 class Prism::SourceLineNode < ::Prism::Node
   # Initialize a new SourceLineNode node.
   #
   # @return [SourceLineNode] a new instance of SourceLineNode
   #
-  # source://prism//lib/prism/node.rb#15068
+  # source://prism/lib/prism/node.rb#15068
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
   def initialize(source, node_id, location, flags); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#15125
+  # source://prism/lib/prism/node.rb#15125
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#15076
+  # source://prism/lib/prism/node.rb#15076
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#15081
+  # source://prism/lib/prism/node.rb#15081
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#15091
+  # source://prism/lib/prism/node.rb#15091
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#15086
+  # source://prism/lib/prism/node.rb#15086
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> SourceLineNode
   #
-  # source://prism//lib/prism/node.rb#15096
+  # source://prism/lib/prism/node.rb#15096
   sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::SourceLineNode) }
   def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end
 
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#15081
+  # source://prism/lib/prism/node.rb#15081
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
   #
-  # source://prism//lib/prism/node.rb#15104
+  # source://prism/lib/prism/node.rb#15104
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -30959,20 +30959,20 @@ class Prism::SourceLineNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#15109
+  # source://prism/lib/prism/node.rb#15109
   sig { override.returns(String) }
   def inspect; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#15114
+  # source://prism/lib/prism/node.rb#15114
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#15119
+    # source://prism/lib/prism/node.rb#15119
     def type; end
   end
 end
@@ -30982,13 +30982,13 @@ end
 #     [*a]
 #      ^^
 #
-# source://prism//lib/prism/node.rb#15134
+# source://prism/lib/prism/node.rb#15134
 class Prism::SplatNode < ::Prism::Node
   # Initialize a new SplatNode node.
   #
   # @return [SplatNode] a new instance of SplatNode
   #
-  # source://prism//lib/prism/node.rb#15136
+  # source://prism/lib/prism/node.rb#15136
   sig do
     params(
       source: Prism::Source,
@@ -31004,36 +31004,36 @@ class Prism::SplatNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#15212
+  # source://prism/lib/prism/node.rb#15212
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#15146
+  # source://prism/lib/prism/node.rb#15146
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#15151
+  # source://prism/lib/prism/node.rb#15151
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#15163
+  # source://prism/lib/prism/node.rb#15163
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#15156
+  # source://prism/lib/prism/node.rb#15156
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?operator_loc: Location, ?expression: Prism::node?) -> SplatNode
   #
-  # source://prism//lib/prism/node.rb#15168
+  # source://prism/lib/prism/node.rb#15168
   sig do
     params(
       node_id: Integer,
@@ -31048,19 +31048,19 @@ class Prism::SplatNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#15151
+  # source://prism/lib/prism/node.rb#15151
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, operator_loc: Location, expression: Prism::node? }
   #
-  # source://prism//lib/prism/node.rb#15176
+  # source://prism/lib/prism/node.rb#15176
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # attr_reader expression: Prism::node?
   #
-  # source://prism//lib/prism/node.rb#15188
+  # source://prism/lib/prism/node.rb#15188
   sig { returns(T.nilable(Prism::Node)) }
   def expression; end
 
@@ -31069,32 +31069,32 @@ class Prism::SplatNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#15196
+  # source://prism/lib/prism/node.rb#15196
   sig { override.returns(String) }
   def inspect; end
 
   # def operator: () -> String
   #
-  # source://prism//lib/prism/node.rb#15191
+  # source://prism/lib/prism/node.rb#15191
   sig { returns(String) }
   def operator; end
 
   # attr_reader operator_loc: Location
   #
-  # source://prism//lib/prism/node.rb#15181
+  # source://prism/lib/prism/node.rb#15181
   sig { returns(Prism::Location) }
   def operator_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#15201
+  # source://prism/lib/prism/node.rb#15201
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#15206
+    # source://prism/lib/prism/node.rb#15206
     def type; end
   end
 end
@@ -31104,13 +31104,13 @@ end
 #     foo; bar; baz
 #     ^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#15223
+# source://prism/lib/prism/node.rb#15223
 class Prism::StatementsNode < ::Prism::Node
   # Initialize a new StatementsNode node.
   #
   # @return [StatementsNode] a new instance of StatementsNode
   #
-  # source://prism//lib/prism/node.rb#15225
+  # source://prism/lib/prism/node.rb#15225
   sig do
     params(
       source: Prism::Source,
@@ -31125,42 +31125,42 @@ class Prism::StatementsNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#15286
+  # source://prism/lib/prism/node.rb#15286
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#15234
+  # source://prism/lib/prism/node.rb#15234
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader body: Array[Prism::node]
   #
-  # source://prism//lib/prism/node.rb#15267
+  # source://prism/lib/prism/node.rb#15267
   sig { returns(T::Array[Prism::Node]) }
   def body; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#15239
+  # source://prism/lib/prism/node.rb#15239
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#15249
+  # source://prism/lib/prism/node.rb#15249
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#15244
+  # source://prism/lib/prism/node.rb#15244
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?body: Array[Prism::node]) -> StatementsNode
   #
-  # source://prism//lib/prism/node.rb#15254
+  # source://prism/lib/prism/node.rb#15254
   sig do
     params(
       node_id: Integer,
@@ -31174,13 +31174,13 @@ class Prism::StatementsNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#15239
+  # source://prism/lib/prism/node.rb#15239
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, body: Array[Prism::node] }
   #
-  # source://prism//lib/prism/node.rb#15262
+  # source://prism/lib/prism/node.rb#15262
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -31189,43 +31189,43 @@ class Prism::StatementsNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#15270
+  # source://prism/lib/prism/node.rb#15270
   sig { override.returns(String) }
   def inspect; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#15275
+  # source://prism/lib/prism/node.rb#15275
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#15280
+    # source://prism/lib/prism/node.rb#15280
     def type; end
   end
 end
 
 # Flags for string nodes.
 #
-# source://prism//lib/prism/node.rb#16828
+# source://prism/lib/prism/node.rb#16828
 module Prism::StringFlags; end
 
 # internal bytes forced the encoding to binary
 #
-# source://prism//lib/prism/node.rb#16833
+# source://prism/lib/prism/node.rb#16833
 Prism::StringFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer)
 
 # internal bytes forced the encoding to UTF-8
 #
-# source://prism//lib/prism/node.rb#16830
+# source://prism/lib/prism/node.rb#16830
 Prism::StringFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer)
 
-# source://prism//lib/prism/node.rb#16836
+# source://prism/lib/prism/node.rb#16836
 Prism::StringFlags::FROZEN = T.let(T.unsafe(nil), Integer)
 
-# source://prism//lib/prism/node.rb#16839
+# source://prism/lib/prism/node.rb#16839
 Prism::StringFlags::MUTABLE = T.let(T.unsafe(nil), Integer)
 
 # Represents a string literal, a string contained within a `%w` list, or plain string content within an interpolated string.
@@ -31239,7 +31239,7 @@ Prism::StringFlags::MUTABLE = T.let(T.unsafe(nil), Integer)
 #     "foo #{bar} baz"
 #      ^^^^      ^^^^
 #
-# source://prism//lib/prism/node.rb#15303
+# source://prism/lib/prism/node.rb#15303
 class Prism::StringNode < ::Prism::Node
   include ::Prism::HeredocQuery
 
@@ -31247,7 +31247,7 @@ class Prism::StringNode < ::Prism::Node
   #
   # @return [StringNode] a new instance of StringNode
   #
-  # source://prism//lib/prism/node.rb#15305
+  # source://prism/lib/prism/node.rb#15305
   sig do
     params(
       source: Prism::Source,
@@ -31265,60 +31265,60 @@ class Prism::StringNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#15437
+  # source://prism/lib/prism/node.rb#15437
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#15317
+  # source://prism/lib/prism/node.rb#15317
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#15322
+  # source://prism/lib/prism/node.rb#15322
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String?
   #
-  # source://prism//lib/prism/node.rb#15416
+  # source://prism/lib/prism/node.rb#15416
   sig { returns(T.nilable(String)) }
   def closing; end
 
   # attr_reader closing_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#15390
+  # source://prism/lib/prism/node.rb#15390
   sig { returns(T.nilable(Prism::Location)) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#15332
+  # source://prism/lib/prism/node.rb#15332
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#15327
+  # source://prism/lib/prism/node.rb#15327
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def content: () -> String
   #
-  # source://prism//lib/prism/node.rb#15411
+  # source://prism/lib/prism/node.rb#15411
   sig { returns(String) }
   def content; end
 
   # attr_reader content_loc: Location
   #
-  # source://prism//lib/prism/node.rb#15383
+  # source://prism/lib/prism/node.rb#15383
   sig { returns(Prism::Location) }
   def content_loc; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location?, ?content_loc: Location, ?closing_loc: Location?, ?unescaped: String) -> StringNode
   #
-  # source://prism//lib/prism/node.rb#15337
+  # source://prism/lib/prism/node.rb#15337
   sig do
     params(
       node_id: Integer,
@@ -31335,13 +31335,13 @@ class Prism::StringNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#15322
+  # source://prism/lib/prism/node.rb#15322
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location?, content_loc: Location, closing_loc: Location?, unescaped: String }
   #
-  # source://prism//lib/prism/node.rb#15345
+  # source://prism/lib/prism/node.rb#15345
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -31352,7 +31352,7 @@ class Prism::StringNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#15355
+  # source://prism/lib/prism/node.rb#15355
   sig { returns(T::Boolean) }
   def forced_binary_encoding?; end
 
@@ -31360,7 +31360,7 @@ class Prism::StringNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#15350
+  # source://prism/lib/prism/node.rb#15350
   sig { returns(T::Boolean) }
   def forced_utf8_encoding?; end
 
@@ -31368,7 +31368,7 @@ class Prism::StringNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#15360
+  # source://prism/lib/prism/node.rb#15360
   sig { returns(T::Boolean) }
   def frozen?; end
 
@@ -31377,7 +31377,7 @@ class Prism::StringNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#15421
+  # source://prism/lib/prism/node.rb#15421
   sig { override.returns(String) }
   def inspect; end
 
@@ -31385,45 +31385,45 @@ class Prism::StringNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#15365
+  # source://prism/lib/prism/node.rb#15365
   sig { returns(T::Boolean) }
   def mutable?; end
 
   # def opening: () -> String?
   #
-  # source://prism//lib/prism/node.rb#15406
+  # source://prism/lib/prism/node.rb#15406
   sig { returns(T.nilable(String)) }
   def opening; end
 
   # attr_reader opening_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#15370
+  # source://prism/lib/prism/node.rb#15370
   sig { returns(T.nilable(Prism::Location)) }
   def opening_loc; end
 
   # Occasionally it's helpful to treat a string as if it were interpolated so
   # that there's a consistent interface for working with strings.
   #
-  # source://prism//lib/prism/node_ext.rb#72
+  # source://prism/lib/prism/node_ext.rb#72
   sig { returns(Prism::InterpolatedStringNode) }
   def to_interpolated; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#15426
+  # source://prism/lib/prism/node.rb#15426
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader unescaped: String
   #
-  # source://prism//lib/prism/node.rb#15403
+  # source://prism/lib/prism/node.rb#15403
   sig { returns(String) }
   def unescaped; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#15431
+    # source://prism/lib/prism/node.rb#15431
     def type; end
   end
 end
@@ -31436,13 +31436,13 @@ end
 #     super foo, bar
 #     ^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#15454
+# source://prism/lib/prism/node.rb#15454
 class Prism::SuperNode < ::Prism::Node
   # Initialize a new SuperNode node.
   #
   # @return [SuperNode] a new instance of SuperNode
   #
-  # source://prism//lib/prism/node.rb#15456
+  # source://prism/lib/prism/node.rb#15456
   sig do
     params(
       source: Prism::Source,
@@ -31461,48 +31461,48 @@ class Prism::SuperNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#15575
+  # source://prism/lib/prism/node.rb#15575
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#15469
+  # source://prism/lib/prism/node.rb#15469
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader arguments: ArgumentsNode?
   #
-  # source://prism//lib/prism/node.rb#15525
+  # source://prism/lib/prism/node.rb#15525
   sig { returns(T.nilable(Prism::ArgumentsNode)) }
   def arguments; end
 
   # attr_reader block: BlockNode | BlockArgumentNode | nil
   #
-  # source://prism//lib/prism/node.rb#15541
+  # source://prism/lib/prism/node.rb#15541
   sig { returns(T.nilable(T.any(Prism::BlockNode, Prism::BlockArgumentNode))) }
   def block; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#15474
+  # source://prism/lib/prism/node.rb#15474
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#15487
+  # source://prism/lib/prism/node.rb#15487
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#15479
+  # source://prism/lib/prism/node.rb#15479
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?lparen_loc: Location?, ?arguments: ArgumentsNode?, ?rparen_loc: Location?, ?block: BlockNode | BlockArgumentNode | nil) -> SuperNode
   #
-  # source://prism//lib/prism/node.rb#15492
+  # source://prism/lib/prism/node.rb#15492
   sig do
     params(
       node_id: Integer,
@@ -31520,13 +31520,13 @@ class Prism::SuperNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#15474
+  # source://prism/lib/prism/node.rb#15474
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, lparen_loc: Location?, arguments: ArgumentsNode?, rparen_loc: Location?, block: BlockNode | BlockArgumentNode | nil }
   #
-  # source://prism//lib/prism/node.rb#15500
+  # source://prism/lib/prism/node.rb#15500
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -31535,78 +31535,78 @@ class Prism::SuperNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#15559
+  # source://prism/lib/prism/node.rb#15559
   sig { override.returns(String) }
   def inspect; end
 
   # def keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#15544
+  # source://prism/lib/prism/node.rb#15544
   sig { returns(String) }
   def keyword; end
 
   # attr_reader keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#15505
+  # source://prism/lib/prism/node.rb#15505
   sig { returns(Prism::Location) }
   def keyword_loc; end
 
   # def lparen: () -> String?
   #
-  # source://prism//lib/prism/node.rb#15549
+  # source://prism/lib/prism/node.rb#15549
   sig { returns(T.nilable(String)) }
   def lparen; end
 
   # attr_reader lparen_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#15512
+  # source://prism/lib/prism/node.rb#15512
   sig { returns(T.nilable(Prism::Location)) }
   def lparen_loc; end
 
   # def rparen: () -> String?
   #
-  # source://prism//lib/prism/node.rb#15554
+  # source://prism/lib/prism/node.rb#15554
   sig { returns(T.nilable(String)) }
   def rparen; end
 
   # attr_reader rparen_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#15528
+  # source://prism/lib/prism/node.rb#15528
   sig { returns(T.nilable(Prism::Location)) }
   def rparen_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#15564
+  # source://prism/lib/prism/node.rb#15564
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#15569
+    # source://prism/lib/prism/node.rb#15569
     def type; end
   end
 end
 
 # Flags for symbol nodes.
 #
-# source://prism//lib/prism/node.rb#16843
+# source://prism/lib/prism/node.rb#16843
 module Prism::SymbolFlags; end
 
 # internal bytes forced the encoding to binary
 #
-# source://prism//lib/prism/node.rb#16848
+# source://prism/lib/prism/node.rb#16848
 Prism::SymbolFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer)
 
 # internal bytes forced the encoding to US-ASCII
 #
-# source://prism//lib/prism/node.rb#16851
+# source://prism/lib/prism/node.rb#16851
 Prism::SymbolFlags::FORCED_US_ASCII_ENCODING = T.let(T.unsafe(nil), Integer)
 
 # internal bytes forced the encoding to UTF-8
 #
-# source://prism//lib/prism/node.rb#16845
+# source://prism/lib/prism/node.rb#16845
 Prism::SymbolFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer)
 
 # Represents a symbol literal or a symbol contained within a `%i` list.
@@ -31617,13 +31617,13 @@ Prism::SymbolFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer)
 #     %i[foo]
 #        ^^^
 #
-# source://prism//lib/prism/node.rb#15592
+# source://prism/lib/prism/node.rb#15592
 class Prism::SymbolNode < ::Prism::Node
   # Initialize a new SymbolNode node.
   #
   # @return [SymbolNode] a new instance of SymbolNode
   #
-  # source://prism//lib/prism/node.rb#15594
+  # source://prism/lib/prism/node.rb#15594
   sig do
     params(
       source: Prism::Source,
@@ -31641,48 +31641,48 @@ class Prism::SymbolNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#15727
+  # source://prism/lib/prism/node.rb#15727
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#15606
+  # source://prism/lib/prism/node.rb#15606
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#15611
+  # source://prism/lib/prism/node.rb#15611
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String?
   #
-  # source://prism//lib/prism/node.rb#15706
+  # source://prism/lib/prism/node.rb#15706
   sig { returns(T.nilable(String)) }
   def closing; end
 
   # attr_reader closing_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#15680
+  # source://prism/lib/prism/node.rb#15680
   sig { returns(T.nilable(Prism::Location)) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#15621
+  # source://prism/lib/prism/node.rb#15621
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#15616
+  # source://prism/lib/prism/node.rb#15616
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location?, ?value_loc: Location?, ?closing_loc: Location?, ?unescaped: String) -> SymbolNode
   #
-  # source://prism//lib/prism/node.rb#15626
+  # source://prism/lib/prism/node.rb#15626
   sig do
     params(
       node_id: Integer,
@@ -31699,13 +31699,13 @@ class Prism::SymbolNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#15611
+  # source://prism/lib/prism/node.rb#15611
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location?, value_loc: Location?, closing_loc: Location?, unescaped: String }
   #
-  # source://prism//lib/prism/node.rb#15634
+  # source://prism/lib/prism/node.rb#15634
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -31716,7 +31716,7 @@ class Prism::SymbolNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#15644
+  # source://prism/lib/prism/node.rb#15644
   sig { returns(T::Boolean) }
   def forced_binary_encoding?; end
 
@@ -31724,7 +31724,7 @@ class Prism::SymbolNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#15649
+  # source://prism/lib/prism/node.rb#15649
   sig { returns(T::Boolean) }
   def forced_us_ascii_encoding?; end
 
@@ -31732,110 +31732,110 @@ class Prism::SymbolNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#15639
+  # source://prism/lib/prism/node.rb#15639
   sig { returns(T::Boolean) }
   def forced_utf8_encoding?; end
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#15711
+  # source://prism/lib/prism/node.rb#15711
   sig { override.returns(String) }
   def inspect; end
 
   # def opening: () -> String?
   #
-  # source://prism//lib/prism/node.rb#15696
+  # source://prism/lib/prism/node.rb#15696
   sig { returns(T.nilable(String)) }
   def opening; end
 
   # attr_reader opening_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#15654
+  # source://prism/lib/prism/node.rb#15654
   sig { returns(T.nilable(Prism::Location)) }
   def opening_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#15716
+  # source://prism/lib/prism/node.rb#15716
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader unescaped: String
   #
-  # source://prism//lib/prism/node.rb#15693
+  # source://prism/lib/prism/node.rb#15693
   sig { returns(String) }
   def unescaped; end
 
   # def value: () -> String?
   #
-  # source://prism//lib/prism/node.rb#15701
+  # source://prism/lib/prism/node.rb#15701
   sig { returns(T.nilable(String)) }
   def value; end
 
   # attr_reader value_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#15667
+  # source://prism/lib/prism/node.rb#15667
   sig { returns(T.nilable(Prism::Location)) }
   def value_loc; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#15721
+    # source://prism/lib/prism/node.rb#15721
     def type; end
   end
 end
 
 # This represents a token from the Ruby source.
 #
-# source://prism//lib/prism/parse_result.rb#799
+# source://prism/lib/prism/parse_result.rb#799
 class Prism::Token
   # Create a new token object with the given type, value, and location.
   #
   # @return [Token] a new instance of Token
   #
-  # source://prism//lib/prism/parse_result.rb#811
+  # source://prism/lib/prism/parse_result.rb#811
   sig { params(source: Prism::Source, type: Symbol, value: String, location: T.any(Integer, Prism::Location)).void }
   def initialize(source, type, value, location); end
 
   # Returns true if the given other token is equal to this token.
   #
-  # source://prism//lib/prism/parse_result.rb#846
+  # source://prism/lib/prism/parse_result.rb#846
   sig { params(other: T.untyped).returns(T::Boolean) }
   def ==(other); end
 
   # Implement the hash pattern matching interface for Token.
   #
-  # source://prism//lib/prism/parse_result.rb#819
+  # source://prism/lib/prism/parse_result.rb#819
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
   # Returns a string representation of this token.
   #
-  # source://prism//lib/prism/parse_result.rb#853
+  # source://prism/lib/prism/parse_result.rb#853
   def inspect; end
 
   # A Location object representing the location of this token in the source.
   #
-  # source://prism//lib/prism/parse_result.rb#824
+  # source://prism/lib/prism/parse_result.rb#824
   sig { returns(Prism::Location) }
   def location; end
 
   # Implement the pretty print interface for Token.
   #
-  # source://prism//lib/prism/parse_result.rb#831
+  # source://prism/lib/prism/parse_result.rb#831
   sig { params(q: T.untyped).void }
   def pretty_print(q); end
 
   # The type of token that this token is.
   #
-  # source://prism//lib/prism/parse_result.rb#805
+  # source://prism/lib/prism/parse_result.rb#805
   sig { returns(Symbol) }
   def type; end
 
   # A byteslice of the source that this token represents.
   #
-  # source://prism//lib/prism/parse_result.rb#808
+  # source://prism/lib/prism/parse_result.rb#808
   sig { returns(String) }
   def value; end
 
@@ -31843,7 +31843,7 @@ class Prism::Token
 
   # The Source object that represents the source this token came from.
   #
-  # source://prism//lib/prism/parse_result.rb#801
+  # source://prism/lib/prism/parse_result.rb#801
   sig { returns(Prism::Source) }
   def source; end
 end
@@ -31851,7 +31851,7 @@ end
 # This module is responsible for converting the prism syntax tree into other
 # syntax trees.
 #
-# source://prism//lib/prism/translation.rb#6
+# source://prism/lib/prism/translation.rb#6
 module Prism::Translation; end
 
 # This class is the entry-point for converting a prism syntax tree into the
@@ -31859,52 +31859,52 @@ module Prism::Translation; end
 # the parser gem, and overrides the parse* methods to parse with prism and
 # then translate.
 #
-# source://prism//lib/prism/translation/parser.rb#16
+# source://prism/lib/prism/translation/parser.rb#16
 class Prism::Translation::Parser < ::Parser::Base
   # The default encoding for Ruby files is UTF-8.
   #
-  # source://prism//lib/prism/translation/parser.rb#41
+  # source://prism/lib/prism/translation/parser.rb#41
   def default_encoding; end
 
   # Parses a source buffer and returns the AST.
   #
-  # source://prism//lib/prism/translation/parser.rb#49
+  # source://prism/lib/prism/translation/parser.rb#49
   def parse(source_buffer); end
 
   # Parses a source buffer and returns the AST and the source code comments.
   #
-  # source://prism//lib/prism/translation/parser.rb#62
+  # source://prism/lib/prism/translation/parser.rb#62
   def parse_with_comments(source_buffer); end
 
   # Parses a source buffer and returns the AST, the source code comments,
   # and the tokens emitted by the lexer.
   #
-  # source://prism//lib/prism/translation/parser.rb#79
+  # source://prism/lib/prism/translation/parser.rb#79
   def tokenize(source_buffer, recover = T.unsafe(nil)); end
 
   # Since prism resolves num params for us, we don't need to support this
   # kind of logic here.
   #
-  # source://prism//lib/prism/translation/parser.rb#105
+  # source://prism/lib/prism/translation/parser.rb#105
   def try_declare_numparam(node); end
 
-  # source://prism//lib/prism/translation/parser.rb#36
+  # source://prism/lib/prism/translation/parser.rb#36
   sig { overridable.returns(Integer) }
   def version; end
 
-  # source://prism//lib/prism/translation/parser.rb#45
+  # source://prism/lib/prism/translation/parser.rb#45
   def yyerror; end
 
   private
 
   # Build the parser gem AST from the prism AST.
   #
-  # source://prism//lib/prism/translation/parser.rb#263
+  # source://prism/lib/prism/translation/parser.rb#263
   def build_ast(program, offset_cache); end
 
   # Build the parser gem comments from the prism comments.
   #
-  # source://prism//lib/prism/translation/parser.rb#268
+  # source://prism/lib/prism/translation/parser.rb#268
   def build_comments(comments, offset_cache); end
 
   # Prism deals with offsets in bytes, while the parser gem deals with
@@ -31915,33 +31915,33 @@ class Prism::Translation::Parser < ::Parser::Base
   # just use the offset directly. Otherwise, we build an array where the
   # index is the byte offset and the value is the character offset.
   #
-  # source://prism//lib/prism/translation/parser.rb#246
+  # source://prism/lib/prism/translation/parser.rb#246
   def build_offset_cache(source); end
 
   # Build a range from a prism location.
   #
-  # source://prism//lib/prism/translation/parser.rb#280
+  # source://prism/lib/prism/translation/parser.rb#280
   def build_range(location, offset_cache); end
 
   # Build the parser gem tokens from the prism tokens.
   #
-  # source://prism//lib/prism/translation/parser.rb#275
+  # source://prism/lib/prism/translation/parser.rb#275
   def build_tokens(tokens, offset_cache); end
 
   # Converts the version format handled by Parser to the format handled by Prism.
   #
-  # source://prism//lib/prism/translation/parser.rb#289
+  # source://prism/lib/prism/translation/parser.rb#289
   def convert_for_prism(version); end
 
   # Build a diagnostic from the given prism parse error.
   #
-  # source://prism//lib/prism/translation/parser.rb#124
+  # source://prism/lib/prism/translation/parser.rb#124
   def error_diagnostic(error, offset_cache); end
 
   # If there was a error generated during the parse, then raise an
   # appropriate syntax error. Otherwise return the result.
   #
-  # source://prism//lib/prism/translation/parser.rb#224
+  # source://prism/lib/prism/translation/parser.rb#224
   def unwrap(result, offset_cache); end
 
   # This is a hook to allow consumers to disable some errors if they don't
@@ -31949,7 +31949,7 @@ class Prism::Translation::Parser < ::Parser::Base
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/translation/parser.rb#113
+  # source://prism/lib/prism/translation/parser.rb#113
   def valid_error?(error); end
 
   # This is a hook to allow consumers to disable some warnings if they don't
@@ -31957,29 +31957,29 @@ class Prism::Translation::Parser < ::Parser::Base
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/translation/parser.rb#119
+  # source://prism/lib/prism/translation/parser.rb#119
   def valid_warning?(warning); end
 
   # Build a diagnostic from the given prism parse warning.
   #
-  # source://prism//lib/prism/translation/parser.rb#197
+  # source://prism/lib/prism/translation/parser.rb#197
   def warning_diagnostic(warning, offset_cache); end
 end
 
 # This class is the entry-point for Ruby 3.3 of `Prism::Translation::Parser`.
 #
-# source://prism//lib/prism/translation/parser33.rb#6
+# source://prism/lib/prism/translation/parser33.rb#6
 class Prism::Translation::Parser33 < ::Prism::Translation::Parser
-  # source://prism//lib/prism/translation/parser33.rb#7
+  # source://prism/lib/prism/translation/parser33.rb#7
   sig { override.returns(Integer) }
   def version; end
 end
 
 # This class is the entry-point for Ruby 3.4 of `Prism::Translation::Parser`.
 #
-# source://prism//lib/prism/translation/parser34.rb#6
+# source://prism/lib/prism/translation/parser34.rb#6
 class Prism::Translation::Parser34 < ::Prism::Translation::Parser
-  # source://prism//lib/prism/translation/parser34.rb#7
+  # source://prism/lib/prism/translation/parser34.rb#7
   sig { override.returns(Integer) }
   def version; end
 end
@@ -31987,100 +31987,100 @@ end
 # A visitor that knows how to convert a prism syntax tree into the
 # whitequark/parser gem's syntax tree.
 #
-# source://prism//lib/prism/translation/parser/compiler.rb#8
+# source://prism/lib/prism/translation/parser/compiler.rb#8
 class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # Initialize a new compiler with the given parser, offset cache, and
   # options.
   #
   # @return [Compiler] a new instance of Compiler
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#39
+  # source://prism/lib/prism/translation/parser/compiler.rb#39
   def initialize(parser, offset_cache, forwarding: T.unsafe(nil), in_destructure: T.unsafe(nil), in_pattern: T.unsafe(nil)); end
 
   # The Parser::Builders::Default instance that is being used to build the
   # AST.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#18
+  # source://prism/lib/prism/translation/parser/compiler.rb#18
   def builder; end
 
   # The types of values that can be forwarded in the current scope.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#29
+  # source://prism/lib/prism/translation/parser/compiler.rb#29
   def forwarding; end
 
   # Whether or not the current node is in a destructure.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#32
+  # source://prism/lib/prism/translation/parser/compiler.rb#32
   def in_destructure; end
 
   # Whether or not the current node is in a pattern.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#35
+  # source://prism/lib/prism/translation/parser/compiler.rb#35
   def in_pattern; end
 
   # The offset cache that is used to map between byte and character
   # offsets in the file.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#26
+  # source://prism/lib/prism/translation/parser/compiler.rb#26
   def offset_cache; end
 
   # The Parser::Base instance that is being used to build the AST.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#14
+  # source://prism/lib/prism/translation/parser/compiler.rb#14
   def parser; end
 
   # The Parser::Source::Buffer instance that is holding a reference to the
   # source code.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#22
+  # source://prism/lib/prism/translation/parser/compiler.rb#22
   def source_buffer; end
 
   # alias $foo $bar
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#58
+  # source://prism/lib/prism/translation/parser/compiler.rb#58
   def visit_alias_global_variable_node(node); end
 
   # alias foo bar
   # ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#52
+  # source://prism/lib/prism/translation/parser/compiler.rb#52
   def visit_alias_method_node(node); end
 
   # foo => bar | baz
   #        ^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#64
+  # source://prism/lib/prism/translation/parser/compiler.rb#64
   def visit_alternation_pattern_node(node); end
 
   # a and b
   # ^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#70
+  # source://prism/lib/prism/translation/parser/compiler.rb#70
   def visit_and_node(node); end
 
   # foo(bar)
   #     ^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#105
+  # source://prism/lib/prism/translation/parser/compiler.rb#105
   def visit_arguments_node(node); end
 
   # []
   # ^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#76
+  # source://prism/lib/prism/translation/parser/compiler.rb#76
   def visit_array_node(node); end
 
   # foo => [bar]
   #        ^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#82
+  # source://prism/lib/prism/translation/parser/compiler.rb#82
   def visit_array_pattern_node(node); end
 
   # { a: 1 }
   #   ^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#111
+  # source://prism/lib/prism/translation/parser/compiler.rb#111
   def visit_assoc_node(node); end
 
   # def foo(**); bar(**); end
@@ -32089,49 +32089,49 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # { **foo }
   #   ^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#160
+  # source://prism/lib/prism/translation/parser/compiler.rb#160
   def visit_assoc_splat_node(node); end
 
   # $+
   # ^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#172
+  # source://prism/lib/prism/translation/parser/compiler.rb#172
   def visit_back_reference_read_node(node); end
 
   # begin end
   # ^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#178
+  # source://prism/lib/prism/translation/parser/compiler.rb#178
   def visit_begin_node(node); end
 
   # foo(&bar)
   #     ^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#216
+  # source://prism/lib/prism/translation/parser/compiler.rb#216
   def visit_block_argument_node(node); end
 
   # foo { |; bar| }
   #          ^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#222
+  # source://prism/lib/prism/translation/parser/compiler.rb#222
   def visit_block_local_variable_node(node); end
 
   # A block on a keyword or method call.
   #
   # @raise [CompilationError]
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#227
+  # source://prism/lib/prism/translation/parser/compiler.rb#227
   def visit_block_node(node); end
 
   # def foo(&bar); end
   #         ^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#233
+  # source://prism/lib/prism/translation/parser/compiler.rb#233
   def visit_block_parameter_node(node); end
 
   # A block's parameters.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#238
+  # source://prism/lib/prism/translation/parser/compiler.rb#238
   def visit_block_parameters_node(node); end
 
   # break
@@ -32140,13 +32140,13 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # break foo
   # ^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#247
+  # source://prism/lib/prism/translation/parser/compiler.rb#247
   def visit_break_node(node); end
 
   # foo.bar &&= baz
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#352
+  # source://prism/lib/prism/translation/parser/compiler.rb#352
   def visit_call_and_write_node(node); end
 
   # foo
@@ -32158,133 +32158,133 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # foo.bar() {}
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#259
+  # source://prism/lib/prism/translation/parser/compiler.rb#259
   def visit_call_node(node); end
 
   # foo.bar += baz
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#333
+  # source://prism/lib/prism/translation/parser/compiler.rb#333
   def visit_call_operator_write_node(node); end
 
   # foo.bar ||= baz
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#371
+  # source://prism/lib/prism/translation/parser/compiler.rb#371
   def visit_call_or_write_node(node); end
 
   # foo.bar, = 1
   # ^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#390
+  # source://prism/lib/prism/translation/parser/compiler.rb#390
   def visit_call_target_node(node); end
 
   # foo => bar => baz
   #        ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#402
+  # source://prism/lib/prism/translation/parser/compiler.rb#402
   def visit_capture_pattern_node(node); end
 
   # case foo; in bar; end
   # ^^^^^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#421
+  # source://prism/lib/prism/translation/parser/compiler.rb#421
   def visit_case_match_node(node); end
 
   # case foo; when bar; end
   # ^^^^^^^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#408
+  # source://prism/lib/prism/translation/parser/compiler.rb#408
   def visit_case_node(node); end
 
   # class Foo; end
   # ^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#434
+  # source://prism/lib/prism/translation/parser/compiler.rb#434
   def visit_class_node(node); end
 
   # @@foo &&= bar
   # ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#473
+  # source://prism/lib/prism/translation/parser/compiler.rb#473
   def visit_class_variable_and_write_node(node); end
 
   # @@foo += bar
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#463
+  # source://prism/lib/prism/translation/parser/compiler.rb#463
   def visit_class_variable_operator_write_node(node); end
 
   # @@foo ||= bar
   # ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#483
+  # source://prism/lib/prism/translation/parser/compiler.rb#483
   def visit_class_variable_or_write_node(node); end
 
   # @@foo
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#447
+  # source://prism/lib/prism/translation/parser/compiler.rb#447
   def visit_class_variable_read_node(node); end
 
   # @@foo, = bar
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#493
+  # source://prism/lib/prism/translation/parser/compiler.rb#493
   def visit_class_variable_target_node(node); end
 
   # @@foo = 1
   # ^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#453
+  # source://prism/lib/prism/translation/parser/compiler.rb#453
   def visit_class_variable_write_node(node); end
 
   # Foo &&= bar
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#524
+  # source://prism/lib/prism/translation/parser/compiler.rb#524
   def visit_constant_and_write_node(node); end
 
   # Foo += bar
   # ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#514
+  # source://prism/lib/prism/translation/parser/compiler.rb#514
   def visit_constant_operator_write_node(node); end
 
   # Foo ||= bar
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#534
+  # source://prism/lib/prism/translation/parser/compiler.rb#534
   def visit_constant_or_write_node(node); end
 
   # Foo::Bar &&= baz
   # ^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#590
+  # source://prism/lib/prism/translation/parser/compiler.rb#590
   def visit_constant_path_and_write_node(node); end
 
   # Foo::Bar
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#550
+  # source://prism/lib/prism/translation/parser/compiler.rb#550
   def visit_constant_path_node(node); end
 
   # Foo::Bar += baz
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#580
+  # source://prism/lib/prism/translation/parser/compiler.rb#580
   def visit_constant_path_operator_write_node(node); end
 
   # Foo::Bar ||= baz
   # ^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#600
+  # source://prism/lib/prism/translation/parser/compiler.rb#600
   def visit_constant_path_or_write_node(node); end
 
   # Foo::Bar, = baz
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#610
+  # source://prism/lib/prism/translation/parser/compiler.rb#610
   def visit_constant_path_target_node(node); end
 
   # Foo::Bar = 1
@@ -32293,19 +32293,19 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # Foo::Foo, Bar::Bar = 1
   # ^^^^^^^^  ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#570
+  # source://prism/lib/prism/translation/parser/compiler.rb#570
   def visit_constant_path_write_node(node); end
 
   # Foo
   # ^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#499
+  # source://prism/lib/prism/translation/parser/compiler.rb#499
   def visit_constant_read_node(node); end
 
   # Foo, = bar
   # ^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#544
+  # source://prism/lib/prism/translation/parser/compiler.rb#544
   def visit_constant_target_node(node); end
 
   # Foo = 1
@@ -32314,7 +32314,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # Foo, Bar = 1
   # ^^^  ^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#508
+  # source://prism/lib/prism/translation/parser/compiler.rb#508
   def visit_constant_write_node(node); end
 
   # def foo; end
@@ -32323,7 +32323,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # def self.foo; end
   # ^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#619
+  # source://prism/lib/prism/translation/parser/compiler.rb#619
   def visit_def_node(node); end
 
   # defined? a
@@ -32332,25 +32332,25 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # defined?(a)
   # ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#666
+  # source://prism/lib/prism/translation/parser/compiler.rb#666
   def visit_defined_node(node); end
 
   # if foo then bar else baz end
   #                 ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#678
+  # source://prism/lib/prism/translation/parser/compiler.rb#678
   def visit_else_node(node); end
 
   # "foo #{bar}"
   #      ^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#684
+  # source://prism/lib/prism/translation/parser/compiler.rb#684
   def visit_embedded_statements_node(node); end
 
   # "foo #@bar"
   #      ^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#694
+  # source://prism/lib/prism/translation/parser/compiler.rb#694
   def visit_embedded_variable_node(node); end
 
   # begin; foo; ensure; bar; end
@@ -32358,19 +32358,19 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   #
   # @raise [CompilationError]
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#700
+  # source://prism/lib/prism/translation/parser/compiler.rb#700
   def visit_ensure_node(node); end
 
   # false
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#706
+  # source://prism/lib/prism/translation/parser/compiler.rb#706
   def visit_false_node(node); end
 
   # foo => [*, bar, *]
   #        ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#712
+  # source://prism/lib/prism/translation/parser/compiler.rb#712
   def visit_find_pattern_node(node); end
 
   # 0..5
@@ -32378,31 +32378,31 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # if foo .. bar; end
   #    ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1475
+  # source://prism/lib/prism/translation/parser/compiler.rb#1475
   def visit_flip_flop_node(node); end
 
   # 1.0
   # ^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#724
+  # source://prism/lib/prism/translation/parser/compiler.rb#724
   def visit_float_node(node); end
 
   # for foo in bar do end
   # ^^^^^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#730
+  # source://prism/lib/prism/translation/parser/compiler.rb#730
   def visit_for_node(node); end
 
   # def foo(...); bar(...); end
   #                   ^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#748
+  # source://prism/lib/prism/translation/parser/compiler.rb#748
   def visit_forwarding_arguments_node(node); end
 
   # def foo(...); end
   #         ^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#754
+  # source://prism/lib/prism/translation/parser/compiler.rb#754
   def visit_forwarding_parameter_node(node); end
 
   # super
@@ -32411,55 +32411,55 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # super {}
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#763
+  # source://prism/lib/prism/translation/parser/compiler.rb#763
   def visit_forwarding_super_node(node); end
 
   # $foo &&= bar
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#801
+  # source://prism/lib/prism/translation/parser/compiler.rb#801
   def visit_global_variable_and_write_node(node); end
 
   # $foo += bar
   # ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#791
+  # source://prism/lib/prism/translation/parser/compiler.rb#791
   def visit_global_variable_operator_write_node(node); end
 
   # $foo ||= bar
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#811
+  # source://prism/lib/prism/translation/parser/compiler.rb#811
   def visit_global_variable_or_write_node(node); end
 
   # $foo
   # ^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#775
+  # source://prism/lib/prism/translation/parser/compiler.rb#775
   def visit_global_variable_read_node(node); end
 
   # $foo, = bar
   # ^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#821
+  # source://prism/lib/prism/translation/parser/compiler.rb#821
   def visit_global_variable_target_node(node); end
 
   # $foo = 1
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#781
+  # source://prism/lib/prism/translation/parser/compiler.rb#781
   def visit_global_variable_write_node(node); end
 
   # {}
   # ^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#827
+  # source://prism/lib/prism/translation/parser/compiler.rb#827
   def visit_hash_node(node); end
 
   # foo => {}
   #        ^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#837
+  # source://prism/lib/prism/translation/parser/compiler.rb#837
   def visit_hash_pattern_node(node); end
 
   # if foo then bar end
@@ -32471,13 +32471,13 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # foo ? bar : baz
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#855
+  # source://prism/lib/prism/translation/parser/compiler.rb#855
   def visit_if_node(node); end
 
   # 1i
   # ^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#897
+  # source://prism/lib/prism/translation/parser/compiler.rb#897
   def visit_imaginary_node(node); end
 
   # { foo: }
@@ -32485,7 +32485,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   #
   # @raise [CompilationError]
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#903
+  # source://prism/lib/prism/translation/parser/compiler.rb#903
   def visit_implicit_node(node); end
 
   # foo { |bar,| }
@@ -32493,74 +32493,74 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   #
   # @raise [CompilationError]
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#909
+  # source://prism/lib/prism/translation/parser/compiler.rb#909
   def visit_implicit_rest_node(node); end
 
   # case foo; in bar; end
   # ^^^^^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#915
+  # source://prism/lib/prism/translation/parser/compiler.rb#915
   def visit_in_node(node); end
 
   # foo[bar] &&= baz
   # ^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#959
+  # source://prism/lib/prism/translation/parser/compiler.rb#959
   def visit_index_and_write_node(node); end
 
   # foo[bar] += baz
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#941
+  # source://prism/lib/prism/translation/parser/compiler.rb#941
   def visit_index_operator_write_node(node); end
 
   # foo[bar] ||= baz
   # ^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#977
+  # source://prism/lib/prism/translation/parser/compiler.rb#977
   def visit_index_or_write_node(node); end
 
   # foo[bar], = 1
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#995
+  # source://prism/lib/prism/translation/parser/compiler.rb#995
   def visit_index_target_node(node); end
 
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1032
+  # source://prism/lib/prism/translation/parser/compiler.rb#1032
   def visit_instance_variable_and_write_node(node); end
 
   # ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1022
+  # source://prism/lib/prism/translation/parser/compiler.rb#1022
   def visit_instance_variable_operator_write_node(node); end
 
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1042
+  # source://prism/lib/prism/translation/parser/compiler.rb#1042
   def visit_instance_variable_or_write_node(node); end
 
   # ^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1006
+  # source://prism/lib/prism/translation/parser/compiler.rb#1006
   def visit_instance_variable_read_node(node); end
 
   # @foo, = bar
   # ^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1052
+  # source://prism/lib/prism/translation/parser/compiler.rb#1052
   def visit_instance_variable_target_node(node); end
 
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1012
+  # source://prism/lib/prism/translation/parser/compiler.rb#1012
   def visit_instance_variable_write_node(node); end
 
   # 1
   # ^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1058
+  # source://prism/lib/prism/translation/parser/compiler.rb#1058
   def visit_integer_node(node); end
 
   # /foo #{bar}/
@@ -32568,49 +32568,49 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # if /foo #{bar}/ then end
   #    ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1064
+  # source://prism/lib/prism/translation/parser/compiler.rb#1064
   def visit_interpolated_match_last_line_node(node); end
 
   # /foo #{bar}/
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1064
+  # source://prism/lib/prism/translation/parser/compiler.rb#1064
   def visit_interpolated_regular_expression_node(node); end
 
   # "foo #{bar}"
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1079
+  # source://prism/lib/prism/translation/parser/compiler.rb#1079
   def visit_interpolated_string_node(node); end
 
   # :"foo #{bar}"
   # ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1113
+  # source://prism/lib/prism/translation/parser/compiler.rb#1113
   def visit_interpolated_symbol_node(node); end
 
   # `foo #{bar}`
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1123
+  # source://prism/lib/prism/translation/parser/compiler.rb#1123
   def visit_interpolated_x_string_node(node); end
 
   # -> { it }
   #      ^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1137
+  # source://prism/lib/prism/translation/parser/compiler.rb#1137
   def visit_it_local_variable_read_node(node); end
 
   # -> { it }
   # ^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1143
+  # source://prism/lib/prism/translation/parser/compiler.rb#1143
   def visit_it_parameters_node(node); end
 
   # foo(bar: baz)
   #     ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1149
+  # source://prism/lib/prism/translation/parser/compiler.rb#1149
   def visit_keyword_hash_node(node); end
 
   # def foo(**bar); end
@@ -32619,49 +32619,49 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # def foo(**); end
   #         ^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1158
+  # source://prism/lib/prism/translation/parser/compiler.rb#1158
   def visit_keyword_rest_parameter_node(node); end
 
   # -> {}
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1167
+  # source://prism/lib/prism/translation/parser/compiler.rb#1167
   def visit_lambda_node(node); end
 
   # foo &&= bar
   # ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1219
+  # source://prism/lib/prism/translation/parser/compiler.rb#1219
   def visit_local_variable_and_write_node(node); end
 
   # foo += bar
   # ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1209
+  # source://prism/lib/prism/translation/parser/compiler.rb#1209
   def visit_local_variable_operator_write_node(node); end
 
   # foo ||= bar
   # ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1229
+  # source://prism/lib/prism/translation/parser/compiler.rb#1229
   def visit_local_variable_or_write_node(node); end
 
   # foo
   # ^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1193
+  # source://prism/lib/prism/translation/parser/compiler.rb#1193
   def visit_local_variable_read_node(node); end
 
   # foo, = bar
   # ^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1239
+  # source://prism/lib/prism/translation/parser/compiler.rb#1239
   def visit_local_variable_target_node(node); end
 
   # foo = 1
   # ^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1199
+  # source://prism/lib/prism/translation/parser/compiler.rb#1199
   def visit_local_variable_write_node(node); end
 
   # /foo/
@@ -32669,50 +32669,50 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # if /foo/ then end
   #    ^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1509
+  # source://prism/lib/prism/translation/parser/compiler.rb#1509
   def visit_match_last_line_node(node); end
 
   # foo in bar
   # ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1249
+  # source://prism/lib/prism/translation/parser/compiler.rb#1249
   def visit_match_predicate_node(node); end
 
   # foo => bar
   # ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1259
+  # source://prism/lib/prism/translation/parser/compiler.rb#1259
   def visit_match_required_node(node); end
 
   # /(?<foo>foo)/ =~ bar
   # ^^^^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1269
+  # source://prism/lib/prism/translation/parser/compiler.rb#1269
   def visit_match_write_node(node); end
 
   # A node that is missing from the syntax tree. This is only used in the
   # case of a syntax error. The parser gem doesn't have such a concept, so
   # we invent our own here.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1280
+  # source://prism/lib/prism/translation/parser/compiler.rb#1280
   def visit_missing_node(node); end
 
   # module Foo; end
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1286
+  # source://prism/lib/prism/translation/parser/compiler.rb#1286
   def visit_module_node(node); end
 
   # foo, bar = baz
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1297
+  # source://prism/lib/prism/translation/parser/compiler.rb#1297
   def visit_multi_target_node(node); end
 
   # foo, bar = baz
   # ^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1307
+  # source://prism/lib/prism/translation/parser/compiler.rb#1307
   def visit_multi_write_node(node); end
 
   # next
@@ -32721,55 +32721,55 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # next foo
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1330
+  # source://prism/lib/prism/translation/parser/compiler.rb#1330
   def visit_next_node(node); end
 
   # nil
   # ^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1342
+  # source://prism/lib/prism/translation/parser/compiler.rb#1342
   def visit_nil_node(node); end
 
   # def foo(**nil); end
   #         ^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1348
+  # source://prism/lib/prism/translation/parser/compiler.rb#1348
   def visit_no_keywords_parameter_node(node); end
 
   # -> { _1 + _2 }
   # ^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1358
+  # source://prism/lib/prism/translation/parser/compiler.rb#1358
   def visit_numbered_parameters_node(node); end
 
   # $1
   # ^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1364
+  # source://prism/lib/prism/translation/parser/compiler.rb#1364
   def visit_numbered_reference_read_node(node); end
 
   # def foo(bar: baz); end
   #         ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1370
+  # source://prism/lib/prism/translation/parser/compiler.rb#1370
   def visit_optional_keyword_parameter_node(node); end
 
   # def foo(bar = 1); end
   #         ^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1376
+  # source://prism/lib/prism/translation/parser/compiler.rb#1376
   def visit_optional_parameter_node(node); end
 
   # a or b
   # ^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1382
+  # source://prism/lib/prism/translation/parser/compiler.rb#1382
   def visit_or_node(node); end
 
   # def foo(bar, *baz); end
   #         ^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1388
+  # source://prism/lib/prism/translation/parser/compiler.rb#1388
   def visit_parameters_node(node); end
 
   # ()
@@ -32778,76 +32778,76 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # (1)
   # ^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1427
+  # source://prism/lib/prism/translation/parser/compiler.rb#1427
   def visit_parentheses_node(node); end
 
   # foo => ^(bar)
   #        ^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1437
+  # source://prism/lib/prism/translation/parser/compiler.rb#1437
   def visit_pinned_expression_node(node); end
 
   # foo = 1 and bar => ^foo
   #                    ^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1444
+  # source://prism/lib/prism/translation/parser/compiler.rb#1444
   def visit_pinned_variable_node(node); end
 
   # END {}
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1449
+  # source://prism/lib/prism/translation/parser/compiler.rb#1449
   def visit_post_execution_node(node); end
 
   # BEGIN {}
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1459
+  # source://prism/lib/prism/translation/parser/compiler.rb#1459
   def visit_pre_execution_node(node); end
 
   # The top-level program node.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1469
+  # source://prism/lib/prism/translation/parser/compiler.rb#1469
   def visit_program_node(node); end
 
   # 0..5
   # ^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1475
+  # source://prism/lib/prism/translation/parser/compiler.rb#1475
   def visit_range_node(node); end
 
   # 1r
   # ^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1497
+  # source://prism/lib/prism/translation/parser/compiler.rb#1497
   def visit_rational_node(node); end
 
   # redo
   # ^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1503
+  # source://prism/lib/prism/translation/parser/compiler.rb#1503
   def visit_redo_node(node); end
 
   # /foo/
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1509
+  # source://prism/lib/prism/translation/parser/compiler.rb#1509
   def visit_regular_expression_node(node); end
 
   # def foo(bar:); end
   #         ^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1535
+  # source://prism/lib/prism/translation/parser/compiler.rb#1535
   def visit_required_keyword_parameter_node(node); end
 
   # def foo(bar); end
   #         ^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1541
+  # source://prism/lib/prism/translation/parser/compiler.rb#1541
   def visit_required_parameter_node(node); end
 
   # foo rescue bar
   # ^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1547
+  # source://prism/lib/prism/translation/parser/compiler.rb#1547
   def visit_rescue_modifier_node(node); end
 
   # begin; rescue; end
@@ -32855,7 +32855,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   #
   # @raise [CompilationError]
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1565
+  # source://prism/lib/prism/translation/parser/compiler.rb#1565
   def visit_rescue_node(node); end
 
   # def foo(*bar); end
@@ -32864,13 +32864,13 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # def foo(*); end
   #         ^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1574
+  # source://prism/lib/prism/translation/parser/compiler.rb#1574
   def visit_rest_parameter_node(node); end
 
   # retry
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1580
+  # source://prism/lib/prism/translation/parser/compiler.rb#1580
   def visit_retry_node(node); end
 
   # return
@@ -32879,42 +32879,42 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # return 1
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1589
+  # source://prism/lib/prism/translation/parser/compiler.rb#1589
   def visit_return_node(node); end
 
   # self
   # ^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1601
+  # source://prism/lib/prism/translation/parser/compiler.rb#1601
   def visit_self_node(node); end
 
   # A shareable constant.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1606
+  # source://prism/lib/prism/translation/parser/compiler.rb#1606
   def visit_shareable_constant_node(node); end
 
   # class << self; end
   # ^^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1612
+  # source://prism/lib/prism/translation/parser/compiler.rb#1612
   def visit_singleton_class_node(node); end
 
   # __ENCODING__
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1624
+  # source://prism/lib/prism/translation/parser/compiler.rb#1624
   def visit_source_encoding_node(node); end
 
   # __FILE__
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1630
+  # source://prism/lib/prism/translation/parser/compiler.rb#1630
   def visit_source_file_node(node); end
 
   # __LINE__
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1636
+  # source://prism/lib/prism/translation/parser/compiler.rb#1636
   def visit_source_line_node(node); end
 
   # foo(*bar)
@@ -32926,42 +32926,42 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # def foo(*); bar(*); end
   #                 ^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1648
+  # source://prism/lib/prism/translation/parser/compiler.rb#1648
   def visit_splat_node(node); end
 
   # A list of statements.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1661
+  # source://prism/lib/prism/translation/parser/compiler.rb#1661
   def visit_statements_node(node); end
 
   # "foo"
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1667
+  # source://prism/lib/prism/translation/parser/compiler.rb#1667
   def visit_string_node(node); end
 
   # super(foo)
   # ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1709
+  # source://prism/lib/prism/translation/parser/compiler.rb#1709
   def visit_super_node(node); end
 
   # :foo
   # ^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1732
+  # source://prism/lib/prism/translation/parser/compiler.rb#1732
   def visit_symbol_node(node); end
 
   # true
   # ^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1764
+  # source://prism/lib/prism/translation/parser/compiler.rb#1764
   def visit_true_node(node); end
 
   # undef foo
   # ^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1770
+  # source://prism/lib/prism/translation/parser/compiler.rb#1770
   def visit_undef_node(node); end
 
   # unless foo; bar end
@@ -32970,7 +32970,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # bar unless foo
   # ^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1779
+  # source://prism/lib/prism/translation/parser/compiler.rb#1779
   def visit_unless_node(node); end
 
   # until foo; bar end
@@ -32979,13 +32979,13 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # bar until foo
   # ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1809
+  # source://prism/lib/prism/translation/parser/compiler.rb#1809
   def visit_until_node(node); end
 
   # case foo; when bar; end
   #           ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1831
+  # source://prism/lib/prism/translation/parser/compiler.rb#1831
   def visit_when_node(node); end
 
   # while foo; bar end
@@ -32994,13 +32994,13 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # bar while foo
   # ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1849
+  # source://prism/lib/prism/translation/parser/compiler.rb#1849
   def visit_while_node(node); end
 
   # `foo`
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1871
+  # source://prism/lib/prism/translation/parser/compiler.rb#1871
   def visit_x_string_node(node); end
 
   # yield
@@ -33009,7 +33009,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # yield 1
   # ^^^^^^^
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1902
+  # source://prism/lib/prism/translation/parser/compiler.rb#1902
   def visit_yield_node(node); end
 
   private
@@ -33017,25 +33017,25 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # The parser gem automatically converts \r\n to \n, meaning our offsets
   # need to be adjusted to always subtract 1 from the length.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#2045
+  # source://prism/lib/prism/translation/parser/compiler.rb#2045
   def chomped_bytesize(line); end
 
   # Initialize a new compiler with the given option overrides, used to
   # visit a subtree with the given options.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1916
+  # source://prism/lib/prism/translation/parser/compiler.rb#1916
   def copy_compiler(forwarding: T.unsafe(nil), in_destructure: T.unsafe(nil), in_pattern: T.unsafe(nil)); end
 
   # When *, **, &, or ... are used as an argument in a method call, we
   # check if they were allowed by the current context. To determine that
   # we build this lookup table.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1923
+  # source://prism/lib/prism/translation/parser/compiler.rb#1923
   def find_forwarding(node); end
 
   # Returns the set of targets for a MultiTargetNode or a MultiWriteNode.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1936
+  # source://prism/lib/prism/translation/parser/compiler.rb#1936
   def multi_target_elements(node); end
 
   # Negate the value of a numeric node. This is a special case where you
@@ -33044,7 +33044,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # however, marks this as a numeric literal. We have to massage the tree
   # here to get it into the correct form.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1948
+  # source://prism/lib/prism/translation/parser/compiler.rb#1948
   def numeric_negate(message_loc, receiver); end
 
   # Blocks can have a special set of parameters that automatically expand
@@ -33053,12 +33053,12 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1962
+  # source://prism/lib/prism/translation/parser/compiler.rb#1962
   def procarg0?(parameters); end
 
   # Constructs a new source range from the given start and end offsets.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1979
+  # source://prism/lib/prism/translation/parser/compiler.rb#1979
   def srange(location); end
 
   # Constructs a new source range by finding the given tokens between the
@@ -33068,109 +33068,109 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler
   # Note that end_offset is allowed to be nil, in which case this will
   # search until the end of the string.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1994
+  # source://prism/lib/prism/translation/parser/compiler.rb#1994
   def srange_find(start_offset, end_offset, tokens); end
 
   # Constructs a new source range from the given start and end offsets.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#1984
+  # source://prism/lib/prism/translation/parser/compiler.rb#1984
   def srange_offsets(start_offset, end_offset); end
 
   # Transform a location into a token that the parser gem expects.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#2004
+  # source://prism/lib/prism/translation/parser/compiler.rb#2004
   def token(location); end
 
   # Visit a block node on a call.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#2009
+  # source://prism/lib/prism/translation/parser/compiler.rb#2009
   def visit_block(call, block); end
 
   # Visit a heredoc that can be either a string or an xstring.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#2051
+  # source://prism/lib/prism/translation/parser/compiler.rb#2051
   def visit_heredoc(node); end
 
   # Visit a numeric node and account for the optional sign.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#2123
+  # source://prism/lib/prism/translation/parser/compiler.rb#2123
   def visit_numeric(node, value); end
 
   # Within the given block, track that we're within a pattern.
   #
-  # source://prism//lib/prism/translation/parser/compiler.rb#2135
+  # source://prism/lib/prism/translation/parser/compiler.rb#2135
   def within_pattern; end
 end
 
 # Raised when the tree is malformed or there is a bug in the compiler.
 #
-# source://prism//lib/prism/translation/parser/compiler.rb#10
+# source://prism/lib/prism/translation/parser/compiler.rb#10
 class Prism::Translation::Parser::Compiler::CompilationError < ::StandardError; end
 
 # Locations in the parser gem AST are generated using this class. We
 # store a reference to its constant to make it slightly faster to look
 # up.
 #
-# source://prism//lib/prism/translation/parser/compiler.rb#1976
+# source://prism/lib/prism/translation/parser/compiler.rb#1976
 Prism::Translation::Parser::Compiler::Range = Parser::Source::Range
 
-# source://prism//lib/prism/translation/parser.rb#17
+# source://prism/lib/prism/translation/parser.rb#17
 Prism::Translation::Parser::Diagnostic = Parser::Diagnostic
 
 # Accepts a list of prism tokens and converts them into the expected
 # format for the parser gem.
 #
-# source://prism//lib/prism/translation/parser/lexer.rb#8
+# source://prism/lib/prism/translation/parser/lexer.rb#8
 class Prism::Translation::Parser::Lexer
   # Initialize the lexer with the given source buffer, prism tokens, and
   # offset cache.
   #
   # @return [Lexer] a new instance of Lexer
   #
-  # source://prism//lib/prism/translation/parser/lexer.rb#217
+  # source://prism/lib/prism/translation/parser/lexer.rb#217
   def initialize(source_buffer, lexed, offset_cache); end
 
   # An array of tuples that contain prism tokens and their associated lex
   # state when they were lexed.
   #
-  # source://prism//lib/prism/translation/parser/lexer.rb#210
+  # source://prism/lib/prism/translation/parser/lexer.rb#210
   def lexed; end
 
   # A hash that maps offsets in bytes to offsets in characters.
   #
-  # source://prism//lib/prism/translation/parser/lexer.rb#213
+  # source://prism/lib/prism/translation/parser/lexer.rb#213
   def offset_cache; end
 
   # The Parser::Source::Buffer that the tokens were lexed from.
   #
-  # source://prism//lib/prism/translation/parser/lexer.rb#206
+  # source://prism/lib/prism/translation/parser/lexer.rb#206
   def source_buffer; end
 
   # Convert the prism tokens into the expected format for the parser gem.
   #
-  # source://prism//lib/prism/translation/parser/lexer.rb#227
+  # source://prism/lib/prism/translation/parser/lexer.rb#227
   def to_a; end
 
   private
 
   # Parse a complex from the string representation.
   #
-  # source://prism//lib/prism/translation/parser/lexer.rb#409
+  # source://prism/lib/prism/translation/parser/lexer.rb#409
   def parse_complex(value); end
 
   # Parse a float from the string representation.
   #
-  # source://prism//lib/prism/translation/parser/lexer.rb#402
+  # source://prism/lib/prism/translation/parser/lexer.rb#402
   def parse_float(value); end
 
   # Parse an integer from the string representation.
   #
-  # source://prism//lib/prism/translation/parser/lexer.rb#395
+  # source://prism/lib/prism/translation/parser/lexer.rb#395
   def parse_integer(value); end
 
   # Parse a rational from the string representation.
   #
-  # source://prism//lib/prism/translation/parser/lexer.rb#424
+  # source://prism/lib/prism/translation/parser/lexer.rb#424
   def parse_rational(value); end
 end
 
@@ -33182,10 +33182,10 @@ end
 # meantime we'll hide them from the documentation and mark them as
 # private constants.
 #
-# source://prism//lib/prism/translation/parser/lexer.rb#187
+# source://prism/lib/prism/translation/parser/lexer.rb#187
 Prism::Translation::Parser::Lexer::EXPR_BEG = T.let(T.unsafe(nil), Integer)
 
-# source://prism//lib/prism/translation/parser/lexer.rb#188
+# source://prism/lib/prism/translation/parser/lexer.rb#188
 Prism::Translation::Parser::Lexer::EXPR_LABEL = T.let(T.unsafe(nil), Integer)
 
 # It is used to determine whether `do` is of the token type `kDO` or `kDO_LAMBDA`.
@@ -33193,43 +33193,43 @@ Prism::Translation::Parser::Lexer::EXPR_LABEL = T.let(T.unsafe(nil), Integer)
 # NOTE: In edge cases like `-> (foo = -> (bar) {}) do end`, please note that `kDO` is still returned
 # instead of `kDO_LAMBDA`, which is expected: https://github.com/ruby/prism/pull/3046
 #
-# source://prism//lib/prism/translation/parser/lexer.rb#194
+# source://prism/lib/prism/translation/parser/lexer.rb#194
 Prism::Translation::Parser::Lexer::LAMBDA_TOKEN_TYPES = T.let(T.unsafe(nil), Array)
 
 # The `PARENTHESIS_LEFT` token in Prism is classified as either `tLPAREN` or `tLPAREN2` in the Parser gem.
 # The following token types are listed as those classified as `tLPAREN`.
 #
-# source://prism//lib/prism/translation/parser/lexer.rb#198
+# source://prism/lib/prism/translation/parser/lexer.rb#198
 Prism::Translation::Parser::Lexer::LPAREN_CONVERSION_TOKEN_TYPES = T.let(T.unsafe(nil), Array)
 
-# source://prism//lib/prism/translation/parser/lexer.rb#223
+# source://prism/lib/prism/translation/parser/lexer.rb#223
 Prism::Translation::Parser::Lexer::Range = Parser::Source::Range
 
 # The direct translating of types between the two lexers.
 #
-# source://prism//lib/prism/translation/parser/lexer.rb#10
+# source://prism/lib/prism/translation/parser/lexer.rb#10
 Prism::Translation::Parser::Lexer::TYPES = T.let(T.unsafe(nil), Hash)
 
 # The parser gem has a list of diagnostics with a hard-coded set of error
 # messages. We create our own diagnostic class in order to set our own
 # error messages.
 #
-# source://prism//lib/prism/translation/parser.rb#23
+# source://prism/lib/prism/translation/parser.rb#23
 class Prism::Translation::Parser::PrismDiagnostic < ::Parser::Diagnostic
   # Initialize a new diagnostic with the given message and location.
   #
   # @return [PrismDiagnostic] a new instance of PrismDiagnostic
   #
-  # source://prism//lib/prism/translation/parser.rb#28
+  # source://prism/lib/prism/translation/parser.rb#28
   def initialize(message, level, reason, location); end
 
   # This is the cached message coming from prism.
   #
-  # source://prism//lib/prism/translation/parser.rb#25
+  # source://prism/lib/prism/translation/parser.rb#25
   def message; end
 end
 
-# source://prism//lib/prism/translation/parser.rb#34
+# source://prism/lib/prism/translation/parser.rb#34
 Prism::Translation::Parser::Racc_debug_parser = T.let(T.unsafe(nil), FalseClass)
 
 # This class provides a compatibility layer between prism and Ripper. It
@@ -33268,95 +33268,95 @@ Prism::Translation::Parser::Racc_debug_parser = T.let(T.unsafe(nil), FalseClass)
 # - on_tstring_beg
 # - on_tstring_end
 #
-# source://prism//lib/prism/translation/ripper.rb#43
+# source://prism/lib/prism/translation/ripper.rb#43
 class Prism::Translation::Ripper < ::Prism::Compiler
   # Create a new Translation::Ripper object with the given source.
   #
   # @return [Ripper] a new instance of Ripper
   #
-  # source://prism//lib/prism/translation/ripper.rb#444
+  # source://prism/lib/prism/translation/ripper.rb#444
   def initialize(source, filename = T.unsafe(nil), lineno = T.unsafe(nil)); end
 
   # The current column number of the parser.
   #
-  # source://prism//lib/prism/translation/ripper.rb#441
+  # source://prism/lib/prism/translation/ripper.rb#441
   def column; end
 
   # True if the parser encountered an error during parsing.
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/translation/ripper.rb#457
+  # source://prism/lib/prism/translation/ripper.rb#457
   sig { returns(T::Boolean) }
   def error?; end
 
   # The filename of the source being parsed.
   #
-  # source://prism//lib/prism/translation/ripper.rb#435
+  # source://prism/lib/prism/translation/ripper.rb#435
   def filename; end
 
   # The current line number of the parser.
   #
-  # source://prism//lib/prism/translation/ripper.rb#438
+  # source://prism/lib/prism/translation/ripper.rb#438
   def lineno; end
 
   # Parse the source and return the result.
   #
-  # source://prism//lib/prism/translation/ripper.rb#462
+  # source://prism/lib/prism/translation/ripper.rb#462
   sig { returns(T.untyped) }
   def parse; end
 
   # The source that is being parsed.
   #
-  # source://prism//lib/prism/translation/ripper.rb#432
+  # source://prism/lib/prism/translation/ripper.rb#432
   def source; end
 
   # alias $foo $bar
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#561
+  # source://prism/lib/prism/translation/ripper.rb#561
   def visit_alias_global_variable_node(node); end
 
   # alias foo bar
   # ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#551
+  # source://prism/lib/prism/translation/ripper.rb#551
   def visit_alias_method_node(node); end
 
   # foo => bar | baz
   #        ^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#585
+  # source://prism/lib/prism/translation/ripper.rb#585
   def visit_alternation_pattern_node(node); end
 
   # a and b
   # ^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#605
+  # source://prism/lib/prism/translation/ripper.rb#605
   def visit_and_node(node); end
 
   # foo(bar)
   #     ^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#796
+  # source://prism/lib/prism/translation/ripper.rb#796
   def visit_arguments_node(node); end
 
   # []
   # ^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#615
+  # source://prism/lib/prism/translation/ripper.rb#615
   def visit_array_node(node); end
 
   # foo => [bar]
   #        ^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#775
+  # source://prism/lib/prism/translation/ripper.rb#775
   def visit_array_pattern_node(node); end
 
   # { a: 1 }
   #   ^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#803
+  # source://prism/lib/prism/translation/ripper.rb#803
   def visit_assoc_node(node); end
 
   # def foo(**); bar(**); end
@@ -33365,47 +33365,47 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # { **foo }
   #   ^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#816
+  # source://prism/lib/prism/translation/ripper.rb#816
   def visit_assoc_splat_node(node); end
 
   # $+
   # ^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#825
+  # source://prism/lib/prism/translation/ripper.rb#825
   def visit_back_reference_read_node(node); end
 
   # begin end
   # ^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#832
+  # source://prism/lib/prism/translation/ripper.rb#832
   def visit_begin_node(node); end
 
   # foo(&bar)
   #     ^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#896
+  # source://prism/lib/prism/translation/ripper.rb#896
   def visit_block_argument_node(node); end
 
   # foo { |; bar| }
   #          ^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#902
+  # source://prism/lib/prism/translation/ripper.rb#902
   def visit_block_local_variable_node(node); end
 
   # Visit a BlockNode.
   #
-  # source://prism//lib/prism/translation/ripper.rb#908
+  # source://prism/lib/prism/translation/ripper.rb#908
   def visit_block_node(node); end
 
   # def foo(&bar); end
   #         ^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#944
+  # source://prism/lib/prism/translation/ripper.rb#944
   def visit_block_parameter_node(node); end
 
   # A block's parameters.
   #
-  # source://prism//lib/prism/translation/ripper.rb#958
+  # source://prism/lib/prism/translation/ripper.rb#958
   def visit_block_parameters_node(node); end
 
   # break
@@ -33414,13 +33414,13 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # break foo
   # ^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#982
+  # source://prism/lib/prism/translation/ripper.rb#982
   def visit_break_node(node); end
 
   # foo.bar &&= baz
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1194
+  # source://prism/lib/prism/translation/ripper.rb#1194
   def visit_call_and_write_node(node); end
 
   # foo
@@ -33432,79 +33432,79 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # foo.bar() {}
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1002
+  # source://prism/lib/prism/translation/ripper.rb#1002
   def visit_call_node(node); end
 
   # foo.bar += baz
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1172
+  # source://prism/lib/prism/translation/ripper.rb#1172
   def visit_call_operator_write_node(node); end
 
   # foo.bar ||= baz
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1216
+  # source://prism/lib/prism/translation/ripper.rb#1216
   def visit_call_or_write_node(node); end
 
   # foo.bar, = 1
   # ^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1238
+  # source://prism/lib/prism/translation/ripper.rb#1238
   def visit_call_target_node(node); end
 
   # foo => bar => baz
   #        ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1263
+  # source://prism/lib/prism/translation/ripper.rb#1263
   def visit_capture_pattern_node(node); end
 
   # case foo; in bar; end
   # ^^^^^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1286
+  # source://prism/lib/prism/translation/ripper.rb#1286
   def visit_case_match_node(node); end
 
   # case foo; when bar; end
   # ^^^^^^^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1273
+  # source://prism/lib/prism/translation/ripper.rb#1273
   def visit_case_node(node); end
 
   # class Foo; end
   # ^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1299
+  # source://prism/lib/prism/translation/ripper.rb#1299
   def visit_class_node(node); end
 
   # @@foo &&= bar
   # ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1352
+  # source://prism/lib/prism/translation/ripper.rb#1352
   def visit_class_variable_and_write_node(node); end
 
   # @@foo += bar
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1338
+  # source://prism/lib/prism/translation/ripper.rb#1338
   def visit_class_variable_operator_write_node(node); end
 
   # @@foo ||= bar
   # ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1366
+  # source://prism/lib/prism/translation/ripper.rb#1366
   def visit_class_variable_or_write_node(node); end
 
   # @@foo
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1317
+  # source://prism/lib/prism/translation/ripper.rb#1317
   def visit_class_variable_read_node(node); end
 
   # @@foo, = bar
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1380
+  # source://prism/lib/prism/translation/ripper.rb#1380
   def visit_class_variable_target_node(node); end
 
   # @@foo = 1
@@ -33513,55 +33513,55 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # @@foo, @@bar = 1
   # ^^^^^  ^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1327
+  # source://prism/lib/prism/translation/ripper.rb#1327
   def visit_class_variable_write_node(node); end
 
   # Foo &&= bar
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1422
+  # source://prism/lib/prism/translation/ripper.rb#1422
   def visit_constant_and_write_node(node); end
 
   # Foo += bar
   # ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1408
+  # source://prism/lib/prism/translation/ripper.rb#1408
   def visit_constant_operator_write_node(node); end
 
   # Foo ||= bar
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1436
+  # source://prism/lib/prism/translation/ripper.rb#1436
   def visit_constant_or_write_node(node); end
 
   # Foo::Bar &&= baz
   # ^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1523
+  # source://prism/lib/prism/translation/ripper.rb#1523
   def visit_constant_path_and_write_node(node); end
 
   # Foo::Bar
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1457
+  # source://prism/lib/prism/translation/ripper.rb#1457
   def visit_constant_path_node(node); end
 
   # Foo::Bar += baz
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1509
+  # source://prism/lib/prism/translation/ripper.rb#1509
   def visit_constant_path_operator_write_node(node); end
 
   # Foo::Bar ||= baz
   # ^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1537
+  # source://prism/lib/prism/translation/ripper.rb#1537
   def visit_constant_path_or_write_node(node); end
 
   # Foo::Bar, = baz
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1551
+  # source://prism/lib/prism/translation/ripper.rb#1551
   def visit_constant_path_target_node(node); end
 
   # Foo::Bar = 1
@@ -33570,19 +33570,19 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # Foo::Foo, Bar::Bar = 1
   # ^^^^^^^^  ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1480
+  # source://prism/lib/prism/translation/ripper.rb#1480
   def visit_constant_path_write_node(node); end
 
   # Foo
   # ^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1387
+  # source://prism/lib/prism/translation/ripper.rb#1387
   def visit_constant_read_node(node); end
 
   # Foo, = bar
   # ^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1450
+  # source://prism/lib/prism/translation/ripper.rb#1450
   def visit_constant_target_node(node); end
 
   # Foo = 1
@@ -33591,7 +33591,7 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # Foo, Bar = 1
   # ^^^  ^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1397
+  # source://prism/lib/prism/translation/ripper.rb#1397
   def visit_constant_write_node(node); end
 
   # def foo; end
@@ -33600,7 +33600,7 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # def self.foo; end
   # ^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1560
+  # source://prism/lib/prism/translation/ripper.rb#1560
   def visit_def_node(node); end
 
   # defined? a
@@ -33609,72 +33609,72 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # defined?(a)
   # ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1607
+  # source://prism/lib/prism/translation/ripper.rb#1607
   def visit_defined_node(node); end
 
   # if foo then bar else baz end
   #                 ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1614
+  # source://prism/lib/prism/translation/ripper.rb#1614
   def visit_else_node(node); end
 
   # "foo #{bar}"
   #      ^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1630
+  # source://prism/lib/prism/translation/ripper.rb#1630
   def visit_embedded_statements_node(node); end
 
   # "foo #@bar"
   #      ^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1651
+  # source://prism/lib/prism/translation/ripper.rb#1651
   def visit_embedded_variable_node(node); end
 
   # Visit an EnsureNode node.
   #
-  # source://prism//lib/prism/translation/ripper.rb#1662
+  # source://prism/lib/prism/translation/ripper.rb#1662
   def visit_ensure_node(node); end
 
   # false
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1680
+  # source://prism/lib/prism/translation/ripper.rb#1680
   def visit_false_node(node); end
 
   # foo => [*, bar, *]
   #        ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1687
+  # source://prism/lib/prism/translation/ripper.rb#1687
   def visit_find_pattern_node(node); end
 
   # if foo .. bar; end
   #    ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1712
+  # source://prism/lib/prism/translation/ripper.rb#1712
   def visit_flip_flop_node(node); end
 
   # 1.0
   # ^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1726
+  # source://prism/lib/prism/translation/ripper.rb#1726
   def visit_float_node(node); end
 
   # for foo in bar do end
   # ^^^^^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1732
+  # source://prism/lib/prism/translation/ripper.rb#1732
   def visit_for_node(node); end
 
   # def foo(...); bar(...); end
   #                   ^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1749
+  # source://prism/lib/prism/translation/ripper.rb#1749
   def visit_forwarding_arguments_node(node); end
 
   # def foo(...); end
   #         ^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1756
+  # source://prism/lib/prism/translation/ripper.rb#1756
   def visit_forwarding_parameter_node(node); end
 
   # super
@@ -33683,37 +33683,37 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # super {}
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1766
+  # source://prism/lib/prism/translation/ripper.rb#1766
   def visit_forwarding_super_node(node); end
 
   # $foo &&= bar
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1815
+  # source://prism/lib/prism/translation/ripper.rb#1815
   def visit_global_variable_and_write_node(node); end
 
   # $foo += bar
   # ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1801
+  # source://prism/lib/prism/translation/ripper.rb#1801
   def visit_global_variable_operator_write_node(node); end
 
   # $foo ||= bar
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1829
+  # source://prism/lib/prism/translation/ripper.rb#1829
   def visit_global_variable_or_write_node(node); end
 
   # $foo
   # ^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1780
+  # source://prism/lib/prism/translation/ripper.rb#1780
   def visit_global_variable_read_node(node); end
 
   # $foo, = bar
   # ^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1843
+  # source://prism/lib/prism/translation/ripper.rb#1843
   def visit_global_variable_target_node(node); end
 
   # $foo = 1
@@ -33722,19 +33722,19 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # $foo, $bar = 1
   # ^^^^  ^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1790
+  # source://prism/lib/prism/translation/ripper.rb#1790
   def visit_global_variable_write_node(node); end
 
   # {}
   # ^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1850
+  # source://prism/lib/prism/translation/ripper.rb#1850
   def visit_hash_node(node); end
 
   # foo => {}
   #        ^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1865
+  # source://prism/lib/prism/translation/ripper.rb#1865
   def visit_hash_pattern_node(node); end
 
   # if foo then bar end
@@ -33746,140 +33746,140 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # foo ? bar : baz
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1907
+  # source://prism/lib/prism/translation/ripper.rb#1907
   def visit_if_node(node); end
 
   # 1i
   # ^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1943
+  # source://prism/lib/prism/translation/ripper.rb#1943
   def visit_imaginary_node(node); end
 
   # { foo: }
   #   ^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1949
+  # source://prism/lib/prism/translation/ripper.rb#1949
   def visit_implicit_node(node); end
 
   # foo { |bar,| }
   #           ^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1954
+  # source://prism/lib/prism/translation/ripper.rb#1954
   def visit_implicit_rest_node(node); end
 
   # case foo; in bar; end
   # ^^^^^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1961
+  # source://prism/lib/prism/translation/ripper.rb#1961
   def visit_in_node(node); end
 
   # foo[bar] &&= baz
   # ^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1996
+  # source://prism/lib/prism/translation/ripper.rb#1996
   def visit_index_and_write_node(node); end
 
   # foo[bar] += baz
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#1979
+  # source://prism/lib/prism/translation/ripper.rb#1979
   def visit_index_operator_write_node(node); end
 
   # foo[bar] ||= baz
   # ^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2013
+  # source://prism/lib/prism/translation/ripper.rb#2013
   def visit_index_or_write_node(node); end
 
   # foo[bar], = 1
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2030
+  # source://prism/lib/prism/translation/ripper.rb#2030
   def visit_index_target_node(node); end
 
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2072
+  # source://prism/lib/prism/translation/ripper.rb#2072
   def visit_instance_variable_and_write_node(node); end
 
   # ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2058
+  # source://prism/lib/prism/translation/ripper.rb#2058
   def visit_instance_variable_operator_write_node(node); end
 
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2086
+  # source://prism/lib/prism/translation/ripper.rb#2086
   def visit_instance_variable_or_write_node(node); end
 
   # ^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2040
+  # source://prism/lib/prism/translation/ripper.rb#2040
   def visit_instance_variable_read_node(node); end
 
   # @foo, = bar
   # ^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2100
+  # source://prism/lib/prism/translation/ripper.rb#2100
   def visit_instance_variable_target_node(node); end
 
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2047
+  # source://prism/lib/prism/translation/ripper.rb#2047
   def visit_instance_variable_write_node(node); end
 
   # 1
   # ^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2107
+  # source://prism/lib/prism/translation/ripper.rb#2107
   def visit_integer_node(node); end
 
   # if /foo #{bar}/ then end
   #    ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2113
+  # source://prism/lib/prism/translation/ripper.rb#2113
   def visit_interpolated_match_last_line_node(node); end
 
   # /foo #{bar}/
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2132
+  # source://prism/lib/prism/translation/ripper.rb#2132
   def visit_interpolated_regular_expression_node(node); end
 
   # "foo #{bar}"
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2151
+  # source://prism/lib/prism/translation/ripper.rb#2151
   def visit_interpolated_string_node(node); end
 
   # :"foo #{bar}"
   # ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2179
+  # source://prism/lib/prism/translation/ripper.rb#2179
   def visit_interpolated_symbol_node(node); end
 
   # `foo #{bar}`
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2192
+  # source://prism/lib/prism/translation/ripper.rb#2192
   def visit_interpolated_x_string_node(node); end
 
   # -> { it }
   #      ^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2222
+  # source://prism/lib/prism/translation/ripper.rb#2222
   def visit_it_local_variable_read_node(node); end
 
   # -> { it }
   # ^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2229
+  # source://prism/lib/prism/translation/ripper.rb#2229
   def visit_it_parameters_node(node); end
 
   # foo(bar: baz)
   #     ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2234
+  # source://prism/lib/prism/translation/ripper.rb#2234
   def visit_keyword_hash_node(node); end
 
   # def foo(**bar); end
@@ -33888,96 +33888,96 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # def foo(**); end
   #         ^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2246
+  # source://prism/lib/prism/translation/ripper.rb#2246
   def visit_keyword_rest_parameter_node(node); end
 
   # -> {}
   #
-  # source://prism//lib/prism/translation/ripper.rb#2260
+  # source://prism/lib/prism/translation/ripper.rb#2260
   def visit_lambda_node(node); end
 
   # foo &&= bar
   # ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2352
+  # source://prism/lib/prism/translation/ripper.rb#2352
   def visit_local_variable_and_write_node(node); end
 
   # foo += bar
   # ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2338
+  # source://prism/lib/prism/translation/ripper.rb#2338
   def visit_local_variable_operator_write_node(node); end
 
   # foo ||= bar
   # ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2366
+  # source://prism/lib/prism/translation/ripper.rb#2366
   def visit_local_variable_or_write_node(node); end
 
   # foo
   # ^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2320
+  # source://prism/lib/prism/translation/ripper.rb#2320
   def visit_local_variable_read_node(node); end
 
   # foo, = bar
   # ^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2380
+  # source://prism/lib/prism/translation/ripper.rb#2380
   def visit_local_variable_target_node(node); end
 
   # foo = 1
   # ^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2327
+  # source://prism/lib/prism/translation/ripper.rb#2327
   def visit_local_variable_write_node(node); end
 
   # if /foo/ then end
   #    ^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2387
+  # source://prism/lib/prism/translation/ripper.rb#2387
   def visit_match_last_line_node(node); end
 
   # foo in bar
   # ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2402
+  # source://prism/lib/prism/translation/ripper.rb#2402
   def visit_match_predicate_node(node); end
 
   # foo => bar
   # ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2411
+  # source://prism/lib/prism/translation/ripper.rb#2411
   def visit_match_required_node(node); end
 
   # /(?<foo>foo)/ =~ bar
   # ^^^^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2420
+  # source://prism/lib/prism/translation/ripper.rb#2420
   def visit_match_write_node(node); end
 
   # A node that is missing from the syntax tree. This is only used in the
   # case of a syntax error.
   #
-  # source://prism//lib/prism/translation/ripper.rb#2426
+  # source://prism/lib/prism/translation/ripper.rb#2426
   def visit_missing_node(node); end
 
   # module Foo; end
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2432
+  # source://prism/lib/prism/translation/ripper.rb#2432
   def visit_module_node(node); end
 
   # (foo, bar), bar = qux
   # ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2449
+  # source://prism/lib/prism/translation/ripper.rb#2449
   def visit_multi_target_node(node); end
 
   # foo, bar = baz
   # ^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2503
+  # source://prism/lib/prism/translation/ripper.rb#2503
   def visit_multi_write_node(node); end
 
   # next
@@ -33986,55 +33986,55 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # next foo
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2523
+  # source://prism/lib/prism/translation/ripper.rb#2523
   def visit_next_node(node); end
 
   # nil
   # ^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2537
+  # source://prism/lib/prism/translation/ripper.rb#2537
   def visit_nil_node(node); end
 
   # def foo(**nil); end
   #         ^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2544
+  # source://prism/lib/prism/translation/ripper.rb#2544
   def visit_no_keywords_parameter_node(node); end
 
   # -> { _1 + _2 }
   # ^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2553
+  # source://prism/lib/prism/translation/ripper.rb#2553
   def visit_numbered_parameters_node(node); end
 
   # $1
   # ^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2558
+  # source://prism/lib/prism/translation/ripper.rb#2558
   def visit_numbered_reference_read_node(node); end
 
   # def foo(bar: baz); end
   #         ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2565
+  # source://prism/lib/prism/translation/ripper.rb#2565
   def visit_optional_keyword_parameter_node(node); end
 
   # def foo(bar = 1); end
   #         ^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2575
+  # source://prism/lib/prism/translation/ripper.rb#2575
   def visit_optional_parameter_node(node); end
 
   # a or b
   # ^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2585
+  # source://prism/lib/prism/translation/ripper.rb#2585
   def visit_or_node(node); end
 
   # def foo(bar, *baz); end
   #         ^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2595
+  # source://prism/lib/prism/translation/ripper.rb#2595
   def visit_parameters_node(node); end
 
   # ()
@@ -34043,84 +34043,84 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # (1)
   # ^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2622
+  # source://prism/lib/prism/translation/ripper.rb#2622
   def visit_parentheses_node(node); end
 
   # foo => ^(bar)
   #        ^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2636
+  # source://prism/lib/prism/translation/ripper.rb#2636
   def visit_pinned_expression_node(node); end
 
   # foo = 1 and bar => ^foo
   #                    ^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2645
+  # source://prism/lib/prism/translation/ripper.rb#2645
   def visit_pinned_variable_node(node); end
 
   # END {}
   # ^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2651
+  # source://prism/lib/prism/translation/ripper.rb#2651
   def visit_post_execution_node(node); end
 
   # BEGIN {}
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2666
+  # source://prism/lib/prism/translation/ripper.rb#2666
   def visit_pre_execution_node(node); end
 
   # The top-level program node.
   #
-  # source://prism//lib/prism/translation/ripper.rb#2680
+  # source://prism/lib/prism/translation/ripper.rb#2680
   def visit_program_node(node); end
 
   # 0..5
   # ^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2691
+  # source://prism/lib/prism/translation/ripper.rb#2691
   def visit_range_node(node); end
 
   # 1r
   # ^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2705
+  # source://prism/lib/prism/translation/ripper.rb#2705
   def visit_rational_node(node); end
 
   # redo
   # ^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2711
+  # source://prism/lib/prism/translation/ripper.rb#2711
   def visit_redo_node(node); end
 
   # /foo/
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2718
+  # source://prism/lib/prism/translation/ripper.rb#2718
   def visit_regular_expression_node(node); end
 
   # def foo(bar:); end
   #         ^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2740
+  # source://prism/lib/prism/translation/ripper.rb#2740
   def visit_required_keyword_parameter_node(node); end
 
   # def foo(bar); end
   #         ^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2747
+  # source://prism/lib/prism/translation/ripper.rb#2747
   def visit_required_parameter_node(node); end
 
   # foo rescue bar
   # ^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2754
+  # source://prism/lib/prism/translation/ripper.rb#2754
   def visit_rescue_modifier_node(node); end
 
   # begin; rescue; end
   #        ^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2764
+  # source://prism/lib/prism/translation/ripper.rb#2764
   def visit_rescue_node(node); end
 
   # def foo(*bar); end
@@ -34129,13 +34129,13 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # def foo(*); end
   #         ^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2822
+  # source://prism/lib/prism/translation/ripper.rb#2822
   def visit_rest_parameter_node(node); end
 
   # retry
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2834
+  # source://prism/lib/prism/translation/ripper.rb#2834
   def visit_retry_node(node); end
 
   # return
@@ -34144,42 +34144,42 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # return 1
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2844
+  # source://prism/lib/prism/translation/ripper.rb#2844
   def visit_return_node(node); end
 
   # self
   # ^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2858
+  # source://prism/lib/prism/translation/ripper.rb#2858
   def visit_self_node(node); end
 
   # A shareable constant.
   #
-  # source://prism//lib/prism/translation/ripper.rb#2864
+  # source://prism/lib/prism/translation/ripper.rb#2864
   def visit_shareable_constant_node(node); end
 
   # class << self; end
   # ^^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2870
+  # source://prism/lib/prism/translation/ripper.rb#2870
   def visit_singleton_class_node(node); end
 
   # __ENCODING__
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2880
+  # source://prism/lib/prism/translation/ripper.rb#2880
   def visit_source_encoding_node(node); end
 
   # __FILE__
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2887
+  # source://prism/lib/prism/translation/ripper.rb#2887
   def visit_source_file_node(node); end
 
   # __LINE__
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2894
+  # source://prism/lib/prism/translation/ripper.rb#2894
   def visit_source_line_node(node); end
 
   # foo(*bar)
@@ -34191,42 +34191,42 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # def foo(*); bar(*); end
   #                 ^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2907
+  # source://prism/lib/prism/translation/ripper.rb#2907
   def visit_splat_node(node); end
 
   # A list of statements.
   #
-  # source://prism//lib/prism/translation/ripper.rb#2912
+  # source://prism/lib/prism/translation/ripper.rb#2912
   def visit_statements_node(node); end
 
   # "foo"
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#2929
+  # source://prism/lib/prism/translation/ripper.rb#2929
   def visit_string_node(node); end
 
   # super(foo)
   # ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#3061
+  # source://prism/lib/prism/translation/ripper.rb#3061
   def visit_super_node(node); end
 
   # :foo
   # ^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#3082
+  # source://prism/lib/prism/translation/ripper.rb#3082
   def visit_symbol_node(node); end
 
   # true
   # ^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#3106
+  # source://prism/lib/prism/translation/ripper.rb#3106
   def visit_true_node(node); end
 
   # undef foo
   # ^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#3113
+  # source://prism/lib/prism/translation/ripper.rb#3113
   def visit_undef_node(node); end
 
   # unless foo; bar end
@@ -34235,7 +34235,7 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # bar unless foo
   # ^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#3125
+  # source://prism/lib/prism/translation/ripper.rb#3125
   def visit_unless_node(node); end
 
   # until foo; bar end
@@ -34244,13 +34244,13 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # bar until foo
   # ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#3153
+  # source://prism/lib/prism/translation/ripper.rb#3153
   def visit_until_node(node); end
 
   # case foo; when bar; end
   #           ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#3177
+  # source://prism/lib/prism/translation/ripper.rb#3177
   def visit_when_node(node); end
 
   # while foo; bar end
@@ -34259,13 +34259,13 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # bar while foo
   # ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#3198
+  # source://prism/lib/prism/translation/ripper.rb#3198
   def visit_while_node(node); end
 
   # `foo`
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#3222
+  # source://prism/lib/prism/translation/ripper.rb#3222
   def visit_x_string_node(node); end
 
   # yield
@@ -34274,32 +34274,32 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # yield 1
   # ^^^^^^^
   #
-  # source://prism//lib/prism/translation/ripper.rb#3245
+  # source://prism/lib/prism/translation/ripper.rb#3245
   def visit_yield_node(node); end
 
   private
 
   # :stopdoc:
   #
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def _dispatch_0; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def _dispatch_1(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def _dispatch_2(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3388
+  # source://prism/lib/prism/translation/ripper.rb#3388
   def _dispatch_3(_, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3389
+  # source://prism/lib/prism/translation/ripper.rb#3389
   def _dispatch_4(_, _, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3390
+  # source://prism/lib/prism/translation/ripper.rb#3390
   def _dispatch_5(_, _, _, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3391
+  # source://prism/lib/prism/translation/ripper.rb#3391
   def _dispatch_7(_, _, _, _, _, _, _); end
 
   # This method is responsible for updating lineno and column information
@@ -34308,19 +34308,19 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # This method could be drastically improved with some caching on the start
   # of every line, but for now it's good enough.
   #
-  # source://prism//lib/prism/translation/ripper.rb#3375
+  # source://prism/lib/prism/translation/ripper.rb#3375
   def bounds(location); end
 
   # Returns true if the given node is a command node.
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/translation/ripper.rb#1163
+  # source://prism/lib/prism/translation/ripper.rb#1163
   def command?(node); end
 
   # This method is called when the parser found syntax error.
   #
-  # source://prism//lib/prism/translation/ripper.rb#3413
+  # source://prism/lib/prism/translation/ripper.rb#3413
   def compile_error(msg); end
 
   # This method is provided by the Ripper C extension. It is called when a
@@ -34328,631 +34328,631 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # that it will modify the string in place and return the number of bytes
   # that were removed.
   #
-  # source://prism//lib/prism/translation/ripper.rb#3428
+  # source://prism/lib/prism/translation/ripper.rb#3428
   def dedent_string(string, width); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_BEGIN(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_CHAR(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_END(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on___end__(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_alias(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_alias_error(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_aref(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_aref_field(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_arg_ambiguous(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_arg_paren(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_args_add(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_args_add_block(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_args_add_star(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_args_forward; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_args_new; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_array(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3389
+  # source://prism/lib/prism/translation/ripper.rb#3389
   def on_aryptn(_, _, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_assign(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_assign_error(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_assoc_new(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_assoc_splat(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_assoclist_from_args(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_backref(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_backtick(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_bare_assoc_hash(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_begin(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3388
+  # source://prism/lib/prism/translation/ripper.rb#3388
   def on_binary(_, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_block_var(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_blockarg(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3389
+  # source://prism/lib/prism/translation/ripper.rb#3389
   def on_bodystmt(_, _, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_brace_block(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_break(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3388
+  # source://prism/lib/prism/translation/ripper.rb#3388
   def on_call(_, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_case(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3388
+  # source://prism/lib/prism/translation/ripper.rb#3388
   def on_class(_, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_class_name_error(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_comma(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_command(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3389
+  # source://prism/lib/prism/translation/ripper.rb#3389
   def on_command_call(_, _, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_comment(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_const(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_const_path_field(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_const_path_ref(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_const_ref(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_cvar(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3388
+  # source://prism/lib/prism/translation/ripper.rb#3388
   def on_def(_, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_defined(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3390
+  # source://prism/lib/prism/translation/ripper.rb#3390
   def on_defs(_, _, _, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_do_block(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_dot2(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_dot3(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_dyna_symbol(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_else(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3388
+  # source://prism/lib/prism/translation/ripper.rb#3388
   def on_elsif(_, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_embdoc(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_embdoc_beg(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_embdoc_end(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_embexpr_beg(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_embexpr_end(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_embvar(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_ensure(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_excessed_comma; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_fcall(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3388
+  # source://prism/lib/prism/translation/ripper.rb#3388
   def on_field(_, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_float(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3389
+  # source://prism/lib/prism/translation/ripper.rb#3389
   def on_fndptn(_, _, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3388
+  # source://prism/lib/prism/translation/ripper.rb#3388
   def on_for(_, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_gvar(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_hash(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_heredoc_beg(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_heredoc_dedent(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_heredoc_end(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3388
+  # source://prism/lib/prism/translation/ripper.rb#3388
   def on_hshptn(_, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_ident(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3388
+  # source://prism/lib/prism/translation/ripper.rb#3388
   def on_if(_, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_if_mod(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3388
+  # source://prism/lib/prism/translation/ripper.rb#3388
   def on_ifop(_, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_ignored_nl(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_ignored_sp(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_imaginary(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3388
+  # source://prism/lib/prism/translation/ripper.rb#3388
   def on_in(_, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_int(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_ivar(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_kw(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_kwrest_param(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_label(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_label_end(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_lambda(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_lbrace(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_lbracket(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_lparen(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_magic_comment(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_massign(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_method_add_arg(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_method_add_block(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_mlhs_add(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_mlhs_add_post(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_mlhs_add_star(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_mlhs_new; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_mlhs_paren(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_module(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_mrhs_add(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_mrhs_add_star(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_mrhs_new; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_mrhs_new_from_args(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_next(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_nl(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_nokw_param(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_op(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3388
+  # source://prism/lib/prism/translation/ripper.rb#3388
   def on_opassign(_, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_operator_ambiguous(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_param_error(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3391
+  # source://prism/lib/prism/translation/ripper.rb#3391
   def on_params(_, _, _, _, _, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_paren(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_parse_error(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_period(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_program(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_qsymbols_add(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_qsymbols_beg(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_qsymbols_new; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_qwords_add(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_qwords_beg(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_qwords_new; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_rational(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_rbrace(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_rbracket(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_redo; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_regexp_add(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_regexp_beg(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_regexp_end(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_regexp_literal(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_regexp_new; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3389
+  # source://prism/lib/prism/translation/ripper.rb#3389
   def on_rescue(_, _, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_rescue_mod(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_rest_param(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_retry; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_return(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_return0; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_rparen(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_sclass(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_semicolon(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_sp(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_stmts_add(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_stmts_new; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_string_add(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_string_concat(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_string_content; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_string_dvar(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_string_embexpr(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_string_literal(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_super(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_symbeg(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_symbol(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_symbol_literal(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_symbols_add(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_symbols_beg(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_symbols_new; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_tlambda(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_tlambeg(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_top_const_field(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_top_const_ref(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_tstring_beg(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_tstring_content(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_tstring_end(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_unary(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_undef(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3388
+  # source://prism/lib/prism/translation/ripper.rb#3388
   def on_unless(_, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_unless_mod(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_until(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_until_mod(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_var_alias(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_var_field(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_var_ref(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_vcall(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_void_stmt; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3388
+  # source://prism/lib/prism/translation/ripper.rb#3388
   def on_when(_, _, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_while(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_while_mod(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_word_add(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_word_new; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_words_add(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_words_beg(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_words_new; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_words_sep(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3387
+  # source://prism/lib/prism/translation/ripper.rb#3387
   def on_xstring_add(_, _); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_xstring_literal(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_xstring_new; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3386
+  # source://prism/lib/prism/translation/ripper.rb#3386
   def on_yield(_); end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_yield0; end
 
-  # source://prism//lib/prism/translation/ripper.rb#3385
+  # source://prism/lib/prism/translation/ripper.rb#3385
   def on_zsuper; end
 
   # Lazily initialize the parse result.
   #
-  # source://prism//lib/prism/translation/ripper.rb#3271
+  # source://prism/lib/prism/translation/ripper.rb#3271
   def result; end
 
   # Returns true if there is a comma between the two locations.
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/translation/ripper.rb#3280
+  # source://prism/lib/prism/translation/ripper.rb#3280
   def trailing_comma?(left, right); end
 
   # Visit one side of an alias global variable node.
   #
-  # source://prism//lib/prism/translation/ripper.rb#570
+  # source://prism/lib/prism/translation/ripper.rb#570
   def visit_alias_global_variable_node_value(node); end
 
   # Visit a list of elements, like the elements of an array or arguments.
   #
-  # source://prism//lib/prism/translation/ripper.rb#756
+  # source://prism/lib/prism/translation/ripper.rb#756
   def visit_arguments(elements); end
 
   # Visit the clauses of a begin node to form an on_bodystmt call.
   #
-  # source://prism//lib/prism/translation/ripper.rb#840
+  # source://prism/lib/prism/translation/ripper.rb#840
   def visit_begin_node_clauses(location, node, allow_newline); end
 
   # Visit the body of a structure that can have either a set of statements
   # or statements wrapped in rescue/else/ensure.
   #
-  # source://prism//lib/prism/translation/ripper.rb#875
+  # source://prism/lib/prism/translation/ripper.rb#875
   def visit_body_node(location, node, allow_newline = T.unsafe(nil)); end
 
   # Visit the arguments and block of a call node and return the arguments
   # and block as they should be used.
   #
-  # source://prism//lib/prism/translation/ripper.rb#1136
+  # source://prism/lib/prism/translation/ripper.rb#1136
   def visit_call_node_arguments(arguments_node, block_node, trailing_comma); end
 
   # Visit a constant path that is part of a write node.
   #
-  # source://prism//lib/prism/translation/ripper.rb#1489
+  # source://prism/lib/prism/translation/ripper.rb#1489
   def visit_constant_path_write_node_target(node); end
 
   # Visit a destructured positional parameter node.
   #
-  # source://prism//lib/prism/translation/ripper.rb#2609
+  # source://prism/lib/prism/translation/ripper.rb#2609
   def visit_destructured_parameter_node(node); end
 
   # Visit a string that is expressed using a <<~ heredoc.
   #
-  # source://prism//lib/prism/translation/ripper.rb#2980
+  # source://prism/lib/prism/translation/ripper.rb#2980
   def visit_heredoc_node(parts, base); end
 
   # Ripper gives back the escaped string content but strips out the common
@@ -34961,34 +34961,34 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # work well together, so here we need to re-derive the common leading
   # whitespace.
   #
-  # source://prism//lib/prism/translation/ripper.rb#2955
+  # source://prism/lib/prism/translation/ripper.rb#2955
   def visit_heredoc_node_whitespace(parts); end
 
   # Visit a heredoc node that is representing a string.
   #
-  # source://prism//lib/prism/translation/ripper.rb#3026
+  # source://prism/lib/prism/translation/ripper.rb#3026
   def visit_heredoc_string_node(node); end
 
   # Visit a heredoc node that is representing an xstring.
   #
-  # source://prism//lib/prism/translation/ripper.rb#3043
+  # source://prism/lib/prism/translation/ripper.rb#3043
   def visit_heredoc_x_string_node(node); end
 
   # Visit the targets of a multi-target node.
   #
-  # source://prism//lib/prism/translation/ripper.rb#2462
+  # source://prism/lib/prism/translation/ripper.rb#2462
   def visit_multi_target_node_targets(lefts, rest, rights, skippable); end
 
   # Visit a node that represents a number. We need to explicitly handle the
   # unary - operator.
   #
-  # source://prism//lib/prism/translation/ripper.rb#3319
+  # source://prism/lib/prism/translation/ripper.rb#3319
   def visit_number_node(node); end
 
   # Visit a pattern within a pattern match. This is used to bypass the
   # parenthesis node that can be used to wrap patterns.
   #
-  # source://prism//lib/prism/translation/ripper.rb#595
+  # source://prism/lib/prism/translation/ripper.rb#595
   def visit_pattern_node(node); end
 
   # Visit the list of statements of a statements node. We support nil
@@ -34996,49 +34996,49 @@ class Prism::Translation::Ripper < ::Prism::Compiler
   # structure of the prism parse tree, but we manually add them here so that
   # we can mirror Ripper's void stmt.
   #
-  # source://prism//lib/prism/translation/ripper.rb#2921
+  # source://prism/lib/prism/translation/ripper.rb#2921
   def visit_statements_node_body(body); end
 
   # Visit an individual part of a string-like node.
   #
-  # source://prism//lib/prism/translation/ripper.rb#2211
+  # source://prism/lib/prism/translation/ripper.rb#2211
   def visit_string_content(part); end
 
   # Visit the string content of a particular node. This method is used to
   # split into the various token types.
   #
-  # source://prism//lib/prism/translation/ripper.rb#3292
+  # source://prism/lib/prism/translation/ripper.rb#3292
   def visit_token(token, allow_keywords = T.unsafe(nil)); end
 
   # Dispatch a words_sep event that contains the space between the elements
   # of list literals.
   #
-  # source://prism//lib/prism/translation/ripper.rb#745
+  # source://prism/lib/prism/translation/ripper.rb#745
   def visit_words_sep(opening_loc, previous, current); end
 
   # Visit a node that represents a write value. This is used to handle the
   # special case of an implicit array that is generated without brackets.
   #
-  # source://prism//lib/prism/translation/ripper.rb#3337
+  # source://prism/lib/prism/translation/ripper.rb#3337
   def visit_write_value(node); end
 
   # Returns true if there is a semicolon between the two locations.
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/translation/ripper.rb#3285
+  # source://prism/lib/prism/translation/ripper.rb#3285
   def void_stmt?(left, right, allow_newline); end
 
   # This method is called when weak warning is produced by the parser.
   # +fmt+ and +args+ is printf style.
   #
-  # source://prism//lib/prism/translation/ripper.rb#3404
+  # source://prism/lib/prism/translation/ripper.rb#3404
   def warn(fmt, *args); end
 
   # This method is called when strong warning is produced by the parser.
   # +fmt+ and +args+ is printf style.
   #
-  # source://prism//lib/prism/translation/ripper.rb#3409
+  # source://prism/lib/prism/translation/ripper.rb#3409
   def warning(fmt, *args); end
 
   class << self
@@ -35064,13 +35064,13 @@ class Prism::Translation::Ripper < ::Prism::Compiler
     #          [[1, 12], :on_sp,     " ",   END      ],
     #          [[1, 13], :on_kw,     "end", END      ]]
     #
-    # source://prism//lib/prism/translation/ripper.rb#72
+    # source://prism/lib/prism/translation/ripper.rb#72
     def lex(src, filename = T.unsafe(nil), lineno = T.unsafe(nil), raise_errors: T.unsafe(nil)); end
 
     # Parses the given Ruby program read from +src+.
     # +src+ must be a String or an IO or a object with a #gets method.
     #
-    # source://prism//lib/prism/translation/ripper.rb#46
+    # source://prism/lib/prism/translation/ripper.rb#46
     def parse(src, filename = T.unsafe(nil), lineno = T.unsafe(nil)); end
 
     # Parses +src+ and create S-exp tree.
@@ -35091,7 +35091,7 @@ class Prism::Translation::Ripper < ::Prism::Compiler
     #             [:paren, [:params, [[:@ident, "a", [1, 6]]], nil, nil, nil, nil, nil, nil]],
     #             [:bodystmt, [[:var_ref, [:@kw, "nil", [1, 9]]]], nil, nil, nil]]]]
     #
-    # source://prism//lib/prism/translation/ripper.rb#381
+    # source://prism/lib/prism/translation/ripper.rb#381
     def sexp(src, filename = T.unsafe(nil), lineno = T.unsafe(nil), raise_errors: T.unsafe(nil)); end
 
     # Parses +src+ and create S-exp tree.
@@ -35117,637 +35117,637 @@ class Prism::Translation::Ripper < ::Prism::Compiler
     #               nil,
     #               nil]]]]
     #
-    # source://prism//lib/prism/translation/ripper.rb#416
+    # source://prism/lib/prism/translation/ripper.rb#416
     def sexp_raw(src, filename = T.unsafe(nil), lineno = T.unsafe(nil), raise_errors: T.unsafe(nil)); end
   end
 end
 
 # A list of all of the Ruby binary operators.
 #
-# source://prism//lib/prism/translation/ripper.rb#337
+# source://prism/lib/prism/translation/ripper.rb#337
 Prism::Translation::Ripper::BINARY_OPERATORS = T.let(T.unsafe(nil), Array)
 
 # This array contains name of all ripper events.
 #
-# source://prism//lib/prism/translation/ripper.rb#289
+# source://prism/lib/prism/translation/ripper.rb#289
 Prism::Translation::Ripper::EVENTS = T.let(T.unsafe(nil), Array)
 
 # A list of all of the Ruby keywords.
 #
-# source://prism//lib/prism/translation/ripper.rb#292
+# source://prism/lib/prism/translation/ripper.rb#292
 Prism::Translation::Ripper::KEYWORDS = T.let(T.unsafe(nil), Array)
 
 # This array contains name of parser events.
 #
-# source://prism//lib/prism/translation/ripper.rb#283
+# source://prism/lib/prism/translation/ripper.rb#283
 Prism::Translation::Ripper::PARSER_EVENTS = T.let(T.unsafe(nil), Array)
 
 # This contains a table of all of the parser events and their
 # corresponding arity.
 #
-# source://prism//lib/prism/translation/ripper.rb#84
+# source://prism/lib/prism/translation/ripper.rb#84
 Prism::Translation::Ripper::PARSER_EVENT_TABLE = T.let(T.unsafe(nil), Hash)
 
 # This array contains name of scanner events.
 #
-# source://prism//lib/prism/translation/ripper.rb#286
+# source://prism/lib/prism/translation/ripper.rb#286
 Prism::Translation::Ripper::SCANNER_EVENTS = T.let(T.unsafe(nil), Array)
 
 # This contains a table of all of the scanner events and their
 # corresponding arity.
 #
-# source://prism//lib/prism/translation/ripper.rb#227
+# source://prism/lib/prism/translation/ripper.rb#227
 Prism::Translation::Ripper::SCANNER_EVENT_TABLE = T.let(T.unsafe(nil), Hash)
 
 # This class mirrors the ::Ripper::SexpBuilder subclass of ::Ripper that
 # returns the arrays of [type, *children].
 #
-# source://prism//lib/prism/translation/ripper/sexp.rb#10
+# source://prism/lib/prism/translation/ripper/sexp.rb#10
 class Prism::Translation::Ripper::SexpBuilder < ::Prism::Translation::Ripper
   # :stopdoc:
   #
-  # source://prism//lib/prism/translation/ripper/sexp.rb#13
+  # source://prism/lib/prism/translation/ripper/sexp.rb#13
   def error; end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_BEGIN(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_CHAR(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_END(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on___end__(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_alias(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_alias_error(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_aref(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_aref_field(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_arg_ambiguous(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_arg_paren(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_args_add(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_args_add_block(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_args_add_star(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_args_forward(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_args_new(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_array(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_aryptn(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_assign(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_assign_error(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_assoc_new(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_assoc_splat(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_assoclist_from_args(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_backref(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_backtick(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_bare_assoc_hash(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_begin(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_binary(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_block_var(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_blockarg(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_bodystmt(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_brace_block(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_break(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_call(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_case(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_class(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_class_name_error(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_comma(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_command(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_command_call(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_comment(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_const(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_const_path_field(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_const_path_ref(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_const_ref(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_cvar(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_def(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_defined(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_defs(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_do_block(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_dot2(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_dot3(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_dyna_symbol(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_else(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_elsif(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_embdoc(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_embdoc_beg(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_embdoc_end(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_embexpr_beg(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_embexpr_end(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_embvar(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_ensure(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_excessed_comma(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_fcall(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_field(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_float(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_fndptn(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_for(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_gvar(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_hash(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_heredoc_beg(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_heredoc_end(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_hshptn(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_ident(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_if(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_if_mod(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_ifop(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_ignored_nl(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_ignored_sp(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_imaginary(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_in(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_int(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_ivar(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_kw(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_kwrest_param(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_label(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_label_end(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_lambda(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_lbrace(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_lbracket(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_lparen(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_magic_comment(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_massign(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_method_add_arg(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_method_add_block(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_mlhs_add(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_mlhs_add_post(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_mlhs_add_star(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_mlhs_new(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_mlhs_paren(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_module(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_mrhs_add(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_mrhs_add_star(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_mrhs_new(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_mrhs_new_from_args(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_next(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_nl(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_nokw_param(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_op(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_opassign(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_operator_ambiguous(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_param_error(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_params(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_paren(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_period(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_program(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_qsymbols_add(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_qsymbols_beg(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_qsymbols_new(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_qwords_add(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_qwords_beg(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_qwords_new(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_rational(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_rbrace(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_rbracket(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_redo(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_regexp_add(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_regexp_beg(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_regexp_end(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_regexp_literal(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_regexp_new(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_rescue(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_rescue_mod(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_rest_param(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_retry(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_return(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_return0(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_rparen(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_sclass(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_semicolon(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_sp(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_stmts_add(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_stmts_new(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_string_add(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_string_concat(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_string_content(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_string_dvar(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_string_embexpr(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_string_literal(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_super(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_symbeg(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_symbol(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_symbol_literal(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_symbols_add(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_symbols_beg(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_symbols_new(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_tlambda(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_tlambeg(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_top_const_field(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_top_const_ref(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_tstring_beg(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_tstring_content(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_tstring_end(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_unary(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_undef(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_unless(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_unless_mod(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_until(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_until_mod(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_var_alias(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_var_field(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_var_ref(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_vcall(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_void_stmt(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_when(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_while(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_while_mod(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_word_add(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_word_new(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_words_add(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_words_beg(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_words_new(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#55
+  # source://prism/lib/prism/translation/ripper/sexp.rb#55
   def on_words_sep(tok); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_xstring_add(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_xstring_literal(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_xstring_new(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_yield(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_yield0(*args); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#47
+  # source://prism/lib/prism/translation/ripper/sexp.rb#47
   def on_zsuper(*args); end
 
   private
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#61
+  # source://prism/lib/prism/translation/ripper/sexp.rb#61
   def compile_error(mesg); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#17
+  # source://prism/lib/prism/translation/ripper/sexp.rb#17
   def dedent_element(e, width); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#61
+  # source://prism/lib/prism/translation/ripper/sexp.rb#61
   def on_error(mesg); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#24
+  # source://prism/lib/prism/translation/ripper/sexp.rb#24
   def on_heredoc_dedent(val, width); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#61
+  # source://prism/lib/prism/translation/ripper/sexp.rb#61
   def on_parse_error(mesg); end
 end
 
@@ -35755,113 +35755,113 @@ end
 # returns the same values as ::Ripper::SexpBuilder except with a couple of
 # niceties that flatten linked lists into arrays.
 #
-# source://prism//lib/prism/translation/ripper/sexp.rb#74
+# source://prism/lib/prism/translation/ripper/sexp.rb#74
 class Prism::Translation::Ripper::SexpBuilderPP < ::Prism::Translation::Ripper::SexpBuilder
   private
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#92
+  # source://prism/lib/prism/translation/ripper/sexp.rb#92
   def _dispatch_event_new; end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#96
+  # source://prism/lib/prism/translation/ripper/sexp.rb#96
   def _dispatch_event_push(list, item); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#96
+  # source://prism/lib/prism/translation/ripper/sexp.rb#96
   def on_args_add(list, item); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#92
+  # source://prism/lib/prism/translation/ripper/sexp.rb#92
   def on_args_new; end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#79
+  # source://prism/lib/prism/translation/ripper/sexp.rb#79
   def on_heredoc_dedent(val, width); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#96
+  # source://prism/lib/prism/translation/ripper/sexp.rb#96
   def on_mlhs_add(list, item); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#109
+  # source://prism/lib/prism/translation/ripper/sexp.rb#109
   def on_mlhs_add_post(list, post); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#105
+  # source://prism/lib/prism/translation/ripper/sexp.rb#105
   def on_mlhs_add_star(list, star); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#92
+  # source://prism/lib/prism/translation/ripper/sexp.rb#92
   def on_mlhs_new; end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#101
+  # source://prism/lib/prism/translation/ripper/sexp.rb#101
   def on_mlhs_paren(list); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#96
+  # source://prism/lib/prism/translation/ripper/sexp.rb#96
   def on_mrhs_add(list, item); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#92
+  # source://prism/lib/prism/translation/ripper/sexp.rb#92
   def on_mrhs_new; end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#96
+  # source://prism/lib/prism/translation/ripper/sexp.rb#96
   def on_qsymbols_add(list, item); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#92
+  # source://prism/lib/prism/translation/ripper/sexp.rb#92
   def on_qsymbols_new; end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#96
+  # source://prism/lib/prism/translation/ripper/sexp.rb#96
   def on_qwords_add(list, item); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#92
+  # source://prism/lib/prism/translation/ripper/sexp.rb#92
   def on_qwords_new; end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#96
+  # source://prism/lib/prism/translation/ripper/sexp.rb#96
   def on_regexp_add(list, item); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#92
+  # source://prism/lib/prism/translation/ripper/sexp.rb#92
   def on_regexp_new; end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#96
+  # source://prism/lib/prism/translation/ripper/sexp.rb#96
   def on_stmts_add(list, item); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#92
+  # source://prism/lib/prism/translation/ripper/sexp.rb#92
   def on_stmts_new; end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#96
+  # source://prism/lib/prism/translation/ripper/sexp.rb#96
   def on_string_add(list, item); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#96
+  # source://prism/lib/prism/translation/ripper/sexp.rb#96
   def on_symbols_add(list, item); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#92
+  # source://prism/lib/prism/translation/ripper/sexp.rb#92
   def on_symbols_new; end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#96
+  # source://prism/lib/prism/translation/ripper/sexp.rb#96
   def on_word_add(list, item); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#92
+  # source://prism/lib/prism/translation/ripper/sexp.rb#92
   def on_word_new; end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#96
+  # source://prism/lib/prism/translation/ripper/sexp.rb#96
   def on_words_add(list, item); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#92
+  # source://prism/lib/prism/translation/ripper/sexp.rb#92
   def on_words_new; end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#96
+  # source://prism/lib/prism/translation/ripper/sexp.rb#96
   def on_xstring_add(list, item); end
 
-  # source://prism//lib/prism/translation/ripper/sexp.rb#92
+  # source://prism/lib/prism/translation/ripper/sexp.rb#92
   def on_xstring_new; end
 end
 
 # This module is the entry-point for converting a prism syntax tree into the
 # seattlerb/ruby_parser gem's syntax tree.
 #
-# source://prism//lib/prism/translation/ruby_parser.rb#14
+# source://prism/lib/prism/translation/ruby_parser.rb#14
 class Prism::Translation::RubyParser
   # Parse the given source and translate it into the seattlerb/ruby_parser
   # gem's Sexp format.
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1598
+  # source://prism/lib/prism/translation/ruby_parser.rb#1598
   def parse(source, filepath = T.unsafe(nil)); end
 
   # Parse the given file and translate it into the seattlerb/ruby_parser
   # gem's Sexp format.
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1604
+  # source://prism/lib/prism/translation/ruby_parser.rb#1604
   def parse_file(filepath); end
 
   private
@@ -35869,100 +35869,100 @@ class Prism::Translation::RubyParser
   # Translate the given parse result and filepath into the
   # seattlerb/ruby_parser gem's Sexp format.
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1626
+  # source://prism/lib/prism/translation/ruby_parser.rb#1626
   def translate(result, filepath); end
 
   class << self
     # Parse the given source and translate it into the seattlerb/ruby_parser
     # gem's Sexp format.
     #
-    # source://prism//lib/prism/translation/ruby_parser.rb#1611
+    # source://prism/lib/prism/translation/ruby_parser.rb#1611
     def parse(source, filepath = T.unsafe(nil)); end
 
     # Parse the given file and translate it into the seattlerb/ruby_parser
     # gem's Sexp format.
     #
-    # source://prism//lib/prism/translation/ruby_parser.rb#1617
+    # source://prism/lib/prism/translation/ruby_parser.rb#1617
     def parse_file(filepath); end
   end
 end
 
 # A prism visitor that builds Sexp objects.
 #
-# source://prism//lib/prism/translation/ruby_parser.rb#16
+# source://prism/lib/prism/translation/ruby_parser.rb#16
 class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # Initialize a new compiler with the given file name.
   #
   # @return [Compiler] a new instance of Compiler
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#31
+  # source://prism/lib/prism/translation/ruby_parser.rb#31
   def initialize(file, in_def: T.unsafe(nil), in_pattern: T.unsafe(nil)); end
 
   # This is the name of the file that we are compiling. We set it on every
   # Sexp object that is generated, and also use it to compile __FILE__
   # nodes.
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#20
+  # source://prism/lib/prism/translation/ruby_parser.rb#20
   def file; end
 
   # Class variables will change their type based on if they are inside of
   # a method definition or not, so we need to track that state.
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#24
+  # source://prism/lib/prism/translation/ruby_parser.rb#24
   def in_def; end
 
   # Some nodes will change their representation if they are inside of a
   # pattern, so we need to track that state.
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#28
+  # source://prism/lib/prism/translation/ruby_parser.rb#28
   def in_pattern; end
 
   # alias $foo $bar
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#45
+  # source://prism/lib/prism/translation/ruby_parser.rb#45
   def visit_alias_global_variable_node(node); end
 
   # alias foo bar
   # ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#39
+  # source://prism/lib/prism/translation/ruby_parser.rb#39
   def visit_alias_method_node(node); end
 
   # foo => bar | baz
   #        ^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#51
+  # source://prism/lib/prism/translation/ruby_parser.rb#51
   def visit_alternation_pattern_node(node); end
 
   # a and b
   # ^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#57
+  # source://prism/lib/prism/translation/ruby_parser.rb#57
   def visit_and_node(node); end
 
   # foo(bar)
   #     ^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#108
+  # source://prism/lib/prism/translation/ruby_parser.rb#108
   def visit_arguments_node(node); end
 
   # []
   # ^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#75
+  # source://prism/lib/prism/translation/ruby_parser.rb#75
   def visit_array_node(node); end
 
   # foo => [bar]
   #        ^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#85
+  # source://prism/lib/prism/translation/ruby_parser.rb#85
   def visit_array_pattern_node(node); end
 
   # { a: 1 }
   #   ^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#114
+  # source://prism/lib/prism/translation/ruby_parser.rb#114
   def visit_assoc_node(node); end
 
   # def foo(**); bar(**); end
@@ -35971,47 +35971,47 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # { **foo }
   #   ^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#123
+  # source://prism/lib/prism/translation/ruby_parser.rb#123
   def visit_assoc_splat_node(node); end
 
   # $+
   # ^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#133
+  # source://prism/lib/prism/translation/ruby_parser.rb#133
   def visit_back_reference_read_node(node); end
 
   # begin end
   # ^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#139
+  # source://prism/lib/prism/translation/ruby_parser.rb#139
   def visit_begin_node(node); end
 
   # foo(&bar)
   #     ^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#172
+  # source://prism/lib/prism/translation/ruby_parser.rb#172
   def visit_block_argument_node(node); end
 
   # foo { |; bar| }
   #          ^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#180
+  # source://prism/lib/prism/translation/ruby_parser.rb#180
   def visit_block_local_variable_node(node); end
 
   # A block on a keyword or method call.
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#185
+  # source://prism/lib/prism/translation/ruby_parser.rb#185
   def visit_block_node(node); end
 
   # def foo(&bar); end
   #         ^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#191
+  # source://prism/lib/prism/translation/ruby_parser.rb#191
   def visit_block_parameter_node(node); end
 
   # A block's parameters.
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#196
+  # source://prism/lib/prism/translation/ruby_parser.rb#196
   def visit_block_parameters_node(node); end
 
   # break
@@ -36020,13 +36020,13 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # break foo
   # ^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#236
+  # source://prism/lib/prism/translation/ruby_parser.rb#236
   def visit_break_node(node); end
 
   # foo.bar &&= baz
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#304
+  # source://prism/lib/prism/translation/ruby_parser.rb#304
   def visit_call_and_write_node(node); end
 
   # foo
@@ -36038,79 +36038,79 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # foo.bar() {}
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#254
+  # source://prism/lib/prism/translation/ruby_parser.rb#254
   def visit_call_node(node); end
 
   # foo.bar += baz
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#294
+  # source://prism/lib/prism/translation/ruby_parser.rb#294
   def visit_call_operator_write_node(node); end
 
   # foo.bar ||= baz
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#314
+  # source://prism/lib/prism/translation/ruby_parser.rb#314
   def visit_call_or_write_node(node); end
 
   # foo.bar, = 1
   # ^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#337
+  # source://prism/lib/prism/translation/ruby_parser.rb#337
   def visit_call_target_node(node); end
 
   # foo => bar => baz
   #        ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#343
+  # source://prism/lib/prism/translation/ruby_parser.rb#343
   def visit_capture_pattern_node(node); end
 
   # case foo; in bar; end
   # ^^^^^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#355
+  # source://prism/lib/prism/translation/ruby_parser.rb#355
   def visit_case_match_node(node); end
 
   # case foo; when bar; end
   # ^^^^^^^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#349
+  # source://prism/lib/prism/translation/ruby_parser.rb#349
   def visit_case_node(node); end
 
   # class Foo; end
   # ^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#361
+  # source://prism/lib/prism/translation/ruby_parser.rb#361
   def visit_class_node(node); end
 
   # @@foo &&= bar
   # ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#402
+  # source://prism/lib/prism/translation/ruby_parser.rb#402
   def visit_class_variable_and_write_node(node); end
 
   # @@foo += bar
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#396
+  # source://prism/lib/prism/translation/ruby_parser.rb#396
   def visit_class_variable_operator_write_node(node); end
 
   # @@foo ||= bar
   # ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#408
+  # source://prism/lib/prism/translation/ruby_parser.rb#408
   def visit_class_variable_or_write_node(node); end
 
   # @@foo
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#381
+  # source://prism/lib/prism/translation/ruby_parser.rb#381
   def visit_class_variable_read_node(node); end
 
   # @@foo, = bar
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#414
+  # source://prism/lib/prism/translation/ruby_parser.rb#414
   def visit_class_variable_target_node(node); end
 
   # @@foo = 1
@@ -36119,55 +36119,55 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # @@foo, @@bar = 1
   # ^^^^^  ^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#390
+  # source://prism/lib/prism/translation/ruby_parser.rb#390
   def visit_class_variable_write_node(node); end
 
   # Foo &&= bar
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#447
+  # source://prism/lib/prism/translation/ruby_parser.rb#447
   def visit_constant_and_write_node(node); end
 
   # Foo += bar
   # ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#441
+  # source://prism/lib/prism/translation/ruby_parser.rb#441
   def visit_constant_operator_write_node(node); end
 
   # Foo ||= bar
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#453
+  # source://prism/lib/prism/translation/ruby_parser.rb#453
   def visit_constant_or_write_node(node); end
 
   # Foo::Bar &&= baz
   # ^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#490
+  # source://prism/lib/prism/translation/ruby_parser.rb#490
   def visit_constant_path_and_write_node(node); end
 
   # Foo::Bar
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#465
+  # source://prism/lib/prism/translation/ruby_parser.rb#465
   def visit_constant_path_node(node); end
 
   # Foo::Bar += baz
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#484
+  # source://prism/lib/prism/translation/ruby_parser.rb#484
   def visit_constant_path_operator_write_node(node); end
 
   # Foo::Bar ||= baz
   # ^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#496
+  # source://prism/lib/prism/translation/ruby_parser.rb#496
   def visit_constant_path_or_write_node(node); end
 
   # Foo::Bar, = baz
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#502
+  # source://prism/lib/prism/translation/ruby_parser.rb#502
   def visit_constant_path_target_node(node); end
 
   # Foo::Bar = 1
@@ -36176,19 +36176,19 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # Foo::Foo, Bar::Bar = 1
   # ^^^^^^^^  ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#478
+  # source://prism/lib/prism/translation/ruby_parser.rb#478
   def visit_constant_path_write_node(node); end
 
   # Foo
   # ^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#426
+  # source://prism/lib/prism/translation/ruby_parser.rb#426
   def visit_constant_read_node(node); end
 
   # Foo, = bar
   # ^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#459
+  # source://prism/lib/prism/translation/ruby_parser.rb#459
   def visit_constant_target_node(node); end
 
   # Foo = 1
@@ -36197,7 +36197,7 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # Foo, Bar = 1
   # ^^^  ^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#435
+  # source://prism/lib/prism/translation/ruby_parser.rb#435
   def visit_constant_write_node(node); end
 
   # def foo; end
@@ -36206,7 +36206,7 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # def self.foo; end
   # ^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#518
+  # source://prism/lib/prism/translation/ruby_parser.rb#518
   def visit_def_node(node); end
 
   # defined? a
@@ -36215,73 +36215,73 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # defined?(a)
   # ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#549
+  # source://prism/lib/prism/translation/ruby_parser.rb#549
   def visit_defined_node(node); end
 
   # if foo then bar else baz end
   #                 ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#555
+  # source://prism/lib/prism/translation/ruby_parser.rb#555
   def visit_else_node(node); end
 
   # "foo #{bar}"
   #      ^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#561
+  # source://prism/lib/prism/translation/ruby_parser.rb#561
   def visit_embedded_statements_node(node); end
 
   # "foo #@bar"
   #      ^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#569
+  # source://prism/lib/prism/translation/ruby_parser.rb#569
   def visit_embedded_variable_node(node); end
 
   # begin; foo; ensure; bar; end
   #             ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#575
+  # source://prism/lib/prism/translation/ruby_parser.rb#575
   def visit_ensure_node(node); end
 
   # false
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#581
+  # source://prism/lib/prism/translation/ruby_parser.rb#581
   def visit_false_node(node); end
 
   # foo => [*, bar, *]
   #        ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#587
+  # source://prism/lib/prism/translation/ruby_parser.rb#587
   def visit_find_pattern_node(node); end
 
   # if foo .. bar; end
   #    ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#593
+  # source://prism/lib/prism/translation/ruby_parser.rb#593
   def visit_flip_flop_node(node); end
 
   # 1.0
   # ^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#603
+  # source://prism/lib/prism/translation/ruby_parser.rb#603
   def visit_float_node(node); end
 
   # for foo in bar do end
   # ^^^^^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#609
+  # source://prism/lib/prism/translation/ruby_parser.rb#609
   def visit_for_node(node); end
 
   # def foo(...); bar(...); end
   #                   ^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#615
+  # source://prism/lib/prism/translation/ruby_parser.rb#615
   def visit_forwarding_arguments_node(node); end
 
   # def foo(...); end
   #         ^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#621
+  # source://prism/lib/prism/translation/ruby_parser.rb#621
   def visit_forwarding_parameter_node(node); end
 
   # super
@@ -36290,37 +36290,37 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # super {}
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#630
+  # source://prism/lib/prism/translation/ruby_parser.rb#630
   def visit_forwarding_super_node(node); end
 
   # $foo &&= bar
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#657
+  # source://prism/lib/prism/translation/ruby_parser.rb#657
   def visit_global_variable_and_write_node(node); end
 
   # $foo += bar
   # ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#651
+  # source://prism/lib/prism/translation/ruby_parser.rb#651
   def visit_global_variable_operator_write_node(node); end
 
   # $foo ||= bar
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#663
+  # source://prism/lib/prism/translation/ruby_parser.rb#663
   def visit_global_variable_or_write_node(node); end
 
   # $foo
   # ^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#636
+  # source://prism/lib/prism/translation/ruby_parser.rb#636
   def visit_global_variable_read_node(node); end
 
   # $foo, = bar
   # ^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#669
+  # source://prism/lib/prism/translation/ruby_parser.rb#669
   def visit_global_variable_target_node(node); end
 
   # $foo = 1
@@ -36329,19 +36329,19 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # $foo, $bar = 1
   # ^^^^  ^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#645
+  # source://prism/lib/prism/translation/ruby_parser.rb#645
   def visit_global_variable_write_node(node); end
 
   # {}
   # ^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#675
+  # source://prism/lib/prism/translation/ruby_parser.rb#675
   def visit_hash_node(node); end
 
   # foo => {}
   #        ^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#681
+  # source://prism/lib/prism/translation/ruby_parser.rb#681
   def visit_hash_pattern_node(node); end
 
   # if foo then bar end
@@ -36353,80 +36353,80 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # foo ? bar : baz
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#702
+  # source://prism/lib/prism/translation/ruby_parser.rb#702
   def visit_if_node(node); end
 
   # 1i
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#707
+  # source://prism/lib/prism/translation/ruby_parser.rb#707
   def visit_imaginary_node(node); end
 
   # { foo: }
   #   ^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#713
+  # source://prism/lib/prism/translation/ruby_parser.rb#713
   def visit_implicit_node(node); end
 
   # foo { |bar,| }
   #           ^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#718
+  # source://prism/lib/prism/translation/ruby_parser.rb#718
   def visit_implicit_rest_node(node); end
 
   # case foo; in bar; end
   # ^^^^^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#723
+  # source://prism/lib/prism/translation/ruby_parser.rb#723
   def visit_in_node(node); end
 
   # foo[bar] &&= baz
   # ^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#749
+  # source://prism/lib/prism/translation/ruby_parser.rb#749
   def visit_index_and_write_node(node); end
 
   # foo[bar] += baz
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#736
+  # source://prism/lib/prism/translation/ruby_parser.rb#736
   def visit_index_operator_write_node(node); end
 
   # foo[bar] ||= baz
   # ^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#762
+  # source://prism/lib/prism/translation/ruby_parser.rb#762
   def visit_index_or_write_node(node); end
 
   # foo[bar], = 1
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#775
+  # source://prism/lib/prism/translation/ruby_parser.rb#775
   def visit_index_target_node(node); end
 
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#805
+  # source://prism/lib/prism/translation/ruby_parser.rb#805
   def visit_instance_variable_and_write_node(node); end
 
   # ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#799
+  # source://prism/lib/prism/translation/ruby_parser.rb#799
   def visit_instance_variable_operator_write_node(node); end
 
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#811
+  # source://prism/lib/prism/translation/ruby_parser.rb#811
   def visit_instance_variable_or_write_node(node); end
 
   # ^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#784
+  # source://prism/lib/prism/translation/ruby_parser.rb#784
   def visit_instance_variable_read_node(node); end
 
   # @foo, = bar
   # ^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#817
+  # source://prism/lib/prism/translation/ruby_parser.rb#817
   def visit_instance_variable_target_node(node); end
 
   # ^^^^^^^^
@@ -36434,55 +36434,55 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # @foo, @bar = 1
   # ^^^^  ^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#793
+  # source://prism/lib/prism/translation/ruby_parser.rb#793
   def visit_instance_variable_write_node(node); end
 
   # 1
   # ^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#823
+  # source://prism/lib/prism/translation/ruby_parser.rb#823
   def visit_integer_node(node); end
 
   # if /foo #{bar}/ then end
   #    ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#829
+  # source://prism/lib/prism/translation/ruby_parser.rb#829
   def visit_interpolated_match_last_line_node(node); end
 
   # /foo #{bar}/
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#846
+  # source://prism/lib/prism/translation/ruby_parser.rb#846
   def visit_interpolated_regular_expression_node(node); end
 
   # "foo #{bar}"
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#861
+  # source://prism/lib/prism/translation/ruby_parser.rb#861
   def visit_interpolated_string_node(node); end
 
   # :"foo #{bar}"
   # ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#868
+  # source://prism/lib/prism/translation/ruby_parser.rb#868
   def visit_interpolated_symbol_node(node); end
 
   # `foo #{bar}`
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#875
+  # source://prism/lib/prism/translation/ruby_parser.rb#875
   def visit_interpolated_x_string_node(node); end
 
   # -> { it }
   #      ^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#947
+  # source://prism/lib/prism/translation/ruby_parser.rb#947
   def visit_it_local_variable_read_node(node); end
 
   # foo(bar: baz)
   #     ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#953
+  # source://prism/lib/prism/translation/ruby_parser.rb#953
   def visit_keyword_hash_node(node); end
 
   # def foo(**bar); end
@@ -36491,42 +36491,42 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # def foo(**); end
   #         ^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#962
+  # source://prism/lib/prism/translation/ruby_parser.rb#962
   def visit_keyword_rest_parameter_node(node); end
 
   # -> {}
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#967
+  # source://prism/lib/prism/translation/ruby_parser.rb#967
   def visit_lambda_node(node); end
 
   # foo &&= bar
   # ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1010
+  # source://prism/lib/prism/translation/ruby_parser.rb#1010
   def visit_local_variable_and_write_node(node); end
 
   # foo += bar
   # ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1004
+  # source://prism/lib/prism/translation/ruby_parser.rb#1004
   def visit_local_variable_operator_write_node(node); end
 
   # foo ||= bar
   # ^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1016
+  # source://prism/lib/prism/translation/ruby_parser.rb#1016
   def visit_local_variable_or_write_node(node); end
 
   # foo
   # ^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#985
+  # source://prism/lib/prism/translation/ruby_parser.rb#985
   def visit_local_variable_read_node(node); end
 
   # foo, = bar
   # ^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1022
+  # source://prism/lib/prism/translation/ruby_parser.rb#1022
   def visit_local_variable_target_node(node); end
 
   # foo = 1
@@ -36535,56 +36535,56 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # foo, bar = 1
   # ^^^  ^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#998
+  # source://prism/lib/prism/translation/ruby_parser.rb#998
   def visit_local_variable_write_node(node); end
 
   # if /foo/ then end
   #    ^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1028
+  # source://prism/lib/prism/translation/ruby_parser.rb#1028
   def visit_match_last_line_node(node); end
 
   # foo in bar
   # ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1034
+  # source://prism/lib/prism/translation/ruby_parser.rb#1034
   def visit_match_predicate_node(node); end
 
   # foo => bar
   # ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1040
+  # source://prism/lib/prism/translation/ruby_parser.rb#1040
   def visit_match_required_node(node); end
 
   # /(?<foo>foo)/ =~ bar
   # ^^^^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1046
+  # source://prism/lib/prism/translation/ruby_parser.rb#1046
   def visit_match_write_node(node); end
 
   # A node that is missing from the syntax tree. This is only used in the
   # case of a syntax error. The parser gem doesn't have such a concept, so
   # we invent our own here.
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1053
+  # source://prism/lib/prism/translation/ruby_parser.rb#1053
   def visit_missing_node(node); end
 
   # module Foo; end
   # ^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1059
+  # source://prism/lib/prism/translation/ruby_parser.rb#1059
   def visit_module_node(node); end
 
   # foo, bar = baz
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1079
+  # source://prism/lib/prism/translation/ruby_parser.rb#1079
   def visit_multi_target_node(node); end
 
   # foo, bar = baz
   # ^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1089
+  # source://prism/lib/prism/translation/ruby_parser.rb#1089
   def visit_multi_write_node(node); end
 
   # next
@@ -36593,55 +36593,55 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # next foo
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1113
+  # source://prism/lib/prism/translation/ruby_parser.rb#1113
   def visit_next_node(node); end
 
   # nil
   # ^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1126
+  # source://prism/lib/prism/translation/ruby_parser.rb#1126
   def visit_nil_node(node); end
 
   # def foo(**nil); end
   #         ^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1132
+  # source://prism/lib/prism/translation/ruby_parser.rb#1132
   def visit_no_keywords_parameter_node(node); end
 
   # -> { _1 + _2 }
   # ^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1138
+  # source://prism/lib/prism/translation/ruby_parser.rb#1138
   def visit_numbered_parameters_node(node); end
 
   # $1
   # ^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1144
+  # source://prism/lib/prism/translation/ruby_parser.rb#1144
   def visit_numbered_reference_read_node(node); end
 
   # def foo(bar: baz); end
   #         ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1150
+  # source://prism/lib/prism/translation/ruby_parser.rb#1150
   def visit_optional_keyword_parameter_node(node); end
 
   # def foo(bar = 1); end
   #         ^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1156
+  # source://prism/lib/prism/translation/ruby_parser.rb#1156
   def visit_optional_parameter_node(node); end
 
   # a or b
   # ^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1162
+  # source://prism/lib/prism/translation/ruby_parser.rb#1162
   def visit_or_node(node); end
 
   # def foo(bar, *baz); end
   #         ^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1180
+  # source://prism/lib/prism/translation/ruby_parser.rb#1180
   def visit_parameters_node(node); end
 
   # ()
@@ -36650,82 +36650,82 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # (1)
   # ^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1218
+  # source://prism/lib/prism/translation/ruby_parser.rb#1218
   def visit_parentheses_node(node); end
 
   # foo => ^(bar)
   #        ^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1228
+  # source://prism/lib/prism/translation/ruby_parser.rb#1228
   def visit_pinned_expression_node(node); end
 
   # foo = 1 and bar => ^foo
   #                    ^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1234
+  # source://prism/lib/prism/translation/ruby_parser.rb#1234
   def visit_pinned_variable_node(node); end
 
   # END {}
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1243
+  # source://prism/lib/prism/translation/ruby_parser.rb#1243
   def visit_post_execution_node(node); end
 
   # BEGIN {}
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1248
+  # source://prism/lib/prism/translation/ruby_parser.rb#1248
   def visit_pre_execution_node(node); end
 
   # The top-level program node.
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1253
+  # source://prism/lib/prism/translation/ruby_parser.rb#1253
   def visit_program_node(node); end
 
   # 0..5
   # ^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1259
+  # source://prism/lib/prism/translation/ruby_parser.rb#1259
   def visit_range_node(node); end
 
   # 1r
   # ^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1281
+  # source://prism/lib/prism/translation/ruby_parser.rb#1281
   def visit_rational_node(node); end
 
   # redo
   # ^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1287
+  # source://prism/lib/prism/translation/ruby_parser.rb#1287
   def visit_redo_node(node); end
 
   # /foo/
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1293
+  # source://prism/lib/prism/translation/ruby_parser.rb#1293
   def visit_regular_expression_node(node); end
 
   # def foo(bar:); end
   #         ^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1299
+  # source://prism/lib/prism/translation/ruby_parser.rb#1299
   def visit_required_keyword_parameter_node(node); end
 
   # def foo(bar); end
   #         ^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1305
+  # source://prism/lib/prism/translation/ruby_parser.rb#1305
   def visit_required_parameter_node(node); end
 
   # foo rescue bar
   # ^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1311
+  # source://prism/lib/prism/translation/ruby_parser.rb#1311
   def visit_rescue_modifier_node(node); end
 
   # begin; rescue; end
   #        ^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1317
+  # source://prism/lib/prism/translation/ruby_parser.rb#1317
   def visit_rescue_node(node); end
 
   # def foo(*bar); end
@@ -36734,13 +36734,13 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # def foo(*); end
   #         ^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1337
+  # source://prism/lib/prism/translation/ruby_parser.rb#1337
   def visit_rest_parameter_node(node); end
 
   # retry
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1343
+  # source://prism/lib/prism/translation/ruby_parser.rb#1343
   def visit_retry_node(node); end
 
   # return
@@ -36749,42 +36749,42 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # return 1
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1352
+  # source://prism/lib/prism/translation/ruby_parser.rb#1352
   def visit_return_node(node); end
 
   # self
   # ^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1365
+  # source://prism/lib/prism/translation/ruby_parser.rb#1365
   def visit_self_node(node); end
 
   # A shareable constant.
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1370
+  # source://prism/lib/prism/translation/ruby_parser.rb#1370
   def visit_shareable_constant_node(node); end
 
   # class << self; end
   # ^^^^^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1376
+  # source://prism/lib/prism/translation/ruby_parser.rb#1376
   def visit_singleton_class_node(node); end
 
   # __ENCODING__
   # ^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1384
+  # source://prism/lib/prism/translation/ruby_parser.rb#1384
   def visit_source_encoding_node(node); end
 
   # __FILE__
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1391
+  # source://prism/lib/prism/translation/ruby_parser.rb#1391
   def visit_source_file_node(node); end
 
   # __LINE__
   # ^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1397
+  # source://prism/lib/prism/translation/ruby_parser.rb#1397
   def visit_source_line_node(node); end
 
   # foo(*bar)
@@ -36796,42 +36796,42 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # def foo(*); bar(*); end
   #                 ^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1409
+  # source://prism/lib/prism/translation/ruby_parser.rb#1409
   def visit_splat_node(node); end
 
   # A list of statements.
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1418
+  # source://prism/lib/prism/translation/ruby_parser.rb#1418
   def visit_statements_node(node); end
 
   # "foo"
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1430
+  # source://prism/lib/prism/translation/ruby_parser.rb#1430
   def visit_string_node(node); end
 
   # super(foo)
   # ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1442
+  # source://prism/lib/prism/translation/ruby_parser.rb#1442
   def visit_super_node(node); end
 
   # :foo
   # ^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1456
+  # source://prism/lib/prism/translation/ruby_parser.rb#1456
   def visit_symbol_node(node); end
 
   # true
   # ^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1462
+  # source://prism/lib/prism/translation/ruby_parser.rb#1462
   def visit_true_node(node); end
 
   # undef foo
   # ^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1468
+  # source://prism/lib/prism/translation/ruby_parser.rb#1468
   def visit_undef_node(node); end
 
   # unless foo; bar end
@@ -36840,7 +36840,7 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # bar unless foo
   # ^^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1478
+  # source://prism/lib/prism/translation/ruby_parser.rb#1478
   def visit_unless_node(node); end
 
   # until foo; bar end
@@ -36849,13 +36849,13 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # bar until foo
   # ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1487
+  # source://prism/lib/prism/translation/ruby_parser.rb#1487
   def visit_until_node(node); end
 
   # case foo; when bar; end
   #           ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1493
+  # source://prism/lib/prism/translation/ruby_parser.rb#1493
   def visit_when_node(node); end
 
   # while foo; bar end
@@ -36864,13 +36864,13 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # bar while foo
   # ^^^^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1502
+  # source://prism/lib/prism/translation/ruby_parser.rb#1502
   def visit_while_node(node); end
 
   # `foo`
   # ^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1508
+  # source://prism/lib/prism/translation/ruby_parser.rb#1508
   def visit_x_string_node(node); end
 
   # yield
@@ -36879,7 +36879,7 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # yield 1
   # ^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1524
+  # source://prism/lib/prism/translation/ruby_parser.rb#1524
   def visit_yield_node(node); end
 
   private
@@ -36887,12 +36887,12 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   # If a class variable is written within a method definition, it has a
   # different type than everywhere else.
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#420
+  # source://prism/lib/prism/translation/ruby_parser.rb#420
   def class_variable_write_type; end
 
   # Create a new compiler with the given options.
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1531
+  # source://prism/lib/prism/translation/ruby_parser.rb#1531
   def copy_compiler(in_def: T.unsafe(nil), in_pattern: T.unsafe(nil)); end
 
   # Call nodes with operators following them will either be op_asgn or
@@ -36901,53 +36901,53 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#325
+  # source://prism/lib/prism/translation/ruby_parser.rb#325
   def op_asgn?(node); end
 
   # Call nodes with operators following them can use &. as an operator,
   # which changes their type by prefixing "safe_".
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#331
+  # source://prism/lib/prism/translation/ruby_parser.rb#331
   def op_asgn_type(node, type); end
 
   # Create a new Sexp object from the given prism node and arguments.
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1536
+  # source://prism/lib/prism/translation/ruby_parser.rb#1536
   def s(node, *arguments); end
 
   # Visit a block node, which will modify the AST by wrapping the given
   # visited node in an iter node.
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1546
+  # source://prism/lib/prism/translation/ruby_parser.rb#1546
   def visit_block(node, sexp, block); end
 
   # def foo((bar, baz)); end
   #         ^^^^^^^^^^
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1195
+  # source://prism/lib/prism/translation/ruby_parser.rb#1195
   def visit_destructured_parameter(node); end
 
   # Visit the interpolated content of the string-like node.
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#882
+  # source://prism/lib/prism/translation/ruby_parser.rb#882
   def visit_interpolated_parts(parts); end
 
   # Pattern constants get wrapped in another layer of :const.
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1567
+  # source://prism/lib/prism/translation/ruby_parser.rb#1567
   def visit_pattern_constant(node); end
 
   # If the bounds of a range node are empty parentheses, then they do not
   # get replaced by their usual s(:nil), but instead are s(:begin).
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1271
+  # source://prism/lib/prism/translation/ruby_parser.rb#1271
   def visit_range_bounds_node(node); end
 
   # Visit the value of a write, which will be on the right-hand side of
   # a write operator. Because implicit arrays can have splats, those could
   # potentially be wrapped in an svalue node.
   #
-  # source://prism//lib/prism/translation/ruby_parser.rb#1581
+  # source://prism/lib/prism/translation/ruby_parser.rb#1581
   def visit_write_value(node); end
 end
 
@@ -36956,62 +36956,62 @@ end
 #     true
 #     ^^^^
 #
-# source://prism//lib/prism/node.rb#15741
+# source://prism/lib/prism/node.rb#15741
 class Prism::TrueNode < ::Prism::Node
   # Initialize a new TrueNode node.
   #
   # @return [TrueNode] a new instance of TrueNode
   #
-  # source://prism//lib/prism/node.rb#15743
+  # source://prism/lib/prism/node.rb#15743
   sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
   def initialize(source, node_id, location, flags); end
 
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#15800
+  # source://prism/lib/prism/node.rb#15800
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#15751
+  # source://prism/lib/prism/node.rb#15751
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#15756
+  # source://prism/lib/prism/node.rb#15756
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#15766
+  # source://prism/lib/prism/node.rb#15766
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#15761
+  # source://prism/lib/prism/node.rb#15761
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> TrueNode
   #
-  # source://prism//lib/prism/node.rb#15771
+  # source://prism/lib/prism/node.rb#15771
   sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::TrueNode) }
   def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end
 
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#15756
+  # source://prism/lib/prism/node.rb#15756
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
   #
-  # source://prism//lib/prism/node.rb#15779
+  # source://prism/lib/prism/node.rb#15779
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -37020,20 +37020,20 @@ class Prism::TrueNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#15784
+  # source://prism/lib/prism/node.rb#15784
   sig { override.returns(String) }
   def inspect; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#15789
+  # source://prism/lib/prism/node.rb#15789
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#15794
+    # source://prism/lib/prism/node.rb#15794
     def type; end
   end
 end
@@ -37043,13 +37043,13 @@ end
 #     undef :foo, :bar, :baz
 #     ^^^^^^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#15809
+# source://prism/lib/prism/node.rb#15809
 class Prism::UndefNode < ::Prism::Node
   # Initialize a new UndefNode node.
   #
   # @return [UndefNode] a new instance of UndefNode
   #
-  # source://prism//lib/prism/node.rb#15811
+  # source://prism/lib/prism/node.rb#15811
   sig do
     params(
       source: Prism::Source,
@@ -37065,36 +37065,36 @@ class Prism::UndefNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#15885
+  # source://prism/lib/prism/node.rb#15885
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#15821
+  # source://prism/lib/prism/node.rb#15821
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#15826
+  # source://prism/lib/prism/node.rb#15826
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#15836
+  # source://prism/lib/prism/node.rb#15836
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#15831
+  # source://prism/lib/prism/node.rb#15831
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?names: Array[SymbolNode | InterpolatedSymbolNode], ?keyword_loc: Location) -> UndefNode
   #
-  # source://prism//lib/prism/node.rb#15841
+  # source://prism/lib/prism/node.rb#15841
   sig do
     params(
       node_id: Integer,
@@ -37109,13 +37109,13 @@ class Prism::UndefNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#15826
+  # source://prism/lib/prism/node.rb#15826
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, names: Array[SymbolNode | InterpolatedSymbolNode], keyword_loc: Location }
   #
-  # source://prism//lib/prism/node.rb#15849
+  # source://prism/lib/prism/node.rb#15849
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -37124,38 +37124,38 @@ class Prism::UndefNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#15869
+  # source://prism/lib/prism/node.rb#15869
   sig { override.returns(String) }
   def inspect; end
 
   # def keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#15864
+  # source://prism/lib/prism/node.rb#15864
   sig { returns(String) }
   def keyword; end
 
   # attr_reader keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#15857
+  # source://prism/lib/prism/node.rb#15857
   sig { returns(Prism::Location) }
   def keyword_loc; end
 
   # attr_reader names: Array[SymbolNode | InterpolatedSymbolNode]
   #
-  # source://prism//lib/prism/node.rb#15854
+  # source://prism/lib/prism/node.rb#15854
   sig { returns(T::Array[T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode)]) }
   def names; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#15874
+  # source://prism/lib/prism/node.rb#15874
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#15879
+    # source://prism/lib/prism/node.rb#15879
     def type; end
   end
 end
@@ -37168,13 +37168,13 @@ end
 #     unless foo then bar end
 #     ^^^^^^^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#15900
+# source://prism/lib/prism/node.rb#15900
 class Prism::UnlessNode < ::Prism::Node
   # Initialize a new UnlessNode node.
   #
   # @return [UnlessNode] a new instance of UnlessNode
   #
-  # source://prism//lib/prism/node.rb#15902
+  # source://prism/lib/prism/node.rb#15902
   sig do
     params(
       source: Prism::Source,
@@ -37194,42 +37194,42 @@ class Prism::UnlessNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#16051
+  # source://prism/lib/prism/node.rb#16051
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#15916
+  # source://prism/lib/prism/node.rb#15916
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#15921
+  # source://prism/lib/prism/node.rb#15921
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#15935
+  # source://prism/lib/prism/node.rb#15935
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#15926
+  # source://prism/lib/prism/node.rb#15926
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # Returns the else clause of the unless node. This method is deprecated in
   # favor of #else_clause.
   #
-  # source://prism//lib/prism/node_ext.rb#503
+  # source://prism/lib/prism/node_ext.rb#503
   def consequent; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?predicate: Prism::node, ?then_keyword_loc: Location?, ?statements: StatementsNode?, ?else_clause: ElseNode?, ?end_keyword_loc: Location?) -> UnlessNode
   #
-  # source://prism//lib/prism/node.rb#15940
+  # source://prism/lib/prism/node.rb#15940
   sig do
     params(
       node_id: Integer,
@@ -37248,13 +37248,13 @@ class Prism::UnlessNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#15921
+  # source://prism/lib/prism/node.rb#15921
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, predicate: Prism::node, then_keyword_loc: Location?, statements: StatementsNode?, else_clause: ElseNode?, end_keyword_loc: Location? }
   #
-  # source://prism//lib/prism/node.rb#15948
+  # source://prism/lib/prism/node.rb#15948
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -37263,13 +37263,13 @@ class Prism::UnlessNode < ::Prism::Node
   #     unless cond then bar else baz end
   #                          ^^^^^^^^
   #
-  # source://prism//lib/prism/node.rb#16001
+  # source://prism/lib/prism/node.rb#16001
   sig { returns(T.nilable(Prism::ElseNode)) }
   def else_clause; end
 
   # def end_keyword: () -> String?
   #
-  # source://prism//lib/prism/node.rb#16030
+  # source://prism/lib/prism/node.rb#16030
   sig { returns(T.nilable(String)) }
   def end_keyword; end
 
@@ -37278,7 +37278,7 @@ class Prism::UnlessNode < ::Prism::Node
   #     unless cond then bar end
   #                          ^^^
   #
-  # source://prism//lib/prism/node.rb#16007
+  # source://prism/lib/prism/node.rb#16007
   sig { returns(T.nilable(Prism::Location)) }
   def end_keyword_loc; end
 
@@ -37287,13 +37287,13 @@ class Prism::UnlessNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#16035
+  # source://prism/lib/prism/node.rb#16035
   sig { override.returns(String) }
   def inspect; end
 
   # def keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#16020
+  # source://prism/lib/prism/node.rb#16020
   sig { returns(String) }
   def keyword; end
 
@@ -37305,11 +37305,11 @@ class Prism::UnlessNode < ::Prism::Node
   #     bar unless cond
   #         ^^^^^^
   #
-  # source://prism//lib/prism/node.rb#15959
+  # source://prism/lib/prism/node.rb#15959
   sig { returns(Prism::Location) }
   def keyword_loc; end
 
-  # source://prism//lib/prism/parse_result/newlines.rb#97
+  # source://prism/lib/prism/parse_result/newlines.rb#97
   def newline_flag!(lines); end
 
   # The condition to be evaluated for the unless expression. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
@@ -37320,7 +37320,7 @@ class Prism::UnlessNode < ::Prism::Node
   #     bar unless cond
   #                ^^^^
   #
-  # source://prism//lib/prism/node.rb#15972
+  # source://prism/lib/prism/node.rb#15972
   sig { returns(Prism::Node) }
   def predicate; end
 
@@ -37330,13 +37330,13 @@ class Prism::UnlessNode < ::Prism::Node
   #     unless cond then bar end
   #                      ^^^
   #
-  # source://prism//lib/prism/node.rb#15995
+  # source://prism/lib/prism/node.rb#15995
   sig { returns(T.nilable(Prism::StatementsNode)) }
   def statements; end
 
   # def then_keyword: () -> String?
   #
-  # source://prism//lib/prism/node.rb#16025
+  # source://prism/lib/prism/node.rb#16025
   sig { returns(T.nilable(String)) }
   def then_keyword; end
 
@@ -37345,20 +37345,20 @@ class Prism::UnlessNode < ::Prism::Node
   #     unless cond then bar end
   #                 ^^^^
   #
-  # source://prism//lib/prism/node.rb#15978
+  # source://prism/lib/prism/node.rb#15978
   sig { returns(T.nilable(Prism::Location)) }
   def then_keyword_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#16040
+  # source://prism/lib/prism/node.rb#16040
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#16045
+    # source://prism/lib/prism/node.rb#16045
     def type; end
   end
 end
@@ -37371,13 +37371,13 @@ end
 #     until foo do bar end
 #     ^^^^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#16069
+# source://prism/lib/prism/node.rb#16069
 class Prism::UntilNode < ::Prism::Node
   # Initialize a new UntilNode node.
   #
   # @return [UntilNode] a new instance of UntilNode
   #
-  # source://prism//lib/prism/node.rb#16071
+  # source://prism/lib/prism/node.rb#16071
   sig do
     params(
       source: Prism::Source,
@@ -37395,12 +37395,12 @@ class Prism::UntilNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#16176
+  # source://prism/lib/prism/node.rb#16176
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#16083
+  # source://prism/lib/prism/node.rb#16083
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
@@ -37408,43 +37408,43 @@ class Prism::UntilNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#16119
+  # source://prism/lib/prism/node.rb#16119
   sig { returns(T::Boolean) }
   def begin_modifier?; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#16088
+  # source://prism/lib/prism/node.rb#16088
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String?
   #
-  # source://prism//lib/prism/node.rb#16155
+  # source://prism/lib/prism/node.rb#16155
   sig { returns(T.nilable(String)) }
   def closing; end
 
   # attr_reader closing_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#16131
+  # source://prism/lib/prism/node.rb#16131
   sig { returns(T.nilable(Prism::Location)) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#16101
+  # source://prism/lib/prism/node.rb#16101
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#16093
+  # source://prism/lib/prism/node.rb#16093
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?closing_loc: Location?, ?predicate: Prism::node, ?statements: StatementsNode?) -> UntilNode
   #
-  # source://prism//lib/prism/node.rb#16106
+  # source://prism/lib/prism/node.rb#16106
   sig do
     params(
       node_id: Integer,
@@ -37461,13 +37461,13 @@ class Prism::UntilNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#16088
+  # source://prism/lib/prism/node.rb#16088
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, closing_loc: Location?, predicate: Prism::node, statements: StatementsNode? }
   #
-  # source://prism//lib/prism/node.rb#16114
+  # source://prism/lib/prism/node.rb#16114
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -37476,47 +37476,47 @@ class Prism::UntilNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#16160
+  # source://prism/lib/prism/node.rb#16160
   sig { override.returns(String) }
   def inspect; end
 
   # def keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#16150
+  # source://prism/lib/prism/node.rb#16150
   sig { returns(String) }
   def keyword; end
 
   # attr_reader keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#16124
+  # source://prism/lib/prism/node.rb#16124
   sig { returns(Prism::Location) }
   def keyword_loc; end
 
-  # source://prism//lib/prism/parse_result/newlines.rb#103
+  # source://prism/lib/prism/parse_result/newlines.rb#103
   def newline_flag!(lines); end
 
   # attr_reader predicate: Prism::node
   #
-  # source://prism//lib/prism/node.rb#16144
+  # source://prism/lib/prism/node.rb#16144
   sig { returns(Prism::Node) }
   def predicate; end
 
   # attr_reader statements: StatementsNode?
   #
-  # source://prism//lib/prism/node.rb#16147
+  # source://prism/lib/prism/node.rb#16147
   sig { returns(T.nilable(Prism::StatementsNode)) }
   def statements; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#16165
+  # source://prism/lib/prism/node.rb#16165
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#16170
+    # source://prism/lib/prism/node.rb#16170
     def type; end
   end
 end
@@ -37543,911 +37543,911 @@ Prism::VERSION = T.let(T.unsafe(nil), String)
 #       end
 #     end
 #
-# source://prism//lib/prism/visitor.rb#54
+# source://prism/lib/prism/visitor.rb#54
 class Prism::Visitor < ::Prism::BasicVisitor
   # Visit a AliasGlobalVariableNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::AliasGlobalVariableNode).void }
   def visit_alias_global_variable_node(node); end
 
   # Visit a AliasMethodNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::AliasMethodNode).void }
   def visit_alias_method_node(node); end
 
   # Visit a AlternationPatternNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::AlternationPatternNode).void }
   def visit_alternation_pattern_node(node); end
 
   # Visit a AndNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::AndNode).void }
   def visit_and_node(node); end
 
   # Visit a ArgumentsNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ArgumentsNode).void }
   def visit_arguments_node(node); end
 
   # Visit a ArrayNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ArrayNode).void }
   def visit_array_node(node); end
 
   # Visit a ArrayPatternNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ArrayPatternNode).void }
   def visit_array_pattern_node(node); end
 
   # Visit a AssocNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::AssocNode).void }
   def visit_assoc_node(node); end
 
   # Visit a AssocSplatNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::AssocSplatNode).void }
   def visit_assoc_splat_node(node); end
 
   # Visit a BackReferenceReadNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::BackReferenceReadNode).void }
   def visit_back_reference_read_node(node); end
 
   # Visit a BeginNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::BeginNode).void }
   def visit_begin_node(node); end
 
   # Visit a BlockArgumentNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::BlockArgumentNode).void }
   def visit_block_argument_node(node); end
 
   # Visit a BlockLocalVariableNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::BlockLocalVariableNode).void }
   def visit_block_local_variable_node(node); end
 
   # Visit a BlockNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::BlockNode).void }
   def visit_block_node(node); end
 
   # Visit a BlockParameterNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::BlockParameterNode).void }
   def visit_block_parameter_node(node); end
 
   # Visit a BlockParametersNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::BlockParametersNode).void }
   def visit_block_parameters_node(node); end
 
   # Visit a BreakNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::BreakNode).void }
   def visit_break_node(node); end
 
   # Visit a CallAndWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::CallAndWriteNode).void }
   def visit_call_and_write_node(node); end
 
   # Visit a CallNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::CallNode).void }
   def visit_call_node(node); end
 
   # Visit a CallOperatorWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::CallOperatorWriteNode).void }
   def visit_call_operator_write_node(node); end
 
   # Visit a CallOrWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::CallOrWriteNode).void }
   def visit_call_or_write_node(node); end
 
   # Visit a CallTargetNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::CallTargetNode).void }
   def visit_call_target_node(node); end
 
   # Visit a CapturePatternNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::CapturePatternNode).void }
   def visit_capture_pattern_node(node); end
 
   # Visit a CaseMatchNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::CaseMatchNode).void }
   def visit_case_match_node(node); end
 
   # Visit a CaseNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::CaseNode).void }
   def visit_case_node(node); end
 
   # Visit a ClassNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ClassNode).void }
   def visit_class_node(node); end
 
   # Visit a ClassVariableAndWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ClassVariableAndWriteNode).void }
   def visit_class_variable_and_write_node(node); end
 
   # Visit a ClassVariableOperatorWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ClassVariableOperatorWriteNode).void }
   def visit_class_variable_operator_write_node(node); end
 
   # Visit a ClassVariableOrWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ClassVariableOrWriteNode).void }
   def visit_class_variable_or_write_node(node); end
 
   # Visit a ClassVariableReadNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ClassVariableReadNode).void }
   def visit_class_variable_read_node(node); end
 
   # Visit a ClassVariableTargetNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ClassVariableTargetNode).void }
   def visit_class_variable_target_node(node); end
 
   # Visit a ClassVariableWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ClassVariableWriteNode).void }
   def visit_class_variable_write_node(node); end
 
   # Visit a ConstantAndWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ConstantAndWriteNode).void }
   def visit_constant_and_write_node(node); end
 
   # Visit a ConstantOperatorWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ConstantOperatorWriteNode).void }
   def visit_constant_operator_write_node(node); end
 
   # Visit a ConstantOrWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ConstantOrWriteNode).void }
   def visit_constant_or_write_node(node); end
 
   # Visit a ConstantPathAndWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ConstantPathAndWriteNode).void }
   def visit_constant_path_and_write_node(node); end
 
   # Visit a ConstantPathNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ConstantPathNode).void }
   def visit_constant_path_node(node); end
 
   # Visit a ConstantPathOperatorWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ConstantPathOperatorWriteNode).void }
   def visit_constant_path_operator_write_node(node); end
 
   # Visit a ConstantPathOrWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ConstantPathOrWriteNode).void }
   def visit_constant_path_or_write_node(node); end
 
   # Visit a ConstantPathTargetNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ConstantPathTargetNode).void }
   def visit_constant_path_target_node(node); end
 
   # Visit a ConstantPathWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ConstantPathWriteNode).void }
   def visit_constant_path_write_node(node); end
 
   # Visit a ConstantReadNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ConstantReadNode).void }
   def visit_constant_read_node(node); end
 
   # Visit a ConstantTargetNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ConstantTargetNode).void }
   def visit_constant_target_node(node); end
 
   # Visit a ConstantWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ConstantWriteNode).void }
   def visit_constant_write_node(node); end
 
   # Visit a DefNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::DefNode).void }
   def visit_def_node(node); end
 
   # Visit a DefinedNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::DefinedNode).void }
   def visit_defined_node(node); end
 
   # Visit a ElseNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ElseNode).void }
   def visit_else_node(node); end
 
   # Visit a EmbeddedStatementsNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::EmbeddedStatementsNode).void }
   def visit_embedded_statements_node(node); end
 
   # Visit a EmbeddedVariableNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::EmbeddedVariableNode).void }
   def visit_embedded_variable_node(node); end
 
   # Visit a EnsureNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::EnsureNode).void }
   def visit_ensure_node(node); end
 
   # Visit a FalseNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::FalseNode).void }
   def visit_false_node(node); end
 
   # Visit a FindPatternNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::FindPatternNode).void }
   def visit_find_pattern_node(node); end
 
   # Visit a FlipFlopNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::FlipFlopNode).void }
   def visit_flip_flop_node(node); end
 
   # Visit a FloatNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::FloatNode).void }
   def visit_float_node(node); end
 
   # Visit a ForNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ForNode).void }
   def visit_for_node(node); end
 
   # Visit a ForwardingArgumentsNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ForwardingArgumentsNode).void }
   def visit_forwarding_arguments_node(node); end
 
   # Visit a ForwardingParameterNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ForwardingParameterNode).void }
   def visit_forwarding_parameter_node(node); end
 
   # Visit a ForwardingSuperNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ForwardingSuperNode).void }
   def visit_forwarding_super_node(node); end
 
   # Visit a GlobalVariableAndWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::GlobalVariableAndWriteNode).void }
   def visit_global_variable_and_write_node(node); end
 
   # Visit a GlobalVariableOperatorWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::GlobalVariableOperatorWriteNode).void }
   def visit_global_variable_operator_write_node(node); end
 
   # Visit a GlobalVariableOrWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::GlobalVariableOrWriteNode).void }
   def visit_global_variable_or_write_node(node); end
 
   # Visit a GlobalVariableReadNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::GlobalVariableReadNode).void }
   def visit_global_variable_read_node(node); end
 
   # Visit a GlobalVariableTargetNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::GlobalVariableTargetNode).void }
   def visit_global_variable_target_node(node); end
 
   # Visit a GlobalVariableWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::GlobalVariableWriteNode).void }
   def visit_global_variable_write_node(node); end
 
   # Visit a HashNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::HashNode).void }
   def visit_hash_node(node); end
 
   # Visit a HashPatternNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::HashPatternNode).void }
   def visit_hash_pattern_node(node); end
 
   # Visit a IfNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::IfNode).void }
   def visit_if_node(node); end
 
   # Visit a ImaginaryNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ImaginaryNode).void }
   def visit_imaginary_node(node); end
 
   # Visit a ImplicitNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ImplicitNode).void }
   def visit_implicit_node(node); end
 
   # Visit a ImplicitRestNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ImplicitRestNode).void }
   def visit_implicit_rest_node(node); end
 
   # Visit a InNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::InNode).void }
   def visit_in_node(node); end
 
   # Visit a IndexAndWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::IndexAndWriteNode).void }
   def visit_index_and_write_node(node); end
 
   # Visit a IndexOperatorWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::IndexOperatorWriteNode).void }
   def visit_index_operator_write_node(node); end
 
   # Visit a IndexOrWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::IndexOrWriteNode).void }
   def visit_index_or_write_node(node); end
 
   # Visit a IndexTargetNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::IndexTargetNode).void }
   def visit_index_target_node(node); end
 
   # Visit a InstanceVariableAndWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::InstanceVariableAndWriteNode).void }
   def visit_instance_variable_and_write_node(node); end
 
   # Visit a InstanceVariableOperatorWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::InstanceVariableOperatorWriteNode).void }
   def visit_instance_variable_operator_write_node(node); end
 
   # Visit a InstanceVariableOrWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::InstanceVariableOrWriteNode).void }
   def visit_instance_variable_or_write_node(node); end
 
   # Visit a InstanceVariableReadNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::InstanceVariableReadNode).void }
   def visit_instance_variable_read_node(node); end
 
   # Visit a InstanceVariableTargetNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::InstanceVariableTargetNode).void }
   def visit_instance_variable_target_node(node); end
 
   # Visit a InstanceVariableWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::InstanceVariableWriteNode).void }
   def visit_instance_variable_write_node(node); end
 
   # Visit a IntegerNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::IntegerNode).void }
   def visit_integer_node(node); end
 
   # Visit a InterpolatedMatchLastLineNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::InterpolatedMatchLastLineNode).void }
   def visit_interpolated_match_last_line_node(node); end
 
   # Visit a InterpolatedRegularExpressionNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::InterpolatedRegularExpressionNode).void }
   def visit_interpolated_regular_expression_node(node); end
 
   # Visit a InterpolatedStringNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::InterpolatedStringNode).void }
   def visit_interpolated_string_node(node); end
 
   # Visit a InterpolatedSymbolNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::InterpolatedSymbolNode).void }
   def visit_interpolated_symbol_node(node); end
 
   # Visit a InterpolatedXStringNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::InterpolatedXStringNode).void }
   def visit_interpolated_x_string_node(node); end
 
   # Visit a ItLocalVariableReadNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ItLocalVariableReadNode).void }
   def visit_it_local_variable_read_node(node); end
 
   # Visit a ItParametersNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ItParametersNode).void }
   def visit_it_parameters_node(node); end
 
   # Visit a KeywordHashNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::KeywordHashNode).void }
   def visit_keyword_hash_node(node); end
 
   # Visit a KeywordRestParameterNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::KeywordRestParameterNode).void }
   def visit_keyword_rest_parameter_node(node); end
 
   # Visit a LambdaNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::LambdaNode).void }
   def visit_lambda_node(node); end
 
   # Visit a LocalVariableAndWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::LocalVariableAndWriteNode).void }
   def visit_local_variable_and_write_node(node); end
 
   # Visit a LocalVariableOperatorWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::LocalVariableOperatorWriteNode).void }
   def visit_local_variable_operator_write_node(node); end
 
   # Visit a LocalVariableOrWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::LocalVariableOrWriteNode).void }
   def visit_local_variable_or_write_node(node); end
 
   # Visit a LocalVariableReadNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::LocalVariableReadNode).void }
   def visit_local_variable_read_node(node); end
 
   # Visit a LocalVariableTargetNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::LocalVariableTargetNode).void }
   def visit_local_variable_target_node(node); end
 
   # Visit a LocalVariableWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::LocalVariableWriteNode).void }
   def visit_local_variable_write_node(node); end
 
   # Visit a MatchLastLineNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::MatchLastLineNode).void }
   def visit_match_last_line_node(node); end
 
   # Visit a MatchPredicateNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::MatchPredicateNode).void }
   def visit_match_predicate_node(node); end
 
   # Visit a MatchRequiredNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::MatchRequiredNode).void }
   def visit_match_required_node(node); end
 
   # Visit a MatchWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::MatchWriteNode).void }
   def visit_match_write_node(node); end
 
   # Visit a MissingNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::MissingNode).void }
   def visit_missing_node(node); end
 
   # Visit a ModuleNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ModuleNode).void }
   def visit_module_node(node); end
 
   # Visit a MultiTargetNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::MultiTargetNode).void }
   def visit_multi_target_node(node); end
 
   # Visit a MultiWriteNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::MultiWriteNode).void }
   def visit_multi_write_node(node); end
 
   # Visit a NextNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::NextNode).void }
   def visit_next_node(node); end
 
   # Visit a NilNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::NilNode).void }
   def visit_nil_node(node); end
 
   # Visit a NoKeywordsParameterNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::NoKeywordsParameterNode).void }
   def visit_no_keywords_parameter_node(node); end
 
   # Visit a NumberedParametersNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::NumberedParametersNode).void }
   def visit_numbered_parameters_node(node); end
 
   # Visit a NumberedReferenceReadNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::NumberedReferenceReadNode).void }
   def visit_numbered_reference_read_node(node); end
 
   # Visit a OptionalKeywordParameterNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::OptionalKeywordParameterNode).void }
   def visit_optional_keyword_parameter_node(node); end
 
   # Visit a OptionalParameterNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::OptionalParameterNode).void }
   def visit_optional_parameter_node(node); end
 
   # Visit a OrNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::OrNode).void }
   def visit_or_node(node); end
 
   # Visit a ParametersNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ParametersNode).void }
   def visit_parameters_node(node); end
 
   # Visit a ParenthesesNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ParenthesesNode).void }
   def visit_parentheses_node(node); end
 
   # Visit a PinnedExpressionNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::PinnedExpressionNode).void }
   def visit_pinned_expression_node(node); end
 
   # Visit a PinnedVariableNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::PinnedVariableNode).void }
   def visit_pinned_variable_node(node); end
 
   # Visit a PostExecutionNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::PostExecutionNode).void }
   def visit_post_execution_node(node); end
 
   # Visit a PreExecutionNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::PreExecutionNode).void }
   def visit_pre_execution_node(node); end
 
   # Visit a ProgramNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ProgramNode).void }
   def visit_program_node(node); end
 
   # Visit a RangeNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::RangeNode).void }
   def visit_range_node(node); end
 
   # Visit a RationalNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::RationalNode).void }
   def visit_rational_node(node); end
 
   # Visit a RedoNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::RedoNode).void }
   def visit_redo_node(node); end
 
   # Visit a RegularExpressionNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::RegularExpressionNode).void }
   def visit_regular_expression_node(node); end
 
   # Visit a RequiredKeywordParameterNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::RequiredKeywordParameterNode).void }
   def visit_required_keyword_parameter_node(node); end
 
   # Visit a RequiredParameterNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::RequiredParameterNode).void }
   def visit_required_parameter_node(node); end
 
   # Visit a RescueModifierNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::RescueModifierNode).void }
   def visit_rescue_modifier_node(node); end
 
   # Visit a RescueNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::RescueNode).void }
   def visit_rescue_node(node); end
 
   # Visit a RestParameterNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::RestParameterNode).void }
   def visit_rest_parameter_node(node); end
 
   # Visit a RetryNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::RetryNode).void }
   def visit_retry_node(node); end
 
   # Visit a ReturnNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ReturnNode).void }
   def visit_return_node(node); end
 
   # Visit a SelfNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::SelfNode).void }
   def visit_self_node(node); end
 
   # Visit a ShareableConstantNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::ShareableConstantNode).void }
   def visit_shareable_constant_node(node); end
 
   # Visit a SingletonClassNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::SingletonClassNode).void }
   def visit_singleton_class_node(node); end
 
   # Visit a SourceEncodingNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::SourceEncodingNode).void }
   def visit_source_encoding_node(node); end
 
   # Visit a SourceFileNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::SourceFileNode).void }
   def visit_source_file_node(node); end
 
   # Visit a SourceLineNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::SourceLineNode).void }
   def visit_source_line_node(node); end
 
   # Visit a SplatNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::SplatNode).void }
   def visit_splat_node(node); end
 
   # Visit a StatementsNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::StatementsNode).void }
   def visit_statements_node(node); end
 
   # Visit a StringNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::StringNode).void }
   def visit_string_node(node); end
 
   # Visit a SuperNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::SuperNode).void }
   def visit_super_node(node); end
 
   # Visit a SymbolNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::SymbolNode).void }
   def visit_symbol_node(node); end
 
   # Visit a TrueNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::TrueNode).void }
   def visit_true_node(node); end
 
   # Visit a UndefNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::UndefNode).void }
   def visit_undef_node(node); end
 
   # Visit a UnlessNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::UnlessNode).void }
   def visit_unless_node(node); end
 
   # Visit a UntilNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::UntilNode).void }
   def visit_until_node(node); end
 
   # Visit a WhenNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::WhenNode).void }
   def visit_when_node(node); end
 
   # Visit a WhileNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::WhileNode).void }
   def visit_while_node(node); end
 
   # Visit a XStringNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::XStringNode).void }
   def visit_x_string_node(node); end
 
   # Visit a YieldNode node
   #
-  # source://prism//lib/prism/visitor.rb#29
+  # source://prism/lib/prism/visitor.rb#29
   sig { params(node: Prism::YieldNode).void }
   def visit_yield_node(node); end
 end
@@ -38459,13 +38459,13 @@ end
 #     ^^^^^^^^^
 #     end
 #
-# source://prism//lib/prism/node.rb#16192
+# source://prism/lib/prism/node.rb#16192
 class Prism::WhenNode < ::Prism::Node
   # Initialize a new WhenNode node.
   #
   # @return [WhenNode] a new instance of WhenNode
   #
-  # source://prism//lib/prism/node.rb#16194
+  # source://prism/lib/prism/node.rb#16194
   sig do
     params(
       source: Prism::Source,
@@ -38483,42 +38483,42 @@ class Prism::WhenNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#16294
+  # source://prism/lib/prism/node.rb#16294
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#16206
+  # source://prism/lib/prism/node.rb#16206
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#16211
+  # source://prism/lib/prism/node.rb#16211
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#16224
+  # source://prism/lib/prism/node.rb#16224
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#16216
+  # source://prism/lib/prism/node.rb#16216
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # attr_reader conditions: Array[Prism::node]
   #
-  # source://prism//lib/prism/node.rb#16249
+  # source://prism/lib/prism/node.rb#16249
   sig { returns(T::Array[Prism::Node]) }
   def conditions; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?conditions: Array[Prism::node], ?then_keyword_loc: Location?, ?statements: StatementsNode?) -> WhenNode
   #
-  # source://prism//lib/prism/node.rb#16229
+  # source://prism/lib/prism/node.rb#16229
   sig do
     params(
       node_id: Integer,
@@ -38535,13 +38535,13 @@ class Prism::WhenNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#16211
+  # source://prism/lib/prism/node.rb#16211
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, conditions: Array[Prism::node], then_keyword_loc: Location?, statements: StatementsNode? }
   #
-  # source://prism//lib/prism/node.rb#16237
+  # source://prism/lib/prism/node.rb#16237
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -38550,50 +38550,50 @@ class Prism::WhenNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#16278
+  # source://prism/lib/prism/node.rb#16278
   sig { override.returns(String) }
   def inspect; end
 
   # def keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#16268
+  # source://prism/lib/prism/node.rb#16268
   sig { returns(String) }
   def keyword; end
 
   # attr_reader keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#16242
+  # source://prism/lib/prism/node.rb#16242
   sig { returns(Prism::Location) }
   def keyword_loc; end
 
   # attr_reader statements: StatementsNode?
   #
-  # source://prism//lib/prism/node.rb#16265
+  # source://prism/lib/prism/node.rb#16265
   sig { returns(T.nilable(Prism::StatementsNode)) }
   def statements; end
 
   # def then_keyword: () -> String?
   #
-  # source://prism//lib/prism/node.rb#16273
+  # source://prism/lib/prism/node.rb#16273
   sig { returns(T.nilable(String)) }
   def then_keyword; end
 
   # attr_reader then_keyword_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#16252
+  # source://prism/lib/prism/node.rb#16252
   sig { returns(T.nilable(Prism::Location)) }
   def then_keyword_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#16283
+  # source://prism/lib/prism/node.rb#16283
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#16288
+    # source://prism/lib/prism/node.rb#16288
     def type; end
   end
 end
@@ -38606,13 +38606,13 @@ end
 #     while foo do bar end
 #     ^^^^^^^^^^^^^^^^^^^^
 #
-# source://prism//lib/prism/node.rb#16311
+# source://prism/lib/prism/node.rb#16311
 class Prism::WhileNode < ::Prism::Node
   # Initialize a new WhileNode node.
   #
   # @return [WhileNode] a new instance of WhileNode
   #
-  # source://prism//lib/prism/node.rb#16313
+  # source://prism/lib/prism/node.rb#16313
   sig do
     params(
       source: Prism::Source,
@@ -38630,12 +38630,12 @@ class Prism::WhileNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#16418
+  # source://prism/lib/prism/node.rb#16418
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#16325
+  # source://prism/lib/prism/node.rb#16325
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
@@ -38643,43 +38643,43 @@ class Prism::WhileNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#16361
+  # source://prism/lib/prism/node.rb#16361
   sig { returns(T::Boolean) }
   def begin_modifier?; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#16330
+  # source://prism/lib/prism/node.rb#16330
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String?
   #
-  # source://prism//lib/prism/node.rb#16397
+  # source://prism/lib/prism/node.rb#16397
   sig { returns(T.nilable(String)) }
   def closing; end
 
   # attr_reader closing_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#16373
+  # source://prism/lib/prism/node.rb#16373
   sig { returns(T.nilable(Prism::Location)) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#16343
+  # source://prism/lib/prism/node.rb#16343
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#16335
+  # source://prism/lib/prism/node.rb#16335
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?closing_loc: Location?, ?predicate: Prism::node, ?statements: StatementsNode?) -> WhileNode
   #
-  # source://prism//lib/prism/node.rb#16348
+  # source://prism/lib/prism/node.rb#16348
   sig do
     params(
       node_id: Integer,
@@ -38696,13 +38696,13 @@ class Prism::WhileNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#16330
+  # source://prism/lib/prism/node.rb#16330
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, closing_loc: Location?, predicate: Prism::node, statements: StatementsNode? }
   #
-  # source://prism//lib/prism/node.rb#16356
+  # source://prism/lib/prism/node.rb#16356
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -38711,47 +38711,47 @@ class Prism::WhileNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#16402
+  # source://prism/lib/prism/node.rb#16402
   sig { override.returns(String) }
   def inspect; end
 
   # def keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#16392
+  # source://prism/lib/prism/node.rb#16392
   sig { returns(String) }
   def keyword; end
 
   # attr_reader keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#16366
+  # source://prism/lib/prism/node.rb#16366
   sig { returns(Prism::Location) }
   def keyword_loc; end
 
-  # source://prism//lib/prism/parse_result/newlines.rb#109
+  # source://prism/lib/prism/parse_result/newlines.rb#109
   def newline_flag!(lines); end
 
   # attr_reader predicate: Prism::node
   #
-  # source://prism//lib/prism/node.rb#16386
+  # source://prism/lib/prism/node.rb#16386
   sig { returns(Prism::Node) }
   def predicate; end
 
   # attr_reader statements: StatementsNode?
   #
-  # source://prism//lib/prism/node.rb#16389
+  # source://prism/lib/prism/node.rb#16389
   sig { returns(T.nilable(Prism::StatementsNode)) }
   def statements; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#16407
+  # source://prism/lib/prism/node.rb#16407
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#16412
+    # source://prism/lib/prism/node.rb#16412
     def type; end
   end
 end
@@ -38761,7 +38761,7 @@ end
 #     `foo`
 #     ^^^^^
 #
-# source://prism//lib/prism/node.rb#16432
+# source://prism/lib/prism/node.rb#16432
 class Prism::XStringNode < ::Prism::Node
   include ::Prism::HeredocQuery
 
@@ -38769,7 +38769,7 @@ class Prism::XStringNode < ::Prism::Node
   #
   # @return [XStringNode] a new instance of XStringNode
   #
-  # source://prism//lib/prism/node.rb#16434
+  # source://prism/lib/prism/node.rb#16434
   sig do
     params(
       source: Prism::Source,
@@ -38787,60 +38787,60 @@ class Prism::XStringNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#16544
+  # source://prism/lib/prism/node.rb#16544
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#16446
+  # source://prism/lib/prism/node.rb#16446
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#16451
+  # source://prism/lib/prism/node.rb#16451
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def closing: () -> String
   #
-  # source://prism//lib/prism/node.rb#16523
+  # source://prism/lib/prism/node.rb#16523
   sig { returns(String) }
   def closing; end
 
   # attr_reader closing_loc: Location
   #
-  # source://prism//lib/prism/node.rb#16503
+  # source://prism/lib/prism/node.rb#16503
   sig { returns(Prism::Location) }
   def closing_loc; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#16461
+  # source://prism/lib/prism/node.rb#16461
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#16456
+  # source://prism/lib/prism/node.rb#16456
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def content: () -> String
   #
-  # source://prism//lib/prism/node.rb#16518
+  # source://prism/lib/prism/node.rb#16518
   sig { returns(String) }
   def content; end
 
   # attr_reader content_loc: Location
   #
-  # source://prism//lib/prism/node.rb#16496
+  # source://prism/lib/prism/node.rb#16496
   sig { returns(Prism::Location) }
   def content_loc; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?content_loc: Location, ?closing_loc: Location, ?unescaped: String) -> XStringNode
   #
-  # source://prism//lib/prism/node.rb#16466
+  # source://prism/lib/prism/node.rb#16466
   sig do
     params(
       node_id: Integer,
@@ -38857,13 +38857,13 @@ class Prism::XStringNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#16451
+  # source://prism/lib/prism/node.rb#16451
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String }
   #
-  # source://prism//lib/prism/node.rb#16474
+  # source://prism/lib/prism/node.rb#16474
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -38874,7 +38874,7 @@ class Prism::XStringNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#16484
+  # source://prism/lib/prism/node.rb#16484
   sig { returns(T::Boolean) }
   def forced_binary_encoding?; end
 
@@ -38882,7 +38882,7 @@ class Prism::XStringNode < ::Prism::Node
   #
   # @return [Boolean]
   #
-  # source://prism//lib/prism/node.rb#16479
+  # source://prism/lib/prism/node.rb#16479
   sig { returns(T::Boolean) }
   def forced_utf8_encoding?; end
 
@@ -38891,45 +38891,45 @@ class Prism::XStringNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#16528
+  # source://prism/lib/prism/node.rb#16528
   sig { override.returns(String) }
   def inspect; end
 
   # def opening: () -> String
   #
-  # source://prism//lib/prism/node.rb#16513
+  # source://prism/lib/prism/node.rb#16513
   sig { returns(String) }
   def opening; end
 
   # attr_reader opening_loc: Location
   #
-  # source://prism//lib/prism/node.rb#16489
+  # source://prism/lib/prism/node.rb#16489
   sig { returns(Prism::Location) }
   def opening_loc; end
 
   # Occasionally it's helpful to treat a string as if it were interpolated so
   # that there's a consistent interface for working with strings.
   #
-  # source://prism//lib/prism/node_ext.rb#90
+  # source://prism/lib/prism/node_ext.rb#90
   sig { returns(Prism::InterpolatedXStringNode) }
   def to_interpolated; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#16533
+  # source://prism/lib/prism/node.rb#16533
   sig { override.returns(Symbol) }
   def type; end
 
   # attr_reader unescaped: String
   #
-  # source://prism//lib/prism/node.rb#16510
+  # source://prism/lib/prism/node.rb#16510
   sig { returns(String) }
   def unescaped; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#16538
+    # source://prism/lib/prism/node.rb#16538
     def type; end
   end
 end
@@ -38939,13 +38939,13 @@ end
 #     yield 1
 #     ^^^^^^^
 #
-# source://prism//lib/prism/node.rb#16558
+# source://prism/lib/prism/node.rb#16558
 class Prism::YieldNode < ::Prism::Node
   # Initialize a new YieldNode node.
   #
   # @return [YieldNode] a new instance of YieldNode
   #
-  # source://prism//lib/prism/node.rb#16560
+  # source://prism/lib/prism/node.rb#16560
   sig do
     params(
       source: Prism::Source,
@@ -38963,42 +38963,42 @@ class Prism::YieldNode < ::Prism::Node
   # Implements case-equality for the node. This is effectively == but without
   # comparing the value of locations. Locations are checked only for presence.
   #
-  # source://prism//lib/prism/node.rb#16674
+  # source://prism/lib/prism/node.rb#16674
   def ===(other); end
 
   # def accept: (Visitor visitor) -> void
   #
-  # source://prism//lib/prism/node.rb#16572
+  # source://prism/lib/prism/node.rb#16572
   sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
   def accept(visitor); end
 
   # attr_reader arguments: ArgumentsNode?
   #
-  # source://prism//lib/prism/node.rb#16627
+  # source://prism/lib/prism/node.rb#16627
   sig { returns(T.nilable(Prism::ArgumentsNode)) }
   def arguments; end
 
   # def child_nodes: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#16577
+  # source://prism/lib/prism/node.rb#16577
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def child_nodes; end
 
   # def comment_targets: () -> Array[Node | Location]
   #
-  # source://prism//lib/prism/node.rb#16589
+  # source://prism/lib/prism/node.rb#16589
   sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
   def comment_targets; end
 
   # def compact_child_nodes: () -> Array[Node]
   #
-  # source://prism//lib/prism/node.rb#16582
+  # source://prism/lib/prism/node.rb#16582
   sig { override.returns(T::Array[Prism::Node]) }
   def compact_child_nodes; end
 
   # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?lparen_loc: Location?, ?arguments: ArgumentsNode?, ?rparen_loc: Location?) -> YieldNode
   #
-  # source://prism//lib/prism/node.rb#16594
+  # source://prism/lib/prism/node.rb#16594
   sig do
     params(
       node_id: Integer,
@@ -39015,13 +39015,13 @@ class Prism::YieldNode < ::Prism::Node
   # def child_nodes: () -> Array[nil | Node]
   # def deconstruct: () -> Array[nil | Node]
   #
-  # source://prism//lib/prism/node.rb#16577
+  # source://prism/lib/prism/node.rb#16577
   sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
   def deconstruct; end
 
   # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, lparen_loc: Location?, arguments: ArgumentsNode?, rparen_loc: Location? }
   #
-  # source://prism//lib/prism/node.rb#16602
+  # source://prism/lib/prism/node.rb#16602
   sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
   def deconstruct_keys(keys); end
 
@@ -39030,56 +39030,56 @@ class Prism::YieldNode < ::Prism::Node
 
   # def inspect -> String
   #
-  # source://prism//lib/prism/node.rb#16658
+  # source://prism/lib/prism/node.rb#16658
   sig { override.returns(String) }
   def inspect; end
 
   # def keyword: () -> String
   #
-  # source://prism//lib/prism/node.rb#16643
+  # source://prism/lib/prism/node.rb#16643
   sig { returns(String) }
   def keyword; end
 
   # attr_reader keyword_loc: Location
   #
-  # source://prism//lib/prism/node.rb#16607
+  # source://prism/lib/prism/node.rb#16607
   sig { returns(Prism::Location) }
   def keyword_loc; end
 
   # def lparen: () -> String?
   #
-  # source://prism//lib/prism/node.rb#16648
+  # source://prism/lib/prism/node.rb#16648
   sig { returns(T.nilable(String)) }
   def lparen; end
 
   # attr_reader lparen_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#16614
+  # source://prism/lib/prism/node.rb#16614
   sig { returns(T.nilable(Prism::Location)) }
   def lparen_loc; end
 
   # def rparen: () -> String?
   #
-  # source://prism//lib/prism/node.rb#16653
+  # source://prism/lib/prism/node.rb#16653
   sig { returns(T.nilable(String)) }
   def rparen; end
 
   # attr_reader rparen_loc: Location?
   #
-  # source://prism//lib/prism/node.rb#16630
+  # source://prism/lib/prism/node.rb#16630
   sig { returns(T.nilable(Prism::Location)) }
   def rparen_loc; end
 
   # Return a symbol representation of this node type. See `Node#type`.
   #
-  # source://prism//lib/prism/node.rb#16663
+  # source://prism/lib/prism/node.rb#16663
   sig { override.returns(Symbol) }
   def type; end
 
   class << self
     # Return a symbol representation of this node type. See `Node::type`.
     #
-    # source://prism//lib/prism/node.rb#16668
+    # source://prism/lib/prism/node.rb#16668
     def type; end
   end
 end
diff --git a/sorbet/rbi/gems/rbs@3.6.1.rbi b/sorbet/rbi/gems/rbs@3.6.1.rbi
new file mode 100644
index 000000000..29f1291be
--- /dev/null
+++ b/sorbet/rbi/gems/rbs@3.6.1.rbi
@@ -0,0 +1,6857 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `rbs` gem.
+# Please instead update this file by running `bin/tapioca gem rbs`.
+
+
+# source://rbs/lib/rbs/namespace.rb#120
+module Kernel
+  # source://rbs/lib/rbs/namespace.rb#121
+  def Namespace(name); end
+
+  # source://rbs/lib/rbs/type_name.rb#93
+  def TypeName(string); end
+end
+
+# source://rbs/lib/rbs/version.rb#3
+module RBS
+  class << self
+    # source://rbs/lib/rbs.rb#68
+    def logger; end
+
+    # Returns the value of attribute logger_level.
+    #
+    # source://rbs/lib/rbs.rb#65
+    def logger_level; end
+
+    # source://rbs/lib/rbs.rb#77
+    def logger_level=(level); end
+
+    # Returns the value of attribute logger_output.
+    #
+    # source://rbs/lib/rbs.rb#66
+    def logger_output; end
+
+    # source://rbs/lib/rbs.rb#72
+    def logger_output=(val); end
+
+    # source://rbs/lib/rbs.rb#82
+    def print_warning; end
+  end
+end
+
+# source://rbs/lib/rbs/ast/type_param.rb#4
+module RBS::AST; end
+
+# source://rbs/lib/rbs/ast/annotation.rb#5
+class RBS::AST::Annotation
+  # @return [Annotation] a new instance of Annotation
+  #
+  # source://rbs/lib/rbs/ast/annotation.rb#9
+  def initialize(string:, location:); end
+
+  # source://rbs/lib/rbs/ast/annotation.rb#14
+  def ==(other); end
+
+  # source://rbs/lib/rbs/ast/annotation.rb#14
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/ast/annotation.rb#20
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/annotation.rb#7
+  def location; end
+
+  # Returns the value of attribute string.
+  #
+  # source://rbs/lib/rbs/ast/annotation.rb#6
+  def string; end
+
+  # source://rbs/lib/rbs/ast/annotation.rb#24
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/comment.rb#5
+class RBS::AST::Comment
+  # @return [Comment] a new instance of Comment
+  #
+  # source://rbs/lib/rbs/ast/comment.rb#9
+  def initialize(string:, location:); end
+
+  # source://rbs/lib/rbs/ast/comment.rb#14
+  def ==(other); end
+
+  # source://rbs/lib/rbs/ast/comment.rb#14
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/ast/comment.rb#20
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/comment.rb#7
+  def location; end
+
+  # Returns the value of attribute string.
+  #
+  # source://rbs/lib/rbs/ast/comment.rb#6
+  def string; end
+
+  # source://rbs/lib/rbs/ast/comment.rb#24
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/declarations.rb#5
+module RBS::AST::Declarations; end
+
+# source://rbs/lib/rbs/ast/declarations.rb#419
+class RBS::AST::Declarations::AliasDecl < ::RBS::AST::Declarations::Base
+  # @return [AliasDecl] a new instance of AliasDecl
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#422
+  def initialize(new_name:, old_name:, location:, comment:); end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#429
+  def ==(other); end
+
+  # Returns the value of attribute comment.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#420
+  def comment; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#429
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#437
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#420
+  def location; end
+
+  # Returns the value of attribute new_name.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#420
+  def new_name; end
+
+  # Returns the value of attribute old_name.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#420
+  def old_name; end
+end
+
+# source://rbs/lib/rbs/ast/declarations.rb#6
+class RBS::AST::Declarations::Base; end
+
+# source://rbs/lib/rbs/ast/declarations.rb#55
+class RBS::AST::Declarations::Class < ::RBS::AST::Declarations::Base
+  include ::RBS::AST::Declarations::NestedDeclarationHelper
+  include ::RBS::AST::Declarations::MixinHelper
+
+  # @return [Class] a new instance of Class
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#97
+  def initialize(name:, type_params:, super_class:, members:, annotations:, location:, comment:); end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#119
+  def ==(other); end
+
+  # Returns the value of attribute annotations.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#93
+  def annotations; end
+
+  # Returns the value of attribute comment.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#95
+  def comment; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#119
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#129
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#94
+  def location; end
+
+  # Returns the value of attribute members.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#91
+  def members; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#89
+  def name; end
+
+  # Returns the value of attribute super_class.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#92
+  def super_class; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#133
+  def to_json(state = T.unsafe(nil)); end
+
+  # Returns the value of attribute type_params.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#90
+  def type_params; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#107
+  def update(name: T.unsafe(nil), type_params: T.unsafe(nil), super_class: T.unsafe(nil), members: T.unsafe(nil), annotations: T.unsafe(nil), location: T.unsafe(nil), comment: T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/declarations.rb#56
+class RBS::AST::Declarations::Class::Super
+  # @return [Super] a new instance of Super
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#61
+  def initialize(name:, args:, location:); end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#67
+  def ==(other); end
+
+  # Returns the value of attribute args.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#58
+  def args; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#67
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#73
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#59
+  def location; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#57
+  def name; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#77
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/declarations.rb#442
+class RBS::AST::Declarations::ClassAlias < ::RBS::AST::Declarations::AliasDecl
+  # source://rbs/lib/rbs/ast/declarations.rb#443
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/declarations.rb#347
+class RBS::AST::Declarations::Constant < ::RBS::AST::Declarations::Base
+  # @return [Constant] a new instance of Constant
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#353
+  def initialize(name:, type:, location:, comment:); end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#360
+  def ==(other); end
+
+  # Returns the value of attribute comment.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#351
+  def comment; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#360
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#368
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#350
+  def location; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#348
+  def name; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#372
+  def to_json(state = T.unsafe(nil)); end
+
+  # Returns the value of attribute type.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#349
+  def type; end
+end
+
+# source://rbs/lib/rbs/ast/declarations.rb#383
+class RBS::AST::Declarations::Global < ::RBS::AST::Declarations::Base
+  # @return [Global] a new instance of Global
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#389
+  def initialize(name:, type:, location:, comment:); end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#396
+  def ==(other); end
+
+  # Returns the value of attribute comment.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#387
+  def comment; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#396
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#404
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#386
+  def location; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#384
+  def name; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#408
+  def to_json(state = T.unsafe(nil)); end
+
+  # Returns the value of attribute type.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#385
+  def type; end
+end
+
+# source://rbs/lib/rbs/ast/declarations.rb#248
+class RBS::AST::Declarations::Interface < ::RBS::AST::Declarations::Base
+  include ::RBS::AST::Declarations::MixinHelper
+
+  # @return [Interface] a new instance of Interface
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#258
+  def initialize(name:, type_params:, members:, annotations:, location:, comment:); end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#278
+  def ==(other); end
+
+  # Returns the value of attribute annotations.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#252
+  def annotations; end
+
+  # Returns the value of attribute comment.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#254
+  def comment; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#278
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#287
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#253
+  def location; end
+
+  # Returns the value of attribute members.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#251
+  def members; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#249
+  def name; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#291
+  def to_json(state = T.unsafe(nil)); end
+
+  # Returns the value of attribute type_params.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#250
+  def type_params; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#267
+  def update(name: T.unsafe(nil), type_params: T.unsafe(nil), members: T.unsafe(nil), annotations: T.unsafe(nil), location: T.unsafe(nil), comment: T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/declarations.rb#35
+module RBS::AST::Declarations::MixinHelper
+  # source://rbs/lib/rbs/ast/declarations.rb#36
+  def each_mixin(&block); end
+end
+
+# source://rbs/lib/rbs/ast/declarations.rb#147
+class RBS::AST::Declarations::Module < ::RBS::AST::Declarations::Base
+  include ::RBS::AST::Declarations::NestedDeclarationHelper
+  include ::RBS::AST::Declarations::MixinHelper
+
+  # @return [Module] a new instance of Module
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#197
+  def initialize(name:, type_params:, members:, self_types:, annotations:, location:, comment:); end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#220
+  def ==(other); end
+
+  # Returns the value of attribute annotations.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#193
+  def annotations; end
+
+  # Returns the value of attribute comment.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#195
+  def comment; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#220
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#230
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#192
+  def location; end
+
+  # Returns the value of attribute members.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#191
+  def members; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#189
+  def name; end
+
+  # Returns the value of attribute self_types.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#194
+  def self_types; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#234
+  def to_json(state = T.unsafe(nil)); end
+
+  # Returns the value of attribute type_params.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#190
+  def type_params; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#207
+  def update(name: T.unsafe(nil), type_params: T.unsafe(nil), members: T.unsafe(nil), self_types: T.unsafe(nil), annotations: T.unsafe(nil), location: T.unsafe(nil), comment: T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/declarations.rb#148
+class RBS::AST::Declarations::Module::Self
+  # @return [Self] a new instance of Self
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#153
+  def initialize(name:, args:, location:); end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#159
+  def ==(other); end
+
+  # Returns the value of attribute args.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#150
+  def args; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#159
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#165
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#151
+  def location; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#149
+  def name; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#169
+  def to_json(state = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#177
+  def to_s; end
+end
+
+# source://rbs/lib/rbs/ast/declarations.rb#454
+class RBS::AST::Declarations::ModuleAlias < ::RBS::AST::Declarations::AliasDecl
+  # source://rbs/lib/rbs/ast/declarations.rb#455
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/declarations.rb#9
+module RBS::AST::Declarations::NestedDeclarationHelper
+  # source://rbs/lib/rbs/ast/declarations.rb#22
+  def each_decl; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#10
+  def each_member; end
+end
+
+# source://rbs/lib/rbs/ast/declarations.rb#304
+class RBS::AST::Declarations::TypeAlias < ::RBS::AST::Declarations::Base
+  # @return [TypeAlias] a new instance of TypeAlias
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#312
+  def initialize(name:, type_params:, type:, annotations:, location:, comment:); end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#321
+  def ==(other); end
+
+  # Returns the value of attribute annotations.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#308
+  def annotations; end
+
+  # Returns the value of attribute comment.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#310
+  def comment; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#321
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#330
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#309
+  def location; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#305
+  def name; end
+
+  # source://rbs/lib/rbs/ast/declarations.rb#334
+  def to_json(state = T.unsafe(nil)); end
+
+  # Returns the value of attribute type.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#307
+  def type; end
+
+  # Returns the value of attribute type_params.
+  #
+  # source://rbs/lib/rbs/ast/declarations.rb#306
+  def type_params; end
+end
+
+# source://rbs/lib/rbs/ast/directives.rb#5
+module RBS::AST::Directives; end
+
+# source://rbs/lib/rbs/ast/directives.rb#6
+class RBS::AST::Directives::Base; end
+
+# source://rbs/lib/rbs/ast/directives.rb#9
+class RBS::AST::Directives::Use < ::RBS::AST::Directives::Base
+  # @return [Use] a new instance of Use
+  #
+  # source://rbs/lib/rbs/ast/directives.rb#31
+  def initialize(clauses:, location:); end
+
+  # Returns the value of attribute clauses.
+  #
+  # source://rbs/lib/rbs/ast/directives.rb#29
+  def clauses; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/directives.rb#29
+  def location; end
+end
+
+# source://rbs/lib/rbs/ast/directives.rb#10
+class RBS::AST::Directives::Use::SingleClause
+  # @return [SingleClause] a new instance of SingleClause
+  #
+  # source://rbs/lib/rbs/ast/directives.rb#13
+  def initialize(type_name:, new_name:, location:); end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/directives.rb#11
+  def location; end
+
+  # Returns the value of attribute new_name.
+  #
+  # source://rbs/lib/rbs/ast/directives.rb#11
+  def new_name; end
+
+  # Returns the value of attribute type_name.
+  #
+  # source://rbs/lib/rbs/ast/directives.rb#11
+  def type_name; end
+end
+
+# source://rbs/lib/rbs/ast/directives.rb#20
+class RBS::AST::Directives::Use::WildcardClause
+  # @return [WildcardClause] a new instance of WildcardClause
+  #
+  # source://rbs/lib/rbs/ast/directives.rb#23
+  def initialize(namespace:, location:); end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/directives.rb#21
+  def location; end
+
+  # Returns the value of attribute namespace.
+  #
+  # source://rbs/lib/rbs/ast/directives.rb#21
+  def namespace; end
+end
+
+# source://rbs/lib/rbs/ast/members.rb#5
+module RBS::AST::Members; end
+
+# source://rbs/lib/rbs/ast/members.rb#397
+class RBS::AST::Members::Alias < ::RBS::AST::Members::Base
+  # @return [Alias] a new instance of Alias
+  #
+  # source://rbs/lib/rbs/ast/members.rb#405
+  def initialize(new_name:, old_name:, kind:, annotations:, location:, comment:); end
+
+  # source://rbs/lib/rbs/ast/members.rb#414
+  def ==(other); end
+
+  # Returns the value of attribute annotations.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#401
+  def annotations; end
+
+  # Returns the value of attribute comment.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#403
+  def comment; end
+
+  # source://rbs/lib/rbs/ast/members.rb#414
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/ast/members.rb#423
+  def hash; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/ast/members.rb#439
+  def instance?; end
+
+  # Returns the value of attribute kind.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#400
+  def kind; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#402
+  def location; end
+
+  # Returns the value of attribute new_name.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#398
+  def new_name; end
+
+  # Returns the value of attribute old_name.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#399
+  def old_name; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/ast/members.rb#443
+  def singleton?; end
+
+  # source://rbs/lib/rbs/ast/members.rb#427
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/members.rb#327
+class RBS::AST::Members::AttrAccessor < ::RBS::AST::Members::Base
+  include ::RBS::AST::Members::Attribute
+
+  # source://rbs/lib/rbs/ast/members.rb#330
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/members.rb#309
+class RBS::AST::Members::AttrReader < ::RBS::AST::Members::Base
+  include ::RBS::AST::Members::Attribute
+
+  # source://rbs/lib/rbs/ast/members.rb#312
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/members.rb#345
+class RBS::AST::Members::AttrWriter < ::RBS::AST::Members::Base
+  include ::RBS::AST::Members::Attribute
+
+  # source://rbs/lib/rbs/ast/members.rb#348
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/members.rb#258
+module RBS::AST::Members::Attribute
+  # source://rbs/lib/rbs/ast/members.rb#268
+  def initialize(name:, type:, ivar_name:, kind:, annotations:, location:, comment:, visibility: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/ast/members.rb#279
+  def ==(other); end
+
+  # Returns the value of attribute annotations.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#263
+  def annotations; end
+
+  # Returns the value of attribute comment.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#265
+  def comment; end
+
+  # source://rbs/lib/rbs/ast/members.rb#279
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/ast/members.rb#290
+  def hash; end
+
+  # Returns the value of attribute ivar_name.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#262
+  def ivar_name; end
+
+  # Returns the value of attribute kind.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#261
+  def kind; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#264
+  def location; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#259
+  def name; end
+
+  # Returns the value of attribute type.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#260
+  def type; end
+
+  # source://rbs/lib/rbs/ast/members.rb#294
+  def update(name: T.unsafe(nil), type: T.unsafe(nil), ivar_name: T.unsafe(nil), kind: T.unsafe(nil), annotations: T.unsafe(nil), location: T.unsafe(nil), comment: T.unsafe(nil), visibility: T.unsafe(nil)); end
+
+  # Returns the value of attribute visibility.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#266
+  def visibility; end
+end
+
+# source://rbs/lib/rbs/ast/members.rb#6
+class RBS::AST::Members::Base; end
+
+# source://rbs/lib/rbs/ast/members.rb#157
+class RBS::AST::Members::ClassInstanceVariable < ::RBS::AST::Members::Base
+  include ::RBS::AST::Members::Var
+
+  # source://rbs/lib/rbs/ast/members.rb#160
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/members.rb#171
+class RBS::AST::Members::ClassVariable < ::RBS::AST::Members::Base
+  include ::RBS::AST::Members::Var
+
+  # source://rbs/lib/rbs/ast/members.rb#174
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/members.rb#228
+class RBS::AST::Members::Extend < ::RBS::AST::Members::Base
+  include ::RBS::AST::Members::Mixin
+
+  # source://rbs/lib/rbs/ast/members.rb#231
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/members.rb#213
+class RBS::AST::Members::Include < ::RBS::AST::Members::Base
+  include ::RBS::AST::Members::Mixin
+
+  # source://rbs/lib/rbs/ast/members.rb#216
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/members.rb#143
+class RBS::AST::Members::InstanceVariable < ::RBS::AST::Members::Base
+  include ::RBS::AST::Members::Var
+
+  # source://rbs/lib/rbs/ast/members.rb#146
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/members.rb#363
+module RBS::AST::Members::LocationOnly
+  # source://rbs/lib/rbs/ast/members.rb#366
+  def initialize(location:); end
+
+  # source://rbs/lib/rbs/ast/members.rb#370
+  def ==(other); end
+
+  # source://rbs/lib/rbs/ast/members.rb#370
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/ast/members.rb#376
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#364
+  def location; end
+end
+
+# source://rbs/lib/rbs/ast/members.rb#9
+class RBS::AST::Members::MethodDefinition < ::RBS::AST::Members::Base
+  # @return [MethodDefinition] a new instance of MethodDefinition
+  #
+  # source://rbs/lib/rbs/ast/members.rb#53
+  def initialize(name:, kind:, overloads:, annotations:, location:, comment:, overloading:, visibility:); end
+
+  # source://rbs/lib/rbs/ast/members.rb#64
+  def ==(other); end
+
+  # Returns the value of attribute annotations.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#47
+  def annotations; end
+
+  # Returns the value of attribute comment.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#49
+  def comment; end
+
+  # source://rbs/lib/rbs/ast/members.rb#64
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/ast/members.rb#75
+  def hash; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/ast/members.rb#79
+  def instance?; end
+
+  # Returns the value of attribute kind.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#45
+  def kind; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#48
+  def location; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#44
+  def name; end
+
+  # Returns the value of attribute overloading.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#50
+  def overloading; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/ast/members.rb#87
+  def overloading?; end
+
+  # Returns the value of attribute overloads.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#46
+  def overloads; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/ast/members.rb#83
+  def singleton?; end
+
+  # source://rbs/lib/rbs/ast/members.rb#104
+  def to_json(state = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/ast/members.rb#91
+  def update(name: T.unsafe(nil), kind: T.unsafe(nil), overloads: T.unsafe(nil), annotations: T.unsafe(nil), location: T.unsafe(nil), comment: T.unsafe(nil), overloading: T.unsafe(nil), visibility: T.unsafe(nil)); end
+
+  # Returns the value of attribute visibility.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#51
+  def visibility; end
+end
+
+# source://rbs/lib/rbs/ast/members.rb#10
+class RBS::AST::Members::MethodDefinition::Overload
+  # @return [Overload] a new instance of Overload
+  #
+  # source://rbs/lib/rbs/ast/members.rb#13
+  def initialize(method_type:, annotations:); end
+
+  # source://rbs/lib/rbs/ast/members.rb#18
+  def ==(other); end
+
+  # Returns the value of attribute annotations.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#11
+  def annotations; end
+
+  # source://rbs/lib/rbs/ast/members.rb#18
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/ast/members.rb#22
+  def hash; end
+
+  # Returns the value of attribute method_type.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#11
+  def method_type; end
+
+  # source://rbs/lib/rbs/ast/members.rb#32
+  def sub(subst); end
+
+  # source://rbs/lib/rbs/ast/members.rb#36
+  def to_json(state = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/ast/members.rb#28
+  def update(annotations: T.unsafe(nil), method_type: T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/members.rb#185
+module RBS::AST::Members::Mixin
+  # source://rbs/lib/rbs/ast/members.rb#192
+  def initialize(name:, args:, annotations:, location:, comment:); end
+
+  # source://rbs/lib/rbs/ast/members.rb#200
+  def ==(other); end
+
+  # Returns the value of attribute annotations.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#188
+  def annotations; end
+
+  # Returns the value of attribute args.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#187
+  def args; end
+
+  # Returns the value of attribute comment.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#190
+  def comment; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/ast/members.rb#204
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/ast/members.rb#208
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#189
+  def location; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#186
+  def name; end
+end
+
+# source://rbs/lib/rbs/ast/members.rb#243
+class RBS::AST::Members::Prepend < ::RBS::AST::Members::Base
+  include ::RBS::AST::Members::Mixin
+
+  # source://rbs/lib/rbs/ast/members.rb#246
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/members.rb#389
+class RBS::AST::Members::Private < ::RBS::AST::Members::Base
+  include ::RBS::AST::Members::LocationOnly
+
+  # source://rbs/lib/rbs/ast/members.rb#392
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/members.rb#381
+class RBS::AST::Members::Public < ::RBS::AST::Members::Base
+  include ::RBS::AST::Members::LocationOnly
+
+  # source://rbs/lib/rbs/ast/members.rb#384
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/ast/members.rb#119
+module RBS::AST::Members::Var
+  # source://rbs/lib/rbs/ast/members.rb#125
+  def initialize(name:, type:, location:, comment:); end
+
+  # source://rbs/lib/rbs/ast/members.rb#132
+  def ==(other); end
+
+  # Returns the value of attribute comment.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#123
+  def comment; end
+
+  # source://rbs/lib/rbs/ast/members.rb#132
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/ast/members.rb#138
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#122
+  def location; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#120
+  def name; end
+
+  # Returns the value of attribute type.
+  #
+  # source://rbs/lib/rbs/ast/members.rb#121
+  def type; end
+end
+
+# source://rbs/lib/rbs/ast/type_param.rb#5
+class RBS::AST::TypeParam
+  # @return [TypeParam] a new instance of TypeParam
+  #
+  # source://rbs/lib/rbs/ast/type_param.rb#8
+  def initialize(name:, variance:, upper_bound:, location:, default_type: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/ast/type_param.rb#33
+  def ==(other); end
+
+  # Returns the value of attribute default_type.
+  #
+  # source://rbs/lib/rbs/ast/type_param.rb#6
+  def default_type; end
+
+  # source://rbs/lib/rbs/ast/type_param.rb#33
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/ast/type_param.rb#44
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/ast/type_param.rb#6
+  def location; end
+
+  # source://rbs/lib/rbs/ast/type_param.rb#69
+  def map_type(&block); end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/ast/type_param.rb#6
+  def name; end
+
+  # source://rbs/lib/rbs/ast/type_param.rb#59
+  def rename(name); end
+
+  # source://rbs/lib/rbs/ast/type_param.rb#48
+  def to_json(state = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/ast/type_param.rb#127
+  def to_s; end
+
+  # source://rbs/lib/rbs/ast/type_param.rb#24
+  def unchecked!(value = T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/ast/type_param.rb#29
+  def unchecked?; end
+
+  # source://rbs/lib/rbs/ast/type_param.rb#17
+  def upper_bound; end
+
+  # Returns the value of attribute upper_bound_type.
+  #
+  # source://rbs/lib/rbs/ast/type_param.rb#6
+  def upper_bound_type; end
+
+  # Returns the value of attribute variance.
+  #
+  # source://rbs/lib/rbs/ast/type_param.rb#6
+  def variance; end
+
+  class << self
+    # source://rbs/lib/rbs/ast/type_param.rb#156
+    def application(params, args); end
+
+    # source://rbs/lib/rbs/ast/type_param.rb#188
+    def normalize_args(params, args); end
+
+    # source://rbs/lib/rbs/ast/type_param.rb#109
+    def rename(params, new_names:); end
+
+    # source://rbs/lib/rbs/ast/type_param.rb#87
+    def resolve_variables(params); end
+
+    # source://rbs/lib/rbs/ast/type_param.rb#97
+    def subst_var(vars, type); end
+
+    # source://rbs/lib/rbs/ast/type_param.rb#209
+    def validate(type_params); end
+  end
+end
+
+# The Visitor class implements the Visitor pattern for traversing the RBS Abstract Syntax Tree (AST).
+#
+# It provides methods to visit each type of node in the AST, allowing for custom processing of each node type.
+#
+# This class is designed to be subclassed, with specific visit methods overridden to implement custom behavior for
+# different node types.
+#
+# Example usage:
+#
+# ~~~rb
+# class MyVisitor < RBS::AST::Visitor
+#   def visit_declaration_class(node)
+#     puts "Visiting class: #{node.name}"
+#
+#     super # call `super` to run the default visiting behavior
+#   end
+# end
+#
+# visitor = MyVisitor.new
+# visitor.visit(ast_node)
+# ~~~
+#
+# source://rbs/lib/rbs/ast/visitor.rb#26
+class RBS::AST::Visitor
+  # source://rbs/lib/rbs/ast/visitor.rb#27
+  def visit(node); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#70
+  def visit_all(nodes); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#79
+  def visit_declaration_class(node); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#87
+  def visit_declaration_constant(node); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#76
+  def visit_declaration_global(node); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#93
+  def visit_declaration_interface(node); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#83
+  def visit_declaration_module(node); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#90
+  def visit_declaration_type_alias(node); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#97
+  def visit_member_alias(node); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#124
+  def visit_member_attr_accessor(node); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#118
+  def visit_member_attr_reader(node); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#121
+  def visit_member_attr_writer(node); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#100
+  def visit_member_class_instance_variable(node); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#103
+  def visit_member_class_variable(node); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#133
+  def visit_member_extend(node); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#127
+  def visit_member_include(node); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#106
+  def visit_member_instance_variable(node); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#115
+  def visit_member_method_definition(node); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#130
+  def visit_member_prepend(node); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#109
+  def visit_member_private(node); end
+
+  # source://rbs/lib/rbs/ast/visitor.rb#112
+  def visit_member_public(node); end
+end
+
+# source://rbs/lib/rbs/ancestor_graph.rb#4
+class RBS::AncestorGraph
+  # @return [AncestorGraph] a new instance of AncestorGraph
+  #
+  # source://rbs/lib/rbs/ancestor_graph.rb#13
+  def initialize(env:, ancestor_builder: T.unsafe(nil)); end
+
+  # Returns the value of attribute ancestor_builder.
+  #
+  # source://rbs/lib/rbs/ancestor_graph.rb#9
+  def ancestor_builder; end
+
+  # source://rbs/lib/rbs/ancestor_graph.rb#19
+  def build; end
+
+  # source://rbs/lib/rbs/ancestor_graph.rb#32
+  def build_ancestors(node, ancestors); end
+
+  # Returns the value of attribute children.
+  #
+  # source://rbs/lib/rbs/ancestor_graph.rb#11
+  def children; end
+
+  # source://rbs/lib/rbs/ancestor_graph.rb#64
+  def each_ancestor(node, yielded: T.unsafe(nil), &block); end
+
+  # source://rbs/lib/rbs/ancestor_graph.rb#56
+  def each_child(node, &block); end
+
+  # source://rbs/lib/rbs/ancestor_graph.rb#78
+  def each_descendant(node, yielded: T.unsafe(nil), &block); end
+
+  # source://rbs/lib/rbs/ancestor_graph.rb#48
+  def each_parent(node, &block); end
+
+  # Returns the value of attribute env.
+  #
+  # source://rbs/lib/rbs/ancestor_graph.rb#8
+  def env; end
+
+  # Returns the value of attribute parents.
+  #
+  # source://rbs/lib/rbs/ancestor_graph.rb#10
+  def parents; end
+
+  # source://rbs/lib/rbs/ancestor_graph.rb#43
+  def register(parent:, child:); end
+end
+
+# source://rbs/lib/rbs/ancestor_graph.rb#5
+class RBS::AncestorGraph::InstanceNode < ::Struct
+  def type_name; end
+  def type_name=(_); end
+
+  class << self
+    def [](*_arg0); end
+    def inspect; end
+    def keyword_init?; end
+    def members; end
+    def new(*_arg0); end
+  end
+end
+
+# source://rbs/lib/rbs/ancestor_graph.rb#6
+class RBS::AncestorGraph::SingletonNode < ::Struct
+  def type_name; end
+  def type_name=(_); end
+
+  class << self
+    def [](*_arg0); end
+    def inspect; end
+    def keyword_init?; end
+    def members; end
+    def new(*_arg0); end
+  end
+end
+
+# source://rbs/lib/rbs/errors.rb#19
+class RBS::BaseError < ::StandardError; end
+
+# source://rbs/lib/rbs/buffer.rb#4
+class RBS::Buffer
+  # @return [Buffer] a new instance of Buffer
+  #
+  # source://rbs/lib/rbs/buffer.rb#8
+  def initialize(name:, content:); end
+
+  # Returns the value of attribute content.
+  #
+  # source://rbs/lib/rbs/buffer.rb#6
+  def content; end
+
+  # source://rbs/lib/rbs/buffer.rb#63
+  def inspect; end
+
+  # source://rbs/lib/rbs/buffer.rb#59
+  def last_position; end
+
+  # source://rbs/lib/rbs/buffer.rb#13
+  def lines; end
+
+  # source://rbs/lib/rbs/buffer.rb#49
+  def loc_to_pos(loc); end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/buffer.rb#5
+  def name; end
+
+  # source://rbs/lib/rbs/buffer.rb#37
+  def pos_to_loc(pos); end
+
+  # source://rbs/lib/rbs/buffer.rb#17
+  def ranges; end
+end
+
+# source://rbs/lib/rbs/builtin_names.rb#4
+module RBS::BuiltinNames; end
+
+# source://rbs/lib/rbs/builtin_names.rb#45
+RBS::BuiltinNames::Array = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/builtin_names.rb#37
+RBS::BuiltinNames::BasicObject = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/builtin_names.rb#43
+RBS::BuiltinNames::Class = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/builtin_names.rb#41
+RBS::BuiltinNames::Comparable = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/builtin_names.rb#42
+RBS::BuiltinNames::Enumerable = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/builtin_names.rb#48
+RBS::BuiltinNames::Enumerator = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/builtin_names.rb#55
+RBS::BuiltinNames::FalseClass = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/builtin_names.rb#52
+RBS::BuiltinNames::Float = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/builtin_names.rb#46
+RBS::BuiltinNames::Hash = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/builtin_names.rb#51
+RBS::BuiltinNames::Integer = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/builtin_names.rb#39
+RBS::BuiltinNames::Kernel = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/builtin_names.rb#44
+RBS::BuiltinNames::Module = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/builtin_names.rb#5
+class RBS::BuiltinNames::Name
+  # @return [Name] a new instance of Name
+  #
+  # source://rbs/lib/rbs/builtin_names.rb#8
+  def initialize(name:); end
+
+  # source://rbs/lib/rbs/builtin_names.rb#16
+  def instance_type(*args); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/builtin_names.rb#20
+  def instance_type?(type); end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/builtin_names.rb#6
+  def name; end
+
+  # source://rbs/lib/rbs/builtin_names.rb#24
+  def singleton_type; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/builtin_names.rb#28
+  def singleton_type?(type); end
+
+  # source://rbs/lib/rbs/builtin_names.rb#12
+  def to_s; end
+
+  class << self
+    # source://rbs/lib/rbs/builtin_names.rb#32
+    def define(name, namespace: T.unsafe(nil)); end
+  end
+end
+
+# source://rbs/lib/rbs/builtin_names.rb#56
+RBS::BuiltinNames::Numeric = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/builtin_names.rb#38
+RBS::BuiltinNames::Object = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/builtin_names.rb#47
+RBS::BuiltinNames::Range = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/builtin_names.rb#53
+RBS::BuiltinNames::Regexp = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/builtin_names.rb#49
+RBS::BuiltinNames::Set = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/builtin_names.rb#40
+RBS::BuiltinNames::String = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/builtin_names.rb#50
+RBS::BuiltinNames::Symbol = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/builtin_names.rb#54
+RBS::BuiltinNames::TrueClass = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# source://rbs/lib/rbs/cli/colored_io.rb#4
+class RBS::CLI; end
+
+# source://rbs/lib/rbs/cli/colored_io.rb#5
+class RBS::CLI::ColoredIO
+  # @return [ColoredIO] a new instance of ColoredIO
+  #
+  # source://rbs/lib/rbs/cli/colored_io.rb#8
+  def initialize(stdout:); end
+
+  # source://rbs/lib/rbs/cli/colored_io.rb#28
+  def puts(*_arg0, **_arg1, &_arg2); end
+
+  # source://rbs/lib/rbs/cli/colored_io.rb#20
+  def puts_green(string); end
+
+  # source://rbs/lib/rbs/cli/colored_io.rb#12
+  def puts_red(string); end
+
+  # Returns the value of attribute stdout.
+  #
+  # source://rbs/lib/rbs/cli/colored_io.rb#6
+  def stdout; end
+
+  private
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/cli/colored_io.rb#43
+  def are_colors_disabled?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/cli/colored_io.rb#39
+  def are_colors_supported?; end
+
+  # https://github.com/rubygems/rubygems/blob/ed65279100234a17d65d71fe26de5083984ac5b8/bundler/lib/bundler/vendor/thor/lib/thor/shell/color.rb#L99-L109
+  #
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/cli/colored_io.rb#35
+  def can_display_colors?; end
+end
+
+# source://rbs/lib/rbs/collection/sources/base.rb#4
+module RBS::Collection; end
+
+# source://rbs/lib/rbs/collection/cleaner.rb#5
+class RBS::Collection::Cleaner
+  # @return [Cleaner] a new instance of Cleaner
+  #
+  # source://rbs/lib/rbs/collection/cleaner.rb#8
+  def initialize(lockfile_path:); end
+
+  # source://rbs/lib/rbs/collection/cleaner.rb#12
+  def clean; end
+
+  # Returns the value of attribute lock.
+  #
+  # source://rbs/lib/rbs/collection/cleaner.rb#6
+  def lock; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/collection/cleaner.rb#30
+  def needed?(gem_name, version); end
+end
+
+# This class represent the configuration file.
+#
+# source://rbs/lib/rbs/collection/config.rb#7
+class RBS::Collection::Config
+  # @return [Config] a new instance of Config
+  #
+  # source://rbs/lib/rbs/collection/config.rb#49
+  def initialize(data, config_path:); end
+
+  # Returns the value of attribute config_path.
+  #
+  # source://rbs/lib/rbs/collection/config.rb#19
+  def config_path; end
+
+  # Returns the value of attribute data.
+  #
+  # source://rbs/lib/rbs/collection/config.rb#19
+  def data; end
+
+  # source://rbs/lib/rbs/collection/config.rb#54
+  def gem(gem_name); end
+
+  # source://rbs/lib/rbs/collection/config.rb#74
+  def gems; end
+
+  # source://rbs/lib/rbs/collection/config.rb#58
+  def repo_path; end
+
+  # source://rbs/lib/rbs/collection/config.rb#62
+  def repo_path_data; end
+
+  # source://rbs/lib/rbs/collection/config.rb#66
+  def sources; end
+
+  class << self
+    # source://rbs/lib/rbs/collection/config.rb#21
+    def find_config_path; end
+
+    # source://rbs/lib/rbs/collection/config.rb#41
+    def from_path(path); end
+
+    # Generate a rbs lockfile from Gemfile.lock to `config_path`.
+    # If `with_lockfile` is true, it respects existing rbs lockfile.
+    #
+    # source://rbs/lib/rbs/collection/config.rb#34
+    def generate_lockfile(config_path:, definition:, with_lockfile: T.unsafe(nil)); end
+
+    # source://rbs/lib/rbs/collection/config.rb#45
+    def to_lockfile_path(config_path); end
+  end
+end
+
+# source://rbs/lib/rbs/collection/config.rb#8
+class RBS::Collection::Config::CollectionNotAvailable < ::StandardError
+  # @return [CollectionNotAvailable] a new instance of CollectionNotAvailable
+  #
+  # source://rbs/lib/rbs/collection/config.rb#9
+  def initialize; end
+end
+
+# source://rbs/lib/rbs/collection/config/lockfile.rb#6
+class RBS::Collection::Config::Lockfile
+  # @return [Lockfile] a new instance of Lockfile
+  #
+  # source://rbs/lib/rbs/collection/config/lockfile.rb#9
+  def initialize(lockfile_path:, path:, gemfile_lock_path:); end
+
+  # @raise [CollectionNotAvailable]
+  #
+  # source://rbs/lib/rbs/collection/config/lockfile.rb#73
+  def check_rbs_availability!; end
+
+  # source://rbs/lib/rbs/collection/config/lockfile.rb#18
+  def fullpath; end
+
+  # source://rbs/lib/rbs/collection/config/lockfile.rb#22
+  def gemfile_lock_fullpath; end
+
+  # Returns the value of attribute gemfile_lock_path.
+  #
+  # source://rbs/lib/rbs/collection/config/lockfile.rb#7
+  def gemfile_lock_path; end
+
+  # Returns the value of attribute gems.
+  #
+  # source://rbs/lib/rbs/collection/config/lockfile.rb#7
+  def gems; end
+
+  # source://rbs/lib/rbs/collection/config/lockfile.rb#65
+  def library_data(lib); end
+
+  # Returns the value of attribute lockfile_dir.
+  #
+  # source://rbs/lib/rbs/collection/config/lockfile.rb#7
+  def lockfile_dir; end
+
+  # Returns the value of attribute lockfile_path.
+  #
+  # source://rbs/lib/rbs/collection/config/lockfile.rb#7
+  def lockfile_path; end
+
+  # Returns the value of attribute path.
+  #
+  # source://rbs/lib/rbs/collection/config/lockfile.rb#7
+  def path; end
+
+  # Returns the value of attribute sources.
+  #
+  # source://rbs/lib/rbs/collection/config/lockfile.rb#7
+  def sources; end
+
+  # source://rbs/lib/rbs/collection/config/lockfile.rb#28
+  def to_lockfile; end
+
+  class << self
+    # source://rbs/lib/rbs/collection/config/lockfile.rb#42
+    def from_lockfile(lockfile_path:, data:); end
+  end
+end
+
+# source://rbs/lib/rbs/collection/config/lockfile_generator.rb#6
+class RBS::Collection::Config::LockfileGenerator
+  # @return [LockfileGenerator] a new instance of LockfileGenerator
+  #
+  # source://rbs/lib/rbs/collection/config/lockfile_generator.rb#31
+  def initialize(config:, definition:, with_lockfile:); end
+
+  # Returns the value of attribute config.
+  #
+  # source://rbs/lib/rbs/collection/config/lockfile_generator.rb#23
+  def config; end
+
+  # Returns the value of attribute definition.
+  #
+  # source://rbs/lib/rbs/collection/config/lockfile_generator.rb#23
+  def definition; end
+
+  # Returns the value of attribute existing_lockfile.
+  #
+  # source://rbs/lib/rbs/collection/config/lockfile_generator.rb#23
+  def existing_lockfile; end
+
+  # Returns the value of attribute gem_entries.
+  #
+  # source://rbs/lib/rbs/collection/config/lockfile_generator.rb#23
+  def gem_entries; end
+
+  # Returns the value of attribute gem_hash.
+  #
+  # source://rbs/lib/rbs/collection/config/lockfile_generator.rb#23
+  def gem_hash; end
+
+  # source://rbs/lib/rbs/collection/config/lockfile_generator.rb#59
+  def generate; end
+
+  # Returns the value of attribute lockfile.
+  #
+  # source://rbs/lib/rbs/collection/config/lockfile_generator.rb#23
+  def lockfile; end
+
+  private
+
+  # source://rbs/lib/rbs/collection/config/lockfile_generator.rb#91
+  def assign_gem(name:, version:, skip: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/collection/config/lockfile_generator.rb#152
+  def assign_stdlib(name:, from_gem:); end
+
+  # source://rbs/lib/rbs/collection/config/lockfile_generator.rb#184
+  def find_best_version(version:, versions:); end
+
+  # source://rbs/lib/rbs/collection/config/lockfile_generator.rb#178
+  def find_source(name:); end
+
+  # source://rbs/lib/rbs/collection/config/lockfile_generator.rb#83
+  def validate_gemfile_lock_path!(lock:, gemfile_lock_path:); end
+
+  class << self
+    # source://rbs/lib/rbs/collection/config/lockfile_generator.rb#25
+    def generate(config:, definition:, with_lockfile: T.unsafe(nil)); end
+  end
+end
+
+# source://rbs/lib/rbs/collection/config/lockfile_generator.rb#7
+class RBS::Collection::Config::LockfileGenerator::GemfileLockMismatchError < ::StandardError
+  # @return [GemfileLockMismatchError] a new instance of GemfileLockMismatchError
+  #
+  # source://rbs/lib/rbs/collection/config/lockfile_generator.rb#8
+  def initialize(expected:, actual:); end
+
+  # source://rbs/lib/rbs/collection/config/lockfile_generator.rb#13
+  def message; end
+end
+
+# source://rbs/lib/rbs/collection/config.rb#17
+RBS::Collection::Config::PATH = T.let(T.unsafe(nil), Pathname)
+
+# source://rbs/lib/rbs/collection/installer.rb#5
+class RBS::Collection::Installer
+  # @return [Installer] a new instance of Installer
+  #
+  # source://rbs/lib/rbs/collection/installer.rb#9
+  def initialize(lockfile_path:, stdout: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/collection/installer.rb#14
+  def install_from_lockfile; end
+
+  # Returns the value of attribute lockfile.
+  #
+  # source://rbs/lib/rbs/collection/installer.rb#6
+  def lockfile; end
+
+  # Returns the value of attribute stdout.
+  #
+  # source://rbs/lib/rbs/collection/installer.rb#7
+  def stdout; end
+end
+
+# source://rbs/lib/rbs/collection/sources/base.rb#5
+module RBS::Collection::Sources
+  class << self
+    # source://rbs/lib/rbs/collection/sources.rb#12
+    def from_config_entry(source_entry, base_directory:); end
+  end
+end
+
+# source://rbs/lib/rbs/collection/sources/base.rb#6
+module RBS::Collection::Sources::Base
+  # source://rbs/lib/rbs/collection/sources/base.rb#7
+  def dependencies_of(name, version); end
+end
+
+# source://rbs/lib/rbs/collection/sources/git.rb#10
+class RBS::Collection::Sources::Git
+  include ::RBS::Collection::Sources::Base
+
+  # @return [Git] a new instance of Git
+  #
+  # source://rbs/lib/rbs/collection/sources/git.rb#18
+  def initialize(name:, revision:, remote:, repo_dir:); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/collection/sources/git.rb#26
+  def has?(name, version); end
+
+  # source://rbs/lib/rbs/collection/sources/git.rb#43
+  def install(dest:, name:, version:, stdout:); end
+
+  # source://rbs/lib/rbs/collection/sources/git.rb#223
+  def load_metadata(dir:); end
+
+  # source://rbs/lib/rbs/collection/sources/git.rb#73
+  def manifest_of(name, version); end
+
+  # source://rbs/lib/rbs/collection/sources/git.rb#207
+  def metadata_content(name:, version:); end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/collection/sources/git.rb#16
+  def name; end
+
+  # Returns the value of attribute remote.
+  #
+  # source://rbs/lib/rbs/collection/sources/git.rb#16
+  def remote; end
+
+  # Returns the value of attribute repo_dir.
+  #
+  # source://rbs/lib/rbs/collection/sources/git.rb#16
+  def repo_dir; end
+
+  # source://rbs/lib/rbs/collection/sources/git.rb#172
+  def resolved_revision; end
+
+  # Returns the value of attribute revision.
+  #
+  # source://rbs/lib/rbs/collection/sources/git.rb#16
+  def revision; end
+
+  # source://rbs/lib/rbs/collection/sources/git.rb#113
+  def to_lockfile; end
+
+  # source://rbs/lib/rbs/collection/sources/git.rb#36
+  def versions(name); end
+
+  # source://rbs/lib/rbs/collection/sources/git.rb#215
+  def write_metadata(dir:, name:, version:); end
+
+  private
+
+  # source://rbs/lib/rbs/collection/sources/git.rb#87
+  def _install(dest:, name:, version:); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/collection/sources/git.rb#183
+  def commit_hash?; end
+
+  # source://rbs/lib/rbs/collection/sources/git.rb#99
+  def cp_r(src, dest); end
+
+  # source://rbs/lib/rbs/collection/sources/git.rb#123
+  def format_config_entry(name, version); end
+
+  # source://rbs/lib/rbs/collection/sources/git.rb#168
+  def gem_repo_dir; end
+
+  # source://rbs/lib/rbs/collection/sources/git.rb#229
+  def gems_versions; end
+
+  # source://rbs/lib/rbs/collection/sources/git.rb#187
+  def git(*cmd, **opt); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/collection/sources/git.rb#191
+  def git?(*cmd, **opt); end
+
+  # source://rbs/lib/rbs/collection/sources/git.rb#158
+  def git_dir; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/collection/sources/git.rb#152
+  def need_to_fetch?(revision); end
+
+  # source://rbs/lib/rbs/collection/sources/git.rb#130
+  def setup!; end
+
+  # source://rbs/lib/rbs/collection/sources/git.rb#197
+  def sh!(*cmd, **opt); end
+end
+
+# source://rbs/lib/rbs/collection/sources/git.rb#14
+class RBS::Collection::Sources::Git::CommandError < ::StandardError; end
+
+# source://rbs/lib/rbs/collection/sources/git.rb#12
+RBS::Collection::Sources::Git::METADATA_FILENAME = T.let(T.unsafe(nil), String)
+
+# source://rbs/lib/rbs/collection/sources/local.rb#6
+class RBS::Collection::Sources::Local
+  include ::RBS::Collection::Sources::Base
+
+  # @return [Local] a new instance of Local
+  #
+  # source://rbs/lib/rbs/collection/sources/local.rb#11
+  def initialize(path:, base_directory:); end
+
+  # Returns the value of attribute full_path.
+  #
+  # source://rbs/lib/rbs/collection/sources/local.rb#9
+  def full_path; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/collection/sources/local.rb#17
+  def has?(name, version); end
+
+  # Create a symlink instead of copying file to refer files in @path.
+  # By avoiding copying RBS files, the users do not need re-run `rbs collection install`
+  # when the RBS files are updated.
+  #
+  # source://rbs/lib/rbs/collection/sources/local.rb#32
+  def install(dest:, name:, version:, stdout:); end
+
+  # source://rbs/lib/rbs/collection/sources/local.rb#64
+  def manifest_of(name, version); end
+
+  # Returns the value of attribute path.
+  #
+  # source://rbs/lib/rbs/collection/sources/local.rb#9
+  def path; end
+
+  # source://rbs/lib/rbs/collection/sources/local.rb#72
+  def to_lockfile; end
+
+  # source://rbs/lib/rbs/collection/sources/local.rb#25
+  def versions(name); end
+
+  private
+
+  # source://rbs/lib/rbs/collection/sources/local.rb#59
+  def _install(src, dst); end
+end
+
+# Signatures that are inclduded in gem package as sig/ directory.
+#
+# source://rbs/lib/rbs/collection/sources/rubygems.rb#9
+class RBS::Collection::Sources::Rubygems
+  include ::RBS::Collection::Sources::Base
+  include ::Singleton
+  extend ::Singleton::SingletonClassMethods
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/collection/sources/rubygems.rb#13
+  def has?(name, version); end
+
+  # source://rbs/lib/rbs/collection/sources/rubygems.rb#23
+  def install(dest:, name:, version:, stdout:); end
+
+  # source://rbs/lib/rbs/collection/sources/rubygems.rb#29
+  def manifest_of(name, version); end
+
+  # source://rbs/lib/rbs/collection/sources/rubygems.rb#36
+  def to_lockfile; end
+
+  # source://rbs/lib/rbs/collection/sources/rubygems.rb#17
+  def versions(name); end
+
+  private
+
+  # source://rbs/lib/rbs/collection/sources/rubygems.rb#42
+  def gem_sig_path(name, version); end
+
+  class << self
+    private
+
+    def allocate; end
+    def new(*_arg0); end
+  end
+end
+
+# signatures that are bundled in rbs gem under the stdlib/ directory
+#
+# source://rbs/lib/rbs/collection/sources/stdlib.rb#9
+class RBS::Collection::Sources::Stdlib
+  include ::RBS::Collection::Sources::Base
+  include ::Singleton
+  extend ::Singleton::SingletonClassMethods
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/collection/sources/stdlib.rb#15
+  def has?(name, version); end
+
+  # source://rbs/lib/rbs/collection/sources/stdlib.rb#23
+  def install(dest:, name:, version:, stdout:); end
+
+  # source://rbs/lib/rbs/collection/sources/stdlib.rb#29
+  def manifest_of(name, version); end
+
+  # source://rbs/lib/rbs/collection/sources/stdlib.rb#38
+  def to_lockfile; end
+
+  # source://rbs/lib/rbs/collection/sources/stdlib.rb#19
+  def versions(name); end
+
+  private
+
+  # source://rbs/lib/rbs/collection/sources/stdlib.rb#44
+  def lookup(name, version); end
+
+  class << self
+    private
+
+    def allocate; end
+    def new(*_arg0); end
+  end
+end
+
+# source://rbs/lib/rbs/collection/sources/stdlib.rb#13
+RBS::Collection::Sources::Stdlib::REPO = T.let(T.unsafe(nil), RBS::Repository)
+
+# source://rbs/lib/rbs/constant.rb#4
+class RBS::Constant
+  # @return [Constant] a new instance of Constant
+  #
+  # source://rbs/lib/rbs/constant.rb#9
+  def initialize(name:, type:, entry:); end
+
+  # source://rbs/lib/rbs/constant.rb#15
+  def ==(other); end
+
+  # Returns the value of attribute entry.
+  #
+  # source://rbs/lib/rbs/constant.rb#7
+  def entry; end
+
+  # source://rbs/lib/rbs/constant.rb#15
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/constant.rb#24
+  def hash; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/constant.rb#5
+  def name; end
+
+  # Returns the value of attribute type.
+  #
+  # source://rbs/lib/rbs/constant.rb#6
+  def type; end
+end
+
+# source://rbs/lib/rbs/errors.rb#553
+class RBS::CyclicClassAliasDefinitionError < ::RBS::BaseError
+  include ::RBS::DetailedMessageable
+
+  # @return [CyclicClassAliasDefinitionError] a new instance of CyclicClassAliasDefinitionError
+  #
+  # source://rbs/lib/rbs/errors.rb#558
+  def initialize(entry); end
+
+  # Returns the value of attribute alias_entry.
+  #
+  # source://rbs/lib/rbs/errors.rb#556
+  def alias_entry; end
+
+  # source://rbs/lib/rbs/errors.rb#564
+  def location; end
+end
+
+# source://rbs/lib/rbs/errors.rb#514
+class RBS::CyclicTypeParameterBound < ::RBS::BaseError
+  include ::RBS::DetailedMessageable
+
+  # @return [CyclicTypeParameterBound] a new instance of CyclicTypeParameterBound
+  #
+  # source://rbs/lib/rbs/errors.rb#519
+  def initialize(type_name:, method_name:, params:, location:); end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/errors.rb#517
+  def location; end
+
+  # Returns the value of attribute method_name.
+  #
+  # source://rbs/lib/rbs/errors.rb#517
+  def method_name; end
+
+  # Returns the value of attribute params.
+  #
+  # source://rbs/lib/rbs/errors.rb#517
+  def params; end
+
+  # Returns the value of attribute type_name.
+  #
+  # source://rbs/lib/rbs/errors.rb#517
+  def type_name; end
+end
+
+# source://rbs/lib/rbs/definition.rb#4
+class RBS::Definition
+  # @return [Definition] a new instance of Definition
+  #
+  # source://rbs/lib/rbs/definition.rb#282
+  def initialize(type_name:, entry:, self_type:, ancestors:); end
+
+  # Returns the value of attribute ancestors.
+  #
+  # source://rbs/lib/rbs/definition.rb#276
+  def ancestors; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/definition.rb#305
+  def class?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/definition.rb#322
+  def class_type?; end
+
+  # Returns the value of attribute class_variables.
+  #
+  # source://rbs/lib/rbs/definition.rb#280
+  def class_variables; end
+
+  # source://rbs/lib/rbs/definition.rb#367
+  def each_type(&block); end
+
+  # Returns the value of attribute entry.
+  #
+  # source://rbs/lib/rbs/definition.rb#275
+  def entry; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/definition.rb#326
+  def instance_type?; end
+
+  # Returns the value of attribute instance_variables.
+  #
+  # source://rbs/lib/rbs/definition.rb#279
+  def instance_variables; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/definition.rb#313
+  def interface?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/definition.rb#330
+  def interface_type?; end
+
+  # source://rbs/lib/rbs/definition.rb#357
+  def map_method_type(&block); end
+
+  # Returns the value of attribute methods.
+  #
+  # source://rbs/lib/rbs/definition.rb#278
+  def methods; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/definition.rb#309
+  def module?; end
+
+  # Returns the value of attribute self_type.
+  #
+  # source://rbs/lib/rbs/definition.rb#277
+  def self_type; end
+
+  # source://rbs/lib/rbs/definition.rb#347
+  def sub(s); end
+
+  # Returns the value of attribute type_name.
+  #
+  # source://rbs/lib/rbs/definition.rb#274
+  def type_name; end
+
+  # source://rbs/lib/rbs/definition.rb#334
+  def type_params; end
+
+  # source://rbs/lib/rbs/definition.rb#338
+  def type_params_decl; end
+end
+
+# source://rbs/lib/rbs/definition.rb#189
+module RBS::Definition::Ancestor; end
+
+# source://rbs/lib/rbs/definition.rb#190
+class RBS::Definition::Ancestor::Instance
+  # @return [Instance] a new instance of Instance
+  #
+  # source://rbs/lib/rbs/definition.rb#193
+  def initialize(name:, args:, source:); end
+
+  # source://rbs/lib/rbs/definition.rb#199
+  def ==(other); end
+
+  # Returns the value of attribute args.
+  #
+  # source://rbs/lib/rbs/definition.rb#191
+  def args; end
+
+  # source://rbs/lib/rbs/definition.rb#199
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/definition.rb#205
+  def hash; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/definition.rb#191
+  def name; end
+
+  # Returns the value of attribute source.
+  #
+  # source://rbs/lib/rbs/definition.rb#191
+  def source; end
+end
+
+# source://rbs/lib/rbs/definition.rb#210
+class RBS::Definition::Ancestor::Singleton
+  # @return [Singleton] a new instance of Singleton
+  #
+  # source://rbs/lib/rbs/definition.rb#213
+  def initialize(name:); end
+
+  # source://rbs/lib/rbs/definition.rb#217
+  def ==(other); end
+
+  # source://rbs/lib/rbs/definition.rb#217
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/definition.rb#223
+  def hash; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/definition.rb#211
+  def name; end
+end
+
+# source://rbs/lib/rbs/definition.rb#229
+class RBS::Definition::InstanceAncestors
+  # @return [InstanceAncestors] a new instance of InstanceAncestors
+  #
+  # source://rbs/lib/rbs/definition.rb#234
+  def initialize(type_name:, params:, ancestors:); end
+
+  # Returns the value of attribute ancestors.
+  #
+  # source://rbs/lib/rbs/definition.rb#232
+  def ancestors; end
+
+  # source://rbs/lib/rbs/definition.rb#240
+  def apply(args, env:, location:); end
+
+  # Returns the value of attribute params.
+  #
+  # source://rbs/lib/rbs/definition.rb#231
+  def params; end
+
+  # Returns the value of attribute type_name.
+  #
+  # source://rbs/lib/rbs/definition.rb#230
+  def type_name; end
+end
+
+# source://rbs/lib/rbs/definition.rb#25
+class RBS::Definition::Method
+  # @return [Method] a new instance of Method
+  #
+  # source://rbs/lib/rbs/definition.rb#81
+  def initialize(super_method:, defs:, accessibility:, alias_of:, annotations: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/definition.rb#89
+  def ==(other); end
+
+  # Returns the value of attribute accessibility.
+  #
+  # source://rbs/lib/rbs/definition.rb#77
+  def accessibility; end
+
+  # Returns the value of attribute alias_of.
+  #
+  # source://rbs/lib/rbs/definition.rb#79
+  def alias_of; end
+
+  # source://rbs/lib/rbs/definition.rb#126
+  def annotations; end
+
+  # source://rbs/lib/rbs/definition.rb#122
+  def comments; end
+
+  # source://rbs/lib/rbs/definition.rb#104
+  def defined_in; end
+
+  # Returns the value of attribute defs.
+  #
+  # source://rbs/lib/rbs/definition.rb#76
+  def defs; end
+
+  # source://rbs/lib/rbs/definition.rb#89
+  def eql?(other); end
+
+  # Returns the value of attribute extra_annotations.
+  #
+  # source://rbs/lib/rbs/definition.rb#78
+  def extra_annotations; end
+
+  # source://rbs/lib/rbs/definition.rb#100
+  def hash; end
+
+  # source://rbs/lib/rbs/definition.rb#111
+  def implemented_in; end
+
+  # source://rbs/lib/rbs/definition.rb#169
+  def map_method_type(&block); end
+
+  # source://rbs/lib/rbs/definition.rb#151
+  def map_type(&block); end
+
+  # source://rbs/lib/rbs/definition.rb#160
+  def map_type_bound(&block); end
+
+  # source://rbs/lib/rbs/definition.rb#130
+  def members; end
+
+  # source://rbs/lib/rbs/definition.rb#118
+  def method_types; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/definition.rb#138
+  def private?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/definition.rb#134
+  def public?; end
+
+  # source://rbs/lib/rbs/definition.rb#142
+  def sub(s); end
+
+  # Returns the value of attribute super_method.
+  #
+  # source://rbs/lib/rbs/definition.rb#75
+  def super_method; end
+
+  # source://rbs/lib/rbs/definition.rb#178
+  def update(super_method: T.unsafe(nil), defs: T.unsafe(nil), accessibility: T.unsafe(nil), alias_of: T.unsafe(nil), annotations: T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/definition.rb#26
+class RBS::Definition::Method::TypeDef
+  # @return [TypeDef] a new instance of TypeDef
+  #
+  # source://rbs/lib/rbs/definition.rb#32
+  def initialize(type:, member:, defined_in:, implemented_in:); end
+
+  # source://rbs/lib/rbs/definition.rb#39
+  def ==(other); end
+
+  # source://rbs/lib/rbs/definition.rb#57
+  def annotations; end
+
+  # source://rbs/lib/rbs/definition.rb#53
+  def comment; end
+
+  # Returns the value of attribute defined_in.
+  #
+  # source://rbs/lib/rbs/definition.rb#29
+  def defined_in; end
+
+  # source://rbs/lib/rbs/definition.rb#39
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/definition.rb#49
+  def hash; end
+
+  # Returns the value of attribute implemented_in.
+  #
+  # source://rbs/lib/rbs/definition.rb#30
+  def implemented_in; end
+
+  # Returns the value of attribute member.
+  #
+  # source://rbs/lib/rbs/definition.rb#28
+  def member; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/definition.rb#65
+  def overload?; end
+
+  # Returns the value of attribute type.
+  #
+  # source://rbs/lib/rbs/definition.rb#27
+  def type; end
+
+  # source://rbs/lib/rbs/definition.rb#61
+  def update(type: T.unsafe(nil), member: T.unsafe(nil), defined_in: T.unsafe(nil), implemented_in: T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/definition.rb#264
+class RBS::Definition::SingletonAncestors
+  # @return [SingletonAncestors] a new instance of SingletonAncestors
+  #
+  # source://rbs/lib/rbs/definition.rb#268
+  def initialize(type_name:, ancestors:); end
+
+  # Returns the value of attribute ancestors.
+  #
+  # source://rbs/lib/rbs/definition.rb#266
+  def ancestors; end
+
+  # Returns the value of attribute type_name.
+  #
+  # source://rbs/lib/rbs/definition.rb#265
+  def type_name; end
+end
+
+# source://rbs/lib/rbs/definition.rb#5
+class RBS::Definition::Variable
+  # @return [Variable] a new instance of Variable
+  #
+  # source://rbs/lib/rbs/definition.rb#10
+  def initialize(parent_variable:, type:, declared_in:); end
+
+  # Returns the value of attribute declared_in.
+  #
+  # source://rbs/lib/rbs/definition.rb#8
+  def declared_in; end
+
+  # Returns the value of attribute parent_variable.
+  #
+  # source://rbs/lib/rbs/definition.rb#6
+  def parent_variable; end
+
+  # source://rbs/lib/rbs/definition.rb#16
+  def sub(s); end
+
+  # Returns the value of attribute type.
+  #
+  # source://rbs/lib/rbs/definition.rb#7
+  def type; end
+end
+
+# source://rbs/lib/rbs/definition_builder.rb#4
+class RBS::DefinitionBuilder
+  # @return [DefinitionBuilder] a new instance of DefinitionBuilder
+  #
+  # source://rbs/lib/rbs/definition_builder.rb#14
+  def initialize(env:, ancestor_builder: T.unsafe(nil), method_builder: T.unsafe(nil)); end
+
+  # Returns the value of attribute ancestor_builder.
+  #
+  # source://rbs/lib/rbs/definition_builder.rb#6
+  def ancestor_builder; end
+
+  # source://rbs/lib/rbs/definition_builder.rb#168
+  def build_instance(type_name); end
+
+  # source://rbs/lib/rbs/definition_builder.rb#43
+  def build_interface(type_name); end
+
+  # source://rbs/lib/rbs/definition_builder.rb#301
+  def build_singleton(type_name); end
+
+  # Builds a definition for singleton without .new method.
+  #
+  # source://rbs/lib/rbs/definition_builder.rb#230
+  def build_singleton0(type_name); end
+
+  # source://rbs/lib/rbs/definition_builder.rb#85
+  def define_instance(definition, type_name, subst); end
+
+  # source://rbs/lib/rbs/definition_builder.rb#33
+  def define_interface(definition, type_name, subst); end
+
+  # source://rbs/lib/rbs/definition_builder.rb#606
+  def define_method(methods, definition, method, subst, self_type_methods, defined_in:, implemented_in: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/definition_builder.rb#25
+  def ensure_namespace!(namespace, location:); end
+
+  # Returns the value of attribute env.
+  #
+  # source://rbs/lib/rbs/definition_builder.rb#5
+  def env; end
+
+  # source://rbs/lib/rbs/definition_builder.rb#767
+  def expand_alias(type_name); end
+
+  # source://rbs/lib/rbs/definition_builder.rb#771
+  def expand_alias1(type_name); end
+
+  # source://rbs/lib/rbs/definition_builder.rb#778
+  def expand_alias2(type_name, args); end
+
+  # source://rbs/lib/rbs/definition_builder.rb#545
+  def import_methods(definition, module_name, module_methods, interfaces_methods, subst, self_type_methods); end
+
+  # source://rbs/lib/rbs/definition_builder.rb#537
+  def insert_variable(type_name, variables, name:, type:); end
+
+  # Returns the value of attribute instance_cache.
+  #
+  # source://rbs/lib/rbs/definition_builder.rb#9
+  def instance_cache; end
+
+  # Returns the value of attribute interface_cache.
+  #
+  # source://rbs/lib/rbs/definition_builder.rb#12
+  def interface_cache; end
+
+  # source://rbs/lib/rbs/definition_builder.rb#411
+  def interface_methods(interface_ancestors); end
+
+  # Returns the value of attribute method_builder.
+  #
+  # source://rbs/lib/rbs/definition_builder.rb#7
+  def method_builder; end
+
+  # Returns the value of attribute singleton0_cache.
+  #
+  # source://rbs/lib/rbs/definition_builder.rb#11
+  def singleton0_cache; end
+
+  # Returns the value of attribute singleton_cache.
+  #
+  # source://rbs/lib/rbs/definition_builder.rb#10
+  def singleton_cache; end
+
+  # source://rbs/lib/rbs/definition_builder.rb#441
+  def source_location(source, decl); end
+
+  # source://rbs/lib/rbs/definition_builder.rb#66
+  def tapp_subst(name, args); end
+
+  # source://rbs/lib/rbs/definition_builder.rb#763
+  def try_cache(type_name, cache:); end
+
+  # source://rbs/lib/rbs/definition_builder.rb#802
+  def update(env:, except:, ancestor_builder:); end
+
+  # source://rbs/lib/rbs/definition_builder.rb#431
+  def validate_params_with(type_params, result:); end
+
+  # @raise [NoTypeFoundError]
+  #
+  # source://rbs/lib/rbs/definition_builder.rb#831
+  def validate_type_name(name, location); end
+
+  # source://rbs/lib/rbs/definition_builder.rb#455
+  def validate_type_params(definition, ancestors:, methods:); end
+
+  # source://rbs/lib/rbs/definition_builder.rb#820
+  def validate_type_presence(type); end
+end
+
+# source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#5
+class RBS::DefinitionBuilder::AncestorBuilder
+  # @return [AncestorBuilder] a new instance of AncestorBuilder
+  #
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#162
+  def initialize(env:); end
+
+  # Returns the value of attribute env.
+  #
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#151
+  def env; end
+
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#606
+  def fill_ancestor_source(ancestor, name:, source:, &block); end
+
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#434
+  def instance_ancestors(type_name, building_ancestors: T.unsafe(nil)); end
+
+  # Returns the value of attribute instance_ancestors_cache.
+  #
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#154
+  def instance_ancestors_cache; end
+
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#570
+  def interface_ancestors(type_name, building_ancestors: T.unsafe(nil)); end
+
+  # Returns the value of attribute interface_ancestors_cache.
+  #
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#160
+  def interface_ancestors_cache; end
+
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#414
+  def mixin_ancestors(entry, type_name, included_modules:, included_interfaces:, extended_modules:, prepended_modules:, extended_interfaces:); end
+
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#348
+  def mixin_ancestors0(decl, type_name, align_params:, included_modules:, included_interfaces:, extended_modules:, prepended_modules:, extended_interfaces:); end
+
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#192
+  def one_instance_ancestors(type_name); end
+
+  # Returns the value of attribute one_instance_ancestors_cache.
+  #
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#153
+  def one_instance_ancestors_cache; end
+
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#329
+  def one_interface_ancestors(type_name); end
+
+  # Returns the value of attribute one_interface_ancestors_cache.
+  #
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#159
+  def one_interface_ancestors_cache; end
+
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#275
+  def one_singleton_ancestors(type_name); end
+
+  # Returns the value of attribute one_singleton_ancestors_cache.
+  #
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#156
+  def one_singleton_ancestors_cache; end
+
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#515
+  def singleton_ancestors(type_name, building_ancestors: T.unsafe(nil)); end
+
+  # Returns the value of attribute singleton_ancestors_cache.
+  #
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#157
+  def singleton_ancestors_cache; end
+
+  # @raise [SuperclassMismatchError]
+  #
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#175
+  def validate_super_class!(type_name, entry); end
+end
+
+# source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#6
+class RBS::DefinitionBuilder::AncestorBuilder::OneAncestors
+  # @return [OneAncestors] a new instance of OneAncestors
+  #
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#17
+  def initialize(type_name:, params:, super_class:, self_types:, included_modules:, included_interfaces:, prepended_modules:, extended_modules:, extended_interfaces:); end
+
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#29
+  def each_ancestor(&block); end
+
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#86
+  def each_extended_interface(&block); end
+
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#78
+  def each_extended_module(&block); end
+
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#62
+  def each_included_interface(&block); end
+
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#54
+  def each_included_module(&block); end
+
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#70
+  def each_prepended_module(&block); end
+
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#46
+  def each_self_type(&block); end
+
+  # Returns the value of attribute extended_interfaces.
+  #
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#15
+  def extended_interfaces; end
+
+  # Returns the value of attribute extended_modules.
+  #
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#14
+  def extended_modules; end
+
+  # Returns the value of attribute included_interfaces.
+  #
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#12
+  def included_interfaces; end
+
+  # Returns the value of attribute included_modules.
+  #
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#11
+  def included_modules; end
+
+  # Returns the value of attribute params.
+  #
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#8
+  def params; end
+
+  # Returns the value of attribute prepended_modules.
+  #
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#13
+  def prepended_modules; end
+
+  # Returns the value of attribute self_types.
+  #
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#10
+  def self_types; end
+
+  # Returns the value of attribute super_class.
+  #
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#9
+  def super_class; end
+
+  # Returns the value of attribute type_name.
+  #
+  # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#7
+  def type_name; end
+
+  class << self
+    # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#94
+    def class_instance(type_name:, params:, super_class:); end
+
+    # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#136
+    def interface(type_name:, params:); end
+
+    # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#122
+    def module_instance(type_name:, params:); end
+
+    # source://rbs/lib/rbs/definition_builder/ancestor_builder.rb#108
+    def singleton(type_name:, super_class:); end
+  end
+end
+
+# source://rbs/lib/rbs/definition_builder/method_builder.rb#5
+class RBS::DefinitionBuilder::MethodBuilder
+  # @return [MethodBuilder] a new instance of MethodBuilder
+  #
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#91
+  def initialize(env:); end
+
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#194
+  def build_alias(methods, type, member:); end
+
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#199
+  def build_attribute(methods, type, member:, accessibility:); end
+
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#99
+  def build_instance(type_name); end
+
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#174
+  def build_interface(type_name); end
+
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#215
+  def build_method(methods, type, member:, accessibility:); end
+
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#145
+  def build_singleton(type_name); end
+
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#226
+  def each_member_with_accessibility(members, accessibility: T.unsafe(nil)); end
+
+  # Returns the value of attribute env.
+  #
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#86
+  def env; end
+
+  # Returns the value of attribute instance_methods.
+  #
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#87
+  def instance_methods; end
+
+  # Returns the value of attribute interface_methods.
+  #
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#89
+  def interface_methods; end
+
+  # Returns the value of attribute singleton_methods.
+  #
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#88
+  def singleton_methods; end
+
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#239
+  def update(env:, except:); end
+end
+
+# source://rbs/lib/rbs/definition_builder/method_builder.rb#6
+class RBS::DefinitionBuilder::MethodBuilder::Methods
+  # @return [Methods] a new instance of Methods
+  #
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#30
+  def initialize(type:); end
+
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#49
+  def each; end
+
+  # Returns the value of attribute methods.
+  #
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#28
+  def methods; end
+
+  # Returns the value of attribute type.
+  #
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#27
+  def type; end
+
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#35
+  def validate!; end
+end
+
+# source://rbs/lib/rbs/definition_builder/method_builder.rb#7
+class RBS::DefinitionBuilder::MethodBuilder::Methods::Definition < ::Struct
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#14
+  def accessibility; end
+
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#10
+  def original; end
+
+  class << self
+    # source://rbs/lib/rbs/definition_builder/method_builder.rb#22
+    def empty(name:, type:); end
+  end
+end
+
+# source://rbs/lib/rbs/definition_builder/method_builder.rb#63
+class RBS::DefinitionBuilder::MethodBuilder::Methods::Sorter
+  include ::TSort
+
+  # @return [Sorter] a new instance of Sorter
+  #
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#68
+  def initialize(methods); end
+
+  # Returns the value of attribute methods.
+  #
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#66
+  def methods; end
+
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#76
+  def tsort_each_child(defn); end
+
+  # source://rbs/lib/rbs/definition_builder/method_builder.rb#72
+  def tsort_each_node(&block); end
+end
+
+# source://rbs/lib/rbs/errors.rb#21
+class RBS::DefinitionError < ::RBS::BaseError; end
+
+# source://rbs/lib/rbs/errors.rb#23
+module RBS::DetailedMessageable
+  # source://rbs/lib/rbs/errors.rb#24
+  def detailed_message(highlight: T.unsafe(nil), **_arg1); end
+end
+
+# source://rbs/lib/rbs/diff.rb#4
+class RBS::Diff
+  # @return [Diff] a new instance of Diff
+  #
+  # source://rbs/lib/rbs/diff.rb#5
+  def initialize(type_name:, library_options:, after_path: T.unsafe(nil), before_path: T.unsafe(nil), detail: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/diff.rb#13
+  def each_diff(&block); end
+
+  private
+
+  # source://rbs/lib/rbs/diff.rb#96
+  def build_builder(env); end
+
+  # source://rbs/lib/rbs/diff.rb#77
+  def build_env(path); end
+
+  # source://rbs/lib/rbs/diff.rb#49
+  def build_methods(path); end
+
+  # source://rbs/lib/rbs/diff.rb#116
+  def constant_to_s(constant); end
+
+  # source://rbs/lib/rbs/diff.rb#100
+  def definition_method_to_s(key, kind, definition_method); end
+
+  # source://rbs/lib/rbs/diff.rb#38
+  def each_diff_constants(before_constant_children, after_constant_children); end
+
+  # source://rbs/lib/rbs/diff.rb#27
+  def each_diff_methods(kind, before_methods, after_methods); end
+end
+
+# source://rbs/lib/rbs/errors.rb#394
+class RBS::DuplicatedDeclarationError < ::RBS::LoadingError
+  # @return [DuplicatedDeclarationError] a new instance of DuplicatedDeclarationError
+  #
+  # source://rbs/lib/rbs/errors.rb#398
+  def initialize(name, *decls); end
+
+  # Returns the value of attribute decls.
+  #
+  # source://rbs/lib/rbs/errors.rb#396
+  def decls; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/errors.rb#395
+  def name; end
+end
+
+# source://rbs/lib/rbs/errors.rb#292
+class RBS::DuplicatedInterfaceMethodDefinitionError < ::RBS::DefinitionError
+  include ::RBS::DetailedMessageable
+
+  # @return [DuplicatedInterfaceMethodDefinitionError] a new instance of DuplicatedInterfaceMethodDefinitionError
+  #
+  # source://rbs/lib/rbs/errors.rb#299
+  def initialize(type:, method_name:, member:); end
+
+  # source://rbs/lib/rbs/errors.rb#307
+  def location; end
+
+  # Returns the value of attribute member.
+  #
+  # source://rbs/lib/rbs/errors.rb#297
+  def member; end
+
+  # Returns the value of attribute method_name.
+  #
+  # source://rbs/lib/rbs/errors.rb#296
+  def method_name; end
+
+  # source://rbs/lib/rbs/errors.rb#311
+  def qualified_method_name; end
+
+  # Returns the value of attribute type.
+  #
+  # source://rbs/lib/rbs/errors.rb#295
+  def type; end
+
+  # source://rbs/lib/rbs/errors.rb#320
+  def type_name; end
+end
+
+# source://rbs/lib/rbs/errors.rb#251
+class RBS::DuplicatedMethodDefinitionError < ::RBS::DefinitionError
+  include ::RBS::DetailedMessageable
+
+  # @return [DuplicatedMethodDefinitionError] a new instance of DuplicatedMethodDefinitionError
+  #
+  # source://rbs/lib/rbs/errors.rb#258
+  def initialize(type:, method_name:, members:); end
+
+  # source://rbs/lib/rbs/errors.rb#283
+  def location; end
+
+  # Returns the value of attribute members.
+  #
+  # source://rbs/lib/rbs/errors.rb#256
+  def members; end
+
+  # Returns the value of attribute method_name.
+  #
+  # source://rbs/lib/rbs/errors.rb#255
+  def method_name; end
+
+  # source://rbs/lib/rbs/errors.rb#287
+  def other_locations; end
+
+  # source://rbs/lib/rbs/errors.rb#270
+  def qualified_method_name; end
+
+  # Returns the value of attribute type.
+  #
+  # source://rbs/lib/rbs/errors.rb#254
+  def type; end
+
+  # source://rbs/lib/rbs/errors.rb#279
+  def type_name; end
+end
+
+# source://rbs/lib/rbs/environment.rb#4
+class RBS::Environment
+  # @return [Environment] a new instance of Environment
+  #
+  # source://rbs/lib/rbs/environment.rb#145
+  def initialize; end
+
+  # source://rbs/lib/rbs/environment.rb#470
+  def <<(decl); end
+
+  # source://rbs/lib/rbs/environment.rb#792
+  def absolute_type(resolver, map, type, context:); end
+
+  # source://rbs/lib/rbs/environment.rb#787
+  def absolute_type_name(resolver, map, type_name, context:); end
+
+  # source://rbs/lib/rbs/environment.rb#476
+  def add_signature(buffer:, directives:, decls:); end
+
+  # source://rbs/lib/rbs/environment.rb#528
+  def append_context(context, decl); end
+
+  # source://rbs/lib/rbs/environment.rb#803
+  def buffers; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/environment.rb#218
+  def class_alias?(name); end
+
+  # Returns the value of attribute class_alias_decls.
+  #
+  # source://rbs/lib/rbs/environment.rb#12
+  def class_alias_decls; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/environment.rb#202
+  def class_decl?(name); end
+
+  # Returns the value of attribute class_decls.
+  #
+  # source://rbs/lib/rbs/environment.rb#7
+  def class_decls; end
+
+  # source://rbs/lib/rbs/environment.rb#226
+  def class_entry(type_name); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/environment.rb#198
+  def constant_decl?(name); end
+
+  # Returns the value of attribute constant_decls.
+  #
+  # source://rbs/lib/rbs/environment.rb#10
+  def constant_decls; end
+
+  # source://rbs/lib/rbs/environment.rb#274
+  def constant_entry(type_name); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/environment.rb#194
+  def constant_name?(name); end
+
+  # Returns the value of attribute declarations.
+  #
+  # source://rbs/lib/rbs/environment.rb#5
+  def declarations; end
+
+  # Returns the value of attribute global_decls.
+  #
+  # source://rbs/lib/rbs/environment.rb#11
+  def global_decls; end
+
+  # source://rbs/lib/rbs/environment.rb#373
+  def insert_decl(decl, outer:, namespace:); end
+
+  # source://rbs/lib/rbs/environment.rb#798
+  def inspect; end
+
+  # Returns the value of attribute interface_decls.
+  #
+  # source://rbs/lib/rbs/environment.rb#8
+  def interface_decls; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/environment.rb#176
+  def interface_name?(name); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/environment.rb#210
+  def module_alias?(name); end
+
+  # source://rbs/lib/rbs/environment.rb#266
+  def module_class_entry(type_name); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/environment.rb#206
+  def module_decl?(name); end
+
+  # source://rbs/lib/rbs/environment.rb#235
+  def module_entry(type_name); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/environment.rb#184
+  def module_name?(name); end
+
+  # source://rbs/lib/rbs/environment.rb#332
+  def normalize_module_name(name); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/environment.rb#336
+  def normalize_module_name?(name); end
+
+  # source://rbs/lib/rbs/environment.rb#328
+  def normalize_type_name(name); end
+
+  # source://rbs/lib/rbs/environment.rb#297
+  def normalize_type_name!(name); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/environment.rb#278
+  def normalize_type_name?(name); end
+
+  # source://rbs/lib/rbs/environment.rb#244
+  def normalized_class_entry(type_name); end
+
+  # source://rbs/lib/rbs/environment.rb#270
+  def normalized_module_class_entry(type_name); end
+
+  # source://rbs/lib/rbs/environment.rb#255
+  def normalized_module_entry(type_name); end
+
+  # source://rbs/lib/rbs/environment.rb#323
+  def normalized_type_name!(name); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/environment.rb#310
+  def normalized_type_name?(type_name); end
+
+  # source://rbs/lib/rbs/environment.rb#537
+  def resolve_declaration(resolver, map, decl, outer:, prefix:); end
+
+  # source://rbs/lib/rbs/environment.rb#673
+  def resolve_member(resolver, map, member, context:); end
+
+  # source://rbs/lib/rbs/environment.rb#773
+  def resolve_method_type(resolver, map, type, context:); end
+
+  # source://rbs/lib/rbs/environment.rb#489
+  def resolve_type_names(only: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/environment.rb#781
+  def resolve_type_params(resolver, map, params, context:); end
+
+  # source://rbs/lib/rbs/environment.rb#522
+  def resolver_context(*nesting); end
+
+  # Returns the value of attribute signatures.
+  #
+  # source://rbs/lib/rbs/environment.rb#14
+  def signatures; end
+
+  # Returns the value of attribute type_alias_decls.
+  #
+  # source://rbs/lib/rbs/environment.rb#9
+  def type_alias_decls; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/environment.rb#180
+  def type_alias_name?(name); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/environment.rb#188
+  def type_name?(name); end
+
+  # source://rbs/lib/rbs/environment.rb#807
+  def unload(buffers); end
+
+  # source://rbs/lib/rbs/environment.rb#483
+  def validate_type_params; end
+
+  private
+
+  # source://rbs/lib/rbs/environment.rb#158
+  def initialize_copy(other); end
+
+  class << self
+    # source://rbs/lib/rbs/environment.rb#170
+    def from_loader(loader); end
+  end
+end
+
+# source://rbs/lib/rbs/environment.rb#130
+class RBS::Environment::ClassAliasEntry < ::RBS::Environment::SingleEntry; end
+
+# source://rbs/lib/rbs/environment.rb#100
+class RBS::Environment::ClassEntry < ::RBS::Environment::MultiEntry
+  # source://rbs/lib/rbs/environment.rb#101
+  def primary; end
+end
+
+# source://rbs/lib/rbs/environment.rb#139
+class RBS::Environment::ConstantEntry < ::RBS::Environment::SingleEntry; end
+
+# source://rbs/lib/rbs/environment.rb#16
+module RBS::Environment::ContextUtil
+  # source://rbs/lib/rbs/environment.rb#17
+  def calculate_context(decls); end
+end
+
+# source://rbs/lib/rbs/environment.rb#142
+class RBS::Environment::GlobalEntry < ::RBS::Environment::SingleEntry; end
+
+# source://rbs/lib/rbs/environment.rb#133
+class RBS::Environment::InterfaceEntry < ::RBS::Environment::SingleEntry; end
+
+# source://rbs/lib/rbs/environment.rb#127
+class RBS::Environment::ModuleAliasEntry < ::RBS::Environment::SingleEntry; end
+
+# source://rbs/lib/rbs/environment.rb#85
+class RBS::Environment::ModuleEntry < ::RBS::Environment::MultiEntry
+  # source://rbs/lib/rbs/environment.rb#92
+  def primary; end
+
+  # source://rbs/lib/rbs/environment.rb#86
+  def self_types; end
+end
+
+# source://rbs/lib/rbs/environment.rb#29
+class RBS::Environment::MultiEntry
+  # @return [MultiEntry] a new instance of MultiEntry
+  #
+  # source://rbs/lib/rbs/environment.rb#43
+  def initialize(name:); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/environment.rb#70
+  def compatible_params?(ps1, ps2); end
+
+  # Returns the value of attribute decls.
+  #
+  # source://rbs/lib/rbs/environment.rb#41
+  def decls; end
+
+  # source://rbs/lib/rbs/environment.rb#48
+  def insert(decl:, outer:); end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/environment.rb#40
+  def name; end
+
+  # source://rbs/lib/rbs/environment.rb#80
+  def primary; end
+
+  # source://rbs/lib/rbs/environment.rb#76
+  def type_params; end
+
+  # source://rbs/lib/rbs/environment.rb#53
+  def validate_type_params; end
+end
+
+# source://rbs/lib/rbs/environment.rb#30
+class RBS::Environment::MultiEntry::D < ::Struct
+  include ::RBS::Environment::ContextUtil
+
+  # source://rbs/lib/rbs/environment.rb#35
+  def context; end
+
+  def decl; end
+  def decl=(_); end
+  def outer; end
+  def outer=(_); end
+
+  class << self
+    def [](*_arg0); end
+    def inspect; end
+    def keyword_init?; end
+    def members; end
+    def new(*_arg0); end
+  end
+end
+
+# source://rbs/lib/rbs/environment.rb#109
+class RBS::Environment::SingleEntry
+  include ::RBS::Environment::ContextUtil
+
+  # @return [SingleEntry] a new instance of SingleEntry
+  #
+  # source://rbs/lib/rbs/environment.rb#114
+  def initialize(name:, decl:, outer:); end
+
+  # source://rbs/lib/rbs/environment.rb#122
+  def context; end
+
+  # Returns the value of attribute decl.
+  #
+  # source://rbs/lib/rbs/environment.rb#112
+  def decl; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/environment.rb#110
+  def name; end
+
+  # Returns the value of attribute outer.
+  #
+  # source://rbs/lib/rbs/environment.rb#111
+  def outer; end
+end
+
+# source://rbs/lib/rbs/environment.rb#136
+class RBS::Environment::TypeAliasEntry < ::RBS::Environment::SingleEntry; end
+
+# source://rbs/lib/rbs/environment/use_map.rb#5
+class RBS::Environment::UseMap
+  # @return [UseMap] a new instance of UseMap
+  #
+  # source://rbs/lib/rbs/environment/use_map.rb#30
+  def initialize(table:); end
+
+  # source://rbs/lib/rbs/environment/use_map.rb#36
+  def build_map(clause); end
+
+  # source://rbs/lib/rbs/environment/use_map.rb#72
+  def resolve(type_name); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/environment/use_map.rb#53
+  def resolve?(type_name); end
+
+  # Returns the value of attribute use_dirs.
+  #
+  # source://rbs/lib/rbs/environment/use_map.rb#28
+  def use_dirs; end
+end
+
+# source://rbs/lib/rbs/environment/use_map.rb#6
+class RBS::Environment::UseMap::Table
+  # @return [Table] a new instance of Table
+  #
+  # source://rbs/lib/rbs/environment/use_map.rb#9
+  def initialize; end
+
+  # Returns the value of attribute children.
+  #
+  # source://rbs/lib/rbs/environment/use_map.rb#7
+  def children; end
+
+  # source://rbs/lib/rbs/environment/use_map.rb#14
+  def compute_children; end
+
+  # Returns the value of attribute known_types.
+  #
+  # source://rbs/lib/rbs/environment/use_map.rb#7
+  def known_types; end
+end
+
+# source://rbs/lib/rbs/environment_loader.rb#4
+class RBS::EnvironmentLoader
+  include ::RBS::FileFinder
+
+  # @return [EnvironmentLoader] a new instance of EnvironmentLoader
+  #
+  # source://rbs/lib/rbs/environment_loader.rb#40
+  def initialize(core_root: T.unsafe(nil), repository: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/environment_loader.rb#48
+  def add(path: T.unsafe(nil), library: T.unsafe(nil), version: T.unsafe(nil), resolve_dependencies: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/environment_loader.rb#80
+  def add_collection(lockfile); end
+
+  # Returns the value of attribute core_root.
+  #
+  # source://rbs/lib/rbs/environment_loader.rb#20
+  def core_root; end
+
+  # Returns the value of attribute dirs.
+  #
+  # source://rbs/lib/rbs/environment_loader.rb#24
+  def dirs; end
+
+  # source://rbs/lib/rbs/environment_loader.rb#126
+  def each_dir; end
+
+  # source://rbs/lib/rbs/environment_loader.rb#149
+  def each_signature; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/environment_loader.rb#104
+  def has_library?(library:, version:); end
+
+  # Returns the value of attribute libs.
+  #
+  # source://rbs/lib/rbs/environment_loader.rb#23
+  def libs; end
+
+  # source://rbs/lib/rbs/environment_loader.rb#112
+  def load(env:); end
+
+  # Returns the value of attribute repository.
+  #
+  # source://rbs/lib/rbs/environment_loader.rb#21
+  def repository; end
+
+  # source://rbs/lib/rbs/environment_loader.rb#65
+  def resolve_dependencies(library:, version:); end
+
+  class << self
+    # source://rbs/lib/rbs/environment_loader.rb#28
+    def gem_sig_path(name, version); end
+  end
+end
+
+# source://rbs/lib/rbs/environment_loader.rb#26
+RBS::EnvironmentLoader::DEFAULT_CORE_ROOT = T.let(T.unsafe(nil), Pathname)
+
+# source://rbs/lib/rbs/environment_loader.rb#17
+class RBS::EnvironmentLoader::Library < ::Struct; end
+
+# source://rbs/lib/rbs/environment_loader.rb#5
+class RBS::EnvironmentLoader::UnknownLibraryError < ::StandardError
+  # @return [UnknownLibraryError] a new instance of UnknownLibraryError
+  #
+  # source://rbs/lib/rbs/environment_loader.rb#8
+  def initialize(lib:); end
+
+  # Returns the value of attribute library.
+  #
+  # source://rbs/lib/rbs/environment_loader.rb#6
+  def library; end
+end
+
+# source://rbs/lib/rbs/environment_walker.rb#4
+class RBS::EnvironmentWalker
+  include ::TSort
+
+  # @return [EnvironmentWalker] a new instance of EnvironmentWalker
+  #
+  # source://rbs/lib/rbs/environment_walker.rb#11
+  def initialize(env:); end
+
+  # source://rbs/lib/rbs/environment_walker.rb#16
+  def builder; end
+
+  # source://rbs/lib/rbs/environment_walker.rb#99
+  def each_type_name(type, &block); end
+
+  # source://rbs/lib/rbs/environment_walker.rb#105
+  def each_type_node(type, &block); end
+
+  # Returns the value of attribute env.
+  #
+  # source://rbs/lib/rbs/environment_walker.rb#9
+  def env; end
+
+  # source://rbs/lib/rbs/environment_walker.rb#20
+  def only_ancestors!(only = T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/environment_walker.rb#25
+  def only_ancestors?; end
+
+  # source://rbs/lib/rbs/environment_walker.rb#44
+  def tsort_each_child(node, &block); end
+
+  # source://rbs/lib/rbs/environment_walker.rb#31
+  def tsort_each_node(&block); end
+end
+
+# source://rbs/lib/rbs/environment_walker.rb#5
+class RBS::EnvironmentWalker::InstanceNode < ::Struct
+  def type_name; end
+  def type_name=(_); end
+
+  class << self
+    def [](*_arg0); end
+    def inspect; end
+    def keyword_init?; end
+    def members; end
+    def new(*_arg0); end
+  end
+end
+
+# source://rbs/lib/rbs/environment_walker.rb#6
+class RBS::EnvironmentWalker::SingletonNode < ::Struct
+  def type_name; end
+  def type_name=(_); end
+
+  class << self
+    def [](*_arg0); end
+    def inspect; end
+    def keyword_init?; end
+    def members; end
+    def new(*_arg0); end
+  end
+end
+
+# source://rbs/lib/rbs/environment_walker.rb#7
+class RBS::EnvironmentWalker::TypeNameNode < ::Struct
+  def type_name; end
+  def type_name=(_); end
+
+  class << self
+    def [](*_arg0); end
+    def inspect; end
+    def keyword_init?; end
+    def members; end
+    def new(*_arg0); end
+  end
+end
+
+# source://rbs/lib/rbs/factory.rb#4
+class RBS::Factory
+  # source://rbs/lib/rbs/factory.rb#5
+  def type_name(string); end
+end
+
+# source://rbs/lib/rbs/file_finder.rb#4
+module RBS::FileFinder
+  class << self
+    # source://rbs/lib/rbs/file_finder.rb#7
+    def each_file(path, skip_hidden:, immediate: T.unsafe(nil), &block); end
+  end
+end
+
+# source://rbs/lib/rbs/errors.rb#383
+class RBS::GenericParameterMismatchError < ::RBS::LoadingError
+  # @return [GenericParameterMismatchError] a new instance of GenericParameterMismatchError
+  #
+  # source://rbs/lib/rbs/errors.rb#387
+  def initialize(name:, decl:); end
+
+  # Returns the value of attribute decl.
+  #
+  # source://rbs/lib/rbs/errors.rb#385
+  def decl; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/errors.rb#384
+  def name; end
+end
+
+# source://rbs/lib/rbs/errors.rb#529
+class RBS::InconsistentClassModuleAliasError < ::RBS::BaseError
+  include ::RBS::DetailedMessageable
+
+  # @return [InconsistentClassModuleAliasError] a new instance of InconsistentClassModuleAliasError
+  #
+  # source://rbs/lib/rbs/errors.rb#534
+  def initialize(entry); end
+
+  # Returns the value of attribute alias_entry.
+  #
+  # source://rbs/lib/rbs/errors.rb#532
+  def alias_entry; end
+
+  # source://rbs/lib/rbs/errors.rb#548
+  def location; end
+end
+
+# source://rbs/lib/rbs/errors.rb#187
+class RBS::InheritModuleError < ::RBS::DefinitionError
+  include ::RBS::DetailedMessageable
+
+  # @return [InheritModuleError] a new instance of InheritModuleError
+  #
+  # source://rbs/lib/rbs/errors.rb#192
+  def initialize(super_decl); end
+
+  # source://rbs/lib/rbs/errors.rb#198
+  def location; end
+
+  # Returns the value of attribute super_decl.
+  #
+  # source://rbs/lib/rbs/errors.rb#190
+  def super_decl; end
+
+  class << self
+    # source://rbs/lib/rbs/errors.rb#202
+    def check!(super_decl, env:); end
+  end
+end
+
+# source://rbs/lib/rbs/errors.rb#354
+class RBS::InvalidOverloadMethodError < ::RBS::DefinitionError
+  include ::RBS::DetailedMessageable
+
+  # @return [InvalidOverloadMethodError] a new instance of InvalidOverloadMethodError
+  #
+  # source://rbs/lib/rbs/errors.rb#362
+  def initialize(type_name:, method_name:, kind:, members:); end
+
+  # Returns the value of attribute kind.
+  #
+  # source://rbs/lib/rbs/errors.rb#359
+  def kind; end
+
+  # source://rbs/lib/rbs/errors.rb#378
+  def location; end
+
+  # Returns the value of attribute members.
+  #
+  # source://rbs/lib/rbs/errors.rb#360
+  def members; end
+
+  # Returns the value of attribute method_name.
+  #
+  # source://rbs/lib/rbs/errors.rb#358
+  def method_name; end
+
+  # Returns the value of attribute type_name.
+  #
+  # source://rbs/lib/rbs/errors.rb#357
+  def type_name; end
+end
+
+# source://rbs/lib/rbs/errors.rb#67
+class RBS::InvalidTypeApplicationError < ::RBS::DefinitionError
+  # @return [InvalidTypeApplicationError] a new instance of InvalidTypeApplicationError
+  #
+  # source://rbs/lib/rbs/errors.rb#74
+  def initialize(type_name:, args:, params:, location:); end
+
+  # Returns the value of attribute args.
+  #
+  # source://rbs/lib/rbs/errors.rb#69
+  def args; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/errors.rb#72
+  def location; end
+
+  # Returns the value of attribute params.
+  #
+  # source://rbs/lib/rbs/errors.rb#70
+  def params; end
+
+  # Returns the value of attribute type_name.
+  #
+  # source://rbs/lib/rbs/errors.rb#68
+  def type_name; end
+
+  # Returns the value of attribute type_params.
+  #
+  # source://rbs/lib/rbs/errors.rb#71
+  def type_params; end
+
+  class << self
+    # source://rbs/lib/rbs/errors.rb#83
+    def check!(type_name:, args:, params:, location:); end
+
+    # source://rbs/lib/rbs/errors.rb#92
+    def check2!(env:, type_name:, args:, location:); end
+  end
+end
+
+# source://rbs/lib/rbs/errors.rb#407
+class RBS::InvalidVarianceAnnotationError < ::RBS::DefinitionError
+  include ::RBS::DetailedMessageable
+
+  # @return [InvalidVarianceAnnotationError] a new instance of InvalidVarianceAnnotationError
+  #
+  # source://rbs/lib/rbs/errors.rb#414
+  def initialize(type_name:, param:, location:); end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/errors.rb#412
+  def location; end
+
+  # Returns the value of attribute param.
+  #
+  # source://rbs/lib/rbs/errors.rb#411
+  def param; end
+
+  # Returns the value of attribute type_name.
+  #
+  # source://rbs/lib/rbs/errors.rb#410
+  def type_name; end
+end
+
+# source://rbs/lib/rbs/errors.rb#20
+class RBS::LoadingError < ::RBS::BaseError; end
+
+# source://rbs/lib/rbs/location_aux.rb#4
+class RBS::Location
+  def initialize(_arg0, _arg1, _arg2); end
+
+  # source://rbs/lib/rbs/location_aux.rb#71
+  def ==(other); end
+
+  def [](_arg0); end
+  def _add_optional_child(_arg0, _arg1, _arg2); end
+  def _add_optional_no_child(_arg0); end
+  def _add_required_child(_arg0, _arg1, _arg2); end
+  def _optional_keys; end
+  def _required_keys; end
+
+  # source://rbs/lib/rbs/location_aux.rb#102
+  def add_optional_child(name, range); end
+
+  # source://rbs/lib/rbs/location_aux.rb#98
+  def add_required_child(name, range); end
+
+  def aref(_arg0); end
+  def buffer; end
+
+  # source://rbs/lib/rbs/location_aux.rb#110
+  def each_optional_key(&block); end
+
+  # source://rbs/lib/rbs/location_aux.rb#118
+  def each_required_key(&block); end
+
+  # source://rbs/lib/rbs/location_aux.rb#47
+  def end_column; end
+
+  # source://rbs/lib/rbs/location_aux.rb#43
+  def end_line; end
+
+  # source://rbs/lib/rbs/location_aux.rb#55
+  def end_loc; end
+
+  def end_pos; end
+
+  # source://rbs/lib/rbs/location_aux.rb#5
+  def inspect; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/location_aux.rb#126
+  def key?(name); end
+
+  # source://rbs/lib/rbs/location_aux.rb#31
+  def name; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/location_aux.rb#130
+  def optional_key?(name); end
+
+  # source://rbs/lib/rbs/location_aux.rb#59
+  def range; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/location_aux.rb#134
+  def required_key?(name); end
+
+  # source://rbs/lib/rbs/location_aux.rb#63
+  def source; end
+
+  # source://rbs/lib/rbs/location_aux.rb#39
+  def start_column; end
+
+  # source://rbs/lib/rbs/location_aux.rb#35
+  def start_line; end
+
+  # source://rbs/lib/rbs/location_aux.rb#51
+  def start_loc; end
+
+  def start_pos; end
+
+  # source://rbs/lib/rbs/location_aux.rb#78
+  def to_json(state = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/location_aux.rb#67
+  def to_s; end
+
+  private
+
+  def initialize_copy(_arg0); end
+
+  class << self
+    # source://rbs/lib/rbs/location_aux.rb#16
+    def new(buffer_ = T.unsafe(nil), start_pos_ = T.unsafe(nil), end_pos_ = T.unsafe(nil), buffer: T.unsafe(nil), start_pos: T.unsafe(nil), end_pos: T.unsafe(nil)); end
+
+    # source://rbs/lib/rbs/location_aux.rb#94
+    def to_string(location, default: T.unsafe(nil)); end
+  end
+end
+
+# source://rbs/lib/rbs/location_aux.rb#29
+RBS::Location::WithChildren = RBS::Location
+
+# source://rbs/lib/rbs/locator.rb#4
+class RBS::Locator
+  # @return [Locator] a new instance of Locator
+  #
+  # source://rbs/lib/rbs/locator.rb#7
+  def initialize(buffer:, dirs:, decls:); end
+
+  # Returns the value of attribute buffer.
+  #
+  # source://rbs/lib/rbs/locator.rb#5
+  def buffer; end
+
+  # Returns the value of attribute decls.
+  #
+  # source://rbs/lib/rbs/locator.rb#5
+  def decls; end
+
+  # Returns the value of attribute dirs.
+  #
+  # source://rbs/lib/rbs/locator.rb#5
+  def dirs; end
+
+  # source://rbs/lib/rbs/locator.rb#13
+  def find(line:, column:); end
+
+  # source://rbs/lib/rbs/locator.rb#29
+  def find2(line:, column:); end
+
+  # source://rbs/lib/rbs/locator.rb#58
+  def find_in_decl(pos, decl:, array:); end
+
+  # source://rbs/lib/rbs/locator.rb#42
+  def find_in_directive(pos, dir, array); end
+
+  # source://rbs/lib/rbs/locator.rb#206
+  def find_in_loc(pos, location:, array:); end
+
+  # source://rbs/lib/rbs/locator.rb#129
+  def find_in_member(pos, member:, array:); end
+
+  # source://rbs/lib/rbs/locator.rb#152
+  def find_in_method_type(pos, method_type:, array:); end
+
+  # source://rbs/lib/rbs/locator.rb#190
+  def find_in_type(pos, type:, array:); end
+
+  # source://rbs/lib/rbs/locator.rb#170
+  def find_in_type_param(pos, type_param:, array:); end
+
+  # source://rbs/lib/rbs/locator.rb#233
+  def test_loc(pos, location:); end
+end
+
+# source://rbs/lib/rbs/errors.rb#4
+module RBS::MethodNameHelper
+  # source://rbs/lib/rbs/errors.rb#5
+  def method_name_string; end
+end
+
+# source://rbs/lib/rbs/method_type.rb#4
+class RBS::MethodType
+  # @return [MethodType] a new instance of MethodType
+  #
+  # source://rbs/lib/rbs/method_type.rb#10
+  def initialize(type_params:, type:, block:, location:); end
+
+  # source://rbs/lib/rbs/method_type.rb#17
+  def ==(other); end
+
+  # Returns the value of attribute block.
+  #
+  # source://rbs/lib/rbs/method_type.rb#7
+  def block; end
+
+  # source://rbs/lib/rbs/method_type.rb#84
+  def each_type(&block); end
+
+  # source://rbs/lib/rbs/method_type.rb#57
+  def free_variables(set = T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/method_type.rb#125
+  def has_classish_type?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/method_type.rb#121
+  def has_self_type?; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/method_type.rb#8
+  def location; end
+
+  # source://rbs/lib/rbs/method_type.rb#63
+  def map_type(&block); end
+
+  # source://rbs/lib/rbs/method_type.rb#72
+  def map_type_bound(&block); end
+
+  # source://rbs/lib/rbs/method_type.rb#33
+  def sub(s); end
+
+  # source://rbs/lib/rbs/method_type.rb#24
+  def to_json(state = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/method_type.rb#98
+  def to_s; end
+
+  # Returns the value of attribute type.
+  #
+  # source://rbs/lib/rbs/method_type.rb#6
+  def type; end
+
+  # source://rbs/lib/rbs/method_type.rb#117
+  def type_param_names; end
+
+  # Returns the value of attribute type_params.
+  #
+  # source://rbs/lib/rbs/method_type.rb#5
+  def type_params; end
+
+  # source://rbs/lib/rbs/method_type.rb#48
+  def update(type_params: T.unsafe(nil), type: T.unsafe(nil), block: T.unsafe(nil), location: T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/method_type.rb#129
+  def with_nonreturn_void?; end
+end
+
+# source://rbs/lib/rbs/errors.rb#443
+class RBS::MixinClassError < ::RBS::DefinitionError
+  include ::RBS::DetailedMessageable
+
+  # @return [MixinClassError] a new instance of MixinClassError
+  #
+  # source://rbs/lib/rbs/errors.rb#449
+  def initialize(type_name:, member:); end
+
+  # source://rbs/lib/rbs/errors.rb#456
+  def location; end
+
+  # Returns the value of attribute member.
+  #
+  # source://rbs/lib/rbs/errors.rb#447
+  def member; end
+
+  # Returns the value of attribute type_name.
+  #
+  # source://rbs/lib/rbs/errors.rb#446
+  def type_name; end
+
+  private
+
+  # source://rbs/lib/rbs/errors.rb#468
+  def mixin_name; end
+
+  class << self
+    # source://rbs/lib/rbs/errors.rb#460
+    def check!(type_name:, env:, member:); end
+  end
+end
+
+# source://rbs/lib/rbs/namespace.rb#4
+class RBS::Namespace
+  # @return [Namespace] a new instance of Namespace
+  #
+  # source://rbs/lib/rbs/namespace.rb#7
+  def initialize(path:, absolute:); end
+
+  # source://rbs/lib/rbs/namespace.rb#20
+  def +(other); end
+
+  # source://rbs/lib/rbs/namespace.rb#59
+  def ==(other); end
+
+  # source://rbs/lib/rbs/namespace.rb#47
+  def absolute!; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/namespace.rb#39
+  def absolute?; end
+
+  # source://rbs/lib/rbs/namespace.rb#28
+  def append(component); end
+
+  # source://rbs/lib/rbs/namespace.rb#101
+  def ascend; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/namespace.rb#55
+  def empty?; end
+
+  # source://rbs/lib/rbs/namespace.rb#59
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/namespace.rb#65
+  def hash; end
+
+  # source://rbs/lib/rbs/namespace.rb#32
+  def parent; end
+
+  # Returns the value of attribute path.
+  #
+  # source://rbs/lib/rbs/namespace.rb#5
+  def path; end
+
+  # source://rbs/lib/rbs/namespace.rb#51
+  def relative!; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/namespace.rb#43
+  def relative?; end
+
+  # source://rbs/lib/rbs/namespace.rb#69
+  def split; end
+
+  # source://rbs/lib/rbs/namespace.rb#75
+  def to_s; end
+
+  # source://rbs/lib/rbs/namespace.rb#84
+  def to_type_name; end
+
+  class << self
+    # source://rbs/lib/rbs/namespace.rb#12
+    def empty; end
+
+    # source://rbs/lib/rbs/namespace.rb#93
+    def parse(string); end
+
+    # source://rbs/lib/rbs/namespace.rb#16
+    def root; end
+  end
+end
+
+# source://rbs/lib/rbs/errors.rb#229
+class RBS::NoMixinFoundError < ::RBS::DefinitionError
+  include ::RBS::DetailedMessageable
+
+  # @return [NoMixinFoundError] a new instance of NoMixinFoundError
+  #
+  # source://rbs/lib/rbs/errors.rb#235
+  def initialize(type_name:, member:); end
+
+  # source://rbs/lib/rbs/errors.rb#242
+  def location; end
+
+  # Returns the value of attribute member.
+  #
+  # source://rbs/lib/rbs/errors.rb#233
+  def member; end
+
+  # Returns the value of attribute type_name.
+  #
+  # source://rbs/lib/rbs/errors.rb#232
+  def type_name; end
+
+  class << self
+    # source://rbs/lib/rbs/errors.rb#246
+    def check!(type_name, env:, member:); end
+  end
+end
+
+# source://rbs/lib/rbs/errors.rb#210
+class RBS::NoSelfTypeFoundError < ::RBS::DefinitionError
+  include ::RBS::DetailedMessageable
+
+  # @return [NoSelfTypeFoundError] a new instance of NoSelfTypeFoundError
+  #
+  # source://rbs/lib/rbs/errors.rb#216
+  def initialize(type_name:, location:); end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/errors.rb#214
+  def location; end
+
+  # Returns the value of attribute type_name.
+  #
+  # source://rbs/lib/rbs/errors.rb#213
+  def type_name; end
+
+  class << self
+    # source://rbs/lib/rbs/errors.rb#223
+    def check!(self_type, env:); end
+  end
+end
+
+# source://rbs/lib/rbs/errors.rb#167
+class RBS::NoSuperclassFoundError < ::RBS::DefinitionError
+  # @return [NoSuperclassFoundError] a new instance of NoSuperclassFoundError
+  #
+  # source://rbs/lib/rbs/errors.rb#171
+  def initialize(type_name:, location:); end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/errors.rb#169
+  def location; end
+
+  # Returns the value of attribute type_name.
+  #
+  # source://rbs/lib/rbs/errors.rb#168
+  def type_name; end
+
+  class << self
+    # source://rbs/lib/rbs/errors.rb#178
+    def check!(type_name, env:, location:); end
+  end
+end
+
+# source://rbs/lib/rbs/errors.rb#148
+class RBS::NoTypeFoundError < ::RBS::DefinitionError
+  include ::RBS::DetailedMessageable
+
+  # @return [NoTypeFoundError] a new instance of NoTypeFoundError
+  #
+  # source://rbs/lib/rbs/errors.rb#154
+  def initialize(type_name:, location:); end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/errors.rb#152
+  def location; end
+
+  # Returns the value of attribute type_name.
+  #
+  # source://rbs/lib/rbs/errors.rb#151
+  def type_name; end
+
+  class << self
+    # source://rbs/lib/rbs/errors.rb#161
+    def check!(type_name, env:, location:); end
+  end
+end
+
+# source://rbs/lib/rbs/errors.rb#500
+class RBS::NonregularTypeAliasError < ::RBS::BaseError
+  include ::RBS::DetailedMessageable
+
+  # @return [NonregularTypeAliasError] a new instance of NonregularTypeAliasError
+  #
+  # source://rbs/lib/rbs/errors.rb#506
+  def initialize(diagnostic:, location:); end
+
+  # Returns the value of attribute diagnostic.
+  #
+  # source://rbs/lib/rbs/errors.rb#503
+  def diagnostic; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/errors.rb#504
+  def location; end
+end
+
+# source://rbs/lib/rbs/parser/lex_result.rb#4
+class RBS::Parser
+  class << self
+    def _lex(_arg0, _arg1); end
+    def _parse_method_type(_arg0, _arg1, _arg2, _arg3, _arg4); end
+    def _parse_signature(_arg0, _arg1); end
+    def _parse_type(_arg0, _arg1, _arg2, _arg3, _arg4); end
+
+    # source://rbs/lib/rbs/parser_aux.rb#34
+    def buffer(source); end
+
+    # source://rbs/lib/rbs/parser_aux.rb#25
+    def lex(source); end
+
+    # source://rbs/lib/rbs/parser_aux.rb#13
+    def parse_method_type(source, range: T.unsafe(nil), variables: T.unsafe(nil), require_eof: T.unsafe(nil)); end
+
+    # source://rbs/lib/rbs/parser_aux.rb#18
+    def parse_signature(source); end
+
+    # source://rbs/lib/rbs/parser_aux.rb#8
+    def parse_type(source, range: T.unsafe(nil), variables: T.unsafe(nil), require_eof: T.unsafe(nil)); end
+  end
+end
+
+# source://rbs/lib/rbs/parser_aux.rb#43
+RBS::Parser::KEYWORDS = T.let(T.unsafe(nil), Hash)
+
+# source://rbs/lib/rbs/parser/lex_result.rb#5
+class RBS::Parser::LexResult
+  # @return [LexResult] a new instance of LexResult
+  #
+  # source://rbs/lib/rbs/parser/lex_result.rb#9
+  def initialize(buffer:, value:); end
+
+  # Returns the value of attribute buffer.
+  #
+  # source://rbs/lib/rbs/parser/lex_result.rb#6
+  def buffer; end
+
+  # Returns the value of attribute value.
+  #
+  # source://rbs/lib/rbs/parser/lex_result.rb#7
+  def value; end
+end
+
+# source://rbs/lib/rbs/parser/token.rb#5
+class RBS::Parser::Token
+  # @return [Token] a new instance of Token
+  #
+  # source://rbs/lib/rbs/parser/token.rb#9
+  def initialize(type:, location:); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/parser/token.rb#18
+  def comment?; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/parser/token.rb#7
+  def location; end
+
+  # Returns the value of attribute type.
+  #
+  # source://rbs/lib/rbs/parser/token.rb#6
+  def type; end
+
+  # source://rbs/lib/rbs/parser/token.rb#14
+  def value; end
+end
+
+# source://rbs/lib/rbs/errors.rb#51
+class RBS::ParsingError < ::RBS::BaseError
+  include ::RBS::DetailedMessageable
+
+  # @return [ParsingError] a new instance of ParsingError
+  #
+  # source://rbs/lib/rbs/errors.rb#58
+  def initialize(location, error_message, token_type); end
+
+  # Returns the value of attribute error_message.
+  #
+  # source://rbs/lib/rbs/errors.rb#55
+  def error_message; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/errors.rb#54
+  def location; end
+
+  # Returns the value of attribute token_type.
+  #
+  # source://rbs/lib/rbs/errors.rb#56
+  def token_type; end
+end
+
+# source://rbs/lib/rbs/prototype/helpers.rb#4
+module RBS::Prototype; end
+
+# source://rbs/lib/rbs/prototype/helpers.rb#5
+module RBS::Prototype::Helpers
+  private
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/prototype/helpers.rb#96
+  def any_node?(node, nodes: T.unsafe(nil), &block); end
+
+  # NOTE: args_node may be a nil by a bug
+  #       https://bugs.ruby-lang.org/issues/17495
+  #
+  # source://rbs/lib/rbs/prototype/helpers.rb#120
+  def args_from_node(args_node); end
+
+  # source://rbs/lib/rbs/prototype/helpers.rb#8
+  def block_from_body(node); end
+
+  # source://rbs/lib/rbs/prototype/helpers.rb#84
+  def each_child(node, &block); end
+
+  # source://rbs/lib/rbs/prototype/helpers.rb#88
+  def each_node(nodes); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/prototype/helpers.rb#108
+  def keyword_hash?(node); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/prototype/helpers.rb#124
+  def symbol_literal_node?(node); end
+
+  # source://rbs/lib/rbs/prototype/helpers.rb#135
+  def untyped; end
+end
+
+# source://rbs/lib/rbs/prototype/node_usage.rb#5
+class RBS::Prototype::NodeUsage
+  include ::RBS::Prototype::Helpers
+
+  # @return [NodeUsage] a new instance of NodeUsage
+  #
+  # source://rbs/lib/rbs/prototype/node_usage.rb#10
+  def initialize(node); end
+
+  # source://rbs/lib/rbs/prototype/node_usage.rb#25
+  def calculate(node, conditional:); end
+
+  # Returns the value of attribute conditional_nodes.
+  #
+  # source://rbs/lib/rbs/prototype/node_usage.rb#8
+  def conditional_nodes; end
+
+  # source://rbs/lib/rbs/prototype/node_usage.rb#17
+  def each_conditional_node(&block); end
+end
+
+# source://rbs/lib/rbs/prototype/rb.rb#5
+class RBS::Prototype::RB
+  include ::RBS::Prototype::Helpers
+
+  # @return [RB] a new instance of RB
+  #
+  # source://rbs/lib/rbs/prototype/rb.rb#45
+  def initialize; end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#556
+  def block_type(node); end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#536
+  def body_type(node); end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#451
+  def const_to_name(node, context:); end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#432
+  def const_to_name!(node); end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#764
+  def current_accessibility(decls, index = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#49
+  def decls; end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#804
+  def find_def_index_by_name(decls, name); end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#531
+  def function_return_type_from_body(node); end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#473
+  def function_type_from_body(node, def_name); end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#549
+  def if_unless_type(node); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/prototype/rb.rb#800
+  def is_accessibility?(decl); end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#462
+  def literal_to_symbol(node); end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#570
+  def literal_to_type(node); end
+
+  # backward compatible
+  #
+  # source://rbs/lib/rbs/prototype/rb.rb#711
+  def node_type(node, default: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#711
+  def param_type(node, default: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#75
+  def parse(string); end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#756
+  def private; end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#107
+  def process(node, decls:, comments:, context:); end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#426
+  def process_children(node, decls:, comments:, context:); end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#760
+  def public; end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#691
+  def range_element_type(types); end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#774
+  def remove_unnecessary_accessibility_methods!(decls); end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#822
+  def sort_members!(decls); end
+
+  # Returns the value of attribute source_decls.
+  #
+  # source://rbs/lib/rbs/prototype/rb.rb#42
+  def source_decls; end
+
+  # Returns the value of attribute toplevel_members.
+  #
+  # source://rbs/lib/rbs/prototype/rb.rb#43
+  def toplevel_members; end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#680
+  def types_to_union_type(types); end
+end
+
+# source://rbs/lib/rbs/prototype/rb.rb#8
+class RBS::Prototype::RB::Context < ::Struct
+  # source://rbs/lib/rbs/prototype/rb.rb#25
+  def attribute_kind; end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#33
+  def enter_namespace(namespace); end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#15
+  def method_kind; end
+
+  # source://rbs/lib/rbs/prototype/rb.rb#37
+  def update(module_function: T.unsafe(nil), singleton: T.unsafe(nil), in_def: T.unsafe(nil)); end
+
+  class << self
+    # source://rbs/lib/rbs/prototype/rb.rb#11
+    def initial(namespace: T.unsafe(nil)); end
+  end
+end
+
+# source://rbs/lib/rbs/prototype/rbi.rb#5
+class RBS::Prototype::RBI
+  include ::RBS::Prototype::Helpers
+
+  # @return [RBI] a new instance of RBI
+  #
+  # source://rbs/lib/rbs/prototype/rbi.rb#12
+  def initialize; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/prototype/rbi.rb#557
+  def call_node?(node, name:, receiver: T.unsafe(nil), args: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/prototype/rbi.rb#561
+  def const_to_name(node); end
+
+  # source://rbs/lib/rbs/prototype/rbi.rb#92
+  def current_module; end
+
+  # source://rbs/lib/rbs/prototype/rbi.rb#96
+  def current_module!; end
+
+  # source://rbs/lib/rbs/prototype/rbi.rb#48
+  def current_namespace; end
+
+  # Returns the value of attribute decls.
+  #
+  # source://rbs/lib/rbs/prototype/rbi.rb#8
+  def decls; end
+
+  # source://rbs/lib/rbs/prototype/rbi.rb#597
+  def each_arg(array, &block); end
+
+  # source://rbs/lib/rbs/prototype/rbi.rb#611
+  def each_child(node); end
+
+  # source://rbs/lib/rbs/prototype/rbi.rb#114
+  def join_comments(nodes, comments); end
+
+  # Returns the value of attribute last_sig.
+  #
+  # source://rbs/lib/rbs/prototype/rbi.rb#10
+  def last_sig; end
+
+  # source://rbs/lib/rbs/prototype/rbi.rb#281
+  def method_type(args_node, type_node, variables:, overloads:); end
+
+  # Returns the value of attribute modules.
+  #
+  # source://rbs/lib/rbs/prototype/rbi.rb#9
+  def modules; end
+
+  # source://rbs/lib/rbs/prototype/rbi.rb#44
+  def nested_name(name); end
+
+  # source://rbs/lib/rbs/prototype/rbi.rb#619
+  def node_to_hash(node); end
+
+  # source://rbs/lib/rbs/prototype/rbi.rb#18
+  def parse(string); end
+
+  # source://rbs/lib/rbs/prototype/rbi.rb#347
+  def parse_params(args_node, args, method_type, variables:, overloads:); end
+
+  # source://rbs/lib/rbs/prototype/rbi.rb#108
+  def pop_sig; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/prototype/rbi.rb#549
+  def proc_type?(type_node); end
+
+  # source://rbs/lib/rbs/prototype/rbi.rb#119
+  def process(node, comments:, outer: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/prototype/rbi.rb#54
+  def push_class(name, super_class, comment:); end
+
+  # source://rbs/lib/rbs/prototype/rbi.rb#73
+  def push_module(name, comment:); end
+
+  # source://rbs/lib/rbs/prototype/rbi.rb#100
+  def push_sig(node); end
+
+  # source://rbs/lib/rbs/prototype/rbi.rb#472
+  def type_of(type_node, variables:); end
+
+  # source://rbs/lib/rbs/prototype/rbi.rb#485
+  def type_of0(type_node, variables:); end
+end
+
+# source://rbs/lib/rbs/prototype/runtime/helpers.rb#5
+class RBS::Prototype::Runtime
+  include ::RBS::Prototype::Helpers
+  include ::RBS::Prototype::Runtime::Helpers
+
+  # @return [Runtime] a new instance of Runtime
+  #
+  # source://rbs/lib/rbs/prototype/runtime.rb#70
+  def initialize(patterns:, env:, merge:, todo: T.unsafe(nil), owners_included: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/prototype/runtime.rb#650
+  def block_from_ast_of(method); end
+
+  # source://rbs/lib/rbs/prototype/runtime.rb#100
+  def builder; end
+
+  # source://rbs/lib/rbs/prototype/runtime.rb#108
+  def decls; end
+
+  # Generate/find outer module declarations
+  # This is broken down into another method to comply with `DRY`
+  # This generates/finds declarations in nested form & returns the last array of declarations
+  #
+  # source://rbs/lib/rbs/prototype/runtime.rb#579
+  def ensure_outer_module_declarations(mod); end
+
+  # Returns the value of attribute env.
+  #
+  # source://rbs/lib/rbs/prototype/runtime.rb#64
+  def env; end
+
+  # source://rbs/lib/rbs/prototype/runtime.rb#484
+  def generate_class(mod); end
+
+  # source://rbs/lib/rbs/prototype/runtime.rb#422
+  def generate_constants(mod, decls); end
+
+  # source://rbs/lib/rbs/prototype/runtime.rb#298
+  def generate_methods(mod, module_name, members); end
+
+  # source://rbs/lib/rbs/prototype/runtime.rb#561
+  def generate_mixin(mod, decl, type_name, type_name_absolute); end
+
+  # source://rbs/lib/rbs/prototype/runtime.rb#523
+  def generate_module(mod); end
+
+  # source://rbs/lib/rbs/prototype/runtime.rb#469
+  def generate_super_class(mod); end
+
+  # Returns the value of attribute merge.
+  #
+  # source://rbs/lib/rbs/prototype/runtime.rb#65
+  def merge; end
+
+  # source://rbs/lib/rbs/prototype/runtime.rb#239
+  def merge_rbs(module_name, members, instance: T.unsafe(nil), singleton: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/prototype/runtime.rb#170
+  def method_type(method); end
+
+  # Returns the value of attribute outline.
+  #
+  # source://rbs/lib/rbs/prototype/runtime.rb#68
+  def outline; end
+
+  # Sets the attribute outline
+  #
+  # @param value the value to set the attribute outline to.
+  #
+  # source://rbs/lib/rbs/prototype/runtime.rb#68
+  def outline=(_arg0); end
+
+  # Returns the value of attribute owners_included.
+  #
+  # source://rbs/lib/rbs/prototype/runtime.rb#67
+  def owners_included; end
+
+  # source://rbs/lib/rbs/prototype/runtime.rb#104
+  def parse(file); end
+
+  # Returns the value of attribute patterns.
+  #
+  # source://rbs/lib/rbs/prototype/runtime.rb#63
+  def patterns; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/prototype/runtime.rb#83
+  def target?(const); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/prototype/runtime.rb#285
+  def target_method?(mod, instance: T.unsafe(nil), singleton: T.unsafe(nil)); end
+
+  # Returns the value of attribute todo.
+  #
+  # source://rbs/lib/rbs/prototype/runtime.rb#66
+  def todo; end
+
+  # source://rbs/lib/rbs/prototype/runtime.rb#96
+  def todo_object; end
+
+  # source://rbs/lib/rbs/prototype/runtime.rb#633
+  def type_args(type_name); end
+
+  # source://rbs/lib/rbs/prototype/runtime.rb#641
+  def type_params(mod); end
+
+  private
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/prototype/runtime.rb#412
+  def can_alias?(mod, method); end
+
+  # source://rbs/lib/rbs/prototype/runtime.rb#128
+  def each_mixined_module(type_name, mod); end
+
+  # source://rbs/lib/rbs/prototype/runtime.rb#137
+  def each_mixined_module_one(type_name, mod); end
+end
+
+# source://rbs/lib/rbs/prototype/runtime/value_object_generator.rb#211
+class RBS::Prototype::Runtime::DataGenerator < ::RBS::Prototype::Runtime::ValueObjectBase
+  private
+
+  # source://rbs/lib/rbs/prototype/runtime/value_object_generator.rb#227
+  def add_decl_members(decl); end
+
+  # def self.new: (untyped foo, untyped bar) -> instance
+  #             | (foo: untyped, bar: untyped) -> instance
+  #
+  # source://rbs/lib/rbs/prototype/runtime/value_object_generator.rb#235
+  def build_s_new; end
+
+  # source://rbs/lib/rbs/prototype/runtime/value_object_generator.rb#223
+  def build_super_class; end
+
+  class << self
+    # @return [Boolean]
+    #
+    # source://rbs/lib/rbs/prototype/runtime/value_object_generator.rb#212
+    def generatable?(target); end
+  end
+end
+
+# source://rbs/lib/rbs/prototype/runtime/helpers.rb#6
+module RBS::Prototype::Runtime::Helpers
+  private
+
+  # source://rbs/lib/rbs/prototype/runtime/helpers.rb#19
+  def const_name(const); end
+
+  # source://rbs/lib/rbs/prototype/runtime/helpers.rb#15
+  def const_name!(const); end
+
+  # Returns the exact name & not compactly declared name
+  #
+  # source://rbs/lib/rbs/prototype/runtime/helpers.rb#10
+  def only_name(mod); end
+
+  # source://rbs/lib/rbs/prototype/runtime/helpers.rb#37
+  def to_type_name(name, full_name: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/prototype/runtime/helpers.rb#53
+  def untyped; end
+end
+
+# source://rbs/lib/rbs/prototype/runtime/reflection.rb#6
+module RBS::Prototype::Runtime::Reflection
+  class << self
+    # source://rbs/lib/rbs/prototype/runtime/reflection.rb#12
+    def constants_of(mod, inherit = T.unsafe(nil)); end
+
+    # source://rbs/lib/rbs/prototype/runtime/reflection.rb#7
+    def object_class(value); end
+  end
+end
+
+# source://rbs/lib/rbs/prototype/runtime/value_object_generator.rb#89
+class RBS::Prototype::Runtime::StructGenerator < ::RBS::Prototype::Runtime::ValueObjectBase
+  private
+
+  # source://rbs/lib/rbs/prototype/runtime/value_object_generator.rb#106
+  def add_decl_members(decl); end
+
+  # source://rbs/lib/rbs/prototype/runtime/value_object_generator.rb#163
+  def build_overload_for_keyword_arguments; end
+
+  # source://rbs/lib/rbs/prototype/runtime/value_object_generator.rb#149
+  def build_overload_for_positional_arguments; end
+
+  # def self.keyword_init?: () -> bool?
+  #
+  # source://rbs/lib/rbs/prototype/runtime/value_object_generator.rb#178
+  def build_s_keyword_init_p; end
+
+  # def self.new: (?untyped foo, ?untyped bar) -> instance
+  #             | (?foo: untyped, ?bar: untyped) -> instance
+  #
+  # source://rbs/lib/rbs/prototype/runtime/value_object_generator.rb#115
+  def build_s_new; end
+
+  # source://rbs/lib/rbs/prototype/runtime/value_object_generator.rb#102
+  def build_super_class; end
+
+  class << self
+    # @return [Boolean]
+    #
+    # source://rbs/lib/rbs/prototype/runtime/value_object_generator.rb#90
+    def generatable?(target); end
+  end
+end
+
+# source://rbs/lib/rbs/prototype/runtime/value_object_generator.rb#100
+RBS::Prototype::Runtime::StructGenerator::CAN_CALL_KEYWORD_INIT_P = T.let(T.unsafe(nil), TrueClass)
+
+# source://rbs/lib/rbs/prototype/runtime.rb#10
+class RBS::Prototype::Runtime::Todo
+  # @return [Todo] a new instance of Todo
+  #
+  # source://rbs/lib/rbs/prototype/runtime.rb#11
+  def initialize(builder:); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/prototype/runtime.rb#42
+  def skip_constant?(module_name:, name:); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/prototype/runtime.rb#33
+  def skip_instance_method?(module_name:, method:, accessibility:); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/prototype/runtime.rb#15
+  def skip_mixin?(type_name:, module_name:, mixin_class:); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/prototype/runtime.rb#24
+  def skip_singleton_method?(module_name:, method:, accessibility:); end
+
+  private
+
+  # source://rbs/lib/rbs/prototype/runtime.rb#49
+  def mixin_decls(type_name); end
+end
+
+# source://rbs/lib/rbs/prototype/runtime/value_object_generator.rb#8
+class RBS::Prototype::Runtime::ValueObjectBase
+  include ::RBS::Prototype::Runtime::Helpers
+
+  # @return [ValueObjectBase] a new instance of ValueObjectBase
+  #
+  # source://rbs/lib/rbs/prototype/runtime/value_object_generator.rb#11
+  def initialize(target_class); end
+
+  # source://rbs/lib/rbs/prototype/runtime/value_object_generator.rb#15
+  def build_decl; end
+
+  private
+
+  # attr_accessor foo: untyped
+  #
+  # source://rbs/lib/rbs/prototype/runtime/value_object_generator.rb#74
+  def build_member_accessors(ast_members_class); end
+
+  # def self.members: () -> [ :foo, :bar ]
+  # def members: () -> [ :foo, :bar ]
+  #
+  # source://rbs/lib/rbs/prototype/runtime/value_object_generator.rb#35
+  def build_s_members; end
+end
+
+# source://rbs/lib/rdoc_plugin/parser.rb#6
+module RBS::RDocPlugin; end
+
+# source://rbs/lib/rdoc_plugin/parser.rb#7
+class RBS::RDocPlugin::Parser
+  # @return [Parser] a new instance of Parser
+  #
+  # source://rbs/lib/rdoc_plugin/parser.rb#11
+  def initialize(top_level, content); end
+
+  # Returns the value of attribute content.
+  #
+  # source://rbs/lib/rdoc_plugin/parser.rb#9
+  def content; end
+
+  # Sets the attribute content
+  #
+  # @param value the value to set the attribute content to.
+  #
+  # source://rbs/lib/rdoc_plugin/parser.rb#9
+  def content=(_arg0); end
+
+  # source://rbs/lib/rdoc_plugin/parser.rb#94
+  def parse_attr_decl(decl:, context:, outer_name: T.unsafe(nil)); end
+
+  # source://rbs/lib/rdoc_plugin/parser.rb#53
+  def parse_class_decl(decl:, context:, outer_name: T.unsafe(nil)); end
+
+  # source://rbs/lib/rdoc_plugin/parser.rb#67
+  def parse_constant_decl(decl:, context:, outer_name: T.unsafe(nil)); end
+
+  # source://rbs/lib/rdoc_plugin/parser.rb#125
+  def parse_extend_decl(decl:, context:, outer_name: T.unsafe(nil)); end
+
+  # source://rbs/lib/rdoc_plugin/parser.rb#109
+  def parse_include_decl(decl:, context:, outer_name: T.unsafe(nil)); end
+
+  # source://rbs/lib/rdoc_plugin/parser.rb#24
+  def parse_member(decl:, context:, outer_name: T.unsafe(nil)); end
+
+  # source://rbs/lib/rdoc_plugin/parser.rb#88
+  def parse_method_alias_decl(decl:, context:, outer_name: T.unsafe(nil)); end
+
+  # source://rbs/lib/rdoc_plugin/parser.rb#73
+  def parse_method_decl(decl:, context:, outer_name: T.unsafe(nil)); end
+
+  # source://rbs/lib/rdoc_plugin/parser.rb#60
+  def parse_module_decl(decl:, context:, outer_name: T.unsafe(nil)); end
+
+  # source://rbs/lib/rdoc_plugin/parser.rb#16
+  def scan; end
+
+  # Returns the value of attribute top_level.
+  #
+  # source://rbs/lib/rdoc_plugin/parser.rb#9
+  def top_level; end
+
+  # Sets the attribute top_level
+  #
+  # @param value the value to set the attribute top_level to.
+  #
+  # source://rbs/lib/rdoc_plugin/parser.rb#9
+  def top_level=(_arg0); end
+
+  private
+
+  # source://rbs/lib/rdoc_plugin/parser.rb#149
+  def comment_string(with_comment); end
+
+  # source://rbs/lib/rdoc_plugin/parser.rb#143
+  def construct_comment(context:, comment:); end
+
+  # source://rbs/lib/rdoc_plugin/parser.rb#154
+  def fully_qualified_name(outer_name:, decl:); end
+end
+
+# source://rbs/lib/rbs/errors.rb#423
+class RBS::RecursiveAliasDefinitionError < ::RBS::DefinitionError
+  include ::RBS::DetailedMessageable
+
+  # @return [RecursiveAliasDefinitionError] a new instance of RecursiveAliasDefinitionError
+  #
+  # source://rbs/lib/rbs/errors.rb#429
+  def initialize(type:, defs:); end
+
+  # Returns the value of attribute defs.
+  #
+  # source://rbs/lib/rbs/errors.rb#427
+  def defs; end
+
+  # source://rbs/lib/rbs/errors.rb#436
+  def location; end
+
+  # Returns the value of attribute type.
+  #
+  # source://rbs/lib/rbs/errors.rb#426
+  def type; end
+end
+
+# source://rbs/lib/rbs/errors.rb#110
+class RBS::RecursiveAncestorError < ::RBS::DefinitionError
+  # @return [RecursiveAncestorError] a new instance of RecursiveAncestorError
+  #
+  # source://rbs/lib/rbs/errors.rb#114
+  def initialize(ancestors:, location:); end
+
+  # Returns the value of attribute ancestors.
+  #
+  # source://rbs/lib/rbs/errors.rb#111
+  def ancestors; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/errors.rb#112
+  def location; end
+
+  class << self
+    # source://rbs/lib/rbs/errors.rb#134
+    def check!(self_ancestor, ancestors:, location:); end
+  end
+end
+
+# source://rbs/lib/rbs/errors.rb#482
+class RBS::RecursiveTypeAliasError < ::RBS::BaseError
+  include ::RBS::DetailedMessageable
+
+  # @return [RecursiveTypeAliasError] a new instance of RecursiveTypeAliasError
+  #
+  # source://rbs/lib/rbs/errors.rb#488
+  def initialize(alias_names:, location:); end
+
+  # Returns the value of attribute alias_names.
+  #
+  # source://rbs/lib/rbs/errors.rb#485
+  def alias_names; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/errors.rb#486
+  def location; end
+
+  # source://rbs/lib/rbs/errors.rb#495
+  def name; end
+end
+
+# source://rbs/lib/rbs/repository.rb#4
+class RBS::Repository
+  # @return [Repository] a new instance of Repository
+  #
+  # source://rbs/lib/rbs/repository.rb#74
+  def initialize(no_stdlib: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/repository.rb#98
+  def add(dir); end
+
+  # Returns the value of attribute dirs.
+  #
+  # source://rbs/lib/rbs/repository.rb#71
+  def dirs; end
+
+  # Returns the value of attribute gems.
+  #
+  # source://rbs/lib/rbs/repository.rb#72
+  def gems; end
+
+  # source://rbs/lib/rbs/repository.rb#108
+  def lookup(gem, version); end
+
+  # source://rbs/lib/rbs/repository.rb#113
+  def lookup_path(gem, version); end
+
+  class << self
+    # source://rbs/lib/rbs/repository.rb#83
+    def default; end
+
+    # source://rbs/lib/rbs/repository.rb#87
+    def find_best_version(version, candidates); end
+  end
+end
+
+# source://rbs/lib/rbs/repository.rb#5
+RBS::Repository::DEFAULT_STDLIB_ROOT = T.let(T.unsafe(nil), Pathname)
+
+# source://rbs/lib/rbs/repository.rb#7
+class RBS::Repository::GemRBS
+  # @return [GemRBS] a new instance of GemRBS
+  #
+  # source://rbs/lib/rbs/repository.rb#11
+  def initialize(name:); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/repository.rb#64
+  def empty?; end
+
+  # source://rbs/lib/rbs/repository.rb#59
+  def find_best_version(version); end
+
+  # source://rbs/lib/rbs/repository.rb#54
+  def latest_version; end
+
+  # source://rbs/lib/rbs/repository.rb#22
+  def load!; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/repository.rb#8
+  def name; end
+
+  # source://rbs/lib/rbs/repository.rb#49
+  def oldest_version; end
+
+  # Returns the value of attribute paths.
+  #
+  # source://rbs/lib/rbs/repository.rb#9
+  def paths; end
+
+  # source://rbs/lib/rbs/repository.rb#45
+  def version_names; end
+
+  # source://rbs/lib/rbs/repository.rb#17
+  def versions; end
+end
+
+# source://rbs/lib/rbs/repository.rb#69
+class RBS::Repository::VersionPath < ::Struct
+  def gem; end
+  def gem=(_); end
+  def path; end
+  def path=(_); end
+  def version; end
+  def version=(_); end
+
+  class << self
+    def [](*_arg0); end
+    def inspect; end
+    def keyword_init?; end
+    def members; end
+    def new(*_arg0); end
+  end
+end
+
+# source://rbs/lib/rbs/resolver/constant_resolver.rb#4
+module RBS::Resolver; end
+
+# source://rbs/lib/rbs/resolver/constant_resolver.rb#5
+class RBS::Resolver::ConstantResolver
+  # @return [ConstantResolver] a new instance of ConstantResolver
+  #
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#88
+  def initialize(builder:); end
+
+  # Returns the value of attribute builder.
+  #
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#85
+  def builder; end
+
+  # Returns the value of attribute child_constants_cache.
+  #
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#86
+  def child_constants_cache; end
+
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#112
+  def children(module_name); end
+
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#100
+  def constants(context); end
+
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#178
+  def constants_from_ancestors(module_name, constants:); end
+
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#163
+  def constants_from_context(context, constants:); end
+
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#201
+  def constants_itself(context, constants:); end
+
+  # Returns the value of attribute context_constants_cache.
+  #
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#86
+  def context_constants_cache; end
+
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#138
+  def load_child_constants(name); end
+
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#122
+  def load_context_constants(context); end
+
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#95
+  def resolve(name, context:); end
+
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#108
+  def resolve_child(module_name, name); end
+
+  # Returns the value of attribute table.
+  #
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#85
+  def table; end
+end
+
+# source://rbs/lib/rbs/resolver/constant_resolver.rb#6
+class RBS::Resolver::ConstantResolver::Table
+  # @return [Table] a new instance of Table
+  #
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#10
+  def initialize(environment); end
+
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#63
+  def children(name); end
+
+  # Returns the value of attribute children_table.
+  #
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#7
+  def children_table; end
+
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#67
+  def constant(name); end
+
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#80
+  def constant_of_constant(name, entry); end
+
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#71
+  def constant_of_module(name, entry); end
+
+  # Returns the value of attribute constants_table.
+  #
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#8
+  def constants_table; end
+
+  # Returns the value of attribute toplevel.
+  #
+  # source://rbs/lib/rbs/resolver/constant_resolver.rb#7
+  def toplevel; end
+end
+
+# source://rbs/lib/rbs/resolver/type_name_resolver.rb#5
+class RBS::Resolver::TypeNameResolver
+  # @return [TypeNameResolver] a new instance of TypeNameResolver
+  #
+  # source://rbs/lib/rbs/resolver/type_name_resolver.rb#10
+  def initialize(env); end
+
+  # Returns the value of attribute all_names.
+  #
+  # source://rbs/lib/rbs/resolver/type_name_resolver.rb#6
+  def all_names; end
+
+  # Returns the value of attribute cache.
+  #
+  # source://rbs/lib/rbs/resolver/type_name_resolver.rb#7
+  def cache; end
+
+  # Returns the value of attribute env.
+  #
+  # source://rbs/lib/rbs/resolver/type_name_resolver.rb#8
+  def env; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/resolver/type_name_resolver.rb#84
+  def has_name?(full_name); end
+
+  # source://rbs/lib/rbs/resolver/type_name_resolver.rb#51
+  def partition(type_name); end
+
+  # source://rbs/lib/rbs/resolver/type_name_resolver.rb#28
+  def resolve(type_name, context:); end
+
+  # source://rbs/lib/rbs/resolver/type_name_resolver.rb#69
+  def resolve_in(head, context); end
+
+  # source://rbs/lib/rbs/resolver/type_name_resolver.rb#21
+  def try_cache(query); end
+end
+
+# source://rbs/lib/rbs/substitution.rb#4
+class RBS::Substitution
+  # @return [Substitution] a new instance of Substitution
+  #
+  # source://rbs/lib/rbs/substitution.rb#12
+  def initialize; end
+
+  # source://rbs/lib/rbs/substitution.rb#66
+  def +(other); end
+
+  # source://rbs/lib/rbs/substitution.rb#37
+  def [](ty); end
+
+  # source://rbs/lib/rbs/substitution.rb#16
+  def add(from:, to:); end
+
+  # source://rbs/lib/rbs/substitution.rb#37
+  def apply(ty); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/substitution.rb#8
+  def empty?; end
+
+  # Returns the value of attribute instance_type.
+  #
+  # source://rbs/lib/rbs/substitution.rb#6
+  def instance_type; end
+
+  # Sets the attribute instance_type
+  #
+  # @param value the value to set the attribute instance_type to.
+  #
+  # source://rbs/lib/rbs/substitution.rb#6
+  def instance_type=(_arg0); end
+
+  # Returns the value of attribute mapping.
+  #
+  # source://rbs/lib/rbs/substitution.rb#5
+  def mapping; end
+
+  # source://rbs/lib/rbs/substitution.rb#55
+  def without(*vars); end
+
+  class << self
+    # source://rbs/lib/rbs/substitution.rb#20
+    def build(variables, types, instance_type: T.unsafe(nil), &block); end
+  end
+end
+
+# source://rbs/lib/rbs/subtractor.rb#4
+class RBS::Subtractor
+  # @return [Subtractor] a new instance of Subtractor
+  #
+  # source://rbs/lib/rbs/subtractor.rb#5
+  def initialize(minuend, subtrahend); end
+
+  # source://rbs/lib/rbs/subtractor.rb#10
+  def call(minuend = T.unsafe(nil), context: T.unsafe(nil)); end
+
+  private
+
+  # source://rbs/lib/rbs/subtractor.rb#177
+  def absolute_typename(name, context:); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/subtractor.rb#160
+  def access_modifier?(decl); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/subtractor.rb#118
+  def cvar_exist?(owner, name); end
+
+  # source://rbs/lib/rbs/subtractor.rb#127
+  def each_member(owner, &block); end
+
+  # source://rbs/lib/rbs/subtractor.rb#48
+  def filter_members(decl, context:); end
+
+  # source://rbs/lib/rbs/subtractor.rb#148
+  def filter_redundunt_access_modifiers(decls); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/subtractor.rb#106
+  def ivar_exist?(owner, name, kind); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/subtractor.rb#60
+  def member_exist?(owner, member, context:); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/subtractor.rb#89
+  def method_exist?(owner, method_name, kind); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/subtractor.rb#137
+  def mixin_exist?(owner, mixin, context:); end
+
+  # source://rbs/lib/rbs/subtractor.rb#186
+  def typename_candidates(name, context:); end
+
+  # source://rbs/lib/rbs/subtractor.rb#164
+  def update_decl(decl, members:); end
+end
+
+# source://rbs/lib/rbs/errors.rb#343
+class RBS::SuperclassMismatchError < ::RBS::DefinitionError
+  # @return [SuperclassMismatchError] a new instance of SuperclassMismatchError
+  #
+  # source://rbs/lib/rbs/errors.rb#347
+  def initialize(name:, entry:); end
+
+  # Returns the value of attribute entry.
+  #
+  # source://rbs/lib/rbs/errors.rb#345
+  def entry; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/errors.rb#344
+  def name; end
+end
+
+# source://rbs/lib/rbs/type_alias_dependency.rb#4
+class RBS::TypeAliasDependency
+  # @return [TypeAliasDependency] a new instance of TypeAliasDependency
+  #
+  # source://rbs/lib/rbs/type_alias_dependency.rb#14
+  def initialize(env:); end
+
+  # source://rbs/lib/rbs/type_alias_dependency.rb#27
+  def build_dependencies; end
+
+  # Check if an alias type definition is circular & prohibited
+  #
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/type_alias_dependency.rb#19
+  def circular_definition?(alias_name); end
+
+  # A hash which stores the transitive closure
+  # of the directed graph
+  #
+  # source://rbs/lib/rbs/type_alias_dependency.rb#12
+  def dependencies; end
+
+  # source://rbs/lib/rbs/type_alias_dependency.rb#57
+  def dependencies_of(name); end
+
+  # Direct dependencies corresponds to a directed graph
+  # with vertices as types and directions based on assignment of types
+  #
+  # source://rbs/lib/rbs/type_alias_dependency.rb#9
+  def direct_dependencies; end
+
+  # source://rbs/lib/rbs/type_alias_dependency.rb#52
+  def direct_dependencies_of(name); end
+
+  # Returns the value of attribute env.
+  #
+  # source://rbs/lib/rbs/type_alias_dependency.rb#5
+  def env; end
+
+  # source://rbs/lib/rbs/type_alias_dependency.rb#43
+  def transitive_closure; end
+
+  private
+
+  # Recursive function to construct transitive closure
+  #
+  # source://rbs/lib/rbs/type_alias_dependency.rb#81
+  def dependency(start, vertex, nested = T.unsafe(nil)); end
+
+  # Constructs directed graph recursively
+  #
+  # source://rbs/lib/rbs/type_alias_dependency.rb#65
+  def direct_dependency(type, result = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/type_alias_regularity.rb#4
+class RBS::TypeAliasRegularity
+  # @return [TypeAliasRegularity] a new instance of TypeAliasRegularity
+  #
+  # source://rbs/lib/rbs/type_alias_regularity.rb#16
+  def initialize(env:); end
+
+  # source://rbs/lib/rbs/type_alias_regularity.rb#61
+  def build_alias_type(name); end
+
+  # Returns the value of attribute builder.
+  #
+  # source://rbs/lib/rbs/type_alias_regularity.rb#14
+  def builder; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/type_alias_regularity.rb#69
+  def compatible_args?(args1, args2); end
+
+  # Returns the value of attribute diagnostics.
+  #
+  # source://rbs/lib/rbs/type_alias_regularity.rb#14
+  def diagnostics; end
+
+  # source://rbs/lib/rbs/type_alias_regularity.rb#110
+  def each_alias_type(type, &block); end
+
+  # source://rbs/lib/rbs/type_alias_regularity.rb#83
+  def each_mutual_alias_defs(&block); end
+
+  # Returns the value of attribute env.
+  #
+  # source://rbs/lib/rbs/type_alias_regularity.rb#14
+  def env; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/type_alias_regularity.rb#79
+  def nonregular?(type_name); end
+
+  # source://rbs/lib/rbs/type_alias_regularity.rb#22
+  def validate; end
+
+  # source://rbs/lib/rbs/type_alias_regularity.rb#39
+  def validate_alias_type(alias_type, names, types); end
+
+  class << self
+    # source://rbs/lib/rbs/type_alias_regularity.rb#120
+    def validate(env:); end
+  end
+end
+
+# source://rbs/lib/rbs/type_alias_regularity.rb#5
+class RBS::TypeAliasRegularity::Diagnostic
+  # @return [Diagnostic] a new instance of Diagnostic
+  #
+  # source://rbs/lib/rbs/type_alias_regularity.rb#8
+  def initialize(type_name:, nonregular_type:); end
+
+  # Returns the value of attribute nonregular_type.
+  #
+  # source://rbs/lib/rbs/type_alias_regularity.rb#6
+  def nonregular_type; end
+
+  # Returns the value of attribute type_name.
+  #
+  # source://rbs/lib/rbs/type_alias_regularity.rb#6
+  def type_name; end
+end
+
+# source://rbs/lib/rbs/type_name.rb#4
+class RBS::TypeName
+  # @return [TypeName] a new instance of TypeName
+  #
+  # source://rbs/lib/rbs/type_name.rb#9
+  def initialize(namespace:, name:); end
+
+  # source://rbs/lib/rbs/type_name.rb#79
+  def +(other); end
+
+  # source://rbs/lib/rbs/type_name.rb#25
+  def ==(other); end
+
+  # source://rbs/lib/rbs/type_name.rb#55
+  def absolute!; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/type_name.rb#59
+  def absolute?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/type_name.rb#51
+  def alias?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/type_name.rb#47
+  def class?; end
+
+  # source://rbs/lib/rbs/type_name.rb#25
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/type_name.rb#31
+  def hash; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/type_name.rb#67
+  def interface?; end
+
+  # Returns the value of attribute kind.
+  #
+  # source://rbs/lib/rbs/type_name.rb#7
+  def kind; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/type_name.rb#6
+  def name; end
+
+  # Returns the value of attribute namespace.
+  #
+  # source://rbs/lib/rbs/type_name.rb#5
+  def namespace; end
+
+  # source://rbs/lib/rbs/type_name.rb#63
+  def relative!; end
+
+  # source://rbs/lib/rbs/type_name.rb#75
+  def split; end
+
+  # source://rbs/lib/rbs/type_name.rb#39
+  def to_json(state = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/type_name.rb#43
+  def to_namespace; end
+
+  # source://rbs/lib/rbs/type_name.rb#35
+  def to_s; end
+
+  # source://rbs/lib/rbs/type_name.rb#71
+  def with_prefix(namespace); end
+end
+
+# source://rbs/lib/rbs/errors.rb#580
+class RBS::TypeParamDefaultReferenceError < ::RBS::DefinitionError
+  include ::RBS::DetailedMessageable
+
+  # @return [TypeParamDefaultReferenceError] a new instance of TypeParamDefaultReferenceError
+  #
+  # source://rbs/lib/rbs/errors.rb#586
+  def initialize(type_param, location:); end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/errors.rb#584
+  def location; end
+
+  # Returns the value of attribute type_param.
+  #
+  # source://rbs/lib/rbs/errors.rb#583
+  def type_param; end
+
+  class << self
+    # source://rbs/lib/rbs/errors.rb#592
+    def check!(type_params); end
+  end
+end
+
+# source://rbs/lib/rbs/types.rb#4
+module RBS::Types; end
+
+# source://rbs/lib/rbs/types.rb#394
+class RBS::Types::Alias
+  include ::RBS::Types::Application
+
+  # @return [Alias] a new instance of Alias
+  #
+  # source://rbs/lib/rbs/types.rb#399
+  def initialize(name:, args:, location:); end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/types.rb#395
+  def location; end
+
+  # source://rbs/lib/rbs/types.rb#421
+  def map_type(&block); end
+
+  # source://rbs/lib/rbs/types.rb#413
+  def map_type_name(&block); end
+
+  # source://rbs/lib/rbs/types.rb#409
+  def sub(s); end
+
+  # source://rbs/lib/rbs/types.rb#405
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/types.rb#252
+module RBS::Types::Application
+  # source://rbs/lib/rbs/types.rb#256
+  def ==(other); end
+
+  # Returns the value of attribute args.
+  #
+  # source://rbs/lib/rbs/types.rb#254
+  def args; end
+
+  # source://rbs/lib/rbs/types.rb#282
+  def each_type(&block); end
+
+  # source://rbs/lib/rbs/types.rb#256
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/types.rb#266
+  def free_variables(set = T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#294
+  def has_classish_type?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#290
+  def has_self_type?; end
+
+  # source://rbs/lib/rbs/types.rb#262
+  def hash; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/types.rb#253
+  def name; end
+
+  # source://rbs/lib/rbs/types.rb#274
+  def to_s(level = T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#298
+  def with_nonreturn_void?; end
+end
+
+# source://rbs/lib/rbs/types.rb#41
+module RBS::Types::Bases; end
+
+# source://rbs/lib/rbs/types.rb#109
+class RBS::Types::Bases::Any < ::RBS::Types::Bases::Base
+  # source://rbs/lib/rbs/types.rb#110
+  def to_s(level = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/types.rb#114
+  def todo!; end
+end
+
+# source://rbs/lib/rbs/types.rb#42
+class RBS::Types::Bases::Base
+  include ::RBS::Types::NoFreeVariables
+  include ::RBS::Types::NoSubst
+  include ::RBS::Types::EmptyEachType
+  include ::RBS::Types::NoTypeName
+
+  # @return [Base] a new instance of Base
+  #
+  # source://rbs/lib/rbs/types.rb#45
+  def initialize(location:); end
+
+  # source://rbs/lib/rbs/types.rb#49
+  def ==(other); end
+
+  # source://rbs/lib/rbs/types.rb#49
+  def eql?(other); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#98
+  def has_classish_type?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#94
+  def has_self_type?; end
+
+  # source://rbs/lib/rbs/types.rb#53
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/types.rb#43
+  def location; end
+
+  # source://rbs/lib/rbs/types.rb#64
+  def to_json(state = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/types.rb#69
+  def to_s(level = T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#102
+  def with_nonreturn_void?; end
+end
+
+# source://rbs/lib/rbs/types.rb#107
+class RBS::Types::Bases::Bool < ::RBS::Types::Bases::Base; end
+
+# source://rbs/lib/rbs/types.rb#121
+class RBS::Types::Bases::Bottom < ::RBS::Types::Bases::Base; end
+
+# source://rbs/lib/rbs/types.rb#128
+class RBS::Types::Bases::Class < ::RBS::Types::Bases::Base; end
+
+# source://rbs/lib/rbs/types.rb#123
+class RBS::Types::Bases::Instance < ::RBS::Types::Bases::Base
+  # source://rbs/lib/rbs/types.rb#124
+  def sub(s); end
+end
+
+# source://rbs/lib/rbs/types.rb#119
+class RBS::Types::Bases::Nil < ::RBS::Types::Bases::Base; end
+
+# source://rbs/lib/rbs/types.rb#122
+class RBS::Types::Bases::Self < ::RBS::Types::Bases::Base; end
+
+# source://rbs/lib/rbs/types.rb#120
+class RBS::Types::Bases::Top < ::RBS::Types::Bases::Base; end
+
+# source://rbs/lib/rbs/types.rb#108
+class RBS::Types::Bases::Void < ::RBS::Types::Bases::Base; end
+
+# source://rbs/lib/rbs/types.rb#1294
+class RBS::Types::Block
+  # @return [Block] a new instance of Block
+  #
+  # source://rbs/lib/rbs/types.rb#1299
+  def initialize(type:, required:, self_type: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/types.rb#1305
+  def ==(other); end
+
+  # source://rbs/lib/rbs/types.rb#1328
+  def map_type(&block); end
+
+  # Returns the value of attribute required.
+  #
+  # source://rbs/lib/rbs/types.rb#1296
+  def required; end
+
+  # Returns the value of attribute self_type.
+  #
+  # source://rbs/lib/rbs/types.rb#1297
+  def self_type; end
+
+  # source://rbs/lib/rbs/types.rb#1320
+  def sub(s); end
+
+  # source://rbs/lib/rbs/types.rb#1312
+  def to_json(state = T.unsafe(nil)); end
+
+  # Returns the value of attribute type.
+  #
+  # source://rbs/lib/rbs/types.rb#1295
+  def type; end
+end
+
+# source://rbs/lib/rbs/types.rb#352
+class RBS::Types::ClassInstance
+  include ::RBS::Types::Application
+
+  # @return [ClassInstance] a new instance of ClassInstance
+  #
+  # source://rbs/lib/rbs/types.rb#357
+  def initialize(name:, args:, location:); end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/types.rb#353
+  def location; end
+
+  # source://rbs/lib/rbs/types.rb#381
+  def map_type(&block); end
+
+  # source://rbs/lib/rbs/types.rb#373
+  def map_type_name(&block); end
+
+  # source://rbs/lib/rbs/types.rb#367
+  def sub(s); end
+
+  # source://rbs/lib/rbs/types.rb#363
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/types.rb#200
+class RBS::Types::ClassSingleton
+  include ::RBS::Types::NoFreeVariables
+  include ::RBS::Types::NoSubst
+  include ::RBS::Types::EmptyEachType
+
+  # @return [ClassSingleton] a new instance of ClassSingleton
+  #
+  # source://rbs/lib/rbs/types.rb#204
+  def initialize(name:, location:); end
+
+  # source://rbs/lib/rbs/types.rb#209
+  def ==(other); end
+
+  # source://rbs/lib/rbs/types.rb#209
+  def eql?(other); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#243
+  def has_classish_type?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#239
+  def has_self_type?; end
+
+  # source://rbs/lib/rbs/types.rb#215
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/types.rb#202
+  def location; end
+
+  # source://rbs/lib/rbs/types.rb#232
+  def map_type_name; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/types.rb#201
+  def name; end
+
+  # source://rbs/lib/rbs/types.rb#222
+  def to_json(state = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/types.rb#226
+  def to_s(level = T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#247
+  def with_nonreturn_void?; end
+end
+
+# source://rbs/lib/rbs/types.rb#23
+module RBS::Types::EmptyEachType
+  # source://rbs/lib/rbs/types.rb#24
+  def each_type; end
+
+  # source://rbs/lib/rbs/types.rb#32
+  def map_type(&block); end
+end
+
+# source://rbs/lib/rbs/types.rb#871
+class RBS::Types::Function
+  # @return [Function] a new instance of Function
+  #
+  # source://rbs/lib/rbs/types.rb#927
+  def initialize(required_positionals:, optional_positionals:, rest_positionals:, trailing_positionals:, required_keywords:, optional_keywords:, rest_keywords:, return_type:); end
+
+  # source://rbs/lib/rbs/types.rb#938
+  def ==(other); end
+
+  # source://rbs/lib/rbs/types.rb#1009
+  def amap(array, &block); end
+
+  # source://rbs/lib/rbs/types.rb#1146
+  def drop_head; end
+
+  # source://rbs/lib/rbs/types.rb#1163
+  def drop_tail; end
+
+  # source://rbs/lib/rbs/types.rb#1046
+  def each_param(&block); end
+
+  # source://rbs/lib/rbs/types.rb#1031
+  def each_type; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#1117
+  def empty?; end
+
+  # source://rbs/lib/rbs/types.rb#938
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/types.rb#964
+  def free_variables(set = T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#1188
+  def has_classish_type?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#1176
+  def has_keyword?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#1184
+  def has_self_type?; end
+
+  # source://rbs/lib/rbs/types.rb#952
+  def hash; end
+
+  # source://rbs/lib/rbs/types.rb#1017
+  def hmapv(hash, &block); end
+
+  # source://rbs/lib/rbs/types.rb#992
+  def map_type(&block); end
+
+  # source://rbs/lib/rbs/types.rb#1025
+  def map_type_name(&block); end
+
+  # Returns the value of attribute optional_keywords.
+  #
+  # source://rbs/lib/rbs/types.rb#923
+  def optional_keywords; end
+
+  # Returns the value of attribute optional_positionals.
+  #
+  # source://rbs/lib/rbs/types.rb#919
+  def optional_positionals; end
+
+  # source://rbs/lib/rbs/types.rb#1127
+  def param_to_s; end
+
+  # Returns the value of attribute required_keywords.
+  #
+  # source://rbs/lib/rbs/types.rb#922
+  def required_keywords; end
+
+  # Returns the value of attribute required_positionals.
+  #
+  # source://rbs/lib/rbs/types.rb#918
+  def required_positionals; end
+
+  # Returns the value of attribute rest_keywords.
+  #
+  # source://rbs/lib/rbs/types.rb#924
+  def rest_keywords; end
+
+  # Returns the value of attribute rest_positionals.
+  #
+  # source://rbs/lib/rbs/types.rb#920
+  def rest_positionals; end
+
+  # source://rbs/lib/rbs/types.rb#1142
+  def return_to_s; end
+
+  # Returns the value of attribute return_type.
+  #
+  # source://rbs/lib/rbs/types.rb#925
+  def return_type; end
+
+  # source://rbs/lib/rbs/types.rb#1073
+  def sub(s); end
+
+  # source://rbs/lib/rbs/types.rb#1060
+  def to_json(state = T.unsafe(nil)); end
+
+  # Returns the value of attribute trailing_positionals.
+  #
+  # source://rbs/lib/rbs/types.rb#921
+  def trailing_positionals; end
+
+  # source://rbs/lib/rbs/types.rb#1103
+  def update(required_positionals: T.unsafe(nil), optional_positionals: T.unsafe(nil), rest_positionals: T.unsafe(nil), trailing_positionals: T.unsafe(nil), required_keywords: T.unsafe(nil), optional_keywords: T.unsafe(nil), rest_keywords: T.unsafe(nil), return_type: T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#1192
+  def with_nonreturn_void?; end
+
+  # source://rbs/lib/rbs/types.rb#1090
+  def with_return_type(type); end
+
+  class << self
+    # source://rbs/lib/rbs/types.rb#1077
+    def empty(return_type); end
+  end
+end
+
+# source://rbs/lib/rbs/types.rb#872
+class RBS::Types::Function::Param
+  # @return [Param] a new instance of Param
+  #
+  # source://rbs/lib/rbs/types.rb#877
+  def initialize(type:, name:, location: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/types.rb#883
+  def ==(other); end
+
+  # source://rbs/lib/rbs/types.rb#883
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/types.rb#889
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/types.rb#875
+  def location; end
+
+  # source://rbs/lib/rbs/types.rb#893
+  def map_type(&block); end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/types.rb#874
+  def name; end
+
+  # source://rbs/lib/rbs/types.rb#901
+  def to_json(state = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/types.rb#905
+  def to_s; end
+
+  # Returns the value of attribute type.
+  #
+  # source://rbs/lib/rbs/types.rb#873
+  def type; end
+end
+
+# source://rbs/lib/rbs/types.rb#310
+class RBS::Types::Interface
+  include ::RBS::Types::Application
+
+  # @return [Interface] a new instance of Interface
+  #
+  # source://rbs/lib/rbs/types.rb#315
+  def initialize(name:, args:, location:); end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/types.rb#311
+  def location; end
+
+  # source://rbs/lib/rbs/types.rb#339
+  def map_type(&block); end
+
+  # source://rbs/lib/rbs/types.rb#331
+  def map_type_name(&block); end
+
+  # source://rbs/lib/rbs/types.rb#325
+  def sub(s); end
+
+  # source://rbs/lib/rbs/types.rb#321
+  def to_json(state = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/types.rb#790
+class RBS::Types::Intersection
+  # @return [Intersection] a new instance of Intersection
+  #
+  # source://rbs/lib/rbs/types.rb#794
+  def initialize(types:, location:); end
+
+  # source://rbs/lib/rbs/types.rb#799
+  def ==(other); end
+
+  # source://rbs/lib/rbs/types.rb#835
+  def each_type(&block); end
+
+  # source://rbs/lib/rbs/types.rb#799
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/types.rb#809
+  def free_variables(set = T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#862
+  def has_classish_type?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#858
+  def has_self_type?; end
+
+  # source://rbs/lib/rbs/types.rb#805
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/types.rb#792
+  def location; end
+
+  # source://rbs/lib/rbs/types.rb#843
+  def map_type(&block); end
+
+  # source://rbs/lib/rbs/types.rb#851
+  def map_type_name(&block); end
+
+  # source://rbs/lib/rbs/types.rb#821
+  def sub(s); end
+
+  # source://rbs/lib/rbs/types.rb#817
+  def to_json(state = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/types.rb#826
+  def to_s(level = T.unsafe(nil)); end
+
+  # Returns the value of attribute types.
+  #
+  # source://rbs/lib/rbs/types.rb#791
+  def types; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#866
+  def with_nonreturn_void?; end
+end
+
+# source://rbs/lib/rbs/types.rb#1469
+class RBS::Types::Literal
+  include ::RBS::Types::NoFreeVariables
+  include ::RBS::Types::NoSubst
+  include ::RBS::Types::EmptyEachType
+  include ::RBS::Types::NoTypeName
+
+  # @return [Literal] a new instance of Literal
+  #
+  # source://rbs/lib/rbs/types.rb#1473
+  def initialize(literal:, location:); end
+
+  # source://rbs/lib/rbs/types.rb#1478
+  def ==(other); end
+
+  # source://rbs/lib/rbs/types.rb#1478
+  def eql?(other); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#1505
+  def has_classish_type?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#1501
+  def has_self_type?; end
+
+  # source://rbs/lib/rbs/types.rb#1484
+  def hash; end
+
+  # Returns the value of attribute literal.
+  #
+  # source://rbs/lib/rbs/types.rb#1470
+  def literal; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/types.rb#1471
+  def location; end
+
+  # source://rbs/lib/rbs/types.rb#1493
+  def to_json(state = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/types.rb#1497
+  def to_s(level = T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#1509
+  def with_nonreturn_void?; end
+
+  class << self
+    # source://rbs/lib/rbs/types.rb#1529
+    def unescape_string(string, is_double_quote); end
+  end
+end
+
+# source://rbs/lib/rbs/types.rb#1513
+RBS::Types::Literal::TABLE = T.let(T.unsafe(nil), Hash)
+
+# source://rbs/lib/rbs/types.rb#5
+module RBS::Types::NoFreeVariables
+  # source://rbs/lib/rbs/types.rb#6
+  def free_variables(set = T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/types.rb#11
+module RBS::Types::NoSubst
+  # source://rbs/lib/rbs/types.rb#12
+  def sub(s); end
+end
+
+# source://rbs/lib/rbs/types.rb#17
+module RBS::Types::NoTypeName
+  # source://rbs/lib/rbs/types.rb#18
+  def map_type_name; end
+end
+
+# source://rbs/lib/rbs/types.rb#626
+class RBS::Types::Optional
+  # @return [Optional] a new instance of Optional
+  #
+  # source://rbs/lib/rbs/types.rb#630
+  def initialize(type:, location:); end
+
+  # source://rbs/lib/rbs/types.rb#635
+  def ==(other); end
+
+  # source://rbs/lib/rbs/types.rb#671
+  def each_type; end
+
+  # source://rbs/lib/rbs/types.rb#635
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/types.rb#645
+  def free_variables(set = T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#701
+  def has_classish_type?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#697
+  def has_self_type?; end
+
+  # source://rbs/lib/rbs/types.rb#641
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/types.rb#628
+  def location; end
+
+  # source://rbs/lib/rbs/types.rb#686
+  def map_type(&block); end
+
+  # source://rbs/lib/rbs/types.rb#679
+  def map_type_name(&block); end
+
+  # source://rbs/lib/rbs/types.rb#653
+  def sub(s); end
+
+  # source://rbs/lib/rbs/types.rb#649
+  def to_json(state = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/types.rb#657
+  def to_s(level = T.unsafe(nil)); end
+
+  # Returns the value of attribute type.
+  #
+  # source://rbs/lib/rbs/types.rb#627
+  def type; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#705
+  def with_nonreturn_void?; end
+end
+
+# source://rbs/lib/rbs/types.rb#1349
+class RBS::Types::Proc
+  # @return [Proc] a new instance of Proc
+  #
+  # source://rbs/lib/rbs/types.rb#1355
+  def initialize(location:, type:, block:, self_type: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/types.rb#1362
+  def ==(other); end
+
+  # Returns the value of attribute block.
+  #
+  # source://rbs/lib/rbs/types.rb#1351
+  def block; end
+
+  # source://rbs/lib/rbs/types.rb#1414
+  def each_type(&block); end
+
+  # source://rbs/lib/rbs/types.rb#1362
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/types.rb#1372
+  def free_variables(set = T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#1452
+  def has_classish_type?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#1448
+  def has_self_type?; end
+
+  # source://rbs/lib/rbs/types.rb#1368
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/types.rb#1353
+  def location; end
+
+  # source://rbs/lib/rbs/types.rb#1435
+  def map_type(&block); end
+
+  # source://rbs/lib/rbs/types.rb#1426
+  def map_type_name(&block); end
+
+  # Returns the value of attribute self_type.
+  #
+  # source://rbs/lib/rbs/types.rb#1352
+  def self_type; end
+
+  # source://rbs/lib/rbs/types.rb#1389
+  def sub(s); end
+
+  # source://rbs/lib/rbs/types.rb#1379
+  def to_json(state = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/types.rb#1398
+  def to_s(level = T.unsafe(nil)); end
+
+  # Returns the value of attribute type.
+  #
+  # source://rbs/lib/rbs/types.rb#1350
+  def type; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#1456
+  def with_nonreturn_void?; end
+end
+
+# source://rbs/lib/rbs/types.rb#517
+class RBS::Types::Record
+  # @return [Record] a new instance of Record
+  #
+  # source://rbs/lib/rbs/types.rb#521
+  def initialize(location:, all_fields: T.unsafe(nil), fields: T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/types.rb#538
+  def ==(other); end
+
+  # Returns the value of attribute all_fields.
+  #
+  # source://rbs/lib/rbs/types.rb#518
+  def all_fields; end
+
+  # source://rbs/lib/rbs/types.rb#586
+  def each_type(&block); end
+
+  # source://rbs/lib/rbs/types.rb#538
+  def eql?(other); end
+
+  # Returns the value of attribute fields.
+  #
+  # source://rbs/lib/rbs/types.rb#518
+  def fields; end
+
+  # source://rbs/lib/rbs/types.rb#548
+  def free_variables(set = T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#617
+  def has_classish_type?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#613
+  def has_self_type?; end
+
+  # source://rbs/lib/rbs/types.rb#544
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/types.rb#519
+  def location; end
+
+  # source://rbs/lib/rbs/types.rb#602
+  def map_type(&block); end
+
+  # source://rbs/lib/rbs/types.rb#595
+  def map_type_name(&block); end
+
+  # Returns the value of attribute optional_fields.
+  #
+  # source://rbs/lib/rbs/types.rb#518
+  def optional_fields; end
+
+  # source://rbs/lib/rbs/types.rb#563
+  def sub(s); end
+
+  # source://rbs/lib/rbs/types.rb#559
+  def to_json(state = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/types.rb#570
+  def to_s(level = T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#621
+  def with_nonreturn_void?; end
+end
+
+# source://rbs/lib/rbs/types.rb#1337
+module RBS::Types::SelfTypeBindingHelper
+  private
+
+  # source://rbs/lib/rbs/types.rb#1340
+  def self_type_binding_to_s(t); end
+
+  class << self
+    # source://rbs/lib/rbs/types.rb#1340
+    def self_type_binding_to_s(t); end
+  end
+end
+
+# source://rbs/lib/rbs/types.rb#434
+class RBS::Types::Tuple
+  # @return [Tuple] a new instance of Tuple
+  #
+  # source://rbs/lib/rbs/types.rb#438
+  def initialize(types:, location:); end
+
+  # source://rbs/lib/rbs/types.rb#443
+  def ==(other); end
+
+  # source://rbs/lib/rbs/types.rb#478
+  def each_type(&block); end
+
+  # source://rbs/lib/rbs/types.rb#443
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/types.rb#453
+  def free_variables(set = T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#508
+  def has_classish_type?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#504
+  def has_self_type?; end
+
+  # source://rbs/lib/rbs/types.rb#449
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/types.rb#436
+  def location; end
+
+  # source://rbs/lib/rbs/types.rb#493
+  def map_type(&block); end
+
+  # source://rbs/lib/rbs/types.rb#486
+  def map_type_name(&block); end
+
+  # source://rbs/lib/rbs/types.rb#465
+  def sub(s); end
+
+  # source://rbs/lib/rbs/types.rb#461
+  def to_json(state = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/types.rb#470
+  def to_s(level = T.unsafe(nil)); end
+
+  # Returns the value of attribute types.
+  #
+  # source://rbs/lib/rbs/types.rb#435
+  def types; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#512
+  def with_nonreturn_void?; end
+end
+
+# source://rbs/lib/rbs/types.rb#710
+class RBS::Types::Union
+  # @return [Union] a new instance of Union
+  #
+  # source://rbs/lib/rbs/types.rb#714
+  def initialize(types:, location:); end
+
+  # source://rbs/lib/rbs/types.rb#719
+  def ==(other); end
+
+  # source://rbs/lib/rbs/types.rb#754
+  def each_type(&block); end
+
+  # source://rbs/lib/rbs/types.rb#719
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/types.rb#729
+  def free_variables(set = T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#781
+  def has_classish_type?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#777
+  def has_self_type?; end
+
+  # source://rbs/lib/rbs/types.rb#725
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/types.rb#712
+  def location; end
+
+  # source://rbs/lib/rbs/types.rb#762
+  def map_type(&block); end
+
+  # source://rbs/lib/rbs/types.rb#770
+  def map_type_name(&block); end
+
+  # source://rbs/lib/rbs/types.rb#741
+  def sub(s); end
+
+  # source://rbs/lib/rbs/types.rb#737
+  def to_json(state = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/types.rb#746
+  def to_s(level = T.unsafe(nil)); end
+
+  # Returns the value of attribute types.
+  #
+  # source://rbs/lib/rbs/types.rb#711
+  def types; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#785
+  def with_nonreturn_void?; end
+end
+
+# source://rbs/lib/rbs/types.rb#1205
+class RBS::Types::UntypedFunction
+  # @return [UntypedFunction] a new instance of UntypedFunction
+  #
+  # source://rbs/lib/rbs/types.rb#1208
+  def initialize(return_type:); end
+
+  # source://rbs/lib/rbs/types.rb#1282
+  def ==(other); end
+
+  # source://rbs/lib/rbs/types.rb#1232
+  def each_param(&block); end
+
+  # source://rbs/lib/rbs/types.rb#1224
+  def each_type(&block); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#1258
+  def empty?; end
+
+  # source://rbs/lib/rbs/types.rb#1282
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/types.rb#1212
+  def free_variables(acc = T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#1266
+  def has_classish_type?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#1262
+  def has_self_type?; end
+
+  # source://rbs/lib/rbs/types.rb#1288
+  def hash; end
+
+  # source://rbs/lib/rbs/types.rb#1216
+  def map_type(&block); end
+
+  # source://rbs/lib/rbs/types.rb#1274
+  def param_to_s; end
+
+  # source://rbs/lib/rbs/types.rb#1278
+  def return_to_s; end
+
+  # Returns the value of attribute return_type.
+  #
+  # source://rbs/lib/rbs/types.rb#1206
+  def return_type; end
+
+  # source://rbs/lib/rbs/types.rb#1246
+  def sub(subst); end
+
+  # source://rbs/lib/rbs/types.rb#1240
+  def to_json(state = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/types.rb#1254
+  def update(return_type: T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#1270
+  def with_nonreturn_void?; end
+
+  # source://rbs/lib/rbs/types.rb#1250
+  def with_return_type(ty); end
+end
+
+# source://rbs/lib/rbs/types.rb#131
+class RBS::Types::Variable
+  include ::RBS::Types::NoTypeName
+  include ::RBS::Types::EmptyEachType
+
+  # @return [Variable] a new instance of Variable
+  #
+  # source://rbs/lib/rbs/types.rb#137
+  def initialize(name:, location:); end
+
+  # source://rbs/lib/rbs/types.rb#142
+  def ==(other); end
+
+  # source://rbs/lib/rbs/types.rb#142
+  def eql?(other); end
+
+  # source://rbs/lib/rbs/types.rb#152
+  def free_variables(set = T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#191
+  def has_classish_type?; end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#187
+  def has_self_type?; end
+
+  # source://rbs/lib/rbs/types.rb#148
+  def hash; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/types.rb#133
+  def location; end
+
+  # Returns the value of attribute name.
+  #
+  # source://rbs/lib/rbs/types.rb#132
+  def name; end
+
+  # source://rbs/lib/rbs/types.rb#162
+  def sub(s); end
+
+  # source://rbs/lib/rbs/types.rb#158
+  def to_json(state = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/types.rb#181
+  def to_s(level = T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/types.rb#195
+  def with_nonreturn_void?; end
+
+  class << self
+    # source://rbs/lib/rbs/types.rb#166
+    def build(v); end
+
+    # source://rbs/lib/rbs/types.rb#176
+    def fresh(v = T.unsafe(nil)); end
+  end
+end
+
+# source://rbs/lib/rbs/errors.rb#325
+class RBS::UnknownMethodAliasError < ::RBS::DefinitionError
+  include ::RBS::DetailedMessageable
+
+  # @return [UnknownMethodAliasError] a new instance of UnknownMethodAliasError
+  #
+  # source://rbs/lib/rbs/errors.rb#333
+  def initialize(type_name:, original_name:, aliased_name:, location:); end
+
+  # Returns the value of attribute aliased_name.
+  #
+  # source://rbs/lib/rbs/errors.rb#330
+  def aliased_name; end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/errors.rb#331
+  def location; end
+
+  # Returns the value of attribute original_name.
+  #
+  # source://rbs/lib/rbs/errors.rb#329
+  def original_name; end
+
+  # Returns the value of attribute type_name.
+  #
+  # source://rbs/lib/rbs/errors.rb#328
+  def type_name; end
+end
+
+# source://rbs/lib/rbs/version.rb#4
+RBS::VERSION = T.let(T.unsafe(nil), String)
+
+# source://rbs/lib/rbs/validator.rb#4
+class RBS::Validator
+  # @return [Validator] a new instance of Validator
+  #
+  # source://rbs/lib/rbs/validator.rb#9
+  def initialize(env:, resolver:); end
+
+  # source://rbs/lib/rbs/validator.rb#15
+  def absolute_type(type, context:, &block); end
+
+  # Returns the value of attribute definition_builder.
+  #
+  # source://rbs/lib/rbs/validator.rb#7
+  def definition_builder; end
+
+  # Returns the value of attribute env.
+  #
+  # source://rbs/lib/rbs/validator.rb#5
+  def env; end
+
+  # Returns the value of attribute resolver.
+  #
+  # source://rbs/lib/rbs/validator.rb#6
+  def resolver; end
+
+  # source://rbs/lib/rbs/validator.rb#172
+  def type_alias_dependency; end
+
+  # source://rbs/lib/rbs/validator.rb#176
+  def type_alias_regularity; end
+
+  # source://rbs/lib/rbs/validator.rb#152
+  def validate_class_alias(entry:); end
+
+  # source://rbs/lib/rbs/validator.rb#102
+  def validate_method_definition(method_def, type_name:); end
+
+  # Validates presence of the relative type, and application arity match.
+  #
+  # source://rbs/lib/rbs/validator.rb#22
+  def validate_type(type, context:); end
+
+  # source://rbs/lib/rbs/validator.rb#61
+  def validate_type_alias(entry:); end
+
+  # source://rbs/lib/rbs/validator.rb#118
+  def validate_type_params(params, type_name:, location:, method_name: T.unsafe(nil)); end
+end
+
+# source://rbs/lib/rbs/variance_calculator.rb#4
+class RBS::VarianceCalculator
+  # @return [VarianceCalculator] a new instance of VarianceCalculator
+  #
+  # source://rbs/lib/rbs/variance_calculator.rb#78
+  def initialize(builder:); end
+
+  # Returns the value of attribute builder.
+  #
+  # source://rbs/lib/rbs/variance_calculator.rb#76
+  def builder; end
+
+  # source://rbs/lib/rbs/variance_calculator.rb#82
+  def env; end
+
+  # source://rbs/lib/rbs/variance_calculator.rb#169
+  def function(type, result:, context:); end
+
+  # source://rbs/lib/rbs/variance_calculator.rb#98
+  def in_inherit(name:, args:, variables:); end
+
+  # source://rbs/lib/rbs/variance_calculator.rb#86
+  def in_method_type(method_type:, variables:); end
+
+  # source://rbs/lib/rbs/variance_calculator.rb#110
+  def in_type_alias(name:); end
+
+  # source://rbs/lib/rbs/variance_calculator.rb#176
+  def negate(variance); end
+
+  # source://rbs/lib/rbs/variance_calculator.rb#121
+  def type(type, result:, context:); end
+end
+
+# source://rbs/lib/rbs/variance_calculator.rb#5
+class RBS::VarianceCalculator::Result
+  # @return [Result] a new instance of Result
+  #
+  # source://rbs/lib/rbs/variance_calculator.rb#8
+  def initialize(variables:); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/variance_calculator.rb#45
+  def compatible?(var, with_annotation:); end
+
+  # source://rbs/lib/rbs/variance_calculator.rb#24
+  def contravariant(x); end
+
+  # source://rbs/lib/rbs/variance_calculator.rb#15
+  def covariant(x); end
+
+  # source://rbs/lib/rbs/variance_calculator.rb#37
+  def each(&block); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/variance_calculator.rb#41
+  def include?(name); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/variance_calculator.rb#60
+  def incompatible?(params); end
+
+  # source://rbs/lib/rbs/variance_calculator.rb#33
+  def invariant(x); end
+
+  # Returns the value of attribute result.
+  #
+  # source://rbs/lib/rbs/variance_calculator.rb#6
+  def result; end
+end
+
+# source://rbs/lib/rbs/vendorer.rb#4
+class RBS::Vendorer
+  # @return [Vendorer] a new instance of Vendorer
+  #
+  # source://rbs/lib/rbs/vendorer.rb#8
+  def initialize(vendor_dir:, loader:); end
+
+  # source://rbs/lib/rbs/vendorer.rb#21
+  def clean!; end
+
+  # source://rbs/lib/rbs/vendorer.rb#28
+  def copy!; end
+
+  # source://rbs/lib/rbs/vendorer.rb#13
+  def ensure_dir; end
+
+  # Returns the value of attribute loader.
+  #
+  # source://rbs/lib/rbs/vendorer.rb#6
+  def loader; end
+
+  # Returns the value of attribute vendor_dir.
+  #
+  # source://rbs/lib/rbs/vendorer.rb#5
+  def vendor_dir; end
+end
+
+# source://rbs/lib/rbs/errors.rb#569
+class RBS::WillSyntaxError < ::RBS::DefinitionError
+  include ::RBS::DetailedMessageable
+
+  # @return [WillSyntaxError] a new instance of WillSyntaxError
+  #
+  # source://rbs/lib/rbs/errors.rb#574
+  def initialize(message, location:); end
+
+  # Returns the value of attribute location.
+  #
+  # source://rbs/lib/rbs/errors.rb#572
+  def location; end
+end
+
+# source://rbs/lib/rbs/writer.rb#4
+class RBS::Writer
+  # @return [Writer] a new instance of Writer
+  #
+  # source://rbs/lib/rbs/writer.rb#8
+  def initialize(out:); end
+
+  # source://rbs/lib/rbs/writer.rb#361
+  def attribute(kind, attr); end
+
+  # source://rbs/lib/rbs/writer.rb#42
+  def format_annotation(annotation); end
+
+  # source://rbs/lib/rbs/writer.rb#23
+  def indent(size = T.unsafe(nil)); end
+
+  # Returns the value of attribute indentation.
+  #
+  # source://rbs/lib/rbs/writer.rb#6
+  def indentation; end
+
+  # source://rbs/lib/rbs/writer.rb#288
+  def method_name(name); end
+
+  # source://rbs/lib/rbs/writer.rb#214
+  def name_and_args(name, args); end
+
+  # source://rbs/lib/rbs/writer.rb#202
+  def name_and_params(name, params); end
+
+  # Returns the value of attribute out.
+  #
+  # source://rbs/lib/rbs/writer.rb#5
+  def out; end
+
+  # source://rbs/lib/rbs/writer.rb#30
+  def prefix; end
+
+  # source://rbs/lib/rbs/writer.rb#18
+  def preserve!(preserve: T.unsafe(nil)); end
+
+  # @return [Boolean]
+  #
+  # source://rbs/lib/rbs/writer.rb#14
+  def preserve?; end
+
+  # source://rbs/lib/rbs/writer.rb#391
+  def preserve_empty_line(prev, decl); end
+
+  # source://rbs/lib/rbs/writer.rb#224
+  def put_lines(lines, leading_spaces:); end
+
+  # source://rbs/lib/rbs/writer.rb#34
+  def puts(string = T.unsafe(nil)); end
+
+  # source://rbs/lib/rbs/writer.rb#79
+  def write(contents); end
+
+  # source://rbs/lib/rbs/writer.rb#60
+  def write_annotation(annotations); end
+
+  # source://rbs/lib/rbs/writer.rb#66
+  def write_comment(comment); end
+
+  # source://rbs/lib/rbs/writer.rb#114
+  def write_decl(decl); end
+
+  # source://rbs/lib/rbs/writer.rb#309
+  def write_def(member); end
+
+  # source://rbs/lib/rbs/writer.rb#97
+  def write_directive(dir); end
+
+  # source://rbs/lib/rbs/writer.rb#301
+  def write_loc_source(located); end
+
+  # source://rbs/lib/rbs/writer.rb#234
+  def write_member(member); end
+end
+
+# source://rbs/lib/rdoc/discover.rb#8
+class RDoc::Parser::RBS < ::RDoc::Parser
+  # source://rbs/lib/rdoc/discover.rb#10
+  def scan; end
+end
diff --git a/sorbet/rbi/gems/ruby-lsp-rails@0.3.25.rbi b/sorbet/rbi/gems/ruby-lsp-rails@0.3.25.rbi
new file mode 100644
index 000000000..9f0d256ed
--- /dev/null
+++ b/sorbet/rbi/gems/ruby-lsp-rails@0.3.25.rbi
@@ -0,0 +1,783 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `ruby-lsp-rails` gem.
+# Please instead update this file by running `bin/tapioca gem ruby-lsp-rails`.
+
+
+# source://ruby-lsp-rails/lib/ruby_lsp_rails/version.rb#4
+module RubyLsp; end
+
+# # Supported features
+#
+# - [Hover](rdoc-ref:RubyLsp::Rails::Hover)
+# - [CodeLens](rdoc-ref:RubyLsp::Rails::CodeLens)
+# - [DocumentSymbol](rdoc-ref:RubyLsp::Rails::DocumentSymbol)
+# - [Definition](rdoc-ref:RubyLsp::Rails::Definition)
+#
+# source://ruby-lsp-rails/lib/ruby_lsp_rails/version.rb#5
+module RubyLsp::Rails; end
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/support/active_support_test_case_helper.rb#6
+module RubyLsp::Rails::ActiveSupportTestCaseHelper
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/support/active_support_test_case_helper.rb#10
+  sig { params(node: ::Prism::CallNode).returns(T.nilable(::String)) }
+  def extract_test_case_name(node); end
+end
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/addon.rb#20
+class RubyLsp::Rails::Addon < ::RubyLsp::Addon
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/addon.rb#26
+  sig { void }
+  def initialize; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/addon.rb#53
+  sig { override.params(global_state: ::RubyLsp::GlobalState, outgoing_queue: ::Thread::Queue).void }
+  def activate(global_state, outgoing_queue); end
+
+  # Creates a new CodeLens listener. This method is invoked on every CodeLens request
+  #
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/addon.rb#83
+  sig do
+    override
+      .params(
+        response_builder: RubyLsp::ResponseBuilders::CollectionResponseBuilder[::LanguageServer::Protocol::Interface::CodeLens],
+        uri: ::URI::Generic,
+        dispatcher: ::Prism::Dispatcher
+      ).void
+  end
+  def create_code_lens_listener(response_builder, uri, dispatcher); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/addon.rb#118
+  sig do
+    override
+      .params(
+        response_builder: RubyLsp::ResponseBuilders::CollectionResponseBuilder[T.any(::LanguageServer::Protocol::Interface::Location, ::LanguageServer::Protocol::Interface::LocationLink)],
+        uri: ::URI::Generic,
+        node_context: ::RubyLsp::NodeContext,
+        dispatcher: ::Prism::Dispatcher
+      ).void
+  end
+  def create_definition_listener(response_builder, uri, node_context, dispatcher); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/addon.rb#104
+  sig do
+    override
+      .params(
+        response_builder: RubyLsp::ResponseBuilders::DocumentSymbol,
+        dispatcher: ::Prism::Dispatcher
+      ).returns(::Object)
+  end
+  def create_document_symbol_listener(response_builder, dispatcher); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/addon.rb#94
+  sig do
+    override
+      .params(
+        response_builder: RubyLsp::ResponseBuilders::Hover,
+        node_context: ::RubyLsp::NodeContext,
+        dispatcher: ::Prism::Dispatcher
+      ).void
+  end
+  def create_hover_listener(response_builder, node_context, dispatcher); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/addon.rb#66
+  sig { override.void }
+  def deactivate; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/addon.rb#143
+  sig { override.params(title: ::String).void }
+  def handle_window_show_message_response(title); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/addon.rb#138
+  sig { override.returns(::String) }
+  def name; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/addon.rb#48
+  sig { returns(::RubyLsp::Rails::RunnerClient) }
+  def rails_runner_client; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/addon.rb#71
+  sig { override.returns(::String) }
+  def version; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/addon.rb#124
+  sig { params(changes: T::Array[{uri: ::String, type: ::Integer}]).void }
+  def workspace_did_change_watched_files(changes); end
+
+  private
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/addon.rb#170
+  sig { params(id: ::String, title: ::String, percentage: T.nilable(::Integer), message: T.nilable(::String)).void }
+  def begin_progress(id, title, percentage: T.unsafe(nil), message: T.unsafe(nil)); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/addon.rb#195
+  sig { params(id: ::String).void }
+  def end_progress(id); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/addon.rb#228
+  sig { void }
+  def offer_to_run_pending_migrations; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/addon.rb#202
+  sig { params(global_state: ::RubyLsp::GlobalState, outgoing_queue: ::Thread::Queue).void }
+  def register_additional_file_watchers(global_state:, outgoing_queue:); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/addon.rb#188
+  sig { params(id: ::String, percentage: T.nilable(::Integer), message: T.nilable(::String)).void }
+  def report_progress(id, percentage: T.unsafe(nil), message: T.unsafe(nil)); end
+end
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/addon.rb#23
+RubyLsp::Rails::Addon::RUN_MIGRATIONS_TITLE = T.let(T.unsafe(nil), String)
+
+# ![CodeLens demo](../../code_lens.gif)
+#
+# This feature adds Code Lens features for Rails applications.
+#
+# For Active Support test cases:
+#
+# - Run tests in the VS Terminal
+# - Run tests in the VS Code Test Explorer
+# - Debug tests
+# - Run migrations in the VS Terminal
+#
+# For Rails controllers:
+#
+# - See the path corresponding to an action
+# - Click on the action's Code Lens to jump to its declaration in the routes.
+#
+# Note: This depends on a support for the `rubyLsp.openFile` command.
+# For the VS Code extension this is built-in, but for other editors this may require some custom configuration.
+#
+# The
+# [code lens](https://microsoft.github.io/language-server-protocol/specification#textDocument_codeLens)
+# request informs the editor of runnable commands such as tests.
+# It's available for tests which inherit from `ActiveSupport::TestCase` or one of its descendants, such as
+# `ActionDispatch::IntegrationTest`.
+#
+# # Example:
+#
+# For the following code, Code Lenses will be added above the class definition above each test method.
+#
+# ```ruby
+# Run
+# class HelloTest < ActiveSupport::TestCase # <- Will show code lenses above for running or debugging the whole test
+#   test "outputs hello" do # <- Will show code lenses above for running or debugging this test
+#     # ...
+#   end
+#
+#   test "outputs goodbye" do # <- Will show code lenses above for running or debugging this test
+#     # ...
+#   end
+# end
+# ```
+#
+# # Example:
+# ```ruby
+# Run
+# class AddFirstNameToUsers < ActiveRecord::Migration[7.1]
+#   # ...
+# end
+# ```
+#
+# The code lenses will be displayed above the class and above each test method.
+#
+# Note: When using the Test Explorer view, if your code contains a statement to pause execution (e.g. `debugger`) it
+# will cause the test runner to hang.
+#
+# For the following code, assuming the routing contains `resources :users`, a Code Lens will be seen above each
+# action.
+#
+# ```ruby
+# class UsersController < ApplicationController
+#   GET /users(.:format)
+#   def index # <- Will show code lens above for the path
+#   end
+# end
+# ```
+#
+# Note: Complex routing configurations may not be supported.
+#
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/code_lens.rb#74
+class RubyLsp::Rails::CodeLens
+  include ::RubyLsp::Requests::Support::Common
+  include ::RubyLsp::Rails::ActiveSupportTestCaseHelper
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/code_lens.rb#88
+  sig do
+    params(
+      client: ::RubyLsp::Rails::RunnerClient,
+      global_state: ::RubyLsp::GlobalState,
+      response_builder: RubyLsp::ResponseBuilders::CollectionResponseBuilder[::LanguageServer::Protocol::Interface::CodeLens],
+      uri: ::URI::Generic,
+      dispatcher: ::Prism::Dispatcher
+    ).void
+  end
+  def initialize(client, global_state, response_builder, uri, dispatcher); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/code_lens.rb#109
+  sig { params(node: ::Prism::CallNode).void }
+  def on_call_node_enter(node); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/code_lens.rb#137
+  sig { params(node: ::Prism::ClassNode).void }
+  def on_class_node_enter(node); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/code_lens.rb#161
+  sig { params(node: ::Prism::ClassNode).void }
+  def on_class_node_leave(node); end
+
+  # Although uncommon, Rails tests can be written with the classic "def test_name" syntax.
+  #
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/code_lens.rb#121
+  sig { params(node: ::Prism::DefNode).void }
+  def on_def_node_enter(node); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/code_lens.rb#172
+  sig { params(node: ::Prism::ModuleNode).void }
+  def on_module_node_enter(node); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/code_lens.rb#177
+  sig { params(node: ::Prism::ModuleNode).void }
+  def on_module_node_leave(node); end
+
+  private
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/code_lens.rb#192
+  sig { params(node: ::Prism::DefNode).void }
+  def add_jump_to_view(node); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/code_lens.rb#252
+  sig { params(node: ::Prism::Node, name: ::String, command: ::String).void }
+  def add_migrate_code_lens(node, name:, command:); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/code_lens.rb#220
+  sig { params(node: ::Prism::DefNode).void }
+  def add_route_code_lens_to_action(node); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/code_lens.rb#265
+  sig { params(node: ::Prism::Node, name: ::String, command: ::String, kind: ::Symbol).void }
+  def add_test_code_lens(node, name:, command:, kind:); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/code_lens.rb#184
+  sig { returns(T.nilable(T::Boolean)) }
+  def controller?; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/code_lens.rb#242
+  sig { returns(::String) }
+  def migrate_command; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/code_lens.rb#247
+  sig { returns(T.nilable(::String)) }
+  def migration_version; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/code_lens.rb#237
+  sig { returns(::String) }
+  def test_command; end
+end
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#12
+module RubyLsp::Rails::Common
+  # Log a message to the editor's output panel
+  #
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#20
+  def log_message(message); end
+
+  # Write a message to the client. Can be used for sending notifications to the editor
+  #
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#14
+  def send_message(message); end
+end
+
+# ![Definition demo](../../definition.gif)
+#
+# The [definition
+# request](https://microsoft.github.io/language-server-protocol/specification#textDocument_definition) jumps to the
+# definition of the symbol under the cursor.
+#
+# Currently supported targets:
+#
+# - Callbacks
+# - Named routes (e.g. `users_path`)
+#
+# # Example
+#
+# ```ruby
+# before_action :foo # <- Go to definition on this symbol will jump to the method
+# ```
+#
+# Notes for named routes:
+#
+# - It is available only in Rails 7.1 or newer.
+# - Route may be defined across multiple files, e.g. using `draw`, rather than in `routes.rb`.
+# - Routes won't be found if not defined for the Rails development environment.
+# - If using `constraints`, the route can only be found if the constraints are met.
+# - Changes to routes won't be picked up until the server is restarted.
+#
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/definition.rb#30
+class RubyLsp::Rails::Definition
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/definition.rb#45
+  sig do
+    params(
+      client: ::RubyLsp::Rails::RunnerClient,
+      response_builder: RubyLsp::ResponseBuilders::CollectionResponseBuilder[T.any(::LanguageServer::Protocol::Interface::Location, ::LanguageServer::Protocol::Interface::LocationLink)],
+      node_context: ::RubyLsp::NodeContext,
+      index: ::RubyIndexer::Index,
+      dispatcher: ::Prism::Dispatcher
+    ).void
+  end
+  def initialize(client, response_builder, node_context, index, dispatcher); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/definition.rb#66
+  sig { params(node: T.any(::Prism::StringNode, ::Prism::SymbolNode)).void }
+  def handle_possible_dsl(node); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/definition.rb#83
+  sig { params(node: ::Prism::CallNode).void }
+  def on_call_node_enter(node); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/definition.rb#61
+  sig { params(node: ::Prism::StringNode).void }
+  def on_string_node_enter(node); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/definition.rb#56
+  sig { params(node: ::Prism::SymbolNode).void }
+  def on_symbol_node_enter(node); end
+
+  private
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/definition.rb#142
+  sig { params(name: ::String).void }
+  def collect_definitions(name); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/definition.rb#117
+  sig { params(node: ::Prism::CallNode).void }
+  def handle_association(node); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/definition.rb#98
+  sig { params(node: ::Prism::CallNode).void }
+  def handle_callback(node); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/definition.rb#134
+  sig { params(node: ::Prism::CallNode).void }
+  def handle_route(node); end
+end
+
+# ![Document Symbol demo](../../document_symbol.gif)
+#
+# The [document symbol](https://microsoft.github.io/language-server-protocol/specification#textDocument_documentSymbol)
+# request allows users to navigate between associations, validations, callbacks and ActiveSupport test cases with
+# VS Code's "Go to Symbol" feature.
+#
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/document_symbol.rb#11
+class RubyLsp::Rails::DocumentSymbol
+  include ::RubyLsp::Requests::Support::Common
+  include ::RubyLsp::Rails::ActiveSupportTestCaseHelper
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/document_symbol.rb#22
+  sig { params(response_builder: RubyLsp::ResponseBuilders::DocumentSymbol, dispatcher: ::Prism::Dispatcher).void }
+  def initialize(response_builder, dispatcher); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/document_symbol.rb#37
+  sig { params(node: ::Prism::CallNode).void }
+  def on_call_node_enter(node); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/document_symbol.rb#66
+  sig { params(node: ::Prism::ClassNode).void }
+  def on_class_node_enter(node); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/document_symbol.rb#71
+  sig { params(node: ::Prism::ClassNode).void }
+  def on_class_node_leave(node); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/document_symbol.rb#76
+  sig { params(node: ::Prism::ModuleNode).void }
+  def on_module_node_enter(node); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/document_symbol.rb#81
+  sig { params(node: ::Prism::ModuleNode).void }
+  def on_module_node_leave(node); end
+
+  private
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/document_symbol.rb#88
+  sig { params(node: T.any(::Prism::ClassNode, ::Prism::ModuleNode)).void }
+  def add_to_namespace_stack(node); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/document_symbol.rb#223
+  sig do
+    params(
+      name: ::String,
+      range: ::LanguageServer::Protocol::Interface::Range,
+      selection_range: ::LanguageServer::Protocol::Interface::Range
+    ).void
+  end
+  def append_document_symbol(name:, range:, selection_range:); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/document_symbol.rb#98
+  sig { params(node: ::Prism::CallNode, message: ::String).void }
+  def handle_all_arg_types(node, message); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/document_symbol.rb#197
+  sig { params(node: ::Prism::CallNode, message: ::String).void }
+  def handle_class_arg_types(node, message); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/document_symbol.rb#168
+  sig { params(node: ::Prism::CallNode, message: ::String).void }
+  def handle_symbol_and_string_arg_types(node, message); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/document_symbol.rb#93
+  sig { params(node: T.any(::Prism::ClassNode, ::Prism::ModuleNode)).void }
+  def remove_from_namespace_stack(node); end
+end
+
+# ![Hover demo](../../hover.gif)
+#
+# Augment [hover](https://microsoft.github.io/language-server-protocol/specification#textDocument_hover) with
+# information about a model.
+#
+# # Example
+#
+# ```ruby
+# User.all
+# # ^ hovering here will show information about the User model
+# ```
+#
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/hover.rb#17
+class RubyLsp::Rails::Hover
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/hover.rb#30
+  sig do
+    params(
+      client: ::RubyLsp::Rails::RunnerClient,
+      response_builder: RubyLsp::ResponseBuilders::Hover,
+      node_context: ::RubyLsp::NodeContext,
+      global_state: ::RubyLsp::GlobalState,
+      dispatcher: ::Prism::Dispatcher
+    ).void
+  end
+  def initialize(client, response_builder, node_context, global_state, dispatcher); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/hover.rb#39
+  sig { params(node: ::Prism::ConstantPathNode).void }
+  def on_constant_path_node_enter(node); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/hover.rb#48
+  sig { params(node: ::Prism::ConstantReadNode).void }
+  def on_constant_read_node_enter(node); end
+
+  private
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/hover.rb#83
+  sig { params(default_value: ::String, type: ::String).returns(::String) }
+  def format_default(default_value, type); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/hover.rb#58
+  sig { params(name: ::String).void }
+  def generate_column_content(name); end
+end
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/indexing_enhancement.rb#6
+class RubyLsp::Rails::IndexingEnhancement < ::RubyIndexer::Enhancement
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/indexing_enhancement.rb#20
+  sig do
+    override
+      .params(
+        owner: T.nilable(::RubyIndexer::Entry::Namespace),
+        node: ::Prism::CallNode,
+        file_path: ::String,
+        code_units_cache: T.any(::Prism::CodeUnitsCache, T.proc.params(arg0: ::Integer).returns(::Integer))
+      ).void
+  end
+  def on_call_node_enter(owner, node, file_path, code_units_cache); end
+
+  private
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/indexing_enhancement.rb#46
+  sig do
+    params(
+      owner: ::RubyIndexer::Entry::Namespace,
+      node: ::Prism::CallNode,
+      file_path: ::String,
+      code_units_cache: T.any(::Prism::CodeUnitsCache, T.proc.params(arg0: ::Integer).returns(::Integer))
+    ).void
+  end
+  def handle_association(owner, node, file_path, code_units_cache); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/indexing_enhancement.rb#94
+  sig { params(owner: ::RubyIndexer::Entry::Namespace, node: ::Prism::CallNode).void }
+  def handle_concern_extend(owner, node); end
+end
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#342
+class RubyLsp::Rails::NullClient < ::RubyLsp::Rails::RunnerClient
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#346
+  sig { void }
+  def initialize; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#360
+  sig { override.returns(::String) }
+  def rails_root; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#350
+  sig { override.void }
+  def shutdown; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#355
+  sig { override.returns(T::Boolean) }
+  def stopped?; end
+
+  private
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#367
+  sig { params(message: ::String, type: ::Integer).void }
+  def log_message(message, type: T.unsafe(nil)); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#377
+  sig { override.returns(T.nilable(T::Hash[::Symbol, T.untyped])) }
+  def read_response; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#372
+  sig { override.params(request: ::String, params: T.untyped).void }
+  def send_message(request, **params); end
+end
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#9
+class RubyLsp::Rails::RunnerClient
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#56
+  sig { params(outgoing_queue: ::Thread::Queue).void }
+  def initialize(outgoing_queue); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#144
+  sig { params(model_name: ::String, association_name: ::String).returns(T.nilable(T::Hash[::Symbol, T.untyped])) }
+  def association_target_location(model_name:, association_name:); end
+
+  # Delegates a notification to a server add-on
+  #
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#182
+  sig { params(server_addon_name: ::String, request_name: ::String, params: T.untyped).void }
+  def delegate_notification(server_addon_name:, request_name:, **params); end
+
+  # Delegates a request to a server add-on
+  #
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#222
+  sig do
+    params(
+      server_addon_name: ::String,
+      request_name: ::String,
+      params: T.untyped
+    ).returns(T.nilable(T::Hash[::Symbol, T.untyped]))
+  end
+  def delegate_request(server_addon_name:, request_name:, **params); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#267
+  sig { params(request: ::String, params: T.untyped).returns(T.nilable(T::Hash[::Symbol, T.untyped])) }
+  def make_request(request, **params); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#128
+  sig { params(name: ::String).returns(T.nilable(T::Hash[::Symbol, T.untyped])) }
+  def model(name); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#192
+  sig { returns(T.nilable(::String)) }
+  def pending_migrations_message; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#53
+  sig { returns(::String) }
+  def rails_root; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#117
+  sig { params(server_addon_path: ::String).void }
+  def register_server_addon(server_addon_path); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#170
+  sig { params(controller: ::String, action: ::String).returns(T.nilable(T::Hash[::Symbol, T.untyped])) }
+  def route(controller:, action:); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#159
+  sig { params(name: ::String).returns(T.nilable(T::Hash[::Symbol, T.untyped])) }
+  def route_location(name); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#204
+  sig { returns(T.nilable(T::Hash[::Symbol, T.untyped])) }
+  def run_migrations; end
+
+  # Notifications are like messages, but one-way, with no response sent back.
+  #
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#274
+  sig { params(request: ::String, params: T.untyped).void }
+  def send_notification(request, **params); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#246
+  sig { void }
+  def shutdown; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#257
+  sig { returns(T::Boolean) }
+  def stopped?; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#234
+  sig { void }
+  def trigger_reload; end
+
+  private
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#318
+  sig { void }
+  def force_kill; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#324
+  sig { params(message: ::String, type: ::Integer).void }
+  def log_message(message, type: T.unsafe(nil)); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#331
+  sig { returns(T.nilable(::Integer)) }
+  def read_content_length; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#292
+  sig { overridable.returns(T.nilable(T::Hash[::Symbol, T.untyped])) }
+  def read_response; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#279
+  sig { overridable.params(request: ::String, params: T.untyped).void }
+  def send_message(request, **params); end
+
+  class << self
+    # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#14
+    sig { params(outgoing_queue: ::Thread::Queue).returns(::RubyLsp::Rails::RunnerClient) }
+    def create_client(outgoing_queue); end
+  end
+end
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#48
+class RubyLsp::Rails::RunnerClient::EmptyMessageError < ::RubyLsp::Rails::RunnerClient::MessageError; end
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#47
+class RubyLsp::Rails::RunnerClient::IncompleteMessageError < ::RubyLsp::Rails::RunnerClient::MessageError; end
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#45
+class RubyLsp::Rails::RunnerClient::InitializationError < ::StandardError; end
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/runner_client.rb#46
+class RubyLsp::Rails::RunnerClient::MessageError < ::StandardError; end
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#66
+class RubyLsp::Rails::Server
+  include ::RubyLsp::Rails::Common
+
+  # @return [Server] a new instance of Server
+  #
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#69
+  def initialize(stdout: T.unsafe(nil), override_default_output_device: T.unsafe(nil)); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#105
+  def execute(request, params); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#89
+  def start; end
+
+  private
+
+  # @return [Boolean]
+  #
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#251
+  def active_record_model?(const); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#261
+  def pending_migrations_message; end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#228
+  def resolve_association_target(params); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#203
+  def resolve_database_info_from_model(model_name); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#142
+  def resolve_route_info(requirements); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#198
+  def route_location(name); end
+
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#271
+  def run_migrations; end
+end
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#25
+class RubyLsp::Rails::ServerAddon
+  include ::RubyLsp::Rails::Common
+
+  # @return [ServerAddon] a new instance of ServerAddon
+  #
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#53
+  def initialize(stdout); end
+
+  # @raise [NotImplementedError]
+  #
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#61
+  def execute(request, params); end
+
+  # @raise [NotImplementedError]
+  #
+  # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#57
+  def name; end
+
+  class << self
+    # Delegate `request` with `params` to the server add-on with the given `name`
+    #
+    # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#40
+    def delegate(name, request, params); end
+
+    # Instantiate all server addons and store them in a hash for easy access after we have discovered the classes
+    #
+    # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#45
+    def finalize_registrations!(stdout); end
+
+    # We keep track of runtime server add-ons the same way we track other add-ons, by storing classes that inherit
+    # from the base one
+    #
+    # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/server.rb#34
+    def inherited(child); end
+  end
+end
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/support/associations.rb#6
+module RubyLsp::Rails::Support; end
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/support/associations.rb#7
+module RubyLsp::Rails::Support::Associations; end
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/support/associations.rb#8
+RubyLsp::Rails::Support::Associations::ALL = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/support/callbacks.rb#7
+module RubyLsp::Rails::Support::Callbacks; end
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/support/callbacks.rb#67
+RubyLsp::Rails::Support::Callbacks::ALL = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/support/callbacks.rb#37
+RubyLsp::Rails::Support::Callbacks::CONTROLLERS = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/support/callbacks.rb#55
+RubyLsp::Rails::Support::Callbacks::JOBS = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/support/callbacks.rb#8
+RubyLsp::Rails::Support::Callbacks::MODELS = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/support/location_builder.rb#7
+class RubyLsp::Rails::Support::LocationBuilder
+  class << self
+    # @raise [ArgumentError]
+    #
+    # source://ruby-lsp-rails/lib/ruby_lsp/ruby_lsp_rails/support/location_builder.rb#12
+    sig { params(location_string: ::String).returns(::LanguageServer::Protocol::Interface::Location) }
+    def line_location_from_s(location_string); end
+  end
+end
+
+# source://ruby-lsp-rails/lib/ruby_lsp_rails/version.rb#6
+RubyLsp::Rails::VERSION = T.let(T.unsafe(nil), String)
diff --git a/sorbet/rbi/gems/ruby-lsp@0.21.4-06602886c19cad7f44101b143bdbba9a5fc40a0d.rbi b/sorbet/rbi/gems/ruby-lsp@0.21.4-06602886c19cad7f44101b143bdbba9a5fc40a0d.rbi
new file mode 100644
index 000000000..da32b2caa
--- /dev/null
+++ b/sorbet/rbi/gems/ruby-lsp@0.21.4-06602886c19cad7f44101b143bdbba9a5fc40a0d.rbi
@@ -0,0 +1,6057 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `ruby-lsp` gem.
+# Please instead update this file by running `bin/tapioca gem ruby-lsp`.
+
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/indexable_path.rb#4
+module RubyIndexer; end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/configuration.rb#5
+class RubyIndexer::Configuration
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/configuration.rb#26
+  sig { void }
+  def initialize; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/configuration.rb#223
+  sig { params(config: T::Hash[::String, T.untyped]).void }
+  def apply_config(config); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/configuration.rb#23
+  sig { returns(::Encoding) }
+  def encoding; end
+
+  # @return [Encoding]
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/configuration.rb#23
+  def encoding=(_arg0); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/configuration.rb#85
+  sig { returns(T::Array[::RubyIndexer::IndexablePath]) }
+  def indexables; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/configuration.rb#218
+  sig { returns(::Regexp) }
+  def magic_comment_regex; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/configuration.rb#70
+  sig { returns(::String) }
+  def merged_excluded_file_pattern; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/configuration.rb#20
+  sig { params(workspace_path: ::String).void }
+  def workspace_path=(workspace_path); end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/configuration.rb#251
+  sig { returns(T::Array[::String]) }
+  def initial_excluded_gems; end
+
+  # @raise [ArgumentError]
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/configuration.rb#236
+  sig { params(config: T::Hash[::String, T.untyped]).void }
+  def validate_config!(config); end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/configuration.rb#8
+RubyIndexer::Configuration::CONFIGURATION_SCHEMA = T.let(T.unsafe(nil), Hash)
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#5
+class RubyIndexer::DeclarationListener
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#24
+  sig do
+    params(
+      index: ::RubyIndexer::Index,
+      dispatcher: ::Prism::Dispatcher,
+      parse_result: ::Prism::ParseResult,
+      file_path: ::String,
+      collect_comments: T::Boolean,
+      enhancements: T::Array[::RubyIndexer::Enhancement]
+    ).void
+  end
+  def initialize(index, dispatcher, parse_result, file_path, collect_comments: T.unsafe(nil), enhancements: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#12
+  sig { returns(T::Array[::String]) }
+  def indexing_errors; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#451
+  sig { params(node: ::Prism::AliasMethodNode).void }
+  def on_alias_method_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#293
+  sig { params(node: ::Prism::CallNode).void }
+  def on_call_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#329
+  sig { params(node: ::Prism::CallNode).void }
+  def on_call_node_leave(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#87
+  sig { params(node: ::Prism::ClassNode).void }
+  def on_class_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#130
+  sig { params(node: ::Prism::ClassNode).void }
+  def on_class_node_leave(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#281
+  sig { params(node: ::Prism::ConstantAndWriteNode).void }
+  def on_constant_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#287
+  sig { params(node: ::Prism::ConstantOperatorWriteNode).void }
+  def on_constant_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#275
+  sig { params(node: ::Prism::ConstantOrWriteNode).void }
+  def on_constant_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#259
+  sig { params(node: ::Prism::ConstantPathAndWriteNode).void }
+  def on_constant_path_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#249
+  sig { params(node: ::Prism::ConstantPathOperatorWriteNode).void }
+  def on_constant_path_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#239
+  sig { params(node: ::Prism::ConstantPathOrWriteNode).void }
+  def on_constant_path_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#229
+  sig { params(node: ::Prism::ConstantPathWriteNode).void }
+  def on_constant_path_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#269
+  sig { params(node: ::Prism::ConstantWriteNode).void }
+  def on_constant_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#350
+  sig { params(node: ::Prism::DefNode).void }
+  def on_def_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#391
+  sig { params(node: ::Prism::DefNode).void }
+  def on_def_node_leave(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#401
+  sig { params(node: ::Prism::GlobalVariableAndWriteNode).void }
+  def on_global_variable_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#406
+  sig { params(node: ::Prism::GlobalVariableOperatorWriteNode).void }
+  def on_global_variable_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#411
+  sig { params(node: ::Prism::GlobalVariableOrWriteNode).void }
+  def on_global_variable_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#416
+  sig { params(node: ::Prism::GlobalVariableTargetNode).void }
+  def on_global_variable_target_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#421
+  sig { params(node: ::Prism::GlobalVariableWriteNode).void }
+  def on_global_variable_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#431
+  sig { params(node: ::Prism::InstanceVariableAndWriteNode).void }
+  def on_instance_variable_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#436
+  sig { params(node: ::Prism::InstanceVariableOperatorWriteNode).void }
+  def on_instance_variable_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#441
+  sig { params(node: ::Prism::InstanceVariableOrWriteNode).void }
+  def on_instance_variable_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#446
+  sig { params(node: ::Prism::InstanceVariableTargetNode).void }
+  def on_instance_variable_target_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#426
+  sig { params(node: ::Prism::InstanceVariableWriteNode).void }
+  def on_instance_variable_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#137
+  sig { params(node: ::Prism::ModuleNode).void }
+  def on_module_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#158
+  sig { params(node: ::Prism::ModuleNode).void }
+  def on_module_node_leave(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#209
+  sig { params(node: ::Prism::MultiWriteNode).void }
+  def on_multi_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#165
+  sig { params(node: ::Prism::SingletonClassNode).void }
+  def on_singleton_class_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#202
+  sig { params(node: ::Prism::SingletonClassNode).void }
+  def on_singleton_class_node_leave(node); end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#901
+  sig { params(name: ::String).returns(T::Array[::String]) }
+  def actual_nesting(name); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#607
+  sig do
+    params(
+      node: T.any(::Prism::ConstantAndWriteNode, ::Prism::ConstantOperatorWriteNode, ::Prism::ConstantOrWriteNode, ::Prism::ConstantPathAndWriteNode, ::Prism::ConstantPathOperatorWriteNode, ::Prism::ConstantPathOrWriteNode, ::Prism::ConstantPathTargetNode, ::Prism::ConstantPathWriteNode, ::Prism::ConstantTargetNode, ::Prism::ConstantWriteNode),
+      name: ::String,
+      value: T.nilable(::Prism::Node)
+    ).void
+  end
+  def add_constant(node, name, value = T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#658
+  sig { params(node: ::Prism::Node).returns(T.nilable(::String)) }
+  def collect_comments(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#809
+  sig { returns(::RubyIndexer::Entry::Visibility) }
+  def current_visibility; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#687
+  sig { params(name: ::String).returns(::String) }
+  def fully_qualify_name(name); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#551
+  sig { params(node: ::Prism::CallNode).void }
+  def handle_alias_method(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#696
+  sig { params(node: ::Prism::CallNode, reader: T::Boolean, writer: T::Boolean).void }
+  def handle_attribute(node, reader:, writer:); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#480
+  sig do
+    params(
+      node: T.any(::Prism::GlobalVariableAndWriteNode, ::Prism::GlobalVariableOperatorWriteNode, ::Prism::GlobalVariableOrWriteNode, ::Prism::GlobalVariableTargetNode, ::Prism::GlobalVariableWriteNode),
+      loc: ::Prism::Location
+    ).void
+  end
+  def handle_global_variable(node, loc); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#504
+  sig do
+    params(
+      node: T.any(::Prism::InstanceVariableAndWriteNode, ::Prism::InstanceVariableOperatorWriteNode, ::Prism::InstanceVariableOrWriteNode, ::Prism::InstanceVariableTargetNode, ::Prism::InstanceVariableWriteNode),
+      loc: ::Prism::Location
+    ).void
+  end
+  def handle_instance_variable(node, loc); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#767
+  sig { params(node: ::Prism::CallNode).void }
+  def handle_module_function(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#739
+  sig { params(node: ::Prism::CallNode, operation: ::Symbol).void }
+  def handle_module_operation(node, operation); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#526
+  sig { params(node: ::Prism::CallNode).void }
+  def handle_private_constant(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#814
+  sig do
+    params(
+      parameters_node: T.nilable(::Prism::ParametersNode)
+    ).returns(T::Array[::RubyIndexer::Entry::Parameter])
+  end
+  def list_params(parameters_node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#876
+  sig { params(node: T.nilable(::Prism::Node)).returns(T.nilable(::Symbol)) }
+  def parameter_name(node); end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#9
+RubyIndexer::DeclarationListener::BASIC_OBJECT_NESTING = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/declaration_listener.rb#8
+RubyIndexer::DeclarationListener::OBJECT_NESTING = T.let(T.unsafe(nil), Array)
+
+# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/enhancement.rb#5
+class RubyIndexer::Enhancement
+  abstract!
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/enhancement.rb#12
+  sig { params(index: ::RubyIndexer::Index).void }
+  def initialize(index); end
+
+  # The `on_extend` indexing enhancement is invoked whenever an extend is encountered in the code. It can be used to
+  # register for an included callback, similar to what `ActiveSupport::Concern` does in order to auto-extend the
+  # `ClassMethods` modules
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/enhancement.rb#30
+  sig do
+    overridable
+      .params(
+        owner: T.nilable(::RubyIndexer::Entry::Namespace),
+        node: ::Prism::CallNode,
+        file_path: ::String,
+        code_units_cache: T.any(::Prism::CodeUnitsCache, T.proc.params(arg0: ::Integer).returns(::Integer))
+      ).void
+  end
+  def on_call_node_enter(owner, node, file_path, code_units_cache); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/enhancement.rb#43
+  sig do
+    overridable
+      .params(
+        owner: T.nilable(::RubyIndexer::Entry::Namespace),
+        node: ::Prism::CallNode,
+        file_path: ::String,
+        code_units_cache: T.any(::Prism::CodeUnitsCache, T.proc.params(arg0: ::Integer).returns(::Integer))
+      ).void
+  end
+  def on_call_node_leave(owner, node, file_path, code_units_cache); end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#5
+class RubyIndexer::Entry
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#38
+  sig do
+    params(
+      name: ::String,
+      file_path: ::String,
+      location: ::RubyIndexer::Location,
+      comments: T.nilable(::String)
+    ).void
+  end
+  def initialize(name, file_path, location, comments); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#67
+  sig { returns(::String) }
+  def comments; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#62
+  sig { returns(::String) }
+  def file_name; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#20
+  sig { returns(::String) }
+  def file_path; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#23
+  sig { returns(::RubyIndexer::Location) }
+  def location; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#17
+  sig { returns(::String) }
+  def name; end
+
+  # @return [RubyIndexer::Location]
+  #
+  # source://sorbet-runtime/0.5.11609lib/types/private/methods/_methods.rb#257
+  def name_location(*args, **_arg1, &blk); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#57
+  sig { returns(T::Boolean) }
+  def private?; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#52
+  sig { returns(T::Boolean) }
+  def protected?; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#47
+  sig { returns(T::Boolean) }
+  def public?; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#28
+  sig { returns(::RubyIndexer::Entry::Visibility) }
+  def visibility; end
+
+  # @return [Visibility]
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#28
+  def visibility=(_arg0); end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#373
+class RubyIndexer::Entry::Accessor < ::RubyIndexer::Entry::Member
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#377
+  sig { override.returns(T::Array[::RubyIndexer::Entry::Signature]) }
+  def signatures; end
+end
+
+# A block method parameter, e.g. `def foo(&block)`
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#295
+class RubyIndexer::Entry::BlockParameter < ::RubyIndexer::Entry::Parameter
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#307
+  sig { override.returns(::Symbol) }
+  def decorated_name; end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#301
+    sig { returns(::RubyIndexer::Entry::BlockParameter) }
+    def anonymous; end
+  end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#296
+RubyIndexer::Entry::BlockParameter::DEFAULT_NAME = T.let(T.unsafe(nil), Symbol)
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#178
+class RubyIndexer::Entry::Class < ::RubyIndexer::Entry::Namespace
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#196
+  sig do
+    params(
+      nesting: T::Array[::String],
+      file_path: ::String,
+      location: ::RubyIndexer::Location,
+      name_location: ::RubyIndexer::Location,
+      comments: T.nilable(::String),
+      parent_class: T.nilable(::String)
+    ).void
+  end
+  def initialize(nesting, file_path, location, name_location, comments, parent_class); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#202
+  sig { override.returns(::Integer) }
+  def ancestor_hash; end
+
+  # The unresolved name of the parent class. This may return `nil`, which indicates the lack of an explicit parent
+  # and therefore ::Object is the correct parent class
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#184
+  sig { returns(T.nilable(::String)) }
+  def parent_class; end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#224
+class RubyIndexer::Entry::Constant < ::RubyIndexer::Entry; end
+
+# Alias represents a resolved alias, which points to an existing constant target
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#456
+class RubyIndexer::Entry::ConstantAlias < ::RubyIndexer::Entry
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#463
+  sig { params(target: ::String, unresolved_alias: ::RubyIndexer::Entry::UnresolvedConstantAlias).void }
+  def initialize(target, unresolved_alias); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#460
+  sig { returns(::String) }
+  def target; end
+end
+
+# A forwarding method parameter, e.g. `def foo(...)`
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#313
+class RubyIndexer::Entry::ForwardingParameter < ::RubyIndexer::Entry::Parameter
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#317
+  sig { void }
+  def initialize; end
+end
+
+# Represents a global variable e.g.: $DEBUG
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#477
+class RubyIndexer::Entry::GlobalVariable < ::RubyIndexer::Entry; end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#121
+class RubyIndexer::Entry::Include < ::RubyIndexer::Entry::ModuleOperation; end
+
+# Represents an instance variable e.g.: @a = 1
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#480
+class RubyIndexer::Entry::InstanceVariable < ::RubyIndexer::Entry
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#493
+  sig do
+    params(
+      name: ::String,
+      file_path: ::String,
+      location: ::RubyIndexer::Location,
+      comments: T.nilable(::String),
+      owner: T.nilable(::RubyIndexer::Entry::Namespace)
+    ).void
+  end
+  def initialize(name, file_path, location, comments, owner); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#482
+  sig { returns(T.nilable(::RubyIndexer::Entry::Namespace)) }
+  def owner; end
+end
+
+# An required keyword method parameter, e.g. `def foo(a:)`
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#259
+class RubyIndexer::Entry::KeywordParameter < ::RubyIndexer::Entry::Parameter
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#261
+  sig { override.returns(::Symbol) }
+  def decorated_name; end
+end
+
+# A keyword rest method parameter, e.g. `def foo(**a)`
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#285
+class RubyIndexer::Entry::KeywordRestParameter < ::RubyIndexer::Entry::Parameter
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#289
+  sig { override.returns(::Symbol) }
+  def decorated_name; end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#286
+RubyIndexer::Entry::KeywordRestParameter::DEFAULT_NAME = T.let(T.unsafe(nil), Symbol)
+
+# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#323
+class RubyIndexer::Entry::Member < ::RubyIndexer::Entry
+  abstract!
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#342
+  sig do
+    params(
+      name: ::String,
+      file_path: ::String,
+      location: ::RubyIndexer::Location,
+      comments: T.nilable(::String),
+      visibility: ::RubyIndexer::Entry::Visibility,
+      owner: T.nilable(::RubyIndexer::Entry::Namespace)
+    ).void
+  end
+  def initialize(name, file_path, location, comments, visibility, owner); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#352
+  sig { returns(::String) }
+  def decorated_parameters; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#360
+  sig { returns(::String) }
+  def formatted_signatures; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#330
+  sig { returns(T.nilable(::RubyIndexer::Entry::Namespace)) }
+  def owner; end
+
+  # @abstract
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#349
+  sig { abstract.returns(T::Array[::RubyIndexer::Entry::Signature]) }
+  def signatures; end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#389
+class RubyIndexer::Entry::Method < ::RubyIndexer::Entry::Member
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#411
+  sig do
+    params(
+      name: ::String,
+      file_path: ::String,
+      location: ::RubyIndexer::Location,
+      name_location: ::RubyIndexer::Location,
+      comments: T.nilable(::String),
+      signatures: T::Array[::RubyIndexer::Entry::Signature],
+      visibility: ::RubyIndexer::Entry::Visibility,
+      owner: T.nilable(::RubyIndexer::Entry::Namespace)
+    ).void
+  end
+  def initialize(name, file_path, location, name_location, comments, signatures, visibility, owner); end
+
+  # Returns the location of the method name, excluding parameters or the body
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#397
+  sig { returns(::RubyIndexer::Location) }
+  def name_location; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#393
+  sig { override.returns(T::Array[::RubyIndexer::Entry::Signature]) }
+  def signatures; end
+end
+
+# A method alias is a resolved alias entry that points to the exact method target it refers to
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#531
+class RubyIndexer::Entry::MethodAlias < ::RubyIndexer::Entry
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#543
+  sig do
+    params(
+      target: T.any(::RubyIndexer::Entry::Member, ::RubyIndexer::Entry::MethodAlias),
+      unresolved_alias: ::RubyIndexer::Entry::UnresolvedMethodAlias
+    ).void
+  end
+  def initialize(target, unresolved_alias); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#560
+  sig { returns(::String) }
+  def decorated_parameters; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#565
+  sig { returns(::String) }
+  def formatted_signatures; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#538
+  sig { returns(T.nilable(::RubyIndexer::Entry::Namespace)) }
+  def owner; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#570
+  sig { returns(T::Array[::RubyIndexer::Entry::Signature]) }
+  def signatures; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#535
+  sig { returns(T.any(::RubyIndexer::Entry::Member, ::RubyIndexer::Entry::MethodAlias)) }
+  def target; end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#175
+class RubyIndexer::Entry::Module < ::RubyIndexer::Entry::Namespace; end
+
+# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#106
+class RubyIndexer::Entry::ModuleOperation
+  abstract!
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#116
+  sig { params(module_name: ::String).void }
+  def initialize(module_name); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#113
+  sig { returns(::String) }
+  def module_name; end
+end
+
+# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#124
+class RubyIndexer::Entry::Namespace < ::RubyIndexer::Entry
+  abstract!
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#146
+  sig do
+    params(
+      nesting: T::Array[::String],
+      file_path: ::String,
+      location: ::RubyIndexer::Location,
+      name_location: ::RubyIndexer::Location,
+      comments: T.nilable(::String)
+    ).void
+  end
+  def initialize(nesting, file_path, location, name_location, comments); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#170
+  sig { returns(::Integer) }
+  def ancestor_hash; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#157
+  sig { returns(T::Array[::String]) }
+  def mixin_operation_module_names; end
+
+  # Stores all explicit prepend, include and extend operations in the exact order they were discovered in the source
+  # code. Maintaining the order is essential to linearize ancestors the right way when a module is both included
+  # and prepended
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#165
+  sig { returns(T::Array[::RubyIndexer::Entry::ModuleOperation]) }
+  def mixin_operations; end
+
+  # Returns the location of the constant name, excluding the parent class or the body
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#135
+  sig { returns(::RubyIndexer::Location) }
+  def name_location; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#131
+  sig { returns(T::Array[::String]) }
+  def nesting; end
+end
+
+# An optional keyword method parameter, e.g. `def foo(a: 123)`
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#267
+class RubyIndexer::Entry::OptionalKeywordParameter < ::RubyIndexer::Entry::Parameter
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#269
+  sig { override.returns(::Symbol) }
+  def decorated_name; end
+end
+
+# An optional method parameter, e.g. `def foo(a = 123)`
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#251
+class RubyIndexer::Entry::OptionalParameter < ::RubyIndexer::Entry::Parameter
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#253
+  sig { override.returns(::Symbol) }
+  def decorated_name; end
+end
+
+# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#227
+class RubyIndexer::Entry::Parameter
+  abstract!
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#241
+  sig { params(name: ::Symbol).void }
+  def initialize(name:); end
+
+  # Name includes just the name of the parameter, excluding symbols like splats
+  # Decorated name is the parameter name including the splat or block prefix, e.g.: `*foo`, `**foo` or `&block`
+  #
+  # @return [Symbol]
+  #
+  # source://sorbet-runtime/0.5.11609lib/types/private/methods/_methods.rb#257
+  def decorated_name(*args, **_arg1, &blk); end
+
+  # Name includes just the name of the parameter, excluding symbols like splats
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#235
+  sig { returns(::Symbol) }
+  def name; end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#122
+class RubyIndexer::Entry::Prepend < ::RubyIndexer::Entry::ModuleOperation; end
+
+# A required method parameter, e.g. `def foo(a)`
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#247
+class RubyIndexer::Entry::RequiredParameter < ::RubyIndexer::Entry::Parameter; end
+
+# A rest method parameter, e.g. `def foo(*a)`
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#275
+class RubyIndexer::Entry::RestParameter < ::RubyIndexer::Entry::Parameter
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#279
+  sig { override.returns(::Symbol) }
+  def decorated_name; end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#276
+RubyIndexer::Entry::RestParameter::DEFAULT_NAME = T.let(T.unsafe(nil), Symbol)
+
+# Ruby doesn't support method overloading, so a method will have only one signature.
+# However RBS can represent the concept of method overloading, with different return types based on the arguments
+# passed, so we need to store all the signatures.
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#578
+class RubyIndexer::Entry::Signature
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#585
+  sig { params(parameters: T::Array[::RubyIndexer::Entry::Parameter]).void }
+  def initialize(parameters); end
+
+  # Returns a string with the decorated names of the parameters of this member. E.g.: `(a, b = 1, c: 2)`
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#591
+  sig { returns(::String) }
+  def format; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#683
+  sig { params(args: T.nilable(T::Array[::Prism::Node]), names: T::Array[::Symbol]).returns(T::Boolean) }
+  def keyword_arguments_match?(args, names); end
+
+  # Returns `true` if the given call node arguments array matches this method signature. This method will prefer
+  # returning `true` for situations that cannot be analyzed statically, like the presence of splats, keyword splats
+  # or forwarding arguments.
+  #
+  # Since this method is used to detect which overload should be displayed in signature help, it will also return
+  # `true` if there are missing arguments since the user may not be done typing yet. For example:
+  #
+  # ```ruby
+  # def foo(a, b); end
+  # # All of the following are considered matches because the user might be in the middle of typing and we have to
+  # # show them the signature
+  # foo
+  # foo(1)
+  # foo(1, 2)
+  # ```
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#611
+  sig { params(arguments: T::Array[::Prism::Node]).returns(T::Boolean) }
+  def matches?(arguments); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#582
+  sig { returns(T::Array[::RubyIndexer::Entry::Parameter]) }
+  def parameters; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#670
+  sig do
+    params(
+      positional_args: T::Array[::Prism::Node],
+      forwarding_arguments: T::Array[::Prism::Node],
+      keyword_args: T.nilable(T::Array[::Prism::Node]),
+      min_pos: ::Integer,
+      max_pos: T.any(::Float, ::Integer)
+    ).returns(T::Boolean)
+  end
+  def positional_arguments_match?(positional_args, forwarding_arguments, keyword_args, min_pos, max_pos); end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#207
+class RubyIndexer::Entry::SingletonClass < ::RubyIndexer::Entry::Class
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#217
+  sig do
+    params(
+      location: ::RubyIndexer::Location,
+      name_location: ::RubyIndexer::Location,
+      comments: T.nilable(::String)
+    ).void
+  end
+  def update_singleton_information(location, name_location, comments); end
+end
+
+# An UnresolvedAlias points to a constant alias with a right hand side that has not yet been resolved. For
+# example, if we find
+#
+# ```ruby
+#   CONST = Foo
+# ```
+# Before we have discovered `Foo`, there's no way to eagerly resolve this alias to the correct target constant.
+# All aliases are inserted as UnresolvedAlias in the index first and then we lazily resolve them to the correct
+# target in [rdoc-ref:Index#resolve]. If the right hand side contains a constant that doesn't exist, then it's not
+# possible to resolve the alias and it will remain an UnresolvedAlias until the right hand side constant exists
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#428
+class RubyIndexer::Entry::UnresolvedConstantAlias < ::RubyIndexer::Entry
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#447
+  sig do
+    params(
+      target: ::String,
+      nesting: T::Array[::String],
+      name: ::String,
+      file_path: ::String,
+      location: ::RubyIndexer::Location,
+      comments: T.nilable(::String)
+    ).void
+  end
+  def initialize(target, nesting, name, file_path, location, comments); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#435
+  sig { returns(T::Array[::String]) }
+  def nesting; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#432
+  sig { returns(::String) }
+  def target; end
+end
+
+# An unresolved method alias is an alias entry for which we aren't sure what the right hand side points to yet. For
+# example, if we have `alias a b`, we create an unresolved alias for `a` because we aren't sure immediate what `b`
+# is referring to
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#502
+class RubyIndexer::Entry::UnresolvedMethodAlias < ::RubyIndexer::Entry
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#521
+  sig do
+    params(
+      new_name: ::String,
+      old_name: ::String,
+      owner: T.nilable(::RubyIndexer::Entry::Namespace),
+      file_path: ::String,
+      location: ::RubyIndexer::Location,
+      comments: T.nilable(::String)
+    ).void
+  end
+  def initialize(new_name, old_name, owner, file_path, location, comments); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#506
+  sig { returns(::String) }
+  def new_name; end
+
+  # @return [String]
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#506
+  def old_name; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#509
+  sig { returns(T.nilable(::RubyIndexer::Entry::Namespace)) }
+  def owner; end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/entry.rb#6
+class RubyIndexer::Entry::Visibility < ::T::Enum
+  enums do
+    PRIVATE = new
+    PROTECTED = new
+    PUBLIC = new
+  end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#5
+class RubyIndexer::Index
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#18
+  sig { void }
+  def initialize; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#104
+  sig { params(fully_qualified_name: ::String).returns(T.nilable(T::Array[::RubyIndexer::Entry])) }
+  def [](fully_qualified_name); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#95
+  sig { params(entry: ::RubyIndexer::Entry, skip_prefix_tree: T::Boolean).void }
+  def add(entry, skip_prefix_tree: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#15
+  sig { returns(::RubyIndexer::Configuration) }
+  def configuration; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#256
+  sig do
+    params(
+      name: ::String,
+      nesting: T::Array[::String]
+    ).returns(T::Array[T::Array[T.any(::RubyIndexer::Entry::Constant, ::RubyIndexer::Entry::ConstantAlias, ::RubyIndexer::Entry::Namespace, ::RubyIndexer::Entry::UnresolvedConstantAlias)]])
+  end
+  def constant_completion_candidates(name, nesting); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#67
+  sig { params(indexable: ::RubyIndexer::IndexablePath).void }
+  def delete(indexable); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#634
+  sig { returns(T::Boolean) }
+  def empty?; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#682
+  sig do
+    type_parameters(:T)
+      .params(
+        path: ::String,
+        type: T.nilable(T::Class[T.all(::RubyIndexer::Entry, T.type_parameter(:T))])
+      ).returns(T.nilable(T.any(T::Array[::RubyIndexer::Entry], T::Array[T.type_parameter(:T)])))
+  end
+  def entries_for(path, type = T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#654
+  sig { params(name: ::String).returns(::RubyIndexer::Entry::SingletonClass) }
+  def existing_or_new_singleton_class(name); end
+
+  # Searches for a constant based on an unqualified name and returns the first possible match regardless of whether
+  # there are more possible matching entries
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#125
+  sig do
+    params(
+      name: ::String
+    ).returns(T.nilable(T::Array[T.any(::RubyIndexer::Entry::Constant, ::RubyIndexer::Entry::ConstantAlias, ::RubyIndexer::Entry::Namespace, ::RubyIndexer::Entry::UnresolvedConstantAlias)]))
+  end
+  def first_unqualified_const(name); end
+
+  # Follows aliases in a namespace. The algorithm keeps checking if the name is an alias and then recursively follows
+  # it. The idea is that we test the name in parts starting from the complete name to the first namespace. For
+  # `Foo::Bar::Baz`, we would test:
+  # 1. Is `Foo::Bar::Baz` an alias? Get the target and recursively follow its target
+  # 2. Is `Foo::Bar` an alias? Get the target and recursively follow its target
+  # 3. Is `Foo` an alias? Get the target and recursively follow its target
+  #
+  # If we find an alias, then we want to follow its target. In the same example, if `Foo::Bar` is an alias to
+  # `Something::Else`, then we first discover `Something::Else::Baz`. But `Something::Else::Baz` might contain other
+  # aliases, so we have to invoke `follow_aliased_namespace` again to check until we only return a real name
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#425
+  sig { params(name: ::String, seen_names: T::Array[::String]).returns(::String) }
+  def follow_aliased_namespace(name, seen_names = T.unsafe(nil)); end
+
+  # Fuzzy searches index entries based on Jaro-Winkler similarity. If no query is provided, all entries are returned
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#174
+  sig { params(query: T.nilable(::String)).returns(T::Array[::RubyIndexer::Entry]) }
+  def fuzzy_search(query); end
+
+  # Synchronizes a change made to the given indexable path. This method will ensure that new declarations are indexed,
+  # removed declarations removed and that the ancestor linearization cache is cleared if necessary
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#606
+  sig { params(indexable: ::RubyIndexer::IndexablePath).void }
+  def handle_change(indexable); end
+
+  # Index all files for the given indexable paths, which defaults to what is configured. A block can be used to track
+  # and control indexing progress. That block is invoked with the current progress percentage and should return `true`
+  # to continue indexing or `false` to stop indexing.
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#362
+  sig do
+    params(
+      indexable_paths: T::Array[::RubyIndexer::IndexablePath],
+      block: T.nilable(T.proc.params(progress: ::Integer).returns(T::Boolean))
+    ).void
+  end
+  def index_all(indexable_paths: T.unsafe(nil), &block); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#378
+  sig do
+    params(
+      indexable_path: ::RubyIndexer::IndexablePath,
+      source: T.nilable(::String),
+      collect_comments: T::Boolean
+    ).void
+  end
+  def index_single(indexable_path, source = T.unsafe(nil), collect_comments: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#644
+  sig { params(name: ::String).returns(T::Boolean) }
+  def indexed?(name); end
+
+  # Returns a list of possible candidates for completion of instance variables for a given owner name. The name must
+  # include the `@` prefix
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#594
+  sig { params(name: ::String, owner_name: ::String).returns(T::Array[::RubyIndexer::Entry::InstanceVariable]) }
+  def instance_variable_completion_candidates(name, owner_name); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#649
+  sig { returns(::Integer) }
+  def length; end
+
+  # Linearizes the ancestors for a given name, returning the order of namespaces in which Ruby will search for method
+  # or constant declarations.
+  #
+  # When we add an ancestor in Ruby, that namespace might have ancestors of its own. Therefore, we need to linearize
+  # everything recursively to ensure that we are placing ancestors in the right order. For example, if you include a
+  # module that prepends another module, then the prepend module appears before the included module.
+  #
+  # The order of ancestors is [linearized_prepends, self, linearized_includes, linearized_superclass]
+  #
+  # @raise [NonExistingNamespaceError]
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#503
+  sig { params(fully_qualified_name: ::String).returns(T::Array[::String]) }
+  def linearized_ancestors_of(fully_qualified_name); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#203
+  sig do
+    params(
+      name: T.nilable(::String),
+      receiver_name: ::String
+    ).returns(T::Array[T.any(::RubyIndexer::Entry::Member, ::RubyIndexer::Entry::MethodAlias)])
+  end
+  def method_completion_candidates(name, receiver_name); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#639
+  sig { returns(T::Array[::String]) }
+  def names; end
+
+  # Searches entries in the index based on an exact prefix, intended for providing autocomplete. All possible matches
+  # to the prefix are returned. The return is an array of arrays, where each entry is the array of entries for a given
+  # name match. For example:
+  # ## Example
+  # ```ruby
+  # # If the index has two entries for `Foo::Bar` and one for `Foo::Baz`, then:
+  # index.prefix_search("Foo::B")
+  # # Will return:
+  # [
+  #   [#<Entry::Class name="Foo::Bar">, #<Entry::Class name="Foo::Bar">],
+  #   [#<Entry::Class name="Foo::Baz">],
+  # ]
+  # ```
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#155
+  sig do
+    params(
+      query: ::String,
+      nesting: T.nilable(T::Array[::String])
+    ).returns(T::Array[T::Array[::RubyIndexer::Entry]])
+  end
+  def prefix_search(query, nesting = T.unsafe(nil)); end
+
+  # Register an enhancement to the index. Enhancements must conform to the `Enhancement` interface
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#56
+  sig { params(enhancement: ::RubyIndexer::Enhancement).void }
+  def register_enhancement(enhancement); end
+
+  # Register an included `hook` that will be executed when `module_name` is included into any namespace
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#62
+  sig do
+    params(
+      module_name: ::String,
+      hook: T.proc.params(index: ::RubyIndexer::Index, base: ::RubyIndexer::Entry::Namespace).void
+    ).void
+  end
+  def register_included_hook(module_name, &hook); end
+
+  # Resolve a constant to its declaration based on its name and the nesting where the reference was found. Parameter
+  # documentation:
+  #
+  # name: the name of the reference how it was found in the source code (qualified or not)
+  # nesting: the nesting structure where the reference was found (e.g.: ["Foo", "Bar"])
+  # seen_names: this parameter should not be used by consumers of the api. It is used to avoid infinite recursion when
+  # resolving circular references
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#321
+  sig do
+    params(
+      name: ::String,
+      nesting: T::Array[::String],
+      seen_names: T::Array[::String]
+    ).returns(T.nilable(T::Array[T.any(::RubyIndexer::Entry::ConstantAlias, ::RubyIndexer::Entry::Namespace, ::RubyIndexer::Entry::UnresolvedConstantAlias)]))
+  end
+  def resolve(name, nesting, seen_names = T.unsafe(nil)); end
+
+  # Resolves an instance variable name for a given owner name. This method will linearize the ancestors of the owner
+  # and find inherited instance variables as well
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#581
+  sig do
+    params(
+      variable_name: ::String,
+      owner_name: ::String
+    ).returns(T.nilable(T::Array[::RubyIndexer::Entry::InstanceVariable]))
+  end
+  def resolve_instance_variable(variable_name, owner_name); end
+
+  # Attempts to find methods for a resolved fully qualified receiver name. Do not provide the `seen_names` parameter
+  # as it is used only internally to prevent infinite loops when resolving circular aliases
+  # Returns `nil` if the method does not exist on that receiver
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#465
+  sig do
+    params(
+      method_name: ::String,
+      receiver_name: ::String,
+      seen_names: T::Array[::String],
+      inherited_only: T::Boolean
+    ).returns(T.nilable(T::Array[T.any(::RubyIndexer::Entry::Member, ::RubyIndexer::Entry::MethodAlias)]))
+  end
+  def resolve_method(method_name, receiver_name, seen_names = T.unsafe(nil), inherited_only: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#109
+  sig { params(query: ::String).returns(T::Array[::RubyIndexer::IndexablePath]) }
+  def search_require_paths(query); end
+
+  private
+
+  # Removes redundancy from a constant reference's full name. For example, if we find a reference to `A::B::Foo`
+  # inside of the ["A", "B"] nesting, then we should not concatenate the nesting with the name or else we'll end up
+  # with `A::B::A::B::Foo`. This method will remove any redundant parts from the final name based on the reference and
+  # the nesting
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#982
+  sig { params(name: ::String, nesting: T::Array[::String]).returns(::String) }
+  def build_non_redundant_full_name(name, nesting); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#1014
+  sig do
+    params(
+      full_name: ::String,
+      seen_names: T::Array[::String]
+    ).returns(T.nilable(T::Array[T.any(::RubyIndexer::Entry::ConstantAlias, ::RubyIndexer::Entry::Namespace, ::RubyIndexer::Entry::UnresolvedConstantAlias)]))
+  end
+  def direct_or_aliased_constant(full_name, seen_names); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#943
+  sig do
+    params(
+      name: T.nilable(::String),
+      nesting: T::Array[::String]
+    ).returns(T::Array[T::Array[T.any(::RubyIndexer::Entry::Constant, ::RubyIndexer::Entry::ConstantAlias, ::RubyIndexer::Entry::Namespace, ::RubyIndexer::Entry::UnresolvedConstantAlias)]])
+  end
+  def inherited_constant_completion_candidates(name, nesting); end
+
+  # Linearize mixins for an array of namespace entries. This method will mutate the `ancestors` array with the
+  # linearized ancestors of the mixins
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#728
+  sig do
+    params(
+      ancestors: T::Array[::String],
+      namespace_entries: T::Array[::RubyIndexer::Entry::Namespace],
+      nesting: T::Array[::String]
+    ).void
+  end
+  def linearize_mixins(ancestors, namespace_entries, nesting); end
+
+  # Linearize the superclass of a given namespace (including modules with the implicit `Module` superclass). This
+  # method will mutate the `ancestors` array with the linearized ancestors of the superclass
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#778
+  sig do
+    params(
+      ancestors: T::Array[::String],
+      attached_class_name: ::String,
+      fully_qualified_name: ::String,
+      namespace_entries: T::Array[::RubyIndexer::Entry::Namespace],
+      nesting: T::Array[::String],
+      singleton_levels: ::Integer
+    ).void
+  end
+  def linearize_superclass(ancestors, attached_class_name, fully_qualified_name, namespace_entries, nesting, singleton_levels); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#913
+  sig do
+    params(
+      name: ::String,
+      nesting: T::Array[::String],
+      seen_names: T::Array[::String]
+    ).returns(T.nilable(T::Array[T.any(::RubyIndexer::Entry::ConstantAlias, ::RubyIndexer::Entry::Namespace, ::RubyIndexer::Entry::UnresolvedConstantAlias)]))
+  end
+  def lookup_ancestor_chain(name, nesting, seen_names); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#884
+  sig do
+    params(
+      name: ::String,
+      nesting: T::Array[::String],
+      seen_names: T::Array[::String]
+    ).returns(T.nilable(T::Array[T.any(::RubyIndexer::Entry::ConstantAlias, ::RubyIndexer::Entry::Namespace, ::RubyIndexer::Entry::UnresolvedConstantAlias)]))
+  end
+  def lookup_enclosing_scopes(name, nesting, seen_names); end
+
+  # Attempts to resolve an UnresolvedAlias into a resolved Alias. If the unresolved alias is pointing to a constant
+  # that doesn't exist, then we return the same UnresolvedAlias
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#851
+  sig do
+    params(
+      entry: ::RubyIndexer::Entry::UnresolvedConstantAlias,
+      seen_names: T::Array[::String]
+    ).returns(T.any(::RubyIndexer::Entry::ConstantAlias, ::RubyIndexer::Entry::UnresolvedConstantAlias))
+  end
+  def resolve_alias(entry, seen_names); end
+
+  # Attempt to resolve a given unresolved method alias. This method returns the resolved alias if we managed to
+  # identify the target or the same unresolved alias entry if we couldn't
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#1036
+  sig do
+    params(
+      entry: ::RubyIndexer::Entry::UnresolvedMethodAlias,
+      receiver_name: ::String,
+      seen_names: T::Array[::String]
+    ).returns(T.any(::RubyIndexer::Entry::MethodAlias, ::RubyIndexer::Entry::UnresolvedMethodAlias))
+  end
+  def resolve_method_alias(entry, receiver_name, seen_names); end
+
+  # Runs the registered included hooks
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#693
+  sig { params(fully_qualified_name: ::String, nesting: T::Array[::String]).void }
+  def run_included_hooks(fully_qualified_name, nesting); end
+end
+
+# The minimum Jaro-Winkler similarity score for an entry to be considered a match for a given fuzzy search query
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#12
+RubyIndexer::Index::ENTRY_SIMILARITY_THRESHOLD = T.let(T.unsafe(nil), Float)
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#9
+class RubyIndexer::Index::NonExistingNamespaceError < ::StandardError; end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/index.rb#8
+class RubyIndexer::Index::UnresolvableAliasError < ::StandardError; end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/indexable_path.rb#5
+class RubyIndexer::IndexablePath
+  # An IndexablePath is instantiated with a load_path_entry and a full_path. The load_path_entry is where the file can
+  # be found in the $LOAD_PATH, which we use to determine the require_path. The load_path_entry may be `nil` if the
+  # indexer is configured to go through files that do not belong in the $LOAD_PATH. For example,
+  # `sorbet/tapioca/require.rb` ends up being a part of the paths to be indexed because it's a Ruby file inside the
+  # project, but the `sorbet` folder is not a part of the $LOAD_PATH. That means that both its load_path_entry and
+  # require_path will be `nil`, since it cannot be required by the project
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/indexable_path.rb#21
+  sig { params(load_path_entry: T.nilable(::String), full_path: ::String).void }
+  def initialize(load_path_entry, full_path); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/indexable_path.rb#12
+  sig { returns(::String) }
+  def full_path; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/indexable_path.rb#9
+  sig { returns(T.nilable(::String)) }
+  def require_path; end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/location.rb#5
+class RubyIndexer::Location
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/location.rb#41
+  sig { params(start_line: ::Integer, end_line: ::Integer, start_column: ::Integer, end_column: ::Integer).void }
+  def initialize(start_line, end_line, start_column, end_column); end
+
+  # @return [Integer]
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/location.rb#31
+  def end_column; end
+
+  # @return [Integer]
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/location.rb#31
+  def end_line; end
+
+  # @return [Integer]
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/location.rb#31
+  def start_column; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/location.rb#31
+  sig { returns(::Integer) }
+  def start_line; end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/location.rb#20
+    sig do
+      params(
+        prism_location: ::Prism::Location,
+        code_units_cache: T.any(::Prism::CodeUnitsCache, T.proc.params(arg0: ::Integer).returns(::Integer))
+      ).returns(T.attached_class)
+    end
+    def from_prism_location(prism_location, code_units_cache); end
+  end
+end
+
+# A PrefixTree is a data structure that allows searching for partial strings fast. The tree is similar to a nested
+# hash structure, where the keys are the characters of the inserted strings.
+#
+# ## Example
+# ```ruby
+# tree = PrefixTree[String].new
+# # Insert entries using the same key and value
+# tree.insert("bar", "bar")
+# tree.insert("baz", "baz")
+# # Internally, the structure is analogous to this, but using nodes:
+# # {
+# #   "b" => {
+# #     "a" => {
+# #       "r" => "bar",
+# #       "z" => "baz"
+# #     }
+# #   }
+# # }
+# # When we search it, it finds all possible values based on partial (or complete matches):
+# tree.search("") # => ["bar", "baz"]
+# tree.search("b") # => ["bar", "baz"]
+# tree.search("ba") # => ["bar", "baz"]
+# tree.search("bar") # => ["bar"]
+# ```
+#
+# A PrefixTree is useful for autocomplete, since we always want to find all alternatives while the developer hasn't
+# finished typing yet. This PrefixTree implementation allows for string keys and any arbitrary value using the generic
+# `Value` type.
+#
+# See https://en.wikipedia.org/wiki/Trie for more information
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/prefix_tree.rb#35
+class RubyIndexer::PrefixTree
+  extend T::Generic
+
+  Value = type_member
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/prefix_tree.rb#42
+  sig { void }
+  def initialize; end
+
+  # Deletes the entry identified by `key` from the tree. Notice that a partial match will still delete all entries
+  # that match it. For example, if the tree contains `foo` and we ask to delete `fo`, then `foo` will be deleted
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/prefix_tree.rb#77
+  sig { params(key: ::String).void }
+  def delete(key); end
+
+  # Inserts a `value` using the given `key`
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/prefix_tree.rb#60
+  sig { params(key: ::String, value: Value).void }
+  def insert(key, value); end
+
+  # Search the PrefixTree based on a given `prefix`. If `foo` is an entry in the tree, then searching for `fo` will
+  # return it as a result. The result is always an array of the type of value attribute to the generic `Value` type.
+  # Notice that if the `Value` is an array, this method will return an array of arrays, where each entry is the array
+  # of values for a given match
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/prefix_tree.rb#51
+  sig { params(prefix: ::String).returns(T::Array[Value]) }
+  def search(prefix); end
+
+  private
+
+  # Find a node that matches the given `key`
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/prefix_tree.rb#97
+  sig { params(key: ::String).returns(T.nilable(RubyIndexer::PrefixTree::Node[Value])) }
+  def find_node(key); end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/prefix_tree.rb#110
+class RubyIndexer::PrefixTree::Node
+  extend T::Generic
+
+  Value = type_member
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/prefix_tree.rb#132
+  sig { params(key: ::String, value: Value, parent: T.nilable(RubyIndexer::PrefixTree::Node[Value])).void }
+  def initialize(key, value, parent = T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/prefix_tree.rb#117
+  sig { returns(T::Hash[::String, RubyIndexer::PrefixTree::Node[Value]]) }
+  def children; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/prefix_tree.rb#141
+  sig { returns(T::Array[Value]) }
+  def collect; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/prefix_tree.rb#120
+  sig { returns(::String) }
+  def key; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/prefix_tree.rb#126
+  sig { returns(T::Boolean) }
+  def leaf; end
+
+  # @return [Boolean]
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/prefix_tree.rb#126
+  def leaf=(_arg0); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/prefix_tree.rb#129
+  sig { returns(T.nilable(RubyIndexer::PrefixTree::Node[Value])) }
+  def parent; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/prefix_tree.rb#123
+  sig { returns(Value) }
+  def value; end
+
+  # @return [Value]
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/prefix_tree.rb#123
+  def value=(_arg0); end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#5
+class RubyIndexer::RBSIndexer
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#11
+  sig { params(index: ::RubyIndexer::Index).void }
+  def initialize(index); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#16
+  sig { void }
+  def index_ruby_core; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#31
+  sig { params(pathname: ::Pathname, declarations: T::Array[::RBS::AST::Declarations::Base]).void }
+  def process_signature(pathname, declarations); end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#100
+  sig do
+    params(
+      declaration: T.any(::RBS::AST::Declarations::Class, ::RBS::AST::Declarations::Module),
+      entry: ::RubyIndexer::Entry::Namespace
+    ).void
+  end
+  def add_declaration_mixins_to_entry(declaration, entry); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#316
+  sig do
+    params(
+      declaration: T.any(::RBS::AST::Declarations::Class, ::RBS::AST::Declarations::Constant, ::RBS::AST::Declarations::Global, ::RBS::AST::Declarations::Module, ::RBS::AST::Members::Alias, ::RBS::AST::Members::MethodDefinition)
+    ).returns(T.nilable(::String))
+  end
+  def comments_to_string(declaration); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#57
+  sig do
+    params(
+      declaration: T.any(::RBS::AST::Declarations::Class, ::RBS::AST::Declarations::Module),
+      pathname: ::Pathname
+    ).void
+  end
+  def handle_class_or_module_declaration(declaration, pathname); end
+
+  # RBS treats constant definitions differently depend on where they are defined.
+  # When constants' rbs are defined inside a class/module block, they are treated as
+  # members of the class/module.
+  #
+  # module Encoding
+  #   US_ASCII = ... # US_ASCII is a member of Encoding
+  # end
+  #
+  # When constants' rbs are defined outside a class/module block, they are treated as
+  # top-level constants.
+  #
+  # Complex::I = ... # Complex::I is a top-level constant
+  #
+  # And we need to handle their nesting differently.
+  #
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#264
+  sig do
+    params(
+      declaration: ::RBS::AST::Declarations::Constant,
+      nesting: T::Array[::String],
+      file_path: ::String
+    ).void
+  end
+  def handle_constant(declaration, nesting, file_path); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#275
+  sig { params(declaration: ::RBS::AST::Declarations::Global, pathname: ::Pathname).void }
+  def handle_global_variable(declaration, pathname); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#116
+  sig { params(member: ::RBS::AST::Members::MethodDefinition, owner: ::RubyIndexer::Entry::Namespace).void }
+  def handle_method(member, owner); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#290
+  sig { params(member: ::RBS::AST::Members::Alias, owner_entry: ::RubyIndexer::Entry::Namespace).void }
+  def handle_signature_alias(member, owner_entry); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#175
+  sig { params(function: ::RBS::Types::Function).returns(T::Array[::RubyIndexer::Entry::Parameter]) }
+  def parse_arguments(function); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#40
+  sig { params(declaration: ::RBS::AST::Declarations::Base, pathname: ::Pathname).void }
+  def process_declaration(declaration, pathname); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#234
+  sig { params(function: ::RBS::Types::Function).returns(T::Array[::RubyIndexer::Entry::OptionalKeywordParameter]) }
+  def process_optional_keywords(function); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#154
+  sig do
+    params(
+      overload: ::RBS::AST::Members::MethodDefinition::Overload
+    ).returns(T::Array[::RubyIndexer::Entry::Parameter])
+  end
+  def process_overload(overload); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#187
+  sig { params(function: ::RBS::Types::Function).returns(T::Array[::RubyIndexer::Entry::RequiredParameter]) }
+  def process_required_and_optional_positionals(function); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#227
+  sig { params(function: ::RBS::Types::Function).returns(T::Array[::RubyIndexer::Entry::KeywordParameter]) }
+  def process_required_keywords(function); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#241
+  sig { params(function: ::RBS::Types::Function).returns(::RubyIndexer::Entry::KeywordRestParameter) }
+  def process_rest_keywords(function); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#218
+  sig { params(function: ::RBS::Types::Function).returns(::RubyIndexer::Entry::RestParameter) }
+  def process_rest_positionals(function); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#211
+  sig { params(function: ::RBS::Types::Function).returns(T::Array[::RubyIndexer::Entry::OptionalParameter]) }
+  def process_trailing_positionals(function); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#146
+  sig { params(member: ::RBS::AST::Members::MethodDefinition).returns(T::Array[::RubyIndexer::Entry::Signature]) }
+  def signatures(member); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#85
+  sig { params(rbs_location: ::RBS::Location).returns(::RubyIndexer::Location) }
+  def to_ruby_indexer_location(rbs_location); end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/rbs_indexer.rb#8
+RubyIndexer::RBSIndexer::HAS_UNTYPED_FUNCTION = T.let(T.unsafe(nil), TrueClass)
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#5
+class RubyIndexer::ReferenceFinder
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#68
+  sig do
+    params(
+      target: ::RubyIndexer::ReferenceFinder::Target,
+      index: ::RubyIndexer::Index,
+      dispatcher: ::Prism::Dispatcher,
+      include_declarations: T::Boolean
+    ).void
+  end
+  def initialize(target, index, dispatcher, include_declarations: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#266
+  sig { params(node: ::Prism::CallNode).void }
+  def on_call_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#109
+  sig { params(node: ::Prism::ClassNode).void }
+  def on_class_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#122
+  sig { params(node: ::Prism::ClassNode).void }
+  def on_class_node_leave(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#238
+  sig { params(node: ::Prism::ConstantAndWriteNode).void }
+  def on_constant_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#243
+  sig { params(node: ::Prism::ConstantOperatorWriteNode).void }
+  def on_constant_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#233
+  sig { params(node: ::Prism::ConstantOrWriteNode).void }
+  def on_constant_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#217
+  sig { params(node: ::Prism::ConstantPathAndWriteNode).void }
+  def on_constant_path_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#158
+  sig { params(node: ::Prism::ConstantPathNode).void }
+  def on_constant_path_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#206
+  sig { params(node: ::Prism::ConstantPathOperatorWriteNode).void }
+  def on_constant_path_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#195
+  sig { params(node: ::Prism::ConstantPathOrWriteNode).void }
+  def on_constant_path_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#184
+  sig { params(node: ::Prism::ConstantPathWriteNode).void }
+  def on_constant_path_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#166
+  sig { params(node: ::Prism::ConstantReadNode).void }
+  def on_constant_read_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#228
+  sig { params(node: ::Prism::ConstantWriteNode).void }
+  def on_constant_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#248
+  sig { params(node: ::Prism::DefNode).void }
+  def on_def_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#259
+  sig { params(node: ::Prism::DefNode).void }
+  def on_def_node_leave(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#127
+  sig { params(node: ::Prism::ModuleNode).void }
+  def on_module_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#140
+  sig { params(node: ::Prism::ModuleNode).void }
+  def on_module_node_leave(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#174
+  sig { params(node: ::Prism::MultiWriteNode).void }
+  def on_multi_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#145
+  sig { params(node: ::Prism::SingletonClassNode).void }
+  def on_singleton_class_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#153
+  sig { params(node: ::Prism::SingletonClassNode).void }
+  def on_singleton_class_node_leave(node); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#102
+  sig { returns(T::Array[::RubyIndexer::ReferenceFinder::Reference]) }
+  def references; end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#275
+  sig { params(name: ::String).returns(T::Array[::String]) }
+  def actual_nesting(name); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#289
+  sig { params(name: ::String, location: ::Prism::Location).void }
+  def collect_constant_references(name, location); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#317
+  sig do
+    params(
+      node: T.any(::Prism::ConstantPathNode, ::Prism::ConstantPathTargetNode, ::Prism::ConstantReadNode)
+    ).returns(T.nilable(::String))
+  end
+  def constant_name(node); end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#14
+class RubyIndexer::ReferenceFinder::ConstTarget < ::RubyIndexer::ReferenceFinder::Target
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#21
+  sig { params(fully_qualified_name: ::String).void }
+  def initialize(fully_qualified_name); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#18
+  sig { returns(::String) }
+  def fully_qualified_name; end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#27
+class RubyIndexer::ReferenceFinder::MethodTarget < ::RubyIndexer::ReferenceFinder::Target
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#34
+  sig { params(method_name: ::String).void }
+  def initialize(method_name); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#31
+  sig { returns(::String) }
+  def method_name; end
+end
+
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#40
+class RubyIndexer::ReferenceFinder::Reference
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#53
+  sig { params(name: ::String, location: ::Prism::Location, declaration: T::Boolean).void }
+  def initialize(name, location, declaration:); end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#50
+  sig { returns(T::Boolean) }
+  def declaration; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#47
+  sig { returns(::Prism::Location) }
+  def location; end
+
+  # source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#44
+  sig { returns(::String) }
+  def name; end
+end
+
+# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
+#
+# source://ruby-lsp/lib/ruby_indexer/lib/ruby_indexer/reference_finder.rb#8
+class RubyIndexer::ReferenceFinder::Target
+  abstract!
+end
+
+# source://ruby-lsp/lib/ruby-lsp.rb#4
+module RubyLsp; end
+
+# To register an add-on, inherit from this class and implement both `name` and `activate`
+#
+# # Example
+#
+# ```ruby
+# module MyGem
+#   class MyAddon < Addon
+#     def activate
+#       # Perform any relevant initialization
+#     end
+#
+#     def name
+#       "My add-on name"
+#     end
+#   end
+# end
+# ```
+#
+# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
+#
+# source://ruby-lsp/lib/ruby_lsp/addon.rb#22
+class RubyLsp::Addon
+  abstract!
+
+  # source://ruby-lsp/lib/ruby_lsp/addon.rb#150
+  sig { void }
+  def initialize; end
+
+  # Each add-on should implement `MyAddon#activate` and use to perform any sort of initialization, such as
+  # reading information into memory or even spawning a separate process
+  #
+  # @abstract
+  #
+  # source://ruby-lsp/lib/ruby_lsp/addon.rb#181
+  sig { abstract.params(global_state: ::RubyLsp::GlobalState, outgoing_queue: ::Thread::Queue).void }
+  def activate(global_state, outgoing_queue); end
+
+  # source://ruby-lsp/lib/ruby_lsp/addon.rb#155
+  sig { params(error: ::StandardError).returns(T.self_type) }
+  def add_error(error); end
+
+  # Creates a new CodeLens listener. This method is invoked on every CodeLens request
+  #
+  # source://ruby-lsp/lib/ruby_lsp/addon.rb#212
+  sig do
+    overridable
+      .params(
+        response_builder: RubyLsp::ResponseBuilders::CollectionResponseBuilder[::LanguageServer::Protocol::Interface::CodeLens],
+        uri: ::URI::Generic,
+        dispatcher: ::Prism::Dispatcher
+      ).void
+  end
+  def create_code_lens_listener(response_builder, uri, dispatcher); end
+
+  # Creates a new Completion listener. This method is invoked on every Completion request
+  #
+  # source://ruby-lsp/lib/ruby_lsp/addon.rb#264
+  sig do
+    overridable
+      .params(
+        response_builder: RubyLsp::ResponseBuilders::CollectionResponseBuilder[::LanguageServer::Protocol::Interface::CompletionItem],
+        node_context: ::RubyLsp::NodeContext,
+        dispatcher: ::Prism::Dispatcher,
+        uri: ::URI::Generic
+      ).void
+  end
+  def create_completion_listener(response_builder, node_context, dispatcher, uri); end
+
+  # Creates a new Definition listener. This method is invoked on every Definition request
+  #
+  # source://ruby-lsp/lib/ruby_lsp/addon.rb#253
+  sig do
+    overridable
+      .params(
+        response_builder: RubyLsp::ResponseBuilders::CollectionResponseBuilder[T.any(::LanguageServer::Protocol::Interface::Location, ::LanguageServer::Protocol::Interface::LocationLink)],
+        uri: ::URI::Generic,
+        node_context: ::RubyLsp::NodeContext,
+        dispatcher: ::Prism::Dispatcher
+      ).void
+  end
+  def create_definition_listener(response_builder, uri, node_context, dispatcher); end
+
+  # Creates a new DocumentSymbol listener. This method is invoked on every DocumentSymbol request
+  #
+  # source://ruby-lsp/lib/ruby_lsp/addon.rb#231
+  sig do
+    overridable
+      .params(
+        response_builder: RubyLsp::ResponseBuilders::DocumentSymbol,
+        dispatcher: ::Prism::Dispatcher
+      ).void
+  end
+  def create_document_symbol_listener(response_builder, dispatcher); end
+
+  # Creates a new Hover listener. This method is invoked on every Hover request
+  #
+  # source://ruby-lsp/lib/ruby_lsp/addon.rb#222
+  sig do
+    overridable
+      .params(
+        response_builder: RubyLsp::ResponseBuilders::Hover,
+        node_context: ::RubyLsp::NodeContext,
+        dispatcher: ::Prism::Dispatcher
+      ).void
+  end
+  def create_hover_listener(response_builder, node_context, dispatcher); end
+
+  # source://ruby-lsp/lib/ruby_lsp/addon.rb#239
+  sig do
+    overridable
+      .params(
+        response_builder: RubyLsp::ResponseBuilders::SemanticHighlighting,
+        dispatcher: ::Prism::Dispatcher
+      ).void
+  end
+  def create_semantic_highlighting_listener(response_builder, dispatcher); end
+
+  # Each add-on should implement `MyAddon#deactivate` and use to perform any clean up, like shutting down a
+  # child process
+  #
+  # @abstract
+  #
+  # source://ruby-lsp/lib/ruby_lsp/addon.rb#186
+  sig { abstract.void }
+  def deactivate; end
+
+  # source://ruby-lsp/lib/ruby_lsp/addon.rb#161
+  sig { returns(T::Boolean) }
+  def error?; end
+
+  # source://ruby-lsp/lib/ruby_lsp/addon.rb#174
+  sig { returns(::String) }
+  def errors_details; end
+
+  # source://ruby-lsp/lib/ruby_lsp/addon.rb#166
+  sig { returns(::String) }
+  def formatted_errors; end
+
+  # Handle a response from a window/showMessageRequest request. Add-ons must include the addon_name as part of the
+  # original request so that the response is delegated to the correct add-on and must override this method to handle
+  # the response
+  # https://microsoft.github.io/language-server-protocol/specification#window_showMessageRequest
+  #
+  # source://ruby-lsp/lib/ruby_lsp/addon.rb#202
+  sig { overridable.params(title: ::String).void }
+  def handle_window_show_message_response(title); end
+
+  # Add-ons should override the `name` method to return the add-on name
+  #
+  # @abstract
+  #
+  # source://ruby-lsp/lib/ruby_lsp/addon.rb#190
+  sig { abstract.returns(::String) }
+  def name; end
+
+  # Add-ons should override the `version` method to return a semantic version string representing the add-on's
+  # version. This is used for compatibility checks
+  #
+  # @abstract
+  #
+  # source://ruby-lsp/lib/ruby_lsp/addon.rb#195
+  sig { abstract.returns(::String) }
+  def version; end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/addon.rb#47
+    sig { returns(T::Array[T.class_of(RubyLsp::Addon)]) }
+    def addon_classes; end
+
+    # source://ruby-lsp/lib/ruby_lsp/addon.rb#41
+    sig { returns(T::Array[::RubyLsp::Addon]) }
+    def addons; end
+
+    # @return [Array<Addon>]
+    #
+    # source://ruby-lsp/lib/ruby_lsp/addon.rb#41
+    def addons=(_arg0); end
+
+    # Depend on a specific version of the Ruby LSP. This method should only be used if the add-on is distributed in a
+    # gem that does not have a runtime dependency on the ruby-lsp gem. This method should be invoked at the top of the
+    # `addon.rb` file before defining any classes or requiring any files. For example:
+    #
+    # ```ruby
+    # RubyLsp::Addon.depend_on_ruby_lsp!(">= 0.18.0")
+    #
+    # module MyGem
+    #   class MyAddon < RubyLsp::Addon
+    #     # ...
+    #   end
+    # end
+    # ```
+    #
+    # source://ruby-lsp/lib/ruby_lsp/addon.rb#139
+    sig { params(version_constraints: ::String).void }
+    def depend_on_ruby_lsp!(*version_constraints); end
+
+    # source://ruby-lsp/lib/ruby_lsp/addon.rb#44
+    sig { returns(T::Array[::RubyLsp::Addon]) }
+    def file_watcher_addons; end
+
+    # @return [Array<Addon>]
+    #
+    # source://ruby-lsp/lib/ruby_lsp/addon.rb#44
+    def file_watcher_addons=(_arg0); end
+
+    # Get a reference to another add-on object by name and version. If an add-on exports an API that can be used by
+    # other add-ons, this is the way to get access to that API.
+    #
+    # Important: if the add-on is not found, AddonNotFoundError will be raised. If the add-on is found, but its
+    # current version does not satisfy the given version constraint, then IncompatibleApiError will be raised. It is
+    # the responsibility of the add-ons using this API to handle these errors appropriately.
+    #
+    # @raise [AddonNotFoundError]
+    #
+    # source://ruby-lsp/lib/ruby_lsp/addon.rb#107
+    sig { params(addon_name: ::String, version_constraints: ::String).returns(::RubyLsp::Addon) }
+    def get(addon_name, *version_constraints); end
+
+    # Automatically track and instantiate add-on classes
+    #
+    # source://ruby-lsp/lib/ruby_lsp/addon.rb#51
+    sig { params(child_class: T.class_of(RubyLsp::Addon)).void }
+    def inherited(child_class); end
+
+    # Discovers and loads all add-ons. Returns a list of errors when trying to require add-ons
+    #
+    # source://ruby-lsp/lib/ruby_lsp/addon.rb#64
+    sig do
+      params(
+        global_state: ::RubyLsp::GlobalState,
+        outgoing_queue: ::Thread::Queue,
+        include_project_addons: T::Boolean
+      ).returns(T::Array[::StandardError])
+    end
+    def load_addons(global_state, outgoing_queue, include_project_addons: T.unsafe(nil)); end
+  end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/addon.rb#33
+class RubyLsp::Addon::AddonNotFoundError < ::StandardError; end
+
+# source://ruby-lsp/lib/ruby_lsp/addon.rb#35
+class RubyLsp::Addon::IncompatibleApiError < ::StandardError; end
+
+# Used to indicate that a request shouldn't return a response
+#
+# source://ruby-lsp/lib/ruby_lsp/utils.rb#12
+RubyLsp::BUNDLE_PATH = T.let(T.unsafe(nil), String)
+
+# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
+#
+# source://ruby-lsp/lib/ruby_lsp/base_server.rb#5
+class RubyLsp::BaseServer
+  abstract!
+
+  # source://ruby-lsp/lib/ruby_lsp/base_server.rb#12
+  sig { params(options: T.untyped).void }
+  def initialize(**options); end
+
+  # source://ruby-lsp/lib/ruby_lsp/base_server.rb#145
+  sig { params(id: ::Integer, message: ::String, type: ::Integer).void }
+  def fail_request_and_notify(id, message, type: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/base_server.rb#151
+  sig { returns(::Thread) }
+  def new_worker; end
+
+  # This method is only intended to be used in tests! Pops the latest response that would be sent to the client
+  #
+  # source://ruby-lsp/lib/ruby_lsp/base_server.rb#134
+  sig { returns(T.untyped) }
+  def pop_response; end
+
+  # @abstract
+  #
+  # source://ruby-lsp/lib/ruby_lsp/base_server.rb#139
+  sig { abstract.params(message: T::Hash[::Symbol, T.untyped]).void }
+  def process_message(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/base_server.rb#118
+  sig { void }
+  def run_shutdown; end
+
+  # source://ruby-lsp/lib/ruby_lsp/base_server.rb#182
+  sig { params(id: ::Integer).void }
+  def send_empty_response(id); end
+
+  # source://ruby-lsp/lib/ruby_lsp/base_server.rb#187
+  sig { params(message: ::String, type: ::Integer).void }
+  def send_log_message(message, type: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/base_server.rb#171
+  sig { params(message: T.any(::RubyLsp::Error, ::RubyLsp::Notification, ::RubyLsp::Request, ::RubyLsp::Result)).void }
+  def send_message(message); end
+
+  # @abstract
+  #
+  # source://ruby-lsp/lib/ruby_lsp/base_server.rb#142
+  sig { abstract.void }
+  def shutdown; end
+
+  # source://ruby-lsp/lib/ruby_lsp/base_server.rb#46
+  sig { void }
+  def start; end
+end
+
+# This class stores all client capabilities that the Ruby LSP and its add-ons depend on to ensure that we're
+# not enabling functionality unsupported by the editor connecting to the server
+#
+# source://ruby-lsp/lib/ruby_lsp/client_capabilities.rb#7
+class RubyLsp::ClientCapabilities
+  # source://ruby-lsp/lib/ruby_lsp/client_capabilities.rb#17
+  sig { void }
+  def initialize; end
+
+  # source://ruby-lsp/lib/ruby_lsp/client_capabilities.rb#38
+  sig { params(capabilities: T::Hash[::Symbol, T.untyped]).void }
+  def apply_client_capabilities(capabilities); end
+
+  # @return [Boolean]
+  #
+  # source://ruby-lsp/lib/ruby_lsp/client_capabilities.rb#11
+  def supports_progress; end
+
+  # source://ruby-lsp/lib/ruby_lsp/client_capabilities.rb#63
+  sig { returns(T::Boolean) }
+  def supports_rename?; end
+
+  # @return [Boolean]
+  #
+  # source://ruby-lsp/lib/ruby_lsp/client_capabilities.rb#11
+  def supports_request_delegation; end
+
+  # source://ruby-lsp/lib/ruby_lsp/client_capabilities.rb#11
+  sig { returns(T::Boolean) }
+  def supports_watching_files; end
+
+  # @return [Boolean]
+  #
+  # source://ruby-lsp/lib/ruby_lsp/client_capabilities.rb#11
+  def window_show_message_supports_extra_properties; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/utils.rb#7
+RubyLsp::Constant = LanguageServer::Protocol::Constant
+
+# Request delegation for embedded languages is not yet standardized into the language server specification. Here we
+# use this custom error class as a way to return a signal to the client that the request should be delegated to the
+# language server for the host language. The support for delegation is custom built on the client side, so each editor
+# needs to implement their own until this becomes a part of the spec
+#
+# source://ruby-lsp/lib/ruby_lsp/utils.rb#34
+class RubyLsp::DelegateRequestError < ::StandardError; end
+
+# A custom error code that clients can use to handle delegate requests. This is past the range of error codes listed
+# by the specification to avoid conflicting with other error types
+#
+# source://ruby-lsp/lib/ruby_lsp/utils.rb#37
+RubyLsp::DelegateRequestError::CODE = T.let(T.unsafe(nil), Integer)
+
+# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
+#
+# source://ruby-lsp/lib/ruby_lsp/document.rb#5
+class RubyLsp::Document
+  extend T::Generic
+
+  abstract!
+
+  ParseResultType = type_member
+
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#46
+  sig { params(source: ::String, version: ::Integer, uri: ::URI::Generic, encoding: ::Encoding).void }
+  def initialize(source:, version:, uri:, encoding: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#59
+  sig { params(other: RubyLsp::Document[T.untyped]).returns(T::Boolean) }
+  def ==(other); end
+
+  # TODO: remove this method once all non-positional requests have been migrated to the listener pattern
+  #
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#74
+  sig do
+    type_parameters(:T)
+      .params(
+        request_name: ::String,
+        block: T.proc.params(document: RubyLsp::Document[ParseResultType]).returns(T.type_parameter(:T))
+      ).returns(T.type_parameter(:T))
+  end
+  def cache_fetch(request_name, &block); end
+
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#89
+  sig { params(request_name: ::String).returns(T.untyped) }
+  def cache_get(request_name); end
+
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#84
+  sig { type_parameters(:T).params(request_name: ::String, value: T.type_parameter(:T)).returns(T.type_parameter(:T)) }
+  def cache_set(request_name, value); end
+
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#118
+  sig { returns(::RubyLsp::Document::Scanner) }
+  def create_scanner; end
+
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#40
+  sig { returns(::Encoding) }
+  def encoding; end
+
+  # @abstract
+  #
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#64
+  sig { abstract.returns(::RubyLsp::Document::LanguageId) }
+  def language_id; end
+
+  # Returns `true` if the document was parsed and `false` if nothing needed parsing
+  #
+  # @abstract
+  #
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#112
+  sig { abstract.returns(T::Boolean) }
+  def parse!; end
+
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#28
+  sig { returns(ParseResultType) }
+  def parse_result; end
+
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#123
+  sig { returns(T::Boolean) }
+  def past_expensive_limit?; end
+
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#94
+  sig { params(edits: T::Array[T::Hash[::Symbol, T.untyped]], version: ::Integer).void }
+  def push_edits(edits, version:); end
+
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#43
+  sig { returns(T.any(::LanguageServer::Protocol::Interface::SemanticTokens, ::Object)) }
+  def semantic_tokens; end
+
+  # @return [Interface::SemanticTokens, Object]
+  #
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#43
+  def semantic_tokens=(_arg0); end
+
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#31
+  sig { returns(::String) }
+  def source; end
+
+  # @abstract
+  #
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#115
+  sig { abstract.returns(T::Boolean) }
+  def syntax_error?; end
+
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#37
+  sig { returns(::URI::Generic) }
+  def uri; end
+
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#34
+  sig { returns(::Integer) }
+  def version; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/document.rb#23
+RubyLsp::Document::EMPTY_CACHE = T.let(T.unsafe(nil), Object)
+
+# source://ruby-lsp/lib/ruby_lsp/document.rb#6
+class RubyLsp::Document::LanguageId < ::T::Enum
+  enums do
+    ERB = new
+    RBS = new
+    Ruby = new
+  end
+end
+
+# This maximum number of characters for providing expensive features, like semantic highlighting and diagnostics.
+# This is the same number used by the TypeScript extension in VS Code
+#
+# source://ruby-lsp/lib/ruby_lsp/document.rb#22
+RubyLsp::Document::MAXIMUM_CHARACTERS_FOR_EXPENSIVE_FEATURES = T.let(T.unsafe(nil), Integer)
+
+# source://ruby-lsp/lib/ruby_lsp/document.rb#127
+class RubyLsp::Document::Scanner
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#135
+  sig { params(source: ::String, encoding: ::Encoding).void }
+  def initialize(source, encoding); end
+
+  # Finds the character index inside the source string for a given line and column
+  #
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#144
+  sig { params(position: T::Hash[::Symbol, T.untyped]).returns(::Integer) }
+  def find_char_position(position); end
+
+  # Subtract 1 for each character after 0xFFFF in the current line from the column position, so that we hit the
+  # right character in the UTF-8 representation
+  #
+  # source://ruby-lsp/lib/ruby_lsp/document.rb#166
+  sig { params(current_position: ::Integer, requested_position: ::Integer).returns(::Integer) }
+  def utf_16_character_position_correction(current_position, requested_position); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/document.rb#130
+RubyLsp::Document::Scanner::LINE_BREAK = T.let(T.unsafe(nil), Integer)
+
+# After character 0xFFFF, UTF-16 considers characters to have length 2 and we have to account for that
+#
+# source://ruby-lsp/lib/ruby_lsp/document.rb#132
+RubyLsp::Document::Scanner::SURROGATE_PAIR_START = T.let(T.unsafe(nil), Integer)
+
+# source://ruby-lsp/lib/ruby_lsp/erb_document.rb#5
+class RubyLsp::ERBDocument < ::RubyLsp::Document
+  extend T::Generic
+
+  ParseResultType = type_member { { fixed: Prism::ParseResult } }
+
+  # source://ruby-lsp/lib/ruby_lsp/erb_document.rb#23
+  sig { params(source: ::String, version: ::Integer, uri: ::URI::Generic, encoding: ::Encoding).void }
+  def initialize(source:, version:, uri:, encoding: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/erb_document.rb#20
+  sig { returns(T.any(::Prism::CodeUnitsCache, T.proc.params(arg0: ::Integer).returns(::Integer))) }
+  def code_units_cache; end
+
+  # source://ruby-lsp/lib/ruby_lsp/erb_document.rb#12
+  sig { returns(::String) }
+  def host_language_source; end
+
+  # source://ruby-lsp/lib/ruby_lsp/erb_document.rb#75
+  sig { params(char_position: ::Integer).returns(T.nilable(T::Boolean)) }
+  def inside_host_language?(char_position); end
+
+  # source://ruby-lsp/lib/ruby_lsp/erb_document.rb#55
+  sig { override.returns(::RubyLsp::Document::LanguageId) }
+  def language_id; end
+
+  # source://ruby-lsp/lib/ruby_lsp/erb_document.rb#65
+  sig do
+    params(
+      position: T::Hash[::Symbol, T.untyped],
+      node_types: T::Array[T.class_of(Prism::Node)]
+    ).returns(::RubyLsp::NodeContext)
+  end
+  def locate_node(position, node_types: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/erb_document.rb#35
+  sig { override.returns(T::Boolean) }
+  def parse!; end
+
+  # source://ruby-lsp/lib/ruby_lsp/erb_document.rb#50
+  sig { override.returns(T::Boolean) }
+  def syntax_error?; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/erb_document.rb#80
+class RubyLsp::ERBDocument::ERBScanner
+  # source://ruby-lsp/lib/ruby_lsp/erb_document.rb#87
+  sig { params(source: ::String).void }
+  def initialize(source); end
+
+  # @return [String]
+  #
+  # source://ruby-lsp/lib/ruby_lsp/erb_document.rb#84
+  def host_language; end
+
+  # source://ruby-lsp/lib/ruby_lsp/erb_document.rb#84
+  sig { returns(::String) }
+  def ruby; end
+
+  # source://ruby-lsp/lib/ruby_lsp/erb_document.rb#96
+  sig { void }
+  def scan; end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/erb_document.rb#172
+  sig { returns(::String) }
+  def next_char; end
+
+  # source://ruby-lsp/lib/ruby_lsp/erb_document.rb#161
+  sig { params(char: ::String).void }
+  def push_char(char); end
+
+  # source://ruby-lsp/lib/ruby_lsp/erb_document.rb#106
+  sig { void }
+  def scan_char; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/utils.rb#170
+class RubyLsp::Error
+  # source://ruby-lsp/lib/ruby_lsp/utils.rb#177
+  sig { params(id: ::Integer, code: ::Integer, message: ::String, data: T.nilable(T::Hash[::Symbol, T.untyped])).void }
+  def initialize(id:, code:, message:, data: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/utils.rb#174
+  sig { returns(::String) }
+  def message; end
+
+  # source://ruby-lsp/lib/ruby_lsp/utils.rb#185
+  sig { returns(T::Hash[::Symbol, T.untyped]) }
+  def to_hash; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/utils.rb#20
+RubyLsp::GEMFILE_NAME = T.let(T.unsafe(nil), String)
+
+# source://ruby-lsp/lib/ruby_lsp/utils.rb#28
+RubyLsp::GUESSED_TYPES_URL = T.let(T.unsafe(nil), String)
+
+# source://ruby-lsp/lib/ruby_lsp/global_state.rb#5
+class RubyLsp::GlobalState
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#33
+  sig { void }
+  def initialize; end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#70
+  sig { returns(T.nilable(::RubyLsp::Requests::Support::Formatter)) }
+  def active_formatter; end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#75
+  sig { returns(T::Array[::RubyLsp::Requests::Support::Formatter]) }
+  def active_linters; end
+
+  # Applies the options provided by the editor and returns an array of notifications to send back to the client
+  #
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#81
+  sig { params(options: T::Hash[::Symbol, T.untyped]).returns(T::Array[::RubyLsp::Notification]) }
+  def apply_options(options); end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#30
+  sig { returns(::RubyLsp::ClientCapabilities) }
+  def client_capabilities; end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#150
+  sig { params(flag: ::Symbol).returns(T.nilable(T::Boolean)) }
+  def enabled_feature?(flag); end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#21
+  sig { returns(::Encoding) }
+  def encoding; end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#160
+  sig { returns(::String) }
+  def encoding_name; end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#24
+  sig { returns(T::Boolean) }
+  def experimental_features; end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#12
+  sig { returns(::String) }
+  def formatter; end
+
+  # @return [String]
+  #
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#12
+  def formatter=(_arg0); end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#15
+  sig { returns(T::Boolean) }
+  def has_type_checker; end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#18
+  sig { returns(::RubyIndexer::Index) }
+  def index; end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#65
+  sig { params(identifier: ::String, instance: ::RubyLsp::Requests::Support::Formatter).void }
+  def register_formatter(identifier, instance); end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#60
+  sig { params(addon_name: ::String).returns(T.nilable(T::Hash[::Symbol, T.untyped])) }
+  def settings_for_addon(addon_name); end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#172
+  sig { returns(T::Boolean) }
+  def supports_watching_files; end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#9
+  sig { returns(::String) }
+  def test_library; end
+
+  # @return [Boolean]
+  #
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#24
+  def top_level_bundle; end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#27
+  sig { returns(::RubyLsp::TypeInferrer) }
+  def type_inferrer; end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#155
+  sig { returns(::String) }
+  def workspace_path; end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#235
+  sig { returns(T::Boolean) }
+  def bin_rails_present; end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#179
+  sig { params(direct_dependencies: T::Array[::String], all_dependencies: T::Array[::String]).returns(::String) }
+  def detect_formatter(direct_dependencies, all_dependencies); end
+
+  # Try to detect if there are linters in the project's dependencies. For auto-detection, we always only consider a
+  # single linter. To have multiple linters running, the user must configure them manually
+  #
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#195
+  sig { params(dependencies: T::Array[::String], all_dependencies: T::Array[::String]).returns(T::Array[::String]) }
+  def detect_linters(dependencies, all_dependencies); end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#206
+  sig { params(dependencies: T::Array[::String]).returns(::String) }
+  def detect_test_library(dependencies); end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#226
+  sig { params(dependencies: T::Array[::String]).returns(T::Boolean) }
+  def detect_typechecker(dependencies); end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#240
+  sig { returns(T::Boolean) }
+  def dot_rubocop_yml_present; end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#262
+  sig { returns(T::Array[::String]) }
+  def gather_direct_and_indirect_dependencies; end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#245
+  sig { returns(T::Array[::String]) }
+  def gather_direct_dependencies; end
+
+  # source://ruby-lsp/lib/ruby_lsp/global_state.rb#255
+  sig { returns(T::Array[::String]) }
+  def gemspec_dependencies; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/utils.rb#6
+RubyLsp::Interface = LanguageServer::Protocol::Interface
+
+# A map of keyword => short documentation to be displayed on hover or completion
+#
+# source://ruby-lsp/lib/ruby_lsp/static_docs.rb#9
+RubyLsp::KEYWORD_DOCS = T.let(T.unsafe(nil), Hash)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#7
+module RubyLsp::Listeners; end
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#8
+class RubyLsp::Listeners::CodeLens
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#35
+  sig do
+    params(
+      response_builder: RubyLsp::ResponseBuilders::CollectionResponseBuilder[::LanguageServer::Protocol::Interface::CodeLens],
+      global_state: ::RubyLsp::GlobalState,
+      uri: ::URI::Generic,
+      dispatcher: ::Prism::Dispatcher
+    ).void
+  end
+  def initialize(response_builder, global_state, uri, dispatcher); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#137
+  sig { params(node: ::Prism::CallNode).void }
+  def on_call_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#167
+  sig { params(node: ::Prism::CallNode).void }
+  def on_call_node_leave(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#63
+  sig { params(node: ::Prism::ClassNode).void }
+  def on_class_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#83
+  sig { params(node: ::Prism::ClassNode).void }
+  def on_class_node_leave(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#95
+  sig { params(node: ::Prism::DefNode).void }
+  def on_def_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#118
+  sig { params(node: ::Prism::DefNode).void }
+  def on_def_node_leave(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#123
+  sig { params(node: ::Prism::ModuleNode).void }
+  def on_module_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#132
+  sig { params(node: ::Prism::ModuleNode).void }
+  def on_module_node_leave(node); end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#274
+  sig { params(node: ::Prism::CallNode, kind: ::Symbol).void }
+  def add_spec_code_lens(node, kind:); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#179
+  sig { params(node: ::Prism::Node, name: ::String, command: ::String, kind: ::Symbol, id: ::String).void }
+  def add_test_code_lens(node, name:, command:, kind:, id: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#312
+  sig { params(group_stack: T::Array[::String], method_name: T.nilable(::String)).returns(::String) }
+  def generate_fully_qualified_id(group_stack:, method_name: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#231
+  sig do
+    params(
+      group_stack: T::Array[::String],
+      spec_name: T.nilable(::String),
+      method_name: T.nilable(::String)
+    ).returns(::String)
+  end
+  def generate_test_command(group_stack: T.unsafe(nil), spec_name: T.unsafe(nil), method_name: T.unsafe(nil)); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#21
+RubyLsp::Listeners::CodeLens::ACCESS_MODIFIERS = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#12
+RubyLsp::Listeners::CodeLens::BASE_COMMAND = T.let(T.unsafe(nil), String)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#23
+RubyLsp::Listeners::CodeLens::DESCRIBE_KEYWORD = T.let(T.unsafe(nil), Symbol)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#25
+RubyLsp::Listeners::CodeLens::DYNAMIC_REFERENCE_MARKER = T.let(T.unsafe(nil), String)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#24
+RubyLsp::Listeners::CodeLens::IT_KEYWORD = T.let(T.unsafe(nil), Symbol)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/code_lens.rb#22
+RubyLsp::Listeners::CodeLens::SUPPORTED_TEST_LIBRARIES = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#6
+class RubyLsp::Listeners::Completion
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#65
+  sig do
+    params(
+      response_builder: RubyLsp::ResponseBuilders::CollectionResponseBuilder[::LanguageServer::Protocol::Interface::CompletionItem],
+      global_state: ::RubyLsp::GlobalState,
+      node_context: ::RubyLsp::NodeContext,
+      sorbet_level: ::RubyLsp::RubyDocument::SorbetLevel,
+      dispatcher: ::Prism::Dispatcher,
+      uri: ::URI::Generic,
+      trigger_character: T.nilable(::String)
+    ).void
+  end
+  def initialize(response_builder, global_state, node_context, sorbet_level, dispatcher, uri, trigger_character); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#146
+  sig { params(node: ::Prism::CallNode).void }
+  def on_call_node_enter(node); end
+
+  # Handle completion on namespaced constant references (e.g. `Foo::Bar`)
+  #
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#128
+  sig { params(node: ::Prism::ConstantPathNode).void }
+  def on_constant_path_node_enter(node); end
+
+  # Handle completion on regular constant references (e.g. `Bar`)
+  #
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#105
+  sig { params(node: ::Prism::ConstantReadNode).void }
+  def on_constant_read_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#190
+  sig { params(node: ::Prism::GlobalVariableAndWriteNode).void }
+  def on_global_variable_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#195
+  sig { params(node: ::Prism::GlobalVariableOperatorWriteNode).void }
+  def on_global_variable_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#200
+  sig { params(node: ::Prism::GlobalVariableOrWriteNode).void }
+  def on_global_variable_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#205
+  sig { params(node: ::Prism::GlobalVariableReadNode).void }
+  def on_global_variable_read_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#210
+  sig { params(node: ::Prism::GlobalVariableTargetNode).void }
+  def on_global_variable_target_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#215
+  sig { params(node: ::Prism::GlobalVariableWriteNode).void }
+  def on_global_variable_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#230
+  sig { params(node: ::Prism::InstanceVariableAndWriteNode).void }
+  def on_instance_variable_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#235
+  sig { params(node: ::Prism::InstanceVariableOperatorWriteNode).void }
+  def on_instance_variable_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#240
+  sig { params(node: ::Prism::InstanceVariableOrWriteNode).void }
+  def on_instance_variable_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#220
+  sig { params(node: ::Prism::InstanceVariableReadNode).void }
+  def on_instance_variable_read_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#245
+  sig { params(node: ::Prism::InstanceVariableTargetNode).void }
+  def on_instance_variable_target_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#225
+  sig { params(node: ::Prism::InstanceVariableWriteNode).void }
+  def on_instance_variable_write_node_enter(node); end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#492
+  sig { params(node: ::Prism::CallNode, name: ::String).void }
+  def add_keyword_completions(node, name); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#472
+  sig { params(node: ::Prism::CallNode, name: ::String).void }
+  def add_local_completions(node, name); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#510
+  sig do
+    params(
+      label: ::String,
+      node: ::Prism::StringNode
+    ).returns(::LanguageServer::Protocol::Interface::CompletionItem)
+  end
+  def build_completion(label, node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#533
+  sig do
+    params(
+      real_name: ::String,
+      incomplete_name: ::String,
+      range: ::LanguageServer::Protocol::Interface::Range,
+      entries: T::Array[::RubyIndexer::Entry],
+      top_level: T::Boolean
+    ).returns(::LanguageServer::Protocol::Interface::CompletionItem)
+  end
+  def build_entry_completion(real_name, incomplete_name, range, entries, top_level); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#408
+  sig { params(node: ::Prism::CallNode, name: ::String).void }
+  def complete_methods(node, name); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#363
+  sig { params(node: ::Prism::CallNode).void }
+  def complete_require(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#379
+  sig { params(node: ::Prism::CallNode).void }
+  def complete_require_relative(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#252
+  sig { params(name: ::String, range: ::LanguageServer::Protocol::Interface::Range).void }
+  def constant_path_completion(name, range); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#307
+  sig { params(name: ::String, location: ::Prism::Location).void }
+  def handle_global_variable_completion(name, location); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#330
+  sig { params(name: ::String, location: ::Prism::Location).void }
+  def handle_instance_variable_completion(name, location); end
+
+  # Check if there are any conflicting names for `entry_name`, which would require us to use a top level reference.
+  # For example:
+  #
+  # ```ruby
+  # class Bar; end
+  #
+  # module Foo
+  #   class Bar; end
+  #
+  #   # in this case, the completion for `Bar` conflicts with `Foo::Bar`, so we can't suggest `Bar` as the
+  #   # completion, but instead need to suggest `::Bar`
+  #   B
+  # end
+  # ```
+  #
+  # source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#622
+  sig { params(entry_name: ::String).returns(T::Boolean) }
+  def top_level?(entry_name); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/completion.rb#10
+RubyLsp::Listeners::Completion::KEYWORDS = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#6
+class RubyLsp::Listeners::Definition
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#26
+  sig do
+    params(
+      response_builder: RubyLsp::ResponseBuilders::CollectionResponseBuilder[T.any(::LanguageServer::Protocol::Interface::Location, ::LanguageServer::Protocol::Interface::LocationLink)],
+      global_state: ::RubyLsp::GlobalState,
+      language_id: ::RubyLsp::Document::LanguageId,
+      uri: ::URI::Generic,
+      node_context: ::RubyLsp::NodeContext,
+      dispatcher: ::Prism::Dispatcher,
+      sorbet_level: ::RubyLsp::RubyDocument::SorbetLevel
+    ).void
+  end
+  def initialize(response_builder, global_state, language_id, uri, node_context, dispatcher, sorbet_level); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#103
+  sig { params(node: ::Prism::BlockArgumentNode).void }
+  def on_block_argument_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#62
+  sig { params(node: ::Prism::CallNode).void }
+  def on_call_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#114
+  sig { params(node: ::Prism::ConstantPathNode).void }
+  def on_constant_path_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#122
+  sig { params(node: ::Prism::ConstantReadNode).void }
+  def on_constant_read_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#195
+  sig { params(node: ::Prism::ForwardingSuperNode).void }
+  def on_forwarding_super_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#130
+  sig { params(node: ::Prism::GlobalVariableAndWriteNode).void }
+  def on_global_variable_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#135
+  sig { params(node: ::Prism::GlobalVariableOperatorWriteNode).void }
+  def on_global_variable_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#140
+  sig { params(node: ::Prism::GlobalVariableOrWriteNode).void }
+  def on_global_variable_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#145
+  sig { params(node: ::Prism::GlobalVariableReadNode).void }
+  def on_global_variable_read_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#150
+  sig { params(node: ::Prism::GlobalVariableTargetNode).void }
+  def on_global_variable_target_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#155
+  sig { params(node: ::Prism::GlobalVariableWriteNode).void }
+  def on_global_variable_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#170
+  sig { params(node: ::Prism::InstanceVariableAndWriteNode).void }
+  def on_instance_variable_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#175
+  sig { params(node: ::Prism::InstanceVariableOperatorWriteNode).void }
+  def on_instance_variable_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#180
+  sig { params(node: ::Prism::InstanceVariableOrWriteNode).void }
+  def on_instance_variable_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#160
+  sig { params(node: ::Prism::InstanceVariableReadNode).void }
+  def on_instance_variable_read_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#185
+  sig { params(node: ::Prism::InstanceVariableTargetNode).void }
+  def on_instance_variable_target_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#165
+  sig { params(node: ::Prism::InstanceVariableWriteNode).void }
+  def on_instance_variable_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#81
+  sig { params(node: ::Prism::StringNode).void }
+  def on_string_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#190
+  sig { params(node: ::Prism::SuperNode).void }
+  def on_super_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#92
+  sig { params(node: ::Prism::SymbolNode).void }
+  def on_symbol_node_enter(node); end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#336
+  sig { params(value: ::String).void }
+  def find_in_index(value); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#325
+  sig { params(node: ::Prism::CallNode).void }
+  def handle_autoload_definition(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#217
+  sig { params(name: ::String).void }
+  def handle_global_variable_definition(name); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#236
+  sig { params(name: ::String).void }
+  def handle_instance_variable_definition(name); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#263
+  sig do
+    params(
+      message: ::String,
+      receiver_type: T.nilable(::RubyLsp::TypeInferrer::Type),
+      inherited_only: T::Boolean
+    ).void
+  end
+  def handle_method_definition(message, receiver_type, inherited_only: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#290
+  sig { params(node: ::Prism::StringNode, message: ::Symbol).void }
+  def handle_require_definition(node, message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#202
+  sig { void }
+  def handle_super_node_definition; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/definition.rb#10
+RubyLsp::Listeners::Definition::MAX_NUMBER_OF_DEFINITION_CANDIDATES_WITHOUT_RECEIVER = T.let(T.unsafe(nil), Integer)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#6
+class RubyLsp::Listeners::DocumentHighlight
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#98
+  sig do
+    params(
+      response_builder: RubyLsp::ResponseBuilders::CollectionResponseBuilder[::LanguageServer::Protocol::Interface::DocumentHighlight],
+      target: T.nilable(::Prism::Node),
+      parent: T.nilable(::Prism::Node),
+      dispatcher: ::Prism::Dispatcher,
+      position: T::Hash[::Symbol, T.untyped]
+    ).void
+  end
+  def initialize(response_builder, target, parent, dispatcher, position); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#254
+  sig { params(node: ::Prism::BlockParameterNode).void }
+  def on_block_parameter_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#192
+  sig { params(node: ::Prism::CallNode).void }
+  def on_call_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#540
+  sig { params(node: ::Prism::CaseNode).void }
+  def on_case_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#268
+  sig { params(node: ::Prism::ClassNode).void }
+  def on_class_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#442
+  sig { params(node: ::Prism::ClassVariableAndWriteNode).void }
+  def on_class_variable_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#435
+  sig { params(node: ::Prism::ClassVariableOperatorWriteNode).void }
+  def on_class_variable_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#428
+  sig { params(node: ::Prism::ClassVariableOrWriteNode).void }
+  def on_class_variable_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#314
+  sig { params(node: ::Prism::ClassVariableReadNode).void }
+  def on_class_variable_read_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#240
+  sig { params(node: ::Prism::ClassVariableTargetNode).void }
+  def on_class_variable_target_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#421
+  sig { params(node: ::Prism::ClassVariableWriteNode).void }
+  def on_class_variable_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#498
+  sig { params(node: ::Prism::ConstantAndWriteNode).void }
+  def on_constant_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#463
+  sig { params(node: ::Prism::ConstantOperatorWriteNode).void }
+  def on_constant_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#456
+  sig { params(node: ::Prism::ConstantOrWriteNode).void }
+  def on_constant_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#342
+  sig { params(node: ::Prism::ConstantPathAndWriteNode).void }
+  def on_constant_path_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#293
+  sig { params(node: ::Prism::ConstantPathNode).void }
+  def on_constant_path_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#349
+  sig { params(node: ::Prism::ConstantPathOperatorWriteNode).void }
+  def on_constant_path_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#335
+  sig { params(node: ::Prism::ConstantPathOrWriteNode).void }
+  def on_constant_path_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#226
+  sig { params(node: ::Prism::ConstantPathTargetNode).void }
+  def on_constant_path_target_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#328
+  sig { params(node: ::Prism::ConstantPathWriteNode).void }
+  def on_constant_path_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#300
+  sig { params(node: ::Prism::ConstantReadNode).void }
+  def on_constant_read_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#233
+  sig { params(node: ::Prism::ConstantTargetNode).void }
+  def on_constant_target_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#449
+  sig { params(node: ::Prism::ConstantWriteNode).void }
+  def on_constant_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#203
+  sig { params(node: ::Prism::DefNode).void }
+  def on_def_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#561
+  sig { params(node: ::Prism::ForNode).void }
+  def on_for_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#519
+  sig { params(node: ::Prism::GlobalVariableAndWriteNode).void }
+  def on_global_variable_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#526
+  sig { params(node: ::Prism::GlobalVariableOperatorWriteNode).void }
+  def on_global_variable_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#512
+  sig { params(node: ::Prism::GlobalVariableOrWriteNode).void }
+  def on_global_variable_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#321
+  sig { params(node: ::Prism::GlobalVariableReadNode).void }
+  def on_global_variable_read_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#212
+  sig { params(node: ::Prism::GlobalVariableTargetNode).void }
+  def on_global_variable_target_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#505
+  sig { params(node: ::Prism::GlobalVariableWriteNode).void }
+  def on_global_variable_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#568
+  sig { params(node: ::Prism::IfNode).void }
+  def on_if_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#484
+  sig { params(node: ::Prism::InstanceVariableAndWriteNode).void }
+  def on_instance_variable_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#491
+  sig { params(node: ::Prism::InstanceVariableOperatorWriteNode).void }
+  def on_instance_variable_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#477
+  sig { params(node: ::Prism::InstanceVariableOrWriteNode).void }
+  def on_instance_variable_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#307
+  sig { params(node: ::Prism::InstanceVariableReadNode).void }
+  def on_instance_variable_read_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#219
+  sig { params(node: ::Prism::InstanceVariableTargetNode).void }
+  def on_instance_variable_target_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#470
+  sig { params(node: ::Prism::InstanceVariableWriteNode).void }
+  def on_instance_variable_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#392
+  sig { params(node: ::Prism::KeywordRestParameterNode).void }
+  def on_keyword_rest_parameter_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#400
+  sig { params(node: ::Prism::LocalVariableAndWriteNode).void }
+  def on_local_variable_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#407
+  sig { params(node: ::Prism::LocalVariableOperatorWriteNode).void }
+  def on_local_variable_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#414
+  sig { params(node: ::Prism::LocalVariableOrWriteNode).void }
+  def on_local_variable_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#286
+  sig { params(node: ::Prism::LocalVariableReadNode).void }
+  def on_local_variable_read_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#247
+  sig { params(node: ::Prism::LocalVariableTargetNode).void }
+  def on_local_variable_target_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#356
+  sig { params(node: ::Prism::LocalVariableWriteNode).void }
+  def on_local_variable_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#277
+  sig { params(node: ::Prism::ModuleNode).void }
+  def on_module_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#370
+  sig { params(node: ::Prism::OptionalKeywordParameterNode).void }
+  def on_optional_keyword_parameter_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#385
+  sig { params(node: ::Prism::OptionalParameterNode).void }
+  def on_optional_parameter_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#363
+  sig { params(node: ::Prism::RequiredKeywordParameterNode).void }
+  def on_required_keyword_parameter_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#261
+  sig { params(node: ::Prism::RequiredParameterNode).void }
+  def on_required_parameter_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#377
+  sig { params(node: ::Prism::RestParameterNode).void }
+  def on_rest_parameter_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#533
+  sig { params(node: ::Prism::SingletonClassNode).void }
+  def on_singleton_class_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#575
+  sig { params(node: ::Prism::UnlessNode).void }
+  def on_unless_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#554
+  sig { params(node: ::Prism::UntilNode).void }
+  def on_until_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#547
+  sig { params(node: ::Prism::WhileNode).void }
+  def on_while_node_enter(node); end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#589
+  sig { params(kind: ::Integer, location: ::Prism::Location).void }
+  def add_highlight(kind, location); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#622
+  sig { params(keyword_loc: T.nilable(::Prism::Location), end_loc: T.nilable(::Prism::Location)).void }
+  def add_matching_end_highlights(keyword_loc, end_loc); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#631
+  sig { params(location: ::Prism::Location).returns(T::Boolean) }
+  def covers_target_position?(location); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#584
+  sig { params(node: ::Prism::Node, classes: T::Array[T.class_of(Prism::Node)]).returns(T.nilable(T::Boolean)) }
+  def matches?(node, classes); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#594
+  sig { params(node: T.nilable(::Prism::Node)).returns(T.nilable(::String)) }
+  def node_value(node); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#58
+RubyLsp::Listeners::DocumentHighlight::CLASS_VARIABLE_NODES = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#34
+RubyLsp::Listeners::DocumentHighlight::CONSTANT_NODES = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#46
+RubyLsp::Listeners::DocumentHighlight::CONSTANT_PATH_NODES = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#10
+RubyLsp::Listeners::DocumentHighlight::GLOBAL_VARIABLE_NODES = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#22
+RubyLsp::Listeners::DocumentHighlight::INSTANCE_VARIABLE_NODES = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/document_highlight.rb#70
+RubyLsp::Listeners::DocumentHighlight::LOCAL_NODES = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/document_link.rb#8
+class RubyLsp::Listeners::DocumentLink
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_link.rb#68
+  sig do
+    params(
+      response_builder: RubyLsp::ResponseBuilders::CollectionResponseBuilder[::LanguageServer::Protocol::Interface::DocumentLink],
+      uri: ::URI::Generic,
+      comments: T::Array[::Prism::Comment],
+      dispatcher: ::Prism::Dispatcher
+    ).void
+  end
+  def initialize(response_builder, uri, comments, dispatcher); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_link.rb#98
+  sig { params(node: ::Prism::ClassNode).void }
+  def on_class_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_link.rb#113
+  sig { params(node: ::Prism::ConstantPathWriteNode).void }
+  def on_constant_path_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_link.rb#108
+  sig { params(node: ::Prism::ConstantWriteNode).void }
+  def on_constant_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_link.rb#93
+  sig { params(node: ::Prism::DefNode).void }
+  def on_def_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_link.rb#103
+  sig { params(node: ::Prism::ModuleNode).void }
+  def on_module_node_enter(node); end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_link.rb#120
+  sig { params(node: ::Prism::Node).void }
+  def extract_document_link(node); end
+
+  # Try to figure out the gem version for a source:// link. The order of precedence is:
+  # 1. The version in the URI
+  # 2. The version in the RBI file name
+  # 3. The version from the gemspec
+  #
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_link.rb#146
+  sig { params(uri: ::URI::Source).returns(T.nilable(::String)) }
+  def resolve_version(uri); end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/listeners/document_link.rb#23
+    sig { returns(T::Hash[::String, T::Hash[::String, T::Hash[::String, ::String]]]) }
+    def gem_paths; end
+  end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/document_link.rb#12
+RubyLsp::Listeners::DocumentLink::GEM_TO_VERSION_MAP = T.let(T.unsafe(nil), Hash)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#6
+class RubyLsp::Listeners::DocumentSymbol
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#19
+  sig do
+    params(
+      response_builder: RubyLsp::ResponseBuilders::DocumentSymbol,
+      uri: ::URI::Generic,
+      dispatcher: ::Prism::Dispatcher
+    ).void
+  end
+  def initialize(response_builder, uri, dispatcher); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#273
+  sig { params(node: ::Prism::AliasMethodNode).void }
+  def on_alias_method_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#84
+  sig { params(node: ::Prism::CallNode).void }
+  def on_call_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#98
+  sig { params(node: ::Prism::CallNode).void }
+  def on_call_node_leave(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#52
+  sig { params(node: ::Prism::ClassNode).void }
+  def on_class_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#62
+  sig { params(node: ::Prism::ClassNode).void }
+  def on_class_node_leave(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#263
+  sig { params(node: ::Prism::ClassVariableWriteNode).void }
+  def on_class_variable_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#167
+  sig { params(node: ::Prism::ConstantAndWriteNode).void }
+  def on_constant_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#177
+  sig { params(node: ::Prism::ConstantOperatorWriteNode).void }
+  def on_constant_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#157
+  sig { params(node: ::Prism::ConstantOrWriteNode).void }
+  def on_constant_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#127
+  sig { params(node: ::Prism::ConstantPathAndWriteNode).void }
+  def on_constant_path_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#147
+  sig { params(node: ::Prism::ConstantPathOperatorWriteNode).void }
+  def on_constant_path_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#137
+  sig { params(node: ::Prism::ConstantPathOrWriteNode).void }
+  def on_constant_path_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#197
+  sig { params(node: ::Prism::ConstantPathTargetNode).void }
+  def on_constant_path_target_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#107
+  sig { params(node: ::Prism::ConstantPathWriteNode).void }
+  def on_constant_path_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#187
+  sig { params(node: ::Prism::ConstantTargetNode).void }
+  def on_constant_target_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#117
+  sig { params(node: ::Prism::ConstantWriteNode).void }
+  def on_constant_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#222
+  sig { params(node: ::Prism::DefNode).void }
+  def on_def_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#207
+  sig { params(node: ::Prism::DefNode).void }
+  def on_def_node_leave(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#253
+  sig { params(node: ::Prism::InstanceVariableWriteNode).void }
+  def on_instance_variable_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#212
+  sig { params(node: ::Prism::ModuleNode).void }
+  def on_module_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#248
+  sig { params(node: ::Prism::ModuleNode).void }
+  def on_module_node_leave(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#67
+  sig { params(node: ::Prism::SingletonClassNode).void }
+  def on_singleton_class_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#79
+  sig { params(node: ::Prism::SingletonClassNode).void }
+  def on_singleton_class_node_leave(node); end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#298
+  sig do
+    params(
+      name: ::String,
+      kind: ::Integer,
+      range_location: ::Prism::Location,
+      selection_range_location: ::Prism::Location
+    ).returns(::LanguageServer::Protocol::Interface::DocumentSymbol)
+  end
+  def create_document_symbol(name:, kind:, range_location:, selection_range_location:); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#347
+  sig { params(node: ::Prism::CallNode).void }
+  def handle_alias_method(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#314
+  sig { params(node: ::Prism::CallNode).void }
+  def handle_attr_accessor(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#380
+  sig { params(node: ::Prism::CallNode).void }
+  def handle_rake_namespace(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#406
+  sig { params(node: ::Prism::CallNode).void }
+  def handle_rake_task(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#441
+  sig { returns(T::Boolean) }
+  def rake?; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/document_symbol.rb#10
+RubyLsp::Listeners::DocumentSymbol::ATTR_ACCESSORS = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#6
+class RubyLsp::Listeners::FoldingRanges
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#17
+  sig do
+    params(
+      response_builder: RubyLsp::ResponseBuilders::CollectionResponseBuilder[::LanguageServer::Protocol::Interface::FoldingRange],
+      comments: T::Array[::Prism::Comment],
+      dispatcher: ::Prism::Dispatcher
+    ).void
+  end
+  def initialize(response_builder, comments, dispatcher); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#51
+  sig { void }
+  def finalize_response!; end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#85
+  sig { params(node: ::Prism::ArrayNode).void }
+  def on_array_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#155
+  sig { params(node: ::Prism::BeginNode).void }
+  def on_begin_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#90
+  sig { params(node: ::Prism::BlockNode).void }
+  def on_block_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#175
+  sig { params(node: ::Prism::CallNode).void }
+  def on_call_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#100
+  sig { params(node: ::Prism::CaseMatchNode).void }
+  def on_case_match_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#95
+  sig { params(node: ::Prism::CaseNode).void }
+  def on_case_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#105
+  sig { params(node: ::Prism::ClassNode).void }
+  def on_class_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#160
+  sig { params(node: ::Prism::DefNode).void }
+  def on_def_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#145
+  sig { params(node: ::Prism::ElseNode).void }
+  def on_else_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#150
+  sig { params(node: ::Prism::EnsureNode).void }
+  def on_ensure_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#115
+  sig { params(node: ::Prism::ForNode).void }
+  def on_for_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#120
+  sig { params(node: ::Prism::HashNode).void }
+  def on_hash_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#57
+  sig { params(node: ::Prism::IfNode).void }
+  def on_if_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#62
+  sig { params(node: ::Prism::InNode).void }
+  def on_in_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#77
+  sig { params(node: ::Prism::InterpolatedStringNode).void }
+  def on_interpolated_string_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#188
+  sig { params(node: ::Prism::LambdaNode).void }
+  def on_lambda_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#110
+  sig { params(node: ::Prism::ModuleNode).void }
+  def on_module_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#67
+  sig { params(node: ::Prism::RescueNode).void }
+  def on_rescue_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#125
+  sig { params(node: ::Prism::SingletonClassNode).void }
+  def on_singleton_class_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#130
+  sig { params(node: ::Prism::UnlessNode).void }
+  def on_unless_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#135
+  sig { params(node: ::Prism::UntilNode).void }
+  def on_until_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#72
+  sig { params(node: ::Prism::WhenNode).void }
+  def on_when_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#140
+  sig { params(node: ::Prism::WhileNode).void }
+  def on_while_node_enter(node); end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#255
+  sig { params(start_line: ::Integer, end_line: ::Integer).void }
+  def add_lines_range(start_line, end_line); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#249
+  sig { params(node: ::Prism::Node).void }
+  def add_simple_range(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#238
+  sig { params(node: T.any(::Prism::IfNode, ::Prism::InNode, ::Prism::RescueNode, ::Prism::WhenNode)).void }
+  def add_statements_range(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#211
+  sig { void }
+  def emit_requires_range; end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#195
+  sig { void }
+  def push_comment_ranges; end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/folding_ranges.rb#224
+  sig { params(node: ::Prism::CallNode).returns(T::Boolean) }
+  def require?(node); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#6
+class RubyLsp::Listeners::Hover
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#56
+  sig do
+    params(
+      response_builder: RubyLsp::ResponseBuilders::Hover,
+      global_state: ::RubyLsp::GlobalState,
+      uri: ::URI::Generic,
+      node_context: ::RubyLsp::NodeContext,
+      dispatcher: ::Prism::Dispatcher,
+      sorbet_level: ::RubyLsp::RubyDocument::SorbetLevel
+    ).void
+  end
+  def initialize(response_builder, global_state, uri, node_context, dispatcher, sorbet_level); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#129
+  sig { params(node: ::Prism::CallNode).void }
+  def on_call_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#119
+  sig { params(node: ::Prism::ConstantPathNode).void }
+  def on_constant_path_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#102
+  sig { params(node: ::Prism::ConstantReadNode).void }
+  def on_constant_read_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#112
+  sig { params(node: ::Prism::ConstantWriteNode).void }
+  def on_constant_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#209
+  sig { params(node: ::Prism::ForwardingSuperNode).void }
+  def on_forwarding_super_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#144
+  sig { params(node: ::Prism::GlobalVariableAndWriteNode).void }
+  def on_global_variable_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#149
+  sig { params(node: ::Prism::GlobalVariableOperatorWriteNode).void }
+  def on_global_variable_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#154
+  sig { params(node: ::Prism::GlobalVariableOrWriteNode).void }
+  def on_global_variable_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#159
+  sig { params(node: ::Prism::GlobalVariableReadNode).void }
+  def on_global_variable_read_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#164
+  sig { params(node: ::Prism::GlobalVariableTargetNode).void }
+  def on_global_variable_target_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#169
+  sig { params(node: ::Prism::GlobalVariableWriteNode).void }
+  def on_global_variable_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#184
+  sig { params(node: ::Prism::InstanceVariableAndWriteNode).void }
+  def on_instance_variable_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#189
+  sig { params(node: ::Prism::InstanceVariableOperatorWriteNode).void }
+  def on_instance_variable_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#194
+  sig { params(node: ::Prism::InstanceVariableOrWriteNode).void }
+  def on_instance_variable_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#174
+  sig { params(node: ::Prism::InstanceVariableReadNode).void }
+  def on_instance_variable_read_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#199
+  sig { params(node: ::Prism::InstanceVariableTargetNode).void }
+  def on_instance_variable_target_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#179
+  sig { params(node: ::Prism::InstanceVariableWriteNode).void }
+  def on_instance_variable_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#97
+  sig { params(node: ::Prism::InterpolatedStringNode).void }
+  def on_interpolated_string_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#92
+  sig { params(node: ::Prism::StringNode).void }
+  def on_string_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#204
+  sig { params(node: ::Prism::SuperNode).void }
+  def on_super_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#214
+  sig { params(node: ::Prism::YieldNode).void }
+  def on_yield_node_enter(node); end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#336
+  sig { params(node: ::Prism::CallNode).void }
+  def generate_gem_hover(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#221
+  sig { params(node: T.any(::Prism::InterpolatedStringNode, ::Prism::StringNode)).void }
+  def generate_heredoc_hover(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#321
+  sig { params(name: ::String, location: ::Prism::Location).void }
+  def generate_hover(name, location); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#311
+  sig { params(name: ::String).void }
+  def handle_global_variable_hover(name); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#292
+  sig { params(name: ::String).void }
+  def handle_instance_variable_hover(name); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#246
+  sig { params(keyword: ::String).void }
+  def handle_keyword_documentation(keyword); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#269
+  sig { params(message: ::String, inherited_only: T::Boolean).void }
+  def handle_method_hover(message, inherited_only: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#258
+  sig { void }
+  def handle_super_node_hover; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#38
+RubyLsp::Listeners::Hover::ALLOWED_REMOTE_PROVIDERS = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/hover.rb#10
+RubyLsp::Listeners::Hover::ALLOWED_TARGETS = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/inlay_hints.rb#6
+class RubyLsp::Listeners::InlayHints
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/inlay_hints.rb#19
+  sig do
+    params(
+      response_builder: RubyLsp::ResponseBuilders::CollectionResponseBuilder[::LanguageServer::Protocol::Interface::InlayHint],
+      hints_configuration: ::RubyLsp::RequestConfig,
+      dispatcher: ::Prism::Dispatcher
+    ).void
+  end
+  def initialize(response_builder, hints_configuration, dispatcher); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/inlay_hints.rb#42
+  sig { params(node: ::Prism::ImplicitNode).void }
+  def on_implicit_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/inlay_hints.rb#27
+  sig { params(node: ::Prism::RescueNode).void }
+  def on_rescue_node_enter(node); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/inlay_hints.rb#10
+RubyLsp::Listeners::InlayHints::RESCUE_STRING_LENGTH = T.let(T.unsafe(nil), Integer)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#6
+class RubyLsp::Listeners::SemanticHighlighting
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#27
+  sig do
+    params(
+      dispatcher: ::Prism::Dispatcher,
+      response_builder: RubyLsp::ResponseBuilders::SemanticHighlighting
+    ).void
+  end
+  def initialize(dispatcher, response_builder); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#124
+  sig { params(node: ::Prism::BlockLocalVariableNode).void }
+  def on_block_local_variable_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#114
+  sig { params(node: ::Prism::BlockNode).void }
+  def on_block_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#119
+  sig { params(node: ::Prism::BlockNode).void }
+  def on_block_node_leave(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#129
+  sig { params(node: ::Prism::BlockParameterNode).void }
+  def on_block_parameter_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#66
+  sig { params(node: ::Prism::CallNode).void }
+  def on_call_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#222
+  sig { params(node: ::Prism::ClassNode).void }
+  def on_class_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#104
+  sig { params(node: ::Prism::DefNode).void }
+  def on_def_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#109
+  sig { params(node: ::Prism::DefNode).void }
+  def on_def_node_leave(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#282
+  sig { params(node: ::Prism::ImplicitNode).void }
+  def on_implicit_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#287
+  sig { params(node: ::Prism::ImplicitNode).void }
+  def on_implicit_node_leave(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#145
+  sig { params(node: ::Prism::KeywordRestParameterNode).void }
+  def on_keyword_rest_parameter_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#192
+  sig { params(node: ::Prism::LocalVariableAndWriteNode).void }
+  def on_local_variable_and_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#198
+  sig { params(node: ::Prism::LocalVariableOperatorWriteNode).void }
+  def on_local_variable_operator_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#204
+  sig { params(node: ::Prism::LocalVariableOrWriteNode).void }
+  def on_local_variable_or_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#178
+  sig { params(node: ::Prism::LocalVariableReadNode).void }
+  def on_local_variable_read_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#210
+  sig { params(node: ::Prism::LocalVariableTargetNode).void }
+  def on_local_variable_target_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#172
+  sig { params(node: ::Prism::LocalVariableWriteNode).void }
+  def on_local_variable_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#89
+  sig { params(node: ::Prism::MatchWriteNode).void }
+  def on_match_write_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#99
+  sig { params(node: ::Prism::MatchWriteNode).void }
+  def on_match_write_node_leave(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#261
+  sig { params(node: ::Prism::ModuleNode).void }
+  def on_module_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#140
+  sig { params(node: ::Prism::OptionalKeywordParameterNode).void }
+  def on_optional_keyword_parameter_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#151
+  sig { params(node: ::Prism::OptionalParameterNode).void }
+  def on_optional_parameter_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#135
+  sig { params(node: ::Prism::RequiredKeywordParameterNode).void }
+  def on_required_keyword_parameter_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#156
+  sig { params(node: ::Prism::RequiredParameterNode).void }
+  def on_required_parameter_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#161
+  sig { params(node: ::Prism::RestParameterNode).void }
+  def on_rest_parameter_node_enter(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#167
+  sig { params(node: ::Prism::SelfNode).void }
+  def on_self_node_enter(node); end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#301
+  sig { params(node: ::Prism::CallNode).void }
+  def process_regexp_locals(node); end
+
+  # Textmate provides highlighting for a subset of these special Ruby-specific methods.  We want to utilize that
+  # highlighting, so we avoid making a semantic token for it.
+  #
+  # source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#296
+  sig { params(method_name: ::String).returns(T::Boolean) }
+  def special_method?(method_name); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/semantic_highlighting.rb#10
+RubyLsp::Listeners::SemanticHighlighting::SPECIAL_RUBY_METHODS = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp/lib/ruby_lsp/listeners/signature_help.rb#6
+class RubyLsp::Listeners::SignatureHelp
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/signature_help.rb#19
+  sig do
+    params(
+      response_builder: RubyLsp::ResponseBuilders::SignatureHelp,
+      global_state: ::RubyLsp::GlobalState,
+      node_context: ::RubyLsp::NodeContext,
+      dispatcher: ::Prism::Dispatcher,
+      sorbet_level: ::RubyLsp::RubyDocument::SorbetLevel
+    ).void
+  end
+  def initialize(response_builder, global_state, node_context, dispatcher, sorbet_level); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/signature_help.rb#30
+  sig { params(node: ::Prism::CallNode).void }
+  def on_call_node_enter(node); end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/signature_help.rb#73
+  sig do
+    params(
+      node: ::Prism::CallNode,
+      signatures: T::Array[::RubyIndexer::Entry::Signature]
+    ).returns([::Integer, ::Integer])
+  end
+  def determine_active_signature_and_parameter(node, signatures); end
+
+  # source://ruby-lsp/lib/ruby_lsp/listeners/signature_help.rb#105
+  sig do
+    params(
+      signatures: T::Array[::RubyIndexer::Entry::Signature],
+      method_name: ::String,
+      methods: T::Array[::RubyIndexer::Entry],
+      title: ::String,
+      extra_links: T.nilable(::String)
+    ).returns(T::Array[::LanguageServer::Protocol::Interface::SignatureInformation])
+  end
+  def generate_signatures(signatures, method_name, methods, title, extra_links); end
+end
+
+# A notification to be sent to the client
+#
+# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
+#
+# source://ruby-lsp/lib/ruby_lsp/utils.rb#41
+class RubyLsp::Message
+  abstract!
+
+  # source://ruby-lsp/lib/ruby_lsp/utils.rb#54
+  sig { params(method: ::String, params: ::Object).void }
+  def initialize(method:, params:); end
+
+  # source://ruby-lsp/lib/ruby_lsp/utils.rb#46
+  sig { returns(::String) }
+  def method; end
+
+  # source://ruby-lsp/lib/ruby_lsp/utils.rb#49
+  sig { returns(::Object) }
+  def params; end
+
+  # @abstract
+  #
+  # source://ruby-lsp/lib/ruby_lsp/utils.rb#60
+  sig { abstract.returns(T::Hash[::Symbol, T.untyped]) }
+  def to_hash; end
+end
+
+# This class allows listeners to access contextual information about a node in the AST, such as its parent,
+# its namespace nesting, and the surrounding CallNode (e.g. a method call).
+#
+# source://ruby-lsp/lib/ruby_lsp/node_context.rb#7
+class RubyLsp::NodeContext
+  # source://ruby-lsp/lib/ruby_lsp/node_context.rb#38
+  sig do
+    params(
+      node: T.nilable(::Prism::Node),
+      parent: T.nilable(::Prism::Node),
+      nesting_nodes: T::Array[T.any(::Prism::BlockNode, ::Prism::ClassNode, ::Prism::DefNode, ::Prism::LambdaNode, ::Prism::ModuleNode, ::Prism::ProgramNode, ::Prism::SingletonClassNode)],
+      call_node: T.nilable(::Prism::CallNode)
+    ).void
+  end
+  def initialize(node, parent, nesting_nodes, call_node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/node_context.rb#17
+  sig { returns(T.nilable(::Prism::CallNode)) }
+  def call_node; end
+
+  # source://ruby-lsp/lib/ruby_lsp/node_context.rb#50
+  sig { returns(::String) }
+  def fully_qualified_name; end
+
+  # source://ruby-lsp/lib/ruby_lsp/node_context.rb#55
+  sig { returns(T::Array[::Symbol]) }
+  def locals_for_scope; end
+
+  # source://ruby-lsp/lib/ruby_lsp/node_context.rb#14
+  sig { returns(T::Array[::String]) }
+  def nesting; end
+
+  # source://ruby-lsp/lib/ruby_lsp/node_context.rb#11
+  sig { returns(T.nilable(::Prism::Node)) }
+  def node; end
+
+  # @return [Prism::Node, nil]
+  #
+  # source://ruby-lsp/lib/ruby_lsp/node_context.rb#11
+  def parent; end
+
+  # source://ruby-lsp/lib/ruby_lsp/node_context.rb#20
+  sig { returns(T.nilable(::String)) }
+  def surrounding_method; end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/node_context.rb#83
+  sig do
+    params(
+      nodes: T::Array[T.any(::Prism::BlockNode, ::Prism::ClassNode, ::Prism::DefNode, ::Prism::LambdaNode, ::Prism::ModuleNode, ::Prism::ProgramNode, ::Prism::SingletonClassNode)]
+    ).returns([T::Array[::String], T.nilable(::String)])
+  end
+  def handle_nesting_nodes(nodes); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/utils.rb#63
+class RubyLsp::Notification < ::RubyLsp::Message
+  # source://ruby-lsp/lib/ruby_lsp/utils.rb#150
+  sig { override.returns(T::Hash[::Symbol, T.untyped]) }
+  def to_hash; end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/utils.rb#99
+    sig do
+      params(
+        id: ::String,
+        title: ::String,
+        percentage: T.nilable(::Integer),
+        message: T.nilable(::String)
+      ).returns(::RubyLsp::Notification)
+    end
+    def progress_begin(id, title, percentage: T.unsafe(nil), message: T.unsafe(nil)); end
+
+    # source://ruby-lsp/lib/ruby_lsp/utils.rb#136
+    sig { params(id: ::String).returns(::RubyLsp::Notification) }
+    def progress_end(id); end
+
+    # source://ruby-lsp/lib/ruby_lsp/utils.rb#121
+    sig do
+      params(
+        id: ::String,
+        percentage: T.nilable(::Integer),
+        message: T.nilable(::String)
+      ).returns(::RubyLsp::Notification)
+    end
+    def progress_report(id, percentage: T.unsafe(nil), message: T.unsafe(nil)); end
+
+    # source://ruby-lsp/lib/ruby_lsp/utils.rb#84
+    sig { params(data: T::Hash[::Symbol, T.untyped]).returns(::RubyLsp::Notification) }
+    def telemetry(data); end
+
+    # source://ruby-lsp/lib/ruby_lsp/utils.rb#76
+    sig { params(message: ::String, type: ::Integer).returns(::RubyLsp::Notification) }
+    def window_log_message(message, type: T.unsafe(nil)); end
+
+    # source://ruby-lsp/lib/ruby_lsp/utils.rb#68
+    sig { params(message: ::String, type: ::Integer).returns(::RubyLsp::Notification) }
+    def window_show_message(message, type: T.unsafe(nil)); end
+  end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/rbs_document.rb#5
+class RubyLsp::RBSDocument < ::RubyLsp::Document
+  extend T::Generic
+
+  ParseResultType = type_member { { fixed: T::Array[::RBS::AST::Declarations::Base] } }
+
+  # source://ruby-lsp/lib/ruby_lsp/rbs_document.rb#12
+  sig { params(source: ::String, version: ::Integer, uri: ::URI::Generic, encoding: ::Encoding).void }
+  def initialize(source:, version:, uri:, encoding: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/rbs_document.rb#38
+  sig { override.returns(::RubyLsp::Document::LanguageId) }
+  def language_id; end
+
+  # source://ruby-lsp/lib/ruby_lsp/rbs_document.rb#18
+  sig { override.returns(T::Boolean) }
+  def parse!; end
+
+  # source://ruby-lsp/lib/ruby_lsp/rbs_document.rb#33
+  sig { override.returns(T::Boolean) }
+  def syntax_error?; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/utils.rb#155
+class RubyLsp::Request < ::RubyLsp::Message
+  # source://ruby-lsp/lib/ruby_lsp/utils.rb#159
+  sig { params(id: T.any(::Integer, ::String), method: ::String, params: ::Object).void }
+  def initialize(id:, method:, params:); end
+
+  # source://ruby-lsp/lib/ruby_lsp/utils.rb#165
+  sig { override.returns(T::Hash[::Symbol, T.untyped]) }
+  def to_hash; end
+end
+
+# A request configuration, to turn on/off features
+#
+# source://ruby-lsp/lib/ruby_lsp/utils.rb#220
+class RubyLsp::RequestConfig
+  # source://ruby-lsp/lib/ruby_lsp/utils.rb#227
+  sig { params(configuration: T::Hash[::Symbol, T::Boolean]).void }
+  def initialize(configuration); end
+
+  # source://ruby-lsp/lib/ruby_lsp/utils.rb#224
+  sig { returns(T::Hash[::Symbol, T::Boolean]) }
+  def configuration; end
+
+  # @return [Hash{Symbol => Boolean}]
+  #
+  # source://ruby-lsp/lib/ruby_lsp/utils.rb#224
+  def configuration=(_arg0); end
+
+  # source://ruby-lsp/lib/ruby_lsp/utils.rb#232
+  sig { params(feature: ::Symbol).returns(T.nilable(T::Boolean)) }
+  def enabled?(feature); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/support/selection_range.rb#5
+module RubyLsp::Requests; end
+
+# The [code action resolve](https://microsoft.github.io/language-server-protocol/specification#codeAction_resolve)
+# request is used to to resolve the edit field for a given code action, if it is not already provided in the
+# textDocument/codeAction response. We can use it for scenarios that require more computation such as refactoring.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/code_action_resolve.rb#9
+class RubyLsp::Requests::CodeActionResolve < ::RubyLsp::Requests::Request
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/code_action_resolve.rb#27
+  sig do
+    params(
+      document: RubyLsp::RubyDocument,
+      global_state: ::RubyLsp::GlobalState,
+      code_action: T::Hash[::Symbol, T.untyped]
+    ).void
+  end
+  def initialize(document, global_state, code_action); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/code_action_resolve.rb#35
+  sig do
+    override
+      .returns(T.any(::LanguageServer::Protocol::Interface::CodeAction, ::RubyLsp::Requests::CodeActionResolve::Error))
+  end
+  def perform; end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/code_action_resolve.rb#265
+  sig do
+    params(
+      range: T::Hash[::Symbol, T.untyped],
+      new_text: ::String
+    ).returns(::LanguageServer::Protocol::Interface::TextEdit)
+  end
+  def create_text_edit(range, new_text); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/code_action_resolve.rb#276
+  sig { params(node: ::Prism::BlockNode, indentation: T.nilable(::String)).returns(::String) }
+  def recursively_switch_nested_block_styles(node, indentation); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/code_action_resolve.rb#191
+  sig do
+    returns(T.any(::LanguageServer::Protocol::Interface::CodeAction, ::RubyLsp::Requests::CodeActionResolve::Error))
+  end
+  def refactor_method; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/code_action_resolve.rb#91
+  sig do
+    returns(T.any(::LanguageServer::Protocol::Interface::CodeAction, ::RubyLsp::Requests::CodeActionResolve::Error))
+  end
+  def refactor_variable; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/code_action_resolve.rb#305
+  sig { params(body: ::Prism::Node, indentation: T.nilable(::String)).returns(::String) }
+  def switch_block_body(body, indentation); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/code_action_resolve.rb#53
+  sig do
+    returns(T.any(::LanguageServer::Protocol::Interface::CodeAction, ::RubyLsp::Requests::CodeActionResolve::Error))
+  end
+  def switch_block_style; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/code_action_resolve.rb#16
+class RubyLsp::Requests::CodeActionResolve::CodeActionError < ::StandardError; end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/code_action_resolve.rb#18
+class RubyLsp::Requests::CodeActionResolve::Error < ::T::Enum
+  enums do
+    EmptySelection = new
+    InvalidTargetRange = new
+    UnknownCodeAction = new
+  end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/code_action_resolve.rb#14
+RubyLsp::Requests::CodeActionResolve::NEW_METHOD_NAME = T.let(T.unsafe(nil), String)
+
+# source://ruby-lsp/lib/ruby_lsp/requests/code_action_resolve.rb#13
+RubyLsp::Requests::CodeActionResolve::NEW_VARIABLE_NAME = T.let(T.unsafe(nil), String)
+
+# The [code actions](https://microsoft.github.io/language-server-protocol/specification#textDocument_codeAction)
+# request informs the editor of RuboCop quick fixes that can be applied. These are accessible by hovering over a
+# specific diagnostic.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/code_actions.rb#9
+class RubyLsp::Requests::CodeActions < ::RubyLsp::Requests::Request
+  # source://ruby-lsp/lib/ruby_lsp/requests/code_actions.rb#35
+  sig do
+    params(
+      document: T.any(RubyLsp::ERBDocument, RubyLsp::RubyDocument),
+      range: T::Hash[::Symbol, T.untyped],
+      context: T::Hash[::Symbol, T.untyped]
+    ).void
+  end
+  def initialize(document, range, context); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/code_actions.rb#44
+  sig { override.returns(T.nilable(T.all(::Object, T::Array[::LanguageServer::Protocol::Interface::CodeAction]))) }
+  def perform; end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/requests/code_actions.rb#20
+    sig { returns(::LanguageServer::Protocol::Interface::CodeActionRegistrationOptions) }
+    def provider; end
+  end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/code_actions.rb#13
+RubyLsp::Requests::CodeActions::EXTRACT_TO_METHOD_TITLE = T.let(T.unsafe(nil), String)
+
+# source://ruby-lsp/lib/ruby_lsp/requests/code_actions.rb#12
+RubyLsp::Requests::CodeActions::EXTRACT_TO_VARIABLE_TITLE = T.let(T.unsafe(nil), String)
+
+# source://ruby-lsp/lib/ruby_lsp/requests/code_actions.rb#14
+RubyLsp::Requests::CodeActions::TOGGLE_BLOCK_STYLE_TITLE = T.let(T.unsafe(nil), String)
+
+# The
+# [code lens](https://microsoft.github.io/language-server-protocol/specification#textDocument_codeLens)
+# request informs the editor of runnable commands such as testing and debugging.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/code_lens.rb#13
+class RubyLsp::Requests::CodeLens < ::RubyLsp::Requests::Request
+  # source://ruby-lsp/lib/ruby_lsp/requests/code_lens.rb#32
+  sig { params(global_state: ::RubyLsp::GlobalState, uri: ::URI::Generic, dispatcher: ::Prism::Dispatcher).void }
+  def initialize(global_state, uri, dispatcher); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/code_lens.rb#46
+  sig { override.returns(T::Array[::LanguageServer::Protocol::Interface::CodeLens]) }
+  def perform; end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/requests/code_lens.rb#20
+    sig { returns(::LanguageServer::Protocol::Interface::CodeLensOptions) }
+    def provider; end
+  end
+end
+
+# The [completion](https://microsoft.github.io/language-server-protocol/specification#textDocument_completion)
+# suggests possible completions according to what the developer is typing.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/completion.rb#10
+class RubyLsp::Requests::Completion < ::RubyLsp::Requests::Request
+  # source://ruby-lsp/lib/ruby_lsp/requests/completion.rb#37
+  sig do
+    params(
+      document: T.any(RubyLsp::ERBDocument, RubyLsp::RubyDocument),
+      global_state: ::RubyLsp::GlobalState,
+      params: T::Hash[::Symbol, T.untyped],
+      sorbet_level: ::RubyLsp::RubyDocument::SorbetLevel,
+      dispatcher: ::Prism::Dispatcher
+    ).void
+  end
+  def initialize(document, global_state, params, sorbet_level, dispatcher); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/completion.rb#99
+  sig { override.returns(T::Array[::LanguageServer::Protocol::Interface::CompletionItem]) }
+  def perform; end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/requests/completion.rb#17
+    sig { returns(::LanguageServer::Protocol::Interface::CompletionOptions) }
+    def provider; end
+  end
+end
+
+# The [completionItem/resolve](https://microsoft.github.io/language-server-protocol/specification#completionItem_resolve)
+# request provides additional information about the currently selected completion. Specifically, the `labelDetails`
+# and `documentation` fields are provided, which are omitted from the completion items returned by
+# `textDocument/completion`.
+#
+# The `labelDetails` field lists the files where the completion item is defined, and the `documentation` field
+# includes any available documentation for those definitions.
+#
+# At most 10 definitions are included, to ensure low latency during request processing and rendering the completion
+# item.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/completion_resolve.rb#16
+class RubyLsp::Requests::CompletionResolve < ::RubyLsp::Requests::Request
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/completion_resolve.rb#25
+  sig { params(global_state: ::RubyLsp::GlobalState, item: T::Hash[::Symbol, T.untyped]).void }
+  def initialize(global_state, item); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/completion_resolve.rb#32
+  sig { override.returns(T::Hash[::Symbol, T.untyped]) }
+  def perform; end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/completion_resolve.rb#81
+  sig { params(item: T::Hash[::Symbol, T.untyped]).returns(T::Hash[::Symbol, T.untyped]) }
+  def keyword_resolve(item); end
+end
+
+# set a limit on the number of documentation entries returned, to avoid rendering performance issues
+# https://github.com/Shopify/ruby-lsp/pull/1798
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/completion_resolve.rb#22
+RubyLsp::Requests::CompletionResolve::MAX_DOCUMENTATION_ENTRIES = T.let(T.unsafe(nil), Integer)
+
+# The [definition
+# request](https://microsoft.github.io/language-server-protocol/specification#textDocument_definition) jumps to the
+# definition of the symbol under the cursor.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/definition.rb#11
+class RubyLsp::Requests::Definition < ::RubyLsp::Requests::Request
+  # source://ruby-lsp/lib/ruby_lsp/requests/definition.rb#24
+  sig do
+    params(
+      document: T.any(RubyLsp::ERBDocument, RubyLsp::RubyDocument),
+      global_state: ::RubyLsp::GlobalState,
+      position: T::Hash[::Symbol, T.untyped],
+      dispatcher: ::Prism::Dispatcher,
+      sorbet_level: ::RubyLsp::RubyDocument::SorbetLevel
+    ).void
+  end
+  def initialize(document, global_state, position, dispatcher, sorbet_level); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/definition.rb#101
+  sig do
+    override
+      .returns(T::Array[T.any(::LanguageServer::Protocol::Interface::Location, ::LanguageServer::Protocol::Interface::LocationLink)])
+  end
+  def perform; end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/definition.rb#109
+  sig { params(position: T::Hash[::Symbol, T.untyped], target: T.nilable(::Prism::Node)).returns(T::Boolean) }
+  def position_outside_target?(position, target); end
+end
+
+# The
+# [diagnostics](https://microsoft.github.io/language-server-protocol/specification#textDocument_publishDiagnostics)
+# request informs the editor of RuboCop offenses for a given file.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/diagnostics.rb#9
+class RubyLsp::Requests::Diagnostics < ::RubyLsp::Requests::Request
+  # source://ruby-lsp/lib/ruby_lsp/requests/diagnostics.rb#26
+  sig { params(global_state: ::RubyLsp::GlobalState, document: RubyLsp::RubyDocument).void }
+  def initialize(global_state, document); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/diagnostics.rb#34
+  sig { override.returns(T.nilable(T.all(::Object, T::Array[::LanguageServer::Protocol::Interface::Diagnostic]))) }
+  def perform; end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/diagnostics.rb#77
+  sig { returns(T::Array[::LanguageServer::Protocol::Interface::Diagnostic]) }
+  def syntax_error_diagnostics; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/diagnostics.rb#54
+  sig { returns(T::Array[::LanguageServer::Protocol::Interface::Diagnostic]) }
+  def syntax_warning_diagnostics; end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/requests/diagnostics.rb#16
+    sig { returns(::LanguageServer::Protocol::Interface::DiagnosticRegistrationOptions) }
+    def provider; end
+  end
+end
+
+# The [document highlight](https://microsoft.github.io/language-server-protocol/specification#textDocument_documentHighlight)
+# informs the editor all relevant elements of the currently pointed item for highlighting. For example, when
+# the cursor is on the `F` of the constant `FOO`, the editor should identify other occurrences of `FOO`
+# and highlight them.
+#
+# For writable elements like constants or variables, their read/write occurrences should be highlighted differently.
+# This is achieved by sending different "kind" attributes to the editor (2 for read and 3 for write).
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/document_highlight.rb#15
+class RubyLsp::Requests::DocumentHighlight < ::RubyLsp::Requests::Request
+  # source://ruby-lsp/lib/ruby_lsp/requests/document_highlight.rb#26
+  sig do
+    params(
+      global_state: ::RubyLsp::GlobalState,
+      document: T.any(RubyLsp::ERBDocument, RubyLsp::RubyDocument),
+      position: T::Hash[::Symbol, T.untyped],
+      dispatcher: ::Prism::Dispatcher
+    ).void
+  end
+  def initialize(global_state, document, position, dispatcher); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/document_highlight.rb#51
+  sig { override.returns(T::Array[::LanguageServer::Protocol::Interface::DocumentHighlight]) }
+  def perform; end
+end
+
+# The [document link](https://microsoft.github.io/language-server-protocol/specification#textDocument_documentLink)
+# makes `# source://PATH_TO_FILE#line` comments in a Ruby/RBI file clickable if the file exists.
+# When the user clicks the link, it'll open that location.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/document_link.rb#11
+class RubyLsp::Requests::DocumentLink < ::RubyLsp::Requests::Request
+  # source://ruby-lsp/lib/ruby_lsp/requests/document_link.rb#30
+  sig { params(uri: ::URI::Generic, comments: T::Array[::Prism::Comment], dispatcher: ::Prism::Dispatcher).void }
+  def initialize(uri, comments, dispatcher); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/document_link.rb#40
+  sig { override.returns(T::Array[::LanguageServer::Protocol::Interface::DocumentLink]) }
+  def perform; end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/requests/document_link.rb#18
+    sig { returns(::LanguageServer::Protocol::Interface::DocumentLinkOptions) }
+    def provider; end
+  end
+end
+
+# The [document
+# symbol](https://microsoft.github.io/language-server-protocol/specification#textDocument_documentSymbol) request
+# informs the editor of all the important symbols, such as classes, variables, and methods, defined in a file. With
+# this information, the editor can populate breadcrumbs, file outline and allow for fuzzy symbol searches.
+#
+# In VS Code, symbol search known as 'Go To Symbol in Editor' and can be accessed with Ctrl/Cmd-Shift-O,
+# or by opening the command palette and inserting an `@` symbol.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/document_symbol.rb#15
+class RubyLsp::Requests::DocumentSymbol < ::RubyLsp::Requests::Request
+  # source://ruby-lsp/lib/ruby_lsp/requests/document_symbol.rb#28
+  sig { params(uri: ::URI::Generic, dispatcher: ::Prism::Dispatcher).void }
+  def initialize(uri, dispatcher); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/document_symbol.rb#39
+  sig { override.returns(T::Array[::LanguageServer::Protocol::Interface::DocumentSymbol]) }
+  def perform; end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/requests/document_symbol.rb#22
+    sig { returns(::LanguageServer::Protocol::Interface::DocumentSymbolOptions) }
+    def provider; end
+  end
+end
+
+# The [folding ranges](https://microsoft.github.io/language-server-protocol/specification#textDocument_foldingRange)
+# request informs the editor of the ranges where and how code can be folded.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/folding_ranges.rb#10
+class RubyLsp::Requests::FoldingRanges < ::RubyLsp::Requests::Request
+  # source://ruby-lsp/lib/ruby_lsp/requests/folding_ranges.rb#27
+  sig { params(comments: T::Array[::Prism::Comment], dispatcher: ::Prism::Dispatcher).void }
+  def initialize(comments, dispatcher); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/folding_ranges.rb#40
+  sig { override.returns(T::Array[::LanguageServer::Protocol::Interface::FoldingRange]) }
+  def perform; end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/requests/folding_ranges.rb#17
+    sig { returns(::LanguageServer::Protocol::Interface::FoldingRangeRegistrationOptions) }
+    def provider; end
+  end
+end
+
+# The [formatting](https://microsoft.github.io/language-server-protocol/specification#textDocument_formatting)
+# request uses RuboCop to fix auto-correctable offenses in the document. This requires enabling format on save and
+# registering the ruby-lsp as the Ruby formatter.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/formatting.rb#9
+class RubyLsp::Requests::Formatting < ::RubyLsp::Requests::Request
+  # source://ruby-lsp/lib/ruby_lsp/requests/formatting.rb#28
+  sig { params(global_state: ::RubyLsp::GlobalState, document: RubyLsp::RubyDocument).void }
+  def initialize(global_state, document); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/formatting.rb#36
+  sig { override.returns(T.nilable(T.all(::Object, T::Array[::LanguageServer::Protocol::Interface::TextEdit]))) }
+  def perform; end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/requests/formatting.rb#18
+    sig { returns(::LanguageServer::Protocol::Interface::DocumentFormattingRegistrationOptions) }
+    def provider; end
+  end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/formatting.rb#12
+class RubyLsp::Requests::Formatting::Error < ::StandardError; end
+
+# The [hover request](https://microsoft.github.io/language-server-protocol/specification#textDocument_hover)
+# displays the documentation for the symbol currently under the cursor.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/hover.rb#10
+class RubyLsp::Requests::Hover < ::RubyLsp::Requests::Request
+  extend T::Generic
+
+  ResponseType = type_member { { fixed: T.nilable(::LanguageServer::Protocol::Interface::Hover) } }
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/hover.rb#34
+  sig do
+    params(
+      document: T.any(RubyLsp::ERBDocument, RubyLsp::RubyDocument),
+      global_state: ::RubyLsp::GlobalState,
+      position: T::Hash[::Symbol, T.untyped],
+      dispatcher: ::Prism::Dispatcher,
+      sorbet_level: ::RubyLsp::RubyDocument::SorbetLevel
+    ).void
+  end
+  def initialize(document, global_state, position, dispatcher, sorbet_level); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/hover.rb#74
+  sig { override.returns(ResponseType) }
+  def perform; end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/hover.rb#99
+  sig { params(position: T::Hash[::Symbol, T.untyped], target: T.nilable(::Prism::Node)).returns(T::Boolean) }
+  def position_outside_target?(position, target); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/hover.rb#92
+  sig { params(parent: T.nilable(::Prism::Node), target: T.nilable(::Prism::Node)).returns(T::Boolean) }
+  def should_refine_target?(parent, target); end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/requests/hover.rb#18
+    sig { returns(::LanguageServer::Protocol::Interface::HoverOptions) }
+    def provider; end
+  end
+end
+
+# [Inlay hints](https://microsoft.github.io/language-server-protocol/specification#textDocument_inlayHint)
+# are labels added directly in the code that explicitly show the user something that might
+# otherwise just be implied.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/inlay_hints.rb#11
+class RubyLsp::Requests::InlayHints < ::RubyLsp::Requests::Request
+  # source://ruby-lsp/lib/ruby_lsp/requests/inlay_hints.rb#30
+  sig do
+    params(
+      document: T.any(RubyLsp::ERBDocument, RubyLsp::RubyDocument),
+      hints_configuration: ::RubyLsp::RequestConfig,
+      dispatcher: ::Prism::Dispatcher
+    ).void
+  end
+  def initialize(document, hints_configuration, dispatcher); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/inlay_hints.rb#41
+  sig { override.returns(T::Array[::LanguageServer::Protocol::Interface::InlayHint]) }
+  def perform; end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/requests/inlay_hints.rb#18
+    sig { returns(::LanguageServer::Protocol::Interface::InlayHintOptions) }
+    def provider; end
+  end
+end
+
+# The [on type formatting](https://microsoft.github.io/language-server-protocol/specification#textDocument_onTypeFormatting)
+# request formats code as the user is typing. For example, automatically adding `end` to class definitions.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/on_type_formatting.rb#8
+class RubyLsp::Requests::OnTypeFormatting < ::RubyLsp::Requests::Request
+  # source://ruby-lsp/lib/ruby_lsp/requests/on_type_formatting.rb#41
+  sig do
+    params(
+      document: RubyLsp::RubyDocument,
+      position: T::Hash[::Symbol, T.untyped],
+      trigger_character: ::String,
+      client_name: ::String
+    ).void
+  end
+  def initialize(document, position, trigger_character, client_name); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/on_type_formatting.rb#56
+  sig { override.returns(T.all(::Object, T::Array[::LanguageServer::Protocol::Interface::TextEdit])) }
+  def perform; end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/on_type_formatting.rb#159
+  sig { params(text: ::String, position: T::Hash[::Symbol, T.untyped]).void }
+  def add_edit_with_text(text, position = T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/on_type_formatting.rb#206
+  sig { void }
+  def auto_indent_after_end_keyword; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/on_type_formatting.rb#193
+  sig { params(line: ::String).returns(::Integer) }
+  def find_indentation(line); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/on_type_formatting.rb#154
+  sig { params(spaces: ::String).void }
+  def handle_comment_line(spaces); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/on_type_formatting.rb#116
+  sig { void }
+  def handle_curly_brace; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/on_type_formatting.rb#146
+  sig { params(delimiter: ::String).void }
+  def handle_heredoc_end(delimiter); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/on_type_formatting.rb#85
+  sig { void }
+  def handle_pipe; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/on_type_formatting.rb#124
+  sig { void }
+  def handle_statement_end; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/on_type_formatting.rb#172
+  sig { params(line: ::Integer, character: ::Integer).void }
+  def move_cursor_to(line, character); end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/requests/on_type_formatting.rb#15
+    sig { returns(::LanguageServer::Protocol::Interface::DocumentOnTypeFormattingRegistrationOptions) }
+    def provider; end
+  end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/on_type_formatting.rb#24
+RubyLsp::Requests::OnTypeFormatting::END_REGEXES = T.let(T.unsafe(nil), Array)
+
+# The [prepare type hierarchy
+# request](https://microsoft.github.io/language-server-protocol/specification#textDocument_prepareTypeHierarchy)
+# displays the list of ancestors (supertypes) and descendants (subtypes) for the selected type.
+#
+# Currently only supports supertypes due to a limitation of the index.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/prepare_type_hierarchy.rb#11
+class RubyLsp::Requests::PrepareTypeHierarchy < ::RubyLsp::Requests::Request
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/prepare_type_hierarchy.rb#32
+  sig do
+    params(
+      document: T.any(RubyLsp::ERBDocument, RubyLsp::RubyDocument),
+      index: ::RubyIndexer::Index,
+      position: T::Hash[::Symbol, T.untyped]
+    ).void
+  end
+  def initialize(document, index, position); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/prepare_type_hierarchy.rb#41
+  sig { override.returns(T.nilable(T::Array[::LanguageServer::Protocol::Interface::TypeHierarchyItem])) }
+  def perform; end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/requests/prepare_type_hierarchy.rb#20
+    sig { returns(::LanguageServer::Protocol::Interface::TypeHierarchyOptions) }
+    def provider; end
+  end
+end
+
+# The [range formatting](https://microsoft.github.io/language-server-protocol/specification#textDocument_rangeFormatting)
+# is used to format a selection or to format on paste.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/range_formatting.rb#8
+class RubyLsp::Requests::RangeFormatting < ::RubyLsp::Requests::Request
+  # source://ruby-lsp/lib/ruby_lsp/requests/range_formatting.rb#12
+  sig do
+    params(
+      global_state: ::RubyLsp::GlobalState,
+      document: RubyLsp::RubyDocument,
+      params: T::Hash[::Symbol, T.untyped]
+    ).void
+  end
+  def initialize(global_state, document, params); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/range_formatting.rb#21
+  sig { override.returns(T.nilable(T::Array[::LanguageServer::Protocol::Interface::TextEdit])) }
+  def perform; end
+end
+
+# The
+# [references](https://microsoft.github.io/language-server-protocol/specification#textDocument_references)
+# request finds all references for the selected symbol.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/references.rb#9
+class RubyLsp::Requests::References < ::RubyLsp::Requests::Request
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/references.rb#21
+  sig do
+    params(
+      global_state: ::RubyLsp::GlobalState,
+      store: ::RubyLsp::Store,
+      document: T.any(RubyLsp::ERBDocument, RubyLsp::RubyDocument),
+      params: T::Hash[::Symbol, T.untyped]
+    ).void
+  end
+  def initialize(global_state, store, document, params); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/references.rb#31
+  sig { override.returns(T::Array[::LanguageServer::Protocol::Interface::Location]) }
+  def perform; end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/references.rb#129
+  sig do
+    params(
+      target: ::RubyIndexer::ReferenceFinder::Target,
+      parse_result: ::Prism::ParseResult,
+      uri: ::URI::Generic
+    ).void
+  end
+  def collect_references(target, parse_result, uri); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/references.rb#106
+  sig do
+    params(
+      target_node: T.any(::Prism::CallNode, ::Prism::ConstantPathNode, ::Prism::ConstantPathTargetNode, ::Prism::ConstantReadNode, ::Prism::DefNode),
+      node_context: ::RubyLsp::NodeContext
+    ).returns(T.nilable(::RubyIndexer::ReferenceFinder::Target))
+  end
+  def create_reference_target(target_node, node_context); end
+end
+
+# The
+# [rename](https://microsoft.github.io/language-server-protocol/specification#textDocument_rename)
+# request renames all instances of a symbol in a document.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/rename.rb#9
+class RubyLsp::Requests::Rename < ::RubyLsp::Requests::Request
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/rename.rb#23
+  sig do
+    params(
+      global_state: ::RubyLsp::GlobalState,
+      store: ::RubyLsp::Store,
+      document: T.any(RubyLsp::ERBDocument, RubyLsp::RubyDocument),
+      params: T::Hash[::Symbol, T.untyped]
+    ).void
+  end
+  def initialize(global_state, store, document, params); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/rename.rb#33
+  sig { override.returns(T.nilable(::LanguageServer::Protocol::Interface::WorkspaceEdit)) }
+  def perform; end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/rename.rb#181
+  sig do
+    params(
+      name: ::String,
+      reference: ::RubyIndexer::ReferenceFinder::Reference
+    ).returns(::LanguageServer::Protocol::Interface::TextEdit)
+  end
+  def adjust_reference_for_edit(name, reference); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/rename.rb#170
+  sig do
+    params(
+      target: ::RubyIndexer::ReferenceFinder::Target,
+      parse_result: ::Prism::ParseResult,
+      name: ::String,
+      uri: ::URI::Generic
+    ).returns(T::Array[::LanguageServer::Protocol::Interface::TextEdit])
+  end
+  def collect_changes(target, parse_result, name, uri); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/rename.rb#100
+  sig do
+    params(
+      fully_qualified_name: ::String,
+      document_changes: T::Array[T.any(::LanguageServer::Protocol::Interface::RenameFile, ::LanguageServer::Protocol::Interface::TextDocumentEdit)]
+    ).void
+  end
+  def collect_file_renames(fully_qualified_name, document_changes); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/rename.rb#138
+  sig do
+    params(
+      target: ::RubyIndexer::ReferenceFinder::Target,
+      name: ::String
+    ).returns(T::Hash[::String, T::Array[::LanguageServer::Protocol::Interface::TextEdit]])
+  end
+  def collect_text_edits(target, name); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/rename.rb#191
+  sig { params(constant_name: ::String).returns(::String) }
+  def file_from_constant_name(constant_name); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/rename.rb#13
+class RubyLsp::Requests::Rename::InvalidNameError < ::StandardError; end
+
+# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/request.rb#6
+class RubyLsp::Requests::Request
+  abstract!
+
+  # @abstract
+  #
+  # source://ruby-lsp/lib/ruby_lsp/requests/request.rb#15
+  sig { abstract.returns(T.anything) }
+  def perform; end
+
+  private
+
+  # Checks if a location covers a position
+  #
+  # source://ruby-lsp/lib/ruby_lsp/requests/request.rb#38
+  sig { params(location: ::Prism::Location, position: T.untyped).returns(T::Boolean) }
+  def cover?(location, position); end
+
+  # Checks if a given location covers the position requested
+  #
+  # source://ruby-lsp/lib/ruby_lsp/requests/request.rb#87
+  sig { params(location: T.nilable(::Prism::Location), position: T::Hash[::Symbol, T.untyped]).returns(T::Boolean) }
+  def covers_position?(location, position); end
+
+  # Signals to the client that the request should be delegated to the language server server for the host language
+  # in ERB files
+  #
+  # source://ruby-lsp/lib/ruby_lsp/requests/request.rb#28
+  sig do
+    params(
+      global_state: ::RubyLsp::GlobalState,
+      document: RubyLsp::Document[T.untyped],
+      char_position: ::Integer
+    ).void
+  end
+  def delegate_request_if_needed!(global_state, document, char_position); end
+
+  # Based on a constant node target, a constant path node parent and a position, this method will find the exact
+  # portion of the constant path that matches the requested position, for higher precision in hover and
+  # definition. For example:
+  #
+  # ```ruby
+  # Foo::Bar::Baz
+  #  #        ^ Going to definition here should go to Foo::Bar::Baz
+  #  #   ^ Going to definition here should go to Foo::Bar
+  # #^ Going to definition here should go to Foo
+  # ```
+  #
+  # source://ruby-lsp/lib/ruby_lsp/requests/request.rb#71
+  sig do
+    params(
+      target: ::Prism::Node,
+      parent: ::Prism::Node,
+      position: T::Hash[::Symbol, ::Integer]
+    ).returns(::Prism::Node)
+  end
+  def determine_target(target, parent, position); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/request.rb#10
+class RubyLsp::Requests::Request::InvalidFormatter < ::StandardError; end
+
+# The [selection ranges](https://microsoft.github.io/language-server-protocol/specification#textDocument_selectionRange)
+# request informs the editor of ranges that the user may want to select based on the location(s)
+# of their cursor(s).
+#
+# Trigger this request with: Ctrl + Shift + -> or Ctrl + Shift + <-
+#
+# Note that if using VSCode Neovim, you will need to be in Insert mode for this to work correctly.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/selection_ranges.rb#13
+class RubyLsp::Requests::SelectionRanges < ::RubyLsp::Requests::Request
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/selection_ranges.rb#18
+  sig { params(document: T.any(RubyLsp::ERBDocument, RubyLsp::RubyDocument)).void }
+  def initialize(document); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/selection_ranges.rb#26
+  sig { override.returns(T.all(::Object, T::Array[::RubyLsp::Requests::Support::SelectionRange])) }
+  def perform; end
+end
+
+# The [semantic
+# highlighting](https://microsoft.github.io/language-server-protocol/specification#textDocument_semanticTokens)
+# request informs the editor of the correct token types to provide consistent and accurate highlighting for themes.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/semantic_highlighting.rb#11
+class RubyLsp::Requests::SemanticHighlighting < ::RubyLsp::Requests::Request
+  # source://ruby-lsp/lib/ruby_lsp/requests/semantic_highlighting.rb#96
+  sig do
+    params(
+      global_state: ::RubyLsp::GlobalState,
+      dispatcher: ::Prism::Dispatcher,
+      document: T.any(RubyLsp::ERBDocument, RubyLsp::RubyDocument),
+      previous_result_id: T.nilable(::String),
+      range: T.nilable(T::Range[::Integer])
+    ).void
+  end
+  def initialize(global_state, dispatcher, document, previous_result_id, range: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/semantic_highlighting.rb#115
+  sig do
+    override
+      .returns(T.any(::LanguageServer::Protocol::Interface::SemanticTokens, ::LanguageServer::Protocol::Interface::SemanticTokensDelta))
+  end
+  def perform; end
+
+  class << self
+    # The compute_delta method receives the current semantic tokens and the previous semantic tokens and then tries
+    # to compute the smallest possible semantic token edit that will turn previous into current
+    #
+    # source://ruby-lsp/lib/ruby_lsp/requests/semantic_highlighting.rb#39
+    sig do
+      params(
+        current_tokens: T::Array[::Integer],
+        previous_tokens: T::Array[::Integer],
+        result_id: ::String
+      ).returns(::LanguageServer::Protocol::Interface::SemanticTokensDelta)
+    end
+    def compute_delta(current_tokens, previous_tokens, result_id); end
+
+    # source://ruby-lsp/lib/ruby_lsp/requests/semantic_highlighting.rb#77
+    sig { returns(::Integer) }
+    def next_result_id; end
+
+    # source://ruby-lsp/lib/ruby_lsp/requests/semantic_highlighting.rb#18
+    sig { returns(::LanguageServer::Protocol::Interface::SemanticTokensRegistrationOptions) }
+    def provider; end
+  end
+end
+
+# Show syntax tree is a custom [LSP
+# request](https://microsoft.github.io/language-server-protocol/specification#requestMessage) that displays the AST
+# for the current document or for the current selection in a new tab.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/show_syntax_tree.rb#9
+class RubyLsp::Requests::ShowSyntaxTree < ::RubyLsp::Requests::Request
+  # source://ruby-lsp/lib/ruby_lsp/requests/show_syntax_tree.rb#13
+  sig { params(document: RubyLsp::RubyDocument, range: T.nilable(T::Hash[::Symbol, T.untyped])).void }
+  def initialize(document, range); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/show_syntax_tree.rb#21
+  sig { override.returns(::String) }
+  def perform; end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/show_syntax_tree.rb#32
+  sig { returns(::String) }
+  def ast_for_range; end
+end
+
+# The [signature help
+# request](https://microsoft.github.io/language-server-protocol/specification#textDocument_signatureHelp) displays
+# information about the parameters of a method as you type an invocation.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/signature_help.rb#11
+class RubyLsp::Requests::SignatureHelp < ::RubyLsp::Requests::Request
+  # source://ruby-lsp/lib/ruby_lsp/requests/signature_help.rb#36
+  sig do
+    params(
+      document: T.any(RubyLsp::ERBDocument, RubyLsp::RubyDocument),
+      global_state: ::RubyLsp::GlobalState,
+      position: T::Hash[::Symbol, T.untyped],
+      context: T.nilable(T::Hash[::Symbol, T.untyped]),
+      dispatcher: ::Prism::Dispatcher,
+      sorbet_level: ::RubyLsp::RubyDocument::SorbetLevel
+    ).void
+  end
+  def initialize(document, global_state, position, context, dispatcher, sorbet_level); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/signature_help.rb#58
+  sig { override.returns(T.nilable(::LanguageServer::Protocol::Interface::SignatureHelp)) }
+  def perform; end
+
+  private
+
+  # Adjust the target of signature help in the case where we have nested method calls. This is necessary so that we
+  # select the right target in a situation like this:
+  #
+  # foo(another_method_call)
+  #
+  # In that case, we want to provide signature help for `foo` and not `another_method_call`.
+  #
+  # source://ruby-lsp/lib/ruby_lsp/requests/signature_help.rb#80
+  sig do
+    params(
+      target: T.nilable(::Prism::Node),
+      parent: T.nilable(::Prism::Node),
+      position: T::Hash[::Symbol, T.untyped]
+    ).returns(T.nilable(::Prism::Node))
+  end
+  def adjust_for_nested_target(target, parent, position); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/signature_help.rb#96
+  sig { params(node: ::Prism::Node, position: T::Hash[::Symbol, T.untyped]).returns(T::Boolean) }
+  def node_covers?(node, position); end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/requests/signature_help.rb#18
+    sig { returns(::LanguageServer::Protocol::Interface::SignatureHelpOptions) }
+    def provider; end
+  end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/support/selection_range.rb#6
+module RubyLsp::Requests::Support; end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/support/annotation.rb#7
+class RubyLsp::Requests::Support::Annotation
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/annotation.rb#15
+  sig { params(arity: T.any(::Integer, T::Range[::Integer]), receiver: T::Boolean).void }
+  def initialize(arity:, receiver: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/annotation.rb#21
+  sig { params(node: ::Prism::CallNode).returns(T::Boolean) }
+  def match?(node); end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/annotation.rb#34
+  sig { params(node: ::Prism::CallNode).returns(T::Boolean) }
+  def arity_matches?(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/annotation.rb#28
+  sig { params(node: ::Prism::CallNode).returns(T::Boolean) }
+  def receiver_matches?(node); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/support/common.rb#7
+module RubyLsp::Requests::Support::Common
+  requires_ancestor { Kernel }
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/common.rb#83
+  sig do
+    params(
+      title: ::String,
+      entries: T.any(::RubyIndexer::Entry, T::Array[::RubyIndexer::Entry]),
+      max_entries: T.nilable(::Integer)
+    ).returns(T::Hash[::Symbol, ::String])
+  end
+  def categorized_markdown_from_index_entries(title, entries, max_entries = T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/common.rb#151
+  sig do
+    params(
+      node: T.any(::Prism::ConstantPathNode, ::Prism::ConstantPathTargetNode, ::Prism::ConstantReadNode)
+    ).returns(T.nilable(::String))
+  end
+  def constant_name(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/common.rb#49
+  sig do
+    params(
+      node: ::Prism::Node,
+      title: ::String,
+      command_name: ::String,
+      arguments: T.nilable(T::Array[T.untyped]),
+      data: T.nilable(T::Hash[T.untyped, T.untyped])
+    ).returns(::LanguageServer::Protocol::Interface::CodeLens)
+  end
+  def create_code_lens(node, title:, command_name:, arguments:, data:); end
+
+  # Iterates over each part of a constant path, so that we can easily push response items for each section of the
+  # name. For example, for `Foo::Bar::Baz`, this method will invoke the block with `Foo`, then `Bar` and finally
+  # `Baz`.
+  #
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/common.rb#176
+  sig { params(node: ::Prism::Node, block: T.proc.params(part: ::Prism::Node).void).void }
+  def each_constant_path_part(node, &block); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/common.rb#186
+  sig { params(entry: ::RubyIndexer::Entry).returns(T.nilable(::Integer)) }
+  def kind_for_entry(entry); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/common.rb#127
+  sig do
+    params(
+      title: ::String,
+      entries: T.any(::RubyIndexer::Entry, T::Array[::RubyIndexer::Entry]),
+      max_entries: T.nilable(::Integer),
+      extra_links: T.nilable(::String)
+    ).returns(::String)
+  end
+  def markdown_from_index_entries(title, entries, max_entries = T.unsafe(nil), extra_links: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/common.rb#159
+  sig { params(node: T.any(::Prism::ClassNode, ::Prism::ModuleNode)).returns(T.nilable(::String)) }
+  def namespace_constant_name(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/common.rb#64
+  sig { params(file_path: ::String).returns(T.nilable(T::Boolean)) }
+  def not_in_dependencies?(file_path); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/common.rb#30
+  sig do
+    params(
+      location: T.any(::Prism::Location, ::RubyIndexer::Location)
+    ).returns(::LanguageServer::Protocol::Interface::Range)
+  end
+  def range_from_location(location); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/common.rb#17
+  sig { params(node: ::Prism::Node).returns(::LanguageServer::Protocol::Interface::Range) }
+  def range_from_node(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/common.rb#71
+  sig { params(node: ::Prism::CallNode).returns(T::Boolean) }
+  def self_receiver?(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/common.rb#204
+  sig { params(sorbet_level: ::RubyLsp::RubyDocument::SorbetLevel).returns(T::Boolean) }
+  def sorbet_level_true_or_higher?(sorbet_level); end
+end
+
+# @abstract Subclasses must implement the `abstract` methods below.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/support/formatter.rb#7
+module RubyLsp::Requests::Support::Formatter
+  interface!
+
+  # @abstract
+  #
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/formatter.rb#25
+  sig do
+    abstract
+      .params(
+        uri: ::URI::Generic,
+        document: RubyLsp::RubyDocument
+      ).returns(T.nilable(T::Array[::LanguageServer::Protocol::Interface::Diagnostic]))
+  end
+  def run_diagnostic(uri, document); end
+
+  # @abstract
+  #
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/formatter.rb#14
+  sig { abstract.params(uri: ::URI::Generic, document: RubyLsp::RubyDocument).returns(T.nilable(::String)) }
+  def run_formatting(uri, document); end
+
+  # @abstract
+  #
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/formatter.rb#17
+  sig do
+    abstract
+      .params(
+        uri: ::URI::Generic,
+        source: ::String,
+        base_indentation: ::Integer
+      ).returns(T.nilable(::String))
+  end
+  def run_range_formatting(uri, source, base_indentation); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_runner.rb#34
+class RubyLsp::Requests::Support::InternalRuboCopError < ::StandardError
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_runner.rb#44
+  sig { params(rubocop_error: T.any(::RuboCop::ErrorWithAnalyzedFileLocation, ::StandardError)).void }
+  def initialize(rubocop_error); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_runner.rb#37
+RubyLsp::Requests::Support::InternalRuboCopError::MESSAGE = T.let(T.unsafe(nil), String)
+
+# source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_diagnostic.rb#7
+class RubyLsp::Requests::Support::RuboCopDiagnostic
+  # TODO: avoid passing document once we have alternative ways to get at
+  # encoding and file source
+  #
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_diagnostic.rb#35
+  sig { params(document: RubyLsp::RubyDocument, offense: ::RuboCop::Cop::Offense, uri: ::URI::Generic).void }
+  def initialize(document, offense, uri); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_diagnostic.rb#42
+  sig { returns(T::Array[::LanguageServer::Protocol::Interface::CodeAction]) }
+  def to_lsp_code_actions; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_diagnostic.rb#52
+  sig { params(config: ::RuboCop::Config).returns(::LanguageServer::Protocol::Interface::Diagnostic) }
+  def to_lsp_diagnostic(config); end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_diagnostic.rb#107
+  sig { returns(::LanguageServer::Protocol::Interface::CodeAction) }
+  def autocorrect_action; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_diagnostic.rb#94
+  sig { params(config: ::RuboCop::Config).returns(T.nilable(::LanguageServer::Protocol::Interface::CodeDescription)) }
+  def code_description(config); end
+
+  # When `RuboCop::LSP.enable` is called, contextual autocorrect will not offer itself
+  # as `correctable?` to prevent annoying changes while typing. Instead check if
+  # a corrector is present. If it is, then that means some code transformation can be applied.
+  #
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_diagnostic.rb#201
+  sig { returns(T::Boolean) }
+  def correctable?; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_diagnostic.rb#140
+  sig { returns(::LanguageServer::Protocol::Interface::CodeAction) }
+  def disable_line_action; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_diagnostic.rb#182
+  sig { params(line: ::String).returns(::Integer) }
+  def length_of_line(line); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_diagnostic.rb#159
+  sig { returns(T::Array[::LanguageServer::Protocol::Interface::TextEdit]) }
+  def line_disable_comment; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_diagnostic.rb#82
+  sig { returns(::String) }
+  def message; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_diagnostic.rb#127
+  sig { returns(T::Array[::LanguageServer::Protocol::Interface::TextEdit]) }
+  def offense_replacements; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_diagnostic.rb#89
+  sig { returns(T.nilable(::Integer)) }
+  def severity; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_diagnostic.rb#22
+RubyLsp::Requests::Support::RuboCopDiagnostic::ENHANCED_DOC_URL = T.let(T.unsafe(nil), TrueClass)
+
+# source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_diagnostic.rb#10
+RubyLsp::Requests::Support::RuboCopDiagnostic::RUBOCOP_TO_LSP_SEVERITY = T.let(T.unsafe(nil), Hash)
+
+# source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_formatter.rb#11
+class RubyLsp::Requests::Support::RuboCopFormatter
+  include ::RubyLsp::Requests::Support::Formatter
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_formatter.rb#16
+  sig { void }
+  def initialize; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_formatter.rb#43
+  sig do
+    override
+      .params(
+        uri: ::URI::Generic,
+        document: RubyLsp::RubyDocument
+      ).returns(T.nilable(T::Array[::LanguageServer::Protocol::Interface::Diagnostic]))
+  end
+  def run_diagnostic(uri, document); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_formatter.rb#23
+  sig { override.params(uri: ::URI::Generic, document: RubyLsp::RubyDocument).returns(T.nilable(::String)) }
+  def run_formatting(uri, document); end
+
+  # RuboCop does not support range formatting
+  #
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_formatter.rb#33
+  sig do
+    override
+      .params(
+        uri: ::URI::Generic,
+        source: ::String,
+        base_indentation: ::Integer
+      ).returns(T.nilable(::String))
+  end
+  def run_range_formatting(uri, source, base_indentation); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_runner.rb#56
+class RubyLsp::Requests::Support::RuboCopRunner < ::RuboCop::Runner
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_runner.rb#86
+  sig { params(args: ::String).void }
+  def initialize(*args); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_runner.rb#75
+  sig { returns(::RuboCop::Config) }
+  def config_for_working_directory; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_runner.rb#125
+  sig { returns(::String) }
+  def formatted_source; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_runner.rb#72
+  sig { returns(T::Array[::RuboCop::Cop::Offense]) }
+  def offenses; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_runner.rb#103
+  sig { params(path: ::String, contents: ::String).void }
+  def run(path, contents); end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_runner.rb#151
+  sig { params(_file: ::String, offenses: T::Array[::RuboCop::Cop::Offense]).void }
+  def file_finished(_file, offenses); end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_runner.rb#133
+    sig { params(cop_name: ::String).returns(T.nilable(T.class_of(RuboCop::Cop::Base))) }
+    def find_cop_by_name(cop_name); end
+
+    private
+
+    # source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_runner.rb#140
+    sig { returns(T::Hash[::String, [T.class_of(RuboCop::Cop::Base)]]) }
+    def cop_registry; end
+  end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_runner.rb#59
+class RubyLsp::Requests::Support::RuboCopRunner::ConfigurationError < ::StandardError; end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/support/rubocop_runner.rb#61
+RubyLsp::Requests::Support::RuboCopRunner::DEFAULT_ARGS = T.let(T.unsafe(nil), Array)
+
+# source://ruby-lsp/lib/ruby_lsp/requests/support/selection_range.rb#7
+class RubyLsp::Requests::Support::SelectionRange < ::LanguageServer::Protocol::Interface::SelectionRange
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/selection_range.rb#11
+  sig { params(position: T::Hash[::Symbol, T.untyped]).returns(T::Boolean) }
+  def cover?(position); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/support/sorbet.rb#7
+class RubyLsp::Requests::Support::Sorbet
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/requests/support/sorbet.rb#48
+    sig { params(node: ::Prism::CallNode).returns(T::Boolean) }
+    def annotation?(node); end
+  end
+end
+
+# The [type hierarchy supertypes
+# request](https://microsoft.github.io/language-server-protocol/specification#typeHierarchy_supertypes)
+# displays the list of ancestors (supertypes) for the selected type.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/type_hierarchy_supertypes.rb#9
+class RubyLsp::Requests::TypeHierarchySupertypes < ::RubyLsp::Requests::Request
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/type_hierarchy_supertypes.rb#15
+  sig { params(index: ::RubyIndexer::Index, item: T::Hash[::Symbol, T.untyped]).void }
+  def initialize(index, item); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/type_hierarchy_supertypes.rb#23
+  sig { override.returns(T.nilable(T::Array[::LanguageServer::Protocol::Interface::TypeHierarchyItem])) }
+  def perform; end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/type_hierarchy_supertypes.rb#64
+  sig { params(entry: ::RubyIndexer::Entry).returns(::LanguageServer::Protocol::Interface::TypeHierarchyItem) }
+  def hierarchy_item(entry); end
+end
+
+# The [workspace symbol](https://microsoft.github.io/language-server-protocol/specification#workspace_symbol)
+# request allows fuzzy searching declarations in the entire project. On VS Code, use CTRL/CMD + T to search for
+# symbols.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/workspace_symbol.rb#9
+class RubyLsp::Requests::WorkspaceSymbol < ::RubyLsp::Requests::Request
+  include ::RubyLsp::Requests::Support::Common
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/workspace_symbol.rb#14
+  sig { params(global_state: ::RubyLsp::GlobalState, query: T.nilable(::String)).void }
+  def initialize(global_state, query); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/workspace_symbol.rb#22
+  sig { override.returns(T::Array[::LanguageServer::Protocol::Interface::WorkspaceSymbol]) }
+  def perform; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/response_builders/response_builder.rb#5
+module RubyLsp::ResponseBuilders; end
+
+# source://ruby-lsp/lib/ruby_lsp/response_builders/collection_response_builder.rb#6
+class RubyLsp::ResponseBuilders::CollectionResponseBuilder < ::RubyLsp::ResponseBuilders::ResponseBuilder
+  extend T::Generic
+
+  ResponseType = type_member { { upper: Object } }
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/collection_response_builder.rb#13
+  sig { void }
+  def initialize; end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/collection_response_builder.rb#19
+  sig { params(item: ResponseType).void }
+  def <<(item); end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/collection_response_builder.rb#24
+  sig { override.returns(T::Array[ResponseType]) }
+  def response; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/response_builders/document_symbol.rb#6
+class RubyLsp::ResponseBuilders::DocumentSymbol < ::RubyLsp::ResponseBuilders::ResponseBuilder
+  extend T::Generic
+
+  ResponseType = type_member { { fixed: T::Array[::LanguageServer::Protocol::Interface::DocumentSymbol] } }
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/document_symbol.rb#24
+  sig { void }
+  def initialize; end
+
+  # @param symbol [Interface::DocumentSymbol]
+  # @return [void]
+  #
+  # source://sorbet-runtime/0.5.11609lib/types/private/methods/_methods.rb#257
+  def <<(*args, **_arg1, &blk); end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/document_symbol.rb#47
+  sig do
+    returns(T.any(::LanguageServer::Protocol::Interface::DocumentSymbol, ::RubyLsp::ResponseBuilders::DocumentSymbol::SymbolHierarchyRoot))
+  end
+  def last; end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/document_symbol.rb#40
+  sig { returns(T.nilable(::LanguageServer::Protocol::Interface::DocumentSymbol)) }
+  def pop; end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/document_symbol.rb#33
+  sig { params(symbol: ::LanguageServer::Protocol::Interface::DocumentSymbol).void }
+  def push(symbol); end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/document_symbol.rb#52
+  sig { override.returns(T::Array[::LanguageServer::Protocol::Interface::DocumentSymbol]) }
+  def response; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/response_builders/document_symbol.rb#11
+class RubyLsp::ResponseBuilders::DocumentSymbol::SymbolHierarchyRoot
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/document_symbol.rb#18
+  sig { void }
+  def initialize; end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/document_symbol.rb#15
+  sig { returns(T::Array[::LanguageServer::Protocol::Interface::DocumentSymbol]) }
+  def children; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/response_builders/hover.rb#6
+class RubyLsp::ResponseBuilders::Hover < ::RubyLsp::ResponseBuilders::ResponseBuilder
+  extend T::Generic
+
+  ResponseType = type_member { { fixed: String } }
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/hover.rb#13
+  sig { void }
+  def initialize; end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/hover.rb#35
+  sig { returns(T::Boolean) }
+  def empty?; end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/hover.rb#27
+  sig { params(content: ::String, category: ::Symbol).void }
+  def push(content, category:); end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/hover.rb#40
+  sig { override.returns(ResponseType) }
+  def response; end
+end
+
+# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
+#
+# source://ruby-lsp/lib/ruby_lsp/response_builders/response_builder.rb#6
+class RubyLsp::ResponseBuilders::ResponseBuilder
+  abstract!
+
+  # @abstract
+  #
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/response_builder.rb#13
+  sig { abstract.returns(T.anything) }
+  def response; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#6
+class RubyLsp::ResponseBuilders::SemanticHighlighting < ::RubyLsp::ResponseBuilders::ResponseBuilder
+  extend T::Generic
+
+  ResponseType = type_member { { fixed: LanguageServer::Protocol::Interface::SemanticTokens } }
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#64
+  sig do
+    params(
+      code_units_cache: T.any(::Prism::CodeUnitsCache, T.proc.params(arg0: ::Integer).returns(::Integer))
+    ).void
+  end
+  def initialize(code_units_cache); end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#71
+  sig { params(location: ::Prism::Location, type: ::Symbol, modifiers: T::Array[::Symbol]).void }
+  def add_token(location, type, modifiers = T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#96
+  sig { returns(T.nilable(::RubyLsp::ResponseBuilders::SemanticHighlighting::SemanticToken)) }
+  def last; end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#87
+  sig { params(location: ::Prism::Location).returns(T::Boolean) }
+  def last_token_matches?(location); end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#101
+  sig { override.returns(T::Array[::RubyLsp::ResponseBuilders::SemanticHighlighting::SemanticToken]) }
+  def response; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#105
+class RubyLsp::ResponseBuilders::SemanticHighlighting::SemanticToken
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#132
+  sig do
+    params(
+      start_line: ::Integer,
+      start_code_unit_column: ::Integer,
+      length: ::Integer,
+      type: ::Integer,
+      modifier: T::Array[::Integer]
+    ).void
+  end
+  def initialize(start_line:, start_code_unit_column:, length:, type:, modifier:); end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#115
+  sig { returns(::Integer) }
+  def length; end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#121
+  sig { returns(T::Array[::Integer]) }
+  def modifier; end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#149
+  sig { params(modifier_symbols: T::Array[::Symbol]).void }
+  def replace_modifier(modifier_symbols); end
+
+  # @raise [UndefinedTokenType]
+  #
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#141
+  sig { params(type_symbol: ::Symbol).void }
+  def replace_type(type_symbol); end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#112
+  sig { returns(::Integer) }
+  def start_code_unit_column; end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#109
+  sig { returns(::Integer) }
+  def start_line; end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#118
+  sig { returns(::Integer) }
+  def type; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#159
+class RubyLsp::ResponseBuilders::SemanticHighlighting::SemanticTokenEncoder
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#163
+  sig { void }
+  def initialize; end
+
+  # For more information on how each number is calculated, read:
+  # https://microsoft.github.io/language-server-protocol/specifications/specification-current/#textDocument_semanticTokens
+  #
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#198
+  sig { params(token: ::RubyLsp::ResponseBuilders::SemanticHighlighting::SemanticToken).returns(T::Array[::Integer]) }
+  def compute_delta(token); end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#173
+  sig do
+    params(
+      tokens: T::Array[::RubyLsp::ResponseBuilders::SemanticHighlighting::SemanticToken]
+    ).returns(T::Array[::Integer])
+  end
+  def encode(tokens); end
+
+  # Encode an array of modifiers to positions onto a bit flag
+  # For example, [:default_library] will be encoded as
+  # 0b1000000000, as :default_library is the 10th bit according
+  # to the token modifiers index map.
+  #
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#220
+  sig { params(modifiers: T::Array[::Integer]).returns(::Integer) }
+  def encode_modifiers(modifiers); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#40
+RubyLsp::ResponseBuilders::SemanticHighlighting::TOKEN_MODIFIERS = T.let(T.unsafe(nil), Hash)
+
+# source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#11
+RubyLsp::ResponseBuilders::SemanticHighlighting::TOKEN_TYPES = T.let(T.unsafe(nil), Hash)
+
+# source://ruby-lsp/lib/ruby_lsp/response_builders/semantic_highlighting.rb#7
+class RubyLsp::ResponseBuilders::SemanticHighlighting::UndefinedTokenType < ::StandardError; end
+
+# source://ruby-lsp/lib/ruby_lsp/response_builders/signature_help.rb#6
+class RubyLsp::ResponseBuilders::SignatureHelp < ::RubyLsp::ResponseBuilders::ResponseBuilder
+  extend T::Generic
+
+  ResponseType = type_member { { fixed: T.nilable(::LanguageServer::Protocol::Interface::SignatureHelp) } }
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/signature_help.rb#12
+  sig { void }
+  def initialize; end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/signature_help.rb#18
+  sig { params(signature_help: ResponseType).void }
+  def replace(signature_help); end
+
+  # source://ruby-lsp/lib/ruby_lsp/response_builders/signature_help.rb#23
+  sig { override.returns(ResponseType) }
+  def response; end
+end
+
+# The final result of running a request before its IO is finalized
+#
+# source://ruby-lsp/lib/ruby_lsp/utils.rb#198
+class RubyLsp::Result
+  # source://ruby-lsp/lib/ruby_lsp/utils.rb#208
+  sig { params(id: ::Integer, response: T.untyped).void }
+  def initialize(id:, response:); end
+
+  # source://ruby-lsp/lib/ruby_lsp/utils.rb#205
+  sig { returns(::Integer) }
+  def id; end
+
+  # source://ruby-lsp/lib/ruby_lsp/utils.rb#202
+  sig { returns(T.untyped) }
+  def response; end
+
+  # source://ruby-lsp/lib/ruby_lsp/utils.rb#214
+  sig { returns(T::Hash[::Symbol, T.untyped]) }
+  def to_hash; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/ruby_document.rb#5
+class RubyLsp::RubyDocument < ::RubyLsp::Document
+  extend T::Generic
+
+  ParseResultType = type_member { { fixed: Prism::ParseResult } }
+
+  # source://ruby-lsp/lib/ruby_lsp/ruby_document.rb#146
+  sig { params(source: ::String, version: ::Integer, uri: ::URI::Generic, encoding: ::Encoding).void }
+  def initialize(source:, version:, uri:, encoding: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/ruby_document.rb#143
+  sig { returns(T.any(::Prism::CodeUnitsCache, T.proc.params(arg0: ::Integer).returns(::Integer))) }
+  def code_units_cache; end
+
+  # source://ruby-lsp/lib/ruby_lsp/ruby_document.rb#170
+  sig { override.returns(::RubyLsp::Document::LanguageId) }
+  def language_id; end
+
+  # source://ruby-lsp/lib/ruby_lsp/ruby_document.rb#200
+  sig do
+    params(
+      range: T::Hash[::Symbol, T.untyped],
+      node_types: T::Array[T.class_of(Prism::Node)]
+    ).returns(T.nilable(::Prism::Node))
+  end
+  def locate_first_within_range(range, node_types: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/ruby_document.rb#234
+  sig do
+    params(
+      position: T::Hash[::Symbol, T.untyped],
+      node_types: T::Array[T.class_of(Prism::Node)]
+    ).returns(::RubyLsp::NodeContext)
+  end
+  def locate_node(position, node_types: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/ruby_document.rb#155
+  sig { override.returns(T::Boolean) }
+  def parse!; end
+
+  # source://ruby-lsp/lib/ruby_lsp/ruby_document.rb#175
+  sig { returns(::RubyLsp::RubyDocument::SorbetLevel) }
+  def sorbet_level; end
+
+  # source://ruby-lsp/lib/ruby_lsp/ruby_document.rb#165
+  sig { override.returns(T::Boolean) }
+  def syntax_error?; end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/ruby_document.rb#35
+    sig do
+      params(
+        node: ::Prism::Node,
+        char_position: ::Integer,
+        code_units_cache: T.any(::Prism::CodeUnitsCache, T.proc.params(arg0: ::Integer).returns(::Integer)),
+        node_types: T::Array[T.class_of(Prism::Node)]
+      ).returns(::RubyLsp::NodeContext)
+    end
+    def locate(node, char_position, code_units_cache:, node_types: T.unsafe(nil)); end
+  end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/ruby_document.rb#11
+class RubyLsp::RubyDocument::SorbetLevel < ::T::Enum
+  enums do
+    False = new
+    Ignore = new
+    None = new
+    Strict = new
+    True = new
+  end
+end
+
+# The path to the `static_docs` directory, where we keep long-form static documentation
+#
+# source://ruby-lsp/lib/ruby_lsp/static_docs.rb#6
+RubyLsp::STATIC_DOCS_PATH = T.let(T.unsafe(nil), String)
+
+# source://ruby-lsp/lib/ruby_lsp/scope.rb#5
+class RubyLsp::Scope
+  # source://ruby-lsp/lib/ruby_lsp/scope.rb#12
+  sig { params(parent: T.nilable(::RubyLsp::Scope)).void }
+  def initialize(parent = T.unsafe(nil)); end
+
+  # Add a new local to this scope. The types should only be `:parameter` or `:variable`
+  #
+  # source://ruby-lsp/lib/ruby_lsp/scope.rb#21
+  sig { params(name: T.any(::String, ::Symbol), type: ::Symbol).void }
+  def add(name, type); end
+
+  # source://ruby-lsp/lib/ruby_lsp/scope.rb#26
+  sig { params(name: T.any(::String, ::Symbol)).returns(T.nilable(::RubyLsp::Scope::Local)) }
+  def lookup(name); end
+
+  # source://ruby-lsp/lib/ruby_lsp/scope.rb#9
+  sig { returns(T.nilable(::RubyLsp::Scope)) }
+  def parent; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/scope.rb#35
+class RubyLsp::Scope::Local
+  # source://ruby-lsp/lib/ruby_lsp/scope.rb#42
+  sig { params(type: ::Symbol).void }
+  def initialize(type); end
+
+  # source://ruby-lsp/lib/ruby_lsp/scope.rb#39
+  sig { returns(::Symbol) }
+  def type; end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/server.rb#5
+class RubyLsp::Server < ::RubyLsp::BaseServer
+  # Only for testing
+  #
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#10
+  sig { returns(::RubyLsp::GlobalState) }
+  def global_state; end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#153
+  sig { params(include_project_addons: T::Boolean).void }
+  def load_addons(include_project_addons: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#13
+  sig { override.params(message: T::Hash[::Symbol, T.untyped]).void }
+  def process_message(message); end
+
+  # Process responses to requests that were sent to the client
+  #
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#145
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def process_response(message); end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#1114
+  sig { params(id: ::String, title: ::String, percentage: ::Integer).void }
+  def begin_progress(id, title, percentage: T.unsafe(nil)); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#1144
+  sig { void }
+  def check_formatter_is_available; end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#800
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def code_action_resolve(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#1134
+  sig { params(id: ::String).void }
+  def end_progress(id); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#1082
+  sig { void }
+  def perform_initial_indexing; end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#1163
+  sig { params(indexing_options: T.nilable(T::Hash[::Symbol, T.untyped])).void }
+  def process_indexing_configuration(indexing_options); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#1127
+  sig { params(id: ::String, percentage: ::Integer).void }
+  def progress(id, percentage); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#448
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def run_combined_requests(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#193
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def run_initialize(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#329
+  sig { void }
+  def run_initialized; end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#1077
+  sig { override.void }
+  def shutdown; end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#736
+  sig { params(document: RubyLsp::Document[T.untyped]).returns(::RubyLsp::RubyDocument::SorbetLevel) }
+  def sorbet_level(document); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#778
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_code_action(message); end
+
+  # @param message [Hash{Symbol => T.untyped}]
+  # @return [void]
+  #
+  # source://sorbet-runtime/0.5.11609lib/types/private/methods/_methods.rb#257
+  def text_document_code_lens(*args, **_arg1, &blk); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#865
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_completion(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#890
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_completion_item_resolve(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#935
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_definition(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#825
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_diagnostic(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#412
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_did_change(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#396
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_did_close(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#356
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_did_open(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#634
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_document_highlight(message); end
+
+  # @param message [Hash{Symbol => T.untyped}]
+  # @return [void]
+  #
+  # source://sorbet-runtime/0.5.11609lib/types/private/methods/_methods.rb#257
+  def text_document_document_link(*args, **_arg1, &blk); end
+
+  # @param message [Hash{Symbol => T.untyped}]
+  # @return [void]
+  #
+  # source://sorbet-runtime/0.5.11609lib/types/private/methods/_methods.rb#257
+  def text_document_document_symbol(*args, **_arg1, &blk); end
+
+  # @param message [Hash{Symbol => T.untyped}]
+  # @return [void]
+  #
+  # source://sorbet-runtime/0.5.11609lib/types/private/methods/_methods.rb#257
+  def text_document_folding_range(*args, **_arg1, &blk); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#595
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_formatting(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#673
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_hover(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#744
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_inlay_hint(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#650
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_on_type_formatting(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#1019
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_prepare_type_hierarchy(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#567
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_range_formatting(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#718
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_references(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#698
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_rename(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#422
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_selection_range(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#513
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_semantic_tokens_delta(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#492
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_semantic_tokens_full(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#538
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_semantic_tokens_range(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#1000
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_show_syntax_tree(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#909
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def text_document_signature_help(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#1047
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def type_hierarchy_subtypes(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#1038
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def type_hierarchy_supertypes(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#1204
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def window_show_message_request(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#1054
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def workspace_dependencies(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#960
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def workspace_did_change_watched_files(message); end
+
+  # source://ruby-lsp/lib/ruby_lsp/server.rb#987
+  sig { params(message: T::Hash[::Symbol, T.untyped]).void }
+  def workspace_symbol(message); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/store.rb#5
+class RubyLsp::Store
+  # source://ruby-lsp/lib/ruby_lsp/store.rb#17
+  sig { void }
+  def initialize; end
+
+  # source://ruby-lsp/lib/ruby_lsp/store.rb#118
+  sig do
+    type_parameters(:T)
+      .params(
+        uri: ::URI::Generic,
+        request_name: ::String,
+        block: T.proc.params(document: RubyLsp::Document[T.untyped]).returns(T.type_parameter(:T))
+      ).returns(T.type_parameter(:T))
+  end
+  def cache_fetch(uri, request_name, &block); end
+
+  # source://ruby-lsp/lib/ruby_lsp/store.rb#84
+  sig { void }
+  def clear; end
+
+  # source://ruby-lsp/lib/ruby_lsp/store.rb#14
+  sig { returns(::String) }
+  def client_name; end
+
+  # @return [String]
+  #
+  # source://ruby-lsp/lib/ruby_lsp/store.rb#14
+  def client_name=(_arg0); end
+
+  # source://ruby-lsp/lib/ruby_lsp/store.rb#94
+  sig { params(uri: ::URI::Generic).void }
+  def delete(uri); end
+
+  # source://ruby-lsp/lib/ruby_lsp/store.rb#104
+  sig { params(block: T.proc.params(uri: ::String, document: RubyLsp::Document[T.untyped]).void).void }
+  def each(&block); end
+
+  # source://ruby-lsp/lib/ruby_lsp/store.rb#89
+  sig { returns(T::Boolean) }
+  def empty?; end
+
+  # source://ruby-lsp/lib/ruby_lsp/store.rb#11
+  sig { returns(T::Hash[::Symbol, ::RubyLsp::RequestConfig]) }
+  def features_configuration; end
+
+  # @return [Hash{Symbol => RequestConfig}]
+  #
+  # source://ruby-lsp/lib/ruby_lsp/store.rb#11
+  def features_configuration=(_arg0); end
+
+  # source://ruby-lsp/lib/ruby_lsp/store.rb#33
+  sig { params(uri: ::URI::Generic).returns(RubyLsp::Document[T.untyped]) }
+  def get(uri); end
+
+  # source://ruby-lsp/lib/ruby_lsp/store.rb#99
+  sig { params(uri: ::URI::Generic).returns(T::Boolean) }
+  def key?(uri); end
+
+  # source://ruby-lsp/lib/ruby_lsp/store.rb#79
+  sig { params(uri: ::URI::Generic, edits: T::Array[T::Hash[::Symbol, T.untyped]], version: ::Integer).void }
+  def push_edits(uri:, edits:, version:); end
+
+  # source://ruby-lsp/lib/ruby_lsp/store.rb#67
+  sig do
+    params(
+      uri: ::URI::Generic,
+      source: ::String,
+      version: ::Integer,
+      language_id: ::RubyLsp::Document::LanguageId,
+      encoding: ::Encoding
+    ).returns(RubyLsp::Document[T.untyped])
+  end
+  def set(uri:, source:, version:, language_id:, encoding: T.unsafe(nil)); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/store.rb#8
+class RubyLsp::Store::NonExistingDocumentError < ::StandardError; end
+
+# source://ruby-lsp/lib/ruby_lsp/test_helper.rb#7
+module RubyLsp::TestHelper
+  # source://ruby-lsp/lib/ruby_lsp/test_helper.rb#20
+  sig do
+    type_parameters(:T)
+      .params(
+        source: T.nilable(::String),
+        uri: ::URI::Generic,
+        stub_no_typechecker: T::Boolean,
+        load_addons: T::Boolean,
+        block: T.proc.params(server: ::RubyLsp::Server, uri: ::URI::Generic).returns(T.type_parameter(:T))
+      ).returns(T.type_parameter(:T))
+  end
+  def with_server(source = T.unsafe(nil), uri = T.unsafe(nil), stub_no_typechecker: T.unsafe(nil), load_addons: T.unsafe(nil), &block); end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/utils.rb#8
+RubyLsp::Transport = LanguageServer::Protocol::Transport
+
+# A minimalistic type checker to try to resolve types that can be inferred without requiring a type system or
+# annotations
+#
+# source://ruby-lsp/lib/ruby_lsp/type_inferrer.rb#7
+class RubyLsp::TypeInferrer
+  # source://ruby-lsp/lib/ruby_lsp/type_inferrer.rb#11
+  sig { params(index: ::RubyIndexer::Index).void }
+  def initialize(index); end
+
+  # source://ruby-lsp/lib/ruby_lsp/type_inferrer.rb#16
+  sig { params(node_context: ::RubyLsp::NodeContext).returns(T.nilable(::RubyLsp::TypeInferrer::Type)) }
+  def infer_receiver_type(node_context); end
+
+  private
+
+  # source://ruby-lsp/lib/ruby_lsp/type_inferrer.rb#139
+  sig { params(node: T.any(::Prism::ConstantPathNode, ::Prism::ConstantReadNode)).returns(T.nilable(::String)) }
+  def constant_name(node); end
+
+  # source://ruby-lsp/lib/ruby_lsp/type_inferrer.rb#32
+  sig do
+    params(
+      node: ::Prism::CallNode,
+      node_context: ::RubyLsp::NodeContext
+    ).returns(T.nilable(::RubyLsp::TypeInferrer::Type))
+  end
+  def infer_receiver_for_call_node(node, node_context); end
+
+  # source://ruby-lsp/lib/ruby_lsp/type_inferrer.rb#115
+  sig { params(node_context: ::RubyLsp::NodeContext).returns(::RubyLsp::TypeInferrer::Type) }
+  def self_receiver_handling(node_context); end
+end
+
+# A type that was guessed based on the receiver raw name
+#
+# source://ruby-lsp/lib/ruby_lsp/type_inferrer.rb#160
+class RubyLsp::TypeInferrer::GuessedType < ::RubyLsp::TypeInferrer::Type; end
+
+# A known type
+#
+# source://ruby-lsp/lib/ruby_lsp/type_inferrer.rb#147
+class RubyLsp::TypeInferrer::Type
+  # source://ruby-lsp/lib/ruby_lsp/type_inferrer.rb#154
+  sig { params(name: ::String).void }
+  def initialize(name); end
+
+  # source://ruby-lsp/lib/ruby_lsp/type_inferrer.rb#151
+  sig { returns(::String) }
+  def name; end
+end
+
+# source://ruby-lsp/lib/ruby-lsp.rb#5
+RubyLsp::VERSION = T.let(T.unsafe(nil), String)
+
+# source://ruby-lsp/lib/core_ext/uri.rb#5
+class URI::Generic
+  include ::URI::RFC2396_REGEXP
+end
+
+# Avoid a deprecation warning with Ruby 3.4 where the default parser was changed to RFC3986.
+# This condition must remain even after support for 3.4 has been dropped for users that have
+# `uri` in their lockfile, decoupling it from the ruby version.
+#
+# source://ruby-lsp/lib/core_ext/uri.rb#11
+URI::Generic::PARSER = T.let(T.unsafe(nil), URI::RFC2396_Parser)
+
+# Must be kept in sync with the one in Tapioca
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/support/source_uri.rb#8
+class URI::Source < ::URI::File
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/source_uri.rb#69
+  sig { params(v: T.nilable(::String)).returns(T::Boolean) }
+  def check_host(v); end
+
+  # source://tapioca/0.16.3lib/tapioca/helpers/source_uri.rb#55
+  sig { returns(T.nilable(::String)) }
+  def gem_name; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/source_uri.rb#33
+  sig { returns(T.nilable(::String)) }
+  def gem_version; end
+
+  # source://tapioca/0.16.3lib/tapioca/helpers/source_uri.rb#60
+  sig { returns(T.nilable(::String)) }
+  def line_number; end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/source_uri.rb#59
+  sig { params(v: T.nilable(::String)).void }
+  def set_path(v); end
+
+  # source://ruby-lsp/lib/ruby_lsp/requests/support/source_uri.rb#81
+  sig { returns(::String) }
+  def to_s; end
+
+  class << self
+    # source://ruby-lsp/lib/ruby_lsp/requests/support/source_uri.rb#46
+    sig do
+      params(
+        gem_name: ::String,
+        gem_version: T.nilable(::String),
+        path: ::String,
+        line_number: T.nilable(::String)
+      ).returns(::URI::Source)
+    end
+    def build(gem_name:, gem_version:, path:, line_number:); end
+  end
+end
+
+# source://ruby-lsp/lib/ruby_lsp/requests/support/source_uri.rb#11
+URI::Source::COMPONENT = T.let(T.unsafe(nil), Array)
+
+# `uri` for Ruby 3.4 switched the default parser from RFC2396 to RFC3986. The new parser emits a deprecation
+# warning on a few methods and delegates them to RFC2396, namely `extract`/`make_regexp`/`escape`/`unescape`.
+# On earlier versions of the uri gem, the RFC2396_PARSER constant doesn't exist, so it needs some special
+# handling to select a parser that doesn't emit deprecations. While it was backported to Ruby 3.1, users may
+# have the uri gem in their own bundle and thus not use a compatible version.
+#
+# source://ruby-lsp/lib/ruby_lsp/requests/support/source_uri.rb#27
+URI::Source::PARSER = T.let(T.unsafe(nil), URI::RFC2396_Parser)
diff --git a/sorbet/rbi/shims/uri.rbi b/sorbet/rbi/shims/uri.rbi
index cf2071b4b..56e8d9d09 100644
--- a/sorbet/rbi/shims/uri.rbi
+++ b/sorbet/rbi/shims/uri.rbi
@@ -16,4 +16,9 @@ module URI
     sig { returns(String) }
     attr_reader :fragment
   end
+
+  class Generic
+    sig { returns(String) }
+    def to_standardized_path; end
+  end
 end
diff --git a/sorbet/tapioca/require.rb b/sorbet/tapioca/require.rb
index 63543b536..d9cde40b4 100644
--- a/sorbet/tapioca/require.rb
+++ b/sorbet/tapioca/require.rb
@@ -10,3 +10,10 @@
 require "rake/testtask"
 require "rubocop/rake_task"
 require "zeitwerk"
+
+# Add-on related requires. These are not required by default, so we must list them in order to generate proper RBIs
+require "ruby_lsp/internal"
+require "ruby_lsp/test_helper"
+require "ruby_lsp/ruby_lsp_rails/addon"
+require "ruby_lsp/ruby_lsp_rails/server"
+require "rbs"
diff --git a/spec/tapioca/cli/dsl_spec.rb b/spec/tapioca/cli/dsl_spec.rb
index 8e89fa460..a0c04a8ff 100644
--- a/spec/tapioca/cli/dsl_spec.rb
+++ b/spec/tapioca/cli/dsl_spec.rb
@@ -1760,7 +1760,7 @@ def self.gather_constants
 
         it "generates RBIs for lower versions of activerecord-typedstore" do
           @project.require_real_gem("activerecord-typedstore", "1.4.0")
-          @project.require_real_gem("sqlite3", "1.7.3")
+          @project.require_real_gem("sqlite3", "~> 2.1")
           @project.bundle_install!
           @project.write!("lib/post.rb", <<~RB)
             require "active_record"
@@ -2206,7 +2206,7 @@ class Tapioca::Dsl::Compilers::ActiveRecordRelations
 
           @project.require_mock_gem(foo)
           @project.require_real_gem("activerecord", require: "active_record")
-          @project.require_real_gem("sqlite3", "1.7.3")
+          @project.require_real_gem("sqlite3", "~> 2.1")
           @project.bundle_install!
 
           result = @project.tapioca("dsl Post")
@@ -3018,7 +3018,7 @@ class Application < Rails::Application
       describe "options for built-in compilers" do
         it "is able to pass 'untyped' to ActiveRecordColumns compiler" do
           @project.require_real_gem("activerecord")
-          @project.require_real_gem("sqlite3", "1.7.3")
+          @project.require_real_gem("sqlite3", "~> 2.1")
           @project.bundle_install!
           @project.write!("lib/post.rb", <<~RB)
             require "active_record"
diff --git a/spec/tapioca/cli/gem_spec.rb b/spec/tapioca/cli/gem_spec.rb
index 80495571d..feaaad960 100644
--- a/spec/tapioca/cli/gem_spec.rb
+++ b/spec/tapioca/cli/gem_spec.rb
@@ -1257,6 +1257,12 @@ class Post
 
           res = @project.tapioca("gem foo")
 
+          expected_callbacks = if RUBY_VERSION >= "3.2"
+            "def __callbacks; end\n    def __callbacks=(new_value); end"
+          else
+            "def __callbacks; end"
+          end
+
           assert_project_file_equal("sorbet/rbi/gems/foo@0.0.2.rbi", <<~RBI)
             # typed: true
 
@@ -1269,7 +1275,7 @@ module Foo; end
 
             class Foo::Engine < ::Rails::Engine
               class << self
-                def __callbacks; end
+                #{expected_callbacks}
               end
             end
 
@@ -1281,7 +1287,7 @@ class User; end
         end
 
         it "does not crash while tracking `rbtrace` constants" do
-          @project.require_real_gem("rbtrace", "0.4.14")
+          @project.require_real_gem("rbtrace", "0.5.1")
           @project.bundle_install!
           result = @project.tapioca("gem rbtrace")
           assert_empty_stderr(result)
diff --git a/tasks/readme.rake b/tasks/readme.rake
index 0dbee5934..e48a36628 100644
--- a/tasks/readme.rake
+++ b/tasks/readme.rake
@@ -29,7 +29,7 @@ task :readme do
   end
 
   def skip_option?(option)
-    option.name == "auth"
+    option.name == "auth" || option.hide
   end
 
   def option_value(option)