diff --git a/.github/dependabot.yml b/.github/dependabot.yml index 7de2b624f69498..46a3a696938e46 100644 --- a/.github/dependabot.yml +++ b/.github/dependabot.yml @@ -5,6 +5,8 @@ updates: directory: / schedule: interval: daily + allow: + - dependency-type: all # The actions in triage-issues.yml are updated in the Homebrew/.github repo ignore: - dependency-name: actions/stale @@ -20,4 +22,31 @@ updates: interval: daily allow: - dependency-type: all - versioning-strategy: lockfile-only + + - package-ecosystem: npm + directory: / + schedule: + interval: daily + allow: + - dependency-type: all + + - package-ecosystem: docker + directory: / + schedule: + interval: daily + allow: + - dependency-type: all + + - package-ecosystem: devcontainers + directory: / + schedule: + interval: daily + allow: + - dependency-type: all + + - package-ecosystem: pip + directory: / + schedule: + interval: daily + allow: + - dependency-type: all diff --git a/.github/maintainers.json b/.github/maintainers.json index 6f8d3faab65293..cf9e58990e6f4c 100644 --- a/.github/maintainers.json +++ b/.github/maintainers.json @@ -1 +1 @@ -["Moisan","timsutton","MikeMcQuaid","singingwolfboy","issyl0","dtrodrigues","dduugg","bayandin","Bo98","reitermarkus","SMillerDev","chenrui333","samford","fxcoudert","woodruffw","EricFromCanada","iMichka","alebcay","miccal","razvanazamfirei","branchvincent","cho-m","ZhongRuoyu","carlocab","Rylan12","nandahkrishna","krehel","bevanjkay","apainintheneck","p-linnane"] \ No newline at end of file +["Moisan","timsutton","MikeMcQuaid","issyl0","dtrodrigues","dduugg","bayandin","Bo98","reitermarkus","SMillerDev","chenrui333","samford","fxcoudert","woodruffw","EricFromCanada","iMichka","alebcay","miccal","razvanazamfirei","branchvincent","cho-m","ZhongRuoyu","carlocab","Rylan12","nandahkrishna","krehel","bevanjkay","apainintheneck","p-linnane"] \ No newline at end of file diff --git a/.github/workflows/docker.yml b/.github/workflows/docker.yml index a0e1491e2f7c13..14de1cbf953356 100644 --- a/.github/workflows/docker.yml +++ b/.github/workflows/docker.yml @@ -48,12 +48,10 @@ jobs: version: "latest" verb: call args: | - publish-all --src . + publish-all --src . \ --hub-username brewtestbot \ --hub-token HOMEBREW_BREW_DOCKER_TOKEN \ --gh-username BrewTestBot \ --gh-token HOMEBREW_BREW_GITHUB_PACKAGES_TOKEN \ --commit-sha ${{ github.sha }} \ --brew-version "${GITHUB_REF:10}" - - diff --git a/.github/workflows/docs.yml b/.github/workflows/docs.yml index 437b6e6ea4c5d4..984c956114c282 100644 --- a/.github/workflows/docs.yml +++ b/.github/workflows/docs.yml @@ -8,6 +8,7 @@ on: permissions: contents: read + pages: read env: HOMEBREW_DEVELOPER: 1 @@ -17,8 +18,7 @@ env: HOMEBREW_NO_INSTALL_CLEANUP: 1 jobs: - linting: - if: github.repository == 'Homebrew/brew' + docs: runs-on: ubuntu-22.04 steps: - name: Set up Homebrew @@ -29,13 +29,16 @@ jobs: cask: false test-bot: false + - name: Checkout repository + uses: actions/checkout@v4 + - name: Install vale run: brew install vale - - name: Lint docs - working-directory: ${{ steps.set-up-homebrew.outputs.repository-path }} + - name: Cleanup Homebrew/brew docs + if: github.repository == 'Homebrew/brew' run: | - set -euo pipefail + set -xeuo pipefail # Avoid failing on broken symlinks. rm Library/Homebrew/os/mac/pkgconfig/fuse/fuse.pc @@ -44,56 +47,29 @@ jobs: # No ignore support (https://github.com/errata-ai/vale/issues/131). rm -r Library/Homebrew/vendor - vale . - - # Restore removed files. - git reset --hard + - name: Run Vale + run: vale docs/ - name: Install Ruby - uses: ruby/setup-ruby@943103cae7d3f1bb1e4951d5fcc7928b40e4b742 # v1.177.1 + uses: ruby/setup-ruby@3783f195e29b74ae398d7caca108814bbafde90e # v1.180.1 with: bundler-cache: true - working-directory: ${{ steps.set-up-homebrew.outputs.repository-path }}/docs + working-directory: docs - name: Check Markdown syntax - working-directory: ${{ steps.set-up-homebrew.outputs.repository-path }}/docs + working-directory: docs run: bundle exec rake lint - name: Check code blocks conform to our Ruby style guide - working-directory: ${{ steps.set-up-homebrew.outputs.repository-path }}/docs - run: brew style . + run: brew style docs - - name: Build the site and check for broken links - working-directory: ${{ steps.set-up-homebrew.outputs.repository-path }}/docs - run: | - bundle exec rake test + - name: Generate formulae.brew.sh API samples + if: github.repository == 'Homebrew/formulae.brew.sh' + working-directory: docs + run: ../script/generate-api-samples.rb - rubydoc: - if: github.repository == 'Homebrew/brew' - runs-on: ubuntu-22.04 - env: - BUNDLE_GEMFILE: ${{ github.workspace }}/rubydoc/Gemfile - steps: - - name: Set up Homebrew - id: set-up-homebrew - uses: Homebrew/actions/setup-homebrew@master - with: - core: false - cask: false - test-bot: false - - - name: Checkout Homebrew/rubydoc.brew.sh - uses: actions/checkout@v4 - with: - repository: Homebrew/rubydoc.brew.sh - path: rubydoc - - - name: Install Ruby - uses: ruby/setup-ruby@943103cae7d3f1bb1e4951d5fcc7928b40e4b742 # v1.177.1 - with: - bundler-cache: true - working-directory: rubydoc - - - name: Process rubydoc comments - working-directory: ${{ steps.set-up-homebrew.outputs.repository-path }}/Library/Homebrew - run: bundle exec yard doc --no-output --fail-on-warning + - name: Build the site and check for broken links + working-directory: docs + run: bundle exec rake test + env: + JEKYLL_GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }} diff --git a/.github/workflows/rubydoc.yml b/.github/workflows/rubydoc.yml new file mode 100644 index 00000000000000..196e6a85ed8f04 --- /dev/null +++ b/.github/workflows/rubydoc.yml @@ -0,0 +1,48 @@ +name: Ruby Documentation CI + +on: + push: + branches: + - master + pull_request: + +permissions: + contents: read + +env: + HOMEBREW_DEVELOPER: 1 + HOMEBREW_NO_AUTO_UPDATE: 1 + HOMEBREW_NO_ENV_HINTS: 1 + HOMEBREW_BOOTSNAP: 1 + HOMEBREW_NO_INSTALL_CLEANUP: 1 + +jobs: + rubydoc: + if: github.repository == 'Homebrew/brew' + runs-on: ubuntu-22.04 + env: + BUNDLE_GEMFILE: ${{ github.workspace }}/rubydoc/Gemfile + steps: + - name: Set up Homebrew + id: set-up-homebrew + uses: Homebrew/actions/setup-homebrew@master + with: + core: false + cask: false + test-bot: false + + - name: Checkout Homebrew/rubydoc.brew.sh + uses: actions/checkout@v4 + with: + repository: Homebrew/rubydoc.brew.sh + path: rubydoc + + - name: Install Ruby + uses: ruby/setup-ruby@3783f195e29b74ae398d7caca108814bbafde90e # v1.180.1 + with: + bundler-cache: true + working-directory: rubydoc + + - name: Process rubydoc comments + working-directory: ${{ steps.set-up-homebrew.outputs.repository-path }}/Library/Homebrew + run: bundle exec yard doc --no-output --fail-on-warning diff --git a/.github/workflows/tests.yml b/.github/workflows/tests.yml index 71f4269b8f4d07..f49997fb918053 100644 --- a/.github/workflows/tests.yml +++ b/.github/workflows/tests.yml @@ -380,7 +380,7 @@ jobs: HOMEBREW_BUILDPULSE_ACCOUNT_ID: 1503512 HOMEBREW_BUILDPULSE_REPOSITORY_ID: 53238813 - - uses: codecov/codecov-action@125fc84a9a348dbcf27191600683ec096ec9021c # v4.4.1 + - uses: codecov/codecov-action@e28ff129e5465c2c0dcc6f003fc735cb6ae0c673 # v4.5.0 with: working-directory: ${{ steps.set-up-homebrew.outputs.repository-path }} files: Library/Homebrew/test/coverage/coverage.xml diff --git a/.ruby-version b/.ruby-version deleted file mode 100644 index bea438e9ade770..00000000000000 --- a/.ruby-version +++ /dev/null @@ -1 +0,0 @@ -3.3.1 diff --git a/Library/.rubocop.yml b/Library/.rubocop.yml index 05f29c759b3f04..43339e2660eff1 100644 --- a/Library/.rubocop.yml +++ b/Library/.rubocop.yml @@ -29,8 +29,8 @@ Cask/Desc: Description: "Ensure that the desc stanza conforms to various content and style checks." Enabled: true -Cask/HomepageUrlTrailingSlash: - Description: "Ensure that the homepage url has a slash after the domain name." +Cask/HomepageUrlStyling: + Description: "Ensure that the homepage url has the correct format and styling." Enabled: true Cask/StanzaGrouping: @@ -244,8 +244,6 @@ RSpec/MultipleMemoizedHelpers: RSpec/DescribedClassModuleWrapping: Enabled: true -RSpec/FilePath: - SpecSuffixOnly: true # Annoying to have these autoremoved. RSpec/Focus: AutoCorrect: false @@ -406,11 +404,6 @@ Style/RescueStandardError: Style/ReturnNil: Enabled: true -# Broken with rubocop-1.64.0, tries to autocorrect calls to e.g. :"1?" -# TODO: report to rubocop -Style/SendWithLiteralMethodName: - Enabled: false - # We have no use for using `warn` because we # are calling Ruby with warnings disabled. Style/StderrPuts: diff --git a/Library/Homebrew/.ruby-version b/Library/Homebrew/.ruby-version new file mode 100644 index 00000000000000..619b537668489e --- /dev/null +++ b/Library/Homebrew/.ruby-version @@ -0,0 +1 @@ +3.3.3 diff --git a/Library/Homebrew/Gemfile.lock b/Library/Homebrew/Gemfile.lock index 0259423baaef00..b2a8ff4314f47d 100644 --- a/Library/Homebrew/Gemfile.lock +++ b/Library/Homebrew/Gemfile.lock @@ -4,24 +4,22 @@ GEM addressable (2.8.6) public_suffix (>= 2.0.2, < 6.0) ast (2.4.2) - base64 (0.2.0) bigdecimal (3.1.8) bindata (2.5.0) bootsnap (1.18.3) msgpack (~> 1.2) coderay (1.1.3) - commander (4.6.0) - highline (~> 2.0.0) + commander (5.0.0) + highline (~> 3.0.0) diff-lcs (1.5.1) docile (1.4.0) elftools (1.3.1) bindata (~> 2) - erubi (1.12.0) + erubi (1.13.0) hana (1.3.7) - highline (2.0.3) + highline (3.0.1) json (2.7.2) - json_schemer (2.2.1) - base64 + json_schemer (2.3.0) bigdecimal hana (~> 1.3) regexp_parser (~> 2.0) @@ -33,25 +31,25 @@ GEM minitest (5.23.1) msgpack (1.7.2) netrc (0.11.0) - parallel (1.24.0) + parallel (1.25.1) parallel_tests (4.7.1) parallel - parlour (8.1.0) - commander (~> 4.5) + parlour (9.0.0) + commander (~> 5.0) parser rainbow (~> 3.0) sorbet-runtime (>= 0.5) - parser (3.3.1.0) + parser (3.3.3.0) ast (~> 2.4.1) racc patchelf (1.5.1) elftools (>= 1.3) plist (3.7.1) - prism (0.29.0) + prism (0.30.0) pry (0.14.2) coderay (~> 1.1) method_source (~> 1.0) - public_suffix (5.0.5) + public_suffix (5.1.1) racc (1.8.0) rainbow (3.1.1) rbi (0.1.13) @@ -59,15 +57,15 @@ GEM sorbet-runtime (>= 0.5.9204) redcarpet (3.6.0) regexp_parser (2.9.2) - rexml (3.2.8) - strscan (>= 3.0.9) + rexml (3.3.0) + strscan rspec (3.13.0) rspec-core (~> 3.13.0) rspec-expectations (~> 3.13.0) rspec-mocks (~> 3.13.0) rspec-core (3.13.0) rspec-support (~> 3.13.0) - rspec-expectations (3.13.0) + rspec-expectations (3.13.1) diff-lcs (>= 1.2.0, < 2.0) rspec-support (~> 3.13.0) rspec-github (2.4.0) @@ -82,7 +80,7 @@ GEM rspec-support (3.13.1) rspec_junit_formatter (0.6.0) rspec-core (>= 2, < 4, != 2.12.0) - rubocop (1.64.0) + rubocop (1.64.1) json (~> 2.3) language_server-protocol (>= 3.17.0) parallel (~> 1.10) @@ -95,25 +93,16 @@ GEM unicode-display_width (>= 2.4.0, < 3.0) rubocop-ast (1.31.3) parser (>= 3.3.1.0) - rubocop-capybara (2.20.0) - rubocop (~> 1.41) - rubocop-factory_bot (2.25.1) - rubocop (~> 1.41) rubocop-md (1.2.2) rubocop (>= 1.0) - rubocop-performance (1.21.0) + rubocop-performance (1.21.1) rubocop (>= 1.48.1, < 2.0) rubocop-ast (>= 1.31.1, < 2.0) - rubocop-rspec (2.29.2) - rubocop (~> 1.40) - rubocop-capybara (~> 2.17) - rubocop-factory_bot (~> 2.22) - rubocop-rspec_rails (~> 2.28) - rubocop-rspec_rails (2.28.3) - rubocop (~> 1.40) + rubocop-rspec (3.0.1) + rubocop (~> 1.61) rubocop-sorbet (0.8.3) rubocop (>= 0.90.0) - ruby-macho (4.0.1) + ruby-macho (4.1.0) ruby-prof (1.7.0) ruby-progressbar (1.13.0) simplecov (0.22.0) @@ -126,15 +115,15 @@ GEM simplecov-html (0.12.3) simplecov_json_formatter (0.1.4) simpleidn (0.2.3) - sorbet (0.5.11388) - sorbet-static (= 0.5.11388) - sorbet-runtime (0.5.11388) - sorbet-static (0.5.11388-aarch64-linux) - sorbet-static (0.5.11388-universal-darwin) - sorbet-static (0.5.11388-x86_64-linux) - sorbet-static-and-runtime (0.5.11388) - sorbet (= 0.5.11388) - sorbet-runtime (= 0.5.11388) + sorbet (0.5.11435) + sorbet-static (= 0.5.11435) + sorbet-runtime (0.5.11435) + sorbet-static (0.5.11435-aarch64-linux) + sorbet-static (0.5.11435-universal-darwin) + sorbet-static (0.5.11435-x86_64-linux) + sorbet-static-and-runtime (0.5.11435) + sorbet (= 0.5.11435) + sorbet-runtime (= 0.5.11435) spoom (1.3.2) erubi (>= 1.10.0) prism (>= 0.19.0) @@ -142,7 +131,7 @@ GEM thor (>= 0.19.2) stackprof (0.2.26) strscan (3.1.0) - tapioca (0.14.2) + tapioca (0.14.3) bundler (>= 2.2.25) netrc (>= 0.11.0) parallel (>= 1.21.0) @@ -154,7 +143,7 @@ GEM thor (1.3.1) unicode-display_width (2.5.0) vernier (1.0.1) - warning (1.3.0) + warning (1.4.0) yard (0.9.36) yard-sorbet (0.8.1) sorbet-runtime (>= 0.5) @@ -208,7 +197,7 @@ DEPENDENCIES yard-sorbet RUBY VERSION - ruby 3.3.1 + ruby 3.3.3p89 BUNDLED WITH - 2.5.9 + 2.5.11 diff --git a/Library/Homebrew/attestation.rb b/Library/Homebrew/attestation.rb index 2e53cabca7e6a4..4ec51c28711d2a 100644 --- a/Library/Homebrew/attestation.rb +++ b/Library/Homebrew/attestation.rb @@ -55,8 +55,8 @@ def self.gh_executable # Verifies the given bottle against a cryptographic attestation of build provenance. # - # The provenance is verified as originating from `signing_repo`, which is a `String` - # that should be formatted as a GitHub `owner/repo`. + # The provenance is verified as originating from `signing_repository`, which is a `String` + # that should be formatted as a GitHub `owner/repository`. # # Callers may additionally pass in `signing_workflow`, which will scope the attestation # down to an exact GitHub Actions workflow, in @@ -103,8 +103,22 @@ def self.check_attestation(bottle, signing_repo, signing_workflow = nil, subject # for all attestations that match the input's digest. We want to additionally # filter these down to just the attestation whose subject matches the bottle's name. subject = bottle.filename.to_s if subject.blank? - attestation = attestations.find do |a| - a.dig("verificationResult", "statement", "subject", 0, "name") == subject + + attestation = if bottle.tag.to_sym == :all + # :all-tagged bottles are created by `brew bottle --merge`, and are not directly + # bound to their own filename (since they're created by deduplicating other filenames). + # To verify these, we parse each attestation subject and look for one with a matching + # formula (name, version), but not an exact tag match. + # This is sound insofar as the signature has already been verified. However, + # longer term, we should also directly attest to `:all`-tagged bottles. + attestations.find do |a| + actual_subject = a.dig("verificationResult", "statement", "subject", 0, "name") + actual_subject.start_with? "#{bottle.filename.name}--#{bottle.filename.version}" + end + else + attestations.find do |a| + a.dig("verificationResult", "statement", "subject", 0, "name") == subject + end end raise InvalidAttestationError, "no attestation matches subject" if attestation.blank? diff --git a/Library/Homebrew/brew.rb b/Library/Homebrew/brew.rb index b30c87bae1894d..9a4e82b0996e82 100644 --- a/Library/Homebrew/brew.rb +++ b/Library/Homebrew/brew.rb @@ -1,4 +1,4 @@ -# typed: true +# typed: strict # frozen_string_literal: true # `HOMEBREW_STACKPROF` should be set via `brew prof --stackprof`, not manually. diff --git a/Library/Homebrew/brew.sh b/Library/Homebrew/brew.sh index 747f6236e29af6..99bbfebb062c55 100644 --- a/Library/Homebrew/brew.sh +++ b/Library/Homebrew/brew.sh @@ -167,95 +167,7 @@ esac ##### ##### Next, define all helper functions. ##### - -# These variables are set from the user environment. -# shellcheck disable=SC2154 -ohai() { - # Check whether stdout is a tty. - if [[ -n "${HOMEBREW_COLOR}" || (-t 1 && -z "${HOMEBREW_NO_COLOR}") ]] - then - echo -e "\\033[34m==>\\033[0m \\033[1m$*\\033[0m" # blue arrow and bold text - else - echo "==> $*" - fi -} - -opoo() { - # Check whether stderr is a tty. - if [[ -n "${HOMEBREW_COLOR}" || (-t 2 && -z "${HOMEBREW_NO_COLOR}") ]] - then - echo -ne "\\033[4;33mWarning\\033[0m: " >&2 # highlight Warning with underline and yellow color - else - echo -n "Warning: " >&2 - fi - if [[ $# -eq 0 ]] - then - cat >&2 - else - echo "$*" >&2 - fi -} - -bold() { - # Check whether stderr is a tty. - if [[ -n "${HOMEBREW_COLOR}" || (-t 2 && -z "${HOMEBREW_NO_COLOR}") ]] - then - echo -e "\\033[1m""$*""\\033[0m" - else - echo "$*" - fi -} - -onoe() { - # Check whether stderr is a tty. - if [[ -n "${HOMEBREW_COLOR}" || (-t 2 && -z "${HOMEBREW_NO_COLOR}") ]] - then - echo -ne "\\033[4;31mError\\033[0m: " >&2 # highlight Error with underline and red color - else - echo -n "Error: " >&2 - fi - if [[ $# -eq 0 ]] - then - cat >&2 - else - echo "$*" >&2 - fi -} - -odie() { - onoe "$@" - exit 1 -} - -safe_cd() { - cd "$@" >/dev/null || odie "Failed to cd to $*!" -} - -brew() { - # This variable is set by bin/brew - # shellcheck disable=SC2154 - "${HOMEBREW_BREW_FILE}" "$@" -} - -curl() { - "${HOMEBREW_LIBRARY}/Homebrew/shims/shared/curl" "$@" -} - -git() { - "${HOMEBREW_LIBRARY}/Homebrew/shims/shared/git" "$@" -} - -# Search given executable in PATH (remove dependency for `which` command) -which() { - # Alias to Bash built-in command `type -P` - type -P "$@" -} - -numeric() { - # Condense the exploded argument into a single return value. - # shellcheck disable=SC2086,SC2183 - printf "%01d%02d%02d%03d" ${1//[.rc]/ } 2>/dev/null -} +source "${HOMEBREW_LIBRARY}/Homebrew/utils/helpers.sh" check-run-command-as-root() { [[ "${EUID}" == 0 || "${UID}" == 0 ]] || return @@ -391,9 +303,6 @@ auto-update() { unset HOMEBREW_AUTO_UPDATING unset HOMEBREW_AUTO_UPDATE_TAP - # Restore user path as it'll be refiltered by HOMEBREW_BREW_FILE (bin/brew) - export PATH=${HOMEBREW_PATH} - # exec a new process to set any new environment variables. exec "${HOMEBREW_BREW_FILE}" "$@" fi diff --git a/Library/Homebrew/cask/artifact/abstract_uninstall.rb b/Library/Homebrew/cask/artifact/abstract_uninstall.rb index a898556c779222..fcb8cd77bd0b70 100644 --- a/Library/Homebrew/cask/artifact/abstract_uninstall.rb +++ b/Library/Homebrew/cask/artifact/abstract_uninstall.rb @@ -457,12 +457,13 @@ def uninstall_trash(*paths, **options) def trash_paths(*paths, command: nil, **_) return if paths.empty? - stdout, stderr, = system_command HOMEBREW_LIBRARY_PATH/"cask/utils/trash.swift", - args: paths, - print_stderr: false + stdout, = system_command HOMEBREW_LIBRARY_PATH/"cask/utils/trash.swift", + args: paths, + print_stderr: Homebrew::EnvConfig.developer? - trashed = stdout.split(":").sort - untrashable = stderr.split(":").sort + trashed, _, untrashable = stdout.partition("\n") + trashed = trashed.split(":") + untrashable = untrashable.split(":") return trashed, untrashable if untrashable.empty? @@ -470,7 +471,7 @@ def trash_paths(*paths, command: nil, **_) Utils.gain_permissions(path, ["-R"], SystemCommand) do system_command! HOMEBREW_LIBRARY_PATH/"cask/utils/trash.swift", args: [path], - print_stderr: false + print_stderr: Homebrew::EnvConfig.developer? end true diff --git a/Library/Homebrew/cask/audit.rb b/Library/Homebrew/cask/audit.rb index d27f7c576174c5..6138837dd4280c 100644 --- a/Library/Homebrew/cask/audit.rb +++ b/Library/Homebrew/cask/audit.rb @@ -318,13 +318,18 @@ def audit_download_url_format return if block_url_offline? odebug "Auditing URL format" - if bad_sourceforge_url? - add_error "SourceForge URL format incorrect. See #{Formatter.url(SOURCEFORGE_OSDN_REFERENCE_URL)}", - location: cask.url.location - elsif bad_osdn_url? - add_error "OSDN URL format incorrect. See #{Formatter.url(SOURCEFORGE_OSDN_REFERENCE_URL)}", - location: cask.url.location - end + return unless bad_sourceforge_url? + + add_error "SourceForge URL format incorrect. See #{Formatter.url(SOURCEFORGE_OSDN_REFERENCE_URL)}", + location: cask.url.location + end + + def audit_download_url_is_osdn + return unless cask.url + return if block_url_offline? + return unless bad_osdn_url? + + add_error "OSDN download urls are disabled.", location: cask.url.location, strict_only: true end VERIFIED_URL_REFERENCE_URL = "https://docs.brew.sh/Cask-Cookbook#when-url-and-homepage-domains-differ-add-verified" @@ -529,6 +534,12 @@ def extract_artifacts @tmpdir ||= Pathname(Dir.mktmpdir("cask-audit", HOMEBREW_TEMP)) + # Clean up tmp dir when @tmpdir object is destroyed + ObjectSpace.define_finalizer( + @tmpdir, + proc { FileUtils.remove_entry(@tmpdir) }, + ) + ohai "Downloading and extracting artifacts" downloaded_path = download.fetch @@ -538,6 +549,13 @@ def extract_artifacts # Extract the container to the temporary directory. primary_container.extract_nestedly(to: @tmpdir, basename: downloaded_path.basename, verbose: false) + + if (nested_container = @cask.container&.nested) + FileUtils.chmod_R "+rw", @tmpdir/nested_container, force: true, verbose: false + UnpackStrategy.detect(@tmpdir/nested_container, merge_xattrs: true) + .extract_nestedly(to: @tmpdir, verbose: false) + end + @artifacts_extracted = true # Set the flag to indicate that extraction has occurred. # Yield the artifacts and temp directory to the block if provided. @@ -821,7 +839,8 @@ def audit_livecheck_https_availability validate_url_for_https_availability( url, "livecheck URL", - check_content: true + check_content: true, + user_agents: [:default, :browser] ) end @@ -889,7 +908,7 @@ def bad_sourceforge_url? sig { returns(T::Boolean) } def bad_osdn_url? - bad_url_format?(/osd/, [%r{\Ahttps?://([^/]+.)?dl\.osdn\.jp/}]) + domain.match?(%r{^(?:\w+\.)*osdn\.jp(?=/|$)}) end # sig { returns(String) } diff --git a/Library/Homebrew/cask/cask.rb b/Library/Homebrew/cask/cask.rb index 14e6885a7060cc..49d802dde36e9f 100644 --- a/Library/Homebrew/cask/cask.rb +++ b/Library/Homebrew/cask/cask.rb @@ -440,6 +440,7 @@ def to_hash_with_variations(hash_method: :to_h) MacOSVersion::SYMBOLS.keys.product(OnSystem::ARCH_OPTIONS).each do |os, arch| bottle_tag = ::Utils::Bottles::Tag.new(system: os, arch:) next unless bottle_tag.valid_combination? + next if depends_on.macos && !depends_on.macos.allows?(bottle_tag.to_macos_version) Homebrew::SimulateSystem.with(os:, arch:) do refresh diff --git a/Library/Homebrew/cask/cask_loader.rb b/Library/Homebrew/cask/cask_loader.rb index f088dcf339d4a8..5637aadc0e5d58 100644 --- a/Library/Homebrew/cask/cask_loader.rb +++ b/Library/Homebrew/cask/cask_loader.rb @@ -458,6 +458,7 @@ def self.try_new(ref, warn: false) loaders = Tap.select { |tap| tap.installed? && !tap.core_cask_tap? } .filter_map { |tap| super("#{tap}/#{token}", warn:) } + .uniq(&:path) .select { |tap| tap.path.exist? } case loaders.count diff --git a/Library/Homebrew/cask/config.rb b/Library/Homebrew/cask/config.rb index 4732081fc53d1e..7b91ceb2c408b2 100644 --- a/Library/Homebrew/cask/config.rb +++ b/Library/Homebrew/cask/config.rb @@ -155,9 +155,9 @@ def manpagedir sig { returns(T::Array[String]) } def languages [ - *T.cast(explicit.fetch(:languages, []), T::Array[String]), - *T.cast(env.fetch(:languages, []), T::Array[String]), - *T.cast(default.fetch(:languages, []), T::Array[String]), + *explicit.fetch(:languages, []), + *env.fetch(:languages, []), + *default.fetch(:languages, []), ].uniq.select do |lang| # Ensure all languages are valid. Locale.parse(lang) diff --git a/Library/Homebrew/cask/dsl/postflight.rb b/Library/Homebrew/cask/dsl/postflight.rb index cc2eaab4256f93..254a6873d28636 100644 --- a/Library/Homebrew/cask/dsl/postflight.rb +++ b/Library/Homebrew/cask/dsl/postflight.rb @@ -1,4 +1,4 @@ -# typed: true +# typed: strict # frozen_string_literal: true require "cask/staged" diff --git a/Library/Homebrew/cask/upgrade.rb b/Library/Homebrew/cask/upgrade.rb index f0dc11178dcc31..9752d235d81ae9 100644 --- a/Library/Homebrew/cask/upgrade.rb +++ b/Library/Homebrew/cask/upgrade.rb @@ -1,4 +1,4 @@ -# typed: true +# typed: strict # frozen_string_literal: true require "env_config" diff --git a/Library/Homebrew/cask/utils/trash.swift b/Library/Homebrew/cask/utils/trash.swift index cfdd3d896ac68b..cd380aeb1f6fdf 100755 --- a/Library/Homebrew/cask/utils/trash.swift +++ b/Library/Homebrew/cask/utils/trash.swift @@ -2,14 +2,6 @@ import Foundation -extension FileHandle : TextOutputStream { - public func write(_ string: String) { - if let data = string.data(using: .utf8) { self.write(data) } - } -} - -var stderr = FileHandle.standardError - let manager = FileManager.default var success = true @@ -17,19 +9,24 @@ var success = true // The command line arguments given but without the script's name let CMDLineArgs = Array(CommandLine.arguments.dropFirst()) +var trashed: [String] = [] +var untrashable: [String] = [] for item in CMDLineArgs { do { let url = URL(fileURLWithPath: item) var trashedPath: NSURL! try manager.trashItem(at: url, resultingItemURL: &trashedPath) - print((trashedPath as URL).path, terminator: ":") + trashed.append((trashedPath as URL).path) success = true } catch { - print(item, terminator: ":", to: &stderr) + untrashable.append(item) success = false } } +print(trashed.joined(separator: ":")) +print(untrashable.joined(separator: ":"), terminator: "") + guard success else { exit(1) } diff --git a/Library/Homebrew/cleanup.rb b/Library/Homebrew/cleanup.rb index b400922f472763..e28bff8d7ab74e 100644 --- a/Library/Homebrew/cleanup.rb +++ b/Library/Homebrew/cleanup.rb @@ -107,7 +107,7 @@ def stale_formula?(pathname, scrub) version = if HOMEBREW_BOTTLES_EXTNAME_REGEX.match?(to_s) begin - Utils::Bottles.resolve_version(pathname) + Utils::Bottles.resolve_version(pathname).to_s rescue nil end diff --git a/Library/Homebrew/cmake/trap_fetchcontent_provider.cmake b/Library/Homebrew/cmake/trap_fetchcontent_provider.cmake index 522a5d4a276325..9eba3eb8e65c14 100644 --- a/Library/Homebrew/cmake/trap_fetchcontent_provider.cmake +++ b/Library/Homebrew/cmake/trap_fetchcontent_provider.cmake @@ -1,4 +1,6 @@ -cmake_minimum_required(VERSION 3.24) # Dependency providers introduced in CMake 3.24 +# Dependency providers were introduced in CMake 3.24. We don't set cmake_minimum_required here because that would +# propagate to downstream projects, which may break projects that rely on deprecated CMake behavior. Since the build +# is using brewed CMake, we can assume that the CMake version in use is at least 3.24. option(HOMEBREW_ALLOW_FETCHCONTENT "Allow FetchContent to be used in Homebrew builds" OFF) diff --git a/Library/Homebrew/cmd/cleanup.rb b/Library/Homebrew/cmd/cleanup.rb index 6960f617252789..4430137479c72c 100644 --- a/Library/Homebrew/cmd/cleanup.rb +++ b/Library/Homebrew/cmd/cleanup.rb @@ -20,7 +20,7 @@ class CleanupCmd < AbstractCommand "If you want to remove everything, use `--prune=all`." switch "-n", "--dry-run", description: "Show what would be removed, but do not actually remove anything." - switch "-s", + switch "-s", "--scrub", description: "Scrub the cache, including downloads for even the latest versions. " \ "Note that downloads for any installed formulae or casks will still not be deleted. " \ "If you want to delete those too: `rm -rf \"$(brew --cache)\"`" diff --git a/Library/Homebrew/cmd/list.rb b/Library/Homebrew/cmd/list.rb index b55cfb10f9f58a..7652cbe462f652 100644 --- a/Library/Homebrew/cmd/list.rb +++ b/Library/Homebrew/cmd/list.rb @@ -153,7 +153,7 @@ def run system_command! "find", args: casks.map(&:caskroom_path) + find_args, print_stdout: true if casks.present? else kegs.each { |keg| PrettyListing.new keg } if kegs.present? - list_casks if casks.present? + Cask::List.list_casks(*casks, one: args.public_send(:"1?")) if casks.present? end end end diff --git a/Library/Homebrew/cmd/log.rb b/Library/Homebrew/cmd/log.rb index d2a4a594742375..e76f131b87ab86 100644 --- a/Library/Homebrew/cmd/log.rb +++ b/Library/Homebrew/cmd/log.rb @@ -1,4 +1,4 @@ -# typed: true +# typed: strict # frozen_string_literal: true require "abstract_command" diff --git a/Library/Homebrew/cmd/setup-ruby.sh b/Library/Homebrew/cmd/setup-ruby.sh index 7c65cf4824a7e7..42099874f785f4 100644 --- a/Library/Homebrew/cmd/setup-ruby.sh +++ b/Library/Homebrew/cmd/setup-ruby.sh @@ -9,6 +9,7 @@ # HOMEBREW_BREW_FILE is set by extend/ENV/super.rb # shellcheck disable=SC2154 homebrew-setup-ruby() { + source "${HOMEBREW_LIBRARY}/Homebrew/utils/helpers.sh" source "${HOMEBREW_LIBRARY}/Homebrew/utils/ruby.sh" setup-ruby-path @@ -24,14 +25,15 @@ homebrew-setup-ruby() { source "${HOMEBREW_LIBRARY}/Homebrew/command_path.sh" command_path="$(homebrew-command-path "${command}")" - if [[ -n "${command_path}" && "${command_path}" != *"/dev-cmd/"* ]] + if [[ -n "${command_path}" ]] then - return - fi - - if ! grep -q "Homebrew.install_bundler_gems\!" "${command_path}" - then - return + if [[ "${command_path}" != *"/dev-cmd/"* ]] + then + return + elif ! grep -q "Homebrew.install_bundler_gems\!" "${command_path}" + then + return + fi fi fi diff --git a/Library/Homebrew/cmd/tab.rb b/Library/Homebrew/cmd/tab.rb new file mode 100644 index 00000000000000..70b2aa261c8e18 --- /dev/null +++ b/Library/Homebrew/cmd/tab.rb @@ -0,0 +1,75 @@ +# typed: strict +# frozen_string_literal: true + +require "abstract_command" +require "formula" +require "tab" + +module Homebrew + module Cmd + class TabCmd < AbstractCommand + cmd_args do + description <<~EOS + Edit tab information for installed formulae. + + This can be useful when you want to control whether an installed + formula should be removed by `brew autoremove`. + To prevent removal, mark the formula as installed on request; + to allow removal, mark the formula as not installed on request. + EOS + + switch "--installed-on-request", + description: "Mark as installed on request." + switch "--no-installed-on-request", + description: "Mark as not installed on request." + + conflicts "--installed-on-request", "--no-installed-on-request" + + named_args :formula, min: 1 + end + + sig { override.void } + def run + installed_on_request = if args.installed_on_request? + true + elsif args.no_installed_on_request? + false + end + raise UsageError, "No marking option specified." if installed_on_request.nil? + + formulae = args.named.to_formulae + if (formulae_not_installed = formulae.reject(&:any_version_installed?)).any? + formula_names = formulae_not_installed.map(&:name) + is_or_are = (formula_names.length == 1) ? "is" : "are" + odie "#{formula_names.to_sentence} #{is_or_are} not installed." + end + + formulae.each do |formula| + update_tab formula, installed_on_request: + end + end + + private + + sig { params(formula: Formula, installed_on_request: T::Boolean).void } + def update_tab(formula, installed_on_request:) + tab = Tab.for_formula(formula) + unless tab.tabfile.exist? + raise ArgumentError, + "Tab file for #{formula.name} does not exist." + end + + installed_on_request_str = "#{"not " unless installed_on_request}installed on request" + if (tab.installed_on_request && installed_on_request) || + (!tab.installed_on_request && !installed_on_request) + ohai "#{formula.name} is already marked as #{installed_on_request_str}." + return + end + + tab.installed_on_request = installed_on_request + tab.write + ohai "#{formula.name} is now marked as #{installed_on_request_str}." + end + end + end +end diff --git a/Library/Homebrew/cmd/update-report.rb b/Library/Homebrew/cmd/update-report.rb index 122ef265a206d0..a76484e1588835 100644 --- a/Library/Homebrew/cmd/update-report.rb +++ b/Library/Homebrew/cmd/update-report.rb @@ -146,7 +146,7 @@ def output_update_report updated_taps = [] Tap.installed.each do |tap| - next if !tap.git? || tap.git_repo.origin_url.nil? + next if !tap.git? || tap.git_repository.origin_url.nil? next if (tap.core_tap? || tap.core_cask_tap?) && !Homebrew::EnvConfig.no_install_from_api? if ENV["HOMEBREW_MIGRATE_LINUXBREW_FORMULAE"].present? && tap.core_tap? && @@ -321,7 +321,7 @@ def tap_or_untap_core_taps_if_necessary next unless tap.installed? if tap.git_branch == "master" && - (Date.parse(T.must(tap.git_repo.last_commit_date)) <= Date.today.prev_month) + (Date.parse(T.must(tap.git_repository.last_commit_date)) <= Date.today.prev_month) ohai "#{tap.name} is old and unneeded, untapping to save space..." tap.uninstall else diff --git a/Library/Homebrew/cmd/vendor-install.sh b/Library/Homebrew/cmd/vendor-install.sh index eaa1e9cc1d1bf8..14c60c6deb3788 100644 --- a/Library/Homebrew/cmd/vendor-install.sh +++ b/Library/Homebrew/cmd/vendor-install.sh @@ -8,6 +8,7 @@ # HOMEBREW_MACOS_VERSION_NUMERIC and HOMEBREW_PROCESSOR are set by brew.sh # shellcheck disable=SC2154 source "${HOMEBREW_LIBRARY}/Homebrew/utils/lock.sh" +source "${HOMEBREW_LIBRARY}/Homebrew/utils/ruby.sh" VENDOR_DIR="${HOMEBREW_LIBRARY}/Homebrew/vendor" @@ -21,19 +22,19 @@ set_ruby_variables() { # use a x86_64 Portable Ruby. [[ "${VENDOR_PHYSICAL_PROCESSOR}" == "arm64" && "${HOMEBREW_PREFIX}" == "/usr/local" ]] then - ruby_FILENAME="portable-ruby-3.3.1.el_capitan.bottle.tar.gz" - ruby_SHA="34312337c0add491f876b04e8b273a258453d6b633226130ef3105373a97c950" + ruby_FILENAME="portable-ruby-${HOMEBREW_PORTABLE_RUBY_VERSION}.el_capitan.bottle.tar.gz" + ruby_SHA="a5ef040e054444a0eb2cbcc1032fed14702dfbe2e55b25e609f3ce643f23c4ee" elif [[ "${VENDOR_PHYSICAL_PROCESSOR}" == "arm64" ]] then - ruby_FILENAME="portable-ruby-3.3.1.arm64_big_sur.bottle.tar.gz" - ruby_SHA="86ff822590529e8e9093cdc1702a1d3321678c85347d30f82db4f993db8f9eb1" + ruby_FILENAME="portable-ruby-${HOMEBREW_PORTABLE_RUBY_VERSION}.arm64_big_sur.bottle.tar.gz" + ruby_SHA="49847c7a13f7094b211f6d0025900dd23716be07dac894a3d6941d7696296306" fi elif [[ -n "${HOMEBREW_LINUX}" ]] then case "${VENDOR_PROCESSOR}" in x86_64) - ruby_FILENAME="portable-ruby-3.3.1.x86_64_linux.bottle.tar.gz" - ruby_SHA="f49956aa43522c8e86127f7f5d377af2651fe35da975f5993eb2d038865c118c" + ruby_FILENAME="portable-ruby-${HOMEBREW_PORTABLE_RUBY_VERSION}.x86_64_linux.bottle.tar.gz" + ruby_SHA="40a1dbc25bb1a8bbdf0bba53d3f16c45416be12d4c6d48b4530f90b2a77d64ce" ;; *) ;; esac @@ -59,7 +60,7 @@ set_ruby_variables() { fi ruby_URLs+=( "https://ghcr.io/v2/homebrew/portable-ruby/portable-ruby/blobs/sha256:${ruby_SHA}" - "https://github.com/Homebrew/homebrew-portable-ruby/releases/download/3.3.1/${ruby_FILENAME}" + "https://github.com/Homebrew/homebrew-portable-ruby/releases/download/${HOMEBREW_PORTABLE_RUBY_VERSION}/${ruby_FILENAME}" ) ruby_URL="${ruby_URLs[0]}" fi @@ -186,21 +187,33 @@ EOS if [[ -x "/usr/bin/shasum" ]] then sha="$(/usr/bin/shasum -a 256 "${CACHED_LOCATION}" | cut -d' ' -f1)" - elif [[ -x "$(type -P sha256sum)" ]] + fi + + if [[ -z "${sha}" && -x "$(type -P sha256sum)" ]] then sha="$(sha256sum "${CACHED_LOCATION}" | cut -d' ' -f1)" - elif [[ -x "$(type -P ruby)" ]] + fi + + if [[ -z "${sha}" ]] then - sha="$( - ruby <" + end + sig { returns(T::Boolean) } def outdated_release? self < HOMEBREW_MACOS_OLDEST_SUPPORTED diff --git a/Library/Homebrew/os/mac.rb b/Library/Homebrew/os/mac.rb index 417b0ebe9bf0b8..360fb7c1e51497 100644 --- a/Library/Homebrew/os/mac.rb +++ b/Library/Homebrew/os/mac.rb @@ -26,7 +26,6 @@ module Mac # @api internal sig { returns(MacOSVersion) } def self.version - odisabled "`MacOS.version` on Linux" if Homebrew::SimulateSystem.simulating_or_running_on_linux? @version ||= full_version.strip_patch end diff --git a/Library/Homebrew/os/mac/mach.rb b/Library/Homebrew/os/mac/mach.rb index b344cf6c79474c..bb5893e672ce9a 100644 --- a/Library/Homebrew/os/mac/mach.rb +++ b/Library/Homebrew/os/mac/mach.rb @@ -86,7 +86,8 @@ def change_install_name(old, new, **options) end def dynamically_linked_libraries(except: :none, resolve_variable_references: true) - lcs = macho.dylib_load_commands.reject { |lc| lc.type == except } + lcs = macho.dylib_load_commands + lcs.reject! { |lc| lc.flag?(except) } if except != :none names = lcs.map { |lc| lc.name.to_s }.uniq names.map! { resolve_variable_name(_1) } if resolve_variable_references diff --git a/Library/Homebrew/os/mac/pkgconfig/15/expat.pc b/Library/Homebrew/os/mac/pkgconfig/15/expat.pc new file mode 100644 index 00000000000000..0160794162aa9f --- /dev/null +++ b/Library/Homebrew/os/mac/pkgconfig/15/expat.pc @@ -0,0 +1,14 @@ +homebrew_sdkroot=/Library/Developer/CommandLineTools/SDKs/MacOSX15.sdk +prefix=${homebrew_sdkroot}/usr +exec_prefix=/usr +libdir=${exec_prefix}/lib +includedir=${prefix}/include + +Name: expat +Version: 2.6.1 +Description: expat XML parser +URL: https://libexpat.github.io/ +Libs: -L${libdir} -lexpat +Libs.private: +Cflags: +Cflags.private: -DXML_STATIC diff --git a/Library/Homebrew/os/mac/pkgconfig/15/libcurl.pc b/Library/Homebrew/os/mac/pkgconfig/15/libcurl.pc new file mode 100644 index 00000000000000..2cefe367b545a8 --- /dev/null +++ b/Library/Homebrew/os/mac/pkgconfig/15/libcurl.pc @@ -0,0 +1,42 @@ +#*************************************************************************** +# _ _ ____ _ +# Project ___| | | | _ \| | +# / __| | | | |_) | | +# | (__| |_| | _ <| |___ +# \___|\___/|_| \_\_____| +# +# Copyright (C) Daniel Stenberg, , et al. +# +# This software is licensed as described in the file COPYING, which +# you should have received as part of this distribution. The terms +# are also available at https://curl.se/docs/copyright.html. +# +# You may opt to use, copy, modify, merge, publish, distribute and/or sell +# copies of the Software, and permit persons to whom the Software is +# furnished to do so, under the terms of the COPYING file. +# +# This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY +# KIND, either express or implied. +# +# SPDX-License-Identifier: curl +# +########################################################################### + +# This should most probably benefit from getting a "Requires:" field added +# dynamically by configure. +# +homebrew_sdkroot=/Library/Developer/CommandLineTools/SDKs/MacOSX15.sdk +prefix=${homebrew_sdkroot}/usr +exec_prefix=/usr +libdir=${exec_prefix}/lib +includedir=${prefix}/include +supported_protocols="DICT FILE FTP FTPS GOPHER GOPHERS HTTP HTTPS IMAP IMAPS IPFS IPNS LDAP LDAPS MQTT POP3 POP3S RTSP SMB SMBS SMTP SMTPS TELNET TFTP" +supported_features="alt-svc AsynchDNS GSS-API HSTS HTTP2 HTTPS-proxy IPv6 Kerberos Largefile libz MultiSSL NTLM NTLM_WB SPNEGO SSL threadsafe UnixSockets" + +Name: libcurl +URL: https://curl.se/ +Description: Library to transfer files with ftp, http, etc. +Version: 8.7.1 +Libs: -L${libdir} -lcurl +Libs.private: -lldap -lz +Cflags: diff --git a/Library/Homebrew/os/mac/pkgconfig/15/libedit.pc b/Library/Homebrew/os/mac/pkgconfig/15/libedit.pc new file mode 100644 index 00000000000000..b9e29b70c92ee2 --- /dev/null +++ b/Library/Homebrew/os/mac/pkgconfig/15/libedit.pc @@ -0,0 +1,12 @@ +homebrew_sdkroot=/Library/Developer/CommandLineTools/SDKs/MacOSX15.sdk +prefix=${homebrew_sdkroot}/usr +exec_prefix=/usr +libdir=${exec_prefix}/lib +includedir=${prefix}/include + +Name: libedit +Description: command line editor library provides generic line editing, history, and tokenization functions. +Version: 3.0 +Requires: +Libs: -L${libdir} -ledit +Cflags: -I${includedir}/editline diff --git a/Library/Homebrew/os/mac/pkgconfig/15/libexslt.pc b/Library/Homebrew/os/mac/pkgconfig/15/libexslt.pc new file mode 100644 index 00000000000000..e06b1fded2a0be --- /dev/null +++ b/Library/Homebrew/os/mac/pkgconfig/15/libexslt.pc @@ -0,0 +1,14 @@ +homebrew_sdkroot=/Library/Developer/CommandLineTools/SDKs/MacOSX15.sdk +prefix=${homebrew_sdkroot}/usr +exec_prefix=/usr +libdir=${exec_prefix}/lib +includedir=${prefix}/include + + +Name: libexslt +Version: 0.8.20 +Description: EXSLT Extension library +Requires: libxml-2.0, libxslt +Cflags: +Libs: -L${libdir} -lexslt +Libs.private: diff --git a/Library/Homebrew/os/mac/pkgconfig/15/libffi.pc b/Library/Homebrew/os/mac/pkgconfig/15/libffi.pc new file mode 100644 index 00000000000000..07442f421f3f65 --- /dev/null +++ b/Library/Homebrew/os/mac/pkgconfig/15/libffi.pc @@ -0,0 +1,12 @@ +homebrew_sdkroot=/Library/Developer/CommandLineTools/SDKs/MacOSX15.sdk +prefix=${homebrew_sdkroot}/usr +exec_prefix=/usr +libdir=${exec_prefix}/lib +toolexeclibdir=${libdir} +includedir=${prefix}/include/ffi + +Name: libffi +Description: Library supporting Foreign Function Interfaces +Version: 3.4-rc1 +Libs: -L${toolexeclibdir} -lffi +Cflags: -I${includedir} diff --git a/Library/Homebrew/os/mac/pkgconfig/15/libxml-2.0.pc b/Library/Homebrew/os/mac/pkgconfig/15/libxml-2.0.pc new file mode 100644 index 00000000000000..211dcdd03b64a3 --- /dev/null +++ b/Library/Homebrew/os/mac/pkgconfig/15/libxml-2.0.pc @@ -0,0 +1,14 @@ +homebrew_sdkroot=/Library/Developer/CommandLineTools/SDKs/MacOSX15.sdk +prefix=${homebrew_sdkroot}/usr +exec_prefix=/usr +libdir=${exec_prefix}/lib +includedir=${prefix}/include +modules=1 + +Name: libXML +Version: 2.9.13 +Description: libXML library version2. +Requires: +Libs: -L${libdir} -lxml2 +Libs.private: -lz -lpthread -licucore -lm +Cflags: diff --git a/Library/Homebrew/os/mac/pkgconfig/15/libxslt.pc b/Library/Homebrew/os/mac/pkgconfig/15/libxslt.pc new file mode 100644 index 00000000000000..cdb0bab9d7dc2f --- /dev/null +++ b/Library/Homebrew/os/mac/pkgconfig/15/libxslt.pc @@ -0,0 +1,14 @@ +homebrew_sdkroot=/Library/Developer/CommandLineTools/SDKs/MacOSX15.sdk +prefix=${homebrew_sdkroot}/usr +exec_prefix=/usr +libdir=${exec_prefix}/lib +includedir=${prefix}/include + + +Name: libxslt +Version: 1.1.35 +Description: XSLT library version 2. +Requires: libxml-2.0 +Cflags: +Libs: -L${libdir} -lxslt +Libs.private: diff --git a/Library/Homebrew/os/mac/pkgconfig/15/ncurses.pc b/Library/Homebrew/os/mac/pkgconfig/15/ncurses.pc new file mode 100644 index 00000000000000..abeb1e0bdba926 --- /dev/null +++ b/Library/Homebrew/os/mac/pkgconfig/15/ncurses.pc @@ -0,0 +1,17 @@ +homebrew_sdkroot=/Library/Developer/CommandLineTools/SDKs/MacOSX15.sdk +prefix=${homebrew_sdkroot}/usr +exec_prefix=/usr +libdir=${exec_prefix}/lib +includedir=${prefix}/include +abi_version=5.4 +major_version=6 +version=6.0.20150808 + +Name: ncurses +Description: ncurses 6.0 library +Version: ${version} +URL: http://invisible-island.net/ncurses +Requires.private: +Libs: -L${libdir} -lncurses +Libs.private: +Cflags: -D_DARWIN_C_SOURCE diff --git a/Library/Homebrew/os/mac/pkgconfig/15/ncursesw.pc b/Library/Homebrew/os/mac/pkgconfig/15/ncursesw.pc new file mode 100644 index 00000000000000..282d60ae913434 --- /dev/null +++ b/Library/Homebrew/os/mac/pkgconfig/15/ncursesw.pc @@ -0,0 +1,17 @@ +homebrew_sdkroot=/Library/Developer/CommandLineTools/SDKs/MacOSX15.sdk +prefix=${homebrew_sdkroot}/usr +exec_prefix=/usr +libdir=${exec_prefix}/lib +includedir=${prefix}/include +abi_version=5.4 +major_version=6 +version=6.0.20150808 + +Name: ncursesw +Description: ncurses 6.0 library +Version: ${version} +URL: http://invisible-island.net/ncurses +Requires.private: +Libs: -L${libdir} -lncurses +Libs.private: +Cflags: -D_DARWIN_C_SOURCE diff --git a/Library/Homebrew/os/mac/pkgconfig/15/sqlite3.pc b/Library/Homebrew/os/mac/pkgconfig/15/sqlite3.pc new file mode 100644 index 00000000000000..e054da03ea3c37 --- /dev/null +++ b/Library/Homebrew/os/mac/pkgconfig/15/sqlite3.pc @@ -0,0 +1,12 @@ +homebrew_sdkroot=/Library/Developer/CommandLineTools/SDKs/MacOSX15.sdk +prefix=${homebrew_sdkroot}/usr +exec_prefix=/usr +libdir=${exec_prefix}/lib +includedir=${prefix}/include + +Name: SQLite +Description: SQL database engine +Version: 3.43.2 +Libs: -L${libdir} -lsqlite3 +Libs.private: +Cflags: diff --git a/Library/Homebrew/os/mac/pkgconfig/15/uuid.pc b/Library/Homebrew/os/mac/pkgconfig/15/uuid.pc new file mode 100644 index 00000000000000..06ff8ce3971ea4 --- /dev/null +++ b/Library/Homebrew/os/mac/pkgconfig/15/uuid.pc @@ -0,0 +1,14 @@ +homebrew_sdkroot=/Library/Developer/CommandLineTools/SDKs/MacOSX15.sdk +prefix=${homebrew_sdkroot}/usr +exec_prefix=/usr +libdir=${exec_prefix}/lib +sharedlibdir=${libdir} +includedir=${prefix}/include/uuid + +Name: uuid +Description: Universally unique id library +Version: 1.0 + +Requires: +Libs: +Cflags: -I${includedir} diff --git a/Library/Homebrew/os/mac/pkgconfig/15/zlib.pc b/Library/Homebrew/os/mac/pkgconfig/15/zlib.pc new file mode 100644 index 00000000000000..d2be681dbfd895 --- /dev/null +++ b/Library/Homebrew/os/mac/pkgconfig/15/zlib.pc @@ -0,0 +1,14 @@ +homebrew_sdkroot=/Library/Developer/CommandLineTools/SDKs/MacOSX15.sdk +prefix=${homebrew_sdkroot}/usr +exec_prefix=/usr +libdir=${exec_prefix}/lib +sharedlibdir=${libdir} +includedir=${prefix}/include + +Name: zlib +Description: zlib compression library +Version: 1.2.12 + +Requires: +Libs: -L${libdir} -L${sharedlibdir} -lz +Cflags: diff --git a/Library/Homebrew/os/mac/xcode.rb b/Library/Homebrew/os/mac/xcode.rb index eebf3d7b44af38..584872212e40db 100644 --- a/Library/Homebrew/os/mac/xcode.rb +++ b/Library/Homebrew/os/mac/xcode.rb @@ -15,9 +15,11 @@ module Xcode # This may be a beta version for a beta macOS. sig { params(macos: MacOSVersion).returns(String) } def self.latest_version(macos: MacOS.version) - latest_stable = "15.1" + latest_stable = "15.4" case macos - when "14", "13" then latest_stable + when "15" then "16.0" + when "14" then latest_stable + when "13" then "15.2" when "12" then "14.2" when "11" then "13.2.1" when "10.15" then "12.4" @@ -40,6 +42,7 @@ def self.latest_version(macos: MacOS.version) sig { returns(String) } def self.minimum_version case MacOS.version + when "15" then "16.0" when "14" then "15.0" when "13" then "14.1" when "12" then "13.1" @@ -253,8 +256,9 @@ def self.detect_version_from_clang_version when "13.0.0" then "13.2.1" when "13.1.6" then "13.4.1" when "14.0.0" then "14.2" - when "15.0.0" then "15.1" - else "14.3" + when "14.0.3" then "14.3.1" + when "16.0.0" then "16.0" + else "15.4" end end @@ -347,7 +351,9 @@ def self.update_instructions sig { returns(String) } def self.latest_clang_version case MacOS.version - when "14", "13" then "1500.1.0.2.5" + when "15" then "1600.0.20.10" + when "14" then "1500.3.9.4" + when "13" then "1500.1.0.2.5" when "12" then "1400.0.29.202" when "11" then "1300.0.29.30" when "10.15" then "1200.0.32.29" @@ -364,6 +370,7 @@ def self.latest_clang_version sig { returns(String) } def self.minimum_version case MacOS.version + when "15" then "16.0.0" when "14" then "15.0.0" when "13" then "14.0.0" when "12" then "13.0.0" diff --git a/Library/Homebrew/requirements/macos_requirement.rb b/Library/Homebrew/requirements/macos_requirement.rb index db0538aff76cbe..a407559d494cba 100644 --- a/Library/Homebrew/requirements/macos_requirement.rb +++ b/Library/Homebrew/requirements/macos_requirement.rb @@ -61,6 +61,19 @@ def version_specified? false end + def allows?(other) + return true unless version_specified? + + case @comparator + when ">=" then other >= @version + when "<=" then other <= @version + else + return @version.include?(other) if @version.respond_to?(:to_ary) + + @version == other + end + end + def message(type: :formula) return "macOS is required for this software." unless version_specified? diff --git a/Library/Homebrew/rubocops/cask/homepage_url_trailing_slash.rb b/Library/Homebrew/rubocops/cask/homepage_url_styling.rb similarity index 75% rename from Library/Homebrew/rubocops/cask/homepage_url_trailing_slash.rb rename to Library/Homebrew/rubocops/cask/homepage_url_styling.rb index cab96ee824d726..46a853eeb61a2c 100644 --- a/Library/Homebrew/rubocops/cask/homepage_url_trailing_slash.rb +++ b/Library/Homebrew/rubocops/cask/homepage_url_styling.rb @@ -3,21 +3,24 @@ require "forwardable" require "uri" +require "rubocops/shared/homepage_helper" module RuboCop module Cop module Cask - # This cop checks that a cask's homepage ends with a slash - # if it does not have a path component. - class HomepageUrlTrailingSlash < Base + # This cop audits the `homepage` URL in casks. + class HomepageUrlStyling < Base include OnHomepageStanza include HelperFunctions + include HomepageHelper extend AutoCorrector MSG_NO_SLASH = "'%s' must have a slash after the domain." def on_homepage_stanza(stanza) - url_node = stanza.stanza_node.first_argument + @name = cask_block.header.cask_token + desc_call = stanza.stanza_node + url_node = desc_call.first_argument url = if url_node.dstr_type? # Remove quotes from interpolated string. @@ -26,6 +29,8 @@ def on_homepage_stanza(stanza) url_node.str_content end + audit_homepage(:cask, url, desc_call, url_node) + return unless url&.match?(%r{^.+://[^/]+$}) domain = URI(string_content(url_node, strip_dynamic: true)).host diff --git a/Library/Homebrew/rubocops/cask/mixin/on_homepage_stanza.rbi b/Library/Homebrew/rubocops/cask/mixin/on_homepage_stanza.rbi index b4aabf1446c1ab..16240f863d35fa 100644 --- a/Library/Homebrew/rubocops/cask/mixin/on_homepage_stanza.rbi +++ b/Library/Homebrew/rubocops/cask/mixin/on_homepage_stanza.rbi @@ -1,5 +1,5 @@ # typed: strict module RuboCop::Cop::Cask::OnHomepageStanza - requires_ancestor { RuboCop::Cop::Cask::HomepageUrlTrailingSlash } + requires_ancestor { RuboCop::Cop::Cask::HomepageUrlStyling } end diff --git a/Library/Homebrew/rubocops/homepage.rb b/Library/Homebrew/rubocops/homepage.rb index c29ca238830ac6..4ceab117634d54 100644 --- a/Library/Homebrew/rubocops/homepage.rb +++ b/Library/Homebrew/rubocops/homepage.rb @@ -2,12 +2,14 @@ # frozen_string_literal: true require "rubocops/extend/formula_cop" +require "rubocops/shared/homepage_helper" module RuboCop module Cop module FormulaAudit # This cop audits the `homepage` URL in formulae. class Homepage < FormulaCop + include HomepageHelper extend AutoCorrector def audit_formula(_node, class_node, _parent_class_node, body_node) @@ -21,84 +23,9 @@ def audit_formula(_node, class_node, _parent_class_node, body_node) homepage_parameter_node = parameters(homepage_node).first offending_node(homepage_parameter_node) - homepage = string_content(homepage_parameter_node) + content = string_content(homepage_parameter_node) - problem "Formula should have a homepage." if homepage.empty? - - problem "The homepage should start with http or https." unless homepage.match?(%r{^https?://}) - - case homepage - # Freedesktop is complicated to handle - It has SSL/TLS, but only on certain subdomains. - # To enable https Freedesktop change the URL from http://project.freedesktop.org/wiki to - # https://wiki.freedesktop.org/project_name. - # "Software" is redirected to https://wiki.freedesktop.org/www/Software/project_name - when %r{^http://((?:www|nice|libopenraw|liboil|telepathy|xorg)\.)?freedesktop\.org/(?:wiki/)?} - if homepage.include?("Software") - problem "Freedesktop homepages should be styled " \ - "`https://wiki.freedesktop.org/www/Software/project_name`" - else - problem "Freedesktop homepages should be styled `https://wiki.freedesktop.org/project_name`" - end - - # Google Code homepages should end in a slash - when %r{^https?://code\.google\.com/p/[^/]+[^/]$} - problem "Google Code homepages should end with a slash" do |corrector| - corrector.replace(homepage_parameter_node.source_range, "\"#{homepage}/\"") - end - - when %r{^http://([^/]*)\.(sf|sourceforge)\.net(/|$)} - fixed = "https://#{Regexp.last_match(1)}.sourceforge.io/" - problem "Sourceforge homepages should be `#{fixed}`" do |corrector| - corrector.replace(homepage_parameter_node.source_range, "\"#{fixed}\"") - end - - when /readthedocs\.org/ - fixed = homepage.sub("readthedocs.org", "readthedocs.io") - problem "Readthedocs homepages should be `#{fixed}`" do |corrector| - corrector.replace(homepage_parameter_node.source_range, "\"#{fixed}\"") - end - - when %r{^https://github.com.*\.git$} - problem "GitHub homepages should not end with .git" do |corrector| - corrector.replace(homepage_parameter_node.source_range, "\"#{homepage.delete_suffix(".git")}\"") - end - - # People will run into mixed content sometimes, but we should enforce and then add - # exemptions as they are discovered. Treat mixed content on homepages as a bug. - # Justify each exemptions with a code comment so we can keep track here. - # - # Compact the above into this list as we're able to remove detailed notations, etc over time. - when - # Check for `http://` GitHub homepage URLs, `https://` is preferred. - # NOTE: Only check homepages that are repository pages, not `*.github.com` hosts. - %r{^http://github\.com/}, - %r{^http://[^/]*\.github\.io/}, - - # Savannah has full SSL/TLS support but no auto-redirect. - # Doesn't apply to the download URLs, only the homepage. - %r{^http://savannah\.nongnu\.org/}, - - %r{^http://[^/]*\.sourceforge\.io/}, - # There's an auto-redirect here, but this mistake is incredibly common too. - # Only applies to the homepage and subdomains for now, not the FTP URLs. - %r{^http://((?:build|cloud|developer|download|extensions|git| - glade|help|library|live|nagios|news|people| - projects|rt|static|wiki|www)\.)?gnome\.org}x, - %r{^http://[^/]*\.apache\.org}, - %r{^http://packages\.debian\.org}, - %r{^http://wiki\.freedesktop\.org/}, - %r{^http://((?:www)\.)?gnupg\.org/}, - %r{^http://ietf\.org}, - %r{^http://[^/.]+\.ietf\.org}, - %r{^http://[^/.]+\.tools\.ietf\.org}, - %r{^http://www\.gnu\.org/}, - %r{^http://code\.google\.com/}, - %r{^http://bitbucket\.org/}, - %r{^http://(?:[^/]*\.)?archive\.org} - problem "Please use https:// for #{homepage}" do |corrector| - corrector.replace(homepage_parameter_node.source_range, "\"#{homepage.sub("http", "https")}\"") - end - end + audit_homepage(:formula, content, homepage_node, homepage_parameter_node) end end end diff --git a/Library/Homebrew/rubocops/rubocop-cask.rb b/Library/Homebrew/rubocops/rubocop-cask.rb index 44abad52f94b0e..668fcea57d18f0 100644 --- a/Library/Homebrew/rubocops/rubocop-cask.rb +++ b/Library/Homebrew/rubocops/rubocop-cask.rb @@ -15,7 +15,7 @@ require_relative "cask/array_alphabetization" require_relative "cask/desc" require_relative "cask/discontinued" -require_relative "cask/homepage_url_trailing_slash" +require_relative "cask/homepage_url_styling" require_relative "cask/no_overrides" require_relative "cask/on_system_conditionals" require_relative "cask/shared_filelist_glob" diff --git a/Library/Homebrew/rubocops/shared/homepage_helper.rb b/Library/Homebrew/rubocops/shared/homepage_helper.rb new file mode 100644 index 00000000000000..921d9aebe65fc1 --- /dev/null +++ b/Library/Homebrew/rubocops/shared/homepage_helper.rb @@ -0,0 +1,95 @@ +# typed: true +# frozen_string_literal: true + +require "rubocops/shared/helper_functions" + +module RuboCop + module Cop + # This module performs common checks the `homepage` field in both formulae and casks. + module HomepageHelper + include HelperFunctions + + def audit_homepage(type, content, homepage_node, homepage_parameter_node) + @offensive_node = homepage_node + + problem "#{type.to_s.capitalize} should have a homepage." if content.empty? + + @offensive_node = homepage_parameter_node + problem "The homepage should start with http or https." unless content.match?(%r{^https?://}) + + case content + # Freedesktop is complicated to handle - It has SSL/TLS, but only on certain subdomains. + # To enable https Freedesktop change the URL from http://project.freedesktop.org/wiki to + # https://wiki.freedesktop.org/project_name. + # "Software" is redirected to https://wiki.freedesktop.org/www/Software/project_name + when %r{^http://((?:www|nice|libopenraw|liboil|telepathy|xorg)\.)?freedesktop\.org/(?:wiki/)?} + if content.include?("Software") + problem "Freedesktop homepages should be styled " \ + "`https://wiki.freedesktop.org/www/Software/project_name`" + else + problem "Freedesktop homepages should be styled `https://wiki.freedesktop.org/project_name`" + end + + # Google Code homepages should end in a slash + when %r{^https?://code\.google\.com/p/[^/]+[^/]$} + problem "Google Code homepages should end with a slash" do |corrector| + corrector.replace(homepage_parameter_node.source_range, "\"#{content}/\"") + end + + when %r{^http://([^/]*)\.(sf|sourceforge)\.net(/|$)} + fixed = "https://#{Regexp.last_match(1)}.sourceforge.io/" + problem "Sourceforge homepages should be `#{fixed}`" do |corrector| + corrector.replace(homepage_parameter_node.source_range, "\"#{fixed}\"") + end + + when /readthedocs\.org/ + fixed = content.sub("readthedocs.org", "readthedocs.io") + problem "Readthedocs homepages should be `#{fixed}`" do |corrector| + corrector.replace(homepage_parameter_node.source_range, "\"#{fixed}\"") + end + + when %r{^https://github.com.*\.git$} + problem "GitHub homepages should not end with .git" do |corrector| + corrector.replace(homepage_parameter_node.source_range, "\"#{content.delete_suffix(".git")}\"") + end + + # People will run into mixed content sometimes, but we should enforce and then add + # exemptions as they are discovered. Treat mixed content on homepages as a bug. + # Justify each exemptions with a code comment so we can keep track here. + # + # Compact the above into this list as we're able to remove detailed notations, etc over time. + when + # Check for `http://` GitHub homepage URLs, `https://` is preferred. + # NOTE: Only check homepages that are repository pages, not `*.github.com` hosts. + %r{^http://github\.com/}, + %r{^http://[^/]*\.github\.io/}, + + # Savannah has full SSL/TLS support but no auto-redirect. + # Doesn't apply to the download URLs, only the homepage. + %r{^http://savannah\.nongnu\.org/}, + + %r{^http://[^/]*\.sourceforge\.io/}, + # There's an auto-redirect here, but this mistake is incredibly common too. + # Only applies to the homepage and subdomains for now, not the FTP URLs. + %r{^http://((?:build|cloud|developer|download|extensions|git| + glade|help|library|live|nagios|news|people| + projects|rt|static|wiki|www)\.)?gnome\.org}x, + %r{^http://[^/]*\.apache\.org}, + %r{^http://packages\.debian\.org}, + %r{^http://wiki\.freedesktop\.org/}, + %r{^http://((?:www)\.)?gnupg\.org/}, + %r{^http://ietf\.org}, + %r{^http://[^/.]+\.ietf\.org}, + %r{^http://[^/.]+\.tools\.ietf\.org}, + %r{^http://www\.gnu\.org/}, + %r{^http://code\.google\.com/}, + %r{^http://bitbucket\.org/}, + %r{^http://(?:[^/]*\.)?archive\.org} + problem "Please use https:// for #{content}" do |corrector| + corrector.replace(homepage_parameter_node.source_range, "\"#{content.sub("http", "https")}\"") + end + end + end + end + end +end diff --git a/Library/Homebrew/sbom.rb b/Library/Homebrew/sbom.rb index c57193f1a38360..e3148f50917675 100644 --- a/Library/Homebrew/sbom.rb +++ b/Library/Homebrew/sbom.rb @@ -126,7 +126,7 @@ def valid?(bottling: false) unless require? "json_schemer" error_message = "Need json_schemer to validate SBOM, run `brew install-bundler-gems --add-groups=bottle`!" odie error_message if ENV["HOMEBREW_ENFORCE_SBOM"] - return false + return true end schema = SBOM.fetch_schema! @@ -293,9 +293,13 @@ def generate_packages_json(runtime_dependency_declaration, compiler_declaration, ] + runtime_dependency_declaration + compiler_declarations + bottle end - sig { returns(T::Array[T::Hash[Symbol, T.any(T::Boolean, String, T::Array[T::Hash[Symbol, String]])]]) } - def full_spdx_runtime_dependencies - return [] unless @runtime_dependencies.present? + sig { + params(bottling: T::Boolean).returns(T::Array[T::Hash[Symbol, + T.any(T::Boolean, String, + T::Array[T::Hash[Symbol, String]])]]) + } + def full_spdx_runtime_dependencies(bottling:) + return [] if @runtime_dependencies.blank? @runtime_dependencies.compact.filter_map do |dependency| next unless dependency.present? @@ -306,7 +310,7 @@ def full_spdx_runtime_dependencies # Only set bottle URL if the dependency is the same version as the formula/bottle. bottle_url = bottle_info["url"] if dependency["pkg_version"] == dependency["formula_pkg_version"] - { + dependency_json = { SPDXID: "SPDXRef-Package-SPDXRef-#{dependency["name"].tr("/", "-")}-#{dependency["pkg_version"]}", name: dependency["name"], versionInfo: dependency["pkg_version"], @@ -329,12 +333,17 @@ def full_spdx_runtime_dependencies }, ], } + if bottling + dependency_json.delete(:downloadLocation) + dependency_json.delete(:checksums) + end + dependency_json end end sig { params(bottling: T::Boolean).returns(T::Hash[Symbol, T.any(String, T::Array[T::Hash[Symbol, String]])]) } def to_spdx_sbom(bottling:) - runtime_full = full_spdx_runtime_dependencies + runtime_full = full_spdx_runtime_dependencies(bottling:) compiler_info = { "SPDXRef-Compiler" => { diff --git a/Library/Homebrew/service.rb b/Library/Homebrew/service.rb index 0f479f4d0ab8b9..7b078236fbbf81 100644 --- a/Library/Homebrew/service.rb +++ b/Library/Homebrew/service.rb @@ -152,8 +152,7 @@ def keep_alive(value = nil) when true, false @keep_alive = { always: value } when Hash - hash = T.cast(value, Hash) - unless (hash.keys - KEEP_ALIVE_KEYS).empty? + unless (value.keys - KEEP_ALIVE_KEYS).empty? raise TypeError, "Service#keep_alive allows only #{KEEP_ALIVE_KEYS}" end diff --git a/Library/Homebrew/sorbet/rbi/dsl/homebrew/cmd/cleanup_cmd.rbi b/Library/Homebrew/sorbet/rbi/dsl/homebrew/cmd/cleanup_cmd.rbi index 41ab569a0e3735..6a4ef24dfaf980 100644 --- a/Library/Homebrew/sorbet/rbi/dsl/homebrew/cmd/cleanup_cmd.rbi +++ b/Library/Homebrew/sorbet/rbi/dsl/homebrew/cmd/cleanup_cmd.rbi @@ -25,4 +25,7 @@ class Homebrew::Cmd::CleanupCmd::Args < Homebrew::CLI::Args sig { returns(T::Boolean) } def s?; end + + sig { returns(T::Boolean) } + def scrub?; end end diff --git a/Library/Homebrew/sorbet/rbi/dsl/homebrew/cmd/tab_cmd.rbi b/Library/Homebrew/sorbet/rbi/dsl/homebrew/cmd/tab_cmd.rbi new file mode 100644 index 00000000000000..e901f5eaeb4d6d --- /dev/null +++ b/Library/Homebrew/sorbet/rbi/dsl/homebrew/cmd/tab_cmd.rbi @@ -0,0 +1,19 @@ +# typed: true + +# DO NOT EDIT MANUALLY +# This is an autogenerated file for dynamic methods in `Homebrew::Cmd::TabCmd`. +# Please instead update this file by running `bin/tapioca dsl Homebrew::Cmd::TabCmd`. + + +class Homebrew::Cmd::TabCmd + sig { returns(Homebrew::Cmd::TabCmd::Args) } + def args; end +end + +class Homebrew::Cmd::TabCmd::Args < Homebrew::CLI::Args + sig { returns(T::Boolean) } + def installed_on_request?; end + + sig { returns(T::Boolean) } + def no_installed_on_request?; end +end diff --git a/Library/Homebrew/sorbet/rbi/gems/base64@0.2.0.rbi b/Library/Homebrew/sorbet/rbi/gems/base64@0.2.0.rbi deleted file mode 100644 index 087b64e5aec279..00000000000000 --- a/Library/Homebrew/sorbet/rbi/gems/base64@0.2.0.rbi +++ /dev/null @@ -1,507 +0,0 @@ -# typed: true - -# DO NOT EDIT MANUALLY -# This is an autogenerated file for types exported from the `base64` gem. -# Please instead update this file by running `bin/tapioca gem base64`. - - -# \Module \Base64 provides methods for: -# -# - Encoding a binary string (containing non-ASCII characters) -# as a string of printable ASCII characters. -# - Decoding such an encoded string. -# -# \Base64 is commonly used in contexts where binary data -# is not allowed or supported: -# -# - Images in HTML or CSS files, or in URLs. -# - Email attachments. -# -# A \Base64-encoded string is about one-third larger that its source. -# See the {Wikipedia article}[https://en.wikipedia.org/wiki/Base64] -# for more information. -# -# This module provides three pairs of encode/decode methods. -# Your choices among these methods should depend on: -# -# - Which character set is to be used for encoding and decoding. -# - Whether "padding" is to be used. -# - Whether encoded strings are to contain newlines. -# -# Note: Examples on this page assume that the including program has executed: -# -# require 'base64' -# -# == Encoding Character Sets -# -# A \Base64-encoded string consists only of characters from a 64-character set: -# -# - ('A'..'Z'). -# - ('a'..'z'). -# - ('0'..'9'). -# - =, the 'padding' character. -# - Either: -# - %w[+ /]: -# {RFC-2045-compliant}[https://datatracker.ietf.org/doc/html/rfc2045]; -# _not_ safe for URLs. -# - %w[- _]: -# {RFC-4648-compliant}[https://datatracker.ietf.org/doc/html/rfc4648]; -# safe for URLs. -# -# If you are working with \Base64-encoded strings that will come from -# or be put into URLs, you should choose this encoder-decoder pair -# of RFC-4648-compliant methods: -# -# - Base64.urlsafe_encode64 and Base64.urlsafe_decode64. -# -# Otherwise, you may choose any of the pairs in this module, -# including the pair above, or the RFC-2045-compliant pairs: -# -# - Base64.encode64 and Base64.decode64. -# - Base64.strict_encode64 and Base64.strict_decode64. -# -# == Padding -# -# \Base64-encoding changes a triplet of input bytes -# into a quartet of output characters. -# -# Padding in Encode Methods -# -# Padding -- extending an encoded string with zero, one, or two trailing -# = characters -- is performed by methods Base64.encode64, -# Base64.strict_encode64, and, by default, Base64.urlsafe_encode64: -# -# Base64.encode64('s') # => "cw==\n" -# Base64.strict_encode64('s') # => "cw==" -# Base64.urlsafe_encode64('s') # => "cw==" -# Base64.urlsafe_encode64('s', padding: false) # => "cw" -# -# When padding is performed, the encoded string is always of length 4n, -# where +n+ is a non-negative integer: -# -# - Input bytes of length 3n generate unpadded output characters -# of length 4n: -# -# # n = 1: 3 bytes => 4 characters. -# Base64.strict_encode64('123') # => "MDEy" -# # n = 2: 6 bytes => 8 characters. -# Base64.strict_encode64('123456') # => "MDEyMzQ1" -# -# - Input bytes of length 3n+1 generate padded output characters -# of length 4(n+1), with two padding characters at the end: -# -# # n = 1: 4 bytes => 8 characters. -# Base64.strict_encode64('1234') # => "MDEyMw==" -# # n = 2: 7 bytes => 12 characters. -# Base64.strict_encode64('1234567') # => "MDEyMzQ1Ng==" -# -# - Input bytes of length 3n+2 generate padded output characters -# of length 4(n+1), with one padding character at the end: -# -# # n = 1: 5 bytes => 8 characters. -# Base64.strict_encode64('12345') # => "MDEyMzQ=" -# # n = 2: 8 bytes => 12 characters. -# Base64.strict_encode64('12345678') # => "MDEyMzQ1Njc=" -# -# When padding is suppressed, for a positive integer n: -# -# - Input bytes of length 3n generate unpadded output characters -# of length 4n: -# -# # n = 1: 3 bytes => 4 characters. -# Base64.urlsafe_encode64('123', padding: false) # => "MDEy" -# # n = 2: 6 bytes => 8 characters. -# Base64.urlsafe_encode64('123456', padding: false) # => "MDEyMzQ1" -# -# - Input bytes of length 3n+1 generate unpadded output characters -# of length 4n+2, with two padding characters at the end: -# -# # n = 1: 4 bytes => 6 characters. -# Base64.urlsafe_encode64('1234', padding: false) # => "MDEyMw" -# # n = 2: 7 bytes => 10 characters. -# Base64.urlsafe_encode64('1234567', padding: false) # => "MDEyMzQ1Ng" -# -# - Input bytes of length 3n+2 generate unpadded output characters -# of length 4n+3, with one padding character at the end: -# -# # n = 1: 5 bytes => 7 characters. -# Base64.urlsafe_encode64('12345', padding: false) # => "MDEyMzQ" -# # m = 2: 8 bytes => 11 characters. -# Base64.urlsafe_encode64('12345678', padding: false) # => "MDEyMzQ1Njc" -# -# Padding in Decode Methods -# -# All of the \Base64 decode methods support (but do not require) padding. -# -# \Method Base64.decode64 does not check the size of the padding: -# -# Base64.decode64("MDEyMzQ1Njc") # => "01234567" -# Base64.decode64("MDEyMzQ1Njc=") # => "01234567" -# Base64.decode64("MDEyMzQ1Njc==") # => "01234567" -# -# \Method Base64.strict_decode64 strictly enforces padding size: -# -# Base64.strict_decode64("MDEyMzQ1Njc") # Raises ArgumentError -# Base64.strict_decode64("MDEyMzQ1Njc=") # => "01234567" -# Base64.strict_decode64("MDEyMzQ1Njc==") # Raises ArgumentError -# -# \Method Base64.urlsafe_decode64 allows padding in +str+, -# which if present, must be correct: -# see {Padding}[Base64.html#module-Base64-label-Padding], above: -# -# Base64.urlsafe_decode64("MDEyMzQ1Njc") # => "01234567" -# Base64.urlsafe_decode64("MDEyMzQ1Njc=") # => "01234567" -# Base64.urlsafe_decode64("MDEyMzQ1Njc==") # Raises ArgumentError. -# -# == Newlines -# -# An encoded string returned by Base64.encode64 or Base64.urlsafe_encode64 -# has an embedded newline character -# after each 60-character sequence, and, if non-empty, at the end: -# -# # No newline if empty. -# encoded = Base64.encode64("\x00" * 0) -# encoded.index("\n") # => nil -# -# # Newline at end of short output. -# encoded = Base64.encode64("\x00" * 1) -# encoded.size # => 4 -# encoded.index("\n") # => 4 -# -# # Newline at end of longer output. -# encoded = Base64.encode64("\x00" * 45) -# encoded.size # => 60 -# encoded.index("\n") # => 60 -# -# # Newlines embedded and at end of still longer output. -# encoded = Base64.encode64("\x00" * 46) -# encoded.size # => 65 -# encoded.rindex("\n") # => 65 -# encoded.split("\n").map {|s| s.size } # => [60, 4] -# -# The string to be encoded may itself contain newlines, -# which are encoded as \Base64: -# -# # Base64.encode64("\n\n\n") # => "CgoK\n" -# s = "This is line 1\nThis is line 2\n" -# Base64.encode64(s) # => "VGhpcyBpcyBsaW5lIDEKVGhpcyBpcyBsaW5lIDIK\n" -module Base64 - private - - # Returns a string containing the decoding of an RFC-2045-compliant - # \Base64-encoded string +str+: - # - # s = "VGhpcyBpcyBsaW5lIDEKVGhpcyBpcyBsaW5lIDIK\n" - # Base64.decode64(s) # => "This is line 1\nThis is line 2\n" - # - # Non-\Base64 characters in +str+ are ignored; - # see {Encoding Character Set}[Base64.html#module-Base64-label-Encoding+Character+Sets] above: - # these include newline characters and characters - and /: - # - # Base64.decode64("\x00\n-_") # => "" - # - # Padding in +str+ (even if incorrect) is ignored: - # - # Base64.decode64("MDEyMzQ1Njc") # => "01234567" - # Base64.decode64("MDEyMzQ1Njc=") # => "01234567" - # Base64.decode64("MDEyMzQ1Njc==") # => "01234567" - # - # source://base64//base64.rb#241 - def decode64(str); end - - # Returns a string containing the RFC-2045-compliant \Base64-encoding of +bin+. - # - # Per RFC 2045, the returned string may contain the URL-unsafe characters - # + or /; - # see {Encoding Character Set}[Base64.html#module-Base64-label-Encoding+Character+Sets] above: - # - # Base64.encode64("\xFB\xEF\xBE") # => "++++\n" - # Base64.encode64("\xFF\xFF\xFF") # => "////\n" - # - # The returned string may include padding; - # see {Padding}[Base64.html#module-Base64-label-Padding] above. - # - # Base64.encode64('*') # => "Kg==\n" - # - # The returned string ends with a newline character, and if sufficiently long - # will have one or more embedded newline characters; - # see {Newlines}[Base64.html#module-Base64-label-Newlines] above: - # - # Base64.encode64('*') # => "Kg==\n" - # Base64.encode64('*' * 46) - # # => "KioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioq\nKg==\n" - # - # The string to be encoded may itself contain newlines, - # which will be encoded as ordinary \Base64: - # - # Base64.encode64("\n\n\n") # => "CgoK\n" - # s = "This is line 1\nThis is line 2\n" - # Base64.encode64(s) # => "VGhpcyBpcyBsaW5lIDEKVGhpcyBpcyBsaW5lIDIK\n" - # - # source://base64//base64.rb#219 - def encode64(bin); end - - # Returns a string containing the decoding of an RFC-2045-compliant - # \Base64-encoded string +str+: - # - # s = "VGhpcyBpcyBsaW5lIDEKVGhpcyBpcyBsaW5lIDIK" - # Base64.strict_decode64(s) # => "This is line 1\nThis is line 2\n" - # - # Non-\Base64 characters in +str+ not allowed; - # see {Encoding Character Set}[Base64.html#module-Base64-label-Encoding+Character+Sets] above: - # these include newline characters and characters - and /: - # - # Base64.strict_decode64("\n") # Raises ArgumentError - # Base64.strict_decode64('-') # Raises ArgumentError - # Base64.strict_decode64('_') # Raises ArgumentError - # - # Padding in +str+, if present, must be correct: - # - # Base64.strict_decode64("MDEyMzQ1Njc") # Raises ArgumentError - # Base64.strict_decode64("MDEyMzQ1Njc=") # => "01234567" - # Base64.strict_decode64("MDEyMzQ1Njc==") # Raises ArgumentError - # - # source://base64//base64.rb#297 - def strict_decode64(str); end - - # Returns a string containing the RFC-2045-compliant \Base64-encoding of +bin+. - # - # Per RFC 2045, the returned string may contain the URL-unsafe characters - # + or /; - # see {Encoding Character Set}[Base64.html#module-Base64-label-Encoding+Character+Sets] above: - # - # Base64.strict_encode64("\xFB\xEF\xBE") # => "++++\n" - # Base64.strict_encode64("\xFF\xFF\xFF") # => "////\n" - # - # The returned string may include padding; - # see {Padding}[Base64.html#module-Base64-label-Padding] above. - # - # Base64.strict_encode64('*') # => "Kg==\n" - # - # The returned string will have no newline characters, regardless of its length; - # see {Newlines}[Base64.html#module-Base64-label-Newlines] above: - # - # Base64.strict_encode64('*') # => "Kg==" - # Base64.strict_encode64('*' * 46) - # # => "KioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKg==" - # - # The string to be encoded may itself contain newlines, - # which will be encoded as ordinary \Base64: - # - # Base64.strict_encode64("\n\n\n") # => "CgoK" - # s = "This is line 1\nThis is line 2\n" - # Base64.strict_encode64(s) # => "VGhpcyBpcyBsaW5lIDEKVGhpcyBpcyBsaW5lIDIK" - # - # source://base64//base64.rb#273 - def strict_encode64(bin); end - - # Returns the decoding of an RFC-4648-compliant \Base64-encoded string +str+: - # - # +str+ may not contain non-Base64 characters; - # see {Encoding Character Set}[Base64.html#module-Base64-label-Encoding+Character+Sets] above: - # - # Base64.urlsafe_decode64('+') # Raises ArgumentError. - # Base64.urlsafe_decode64('/') # Raises ArgumentError. - # Base64.urlsafe_decode64("\n") # Raises ArgumentError. - # - # Padding in +str+, if present, must be correct: - # see {Padding}[Base64.html#module-Base64-label-Padding], above: - # - # Base64.urlsafe_decode64("MDEyMzQ1Njc") # => "01234567" - # Base64.urlsafe_decode64("MDEyMzQ1Njc=") # => "01234567" - # Base64.urlsafe_decode64("MDEyMzQ1Njc==") # Raises ArgumentError. - # - # source://base64//base64.rb#351 - def urlsafe_decode64(str); end - - # Returns the RFC-4648-compliant \Base64-encoding of +bin+. - # - # Per RFC 4648, the returned string will not contain the URL-unsafe characters - # + or /, - # but instead may contain the URL-safe characters - # - and _; - # see {Encoding Character Set}[Base64.html#module-Base64-label-Encoding+Character+Sets] above: - # - # Base64.urlsafe_encode64("\xFB\xEF\xBE") # => "----" - # Base64.urlsafe_encode64("\xFF\xFF\xFF") # => "____" - # - # By default, the returned string may have padding; - # see {Padding}[Base64.html#module-Base64-label-Padding], above: - # - # Base64.urlsafe_encode64('*') # => "Kg==" - # - # Optionally, you can suppress padding: - # - # Base64.urlsafe_encode64('*', padding: false) # => "Kg" - # - # The returned string will have no newline characters, regardless of its length; - # see {Newlines}[Base64.html#module-Base64-label-Newlines] above: - # - # Base64.urlsafe_encode64('*') # => "Kg==" - # Base64.urlsafe_encode64('*' * 46) - # # => "KioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKg==" - # - # source://base64//base64.rb#328 - def urlsafe_encode64(bin, padding: T.unsafe(nil)); end - - class << self - # Returns a string containing the decoding of an RFC-2045-compliant - # \Base64-encoded string +str+: - # - # s = "VGhpcyBpcyBsaW5lIDEKVGhpcyBpcyBsaW5lIDIK\n" - # Base64.decode64(s) # => "This is line 1\nThis is line 2\n" - # - # Non-\Base64 characters in +str+ are ignored; - # see {Encoding Character Set}[Base64.html#module-Base64-label-Encoding+Character+Sets] above: - # these include newline characters and characters - and /: - # - # Base64.decode64("\x00\n-_") # => "" - # - # Padding in +str+ (even if incorrect) is ignored: - # - # Base64.decode64("MDEyMzQ1Njc") # => "01234567" - # Base64.decode64("MDEyMzQ1Njc=") # => "01234567" - # Base64.decode64("MDEyMzQ1Njc==") # => "01234567" - # - # source://base64//base64.rb#241 - def decode64(str); end - - # Returns a string containing the RFC-2045-compliant \Base64-encoding of +bin+. - # - # Per RFC 2045, the returned string may contain the URL-unsafe characters - # + or /; - # see {Encoding Character Set}[Base64.html#module-Base64-label-Encoding+Character+Sets] above: - # - # Base64.encode64("\xFB\xEF\xBE") # => "++++\n" - # Base64.encode64("\xFF\xFF\xFF") # => "////\n" - # - # The returned string may include padding; - # see {Padding}[Base64.html#module-Base64-label-Padding] above. - # - # Base64.encode64('*') # => "Kg==\n" - # - # The returned string ends with a newline character, and if sufficiently long - # will have one or more embedded newline characters; - # see {Newlines}[Base64.html#module-Base64-label-Newlines] above: - # - # Base64.encode64('*') # => "Kg==\n" - # Base64.encode64('*' * 46) - # # => "KioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioq\nKg==\n" - # - # The string to be encoded may itself contain newlines, - # which will be encoded as ordinary \Base64: - # - # Base64.encode64("\n\n\n") # => "CgoK\n" - # s = "This is line 1\nThis is line 2\n" - # Base64.encode64(s) # => "VGhpcyBpcyBsaW5lIDEKVGhpcyBpcyBsaW5lIDIK\n" - # - # source://base64//base64.rb#219 - def encode64(bin); end - - # Returns a string containing the decoding of an RFC-2045-compliant - # \Base64-encoded string +str+: - # - # s = "VGhpcyBpcyBsaW5lIDEKVGhpcyBpcyBsaW5lIDIK" - # Base64.strict_decode64(s) # => "This is line 1\nThis is line 2\n" - # - # Non-\Base64 characters in +str+ not allowed; - # see {Encoding Character Set}[Base64.html#module-Base64-label-Encoding+Character+Sets] above: - # these include newline characters and characters - and /: - # - # Base64.strict_decode64("\n") # Raises ArgumentError - # Base64.strict_decode64('-') # Raises ArgumentError - # Base64.strict_decode64('_') # Raises ArgumentError - # - # Padding in +str+, if present, must be correct: - # - # Base64.strict_decode64("MDEyMzQ1Njc") # Raises ArgumentError - # Base64.strict_decode64("MDEyMzQ1Njc=") # => "01234567" - # Base64.strict_decode64("MDEyMzQ1Njc==") # Raises ArgumentError - # - # source://base64//base64.rb#297 - def strict_decode64(str); end - - # Returns a string containing the RFC-2045-compliant \Base64-encoding of +bin+. - # - # Per RFC 2045, the returned string may contain the URL-unsafe characters - # + or /; - # see {Encoding Character Set}[Base64.html#module-Base64-label-Encoding+Character+Sets] above: - # - # Base64.strict_encode64("\xFB\xEF\xBE") # => "++++\n" - # Base64.strict_encode64("\xFF\xFF\xFF") # => "////\n" - # - # The returned string may include padding; - # see {Padding}[Base64.html#module-Base64-label-Padding] above. - # - # Base64.strict_encode64('*') # => "Kg==\n" - # - # The returned string will have no newline characters, regardless of its length; - # see {Newlines}[Base64.html#module-Base64-label-Newlines] above: - # - # Base64.strict_encode64('*') # => "Kg==" - # Base64.strict_encode64('*' * 46) - # # => "KioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKg==" - # - # The string to be encoded may itself contain newlines, - # which will be encoded as ordinary \Base64: - # - # Base64.strict_encode64("\n\n\n") # => "CgoK" - # s = "This is line 1\nThis is line 2\n" - # Base64.strict_encode64(s) # => "VGhpcyBpcyBsaW5lIDEKVGhpcyBpcyBsaW5lIDIK" - # - # source://base64//base64.rb#273 - def strict_encode64(bin); end - - # Returns the decoding of an RFC-4648-compliant \Base64-encoded string +str+: - # - # +str+ may not contain non-Base64 characters; - # see {Encoding Character Set}[Base64.html#module-Base64-label-Encoding+Character+Sets] above: - # - # Base64.urlsafe_decode64('+') # Raises ArgumentError. - # Base64.urlsafe_decode64('/') # Raises ArgumentError. - # Base64.urlsafe_decode64("\n") # Raises ArgumentError. - # - # Padding in +str+, if present, must be correct: - # see {Padding}[Base64.html#module-Base64-label-Padding], above: - # - # Base64.urlsafe_decode64("MDEyMzQ1Njc") # => "01234567" - # Base64.urlsafe_decode64("MDEyMzQ1Njc=") # => "01234567" - # Base64.urlsafe_decode64("MDEyMzQ1Njc==") # Raises ArgumentError. - # - # source://base64//base64.rb#351 - def urlsafe_decode64(str); end - - # Returns the RFC-4648-compliant \Base64-encoding of +bin+. - # - # Per RFC 4648, the returned string will not contain the URL-unsafe characters - # + or /, - # but instead may contain the URL-safe characters - # - and _; - # see {Encoding Character Set}[Base64.html#module-Base64-label-Encoding+Character+Sets] above: - # - # Base64.urlsafe_encode64("\xFB\xEF\xBE") # => "----" - # Base64.urlsafe_encode64("\xFF\xFF\xFF") # => "____" - # - # By default, the returned string may have padding; - # see {Padding}[Base64.html#module-Base64-label-Padding], above: - # - # Base64.urlsafe_encode64('*') # => "Kg==" - # - # Optionally, you can suppress padding: - # - # Base64.urlsafe_encode64('*', padding: false) # => "Kg" - # - # The returned string will have no newline characters, regardless of its length; - # see {Newlines}[Base64.html#module-Base64-label-Newlines] above: - # - # Base64.urlsafe_encode64('*') # => "Kg==" - # Base64.urlsafe_encode64('*' * 46) - # # => "KioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKioqKg==" - # - # source://base64//base64.rb#328 - def urlsafe_encode64(bin, padding: T.unsafe(nil)); end - end -end - -# source://base64//base64.rb#186 -Base64::VERSION = T.let(T.unsafe(nil), String) diff --git a/Library/Homebrew/sorbet/rbi/gems/bootsnap@1.18.3.rbi b/Library/Homebrew/sorbet/rbi/gems/bootsnap@1.18.3.rbi deleted file mode 100644 index 312b7128d3f363..00000000000000 --- a/Library/Homebrew/sorbet/rbi/gems/bootsnap@1.18.3.rbi +++ /dev/null @@ -1,652 +0,0 @@ -# typed: true - -# DO NOT EDIT MANUALLY -# This is an autogenerated file for types exported from the `bootsnap` gem. -# Please instead update this file by running `bin/tapioca gem bootsnap`. - -# source://bootsnap//lib/bootsnap/version.rb#3 -module Bootsnap - extend ::Bootsnap - - # @return [Boolean] - # - # source://bootsnap//lib/bootsnap/bundler.rb#6 - def bundler?; end - - class << self - # source://bootsnap//lib/bootsnap.rb#44 - def _instrument(event, path); end - - # source://bootsnap//lib/bootsnap.rb#136 - def absolute_path?(path); end - - # source://bootsnap//lib/bootsnap.rb#82 - def default_setup; end - - # source://bootsnap//lib/bootsnap.rb#37 - def instrumentation=(callback); end - - # source://bootsnap//lib/bootsnap.rb#24 - def log!; end - - # source://bootsnap//lib/bootsnap.rb#14 - def log_stats!; end - - # Returns the value of attribute logger. - # - # source://bootsnap//lib/bootsnap.rb#12 - def logger; end - - # source://bootsnap//lib/bootsnap.rb#28 - def logger=(logger); end - - # Allow the C extension to redefine `rb_get_path` without warning. - # Allow the C extension to redefine `rb_get_path` without warning. - # - # source://bootsnap//lib/bootsnap.rb#144 - def rb_get_path(fname); end - - # source://bootsnap//lib/bootsnap.rb#48 - def setup(cache_dir:, development_mode: T.unsafe(nil), load_path_cache: T.unsafe(nil), ignore_directories: T.unsafe(nil), readonly: T.unsafe(nil), revalidation: T.unsafe(nil), compile_cache_iseq: T.unsafe(nil), compile_cache_yaml: T.unsafe(nil), compile_cache_json: T.unsafe(nil)); end - - # source://bootsnap//lib/bootsnap.rb#78 - def unload_cache!; end - end -end - -# source://bootsnap//lib/bootsnap/compile_cache.rb#4 -module Bootsnap::CompileCache - class << self - # source://bootsnap//lib/bootsnap/compile_cache.rb#12 - def setup(cache_dir:, iseq:, yaml:, json:, readonly: T.unsafe(nil), revalidation: T.unsafe(nil)); end - - # @return [Boolean] - # - # source://bootsnap//lib/bootsnap/compile_cache.rb#46 - def supported?; end - end -end - -# source://bootsnap//lib/bootsnap/compile_cache.rb#10 -class Bootsnap::CompileCache::Error < ::StandardError; end - -# source://bootsnap//lib/bootsnap/compile_cache.rb#5 -Bootsnap::CompileCache::UNCOMPILABLE = T.let(T.unsafe(nil), BasicObject) - -# source://bootsnap//lib/bootsnap/explicit_require.rb#4 -module Bootsnap::ExplicitRequire - class << self - # source://bootsnap//lib/bootsnap/explicit_require.rb#17 - def from_archdir(feature); end - - # source://bootsnap//lib/bootsnap/explicit_require.rb#13 - def from_rubylibdir(feature); end - - # source://bootsnap//lib/bootsnap/explicit_require.rb#9 - def from_self(feature); end - - # Given a set of gems, run a block with the LOAD_PATH narrowed to include - # only core ruby source paths and these gems -- that is, roughly, - # temporarily remove all gems not listed in this call from the LOAD_PATH. - # - # This is useful before bootsnap is fully-initialized to load gems that it - # depends on, without forcing full LOAD_PATH traversals. - # - # source://bootsnap//lib/bootsnap/explicit_require.rb#27 - def with_gems(*gems); end - end -end - -# source://bootsnap//lib/bootsnap/explicit_require.rb#5 -Bootsnap::ExplicitRequire::ARCHDIR = T.let(T.unsafe(nil), String) - -# source://bootsnap//lib/bootsnap/explicit_require.rb#7 -Bootsnap::ExplicitRequire::DLEXT = T.let(T.unsafe(nil), String) - -# source://bootsnap//lib/bootsnap/explicit_require.rb#6 -Bootsnap::ExplicitRequire::RUBYLIBDIR = T.let(T.unsafe(nil), String) - -# source://bootsnap//lib/bootsnap.rb#9 -class Bootsnap::InvalidConfiguration < ::StandardError; end - -# source://bootsnap//lib/bootsnap/load_path_cache.rb#4 -module Bootsnap::LoadPathCache - class << self - # Returns the value of attribute enabled. - # - # source://bootsnap//lib/bootsnap/load_path_cache.rb#27 - def enabled?; end - - # Returns the value of attribute load_path_cache. - # - # source://bootsnap//lib/bootsnap/load_path_cache.rb#27 - def load_path_cache; end - - # Returns the value of attribute loaded_features_index. - # - # source://bootsnap//lib/bootsnap/load_path_cache.rb#27 - def loaded_features_index; end - - # source://bootsnap//lib/bootsnap/load_path_cache.rb#31 - def setup(cache_path:, development_mode:, ignore_directories:, readonly: T.unsafe(nil)); end - - # @return [Boolean] - # - # source://bootsnap//lib/bootsnap/load_path_cache.rb#56 - def supported?; end - - # source://bootsnap//lib/bootsnap/load_path_cache.rb#48 - def unload!; end - end -end - -# source://bootsnap//lib/bootsnap/load_path_cache.rb#22 -Bootsnap::LoadPathCache::CACHED_EXTENSIONS = T.let(T.unsafe(nil), Array) - -# source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#7 -class Bootsnap::LoadPathCache::Cache - # @return [Cache] a new instance of Cache - # - # source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#10 - def initialize(store, path_obj, development_mode: T.unsafe(nil)); end - - # Try to resolve this feature to an absolute path without traversing the - # loadpath. - # - # source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#56 - def find(feature); end - - # What is the path item that contains the dir as child? - # e.g. given "/a/b/c/d" exists, and the path is ["/a/b"], load_dir("c/d") - # is "/a/b". - # - # source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#22 - def load_dir(dir); end - - # source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#116 - def push_paths(sender, *paths); end - - # source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#122 - def reinitialize(path_obj = T.unsafe(nil)); end - - # source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#110 - def unshift_paths(sender, *paths); end - - private - - # @return [Boolean] - # - # source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#135 - def dir_changed?; end - - # source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#180 - def expand_path(feature); end - - # source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#211 - def maybe_append_extension(feature); end - - # source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#188 - def now; end - - # source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#145 - def push_paths_locked(*paths); end - - # source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#207 - def search_index(feature); end - - # @return [Boolean] - # - # source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#184 - def stale?; end - - # source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#239 - def try_ext(feature); end - - # source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#219 - def try_index(feature); end - - # source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#163 - def unshift_paths_locked(*paths); end -end - -# seconds -# -# source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#8 -Bootsnap::LoadPathCache::Cache::AGE_THRESHOLD = T.let(T.unsafe(nil), Integer) - -# { 'enumerator' => nil, 'enumerator.so' => nil, ... } -# -# source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#32 -Bootsnap::LoadPathCache::Cache::BUILTIN_FEATURES = T.let(T.unsafe(nil), Hash) - -# source://bootsnap//lib/bootsnap/load_path_cache/cache.rb#27 -Bootsnap::LoadPathCache::Cache::TRUFFLERUBY_LIB_DIR_PREFIX = T.let(T.unsafe(nil), T.untyped) - -# source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#5 -module Bootsnap::LoadPathCache::ChangeObserver - class << self - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#65 - def register(arr, observer); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#74 - def unregister(arr); end - end -end - -# source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#6 -module Bootsnap::LoadPathCache::ChangeObserver::ArrayMixin - # For each method that adds items to one end or another of the array - # (<<, push, unshift, concat), override that method to also notify the - # observer of the change. - # - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#10 - def <<(entry); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def []=(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#15 - def append(*entries); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def clear(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#58 - def clone; end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def collect!(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def compact!(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#27 - def concat(entries); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def delete(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def delete_at(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def delete_if(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#58 - def dup; end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def fill(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def flatten!(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def insert(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def keep_if(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def map!(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def pop(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#21 - def prepend(*entries); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#15 - def push(*entries); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def reject!(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def replace(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def reverse!(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def rotate!(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def select!(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def shift(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def shuffle!(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def slice!(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def sort!(*args, &block); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#51 - def sort_by!(*args, &block); end - - # uniq! keeps the first occurrence of each path, otherwise preserving - # order, preserving the effective load path - # - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#34 - def uniq!(*args); end - - # source://bootsnap//lib/bootsnap/load_path_cache/change_observer.rb#21 - def unshift(*entries); end -end - -# source://bootsnap//lib/bootsnap/load_path_cache.rb#16 -Bootsnap::LoadPathCache::DLEXT = T.let(T.unsafe(nil), String) - -# This is nil on linux and darwin, but I think it's '.o' on some other -# platform. I'm not really sure which, but it seems better to replicate -# ruby's semantics as faithfully as possible. -# -# source://bootsnap//lib/bootsnap/load_path_cache.rb#20 -Bootsnap::LoadPathCache::DLEXT2 = T.let(T.unsafe(nil), T.untyped) - -# source://bootsnap//lib/bootsnap/load_path_cache.rb#11 -Bootsnap::LoadPathCache::DL_EXTENSIONS = T.let(T.unsafe(nil), Array) - -# source://bootsnap//lib/bootsnap/load_path_cache.rb#7 -Bootsnap::LoadPathCache::DOT_RB = T.let(T.unsafe(nil), String) - -# source://bootsnap//lib/bootsnap/load_path_cache.rb#8 -Bootsnap::LoadPathCache::DOT_SO = T.let(T.unsafe(nil), String) - -# source://bootsnap//lib/bootsnap/load_path_cache.rb#5 -Bootsnap::LoadPathCache::FALLBACK_SCAN = T.let(T.unsafe(nil), BasicObject) - -# LoadedFeaturesIndex partially mirrors an internal structure in ruby that -# we can't easily obtain an interface to. -# -# This works around an issue where, without bootsnap, *ruby* knows that it -# has already required a file by its short name (e.g. require 'bundler') if -# a new instance of bundler is added to the $LOAD_PATH which resolves to a -# different absolute path. This class makes bootsnap smart enough to -# realize that it has already loaded 'bundler', and not just -# '/path/to/bundler'. -# -# If you disable LoadedFeaturesIndex, you can see the problem this solves by: -# -# 1. `require 'a'` -# 2. Prepend a new $LOAD_PATH element containing an `a.rb` -# 3. `require 'a'` -# -# Ruby returns false from step 3. -# With bootsnap but with no LoadedFeaturesIndex, this loads two different -# `a.rb`s. -# With bootsnap and with LoadedFeaturesIndex, this skips the second load, -# returning false like ruby. -# -# source://bootsnap//lib/bootsnap/load_path_cache/loaded_features_index.rb#26 -class Bootsnap::LoadPathCache::LoadedFeaturesIndex - # @return [LoadedFeaturesIndex] a new instance of LoadedFeaturesIndex - # - # source://bootsnap//lib/bootsnap/load_path_cache/loaded_features_index.rb#27 - def initialize; end - - # source://bootsnap//lib/bootsnap/load_path_cache/loaded_features_index.rb#72 - def cursor(short); end - - # source://bootsnap//lib/bootsnap/load_path_cache/loaded_features_index.rb#78 - def identify(short, cursor); end - - # @return [Boolean] - # - # source://bootsnap//lib/bootsnap/load_path_cache/loaded_features_index.rb#68 - def key?(feature); end - - # We've optimized for initialize and register to be fast, and purge to be tolerable. - # If access patterns make this not-okay, we can lazy-invert the LFI on - # first purge and work from there. - # - # source://bootsnap//lib/bootsnap/load_path_cache/loaded_features_index.rb#54 - def purge(feature); end - - # source://bootsnap//lib/bootsnap/load_path_cache/loaded_features_index.rb#61 - def purge_multi(features); end - - # There is a relatively uncommon case where we could miss adding an - # entry: - # - # If the user asked for e.g. `require 'bundler'`, and we went through the - # `FALLBACK_SCAN` pathway in `kernel_require.rb` and therefore did not - # pass `long` (the full expanded absolute path), then we did are not able - # to confidently add the `bundler.rb` form to @lfi. - # - # We could either: - # - # 1. Just add `bundler.rb`, `bundler.so`, and so on, which is close but - # not quite right; or - # 2. Inspect $LOADED_FEATURES upon return from yield to find the matching - # entry. - # - # source://bootsnap//lib/bootsnap/load_path_cache/loaded_features_index.rb#105 - def register(short, long); end - - private - - # Might Ruby automatically search for this extension if - # someone tries to 'require' the file without it? E.g. Ruby - # will implicitly try 'x.rb' if you ask for 'x'. - # - # This is complex and platform-dependent, and the Ruby docs are a little - # handwavy about what will be tried when and in what order. - # So optimistically pretend that all known elidable extensions - # will be tried on all platforms, and that people are unlikely - # to name files in a way that assumes otherwise. - # (E.g. It's unlikely that someone will know that their code - # will _never_ run on MacOS, and therefore think they can get away - # with calling a Ruby file 'x.dylib.rb' and then requiring it as 'x.dylib'.) - # - # See . - # - # @return [Boolean] - # - # source://bootsnap//lib/bootsnap/load_path_cache/loaded_features_index.rb#146 - def extension_elidable?(feature); end - - # source://bootsnap//lib/bootsnap/load_path_cache/loaded_features_index.rb#150 - def strip_extension_if_elidable(feature); end -end - -# source://bootsnap//lib/bootsnap/load_path_cache/loaded_features_index.rb#129 -Bootsnap::LoadPathCache::LoadedFeaturesIndex::STRIP_EXTENSION = T.let(T.unsafe(nil), Regexp) - -# source://bootsnap//lib/bootsnap/load_path_cache/path.rb#7 -class Bootsnap::LoadPathCache::Path - # @return [Path] a new instance of Path - # - # source://bootsnap//lib/bootsnap/load_path_cache/path.rb#24 - def initialize(path, real: T.unsafe(nil)); end - - # Return a list of all the requirable files and all of the subdirectories - # of this +Path+. - # - # source://bootsnap//lib/bootsnap/load_path_cache/path.rb#59 - def entries_and_dirs(store); end - - # source://bootsnap//lib/bootsnap/load_path_cache/path.rb#82 - def expanded_path; end - - # True if the path exists, but represents a non-directory object - # - # @return [Boolean] - # - # source://bootsnap//lib/bootsnap/load_path_cache/path.rb#47 - def non_directory?; end - - # Returns the value of attribute path. - # - # source://bootsnap//lib/bootsnap/load_path_cache/path.rb#22 - def path; end - - # @return [Boolean] - # - # source://bootsnap//lib/bootsnap/load_path_cache/path.rb#53 - def relative?; end - - # A path is considered 'stable' if it is part of a Gem.path or the ruby - # distribution. When adding or removing files in these paths, the cache - # must be cleared before the change will be noticed. - # - # @return [Boolean] - # - # source://bootsnap//lib/bootsnap/load_path_cache/path.rb#11 - def stable?; end - - # source://bootsnap//lib/bootsnap/load_path_cache/path.rb#29 - def to_realpath; end - - # A path is considered volatile if it doesn't live under a Gem.path or - # the ruby distribution root. These paths are scanned for new additions - # more frequently. - # - # @return [Boolean] - # - # source://bootsnap//lib/bootsnap/load_path_cache/path.rb#18 - def volatile?; end - - private - - # last time a directory was modified in this subtree. +dirs+ should be a - # list of relative paths to directories under +path+. e.g. for /a/b and - # /a/b/c, pass ('/a/b', ['c']) - # - # source://bootsnap//lib/bootsnap/load_path_cache/path.rb#99 - def latest_mtime(path, dirs); end - - # (expensive) returns [entries, dirs] - # - # source://bootsnap//lib/bootsnap/load_path_cache/path.rb#92 - def scan!; end - - # source://bootsnap//lib/bootsnap/load_path_cache/path.rb#123 - def stability; end -end - -# Built-in ruby lib stuff doesn't change, but things can occasionally be -# installed into sitedir, which generally lives under rubylibdir. -# -# source://bootsnap//lib/bootsnap/load_path_cache/path.rb#120 -Bootsnap::LoadPathCache::Path::RUBY_LIBDIR = T.let(T.unsafe(nil), String) - -# source://bootsnap//lib/bootsnap/load_path_cache/path.rb#121 -Bootsnap::LoadPathCache::Path::RUBY_SITEDIR = T.let(T.unsafe(nil), String) - -# a Path can be either stable of volatile, depending on how frequently we -# expect its contents may change. Stable paths aren't rescanned nearly as -# often. -# -# source://bootsnap//lib/bootsnap/load_path_cache/path.rb#115 -Bootsnap::LoadPathCache::Path::STABLE = T.let(T.unsafe(nil), Symbol) - -# source://bootsnap//lib/bootsnap/load_path_cache/path.rb#116 -Bootsnap::LoadPathCache::Path::VOLATILE = T.let(T.unsafe(nil), Symbol) - -# source://bootsnap//lib/bootsnap/load_path_cache/path_scanner.rb#7 -module Bootsnap::LoadPathCache::PathScanner - class << self - # source://bootsnap//lib/bootsnap/load_path_cache/path_scanner.rb#23 - def call(path); end - - # Returns the value of attribute ignored_directories. - # - # source://bootsnap//lib/bootsnap/load_path_cache/path_scanner.rb#21 - def ignored_directories; end - - # Sets the attribute ignored_directories - # - # @param value the value to set the attribute ignored_directories to. - # - # source://bootsnap//lib/bootsnap/load_path_cache/path_scanner.rb#21 - def ignored_directories=(_arg0); end - - # source://bootsnap//lib/bootsnap/load_path_cache/path_scanner.rb#69 - def os_path(path); end - - # source://bootsnap//lib/bootsnap/load_path_cache/path_scanner.rb#49 - def walk(absolute_dir_path, relative_dir_path, &block); end - end -end - -# source://bootsnap//lib/bootsnap/load_path_cache/path_scanner.rb#10 -Bootsnap::LoadPathCache::PathScanner::ALTERNATIVE_NATIVE_EXTENSIONS_PATTERN = T.let(T.unsafe(nil), Regexp) - -# source://bootsnap//lib/bootsnap/load_path_cache/path_scanner.rb#12 -Bootsnap::LoadPathCache::PathScanner::BUNDLE_PATH = T.let(T.unsafe(nil), String) - -# source://bootsnap//lib/bootsnap/load_path_cache/path_scanner.rb#9 -Bootsnap::LoadPathCache::PathScanner::NORMALIZE_NATIVE_EXTENSIONS = T.let(T.unsafe(nil), TrueClass) - -# source://bootsnap//lib/bootsnap/load_path_cache/path_scanner.rb#8 -Bootsnap::LoadPathCache::PathScanner::REQUIRABLE_EXTENSIONS = T.let(T.unsafe(nil), Array) - -# source://bootsnap//lib/bootsnap/load_path_cache.rb#9 -Bootsnap::LoadPathCache::SLASH = T.let(T.unsafe(nil), String) - -# source://bootsnap//lib/bootsnap/load_path_cache/store.rb#9 -class Bootsnap::LoadPathCache::Store - # @return [Store] a new instance of Store - # - # source://bootsnap//lib/bootsnap/load_path_cache/store.rb#16 - def initialize(store_path, readonly: T.unsafe(nil)); end - - # @raise [SetOutsideTransactionNotAllowed] - # - # source://bootsnap//lib/bootsnap/load_path_cache/store.rb#28 - def fetch(key); end - - # source://bootsnap//lib/bootsnap/load_path_cache/store.rb#24 - def get(key); end - - # @raise [SetOutsideTransactionNotAllowed] - # - # source://bootsnap//lib/bootsnap/load_path_cache/store.rb#40 - def set(key, value); end - - # @raise [NestedTransactionError] - # - # source://bootsnap//lib/bootsnap/load_path_cache/store.rb#49 - def transaction; end - - private - - # source://bootsnap//lib/bootsnap/load_path_cache/store.rb#66 - def commit_transaction; end - - # source://bootsnap//lib/bootsnap/load_path_cache/store.rb#112 - def default_data; end - - # source://bootsnap//lib/bootsnap/load_path_cache/store.rb#95 - def dump_data; end - - # source://bootsnap//lib/bootsnap/load_path_cache/store.rb#73 - def load_data; end - - # source://bootsnap//lib/bootsnap/load_path_cache/store.rb#61 - def mark_for_mutation!; end - - # source://bootsnap//lib/bootsnap/load_path_cache/store.rb#116 - def mkdir_p(path); end -end - -# source://bootsnap//lib/bootsnap/load_path_cache/store.rb#11 -Bootsnap::LoadPathCache::Store::CURRENT_VERSION = T.let(T.unsafe(nil), String) - -# source://bootsnap//lib/bootsnap/load_path_cache/store.rb#13 -class Bootsnap::LoadPathCache::Store::NestedTransactionError < ::StandardError; end - -# source://bootsnap//lib/bootsnap/load_path_cache/store.rb#14 -class Bootsnap::LoadPathCache::Store::SetOutsideTransactionNotAllowed < ::StandardError; end - -# source://bootsnap//lib/bootsnap/load_path_cache/store.rb#10 -Bootsnap::LoadPathCache::Store::VERSION_KEY = T.let(T.unsafe(nil), String) - -# source://bootsnap//lib/bootsnap/version.rb#4 -Bootsnap::VERSION = T.let(T.unsafe(nil), String) diff --git a/Library/Homebrew/sorbet/rbi/gems/erubi@1.12.0.rbi b/Library/Homebrew/sorbet/rbi/gems/erubi@1.13.0.rbi similarity index 90% rename from Library/Homebrew/sorbet/rbi/gems/erubi@1.12.0.rbi rename to Library/Homebrew/sorbet/rbi/gems/erubi@1.13.0.rbi index 44d28c69cec872..16d45faf0e6eb0 100644 --- a/Library/Homebrew/sorbet/rbi/gems/erubi@1.12.0.rbi +++ b/Library/Homebrew/sorbet/rbi/gems/erubi@1.13.0.rbi @@ -4,15 +4,19 @@ # This is an autogenerated file for types exported from the `erubi` gem. # Please instead update this file by running `bin/tapioca gem erubi`. + # source://erubi//lib/erubi.rb#3 module Erubi + private + + def h(_arg0); end + class << self - # source://erubi//lib/erubi.rb#35 - def h(value); end + def h(_arg0); end end end -# source://erubi//lib/erubi.rb#54 +# source://erubi//lib/erubi.rb#51 class Erubi::Engine # Initialize a new Erubi::Engine. Options: # +:bufval+ :: The value to use for the buffer variable, as a string (default '::String.new'). @@ -43,64 +47,64 @@ class Erubi::Engine # # @return [Engine] a new instance of Engine # - # source://erubi//lib/erubi.rb#94 + # source://erubi//lib/erubi.rb#91 def initialize(input, properties = T.unsafe(nil)); end # The variable name used for the buffer variable. # - # source://erubi//lib/erubi.rb#65 + # source://erubi//lib/erubi.rb#62 def bufvar; end # The filename of the template, if one was given. # - # source://erubi//lib/erubi.rb#62 + # source://erubi//lib/erubi.rb#59 def filename; end # The frozen ruby source code generated from the template, which can be evaled. # - # source://erubi//lib/erubi.rb#59 + # source://erubi//lib/erubi.rb#56 def src; end private # Add ruby code to the template # - # source://erubi//lib/erubi.rb#226 + # source://erubi//lib/erubi.rb#223 def add_code(code); end # Add the given ruby expression result to the template, # escaping it based on the indicator given and escape flag. # - # source://erubi//lib/erubi.rb#235 + # source://erubi//lib/erubi.rb#232 def add_expression(indicator, code); end # Add the result of Ruby expression to the template # - # source://erubi//lib/erubi.rb#244 + # source://erubi//lib/erubi.rb#241 def add_expression_result(code); end # Add the escaped result of Ruby expression to the template # - # source://erubi//lib/erubi.rb#249 + # source://erubi//lib/erubi.rb#246 def add_expression_result_escaped(code); end # Add the given postamble to the src. Can be overridden in subclasses # to make additional changes to src that depend on the current state. # - # source://erubi//lib/erubi.rb#255 + # source://erubi//lib/erubi.rb#252 def add_postamble(postamble); end # Add raw text to the template. Modifies argument if argument is mutable as a memory optimization. # Must be called with a string, cannot be called with nil (Rails's subclass depends on it). # - # source://erubi//lib/erubi.rb#213 + # source://erubi//lib/erubi.rb#210 def add_text(text); end # Raise an exception, as the base engine class does not support handling other indicators. # # @raise [ArgumentError] # - # source://erubi//lib/erubi.rb#261 + # source://erubi//lib/erubi.rb#258 def handle(indicator, code, tailch, rspace, lspace); end # Make sure that any current expression has been terminated. @@ -108,7 +112,7 @@ class Erubi::Engine # the chain_appends option is used, expressions may not be # terminated. # - # source://erubi//lib/erubi.rb#289 + # source://erubi//lib/erubi.rb#286 def terminate_expression; end # Make sure the buffer variable is the target of the next append @@ -118,13 +122,13 @@ class Erubi::Engine # This method should only be called if the block will result in # code where << will append to the bufvar. # - # source://erubi//lib/erubi.rb#271 + # source://erubi//lib/erubi.rb#268 def with_buffer; end end # The default regular expression used for scanning. # -# source://erubi//lib/erubi.rb#56 +# source://erubi//lib/erubi.rb#53 Erubi::Engine::DEFAULT_REGEXP = T.let(T.unsafe(nil), Regexp) # source://erubi//lib/erubi.rb#17 diff --git a/Library/Homebrew/sorbet/rbi/gems/json_schemer@2.2.1.rbi b/Library/Homebrew/sorbet/rbi/gems/json_schemer@2.3.0.rbi similarity index 98% rename from Library/Homebrew/sorbet/rbi/gems/json_schemer@2.2.1.rbi rename to Library/Homebrew/sorbet/rbi/gems/json_schemer@2.3.0.rbi index 797f7724b88cd5..c41fc70800f04a 100644 --- a/Library/Homebrew/sorbet/rbi/gems/json_schemer@2.2.1.rbi +++ b/Library/Homebrew/sorbet/rbi/gems/json_schemer@2.3.0.rbi @@ -11,61 +11,61 @@ # source://json_schemer//lib/json_schemer/version.rb#2 module JSONSchemer class << self - # source://json_schemer//lib/json_schemer.rb#235 + # source://json_schemer//lib/json_schemer.rb#234 def configuration; end # @yield [configuration] # - # source://json_schemer//lib/json_schemer.rb#239 + # source://json_schemer//lib/json_schemer.rb#238 def configure; end - # source://json_schemer//lib/json_schemer.rb#143 + # source://json_schemer//lib/json_schemer.rb#142 def draft201909; end - # source://json_schemer//lib/json_schemer.rb#131 + # source://json_schemer//lib/json_schemer.rb#130 def draft202012; end - # source://json_schemer//lib/json_schemer.rb#179 + # source://json_schemer//lib/json_schemer.rb#178 def draft4; end - # source://json_schemer//lib/json_schemer.rb#167 + # source://json_schemer//lib/json_schemer.rb#166 def draft6; end - # source://json_schemer//lib/json_schemer.rb#155 + # source://json_schemer//lib/json_schemer.rb#154 def draft7; end - # source://json_schemer//lib/json_schemer.rb#231 + # source://json_schemer//lib/json_schemer.rb#230 def openapi(document, **options); end - # source://json_schemer//lib/json_schemer.rb#201 + # source://json_schemer//lib/json_schemer.rb#200 def openapi30; end - # source://json_schemer//lib/json_schemer.rb#223 + # source://json_schemer//lib/json_schemer.rb#222 def openapi30_document; end - # source://json_schemer//lib/json_schemer.rb#191 + # source://json_schemer//lib/json_schemer.rb#190 def openapi31; end - # source://json_schemer//lib/json_schemer.rb#215 + # source://json_schemer//lib/json_schemer.rb#214 def openapi31_document; end - # source://json_schemer//lib/json_schemer.rb#116 + # source://json_schemer//lib/json_schemer.rb#115 def schema(schema, **options); end # @return [Boolean] # - # source://json_schemer//lib/json_schemer.rb#121 + # source://json_schemer//lib/json_schemer.rb#120 def valid_schema?(schema, **options); end - # source://json_schemer//lib/json_schemer.rb#126 + # source://json_schemer//lib/json_schemer.rb#125 def validate_schema(schema, **options); end private - # source://json_schemer//lib/json_schemer.rb#264 + # source://json_schemer//lib/json_schemer.rb#263 def meta_schema(schema, options); end - # source://json_schemer//lib/json_schemer.rb#245 + # source://json_schemer//lib/json_schemer.rb#244 def resolve(schema, options); end end end @@ -1306,7 +1306,7 @@ module JSONSchemer::Errors end end -# source://json_schemer//lib/json_schemer.rb#107 +# source://json_schemer//lib/json_schemer.rb#106 JSONSchemer::FILE_URI_REF_RESOLVER = T.let(T.unsafe(nil), Proc) # source://json_schemer//lib/json_schemer/format/duration.rb#3 @@ -1821,19 +1821,19 @@ JSONSchemer::I18N_SCOPE = T.let(T.unsafe(nil), String) # source://json_schemer//lib/json_schemer/result.rb#4 JSONSchemer::I18N_SEPARATOR = T.let(T.unsafe(nil), String) -# source://json_schemer//lib/json_schemer.rb#77 +# source://json_schemer//lib/json_schemer.rb#76 class JSONSchemer::InvalidEcmaRegexp < ::StandardError; end -# source://json_schemer//lib/json_schemer.rb#76 +# source://json_schemer//lib/json_schemer.rb#75 class JSONSchemer::InvalidFileURI < ::StandardError; end -# source://json_schemer//lib/json_schemer.rb#74 +# source://json_schemer//lib/json_schemer.rb#73 class JSONSchemer::InvalidRefPointer < ::StandardError; end -# source://json_schemer//lib/json_schemer.rb#73 +# source://json_schemer//lib/json_schemer.rb#72 class JSONSchemer::InvalidRefResolution < ::StandardError; end -# source://json_schemer//lib/json_schemer.rb#75 +# source://json_schemer//lib/json_schemer.rb#74 class JSONSchemer::InvalidRegexpResolution < ::StandardError; end # source://json_schemer//lib/json_schemer/keyword.rb#3 @@ -1915,10 +1915,10 @@ JSONSchemer::Location::JSON_POINTER_TOKEN_ESCAPE_CHARS = T.let(T.unsafe(nil), Ha # source://json_schemer//lib/json_schemer/location.rb#5 JSONSchemer::Location::JSON_POINTER_TOKEN_ESCAPE_REGEX = T.let(T.unsafe(nil), Regexp) -# source://json_schemer//lib/json_schemer.rb#286 +# source://json_schemer//lib/json_schemer.rb#285 JSONSchemer::META_SCHEMAS_BY_BASE_URI_STR = T.let(T.unsafe(nil), Hash) -# source://json_schemer//lib/json_schemer.rb#274 +# source://json_schemer//lib/json_schemer.rb#273 JSONSchemer::META_SCHEMA_CALLABLES_BY_BASE_URI_STR = T.let(T.unsafe(nil), Hash) # source://json_schemer//lib/json_schemer/openapi.rb#3 @@ -2648,37 +2648,37 @@ JSONSchemer::Schema::UNKNOWN_KEYWORD_CLASS = JSONSchemer::Draft202012::Vocab::Co # source://json_schemer//lib/json_schemer/schema.rb#21 JSONSchemer::Schema::VOCABULARY_KEYWORD_CLASS = JSONSchemer::Draft202012::Vocab::Core::Vocabulary -# source://json_schemer//lib/json_schemer.rb#70 +# source://json_schemer//lib/json_schemer.rb#69 class JSONSchemer::UnknownContentEncoding < ::StandardError; end -# source://json_schemer//lib/json_schemer.rb#71 +# source://json_schemer//lib/json_schemer.rb#70 class JSONSchemer::UnknownContentMediaType < ::StandardError; end -# source://json_schemer//lib/json_schemer.rb#68 +# source://json_schemer//lib/json_schemer.rb#67 class JSONSchemer::UnknownFormat < ::StandardError; end -# source://json_schemer//lib/json_schemer.rb#72 +# source://json_schemer//lib/json_schemer.rb#71 class JSONSchemer::UnknownOutputFormat < ::StandardError; end -# source://json_schemer//lib/json_schemer.rb#67 +# source://json_schemer//lib/json_schemer.rb#66 class JSONSchemer::UnknownRef < ::StandardError; end -# source://json_schemer//lib/json_schemer.rb#69 +# source://json_schemer//lib/json_schemer.rb#68 class JSONSchemer::UnknownVocabulary < ::StandardError; end -# source://json_schemer//lib/json_schemer.rb#66 +# source://json_schemer//lib/json_schemer.rb#65 class JSONSchemer::UnsupportedOpenAPIVersion < ::StandardError; end # source://json_schemer//lib/json_schemer/version.rb#3 JSONSchemer::VERSION = T.let(T.unsafe(nil), String) -# source://json_schemer//lib/json_schemer.rb#79 +# source://json_schemer//lib/json_schemer.rb#78 JSONSchemer::VOCABULARIES = T.let(T.unsafe(nil), Hash) -# source://json_schemer//lib/json_schemer.rb#103 +# source://json_schemer//lib/json_schemer.rb#102 JSONSchemer::VOCABULARY_ORDER = T.let(T.unsafe(nil), Hash) -# source://json_schemer//lib/json_schemer.rb#105 +# source://json_schemer//lib/json_schemer.rb#104 JSONSchemer::WINDOWS_URI_PATH_REGEX = T.let(T.unsafe(nil), Regexp) # source://json_schemer//lib/json_schemer/result.rb#7 diff --git a/Library/Homebrew/sorbet/rbi/gems/parlour@8.1.0.rbi b/Library/Homebrew/sorbet/rbi/gems/parlour@9.0.0.rbi similarity index 99% rename from Library/Homebrew/sorbet/rbi/gems/parlour@8.1.0.rbi rename to Library/Homebrew/sorbet/rbi/gems/parlour@9.0.0.rbi index 45bb33b1725e82..7a10e595611410 100644 --- a/Library/Homebrew/sorbet/rbi/gems/parlour@8.1.0.rbi +++ b/Library/Homebrew/sorbet/rbi/gems/parlour@9.0.0.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `parlour` gem. # Please instead update this file by running `bin/tapioca gem parlour`. + # source://parlour//lib/parlour/version.rb#2 module Parlour; end @@ -374,7 +375,7 @@ end # The RBI generator. # -# source://parlour//lib/parlour/rbi_generator/parameter.rb#5 +# source://parlour//lib/parlour/rbi_generator/parameter.rb#4 class Parlour::RbiGenerator < ::Parlour::Generator # @return [RbiGenerator] a new instance of RbiGenerator # @@ -913,7 +914,7 @@ class Parlour::RbiGenerator::Namespace < ::Parlour::RbiGenerator::RbiObject # @param block [T.proc.params(x: Attribute).void, nil] # @return [Attribute] # - # source://sorbet-runtime/0.5.11258/lib/types/private/methods/_methods.rb#257 + # source://sorbet-runtime/0.5.11409/lib/types/private/methods/_methods.rb#257 def create_attr(*args, **_arg1, &blk); end # source://parlour//lib/parlour/rbi_generator/namespace.rb#472 @@ -1121,7 +1122,7 @@ class Parlour::RbiGenerator::Namespace < ::Parlour::RbiGenerator::RbiObject # @return [Array] # - # source://sorbet-runtime/0.5.11258/lib/types/private/methods/_methods.rb#257 + # source://sorbet-runtime/0.5.11409/lib/types/private/methods/_methods.rb#257 def type_aliases(*args, **_arg1, &blk); end private @@ -1428,7 +1429,7 @@ end # The RBS generator. # -# source://parlour//lib/parlour/rbs_generator/rbs_object.rb#8 +# source://parlour//lib/parlour/rbs_generator/rbs_object.rb#3 class Parlour::RbsGenerator < ::Parlour::Generator # @return [RbsGenerator] a new instance of RbsGenerator # @@ -1885,7 +1886,7 @@ class Parlour::RbsGenerator::Namespace < ::Parlour::RbsGenerator::RbsObject # @param block [T.proc.params(x: Attribute).void, nil] # @return [Attribute] # - # source://sorbet-runtime/0.5.11258/lib/types/private/methods/_methods.rb#257 + # source://sorbet-runtime/0.5.11409/lib/types/private/methods/_methods.rb#257 def create_attr(*args, **_arg1, &blk); end # source://parlour//lib/parlour/rbs_generator/namespace.rb#347 @@ -2052,7 +2053,7 @@ class Parlour::RbsGenerator::Namespace < ::Parlour::RbsGenerator::RbsObject # @return [Array] # - # source://sorbet-runtime/0.5.11258/lib/types/private/methods/_methods.rb#257 + # source://sorbet-runtime/0.5.11409/lib/types/private/methods/_methods.rb#257 def type_aliases(*args, **_arg1, &blk); end private @@ -2395,7 +2396,7 @@ class Parlour::TypeParser::IntermediateSig < ::T::Struct prop :params, T.nilable(T::Array[::Parser::AST::Node]) class << self - # source://sorbet-runtime/0.5.11258/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11409/lib/types/struct.rb#13 def inherited(s); end end end @@ -2450,7 +2451,7 @@ class Parlour::TypedObject # @param comment [String, Array] # @return [void] # - # source://sorbet-runtime/0.5.11258/lib/types/private/methods/_methods.rb#257 + # source://sorbet-runtime/0.5.11409/lib/types/private/methods/_methods.rb#257 def add_comments(*args, **_arg1, &blk); end # source://parlour//lib/parlour/typed_object.rb#32 @@ -2471,7 +2472,7 @@ class Parlour::TypedObject # @return [String] # - # source://sorbet-runtime/0.5.11258/lib/types/private/methods/_methods.rb#257 + # source://sorbet-runtime/0.5.11409/lib/types/private/methods/_methods.rb#257 def inspect(*args, **_arg1, &blk); end # source://parlour//lib/parlour/typed_object.rb#26 @@ -2480,7 +2481,7 @@ class Parlour::TypedObject # @return [String] # - # source://sorbet-runtime/0.5.11258/lib/types/private/methods/_methods.rb#257 + # source://sorbet-runtime/0.5.11409/lib/types/private/methods/_methods.rb#257 def to_s(*args, **_arg1, &blk); end protected @@ -2725,7 +2726,7 @@ end # A type which can be called as a function. # -# source://parlour//lib/parlour/types.rb#505 +# source://parlour//lib/parlour/types.rb#504 class Parlour::Types::Proc < ::Parlour::Types::Type # source://parlour//lib/parlour/types.rb#533 sig do diff --git a/Library/Homebrew/sorbet/rbi/gems/parser@3.3.1.0.rbi b/Library/Homebrew/sorbet/rbi/gems/parser@3.3.3.0.rbi similarity index 86% rename from Library/Homebrew/sorbet/rbi/gems/parser@3.3.1.0.rbi rename to Library/Homebrew/sorbet/rbi/gems/parser@3.3.3.0.rbi index 85ee30fdec2e50..5c8811c7128cd9 100644 --- a/Library/Homebrew/sorbet/rbi/gems/parser@3.3.1.0.rbi +++ b/Library/Homebrew/sorbet/rbi/gems/parser@3.3.3.0.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `parser` gem. # Please instead update this file by running `bin/tapioca gem parser`. + # @api public # # source://parser//lib/parser.rb#19 @@ -665,7 +666,7 @@ end # # @api public # -# source://parser//lib/parser/base.rb#29 +# source://parser//lib/parser/base.rb#16 class Parser::Base < ::Racc::Parser # @api public # @param builder [Parser::Builders::Default] The AST builder to use. @@ -1673,8 +1674,8 @@ class Parser::CurrentArgStack def top; end end -# source://parser//lib/parser/current.rb#102 -Parser::CurrentRuby = Parser::Ruby31 +# source://parser//lib/parser/current.rb#120 +Parser::CurrentRuby = Parser::Ruby33 # @api private # @@ -3242,7 +3243,7 @@ Parser::Meta::NODE_TYPES = T.let(T.unsafe(nil), Set) # @api public # @deprecated Use {Parser::TreeRewriter} # -# source://parser//lib/parser/rewriter.rb#22 +# source://parser//lib/parser/rewriter.rb#14 class Parser::Rewriter < ::Parser::AST::Processor extend ::Parser::Deprecation @@ -3323,1796 +3324,1792 @@ end # source://parser//lib/parser/rewriter.rb#91 Parser::Rewriter::DEPRECATION_WARNING = T.let(T.unsafe(nil), String) -# source://parser//lib/parser/ruby31.rb#14 -class Parser::Ruby31 < ::Parser::Base +# source://parser//lib/parser/ruby33.rb#14 +class Parser::Ruby33 < ::Parser::Base # reduce 0 omitted # - # source://parser//lib/parser/ruby31.rb#8435 + # source://parser//lib/parser/ruby33.rb#8371 def _reduce_1(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8489 + # source://parser//lib/parser/ruby33.rb#8425 def _reduce_10(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9124 + # source://parser//lib/parser/ruby33.rb#9024 def _reduce_100(val, _values, result); end # reduce 101 omitted # - # source://parser//lib/parser/ruby31.rb#9133 + # source://parser//lib/parser/ruby33.rb#9033 def _reduce_102(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9139 + # source://parser//lib/parser/ruby33.rb#9039 def _reduce_103(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9145 + # source://parser//lib/parser/ruby33.rb#9045 def _reduce_104(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9151 + # source://parser//lib/parser/ruby33.rb#9051 def _reduce_105(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9157 + # source://parser//lib/parser/ruby33.rb#9057 def _reduce_106(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9163 + # source://parser//lib/parser/ruby33.rb#9063 def _reduce_107(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9169 + # source://parser//lib/parser/ruby33.rb#9069 def _reduce_108(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9175 + # source://parser//lib/parser/ruby33.rb#9075 def _reduce_109(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8495 + # source://parser//lib/parser/ruby33.rb#8431 def _reduce_11(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9181 + # source://parser//lib/parser/ruby33.rb#9081 def _reduce_110(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9191 + # source://parser//lib/parser/ruby33.rb#9091 def _reduce_111(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9197 + # source://parser//lib/parser/ruby33.rb#9097 def _reduce_112(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9207 + # source://parser//lib/parser/ruby33.rb#9107 def _reduce_113(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9214 + # source://parser//lib/parser/ruby33.rb#9114 def _reduce_114(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9221 + # source://parser//lib/parser/ruby33.rb#9121 def _reduce_115(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9227 + # source://parser//lib/parser/ruby33.rb#9127 def _reduce_116(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9233 + # source://parser//lib/parser/ruby33.rb#9133 def _reduce_117(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9239 + # source://parser//lib/parser/ruby33.rb#9139 def _reduce_118(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9245 + # source://parser//lib/parser/ruby33.rb#9145 def _reduce_119(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8512 + # source://parser//lib/parser/ruby33.rb#8448 def _reduce_12(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9251 + # source://parser//lib/parser/ruby33.rb#9151 def _reduce_120(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9257 + # source://parser//lib/parser/ruby33.rb#9157 def _reduce_121(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9263 + # source://parser//lib/parser/ruby33.rb#9163 def _reduce_122(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9270 + # source://parser//lib/parser/ruby33.rb#9170 def _reduce_123(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9277 + # source://parser//lib/parser/ruby33.rb#9177 def _reduce_124(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9283 + # source://parser//lib/parser/ruby33.rb#9183 def _reduce_125(val, _values, result); end # reduce 126 omitted # - # source://parser//lib/parser/ruby31.rb#9291 + # source://parser//lib/parser/ruby33.rb#9191 def _reduce_127(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9297 + # source://parser//lib/parser/ruby33.rb#9197 def _reduce_128(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9303 + # source://parser//lib/parser/ruby33.rb#9203 def _reduce_129(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8518 + # source://parser//lib/parser/ruby33.rb#8454 def _reduce_13(val, _values, result); end # reduce 134 omitted # - # source://parser//lib/parser/ruby31.rb#9319 + # source://parser//lib/parser/ruby33.rb#9219 def _reduce_135(val, _values, result); end # reduce 136 omitted # - # source://parser//lib/parser/ruby31.rb#9327 + # source://parser//lib/parser/ruby33.rb#9227 def _reduce_137(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9333 + # source://parser//lib/parser/ruby33.rb#9233 def _reduce_138(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9339 + # source://parser//lib/parser/ruby33.rb#9239 def _reduce_139(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8524 + # source://parser//lib/parser/ruby33.rb#8460 def _reduce_14(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8530 + # source://parser//lib/parser/ruby33.rb#8466 def _reduce_15(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8536 + # source://parser//lib/parser/ruby33.rb#8472 def _reduce_16(val, _values, result); end # reduce 17 omitted # - # source://parser//lib/parser/ruby31.rb#8544 + # source://parser//lib/parser/ruby33.rb#8480 def _reduce_18(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8550 + # source://parser//lib/parser/ruby33.rb#8486 def _reduce_19(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8442 + # source://parser//lib/parser/ruby33.rb#8378 def _reduce_2(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8556 + # source://parser//lib/parser/ruby33.rb#8492 def _reduce_20(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8562 + # source://parser//lib/parser/ruby33.rb#8498 def _reduce_21(val, _values, result); end # reduce 210 omitted # - # source://parser//lib/parser/ruby31.rb#9487 + # source://parser//lib/parser/ruby33.rb#9387 def _reduce_211(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9493 + # source://parser//lib/parser/ruby33.rb#9393 def _reduce_212(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9499 + # source://parser//lib/parser/ruby33.rb#9399 def _reduce_213(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9508 + # source://parser//lib/parser/ruby33.rb#9408 def _reduce_214(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9517 + # source://parser//lib/parser/ruby33.rb#9417 def _reduce_215(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9526 + # source://parser//lib/parser/ruby33.rb#9426 def _reduce_216(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9535 + # source://parser//lib/parser/ruby33.rb#9435 def _reduce_217(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9543 + # source://parser//lib/parser/ruby33.rb#9443 def _reduce_218(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9551 + # source://parser//lib/parser/ruby33.rb#9451 def _reduce_219(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8570 + # source://parser//lib/parser/ruby33.rb#8506 def _reduce_22(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9557 + # source://parser//lib/parser/ruby33.rb#9457 def _reduce_220(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9563 + # source://parser//lib/parser/ruby33.rb#9463 def _reduce_221(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9569 + # source://parser//lib/parser/ruby33.rb#9469 def _reduce_222(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9575 + # source://parser//lib/parser/ruby33.rb#9475 def _reduce_223(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9581 + # source://parser//lib/parser/ruby33.rb#9481 def _reduce_224(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9587 + # source://parser//lib/parser/ruby33.rb#9487 def _reduce_225(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9593 + # source://parser//lib/parser/ruby33.rb#9493 def _reduce_226(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9599 + # source://parser//lib/parser/ruby33.rb#9499 def _reduce_227(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9605 + # source://parser//lib/parser/ruby33.rb#9505 def _reduce_228(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9611 + # source://parser//lib/parser/ruby33.rb#9511 def _reduce_229(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8578 + # source://parser//lib/parser/ruby33.rb#8514 def _reduce_23(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9617 + # source://parser//lib/parser/ruby33.rb#9517 def _reduce_230(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9623 + # source://parser//lib/parser/ruby33.rb#9523 def _reduce_231(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9629 + # source://parser//lib/parser/ruby33.rb#9529 def _reduce_232(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9637 + # source://parser//lib/parser/ruby33.rb#9537 def _reduce_233(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9643 + # source://parser//lib/parser/ruby33.rb#9543 def _reduce_234(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9649 + # source://parser//lib/parser/ruby33.rb#9549 def _reduce_235(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9655 + # source://parser//lib/parser/ruby33.rb#9555 def _reduce_236(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9661 + # source://parser//lib/parser/ruby33.rb#9561 def _reduce_237(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9667 + # source://parser//lib/parser/ruby33.rb#9567 def _reduce_238(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8584 + # source://parser//lib/parser/ruby33.rb#8520 def _reduce_24(val, _values, result); end # reduce 239 omitted # - # source://parser//lib/parser/ruby31.rb#9675 + # source://parser//lib/parser/ruby33.rb#9575 def _reduce_240(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9681 + # source://parser//lib/parser/ruby33.rb#9581 def _reduce_241(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9687 + # source://parser//lib/parser/ruby33.rb#9587 def _reduce_242(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9693 + # source://parser//lib/parser/ruby33.rb#9593 def _reduce_243(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9699 + # source://parser//lib/parser/ruby33.rb#9599 def _reduce_244(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9705 + # source://parser//lib/parser/ruby33.rb#9605 def _reduce_245(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9711 + # source://parser//lib/parser/ruby33.rb#9611 def _reduce_246(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9717 + # source://parser//lib/parser/ruby33.rb#9617 def _reduce_247(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9723 + # source://parser//lib/parser/ruby33.rb#9623 def _reduce_248(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9729 + # source://parser//lib/parser/ruby33.rb#9629 def _reduce_249(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8590 + # source://parser//lib/parser/ruby33.rb#8526 def _reduce_25(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9735 + # source://parser//lib/parser/ruby33.rb#9635 def _reduce_250(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9741 + # source://parser//lib/parser/ruby33.rb#9641 def _reduce_251(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9747 + # source://parser//lib/parser/ruby33.rb#9648 def _reduce_252(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9754 + # source://parser//lib/parser/ruby33.rb#9655 def _reduce_253(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9761 + # source://parser//lib/parser/ruby33.rb#9669 def _reduce_254(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9775 - def _reduce_255(val, _values, result); end - - # source://parser//lib/parser/ruby31.rb#9795 - def _reduce_256(val, _values, result); end - - # source://parser//lib/parser/ruby31.rb#9809 + # reduce 256 omitted + # + # source://parser//lib/parser/ruby33.rb#9687 def _reduce_257(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8597 + # source://parser//lib/parser/ruby33.rb#9697 + def _reduce_258(val, _values, result); end + + # source://parser//lib/parser/ruby33.rb#8533 def _reduce_26(val, _values, result); end # reduce 262 omitted # - # source://parser//lib/parser/ruby31.rb#9839 + # source://parser//lib/parser/ruby33.rb#9711 def _reduce_263(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9845 + # source://parser//lib/parser/ruby33.rb#9717 def _reduce_264(val, _values, result); end - # reduce 267 omitted - # - # source://parser//lib/parser/ruby31.rb#9857 - def _reduce_268(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#9723 + def _reduce_265(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9863 + # reduce 268 omitted + # + # source://parser//lib/parser/ruby33.rb#9735 def _reduce_269(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8604 + # source://parser//lib/parser/ruby33.rb#8540 def _reduce_27(val, _values, result); end - # reduce 270 omitted - # - # source://parser//lib/parser/ruby31.rb#9871 - def _reduce_271(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#9741 + def _reduce_270(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9881 + # reduce 271 omitted + # + # source://parser//lib/parser/ruby33.rb#9749 def _reduce_272(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9887 + # source://parser//lib/parser/ruby33.rb#9759 def _reduce_273(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9897 + # source://parser//lib/parser/ruby33.rb#9765 def _reduce_274(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9907 + # source://parser//lib/parser/ruby33.rb#9775 def _reduce_275(val, _values, result); end - # reduce 276 omitted + # source://parser//lib/parser/ruby33.rb#9785 + def _reduce_276(val, _values, result); end + + # reduce 277 omitted # - # source://parser//lib/parser/ruby31.rb#9915 - def _reduce_277(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#9793 + def _reduce_278(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8610 + # source://parser//lib/parser/ruby33.rb#8546 def _reduce_28(val, _values, result); end - # reduce 279 omitted + # reduce 280 omitted # - # source://parser//lib/parser/ruby31.rb#9925 - def _reduce_280(val, _values, result); end - - # source://parser//lib/parser/ruby31.rb#9931 + # source://parser//lib/parser/ruby33.rb#9803 def _reduce_281(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9937 + # source://parser//lib/parser/ruby33.rb#9809 def _reduce_282(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9943 + # source://parser//lib/parser/ruby33.rb#9815 def _reduce_283(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9949 + # source://parser//lib/parser/ruby33.rb#9821 def _reduce_284(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9956 + # source://parser//lib/parser/ruby33.rb#9827 def _reduce_285(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9964 + # source://parser//lib/parser/ruby33.rb#9834 def _reduce_286(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9970 + # source://parser//lib/parser/ruby33.rb#9842 def _reduce_287(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9997 + # source://parser//lib/parser/ruby33.rb#9848 def _reduce_288(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10018 + # source://parser//lib/parser/ruby33.rb#9875 def _reduce_289(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8616 + # source://parser//lib/parser/ruby33.rb#8552 def _reduce_29(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10024 + # source://parser//lib/parser/ruby33.rb#9896 def _reduce_290(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10034 + # source://parser//lib/parser/ruby33.rb#9902 def _reduce_291(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10040 + # source://parser//lib/parser/ruby33.rb#9917 def _reduce_292(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10046 + # source://parser//lib/parser/ruby33.rb#9923 def _reduce_293(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10052 + # source://parser//lib/parser/ruby33.rb#9929 def _reduce_294(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10058 - def _reduce_295(val, _values, result); end - - # source://parser//lib/parser/ruby31.rb#10064 + # reduce 295 omitted + # + # source://parser//lib/parser/ruby33.rb#9937 def _reduce_296(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10070 + # source://parser//lib/parser/ruby33.rb#9943 def _reduce_297(val, _values, result); end - # reduce 298 omitted - # - # source://parser//lib/parser/ruby31.rb#10078 + # source://parser//lib/parser/ruby33.rb#9949 + def _reduce_298(val, _values, result); end + + # source://parser//lib/parser/ruby33.rb#9955 def _reduce_299(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8451 + # source://parser//lib/parser/ruby33.rb#8387 def _reduce_3(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8626 + # source://parser//lib/parser/ruby33.rb#8562 def _reduce_30(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10084 + # source://parser//lib/parser/ruby33.rb#9970 def _reduce_300(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10090 - def _reduce_301(val, _values, result); end - - # reduce 311 omitted + # reduce 301 omitted # - # source://parser//lib/parser/ruby31.rb#10116 - def _reduce_312(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#9978 + def _reduce_302(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10122 - def _reduce_313(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#9984 + def _reduce_303(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10128 - def _reduce_314(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#9990 + def _reduce_304(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10136 + # reduce 314 omitted + # + # source://parser//lib/parser/ruby33.rb#10016 def _reduce_315(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10142 + # source://parser//lib/parser/ruby33.rb#10022 def _reduce_316(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10148 + # source://parser//lib/parser/ruby33.rb#10028 def _reduce_317(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10154 + # source://parser//lib/parser/ruby33.rb#10036 def _reduce_318(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10160 + # source://parser//lib/parser/ruby33.rb#10042 def _reduce_319(val, _values, result); end # reduce 31 omitted # - # source://parser//lib/parser/ruby31.rb#8634 + # source://parser//lib/parser/ruby33.rb#8570 def _reduce_32(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10166 + # source://parser//lib/parser/ruby33.rb#10048 def _reduce_320(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10172 + # source://parser//lib/parser/ruby33.rb#10054 def _reduce_321(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10178 + # source://parser//lib/parser/ruby33.rb#10060 def _reduce_322(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10184 + # source://parser//lib/parser/ruby33.rb#10066 def _reduce_323(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10190 + # source://parser//lib/parser/ruby33.rb#10072 def _reduce_324(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10196 + # source://parser//lib/parser/ruby33.rb#10078 def _reduce_325(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10202 + # source://parser//lib/parser/ruby33.rb#10084 def _reduce_326(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10208 + # source://parser//lib/parser/ruby33.rb#10090 def _reduce_327(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10214 + # source://parser//lib/parser/ruby33.rb#10096 def _reduce_328(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10220 + # source://parser//lib/parser/ruby33.rb#10102 def _reduce_329(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8640 + # source://parser//lib/parser/ruby33.rb#8576 def _reduce_33(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10228 + # source://parser//lib/parser/ruby33.rb#10110 def _reduce_330(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10234 + # source://parser//lib/parser/ruby33.rb#10116 def _reduce_331(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10240 + # source://parser//lib/parser/ruby33.rb#10122 def _reduce_332(val, _values, result); end # reduce 333 omitted # - # source://parser//lib/parser/ruby31.rb#10252 + # source://parser//lib/parser/ruby33.rb#10134 def _reduce_334(val, _values, result); end # reduce 335 omitted # - # source://parser//lib/parser/ruby31.rb#10262 + # source://parser//lib/parser/ruby33.rb#10144 def _reduce_336(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10271 + # source://parser//lib/parser/ruby33.rb#10153 def _reduce_337(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10280 + # source://parser//lib/parser/ruby33.rb#10162 def _reduce_338(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10286 + # source://parser//lib/parser/ruby33.rb#10168 def _reduce_339(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8647 + # source://parser//lib/parser/ruby33.rb#8583 def _reduce_34(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10292 + # source://parser//lib/parser/ruby33.rb#10174 def _reduce_340(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10302 + # source://parser//lib/parser/ruby33.rb#10184 def _reduce_341(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10312 + # source://parser//lib/parser/ruby33.rb#10194 def _reduce_342(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10322 + # source://parser//lib/parser/ruby33.rb#10204 def _reduce_343(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10328 + # source://parser//lib/parser/ruby33.rb#10210 def _reduce_344(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10335 + # source://parser//lib/parser/ruby33.rb#10217 def _reduce_345(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10351 + # source://parser//lib/parser/ruby33.rb#10233 def _reduce_346(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10359 + # source://parser//lib/parser/ruby33.rb#10241 def _reduce_347(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10371 + # source://parser//lib/parser/ruby33.rb#10253 def _reduce_348(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10378 + # source://parser//lib/parser/ruby33.rb#10260 def _reduce_349(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8658 + # source://parser//lib/parser/ruby33.rb#8594 def _reduce_35(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10392 + # source://parser//lib/parser/ruby33.rb#10274 def _reduce_350(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10404 + # source://parser//lib/parser/ruby33.rb#10286 def _reduce_351(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10416 + # source://parser//lib/parser/ruby33.rb#10298 def _reduce_352(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10422 + # source://parser//lib/parser/ruby33.rb#10304 def _reduce_353(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10428 + # source://parser//lib/parser/ruby33.rb#10310 def _reduce_354(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10434 + # source://parser//lib/parser/ruby33.rb#10316 def _reduce_355(val, _values, result); end # reduce 356 omitted # - # source://parser//lib/parser/ruby31.rb#10442 + # source://parser//lib/parser/ruby33.rb#10324 def _reduce_357(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10448 + # source://parser//lib/parser/ruby33.rb#10330 def _reduce_358(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10454 + # source://parser//lib/parser/ruby33.rb#10336 def _reduce_359(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10461 + # source://parser//lib/parser/ruby33.rb#10343 def _reduce_360(val, _values, result); end # reduce 362 omitted # - # source://parser//lib/parser/ruby31.rb#10473 + # source://parser//lib/parser/ruby33.rb#10355 def _reduce_363(val, _values, result); end # reduce 366 omitted # - # source://parser//lib/parser/ruby31.rb#10485 + # source://parser//lib/parser/ruby33.rb#10367 def _reduce_367(val, _values, result); end # reduce 368 omitted # - # source://parser//lib/parser/ruby31.rb#10498 + # source://parser//lib/parser/ruby33.rb#10380 def _reduce_369(val, _values, result); end # reduce 36 omitted # - # source://parser//lib/parser/ruby31.rb#8666 + # source://parser//lib/parser/ruby33.rb#8602 def _reduce_37(val, _values, result); end # reduce 371 omitted # - # source://parser//lib/parser/ruby31.rb#10508 + # source://parser//lib/parser/ruby33.rb#10390 def _reduce_372(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10514 + # source://parser//lib/parser/ruby33.rb#10396 def _reduce_373(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10520 + # source://parser//lib/parser/ruby33.rb#10402 def _reduce_374(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10526 + # source://parser//lib/parser/ruby33.rb#10408 def _reduce_375(val, _values, result); end # reduce 376 omitted # - # source://parser//lib/parser/ruby31.rb#10534 + # source://parser//lib/parser/ruby33.rb#10416 def _reduce_377(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10541 + # source://parser//lib/parser/ruby33.rb#10423 def _reduce_378(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10549 + # source://parser//lib/parser/ruby33.rb#10431 def _reduce_379(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8672 + # source://parser//lib/parser/ruby33.rb#8608 def _reduce_38(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10555 + # source://parser//lib/parser/ruby33.rb#10437 def _reduce_380(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10561 + # source://parser//lib/parser/ruby33.rb#10443 def _reduce_381(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10567 + # source://parser//lib/parser/ruby33.rb#10449 def _reduce_382(val, _values, result); end # reduce 384 omitted # - # source://parser//lib/parser/ruby31.rb#10577 + # source://parser//lib/parser/ruby33.rb#10459 def _reduce_385(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10583 + # source://parser//lib/parser/ruby33.rb#10465 def _reduce_386(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10589 + # source://parser//lib/parser/ruby33.rb#10471 def _reduce_387(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10595 + # source://parser//lib/parser/ruby33.rb#10477 def _reduce_388(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10601 + # source://parser//lib/parser/ruby33.rb#10483 def _reduce_389(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8678 + # source://parser//lib/parser/ruby33.rb#8614 def _reduce_39(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10607 + # source://parser//lib/parser/ruby33.rb#10489 def _reduce_390(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10613 + # source://parser//lib/parser/ruby33.rb#10495 def _reduce_391(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10619 + # source://parser//lib/parser/ruby33.rb#10501 def _reduce_392(val, _values, result); end # reduce 393 omitted # - # source://parser//lib/parser/ruby31.rb#10627 + # source://parser//lib/parser/ruby33.rb#10509 def _reduce_394(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10636 + # source://parser//lib/parser/ruby33.rb#10518 def _reduce_395(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10646 + # source://parser//lib/parser/ruby33.rb#10528 def _reduce_396(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10654 + # source://parser//lib/parser/ruby33.rb#10536 def _reduce_397(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10663 + # source://parser//lib/parser/ruby33.rb#10545 def _reduce_398(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8457 + # source://parser//lib/parser/ruby33.rb#8393 def _reduce_4(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8687 + # source://parser//lib/parser/ruby33.rb#8623 def _reduce_40(val, _values, result); end # reduce 399 omitted # - # source://parser//lib/parser/ruby31.rb#10673 + # source://parser//lib/parser/ruby33.rb#10555 def _reduce_400(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10682 + # source://parser//lib/parser/ruby33.rb#10564 def _reduce_401(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10692 + # source://parser//lib/parser/ruby33.rb#10574 def _reduce_402(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10700 + # source://parser//lib/parser/ruby33.rb#10582 def _reduce_403(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10709 + # source://parser//lib/parser/ruby33.rb#10591 def _reduce_404(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10716 + # source://parser//lib/parser/ruby33.rb#10598 def _reduce_405(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10724 + # source://parser//lib/parser/ruby33.rb#10606 def _reduce_406(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10731 + # source://parser//lib/parser/ruby33.rb#10613 def _reduce_407(val, _values, result); end # reduce 408 omitted # - # source://parser//lib/parser/ruby31.rb#10741 + # source://parser//lib/parser/ruby33.rb#10623 def _reduce_409(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8696 + # source://parser//lib/parser/ruby33.rb#8632 def _reduce_41(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10747 + # source://parser//lib/parser/ruby33.rb#10629 def _reduce_410(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10753 + # source://parser//lib/parser/ruby33.rb#10635 def _reduce_411(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10762 + # source://parser//lib/parser/ruby33.rb#10644 def _reduce_412(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10771 + # source://parser//lib/parser/ruby33.rb#10653 def _reduce_413(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10777 + # source://parser//lib/parser/ruby33.rb#10659 def _reduce_414(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10783 + # source://parser//lib/parser/ruby33.rb#10665 def _reduce_415(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10789 + # source://parser//lib/parser/ruby33.rb#10671 def _reduce_416(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10795 + # source://parser//lib/parser/ruby33.rb#10677 def _reduce_417(val, _values, result); end # reduce 418 omitted # - # source://parser//lib/parser/ruby31.rb#10804 + # source://parser//lib/parser/ruby33.rb#10686 def _reduce_419(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8705 + # source://parser//lib/parser/ruby33.rb#8641 def _reduce_42(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10813 + # source://parser//lib/parser/ruby33.rb#10695 def _reduce_420(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10819 + # source://parser//lib/parser/ruby33.rb#10701 def _reduce_421(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10835 + # source://parser//lib/parser/ruby33.rb#10717 def _reduce_422(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10843 + # source://parser//lib/parser/ruby33.rb#10725 def _reduce_423(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10853 + # source://parser//lib/parser/ruby33.rb#10735 def _reduce_424(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10860 + # source://parser//lib/parser/ruby33.rb#10742 def _reduce_425(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10867 + # source://parser//lib/parser/ruby33.rb#10749 def _reduce_426(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10874 + # source://parser//lib/parser/ruby33.rb#10756 def _reduce_427(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10881 + # source://parser//lib/parser/ruby33.rb#10763 def _reduce_428(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10888 + # source://parser//lib/parser/ruby33.rb#10770 def _reduce_429(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8713 + # source://parser//lib/parser/ruby33.rb#8649 def _reduce_43(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10895 + # source://parser//lib/parser/ruby33.rb#10777 def _reduce_430(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10903 + # source://parser//lib/parser/ruby33.rb#10785 def _reduce_431(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10911 + # source://parser//lib/parser/ruby33.rb#10793 def _reduce_432(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10923 + # source://parser//lib/parser/ruby33.rb#10805 def _reduce_433(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10934 + # source://parser//lib/parser/ruby33.rb#10816 def _reduce_434(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10942 + # source://parser//lib/parser/ruby33.rb#10824 def _reduce_435(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10950 + # source://parser//lib/parser/ruby33.rb#10832 def _reduce_436(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10958 + # source://parser//lib/parser/ruby33.rb#10840 def _reduce_437(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10964 + # source://parser//lib/parser/ruby33.rb#10846 def _reduce_438(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10972 + # source://parser//lib/parser/ruby33.rb#10854 def _reduce_439(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8722 + # source://parser//lib/parser/ruby33.rb#8658 def _reduce_44(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10980 + # source://parser//lib/parser/ruby33.rb#10862 def _reduce_440(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10988 + # source://parser//lib/parser/ruby33.rb#10870 def _reduce_441(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#10994 + # source://parser//lib/parser/ruby33.rb#10876 def _reduce_442(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11000 + # source://parser//lib/parser/ruby33.rb#10882 def _reduce_443(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11007 + # source://parser//lib/parser/ruby33.rb#10889 def _reduce_444(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11014 + # source://parser//lib/parser/ruby33.rb#10896 def _reduce_445(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11021 + # source://parser//lib/parser/ruby33.rb#10903 def _reduce_446(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11028 + # source://parser//lib/parser/ruby33.rb#10910 def _reduce_447(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11035 + # source://parser//lib/parser/ruby33.rb#10917 def _reduce_448(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11045 + # source://parser//lib/parser/ruby33.rb#10927 def _reduce_449(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8736 + # source://parser//lib/parser/ruby33.rb#8672 def _reduce_45(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11052 + # source://parser//lib/parser/ruby33.rb#10934 def _reduce_450(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11058 + # source://parser//lib/parser/ruby33.rb#10940 def _reduce_451(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11069 + # source://parser//lib/parser/ruby33.rb#10951 def _reduce_452(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11076 + # source://parser//lib/parser/ruby33.rb#10958 def _reduce_453(val, _values, result); end # reduce 454 omitted # - # source://parser//lib/parser/ruby31.rb#11084 + # source://parser//lib/parser/ruby33.rb#10966 def _reduce_455(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11096 + # source://parser//lib/parser/ruby33.rb#10972 def _reduce_456(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11104 + # source://parser//lib/parser/ruby33.rb#10978 def _reduce_457(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11111 + # source://parser//lib/parser/ruby33.rb#10988 def _reduce_458(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8756 + # source://parser//lib/parser/ruby33.rb#10996 + def _reduce_459(val, _values, result); end + + # source://parser//lib/parser/ruby33.rb#8686 def _reduce_46(val, _values, result); end - # reduce 459 omitted - # - # source://parser//lib/parser/ruby31.rb#11119 + # source://parser//lib/parser/ruby33.rb#11003 def _reduce_460(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11125 - def _reduce_461(val, _values, result); end - - # source://parser//lib/parser/ruby31.rb#11131 + # reduce 461 omitted + # + # source://parser//lib/parser/ruby33.rb#11011 def _reduce_462(val, _values, result); end - # reduce 463 omitted - # - # source://parser//lib/parser/ruby31.rb#11139 - def _reduce_464(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#11017 + def _reduce_463(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11149 - def _reduce_465(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#11023 + def _reduce_464(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11155 + # reduce 465 omitted + # + # source://parser//lib/parser/ruby33.rb#11031 def _reduce_466(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11161 + # source://parser//lib/parser/ruby33.rb#11041 def _reduce_467(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11167 + # source://parser//lib/parser/ruby33.rb#11047 def _reduce_468(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8770 - def _reduce_47(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#11053 + def _reduce_469(val, _values, result); end - # reduce 469 omitted - # - # source://parser//lib/parser/ruby31.rb#11175 + # source://parser//lib/parser/ruby33.rb#11059 def _reduce_470(val, _values, result); end # reduce 471 omitted # - # source://parser//lib/parser/ruby31.rb#11183 + # source://parser//lib/parser/ruby33.rb#11067 def _reduce_472(val, _values, result); end # reduce 473 omitted # - # source://parser//lib/parser/ruby31.rb#11191 + # source://parser//lib/parser/ruby33.rb#11075 def _reduce_474(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11198 - def _reduce_475(val, _values, result); end - - # reduce 477 omitted + # reduce 475 omitted # - # source://parser//lib/parser/ruby31.rb#11209 - def _reduce_478(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#11083 + def _reduce_476(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11217 - def _reduce_479(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#11090 + def _reduce_477(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8790 + # reduce 47 omitted + # + # source://parser//lib/parser/ruby33.rb#8694 def _reduce_48(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11225 + # reduce 479 omitted + # + # source://parser//lib/parser/ruby33.rb#11101 def _reduce_480(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11233 + # source://parser//lib/parser/ruby33.rb#11109 def _reduce_481(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11240 + # source://parser//lib/parser/ruby33.rb#11117 def _reduce_482(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11248 + # source://parser//lib/parser/ruby33.rb#11125 def _reduce_483(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11256 + # source://parser//lib/parser/ruby33.rb#11132 def _reduce_484(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11264 + # source://parser//lib/parser/ruby33.rb#11140 def _reduce_485(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11271 + # source://parser//lib/parser/ruby33.rb#11148 def _reduce_486(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11277 + # source://parser//lib/parser/ruby33.rb#11156 def _reduce_487(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11283 + # source://parser//lib/parser/ruby33.rb#11163 def _reduce_488(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11289 + # source://parser//lib/parser/ruby33.rb#11169 def _reduce_489(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11297 + # source://parser//lib/parser/ruby33.rb#8704 + def _reduce_49(val, _values, result); end + + # source://parser//lib/parser/ruby33.rb#11175 def _reduce_490(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11305 + # source://parser//lib/parser/ruby33.rb#11181 def _reduce_491(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11311 + # source://parser//lib/parser/ruby33.rb#11189 def _reduce_492(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11317 + # source://parser//lib/parser/ruby33.rb#11197 def _reduce_493(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11324 + # source://parser//lib/parser/ruby33.rb#11203 def _reduce_494(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11330 + # source://parser//lib/parser/ruby33.rb#11209 def _reduce_495(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11336 + # source://parser//lib/parser/ruby33.rb#11216 def _reduce_496(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11342 + # source://parser//lib/parser/ruby33.rb#11222 def _reduce_497(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11349 + # source://parser//lib/parser/ruby33.rb#11228 def _reduce_498(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11356 + # source://parser//lib/parser/ruby33.rb#11234 def _reduce_499(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8463 + # source://parser//lib/parser/ruby33.rb#8399 def _reduce_5(val, _values, result); end - # reduce 49 omitted - # - # source://parser//lib/parser/ruby31.rb#8798 - def _reduce_50(val, _values, result); end - - # source://parser//lib/parser/ruby31.rb#11362 + # source://parser//lib/parser/ruby33.rb#11240 def _reduce_500(val, _values, result); end # reduce 501 omitted # - # source://parser//lib/parser/ruby31.rb#11370 + # source://parser//lib/parser/ruby33.rb#11248 def _reduce_502(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11380 + # source://parser//lib/parser/ruby33.rb#11258 def _reduce_503(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11390 + # source://parser//lib/parser/ruby33.rb#11268 def _reduce_504(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11396 + # source://parser//lib/parser/ruby33.rb#11274 def _reduce_505(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11402 + # source://parser//lib/parser/ruby33.rb#11280 def _reduce_506(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11408 + # source://parser//lib/parser/ruby33.rb#11286 def _reduce_507(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11414 + # source://parser//lib/parser/ruby33.rb#11292 def _reduce_508(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11420 + # source://parser//lib/parser/ruby33.rb#11298 def _reduce_509(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11426 + # reduce 50 omitted + # + # source://parser//lib/parser/ruby33.rb#8712 + def _reduce_51(val, _values, result); end + + # source://parser//lib/parser/ruby33.rb#11304 def _reduce_510(val, _values, result); end # reduce 511 omitted # - # source://parser//lib/parser/ruby31.rb#11434 + # source://parser//lib/parser/ruby33.rb#11312 def _reduce_512(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11440 + # source://parser//lib/parser/ruby33.rb#11318 def _reduce_513(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11446 + # source://parser//lib/parser/ruby33.rb#11324 def _reduce_514(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11452 + # source://parser//lib/parser/ruby33.rb#11330 def _reduce_515(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11458 + # source://parser//lib/parser/ruby33.rb#11336 def _reduce_516(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11464 + # source://parser//lib/parser/ruby33.rb#11342 def _reduce_517(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11470 + # source://parser//lib/parser/ruby33.rb#11348 def _reduce_518(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11476 + # source://parser//lib/parser/ruby33.rb#11354 def _reduce_519(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11482 + # source://parser//lib/parser/ruby33.rb#11360 def _reduce_520(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11488 + # source://parser//lib/parser/ruby33.rb#11366 def _reduce_521(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11494 + # source://parser//lib/parser/ruby33.rb#11372 def _reduce_522(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11500 + # source://parser//lib/parser/ruby33.rb#11378 def _reduce_523(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11506 + # source://parser//lib/parser/ruby33.rb#11384 def _reduce_524(val, _values, result); end + # reduce 525 omitted + # + # source://parser//lib/parser/ruby33.rb#11392 + def _reduce_526(val, _values, result); end + # reduce 527 omitted # - # source://parser//lib/parser/ruby31.rb#11518 + # source://parser//lib/parser/ruby33.rb#11400 def _reduce_528(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11524 + # source://parser//lib/parser/ruby33.rb#11406 def _reduce_529(val, _values, result); end - # reduce 52 omitted - # - # source://parser//lib/parser/ruby31.rb#8812 - def _reduce_53(val, _values, result); end - - # source://parser//lib/parser/ruby31.rb#11530 + # source://parser//lib/parser/ruby33.rb#11412 def _reduce_530(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11536 + # source://parser//lib/parser/ruby33.rb#11418 def _reduce_531(val, _values, result); end # reduce 534 omitted # - # source://parser//lib/parser/ruby31.rb#11548 + # source://parser//lib/parser/ruby33.rb#11430 def _reduce_535(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11554 + # source://parser//lib/parser/ruby33.rb#11436 def _reduce_536(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8818 + # reduce 53 omitted + # + # source://parser//lib/parser/ruby33.rb#8726 def _reduce_54(val, _values, result); end # reduce 544 omitted # - # source://parser//lib/parser/ruby31.rb#11576 + # source://parser//lib/parser/ruby33.rb#11458 def _reduce_545(val, _values, result); end # reduce 546 omitted # - # source://parser//lib/parser/ruby31.rb#11584 + # source://parser//lib/parser/ruby33.rb#11466 def _reduce_547(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11590 + # source://parser//lib/parser/ruby33.rb#11472 def _reduce_548(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11602 + # source://parser//lib/parser/ruby33.rb#11484 def _reduce_549(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8824 + # source://parser//lib/parser/ruby33.rb#8732 def _reduce_55(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11609 + # source://parser//lib/parser/ruby33.rb#11491 def _reduce_550(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11616 + # source://parser//lib/parser/ruby33.rb#11498 def _reduce_551(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11622 + # source://parser//lib/parser/ruby33.rb#11504 def _reduce_552(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11628 + # source://parser//lib/parser/ruby33.rb#11510 def _reduce_553(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11634 + # source://parser//lib/parser/ruby33.rb#11516 def _reduce_554(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11649 + # source://parser//lib/parser/ruby33.rb#11531 def _reduce_555(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11655 + # source://parser//lib/parser/ruby33.rb#11537 def _reduce_556(val, _values, result); end # reduce 558 omitted # - # source://parser//lib/parser/ruby31.rb#11665 + # source://parser//lib/parser/ruby33.rb#11547 def _reduce_559(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8830 + # source://parser//lib/parser/ruby33.rb#8738 def _reduce_56(val, _values, result); end # reduce 560 omitted # - # source://parser//lib/parser/ruby31.rb#11673 + # source://parser//lib/parser/ruby33.rb#11555 def _reduce_561(val, _values, result); end # reduce 564 omitted # - # source://parser//lib/parser/ruby31.rb#11685 + # source://parser//lib/parser/ruby33.rb#11567 def _reduce_565(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11691 + # source://parser//lib/parser/ruby33.rb#11573 def _reduce_566(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11697 + # source://parser//lib/parser/ruby33.rb#11579 def _reduce_567(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11703 + # source://parser//lib/parser/ruby33.rb#11585 def _reduce_568(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11710 + # source://parser//lib/parser/ruby33.rb#11592 def _reduce_569(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8836 + # source://parser//lib/parser/ruby33.rb#8744 def _reduce_57(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11717 + # source://parser//lib/parser/ruby33.rb#11599 def _reduce_570(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11723 + # source://parser//lib/parser/ruby33.rb#11605 def _reduce_571(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11730 + # source://parser//lib/parser/ruby33.rb#11612 def _reduce_572(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11737 - def _reduce_573(val, _values, result); end - - # source://parser//lib/parser/ruby31.rb#11743 - def _reduce_574(val, _values, result); end - - # source://parser//lib/parser/ruby31.rb#11749 + # reduce 574 omitted + # + # source://parser//lib/parser/ruby33.rb#11623 def _reduce_575(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11755 + # source://parser//lib/parser/ruby33.rb#11629 def _reduce_576(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11761 + # source://parser//lib/parser/ruby33.rb#11635 def _reduce_577(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11767 + # source://parser//lib/parser/ruby33.rb#11641 def _reduce_578(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11773 + # source://parser//lib/parser/ruby33.rb#11647 def _reduce_579(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8848 + # source://parser//lib/parser/ruby33.rb#8750 def _reduce_58(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11779 + # source://parser//lib/parser/ruby33.rb#11653 def _reduce_580(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11785 + # source://parser//lib/parser/ruby33.rb#11659 def _reduce_581(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11791 + # source://parser//lib/parser/ruby33.rb#11665 def _reduce_582(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11797 + # source://parser//lib/parser/ruby33.rb#11671 def _reduce_583(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11803 + # source://parser//lib/parser/ruby33.rb#11677 def _reduce_584(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11809 + # source://parser//lib/parser/ruby33.rb#11683 def _reduce_585(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11815 + # source://parser//lib/parser/ruby33.rb#11689 def _reduce_586(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11821 + # source://parser//lib/parser/ruby33.rb#11695 def _reduce_587(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11827 + # source://parser//lib/parser/ruby33.rb#11701 def _reduce_588(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11833 + # source://parser//lib/parser/ruby33.rb#11707 def _reduce_589(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8857 + # source://parser//lib/parser/ruby33.rb#8759 def _reduce_59(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11839 + # source://parser//lib/parser/ruby33.rb#11713 def _reduce_590(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11845 + # source://parser//lib/parser/ruby33.rb#11719 def _reduce_591(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11851 + # source://parser//lib/parser/ruby33.rb#11725 def _reduce_592(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11857 + # source://parser//lib/parser/ruby33.rb#11731 def _reduce_593(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11863 + # source://parser//lib/parser/ruby33.rb#11737 def _reduce_594(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11869 + # source://parser//lib/parser/ruby33.rb#11743 def _reduce_595(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11876 + # source://parser//lib/parser/ruby33.rb#11749 def _reduce_596(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11885 + # source://parser//lib/parser/ruby33.rb#11755 def _reduce_597(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11891 + # source://parser//lib/parser/ruby33.rb#11762 def _reduce_598(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11897 - def _reduce_599(val, _values, result); end - - # source://parser//lib/parser/ruby31.rb#8469 + # source://parser//lib/parser/ruby33.rb#8405 def _reduce_6(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8869 - def _reduce_60(val, _values, result); end - - # reduce 602 omitted + # reduce 599 omitted # - # source://parser//lib/parser/ruby31.rb#11909 - def _reduce_603(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#11773 + def _reduce_600(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11916 + # reduce 603 omitted + # + # source://parser//lib/parser/ruby33.rb#11785 def _reduce_604(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11923 + # source://parser//lib/parser/ruby33.rb#11792 def _reduce_605(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11929 + # source://parser//lib/parser/ruby33.rb#11799 def _reduce_606(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11940 + # source://parser//lib/parser/ruby33.rb#11805 def _reduce_607(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11947 + # source://parser//lib/parser/ruby33.rb#11816 def _reduce_608(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11954 + # source://parser//lib/parser/ruby33.rb#11823 def _reduce_609(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11961 + # source://parser//lib/parser/ruby33.rb#11830 def _reduce_610(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11968 + # source://parser//lib/parser/ruby33.rb#11837 def _reduce_611(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11974 + # source://parser//lib/parser/ruby33.rb#11844 def _reduce_612(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11980 + # source://parser//lib/parser/ruby33.rb#11850 def _reduce_613(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11986 + # source://parser//lib/parser/ruby33.rb#11856 def _reduce_614(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11992 + # source://parser//lib/parser/ruby33.rb#11862 def _reduce_615(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#11998 + # source://parser//lib/parser/ruby33.rb#11868 def _reduce_616(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12004 - def _reduce_617(val, _values, result); end - - # source://parser//lib/parser/ruby31.rb#12010 + # reduce 617 omitted + # + # source://parser//lib/parser/ruby33.rb#11876 def _reduce_618(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12016 + # source://parser//lib/parser/ruby33.rb#11882 def _reduce_619(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12022 + # reduce 61 omitted + # + # source://parser//lib/parser/ruby33.rb#8772 + def _reduce_62(val, _values, result); end + + # source://parser//lib/parser/ruby33.rb#11888 def _reduce_620(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12028 + # source://parser//lib/parser/ruby33.rb#11894 def _reduce_621(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12034 + # source://parser//lib/parser/ruby33.rb#11900 def _reduce_622(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12040 + # source://parser//lib/parser/ruby33.rb#11906 def _reduce_623(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12046 + # source://parser//lib/parser/ruby33.rb#11912 def _reduce_624(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12052 + # source://parser//lib/parser/ruby33.rb#11918 def _reduce_625(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12058 + # source://parser//lib/parser/ruby33.rb#11924 def _reduce_626(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12064 + # source://parser//lib/parser/ruby33.rb#11930 def _reduce_627(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12070 + # source://parser//lib/parser/ruby33.rb#11936 def _reduce_628(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12076 + # source://parser//lib/parser/ruby33.rb#11942 def _reduce_629(val, _values, result); end - # reduce 62 omitted - # - # source://parser//lib/parser/ruby31.rb#8882 + # source://parser//lib/parser/ruby33.rb#8778 def _reduce_63(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12082 + # source://parser//lib/parser/ruby33.rb#11948 def _reduce_630(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12088 + # source://parser//lib/parser/ruby33.rb#11954 def _reduce_631(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12094 + # source://parser//lib/parser/ruby33.rb#11960 def _reduce_632(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12100 + # source://parser//lib/parser/ruby33.rb#11966 def _reduce_633(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12106 - def _reduce_634(val, _values, result); end - - # reduce 635 omitted + # reduce 634 omitted # - # source://parser//lib/parser/ruby31.rb#12114 - def _reduce_636(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#11974 + def _reduce_635(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12121 - def _reduce_637(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#11981 + def _reduce_636(val, _values, result); end - # reduce 638 omitted + # reduce 637 omitted # - # source://parser//lib/parser/ruby31.rb#12132 + # source://parser//lib/parser/ruby33.rb#11992 + def _reduce_638(val, _values, result); end + + # source://parser//lib/parser/ruby33.rb#12000 def _reduce_639(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8888 + # source://parser//lib/parser/ruby33.rb#8785 def _reduce_64(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12140 + # source://parser//lib/parser/ruby33.rb#12008 def _reduce_640(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12148 + # source://parser//lib/parser/ruby33.rb#12014 def _reduce_641(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12154 + # source://parser//lib/parser/ruby33.rb#12020 def _reduce_642(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12160 + # source://parser//lib/parser/ruby33.rb#12026 def _reduce_643(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12166 + # source://parser//lib/parser/ruby33.rb#12032 def _reduce_644(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12172 + # source://parser//lib/parser/ruby33.rb#12039 def _reduce_645(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12179 + # source://parser//lib/parser/ruby33.rb#12045 def _reduce_646(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12185 + # source://parser//lib/parser/ruby33.rb#12051 def _reduce_647(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12191 + # source://parser//lib/parser/ruby33.rb#12060 def _reduce_648(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12200 + # source://parser//lib/parser/ruby33.rb#12070 def _reduce_649(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8895 + # source://parser//lib/parser/ruby33.rb#8795 def _reduce_65(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12210 + # source://parser//lib/parser/ruby33.rb#12078 def _reduce_650(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12218 + # source://parser//lib/parser/ruby33.rb#12087 def _reduce_651(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12227 + # source://parser//lib/parser/ruby33.rb#12095 def _reduce_652(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12235 + # source://parser//lib/parser/ruby33.rb#12104 def _reduce_653(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12244 + # source://parser//lib/parser/ruby33.rb#12111 def _reduce_654(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12251 + # source://parser//lib/parser/ruby33.rb#12119 def _reduce_655(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12259 + # source://parser//lib/parser/ruby33.rb#12128 def _reduce_656(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12268 + # source://parser//lib/parser/ruby33.rb#12135 def _reduce_657(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12275 + # source://parser//lib/parser/ruby33.rb#12143 def _reduce_658(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12283 + # source://parser//lib/parser/ruby33.rb#12150 def _reduce_659(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8905 + # source://parser//lib/parser/ruby33.rb#8801 def _reduce_66(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12290 + # source://parser//lib/parser/ruby33.rb#12158 def _reduce_660(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12298 + # source://parser//lib/parser/ruby33.rb#12164 def _reduce_661(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12304 + # source://parser//lib/parser/ruby33.rb#12170 def _reduce_662(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12310 + # source://parser//lib/parser/ruby33.rb#12176 def _reduce_663(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12316 + # source://parser//lib/parser/ruby33.rb#12182 def _reduce_664(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12322 + # source://parser//lib/parser/ruby33.rb#12188 def _reduce_665(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12328 + # source://parser//lib/parser/ruby33.rb#12194 def _reduce_666(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12334 - def _reduce_667(val, _values, result); end - - # reduce 668 omitted + # reduce 667 omitted # - # source://parser//lib/parser/ruby31.rb#12342 + # source://parser//lib/parser/ruby33.rb#12202 + def _reduce_668(val, _values, result); end + + # source://parser//lib/parser/ruby33.rb#12212 def _reduce_669(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8911 + # source://parser//lib/parser/ruby33.rb#8808 def _reduce_67(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12352 + # source://parser//lib/parser/ruby33.rb#12219 def _reduce_670(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12359 + # source://parser//lib/parser/ruby33.rb#12226 def _reduce_671(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12366 + # source://parser//lib/parser/ruby33.rb#12232 def _reduce_672(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12372 + # source://parser//lib/parser/ruby33.rb#12238 def _reduce_673(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12378 + # source://parser//lib/parser/ruby33.rb#12244 def _reduce_674(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12384 + # source://parser//lib/parser/ruby33.rb#12259 def _reduce_675(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12399 + # source://parser//lib/parser/ruby33.rb#12267 def _reduce_676(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12407 + # source://parser//lib/parser/ruby33.rb#12275 def _reduce_677(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12415 + # source://parser//lib/parser/ruby33.rb#12282 def _reduce_678(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12422 + # source://parser//lib/parser/ruby33.rb#12289 def _reduce_679(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8918 - def _reduce_68(val, _values, result); end - - # source://parser//lib/parser/ruby31.rb#12429 + # source://parser//lib/parser/ruby33.rb#12295 def _reduce_680(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12435 + # source://parser//lib/parser/ruby33.rb#12301 def _reduce_681(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12441 + # source://parser//lib/parser/ruby33.rb#12307 def _reduce_682(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12447 - def _reduce_683(val, _values, result); end - - # reduce 685 omitted + # reduce 684 omitted # - # source://parser//lib/parser/ruby31.rb#12457 + # source://parser//lib/parser/ruby33.rb#12317 + def _reduce_685(val, _values, result); end + + # source://parser//lib/parser/ruby33.rb#12323 def _reduce_686(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12463 + # source://parser//lib/parser/ruby33.rb#12331 def _reduce_687(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12471 + # source://parser//lib/parser/ruby33.rb#12339 def _reduce_688(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12477 + # source://parser//lib/parser/ruby33.rb#12347 def _reduce_689(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12485 + # source://parser//lib/parser/ruby33.rb#12355 def _reduce_690(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12493 + # source://parser//lib/parser/ruby33.rb#12361 def _reduce_691(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12499 + # source://parser//lib/parser/ruby33.rb#12367 def _reduce_692(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12505 + # source://parser//lib/parser/ruby33.rb#12373 def _reduce_693(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12511 - def _reduce_694(val, _values, result); end - - # reduce 696 omitted + # reduce 695 omitted # - # source://parser//lib/parser/ruby31.rb#12521 - def _reduce_697(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#12383 + def _reduce_696(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12529 - def _reduce_698(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#12391 + def _reduce_697(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8475 + # source://parser//lib/parser/ruby33.rb#8411 def _reduce_7(val, _values, result); end - # reduce 700 omitted + # reduce 699 omitted # - # source://parser//lib/parser/ruby31.rb#12539 + # source://parser//lib/parser/ruby33.rb#12403 + def _reduce_700(val, _values, result); end + + # source://parser//lib/parser/ruby33.rb#12411 def _reduce_701(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12547 + # source://parser//lib/parser/ruby33.rb#12419 def _reduce_702(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12555 + # source://parser//lib/parser/ruby33.rb#12425 def _reduce_703(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12561 - def _reduce_704(val, _values, result); end - - # reduce 705 omitted + # reduce 704 omitted # - # source://parser//lib/parser/ruby31.rb#12569 - def _reduce_706(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#12433 + def _reduce_705(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12575 - def _reduce_707(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#12439 + def _reduce_706(val, _values, result); end - # reduce 708 omitted + # reduce 707 omitted # - # source://parser//lib/parser/ruby31.rb#12583 + # source://parser//lib/parser/ruby33.rb#12447 + def _reduce_708(val, _values, result); end + + # source://parser//lib/parser/ruby33.rb#12453 def _reduce_709(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12589 + # reduce 70 omitted + # + # source://parser//lib/parser/ruby33.rb#8820 + def _reduce_71(val, _values, result); end + + # source://parser//lib/parser/ruby33.rb#12459 def _reduce_710(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12595 + # source://parser//lib/parser/ruby33.rb#12465 def _reduce_711(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12601 + # source://parser//lib/parser/ruby33.rb#12471 def _reduce_712(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12607 + # source://parser//lib/parser/ruby33.rb#12477 def _reduce_713(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12613 + # source://parser//lib/parser/ruby33.rb#12483 def _reduce_714(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12619 + # source://parser//lib/parser/ruby33.rb#12489 def _reduce_715(val, _values, result); end - # reduce 71 omitted - # - # source://parser//lib/parser/ruby31.rb#8930 + # source://parser//lib/parser/ruby33.rb#8827 def _reduce_72(val, _values, result); end - # reduce 727 omitted + # reduce 725 omitted # - # source://parser//lib/parser/ruby31.rb#12649 - def _reduce_728(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#12524 + def _reduce_726(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12655 - def _reduce_729(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#12530 + def _reduce_727(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8937 + # source://parser//lib/parser/ruby33.rb#8834 def _reduce_73(val, _values, result); end - # reduce 733 omitted + # reduce 731 omitted # - # source://parser//lib/parser/ruby31.rb#12669 - def _reduce_734(val, _values, result); end - - # source://parser//lib/parser/ruby31.rb#12675 - def _reduce_735(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#12544 + def _reduce_732(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12681 - def _reduce_736(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#12550 + def _reduce_733(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8944 - def _reduce_74(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#12556 + def _reduce_734(val, _values, result); end - # reduce 739 omitted + # reduce 736 omitted # - # source://parser//lib/parser/ruby31.rb#12693 - def _reduce_740(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#12566 + def _reduce_737(val, _values, result); end - # reduce 743 omitted + # reduce 740 omitted # - # source://parser//lib/parser/ruby31.rb#12705 - def _reduce_744(val, _values, result); end + # source://parser//lib/parser/ruby33.rb#12578 + def _reduce_741(val, _values, result); end - # reduce 75 omitted + # reduce 74 omitted # - # source://parser//lib/parser/ruby31.rb#8953 + # source://parser//lib/parser/ruby33.rb#8843 + def _reduce_75(val, _values, result); end + + # source://parser//lib/parser/ruby33.rb#8850 def _reduce_76(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8960 + # source://parser//lib/parser/ruby33.rb#8861 def _reduce_77(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8971 + # source://parser//lib/parser/ruby33.rb#8868 def _reduce_78(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8978 + # source://parser//lib/parser/ruby33.rb#8879 def _reduce_79(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8989 + # source://parser//lib/parser/ruby33.rb#8886 def _reduce_80(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#8996 + # source://parser//lib/parser/ruby33.rb#8897 def _reduce_81(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9007 + # source://parser//lib/parser/ruby33.rb#8907 def _reduce_82(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9014 + # source://parser//lib/parser/ruby33.rb#8914 def _reduce_83(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9021 + # source://parser//lib/parser/ruby33.rb#8921 def _reduce_84(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9028 + # source://parser//lib/parser/ruby33.rb#8928 def _reduce_85(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9035 + # source://parser//lib/parser/ruby33.rb#8935 def _reduce_86(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9042 + # source://parser//lib/parser/ruby33.rb#8942 def _reduce_87(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9048 + # source://parser//lib/parser/ruby33.rb#8948 def _reduce_88(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9054 + # source://parser//lib/parser/ruby33.rb#8954 def _reduce_89(val, _values, result); end # reduce 8 omitted # - # source://parser//lib/parser/ruby31.rb#8483 + # source://parser//lib/parser/ruby33.rb#8419 def _reduce_9(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9060 + # source://parser//lib/parser/ruby33.rb#8960 def _reduce_90(val, _values, result); end # reduce 91 omitted # - # source://parser//lib/parser/ruby31.rb#9068 + # source://parser//lib/parser/ruby33.rb#8968 def _reduce_92(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9075 + # source://parser//lib/parser/ruby33.rb#8975 def _reduce_93(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9082 + # source://parser//lib/parser/ruby33.rb#8982 def _reduce_94(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9090 + # source://parser//lib/parser/ruby33.rb#8990 def _reduce_95(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9097 + # source://parser//lib/parser/ruby33.rb#8997 def _reduce_96(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9105 + # source://parser//lib/parser/ruby33.rb#9005 def _reduce_97(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9111 + # source://parser//lib/parser/ruby33.rb#9011 def _reduce_98(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#9118 + # source://parser//lib/parser/ruby33.rb#9018 def _reduce_99(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#12711 + # source://parser//lib/parser/ruby33.rb#12584 def _reduce_none(val, _values, result); end - # source://parser//lib/parser/ruby31.rb#21 + # source://parser//lib/parser/ruby33.rb#21 def default_encoding; end - # source://parser//lib/parser/ruby31.rb#25 + # source://parser//lib/parser/ruby33.rb#25 def endless_method_name(name_t); end - # source://parser//lib/parser/ruby31.rb#38 + # source://parser//lib/parser/ruby33.rb#38 def local_pop; end - # source://parser//lib/parser/ruby31.rb#31 + # source://parser//lib/parser/ruby33.rb#31 def local_push; end - # source://parser//lib/parser/ruby31.rb#45 + # source://parser//lib/parser/ruby33.rb#45 def try_declare_numparam(node); end - # source://parser//lib/parser/ruby31.rb#17 + # source://parser//lib/parser/ruby33.rb#17 def version; end end -# source://parser//lib/parser/ruby31.rb#8022 -Parser::Ruby31::Racc_arg = T.let(T.unsafe(nil), Array) +# source://parser//lib/parser/ruby33.rb#7955 +Parser::Ruby33::Racc_arg = T.let(T.unsafe(nil), Array) -# source://parser//lib/parser/ruby31.rb#8429 -Parser::Ruby31::Racc_debug_parser = T.let(T.unsafe(nil), FalseClass) +# source://parser//lib/parser/ruby33.rb#8365 +Parser::Ruby33::Racc_debug_parser = T.let(T.unsafe(nil), FalseClass) -# source://parser//lib/parser/ruby31.rb#8039 -Parser::Ruby31::Racc_token_to_s_table = T.let(T.unsafe(nil), Array) +# source://parser//lib/parser/ruby33.rb#7972 +Parser::Ruby33::Racc_token_to_s_table = T.let(T.unsafe(nil), Array) # @api public # @@ -7204,7 +7201,7 @@ end # # @api public # -# source://parser//lib/parser/tree_rewriter.rb#61 +# source://parser//lib/parser/tree_rewriter.rb#51 class Parser::TreeRewriter < ::Parser::AST::Processor # Returns `true` if the specified node is an assignment node, returns false # otherwise. diff --git a/Library/Homebrew/sorbet/rbi/gems/prism@0.29.0.rbi b/Library/Homebrew/sorbet/rbi/gems/prism@0.30.0.rbi similarity index 85% rename from Library/Homebrew/sorbet/rbi/gems/prism@0.29.0.rbi rename to Library/Homebrew/sorbet/rbi/gems/prism@0.30.0.rbi index f591763d17de88..9aec9c308e4799 100644 --- a/Library/Homebrew/sorbet/rbi/gems/prism@0.29.0.rbi +++ b/Library/Homebrew/sorbet/rbi/gems/prism@0.30.0.rbi @@ -50,7 +50,7 @@ module Prism # # For supported options, see Prism::parse. # - # source://prism//lib/prism.rb#47 + # 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 @@ -64,7 +64,7 @@ module Prism # returns the same tokens. Raises SyntaxError if the syntax in source is # invalid. # - # source://prism//lib/prism.rb#57 + # source://prism//lib/prism.rb#55 sig { params(source: String).returns(T::Array[T.untyped]) } def lex_ripper(source); end @@ -73,7 +73,7 @@ module Prism # # Load the serialized AST using the source as a reference into a tree. # - # source://prism//lib/prism.rb#65 + # source://prism//lib/prism.rb#63 sig { params(source: String, serialized: String).returns(Prism::ParseResult) } def load(source, serialized); end @@ -121,6 +121,12 @@ module Prism # # @return [Boolean] def parse_success?(*_arg0); end + + # Mirror the Prism.profile API by using the serialization API. + def profile(*_arg0); end + + # Mirror the Prism.profile_file API by using the serialization API. + def profile_file(*_arg0); end end end @@ -129,7 +135,7 @@ end # cannot be applied to sources that include multibyte characters. Sources that # include multibyte characters are represented by the Prism::Source class. # -# source://prism//lib/prism/parse_result.rb#127 +# source://prism//lib/prism/parse_result.rb#126 class Prism::ASCIISource < ::Prism::Source # Return the column number in characters for the given byte offset. # @@ -168,13 +174,13 @@ end # alias $foo $bar # ^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#189 +# source://prism//lib/prism/node.rb#176 class Prism::AliasGlobalVariableNode < ::Prism::Node # def initialize: (Prism::node new_name, Prism::node old_name, Location keyword_loc, Location location) -> void # # @return [AliasGlobalVariableNode] a new instance of AliasGlobalVariableNode # - # source://prism//lib/prism/node.rb#190 + # source://prism//lib/prism/node.rb#178 sig do params( source: Prism::Source, @@ -189,36 +195,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#294 + # source://prism//lib/prism/node.rb#281 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#200 + # source://prism//lib/prism/node.rb#187 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#205 + # source://prism//lib/prism/node.rb#192 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#215 + # source://prism//lib/prism/node.rb#202 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#210 + # source://prism//lib/prism/node.rb#197 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?new_name: Prism::node, ?old_name: Prism::node, ?keyword_loc: Location, ?location: Location) -> AliasGlobalVariableNode # - # source://prism//lib/prism/node.rb#220 + # source://prism//lib/prism/node.rb#207 sig do params( new_name: Prism::Node, @@ -232,13 +238,13 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#205 + # source://prism//lib/prism/node.rb#192 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { new_name: Prism::node, old_name: Prism::node, keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#228 + # source://prism//lib/prism/node.rb#215 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -247,13 +253,13 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#260 + # source://prism//lib/prism/node.rb#247 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#255 + # source://prism//lib/prism/node.rb#242 sig { returns(String) } def keyword; end @@ -262,7 +268,7 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node # alias $foo $bar # ^^^^^ # - # source://prism//lib/prism/node.rb#248 + # source://prism//lib/prism/node.rb#235 sig { returns(Prism::Location) } def keyword_loc; end @@ -271,7 +277,7 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node # alias $foo $bar # ^^^^ # - # source://prism//lib/prism/node.rb#236 + # source://prism//lib/prism/node.rb#223 sig { returns(Prism::Node) } def new_name; end @@ -280,7 +286,7 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node # alias $foo $bar # ^^^^ # - # source://prism//lib/prism/node.rb#242 + # source://prism//lib/prism/node.rb#229 sig { returns(Prism::Node) } def old_name; end @@ -299,7 +305,7 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#278 + # source://prism//lib/prism/node.rb#265 sig { override.returns(Symbol) } def type; end @@ -311,7 +317,7 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#288 + # source://prism//lib/prism/node.rb#275 def type; end end end @@ -321,13 +327,13 @@ end # alias foo bar # ^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#307 +# source://prism//lib/prism/node.rb#293 class Prism::AliasMethodNode < ::Prism::Node # def initialize: (Prism::node new_name, Prism::node old_name, Location keyword_loc, Location location) -> void # # @return [AliasMethodNode] a new instance of AliasMethodNode # - # source://prism//lib/prism/node.rb#308 + # source://prism//lib/prism/node.rb#295 sig do params( source: Prism::Source, @@ -342,36 +348,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#403 + # source://prism//lib/prism/node.rb#389 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#318 + # source://prism//lib/prism/node.rb#304 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#323 + # source://prism//lib/prism/node.rb#309 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#333 + # source://prism//lib/prism/node.rb#319 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#328 + # source://prism//lib/prism/node.rb#314 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?new_name: Prism::node, ?old_name: Prism::node, ?keyword_loc: Location, ?location: Location) -> AliasMethodNode # - # source://prism//lib/prism/node.rb#338 + # source://prism//lib/prism/node.rb#324 sig do params( new_name: Prism::Node, @@ -385,13 +391,13 @@ class Prism::AliasMethodNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#323 + # source://prism//lib/prism/node.rb#309 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { new_name: Prism::node, old_name: Prism::node, keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#346 + # source://prism//lib/prism/node.rb#332 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -400,31 +406,31 @@ class Prism::AliasMethodNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#369 + # source://prism//lib/prism/node.rb#355 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#364 + # source://prism//lib/prism/node.rb#350 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#357 + # source://prism//lib/prism/node.rb#343 sig { returns(Prism::Location) } def keyword_loc; end # attr_reader new_name: Prism::node # - # source://prism//lib/prism/node.rb#351 + # source://prism//lib/prism/node.rb#337 sig { returns(Prism::Node) } def new_name; end # attr_reader old_name: Prism::node # - # source://prism//lib/prism/node.rb#354 + # source://prism//lib/prism/node.rb#340 sig { returns(Prism::Node) } def old_name; end @@ -443,7 +449,7 @@ class Prism::AliasMethodNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#387 + # source://prism//lib/prism/node.rb#373 sig { override.returns(Symbol) } def type; end @@ -455,7 +461,7 @@ class Prism::AliasMethodNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#397 + # source://prism//lib/prism/node.rb#383 def type; end end end @@ -465,13 +471,13 @@ end # foo => bar | baz # ^^^^^^^^^ # -# source://prism//lib/prism/node.rb#416 +# source://prism//lib/prism/node.rb#401 class Prism::AlternationPatternNode < ::Prism::Node # def initialize: (Prism::node left, Prism::node right, Location operator_loc, Location location) -> void # # @return [AlternationPatternNode] a new instance of AlternationPatternNode # - # source://prism//lib/prism/node.rb#417 + # source://prism//lib/prism/node.rb#403 sig do params( source: Prism::Source, @@ -486,36 +492,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#512 + # source://prism//lib/prism/node.rb#497 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#427 + # source://prism//lib/prism/node.rb#412 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#432 + # source://prism//lib/prism/node.rb#417 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#442 + # source://prism//lib/prism/node.rb#427 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#437 + # source://prism//lib/prism/node.rb#422 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?left: Prism::node, ?right: Prism::node, ?operator_loc: Location, ?location: Location) -> AlternationPatternNode # - # source://prism//lib/prism/node.rb#447 + # source://prism//lib/prism/node.rb#432 sig do params( left: Prism::Node, @@ -529,13 +535,13 @@ class Prism::AlternationPatternNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#432 + # source://prism//lib/prism/node.rb#417 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { left: Prism::node, right: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#455 + # source://prism//lib/prism/node.rb#440 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -544,31 +550,31 @@ class Prism::AlternationPatternNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#478 + # source://prism//lib/prism/node.rb#463 sig { override.returns(String) } def inspect; end # attr_reader left: Prism::node # - # source://prism//lib/prism/node.rb#460 + # source://prism//lib/prism/node.rb#445 sig { returns(Prism::Node) } def left; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#473 + # source://prism//lib/prism/node.rb#458 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#466 + # source://prism//lib/prism/node.rb#451 sig { returns(Prism::Location) } def operator_loc; end # attr_reader right: Prism::node # - # source://prism//lib/prism/node.rb#463 + # source://prism//lib/prism/node.rb#448 sig { returns(Prism::Node) } def right; end @@ -587,7 +593,7 @@ class Prism::AlternationPatternNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#496 + # source://prism//lib/prism/node.rb#481 sig { override.returns(Symbol) } def type; end @@ -599,7 +605,7 @@ class Prism::AlternationPatternNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#506 + # source://prism//lib/prism/node.rb#491 def type; end end end @@ -609,13 +615,13 @@ end # left and right # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#525 +# source://prism//lib/prism/node.rb#509 class Prism::AndNode < ::Prism::Node # def initialize: (Prism::node left, Prism::node right, Location operator_loc, Location location) -> void # # @return [AndNode] a new instance of AndNode # - # source://prism//lib/prism/node.rb#526 + # source://prism//lib/prism/node.rb#511 sig do params( source: Prism::Source, @@ -630,36 +636,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#636 + # source://prism//lib/prism/node.rb#620 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#536 + # source://prism//lib/prism/node.rb#520 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#541 + # source://prism//lib/prism/node.rb#525 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#551 + # source://prism//lib/prism/node.rb#535 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#546 + # source://prism//lib/prism/node.rb#530 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?left: Prism::node, ?right: Prism::node, ?operator_loc: Location, ?location: Location) -> AndNode # - # source://prism//lib/prism/node.rb#556 + # source://prism//lib/prism/node.rb#540 sig do params( left: Prism::Node, @@ -673,13 +679,13 @@ class Prism::AndNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#541 + # source://prism//lib/prism/node.rb#525 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { left: Prism::node, right: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#564 + # source://prism//lib/prism/node.rb#548 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -688,7 +694,7 @@ class Prism::AndNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#602 + # source://prism//lib/prism/node.rb#586 sig { override.returns(String) } def inspect; end @@ -700,13 +706,13 @@ class Prism::AndNode < ::Prism::Node # 1 && 2 # ^ # - # source://prism//lib/prism/node.rb#575 + # source://prism//lib/prism/node.rb#559 sig { returns(Prism::Node) } def left; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#597 + # source://prism//lib/prism/node.rb#581 sig { returns(String) } def operator; end @@ -715,7 +721,7 @@ class Prism::AndNode < ::Prism::Node # left and right # ^^^ # - # source://prism//lib/prism/node.rb#590 + # source://prism//lib/prism/node.rb#574 sig { returns(Prism::Location) } def operator_loc; end @@ -727,7 +733,7 @@ class Prism::AndNode < ::Prism::Node # 1 and 2 # ^ # - # source://prism//lib/prism/node.rb#584 + # source://prism//lib/prism/node.rb#568 sig { returns(Prism::Node) } def right; end @@ -746,7 +752,7 @@ class Prism::AndNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#620 + # source://prism//lib/prism/node.rb#604 sig { override.returns(Symbol) } def type; end @@ -758,7 +764,7 @@ class Prism::AndNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#630 + # source://prism//lib/prism/node.rb#614 def type; end end end @@ -768,13 +774,13 @@ end # return foo, bar, baz # ^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#649 +# source://prism//lib/prism/node.rb#632 class Prism::ArgumentsNode < ::Prism::Node # def initialize: (Integer flags, Array[Prism::node] arguments, Location location) -> void # # @return [ArgumentsNode] a new instance of ArgumentsNode # - # source://prism//lib/prism/node.rb#650 + # source://prism//lib/prism/node.rb#634 sig do params( source: Prism::Source, @@ -788,36 +794,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#743 + # source://prism//lib/prism/node.rb#726 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#659 + # source://prism//lib/prism/node.rb#642 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#696 + # source://prism//lib/prism/node.rb#679 sig { returns(T::Array[Prism::Node]) } def arguments; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#664 + # source://prism//lib/prism/node.rb#647 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#674 + # source://prism//lib/prism/node.rb#657 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#669 + # source://prism//lib/prism/node.rb#652 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end @@ -825,7 +831,7 @@ class Prism::ArgumentsNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#704 + # source://prism//lib/prism/node.rb#687 sig { returns(T::Boolean) } def contains_keyword_splat?; end @@ -833,13 +839,13 @@ class Prism::ArgumentsNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#699 + # source://prism//lib/prism/node.rb#682 sig { returns(T::Boolean) } def contains_keywords?; end # def copy: (?flags: Integer, ?arguments: Array[Prism::node], ?location: Location) -> ArgumentsNode # - # source://prism//lib/prism/node.rb#679 + # source://prism//lib/prism/node.rb#662 sig do params( flags: Integer, @@ -852,13 +858,13 @@ class Prism::ArgumentsNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#664 + # source://prism//lib/prism/node.rb#647 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, arguments: Array[Prism::node], location: Location } # - # source://prism//lib/prism/node.rb#687 + # source://prism//lib/prism/node.rb#670 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -867,7 +873,7 @@ class Prism::ArgumentsNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#709 + # source://prism//lib/prism/node.rb#692 sig { override.returns(String) } def inspect; end @@ -886,7 +892,7 @@ class Prism::ArgumentsNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#727 + # source://prism//lib/prism/node.rb#710 sig { override.returns(Symbol) } def type; end @@ -894,7 +900,7 @@ class Prism::ArgumentsNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#692 + # source://prism//lib/prism/node.rb#675 sig { returns(Integer) } def flags; end @@ -906,24 +912,24 @@ class Prism::ArgumentsNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#737 + # source://prism//lib/prism/node.rb#720 def type; end end end # Flags for arguments nodes. # -# source://prism//lib/prism/node.rb#19202 +# source://prism//lib/prism/node.rb#19127 module Prism::ArgumentsNodeFlags; end # if arguments contain keywords # -# source://prism//lib/prism/node.rb#19204 +# source://prism//lib/prism/node.rb#19129 Prism::ArgumentsNodeFlags::CONTAINS_KEYWORDS = T.let(T.unsafe(nil), Integer) # if arguments contain keyword splat # -# source://prism//lib/prism/node.rb#19207 +# source://prism//lib/prism/node.rb#19132 Prism::ArgumentsNodeFlags::CONTAINS_KEYWORD_SPLAT = T.let(T.unsafe(nil), Integer) # Represents an array literal. This can be a regular array using brackets or a special array using % like %w or %i. @@ -931,13 +937,13 @@ Prism::ArgumentsNodeFlags::CONTAINS_KEYWORD_SPLAT = T.let(T.unsafe(nil), Integer # [1, 2, 3] # ^^^^^^^^^ # -# source://prism//lib/prism/node.rb#756 +# source://prism//lib/prism/node.rb#738 class Prism::ArrayNode < ::Prism::Node # def initialize: (Integer flags, Array[Prism::node] elements, Location? opening_loc, Location? closing_loc, Location location) -> void # # @return [ArrayNode] a new instance of ArrayNode # - # source://prism//lib/prism/node.rb#757 + # source://prism//lib/prism/node.rb#740 sig do params( source: Prism::Source, @@ -953,24 +959,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#893 + # source://prism//lib/prism/node.rb#875 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#768 + # source://prism//lib/prism/node.rb#750 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#773 + # source://prism//lib/prism/node.rb#755 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#854 + # source://prism//lib/prism/node.rb#836 sig { returns(T.nilable(String)) } def closing; end @@ -981,19 +987,19 @@ class Prism::ArrayNode < ::Prism::Node # %I(apple orange banana) # ")" # foo = 1, 2, 3 # nil # - # source://prism//lib/prism/node.rb#831 + # source://prism//lib/prism/node.rb#813 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#783 + # source://prism//lib/prism/node.rb#765 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#778 + # source://prism//lib/prism/node.rb#760 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end @@ -1001,13 +1007,13 @@ class Prism::ArrayNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#844 + # source://prism//lib/prism/node.rb#826 sig { returns(T::Boolean) } def contains_splat?; end # def copy: (?flags: Integer, ?elements: Array[Prism::node], ?opening_loc: Location?, ?closing_loc: Location?, ?location: Location) -> ArrayNode # - # source://prism//lib/prism/node.rb#788 + # source://prism//lib/prism/node.rb#770 sig do params( flags: Integer, @@ -1022,19 +1028,19 @@ class Prism::ArrayNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#773 + # source://prism//lib/prism/node.rb#755 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, elements: Array[Prism::node], opening_loc: Location?, closing_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#796 + # source://prism//lib/prism/node.rb#778 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#805 + # source://prism//lib/prism/node.rb#787 sig { returns(T::Array[Prism::Node]) } def elements; end @@ -1043,13 +1049,13 @@ class Prism::ArrayNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#859 + # source://prism//lib/prism/node.rb#841 sig { override.returns(String) } def inspect; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#849 + # source://prism//lib/prism/node.rb#831 sig { returns(T.nilable(String)) } def opening; end @@ -1060,7 +1066,7 @@ class Prism::ArrayNode < ::Prism::Node # %I(apple orange banana) # "%I(" # foo = 1, 2, 3 # nil # - # source://prism//lib/prism/node.rb#813 + # source://prism//lib/prism/node.rb#795 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end @@ -1079,7 +1085,7 @@ class Prism::ArrayNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#877 + # source://prism//lib/prism/node.rb#859 sig { override.returns(Symbol) } def type; end @@ -1087,7 +1093,7 @@ class Prism::ArrayNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#801 + # source://prism//lib/prism/node.rb#783 sig { returns(Integer) } def flags; end @@ -1099,19 +1105,19 @@ class Prism::ArrayNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#887 + # source://prism//lib/prism/node.rb#869 def type; end end end # Flags for array nodes. # -# source://prism//lib/prism/node.rb#19211 +# source://prism//lib/prism/node.rb#19136 module Prism::ArrayNodeFlags; end # if array contains splat nodes # -# source://prism//lib/prism/node.rb#19213 +# source://prism//lib/prism/node.rb#19138 Prism::ArrayNodeFlags::CONTAINS_SPLAT = T.let(T.unsafe(nil), Integer) # Represents an array pattern in pattern matching. @@ -1131,13 +1137,13 @@ Prism::ArrayNodeFlags::CONTAINS_SPLAT = T.let(T.unsafe(nil), Integer) # foo in Bar[1, 2, 3] # ^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#920 +# source://prism//lib/prism/node.rb#901 class Prism::ArrayPatternNode < ::Prism::Node # def initialize: (Prism::node? constant, Array[Prism::node] requireds, Prism::node? rest, Array[Prism::node] posts, Location? opening_loc, Location? closing_loc, Location location) -> void # # @return [ArrayPatternNode] a new instance of ArrayPatternNode # - # source://prism//lib/prism/node.rb#921 + # source://prism//lib/prism/node.rb#903 sig do params( source: Prism::Source, @@ -1155,54 +1161,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#1054 + # source://prism//lib/prism/node.rb#1035 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#934 + # source://prism//lib/prism/node.rb#915 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#939 + # source://prism//lib/prism/node.rb#920 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#1015 + # source://prism//lib/prism/node.rb#996 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#997 + # source://prism//lib/prism/node.rb#978 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#954 + # source://prism//lib/prism/node.rb#935 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#944 + # source://prism//lib/prism/node.rb#925 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # attr_reader constant: Prism::node? # - # source://prism//lib/prism/node.rb#972 + # source://prism//lib/prism/node.rb#953 sig { returns(T.nilable(Prism::Node)) } def constant; end # def copy: (?constant: Prism::node?, ?requireds: Array[Prism::node], ?rest: Prism::node?, ?posts: Array[Prism::node], ?opening_loc: Location?, ?closing_loc: Location?, ?location: Location) -> ArrayPatternNode # - # source://prism//lib/prism/node.rb#959 + # source://prism//lib/prism/node.rb#940 sig do params( constant: T.nilable(Prism::Node), @@ -1219,13 +1225,13 @@ class Prism::ArrayPatternNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#939 + # source://prism//lib/prism/node.rb#920 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { constant: Prism::node?, requireds: Array[Prism::node], rest: Prism::node?, posts: Array[Prism::node], opening_loc: Location?, closing_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#967 + # source://prism//lib/prism/node.rb#948 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -1234,37 +1240,37 @@ class Prism::ArrayPatternNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#1020 + # source://prism//lib/prism/node.rb#1001 sig { override.returns(String) } def inspect; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#1010 + # source://prism//lib/prism/node.rb#991 sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#984 + # source://prism//lib/prism/node.rb#965 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end # attr_reader posts: Array[Prism::node] # - # source://prism//lib/prism/node.rb#981 + # source://prism//lib/prism/node.rb#962 sig { returns(T::Array[Prism::Node]) } def posts; end # attr_reader requireds: Array[Prism::node] # - # source://prism//lib/prism/node.rb#975 + # source://prism//lib/prism/node.rb#956 sig { returns(T::Array[Prism::Node]) } def requireds; end # attr_reader rest: Prism::node? # - # source://prism//lib/prism/node.rb#978 + # source://prism//lib/prism/node.rb#959 sig { returns(T.nilable(Prism::Node)) } def rest; end @@ -1283,7 +1289,7 @@ class Prism::ArrayPatternNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#1038 + # source://prism//lib/prism/node.rb#1019 sig { override.returns(Symbol) } def type; end @@ -1295,7 +1301,7 @@ class Prism::ArrayPatternNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#1048 + # source://prism//lib/prism/node.rb#1029 def type; end end end @@ -1305,13 +1311,13 @@ end # { a => b } # ^^^^^^ # -# source://prism//lib/prism/node.rb#1072 +# source://prism//lib/prism/node.rb#1052 class Prism::AssocNode < ::Prism::Node # def initialize: (Prism::node key, Prism::node value, Location? operator_loc, Location location) -> void # # @return [AssocNode] a new instance of AssocNode # - # source://prism//lib/prism/node.rb#1073 + # source://prism//lib/prism/node.rb#1054 sig do params( source: Prism::Source, @@ -1326,36 +1332,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#1192 + # source://prism//lib/prism/node.rb#1172 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1083 + # source://prism//lib/prism/node.rb#1063 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#1088 + # source://prism//lib/prism/node.rb#1068 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#1098 + # source://prism//lib/prism/node.rb#1078 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#1093 + # source://prism//lib/prism/node.rb#1073 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?key: Prism::node, ?value: Prism::node, ?operator_loc: Location?, ?location: Location) -> AssocNode # - # source://prism//lib/prism/node.rb#1103 + # source://prism//lib/prism/node.rb#1083 sig do params( key: Prism::Node, @@ -1369,13 +1375,13 @@ class Prism::AssocNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1088 + # source://prism//lib/prism/node.rb#1068 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { key: Prism::node, value: Prism::node, operator_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#1111 + # source://prism//lib/prism/node.rb#1091 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -1384,7 +1390,7 @@ class Prism::AssocNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#1158 + # source://prism//lib/prism/node.rb#1138 sig { override.returns(String) } def inspect; end @@ -1399,13 +1405,13 @@ class Prism::AssocNode < ::Prism::Node # { def a; end => 1 } # ^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#1125 + # source://prism//lib/prism/node.rb#1105 sig { returns(Prism::Node) } def key; end # def operator: () -> String? # - # source://prism//lib/prism/node.rb#1153 + # source://prism//lib/prism/node.rb#1133 sig { returns(T.nilable(String)) } def operator; end @@ -1414,7 +1420,7 @@ class Prism::AssocNode < ::Prism::Node # { foo => bar } # ^^ # - # source://prism//lib/prism/node.rb#1140 + # source://prism//lib/prism/node.rb#1120 sig { returns(T.nilable(Prism::Location)) } def operator_loc; end @@ -1433,7 +1439,7 @@ class Prism::AssocNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#1176 + # source://prism//lib/prism/node.rb#1156 sig { override.returns(Symbol) } def type; end @@ -1445,7 +1451,7 @@ class Prism::AssocNode < ::Prism::Node # { x: 1 } # ^ # - # source://prism//lib/prism/node.rb#1134 + # source://prism//lib/prism/node.rb#1114 sig { returns(Prism::Node) } def value; end @@ -1457,7 +1463,7 @@ class Prism::AssocNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#1186 + # source://prism//lib/prism/node.rb#1166 def type; end end end @@ -1467,13 +1473,13 @@ end # { **foo } # ^^^^^ # -# source://prism//lib/prism/node.rb#1205 +# source://prism//lib/prism/node.rb#1184 class Prism::AssocSplatNode < ::Prism::Node # def initialize: (Prism::node? value, Location operator_loc, Location location) -> void # # @return [AssocSplatNode] a new instance of AssocSplatNode # - # source://prism//lib/prism/node.rb#1206 + # source://prism//lib/prism/node.rb#1186 sig do params( source: Prism::Source, @@ -1487,36 +1493,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#1305 + # source://prism//lib/prism/node.rb#1284 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1215 + # source://prism//lib/prism/node.rb#1194 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#1220 + # source://prism//lib/prism/node.rb#1199 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#1232 + # source://prism//lib/prism/node.rb#1211 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#1225 + # source://prism//lib/prism/node.rb#1204 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?value: Prism::node?, ?operator_loc: Location, ?location: Location) -> AssocSplatNode # - # source://prism//lib/prism/node.rb#1237 + # source://prism//lib/prism/node.rb#1216 sig do params( value: T.nilable(Prism::Node), @@ -1529,13 +1535,13 @@ class Prism::AssocSplatNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1220 + # source://prism//lib/prism/node.rb#1199 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { value: Prism::node?, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#1245 + # source://prism//lib/prism/node.rb#1224 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -1544,13 +1550,13 @@ class Prism::AssocSplatNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#1271 + # source://prism//lib/prism/node.rb#1250 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#1266 + # source://prism//lib/prism/node.rb#1245 sig { returns(String) } def operator; end @@ -1559,7 +1565,7 @@ class Prism::AssocSplatNode < ::Prism::Node # { **x } # ^^ # - # source://prism//lib/prism/node.rb#1259 + # source://prism//lib/prism/node.rb#1238 sig { returns(Prism::Location) } def operator_loc; end @@ -1578,7 +1584,7 @@ class Prism::AssocSplatNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#1289 + # source://prism//lib/prism/node.rb#1268 sig { override.returns(Symbol) } def type; end @@ -1587,7 +1593,7 @@ class Prism::AssocSplatNode < ::Prism::Node # { **foo } # ^^^ # - # source://prism//lib/prism/node.rb#1253 + # source://prism//lib/prism/node.rb#1232 sig { returns(T.nilable(Prism::Node)) } def value; end @@ -1599,14 +1605,14 @@ class Prism::AssocSplatNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#1299 + # source://prism//lib/prism/node.rb#1278 def type; end end end # The FFI backend is used on other Ruby implementations. # -# source://prism//lib/prism.rb#85 +# 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. @@ -1614,62 +1620,62 @@ Prism::BACKEND = T.let(T.unsafe(nil), Symbol) # $' # ^^ # -# source://prism//lib/prism/node.rb#1317 +# source://prism//lib/prism/node.rb#1295 class Prism::BackReferenceReadNode < ::Prism::Node # def initialize: (Symbol name, Location location) -> void # # @return [BackReferenceReadNode] a new instance of BackReferenceReadNode # - # source://prism//lib/prism/node.rb#1318 + # source://prism//lib/prism/node.rb#1297 sig { params(source: Prism::Source, name: Symbol, location: Prism::Location).void } def initialize(source, name, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#1400 + # source://prism//lib/prism/node.rb#1378 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1326 + # source://prism//lib/prism/node.rb#1304 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#1331 + # source://prism//lib/prism/node.rb#1309 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#1341 + # source://prism//lib/prism/node.rb#1319 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#1336 + # source://prism//lib/prism/node.rb#1314 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?location: Location) -> BackReferenceReadNode # - # source://prism//lib/prism/node.rb#1346 + # source://prism//lib/prism/node.rb#1324 sig { params(name: Symbol, location: Prism::Location).returns(Prism::BackReferenceReadNode) } def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1331 + # source://prism//lib/prism/node.rb#1309 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#1354 + # source://prism//lib/prism/node.rb#1332 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -1678,7 +1684,7 @@ class Prism::BackReferenceReadNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#1366 + # source://prism//lib/prism/node.rb#1344 sig { override.returns(String) } def inspect; end @@ -1688,7 +1694,7 @@ class Prism::BackReferenceReadNode < ::Prism::Node # # $+ # name `:$+` # - # source://prism//lib/prism/node.rb#1363 + # source://prism//lib/prism/node.rb#1341 sig { returns(Symbol) } def name; end @@ -1707,7 +1713,7 @@ class Prism::BackReferenceReadNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#1384 + # source://prism//lib/prism/node.rb#1362 sig { override.returns(Symbol) } def type; end @@ -1719,7 +1725,7 @@ class Prism::BackReferenceReadNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#1394 + # source://prism//lib/prism/node.rb#1372 def type; end end end @@ -1758,13 +1764,13 @@ end # end # ^^^^^ # -# source://prism//lib/prism/node.rb#1413 +# source://prism//lib/prism/node.rb#1390 class Prism::BeginNode < ::Prism::Node # def initialize: (Location? begin_keyword_loc, StatementsNode? statements, RescueNode? rescue_clause, ElseNode? else_clause, EnsureNode? ensure_clause, Location? end_keyword_loc, Location location) -> void # # @return [BeginNode] a new instance of BeginNode # - # source://prism//lib/prism/node.rb#1414 + # source://prism//lib/prism/node.rb#1392 sig do params( source: Prism::Source, @@ -1782,48 +1788,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#1551 + # source://prism//lib/prism/node.rb#1524 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1427 + # source://prism//lib/prism/node.rb#1404 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def begin_keyword: () -> String? # - # source://prism//lib/prism/node.rb#1507 + # source://prism//lib/prism/node.rb#1480 sig { returns(T.nilable(String)) } def begin_keyword; end # attr_reader begin_keyword_loc: Location? # - # source://prism//lib/prism/node.rb#1469 + # source://prism//lib/prism/node.rb#1442 sig { returns(T.nilable(Prism::Location)) } def begin_keyword_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1436 + # source://prism//lib/prism/node.rb#1409 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#1451 + # source://prism//lib/prism/node.rb#1424 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#1441 + # source://prism//lib/prism/node.rb#1414 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?begin_keyword_loc: Location?, ?statements: StatementsNode?, ?rescue_clause: RescueNode?, ?else_clause: ElseNode?, ?ensure_clause: EnsureNode?, ?end_keyword_loc: Location?, ?location: Location) -> BeginNode # - # source://prism//lib/prism/node.rb#1456 + # source://prism//lib/prism/node.rb#1429 sig do params( begin_keyword_loc: T.nilable(Prism::Location), @@ -1840,37 +1846,37 @@ class Prism::BeginNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1436 + # source://prism//lib/prism/node.rb#1409 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { begin_keyword_loc: Location?, statements: StatementsNode?, rescue_clause: RescueNode?, else_clause: ElseNode?, ensure_clause: EnsureNode?, end_keyword_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#1464 + # source://prism//lib/prism/node.rb#1437 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#1488 + # source://prism//lib/prism/node.rb#1461 sig { returns(T.nilable(Prism::ElseNode)) } def else_clause; end # def end_keyword: () -> String? # - # source://prism//lib/prism/node.rb#1512 + # source://prism//lib/prism/node.rb#1485 sig { returns(T.nilable(String)) } def end_keyword; end # attr_reader end_keyword_loc: Location? # - # source://prism//lib/prism/node.rb#1494 + # source://prism//lib/prism/node.rb#1467 sig { returns(T.nilable(Prism::Location)) } def end_keyword_loc; end # attr_reader ensure_clause: EnsureNode? # - # source://prism//lib/prism/node.rb#1491 + # source://prism//lib/prism/node.rb#1464 sig { returns(T.nilable(Prism::EnsureNode)) } def ensure_clause; end @@ -1879,22 +1885,22 @@ class Prism::BeginNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#1517 + # source://prism//lib/prism/node.rb#1490 sig { override.returns(String) } def inspect; end + # source://prism//lib/prism/parse_result/newlines.rb#79 + def newline!(lines); end + # attr_reader rescue_clause: RescueNode? # - # source://prism//lib/prism/node.rb#1485 + # source://prism//lib/prism/node.rb#1458 sig { returns(T.nilable(Prism::RescueNode)) } def rescue_clause; end - # source://prism//lib/prism/node.rb#1431 - def set_newline_flag(newline_marked); end - # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#1482 + # source://prism//lib/prism/node.rb#1455 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end @@ -1913,7 +1919,7 @@ class Prism::BeginNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#1535 + # source://prism//lib/prism/node.rb#1508 sig { override.returns(Symbol) } def type; end @@ -1925,7 +1931,7 @@ class Prism::BeginNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#1545 + # source://prism//lib/prism/node.rb#1518 def type; end end end @@ -1935,13 +1941,13 @@ end # bar(&args) # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#1567 +# source://prism//lib/prism/node.rb#1539 class Prism::BlockArgumentNode < ::Prism::Node # def initialize: (Prism::node? expression, Location operator_loc, Location location) -> void # # @return [BlockArgumentNode] a new instance of BlockArgumentNode # - # source://prism//lib/prism/node.rb#1568 + # source://prism//lib/prism/node.rb#1541 sig do params( source: Prism::Source, @@ -1955,36 +1961,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#1661 + # source://prism//lib/prism/node.rb#1633 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1577 + # source://prism//lib/prism/node.rb#1549 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#1582 + # source://prism//lib/prism/node.rb#1554 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#1594 + # source://prism//lib/prism/node.rb#1566 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#1587 + # source://prism//lib/prism/node.rb#1559 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?expression: Prism::node?, ?operator_loc: Location, ?location: Location) -> BlockArgumentNode # - # source://prism//lib/prism/node.rb#1599 + # source://prism//lib/prism/node.rb#1571 sig do params( expression: T.nilable(Prism::Node), @@ -1997,19 +2003,19 @@ class Prism::BlockArgumentNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1582 + # source://prism//lib/prism/node.rb#1554 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { expression: Prism::node?, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#1607 + # source://prism//lib/prism/node.rb#1579 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#1612 + # source://prism//lib/prism/node.rb#1584 sig { returns(T.nilable(Prism::Node)) } def expression; end @@ -2018,19 +2024,19 @@ class Prism::BlockArgumentNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#1627 + # source://prism//lib/prism/node.rb#1599 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#1622 + # source://prism//lib/prism/node.rb#1594 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#1615 + # source://prism//lib/prism/node.rb#1587 sig { returns(Prism::Location) } def operator_loc; end @@ -2049,7 +2055,7 @@ class Prism::BlockArgumentNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#1645 + # source://prism//lib/prism/node.rb#1617 sig { override.returns(Symbol) } def type; end @@ -2061,7 +2067,7 @@ class Prism::BlockArgumentNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#1655 + # source://prism//lib/prism/node.rb#1627 def type; end end end @@ -2071,62 +2077,62 @@ end # a { |; b| } # ^ # -# source://prism//lib/prism/node.rb#1673 +# source://prism//lib/prism/node.rb#1644 class Prism::BlockLocalVariableNode < ::Prism::Node # def initialize: (Integer flags, Symbol name, Location location) -> void # # @return [BlockLocalVariableNode] a new instance of BlockLocalVariableNode # - # source://prism//lib/prism/node.rb#1674 + # source://prism//lib/prism/node.rb#1646 sig { params(source: Prism::Source, flags: Integer, name: Symbol, location: Prism::Location).void } def initialize(source, flags, name, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#1762 + # source://prism//lib/prism/node.rb#1733 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1683 + # source://prism//lib/prism/node.rb#1654 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#1688 + # source://prism//lib/prism/node.rb#1659 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#1698 + # source://prism//lib/prism/node.rb#1669 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#1693 + # source://prism//lib/prism/node.rb#1664 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?name: Symbol, ?location: Location) -> BlockLocalVariableNode # - # source://prism//lib/prism/node.rb#1703 + # source://prism//lib/prism/node.rb#1674 sig { params(flags: Integer, name: Symbol, location: Prism::Location).returns(Prism::BlockLocalVariableNode) } def copy(flags: T.unsafe(nil), name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1688 + # source://prism//lib/prism/node.rb#1659 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#1711 + # source://prism//lib/prism/node.rb#1682 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -2135,13 +2141,13 @@ class Prism::BlockLocalVariableNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#1728 + # source://prism//lib/prism/node.rb#1699 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#1720 + # source://prism//lib/prism/node.rb#1691 sig { returns(Symbol) } def name; end @@ -2149,7 +2155,7 @@ class Prism::BlockLocalVariableNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#1723 + # source://prism//lib/prism/node.rb#1694 sig { returns(T::Boolean) } def repeated_parameter?; end @@ -2168,7 +2174,7 @@ class Prism::BlockLocalVariableNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#1746 + # source://prism//lib/prism/node.rb#1717 sig { override.returns(Symbol) } def type; end @@ -2176,7 +2182,7 @@ class Prism::BlockLocalVariableNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#1716 + # source://prism//lib/prism/node.rb#1687 sig { returns(Integer) } def flags; end @@ -2188,7 +2194,7 @@ class Prism::BlockLocalVariableNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#1756 + # source://prism//lib/prism/node.rb#1727 def type; end end end @@ -2198,13 +2204,13 @@ end # [1, 2, 3].each { |i| puts x } # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#1774 +# source://prism//lib/prism/node.rb#1744 class Prism::BlockNode < ::Prism::Node # def initialize: (Array[Symbol] locals, Prism::node? parameters, Prism::node? body, Location opening_loc, Location closing_loc, Location location) -> void # # @return [BlockNode] a new instance of BlockNode # - # source://prism//lib/prism/node.rb#1775 + # source://prism//lib/prism/node.rb#1746 sig do params( source: Prism::Source, @@ -2221,54 +2227,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#1890 + # source://prism//lib/prism/node.rb#1860 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1787 + # source://prism//lib/prism/node.rb#1757 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader body: Prism::node? # - # source://prism//lib/prism/node.rb#1829 + # source://prism//lib/prism/node.rb#1799 sig { returns(T.nilable(Prism::Node)) } def body; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1792 + # source://prism//lib/prism/node.rb#1762 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#1851 + # source://prism//lib/prism/node.rb#1821 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#1839 + # source://prism//lib/prism/node.rb#1809 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#1805 + # source://prism//lib/prism/node.rb#1775 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#1797 + # source://prism//lib/prism/node.rb#1767 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?locals: Array[Symbol], ?parameters: Prism::node?, ?body: Prism::node?, ?opening_loc: Location, ?closing_loc: Location, ?location: Location) -> BlockNode # - # source://prism//lib/prism/node.rb#1810 + # source://prism//lib/prism/node.rb#1780 sig do params( locals: T::Array[Symbol], @@ -2284,13 +2290,13 @@ class Prism::BlockNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1792 + # source://prism//lib/prism/node.rb#1762 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], parameters: Prism::node?, body: Prism::node?, opening_loc: Location, closing_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#1818 + # source://prism//lib/prism/node.rb#1788 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -2299,31 +2305,31 @@ class Prism::BlockNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#1856 + # source://prism//lib/prism/node.rb#1826 sig { override.returns(String) } def inspect; end # attr_reader locals: Array[Symbol] # - # source://prism//lib/prism/node.rb#1823 + # source://prism//lib/prism/node.rb#1793 sig { returns(T::Array[Symbol]) } def locals; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#1846 + # source://prism//lib/prism/node.rb#1816 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#1832 + # source://prism//lib/prism/node.rb#1802 sig { returns(Prism::Location) } def opening_loc; end # attr_reader parameters: Prism::node? # - # source://prism//lib/prism/node.rb#1826 + # source://prism//lib/prism/node.rb#1796 sig { returns(T.nilable(Prism::Node)) } def parameters; end @@ -2342,7 +2348,7 @@ class Prism::BlockNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#1874 + # source://prism//lib/prism/node.rb#1844 sig { override.returns(Symbol) } def type; end @@ -2354,7 +2360,7 @@ class Prism::BlockNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#1884 + # source://prism//lib/prism/node.rb#1854 def type; end end end @@ -2365,13 +2371,13 @@ end # ^^ # end # -# source://prism//lib/prism/node.rb#1907 +# source://prism//lib/prism/node.rb#1876 class Prism::BlockParameterNode < ::Prism::Node # def initialize: (Integer flags, Symbol? name, Location? name_loc, Location operator_loc, Location location) -> void # # @return [BlockParameterNode] a new instance of BlockParameterNode # - # source://prism//lib/prism/node.rb#1908 + # source://prism//lib/prism/node.rb#1878 sig do params( source: Prism::Source, @@ -2387,36 +2393,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#2023 + # source://prism//lib/prism/node.rb#1992 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1919 + # source://prism//lib/prism/node.rb#1888 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#1924 + # source://prism//lib/prism/node.rb#1893 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#1934 + # source://prism//lib/prism/node.rb#1903 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#1929 + # source://prism//lib/prism/node.rb#1898 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?name: Symbol?, ?name_loc: Location?, ?operator_loc: Location, ?location: Location) -> BlockParameterNode # - # source://prism//lib/prism/node.rb#1939 + # source://prism//lib/prism/node.rb#1908 sig do params( flags: Integer, @@ -2431,13 +2437,13 @@ class Prism::BlockParameterNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1924 + # source://prism//lib/prism/node.rb#1893 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol?, name_loc: Location?, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#1947 + # source://prism//lib/prism/node.rb#1916 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -2446,31 +2452,31 @@ class Prism::BlockParameterNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#1989 + # source://prism//lib/prism/node.rb#1958 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol? # - # source://prism//lib/prism/node.rb#1956 + # source://prism//lib/prism/node.rb#1925 sig { returns(T.nilable(Symbol)) } def name; end # attr_reader name_loc: Location? # - # source://prism//lib/prism/node.rb#1959 + # source://prism//lib/prism/node.rb#1928 sig { returns(T.nilable(Prism::Location)) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#1984 + # source://prism//lib/prism/node.rb#1953 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#1972 + # source://prism//lib/prism/node.rb#1941 sig { returns(Prism::Location) } def operator_loc; end @@ -2478,7 +2484,7 @@ class Prism::BlockParameterNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#1979 + # source://prism//lib/prism/node.rb#1948 sig { returns(T::Boolean) } def repeated_parameter?; end @@ -2497,7 +2503,7 @@ class Prism::BlockParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#2007 + # source://prism//lib/prism/node.rb#1976 sig { override.returns(Symbol) } def type; end @@ -2505,7 +2511,7 @@ class Prism::BlockParameterNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#1952 + # source://prism//lib/prism/node.rb#1921 sig { returns(Integer) } def flags; end @@ -2517,7 +2523,7 @@ class Prism::BlockParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#2017 + # source://prism//lib/prism/node.rb#1986 def type; end end end @@ -2531,13 +2537,13 @@ end # ^^^^^^^^^^^^^^^^^ # end # -# source://prism//lib/prism/node.rb#2041 +# source://prism//lib/prism/node.rb#2009 class Prism::BlockParametersNode < ::Prism::Node # def initialize: (ParametersNode? parameters, Array[BlockLocalVariableNode] locals, Location? opening_loc, Location? closing_loc, Location location) -> void # # @return [BlockParametersNode] a new instance of BlockParametersNode # - # source://prism//lib/prism/node.rb#2042 + # source://prism//lib/prism/node.rb#2011 sig do params( source: Prism::Source, @@ -2553,48 +2559,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#2165 + # source://prism//lib/prism/node.rb#2133 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#2053 + # source://prism//lib/prism/node.rb#2021 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#2058 + # source://prism//lib/prism/node.rb#2026 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#2126 + # source://prism//lib/prism/node.rb#2094 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#2108 + # source://prism//lib/prism/node.rb#2076 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#2071 + # source://prism//lib/prism/node.rb#2039 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#2063 + # source://prism//lib/prism/node.rb#2031 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?parameters: ParametersNode?, ?locals: Array[BlockLocalVariableNode], ?opening_loc: Location?, ?closing_loc: Location?, ?location: Location) -> BlockParametersNode # - # source://prism//lib/prism/node.rb#2076 + # source://prism//lib/prism/node.rb#2044 sig do params( parameters: T.nilable(Prism::ParametersNode), @@ -2609,13 +2615,13 @@ class Prism::BlockParametersNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2058 + # source://prism//lib/prism/node.rb#2026 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { parameters: ParametersNode?, locals: Array[BlockLocalVariableNode], opening_loc: Location?, closing_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#2084 + # source://prism//lib/prism/node.rb#2052 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -2624,31 +2630,31 @@ class Prism::BlockParametersNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#2131 + # source://prism//lib/prism/node.rb#2099 sig { override.returns(String) } def inspect; end # attr_reader locals: Array[BlockLocalVariableNode] # - # source://prism//lib/prism/node.rb#2092 + # source://prism//lib/prism/node.rb#2060 sig { returns(T::Array[Prism::BlockLocalVariableNode]) } def locals; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#2121 + # source://prism//lib/prism/node.rb#2089 sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#2095 + # source://prism//lib/prism/node.rb#2063 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end # attr_reader parameters: ParametersNode? # - # source://prism//lib/prism/node.rb#2089 + # source://prism//lib/prism/node.rb#2057 sig { returns(T.nilable(Prism::ParametersNode)) } def parameters; end @@ -2667,7 +2673,7 @@ class Prism::BlockParametersNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#2149 + # source://prism//lib/prism/node.rb#2117 sig { override.returns(Symbol) } def type; end @@ -2679,7 +2685,7 @@ class Prism::BlockParametersNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#2159 + # source://prism//lib/prism/node.rb#2127 def type; end end end @@ -2689,13 +2695,13 @@ end # break foo # ^^^^^^^^^ # -# source://prism//lib/prism/node.rb#2180 +# source://prism//lib/prism/node.rb#2147 class Prism::BreakNode < ::Prism::Node # def initialize: (ArgumentsNode? arguments, Location keyword_loc, Location location) -> void # # @return [BreakNode] a new instance of BreakNode # - # source://prism//lib/prism/node.rb#2181 + # source://prism//lib/prism/node.rb#2149 sig do params( source: Prism::Source, @@ -2709,12 +2715,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#2280 + # source://prism//lib/prism/node.rb#2247 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#2190 + # source://prism//lib/prism/node.rb#2157 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -2723,31 +2729,31 @@ class Prism::BreakNode < ::Prism::Node # break foo # ^^^ # - # source://prism//lib/prism/node.rb#2228 + # source://prism//lib/prism/node.rb#2195 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2195 + # source://prism//lib/prism/node.rb#2162 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#2207 + # source://prism//lib/prism/node.rb#2174 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#2200 + # source://prism//lib/prism/node.rb#2167 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?arguments: ArgumentsNode?, ?keyword_loc: Location, ?location: Location) -> BreakNode # - # source://prism//lib/prism/node.rb#2212 + # source://prism//lib/prism/node.rb#2179 sig do params( arguments: T.nilable(Prism::ArgumentsNode), @@ -2760,13 +2766,13 @@ class Prism::BreakNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2195 + # source://prism//lib/prism/node.rb#2162 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { arguments: ArgumentsNode?, keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#2220 + # source://prism//lib/prism/node.rb#2187 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -2775,13 +2781,13 @@ class Prism::BreakNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#2246 + # source://prism//lib/prism/node.rb#2213 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#2241 + # source://prism//lib/prism/node.rb#2208 sig { returns(String) } def keyword; end @@ -2790,7 +2796,7 @@ class Prism::BreakNode < ::Prism::Node # break foo # ^^^^^ # - # source://prism//lib/prism/node.rb#2234 + # source://prism//lib/prism/node.rb#2201 sig { returns(Prism::Location) } def keyword_loc; end @@ -2809,7 +2815,7 @@ class Prism::BreakNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#2264 + # source://prism//lib/prism/node.rb#2231 sig { override.returns(Symbol) } def type; end @@ -2821,7 +2827,7 @@ class Prism::BreakNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#2274 + # source://prism//lib/prism/node.rb#2241 def type; end end end @@ -2831,13 +2837,13 @@ end # foo.bar &&= value # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#2292 +# source://prism//lib/prism/node.rb#2258 class Prism::CallAndWriteNode < ::Prism::Node # def initialize: (Integer flags, Prism::node? receiver, Location? call_operator_loc, Location? message_loc, Symbol read_name, Symbol write_name, Location operator_loc, Prism::node value, Location location) -> void # # @return [CallAndWriteNode] a new instance of CallAndWriteNode # - # source://prism//lib/prism/node.rb#2293 + # source://prism//lib/prism/node.rb#2260 sig do params( source: Prism::Source, @@ -2857,12 +2863,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#2462 + # source://prism//lib/prism/node.rb#2428 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#2308 + # source://prism//lib/prism/node.rb#2274 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -2870,43 +2876,43 @@ class Prism::CallAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2403 + # source://prism//lib/prism/node.rb#2369 sig { returns(T::Boolean) } def attribute_write?; end # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#2413 + # source://prism//lib/prism/node.rb#2379 sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//lib/prism/node.rb#2351 + # source://prism//lib/prism/node.rb#2317 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2313 + # source://prism//lib/prism/node.rb#2279 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#2326 + # source://prism//lib/prism/node.rb#2292 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#2318 + # source://prism//lib/prism/node.rb#2284 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?message_loc: Location?, ?read_name: Symbol, ?write_name: Symbol, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> CallAndWriteNode # - # source://prism//lib/prism/node.rb#2331 + # source://prism//lib/prism/node.rb#2297 sig do params( flags: Integer, @@ -2925,13 +2931,13 @@ class Prism::CallAndWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2313 + # source://prism//lib/prism/node.rb#2279 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Prism::node?, call_operator_loc: Location?, message_loc: Location?, read_name: Symbol, write_name: Symbol, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#2339 + # source://prism//lib/prism/node.rb#2305 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -2942,49 +2948,49 @@ class Prism::CallAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2408 + # source://prism//lib/prism/node.rb#2374 sig { returns(T::Boolean) } def ignore_visibility?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#2428 + # source://prism//lib/prism/node.rb#2394 sig { override.returns(String) } def inspect; end # def message: () -> String? # - # source://prism//lib/prism/node.rb#2418 + # source://prism//lib/prism/node.rb#2384 sig { returns(T.nilable(String)) } def message; end # attr_reader message_loc: Location? # - # source://prism//lib/prism/node.rb#2364 + # source://prism//lib/prism/node.rb#2330 sig { returns(T.nilable(Prism::Location)) } def message_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#2423 + # source://prism//lib/prism/node.rb#2389 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#2383 + # source://prism//lib/prism/node.rb#2349 sig { returns(Prism::Location) } def operator_loc; end # attr_reader read_name: Symbol # - # source://prism//lib/prism/node.rb#2377 + # source://prism//lib/prism/node.rb#2343 sig { returns(Symbol) } def read_name; end # attr_reader receiver: Prism::node? # - # source://prism//lib/prism/node.rb#2348 + # source://prism//lib/prism/node.rb#2314 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -2992,7 +2998,7 @@ class Prism::CallAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2393 + # source://prism//lib/prism/node.rb#2359 sig { returns(T::Boolean) } def safe_navigation?; end @@ -3011,13 +3017,13 @@ class Prism::CallAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#2446 + # source://prism//lib/prism/node.rb#2412 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#2390 + # source://prism//lib/prism/node.rb#2356 sig { returns(Prism::Node) } def value; end @@ -3025,13 +3031,13 @@ class Prism::CallAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2398 + # source://prism//lib/prism/node.rb#2364 sig { returns(T::Boolean) } def variable_call?; end # attr_reader write_name: Symbol # - # source://prism//lib/prism/node.rb#2380 + # source://prism//lib/prism/node.rb#2346 sig { returns(Symbol) } def write_name; end @@ -3039,7 +3045,7 @@ class Prism::CallAndWriteNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#2344 + # source://prism//lib/prism/node.rb#2310 sig { returns(Integer) } def flags; end @@ -3051,7 +3057,7 @@ class Prism::CallAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#2456 + # source://prism//lib/prism/node.rb#2422 def type; end end end @@ -3076,13 +3082,13 @@ end # foo&.bar # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#2495 +# source://prism//lib/prism/node.rb#2460 class Prism::CallNode < ::Prism::Node # def initialize: (Integer flags, Prism::node? receiver, Location? call_operator_loc, Symbol name, Location? message_loc, Location? opening_loc, ArgumentsNode? arguments, Location? closing_loc, Prism::node? block, Location location) -> void # # @return [CallNode] a new instance of CallNode # - # source://prism//lib/prism/node.rb#2496 + # source://prism//lib/prism/node.rb#2462 sig do params( source: Prism::Source, @@ -3103,18 +3109,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#2700 + # source://prism//lib/prism/node.rb#2665 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#2512 + # source://prism//lib/prism/node.rb#2477 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#2607 + # source://prism//lib/prism/node.rb#2572 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end @@ -3122,61 +3128,61 @@ class Prism::CallNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2636 + # source://prism//lib/prism/node.rb#2601 sig { returns(T::Boolean) } def attribute_write?; end # attr_reader block: Prism::node? # - # source://prism//lib/prism/node.rb#2623 + # source://prism//lib/prism/node.rb#2588 sig { returns(T.nilable(Prism::Node)) } def block; end # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#2646 + # source://prism//lib/prism/node.rb#2611 sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//lib/prism/node.rb#2565 + # source://prism//lib/prism/node.rb#2530 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2517 + # source://prism//lib/prism/node.rb#2482 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#2661 + # source://prism//lib/prism/node.rb#2626 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#2610 + # source://prism//lib/prism/node.rb#2575 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#2531 + # source://prism//lib/prism/node.rb#2496 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#2522 + # source://prism//lib/prism/node.rb#2487 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?name: Symbol, ?message_loc: Location?, ?opening_loc: Location?, ?arguments: ArgumentsNode?, ?closing_loc: Location?, ?block: Prism::node?, ?location: Location) -> CallNode # - # source://prism//lib/prism/node.rb#2536 + # source://prism//lib/prism/node.rb#2501 sig do params( flags: Integer, @@ -3196,13 +3202,13 @@ class Prism::CallNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2517 + # source://prism//lib/prism/node.rb#2482 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Prism::node?, call_operator_loc: Location?, name: Symbol, message_loc: Location?, opening_loc: Location?, arguments: ArgumentsNode?, closing_loc: Location?, block: Prism::node?, location: Location } # - # source://prism//lib/prism/node.rb#2544 + # source://prism//lib/prism/node.rb#2509 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -3219,7 +3225,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#299 + # source://prism//lib/prism/node_ext.rb#315 sig { returns(T.nilable(Prism::Location)) } def full_message_loc; end @@ -3227,43 +3233,43 @@ class Prism::CallNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2641 + # source://prism//lib/prism/node.rb#2606 sig { returns(T::Boolean) } def ignore_visibility?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#2666 + # source://prism//lib/prism/node.rb#2631 sig { override.returns(String) } def inspect; end # def message: () -> String? # - # source://prism//lib/prism/node.rb#2651 + # source://prism//lib/prism/node.rb#2616 sig { returns(T.nilable(String)) } def message; end # attr_reader message_loc: Location? # - # source://prism//lib/prism/node.rb#2581 + # source://prism//lib/prism/node.rb#2546 sig { returns(T.nilable(Prism::Location)) } def message_loc; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#2578 + # source://prism//lib/prism/node.rb#2543 sig { returns(Symbol) } def name; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#2656 + # source://prism//lib/prism/node.rb#2621 sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#2594 + # source://prism//lib/prism/node.rb#2559 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end @@ -3278,7 +3284,7 @@ class Prism::CallNode < ::Prism::Node # foo + bar # ^^^ # - # source://prism//lib/prism/node.rb#2562 + # source://prism//lib/prism/node.rb#2527 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -3286,7 +3292,7 @@ class Prism::CallNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2626 + # source://prism//lib/prism/node.rb#2591 sig { returns(T::Boolean) } def safe_navigation?; end @@ -3305,7 +3311,7 @@ class Prism::CallNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#2684 + # source://prism//lib/prism/node.rb#2649 sig { override.returns(Symbol) } def type; end @@ -3313,7 +3319,7 @@ class Prism::CallNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2631 + # source://prism//lib/prism/node.rb#2596 sig { returns(T::Boolean) } def variable_call?; end @@ -3321,7 +3327,7 @@ class Prism::CallNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#2549 + # source://prism//lib/prism/node.rb#2514 sig { returns(Integer) } def flags; end @@ -3333,34 +3339,34 @@ class Prism::CallNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#2694 + # source://prism//lib/prism/node.rb#2659 def type; end end end # Flags for call nodes. # -# source://prism//lib/prism/node.rb#19217 +# source://prism//lib/prism/node.rb#19142 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#19225 +# source://prism//lib/prism/node.rb#19150 Prism::CallNodeFlags::ATTRIBUTE_WRITE = T.let(T.unsafe(nil), Integer) # a call that ignores method visibility # -# source://prism//lib/prism/node.rb#19228 +# source://prism//lib/prism/node.rb#19153 Prism::CallNodeFlags::IGNORE_VISIBILITY = T.let(T.unsafe(nil), Integer) # &. operator # -# source://prism//lib/prism/node.rb#19219 +# source://prism//lib/prism/node.rb#19144 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#19222 +# source://prism//lib/prism/node.rb#19147 Prism::CallNodeFlags::VARIABLE_CALL = T.let(T.unsafe(nil), Integer) # Represents the use of an assignment operator on a call. @@ -3368,13 +3374,13 @@ Prism::CallNodeFlags::VARIABLE_CALL = T.let(T.unsafe(nil), Integer) # foo.bar += baz # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#2719 +# source://prism//lib/prism/node.rb#2683 class Prism::CallOperatorWriteNode < ::Prism::Node # def initialize: (Integer flags, Prism::node? receiver, Location? call_operator_loc, Location? message_loc, Symbol read_name, Symbol write_name, Symbol binary_operator, Location binary_operator_loc, Prism::node value, Location location) -> void # # @return [CallOperatorWriteNode] a new instance of CallOperatorWriteNode # - # source://prism//lib/prism/node.rb#2720 + # source://prism//lib/prism/node.rb#2685 sig do params( source: Prism::Source, @@ -3395,12 +3401,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#2888 + # source://prism//lib/prism/node.rb#2852 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#2736 + # source://prism//lib/prism/node.rb#2700 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -3408,55 +3414,55 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2834 + # source://prism//lib/prism/node.rb#2798 sig { returns(T::Boolean) } def attribute_write?; end # attr_reader binary_operator: Symbol # - # source://prism//lib/prism/node.rb#2811 + # source://prism//lib/prism/node.rb#2775 sig { returns(Symbol) } def binary_operator; end # attr_reader binary_operator_loc: Location # - # source://prism//lib/prism/node.rb#2814 + # source://prism//lib/prism/node.rb#2778 sig { returns(Prism::Location) } def binary_operator_loc; end # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#2844 + # source://prism//lib/prism/node.rb#2808 sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//lib/prism/node.rb#2779 + # source://prism//lib/prism/node.rb#2743 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2741 + # source://prism//lib/prism/node.rb#2705 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#2754 + # source://prism//lib/prism/node.rb#2718 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#2746 + # source://prism//lib/prism/node.rb#2710 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?message_loc: Location?, ?read_name: Symbol, ?write_name: Symbol, ?binary_operator: Symbol, ?binary_operator_loc: Location, ?value: Prism::node, ?location: Location) -> CallOperatorWriteNode # - # source://prism//lib/prism/node.rb#2759 + # source://prism//lib/prism/node.rb#2723 sig do params( flags: Integer, @@ -3476,13 +3482,13 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2741 + # source://prism//lib/prism/node.rb#2705 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Prism::node?, call_operator_loc: Location?, message_loc: Location?, read_name: Symbol, write_name: Symbol, binary_operator: Symbol, binary_operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#2767 + # source://prism//lib/prism/node.rb#2731 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -3493,49 +3499,49 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2839 + # source://prism//lib/prism/node.rb#2803 sig { returns(T::Boolean) } def ignore_visibility?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#2854 + # source://prism//lib/prism/node.rb#2818 sig { override.returns(String) } def inspect; end # def message: () -> String? # - # source://prism//lib/prism/node.rb#2849 + # source://prism//lib/prism/node.rb#2813 sig { returns(T.nilable(String)) } def message; end # attr_reader message_loc: Location? # - # source://prism//lib/prism/node.rb#2792 + # source://prism//lib/prism/node.rb#2756 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#307 + # source://prism//lib/prism/node_ext.rb#323 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#314 + # source://prism//lib/prism/node_ext.rb#330 def operator_loc; end # attr_reader read_name: Symbol # - # source://prism//lib/prism/node.rb#2805 + # source://prism//lib/prism/node.rb#2769 sig { returns(Symbol) } def read_name; end # attr_reader receiver: Prism::node? # - # source://prism//lib/prism/node.rb#2776 + # source://prism//lib/prism/node.rb#2740 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -3543,7 +3549,7 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2824 + # source://prism//lib/prism/node.rb#2788 sig { returns(T::Boolean) } def safe_navigation?; end @@ -3562,13 +3568,13 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#2872 + # source://prism//lib/prism/node.rb#2836 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#2821 + # source://prism//lib/prism/node.rb#2785 sig { returns(Prism::Node) } def value; end @@ -3576,13 +3582,13 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2829 + # source://prism//lib/prism/node.rb#2793 sig { returns(T::Boolean) } def variable_call?; end # attr_reader write_name: Symbol # - # source://prism//lib/prism/node.rb#2808 + # source://prism//lib/prism/node.rb#2772 sig { returns(Symbol) } def write_name; end @@ -3590,7 +3596,7 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#2772 + # source://prism//lib/prism/node.rb#2736 sig { returns(Integer) } def flags; end @@ -3602,7 +3608,7 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#2882 + # source://prism//lib/prism/node.rb#2846 def type; end end end @@ -3612,13 +3618,13 @@ end # foo.bar ||= value # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#2907 +# source://prism//lib/prism/node.rb#2870 class Prism::CallOrWriteNode < ::Prism::Node # def initialize: (Integer flags, Prism::node? receiver, Location? call_operator_loc, Location? message_loc, Symbol read_name, Symbol write_name, Location operator_loc, Prism::node value, Location location) -> void # # @return [CallOrWriteNode] a new instance of CallOrWriteNode # - # source://prism//lib/prism/node.rb#2908 + # source://prism//lib/prism/node.rb#2872 sig do params( source: Prism::Source, @@ -3638,12 +3644,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#3077 + # source://prism//lib/prism/node.rb#3040 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#2923 + # source://prism//lib/prism/node.rb#2886 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -3651,43 +3657,43 @@ class Prism::CallOrWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3018 + # source://prism//lib/prism/node.rb#2981 sig { returns(T::Boolean) } def attribute_write?; end # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#3028 + # source://prism//lib/prism/node.rb#2991 sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//lib/prism/node.rb#2966 + # source://prism//lib/prism/node.rb#2929 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2928 + # source://prism//lib/prism/node.rb#2891 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#2941 + # source://prism//lib/prism/node.rb#2904 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#2933 + # source://prism//lib/prism/node.rb#2896 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?message_loc: Location?, ?read_name: Symbol, ?write_name: Symbol, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> CallOrWriteNode # - # source://prism//lib/prism/node.rb#2946 + # source://prism//lib/prism/node.rb#2909 sig do params( flags: Integer, @@ -3706,13 +3712,13 @@ class Prism::CallOrWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2928 + # source://prism//lib/prism/node.rb#2891 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Prism::node?, call_operator_loc: Location?, message_loc: Location?, read_name: Symbol, write_name: Symbol, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#2954 + # source://prism//lib/prism/node.rb#2917 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -3723,49 +3729,49 @@ class Prism::CallOrWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3023 + # source://prism//lib/prism/node.rb#2986 sig { returns(T::Boolean) } def ignore_visibility?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#3043 + # source://prism//lib/prism/node.rb#3006 sig { override.returns(String) } def inspect; end # def message: () -> String? # - # source://prism//lib/prism/node.rb#3033 + # source://prism//lib/prism/node.rb#2996 sig { returns(T.nilable(String)) } def message; end # attr_reader message_loc: Location? # - # source://prism//lib/prism/node.rb#2979 + # source://prism//lib/prism/node.rb#2942 sig { returns(T.nilable(Prism::Location)) } def message_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#3038 + # source://prism//lib/prism/node.rb#3001 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#2998 + # source://prism//lib/prism/node.rb#2961 sig { returns(Prism::Location) } def operator_loc; end # attr_reader read_name: Symbol # - # source://prism//lib/prism/node.rb#2992 + # source://prism//lib/prism/node.rb#2955 sig { returns(Symbol) } def read_name; end # attr_reader receiver: Prism::node? # - # source://prism//lib/prism/node.rb#2963 + # source://prism//lib/prism/node.rb#2926 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -3773,7 +3779,7 @@ class Prism::CallOrWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3008 + # source://prism//lib/prism/node.rb#2971 sig { returns(T::Boolean) } def safe_navigation?; end @@ -3792,13 +3798,13 @@ class Prism::CallOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#3061 + # source://prism//lib/prism/node.rb#3024 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#3005 + # source://prism//lib/prism/node.rb#2968 sig { returns(Prism::Node) } def value; end @@ -3806,13 +3812,13 @@ class Prism::CallOrWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3013 + # source://prism//lib/prism/node.rb#2976 sig { returns(T::Boolean) } def variable_call?; end # attr_reader write_name: Symbol # - # source://prism//lib/prism/node.rb#2995 + # source://prism//lib/prism/node.rb#2958 sig { returns(Symbol) } def write_name; end @@ -3820,7 +3826,7 @@ class Prism::CallOrWriteNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#2959 + # source://prism//lib/prism/node.rb#2922 sig { returns(Integer) } def flags; end @@ -3832,7 +3838,7 @@ class Prism::CallOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#3071 + # source://prism//lib/prism/node.rb#3034 def type; end end end @@ -3850,13 +3856,13 @@ end # for foo.bar in baz do end # ^^^^^^^ # -# source://prism//lib/prism/node.rb#3103 +# source://prism//lib/prism/node.rb#3065 class Prism::CallTargetNode < ::Prism::Node # def initialize: (Integer flags, Prism::node receiver, Location call_operator_loc, Symbol name, Location message_loc, Location location) -> void # # @return [CallTargetNode] a new instance of CallTargetNode # - # source://prism//lib/prism/node.rb#3104 + # source://prism//lib/prism/node.rb#3067 sig do params( source: Prism::Source, @@ -3873,12 +3879,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#3237 + # source://prism//lib/prism/node.rb#3199 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3116 + # source://prism//lib/prism/node.rb#3078 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -3886,43 +3892,43 @@ class Prism::CallTargetNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3183 + # source://prism//lib/prism/node.rb#3145 sig { returns(T::Boolean) } def attribute_write?; end # def call_operator: () -> String # - # source://prism//lib/prism/node.rb#3193 + # source://prism//lib/prism/node.rb#3155 sig { returns(String) } def call_operator; end # attr_reader call_operator_loc: Location # - # source://prism//lib/prism/node.rb#3156 + # source://prism//lib/prism/node.rb#3118 sig { returns(Prism::Location) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3121 + # source://prism//lib/prism/node.rb#3083 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#3131 + # source://prism//lib/prism/node.rb#3093 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#3126 + # source://prism//lib/prism/node.rb#3088 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?receiver: Prism::node, ?call_operator_loc: Location, ?name: Symbol, ?message_loc: Location, ?location: Location) -> CallTargetNode # - # source://prism//lib/prism/node.rb#3136 + # source://prism//lib/prism/node.rb#3098 sig do params( flags: Integer, @@ -3938,13 +3944,13 @@ class Prism::CallTargetNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3121 + # source://prism//lib/prism/node.rb#3083 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Prism::node, call_operator_loc: Location, name: Symbol, message_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#3144 + # source://prism//lib/prism/node.rb#3106 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -3955,37 +3961,37 @@ class Prism::CallTargetNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3188 + # source://prism//lib/prism/node.rb#3150 sig { returns(T::Boolean) } def ignore_visibility?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#3203 + # source://prism//lib/prism/node.rb#3165 sig { override.returns(String) } def inspect; end # def message: () -> String # - # source://prism//lib/prism/node.rb#3198 + # source://prism//lib/prism/node.rb#3160 sig { returns(String) } def message; end # attr_reader message_loc: Location # - # source://prism//lib/prism/node.rb#3166 + # source://prism//lib/prism/node.rb#3128 sig { returns(Prism::Location) } def message_loc; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#3163 + # source://prism//lib/prism/node.rb#3125 sig { returns(Symbol) } def name; end # attr_reader receiver: Prism::node # - # source://prism//lib/prism/node.rb#3153 + # source://prism//lib/prism/node.rb#3115 sig { returns(Prism::Node) } def receiver; end @@ -3993,7 +3999,7 @@ class Prism::CallTargetNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3173 + # source://prism//lib/prism/node.rb#3135 sig { returns(T::Boolean) } def safe_navigation?; end @@ -4012,7 +4018,7 @@ class Prism::CallTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#3221 + # source://prism//lib/prism/node.rb#3183 sig { override.returns(Symbol) } def type; end @@ -4020,7 +4026,7 @@ class Prism::CallTargetNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3178 + # source://prism//lib/prism/node.rb#3140 sig { returns(T::Boolean) } def variable_call?; end @@ -4028,7 +4034,7 @@ class Prism::CallTargetNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#3149 + # source://prism//lib/prism/node.rb#3111 sig { returns(Integer) } def flags; end @@ -4040,7 +4046,7 @@ class Prism::CallTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#3231 + # source://prism//lib/prism/node.rb#3193 def type; end end end @@ -4050,13 +4056,13 @@ end # foo => [bar => baz] # ^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#3252 +# source://prism//lib/prism/node.rb#3213 class Prism::CapturePatternNode < ::Prism::Node # def initialize: (Prism::node value, Prism::node target, Location operator_loc, Location location) -> void # # @return [CapturePatternNode] a new instance of CapturePatternNode # - # source://prism//lib/prism/node.rb#3253 + # source://prism//lib/prism/node.rb#3215 sig do params( source: Prism::Source, @@ -4071,36 +4077,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#3348 + # source://prism//lib/prism/node.rb#3309 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3263 + # source://prism//lib/prism/node.rb#3224 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#3268 + # source://prism//lib/prism/node.rb#3229 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#3278 + # source://prism//lib/prism/node.rb#3239 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#3273 + # source://prism//lib/prism/node.rb#3234 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?value: Prism::node, ?target: Prism::node, ?operator_loc: Location, ?location: Location) -> CapturePatternNode # - # source://prism//lib/prism/node.rb#3283 + # source://prism//lib/prism/node.rb#3244 sig do params( value: Prism::Node, @@ -4114,13 +4120,13 @@ class Prism::CapturePatternNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3268 + # source://prism//lib/prism/node.rb#3229 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { value: Prism::node, target: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#3291 + # source://prism//lib/prism/node.rb#3252 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -4129,25 +4135,25 @@ class Prism::CapturePatternNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#3314 + # source://prism//lib/prism/node.rb#3275 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#3309 + # source://prism//lib/prism/node.rb#3270 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#3302 + # source://prism//lib/prism/node.rb#3263 sig { returns(Prism::Location) } def operator_loc; end # attr_reader target: Prism::node # - # source://prism//lib/prism/node.rb#3299 + # source://prism//lib/prism/node.rb#3260 sig { returns(Prism::Node) } def target; end @@ -4166,13 +4172,13 @@ class Prism::CapturePatternNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#3332 + # source://prism//lib/prism/node.rb#3293 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#3296 + # source://prism//lib/prism/node.rb#3257 sig { returns(Prism::Node) } def value; end @@ -4184,7 +4190,7 @@ class Prism::CapturePatternNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#3342 + # source://prism//lib/prism/node.rb#3303 def type; end end end @@ -4196,13 +4202,13 @@ end # end # ^^^^^^^^^ # -# source://prism//lib/prism/node.rb#3363 +# source://prism//lib/prism/node.rb#3323 class Prism::CaseMatchNode < ::Prism::Node # def initialize: (Prism::node? predicate, Array[Prism::node] conditions, ElseNode? consequent, Location case_keyword_loc, Location end_keyword_loc, Location location) -> void # # @return [CaseMatchNode] a new instance of CaseMatchNode # - # source://prism//lib/prism/node.rb#3364 + # source://prism//lib/prism/node.rb#3325 sig do params( source: Prism::Source, @@ -4219,60 +4225,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#3480 + # source://prism//lib/prism/node.rb#3440 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3376 + # source://prism//lib/prism/node.rb#3336 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def case_keyword: () -> String # - # source://prism//lib/prism/node.rb#3436 + # source://prism//lib/prism/node.rb#3396 sig { returns(String) } def case_keyword; end # attr_reader case_keyword_loc: Location # - # source://prism//lib/prism/node.rb#3422 + # source://prism//lib/prism/node.rb#3382 sig { returns(Prism::Location) } def case_keyword_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3381 + # source://prism//lib/prism/node.rb#3341 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#3395 + # source://prism//lib/prism/node.rb#3355 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#3386 + # source://prism//lib/prism/node.rb#3346 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # attr_reader conditions: Array[Prism::node] # - # source://prism//lib/prism/node.rb#3416 + # source://prism//lib/prism/node.rb#3376 sig { returns(T::Array[Prism::Node]) } def conditions; end # attr_reader consequent: ElseNode? # - # source://prism//lib/prism/node.rb#3419 + # source://prism//lib/prism/node.rb#3379 sig { returns(T.nilable(Prism::ElseNode)) } def consequent; end # def copy: (?predicate: Prism::node?, ?conditions: Array[Prism::node], ?consequent: ElseNode?, ?case_keyword_loc: Location, ?end_keyword_loc: Location, ?location: Location) -> CaseMatchNode # - # source://prism//lib/prism/node.rb#3400 + # source://prism//lib/prism/node.rb#3360 sig do params( predicate: T.nilable(Prism::Node), @@ -4288,25 +4294,25 @@ class Prism::CaseMatchNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3381 + # source://prism//lib/prism/node.rb#3341 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { predicate: Prism::node?, conditions: Array[Prism::node], consequent: ElseNode?, case_keyword_loc: Location, end_keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#3408 + # source://prism//lib/prism/node.rb#3368 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#3441 + # source://prism//lib/prism/node.rb#3401 sig { returns(String) } def end_keyword; end # attr_reader end_keyword_loc: Location # - # source://prism//lib/prism/node.rb#3429 + # source://prism//lib/prism/node.rb#3389 sig { returns(Prism::Location) } def end_keyword_loc; end @@ -4315,13 +4321,13 @@ class Prism::CaseMatchNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#3446 + # source://prism//lib/prism/node.rb#3406 sig { override.returns(String) } def inspect; end # attr_reader predicate: Prism::node? # - # source://prism//lib/prism/node.rb#3413 + # source://prism//lib/prism/node.rb#3373 sig { returns(T.nilable(Prism::Node)) } def predicate; end @@ -4340,7 +4346,7 @@ class Prism::CaseMatchNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#3464 + # source://prism//lib/prism/node.rb#3424 sig { override.returns(Symbol) } def type; end @@ -4352,7 +4358,7 @@ class Prism::CaseMatchNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#3474 + # source://prism//lib/prism/node.rb#3434 def type; end end end @@ -4364,13 +4370,13 @@ end # end # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#3498 +# source://prism//lib/prism/node.rb#3457 class Prism::CaseNode < ::Prism::Node # def initialize: (Prism::node? predicate, Array[Prism::node] conditions, ElseNode? consequent, Location case_keyword_loc, Location end_keyword_loc, Location location) -> void # # @return [CaseNode] a new instance of CaseNode # - # source://prism//lib/prism/node.rb#3499 + # source://prism//lib/prism/node.rb#3459 sig do params( source: Prism::Source, @@ -4387,60 +4393,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#3615 + # source://prism//lib/prism/node.rb#3574 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3511 + # source://prism//lib/prism/node.rb#3470 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def case_keyword: () -> String # - # source://prism//lib/prism/node.rb#3571 + # source://prism//lib/prism/node.rb#3530 sig { returns(String) } def case_keyword; end # attr_reader case_keyword_loc: Location # - # source://prism//lib/prism/node.rb#3557 + # source://prism//lib/prism/node.rb#3516 sig { returns(Prism::Location) } def case_keyword_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3516 + # source://prism//lib/prism/node.rb#3475 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#3530 + # source://prism//lib/prism/node.rb#3489 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#3521 + # source://prism//lib/prism/node.rb#3480 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # attr_reader conditions: Array[Prism::node] # - # source://prism//lib/prism/node.rb#3551 + # source://prism//lib/prism/node.rb#3510 sig { returns(T::Array[Prism::Node]) } def conditions; end # attr_reader consequent: ElseNode? # - # source://prism//lib/prism/node.rb#3554 + # source://prism//lib/prism/node.rb#3513 sig { returns(T.nilable(Prism::ElseNode)) } def consequent; end # def copy: (?predicate: Prism::node?, ?conditions: Array[Prism::node], ?consequent: ElseNode?, ?case_keyword_loc: Location, ?end_keyword_loc: Location, ?location: Location) -> CaseNode # - # source://prism//lib/prism/node.rb#3535 + # source://prism//lib/prism/node.rb#3494 sig do params( predicate: T.nilable(Prism::Node), @@ -4456,25 +4462,25 @@ class Prism::CaseNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3516 + # source://prism//lib/prism/node.rb#3475 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { predicate: Prism::node?, conditions: Array[Prism::node], consequent: ElseNode?, case_keyword_loc: Location, end_keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#3543 + # source://prism//lib/prism/node.rb#3502 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#3576 + # source://prism//lib/prism/node.rb#3535 sig { returns(String) } def end_keyword; end # attr_reader end_keyword_loc: Location # - # source://prism//lib/prism/node.rb#3564 + # source://prism//lib/prism/node.rb#3523 sig { returns(Prism::Location) } def end_keyword_loc; end @@ -4483,13 +4489,13 @@ class Prism::CaseNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#3581 + # source://prism//lib/prism/node.rb#3540 sig { override.returns(String) } def inspect; end # attr_reader predicate: Prism::node? # - # source://prism//lib/prism/node.rb#3548 + # source://prism//lib/prism/node.rb#3507 sig { returns(T.nilable(Prism::Node)) } def predicate; end @@ -4508,7 +4514,7 @@ class Prism::CaseNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#3599 + # source://prism//lib/prism/node.rb#3558 sig { override.returns(Symbol) } def type; end @@ -4520,7 +4526,7 @@ class Prism::CaseNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#3609 + # source://prism//lib/prism/node.rb#3568 def type; end end end @@ -4530,13 +4536,13 @@ end # class Foo end # ^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#3631 +# source://prism//lib/prism/node.rb#3589 class Prism::ClassNode < ::Prism::Node # def initialize: (Array[Symbol] locals, Location class_keyword_loc, Prism::node constant_path, Location? inheritance_operator_loc, Prism::node? superclass, Prism::node? body, Location end_keyword_loc, Symbol name, Location location) -> void # # @return [ClassNode] a new instance of ClassNode # - # source://prism//lib/prism/node.rb#3632 + # source://prism//lib/prism/node.rb#3591 sig do params( source: Prism::Source, @@ -4556,60 +4562,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#3775 + # source://prism//lib/prism/node.rb#3733 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3647 + # source://prism//lib/prism/node.rb#3605 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader body: Prism::node? # - # source://prism//lib/prism/node.rb#3713 + # source://prism//lib/prism/node.rb#3671 sig { returns(T.nilable(Prism::Node)) } def body; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3652 + # source://prism//lib/prism/node.rb#3610 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def class_keyword: () -> String # - # source://prism//lib/prism/node.rb#3726 + # source://prism//lib/prism/node.rb#3684 sig { returns(String) } def class_keyword; end # attr_reader class_keyword_loc: Location # - # source://prism//lib/prism/node.rb#3687 + # source://prism//lib/prism/node.rb#3645 sig { returns(Prism::Location) } def class_keyword_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#3666 + # source://prism//lib/prism/node.rb#3624 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#3657 + # source://prism//lib/prism/node.rb#3615 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # attr_reader constant_path: Prism::node # - # source://prism//lib/prism/node.rb#3694 + # source://prism//lib/prism/node.rb#3652 sig { returns(Prism::Node) } def constant_path; end # def copy: (?locals: Array[Symbol], ?class_keyword_loc: Location, ?constant_path: Prism::node, ?inheritance_operator_loc: Location?, ?superclass: Prism::node?, ?body: Prism::node?, ?end_keyword_loc: Location, ?name: Symbol, ?location: Location) -> ClassNode # - # source://prism//lib/prism/node.rb#3671 + # source://prism//lib/prism/node.rb#3629 sig do params( locals: T::Array[Symbol], @@ -4628,25 +4634,25 @@ class Prism::ClassNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3652 + # source://prism//lib/prism/node.rb#3610 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], class_keyword_loc: Location, constant_path: Prism::node, inheritance_operator_loc: Location?, superclass: Prism::node?, body: Prism::node?, end_keyword_loc: Location, name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#3679 + # source://prism//lib/prism/node.rb#3637 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#3736 + # source://prism//lib/prism/node.rb#3694 sig { returns(String) } def end_keyword; end # attr_reader end_keyword_loc: Location # - # source://prism//lib/prism/node.rb#3716 + # source://prism//lib/prism/node.rb#3674 sig { returns(Prism::Location) } def end_keyword_loc; end @@ -4655,37 +4661,37 @@ class Prism::ClassNode < ::Prism::Node # def inheritance_operator: () -> String? # - # source://prism//lib/prism/node.rb#3731 + # source://prism//lib/prism/node.rb#3689 sig { returns(T.nilable(String)) } def inheritance_operator; end # attr_reader inheritance_operator_loc: Location? # - # source://prism//lib/prism/node.rb#3697 + # source://prism//lib/prism/node.rb#3655 sig { returns(T.nilable(Prism::Location)) } def inheritance_operator_loc; end # def inspect -> String # - # source://prism//lib/prism/node.rb#3741 + # source://prism//lib/prism/node.rb#3699 sig { override.returns(String) } def inspect; end # attr_reader locals: Array[Symbol] # - # source://prism//lib/prism/node.rb#3684 + # source://prism//lib/prism/node.rb#3642 sig { returns(T::Array[Symbol]) } def locals; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#3723 + # source://prism//lib/prism/node.rb#3681 sig { returns(Symbol) } def name; end # attr_reader superclass: Prism::node? # - # source://prism//lib/prism/node.rb#3710 + # source://prism//lib/prism/node.rb#3668 sig { returns(T.nilable(Prism::Node)) } def superclass; end @@ -4704,7 +4710,7 @@ class Prism::ClassNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#3759 + # source://prism//lib/prism/node.rb#3717 sig { override.returns(Symbol) } def type; end @@ -4716,7 +4722,7 @@ class Prism::ClassNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#3769 + # source://prism//lib/prism/node.rb#3727 def type; end end end @@ -4726,13 +4732,13 @@ end # @@target &&= value # ^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#3794 +# source://prism//lib/prism/node.rb#3751 class Prism::ClassVariableAndWriteNode < ::Prism::Node # def initialize: (Symbol name, Location name_loc, Location operator_loc, Prism::node value, Location location) -> void # # @return [ClassVariableAndWriteNode] a new instance of ClassVariableAndWriteNode # - # source://prism//lib/prism/node.rb#3795 + # source://prism//lib/prism/node.rb#3753 sig do params( source: Prism::Source, @@ -4748,36 +4754,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#3898 + # source://prism//lib/prism/node.rb#3855 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3806 + # source://prism//lib/prism/node.rb#3763 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#3811 + # source://prism//lib/prism/node.rb#3768 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#3821 + # source://prism//lib/prism/node.rb#3778 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#3816 + # source://prism//lib/prism/node.rb#3773 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> ClassVariableAndWriteNode # - # source://prism//lib/prism/node.rb#3826 + # source://prism//lib/prism/node.rb#3783 sig do params( name: Symbol, @@ -4792,13 +4798,13 @@ class Prism::ClassVariableAndWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3811 + # source://prism//lib/prism/node.rb#3768 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#3834 + # source://prism//lib/prism/node.rb#3791 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -4810,31 +4816,31 @@ class Prism::ClassVariableAndWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#3864 + # source://prism//lib/prism/node.rb#3821 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#3839 + # source://prism//lib/prism/node.rb#3796 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#3842 + # source://prism//lib/prism/node.rb#3799 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#3859 + # source://prism//lib/prism/node.rb#3816 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#3849 + # source://prism//lib/prism/node.rb#3806 sig { returns(Prism::Location) } def operator_loc; end @@ -4853,13 +4859,13 @@ class Prism::ClassVariableAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#3882 + # source://prism//lib/prism/node.rb#3839 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#3856 + # source://prism//lib/prism/node.rb#3813 sig { returns(Prism::Node) } def value; end @@ -4871,7 +4877,7 @@ class Prism::ClassVariableAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#3892 + # source://prism//lib/prism/node.rb#3849 def type; end end end @@ -4881,13 +4887,13 @@ end # @@target += value # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#3912 +# source://prism//lib/prism/node.rb#3868 class Prism::ClassVariableOperatorWriteNode < ::Prism::Node # def initialize: (Symbol name, Location name_loc, Location binary_operator_loc, Prism::node value, Symbol binary_operator, Location location) -> void # # @return [ClassVariableOperatorWriteNode] a new instance of ClassVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#3913 + # source://prism//lib/prism/node.rb#3870 sig do params( source: Prism::Source, @@ -4904,48 +4910,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#4015 + # source://prism//lib/prism/node.rb#3971 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3925 + # source://prism//lib/prism/node.rb#3881 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader binary_operator: Symbol # - # source://prism//lib/prism/node.rb#3978 + # source://prism//lib/prism/node.rb#3934 sig { returns(Symbol) } def binary_operator; end # attr_reader binary_operator_loc: Location # - # source://prism//lib/prism/node.rb#3968 + # source://prism//lib/prism/node.rb#3924 sig { returns(Prism::Location) } def binary_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3930 + # source://prism//lib/prism/node.rb#3886 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#3940 + # source://prism//lib/prism/node.rb#3896 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#3935 + # source://prism//lib/prism/node.rb#3891 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol, ?location: Location) -> ClassVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#3945 + # source://prism//lib/prism/node.rb#3901 sig do params( name: Symbol, @@ -4961,13 +4967,13 @@ class Prism::ClassVariableOperatorWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3930 + # source://prism//lib/prism/node.rb#3886 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#3953 + # source://prism//lib/prism/node.rb#3909 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -4979,32 +4985,32 @@ class Prism::ClassVariableOperatorWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#3981 + # source://prism//lib/prism/node.rb#3937 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#3958 + # source://prism//lib/prism/node.rb#3914 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#3961 + # source://prism//lib/prism/node.rb#3917 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#323 + # 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#330 + # source://prism//lib/prism/node_ext.rb#346 def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -5022,13 +5028,13 @@ class Prism::ClassVariableOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#3999 + # source://prism//lib/prism/node.rb#3955 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#3975 + # source://prism//lib/prism/node.rb#3931 sig { returns(Prism::Node) } def value; end @@ -5040,7 +5046,7 @@ class Prism::ClassVariableOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#4009 + # source://prism//lib/prism/node.rb#3965 def type; end end end @@ -5050,13 +5056,13 @@ end # @@target ||= value # ^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#4030 +# source://prism//lib/prism/node.rb#3985 class Prism::ClassVariableOrWriteNode < ::Prism::Node # def initialize: (Symbol name, Location name_loc, Location operator_loc, Prism::node value, Location location) -> void # # @return [ClassVariableOrWriteNode] a new instance of ClassVariableOrWriteNode # - # source://prism//lib/prism/node.rb#4031 + # source://prism//lib/prism/node.rb#3987 sig do params( source: Prism::Source, @@ -5072,36 +5078,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#4134 + # source://prism//lib/prism/node.rb#4089 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4042 + # source://prism//lib/prism/node.rb#3997 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#4047 + # source://prism//lib/prism/node.rb#4002 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#4057 + # source://prism//lib/prism/node.rb#4012 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#4052 + # source://prism//lib/prism/node.rb#4007 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> ClassVariableOrWriteNode # - # source://prism//lib/prism/node.rb#4062 + # source://prism//lib/prism/node.rb#4017 sig do params( name: Symbol, @@ -5116,13 +5122,13 @@ class Prism::ClassVariableOrWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4047 + # source://prism//lib/prism/node.rb#4002 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#4070 + # source://prism//lib/prism/node.rb#4025 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -5134,31 +5140,31 @@ class Prism::ClassVariableOrWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#4100 + # source://prism//lib/prism/node.rb#4055 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#4075 + # source://prism//lib/prism/node.rb#4030 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#4078 + # source://prism//lib/prism/node.rb#4033 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#4095 + # source://prism//lib/prism/node.rb#4050 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#4085 + # source://prism//lib/prism/node.rb#4040 sig { returns(Prism::Location) } def operator_loc; end @@ -5177,13 +5183,13 @@ class Prism::ClassVariableOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#4118 + # source://prism//lib/prism/node.rb#4073 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#4092 + # source://prism//lib/prism/node.rb#4047 sig { returns(Prism::Node) } def value; end @@ -5195,7 +5201,7 @@ class Prism::ClassVariableOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#4128 + # source://prism//lib/prism/node.rb#4083 def type; end end end @@ -5205,177 +5211,177 @@ end # @@foo # ^^^^^ # -# source://prism//lib/prism/node.rb#4148 +# source://prism//lib/prism/node.rb#4102 class Prism::ClassVariableReadNode < ::Prism::Node # def initialize: (Symbol name, Location location) -> void # # @return [ClassVariableReadNode] a new instance of ClassVariableReadNode # - # source://prism//lib/prism/node.rb#4149 + # source://prism//lib/prism/node.rb#4104 sig { params(source: Prism::Source, name: Symbol, location: Prism::Location).void } def initialize(source, name, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#4231 - def ===(other); end - - # def accept: (Visitor visitor) -> void - # - # source://prism//lib/prism/node.rb#4157 - sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } - def accept(visitor); end - - # def child_nodes: () -> Array[nil | Node] - # - # source://prism//lib/prism/node.rb#4162 - sig { override.returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end - - # def comment_targets: () -> Array[Node | Location] - # - # source://prism//lib/prism/node.rb#4172 - sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } - def comment_targets; end - - # def compact_child_nodes: () -> Array[Node] - # - # source://prism//lib/prism/node.rb#4167 - sig { override.returns(T::Array[Prism::Node]) } - def compact_child_nodes; end - - # def copy: (?name: Symbol, ?location: Location) -> ClassVariableReadNode - # - # source://prism//lib/prism/node.rb#4177 - sig { params(name: Symbol, location: Prism::Location).returns(Prism::ClassVariableReadNode) } - def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end - - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] - # - # source://prism//lib/prism/node.rb#4162 - sig { override.returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end - - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } - # # source://prism//lib/prism/node.rb#4185 - sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } - def deconstruct_keys(keys); end - - sig { override.returns(T::Array[Prism::Reflection::Field]) } - def fields; end - - # def inspect -> String - # - # source://prism//lib/prism/node.rb#4197 - sig { override.returns(String) } - def inspect; end - - # The name of the class variable, which is a `@@` followed by an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifiers). - # - # @@abc # name `:@@abc` - # - # @@_test # name `:@@_test` - # - # source://prism//lib/prism/node.rb#4194 - sig { returns(Symbol) } - def name; end - - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. - # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. - # - # def type: () -> Symbol - # - # source://prism//lib/prism/node.rb#4215 - sig { override.returns(Symbol) } - def type; end - - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#4225 - def type; end - end -end - -# Represents writing to a class variable in a context that doesn't have an explicit value. -# -# @@foo, @@bar = baz -# ^^^^^ ^^^^^ -# -# source://prism//lib/prism/node.rb#4242 -class Prism::ClassVariableTargetNode < ::Prism::Node - # def initialize: (Symbol name, Location location) -> void - # - # @return [ClassVariableTargetNode] a new instance of ClassVariableTargetNode - # - # source://prism//lib/prism/node.rb#4243 - sig { params(source: Prism::Source, name: Symbol, location: Prism::Location).void } - def initialize(source, name, location); end - - # Implements case-equality for the node. This is effectively == but without - # comparing the value of locations. Locations are checked only for presence. - # - # source://prism//lib/prism/node.rb#4321 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4251 + # source://prism//lib/prism/node.rb#4111 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#4256 + # source://prism//lib/prism/node.rb#4116 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#4266 + # source://prism//lib/prism/node.rb#4126 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#4261 + # source://prism//lib/prism/node.rb#4121 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end + + # def copy: (?name: Symbol, ?location: Location) -> ClassVariableReadNode + # + # source://prism//lib/prism/node.rb#4131 + sig { params(name: Symbol, location: Prism::Location).returns(Prism::ClassVariableReadNode) } + def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#4116 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } + # + # source://prism//lib/prism/node.rb#4139 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } + def deconstruct_keys(keys); end + + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String + # + # source://prism//lib/prism/node.rb#4151 + sig { override.returns(String) } + def inspect; end + + # The name of the class variable, which is a `@@` followed by an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifiers). + # + # @@abc # name `:@@abc` + # + # @@_test # name `:@@_test` + # + # source://prism//lib/prism/node.rb#4148 + sig { returns(Symbol) } + def name; end + + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. + # + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. + # + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#4169 + sig { override.returns(Symbol) } + def type; end + + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#4179 + def type; end + end +end + +# Represents writing to a class variable in a context that doesn't have an explicit value. +# +# @@foo, @@bar = baz +# ^^^^^ ^^^^^ +# +# source://prism//lib/prism/node.rb#4195 +class Prism::ClassVariableTargetNode < ::Prism::Node + # def initialize: (Symbol name, Location location) -> void + # + # @return [ClassVariableTargetNode] a new instance of ClassVariableTargetNode + # + # source://prism//lib/prism/node.rb#4197 + sig { params(source: Prism::Source, name: Symbol, location: Prism::Location).void } + def initialize(source, name, location); end + + # Implements case-equality for the node. This is effectively == but without + # comparing the value of locations. Locations are checked only for presence. + # + # source://prism//lib/prism/node.rb#4274 + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#4204 + 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#4209 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end + + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#4219 + sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } + def comment_targets; end + + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#4214 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?location: Location) -> ClassVariableTargetNode # - # source://prism//lib/prism/node.rb#4271 + # source://prism//lib/prism/node.rb#4224 sig { params(name: Symbol, location: Prism::Location).returns(Prism::ClassVariableTargetNode) } def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4256 + # source://prism//lib/prism/node.rb#4209 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#4279 + # source://prism//lib/prism/node.rb#4232 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -5384,13 +5390,13 @@ class Prism::ClassVariableTargetNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#4287 + # source://prism//lib/prism/node.rb#4240 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#4284 + # source://prism//lib/prism/node.rb#4237 sig { returns(Symbol) } def name; end @@ -5409,7 +5415,7 @@ class Prism::ClassVariableTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#4305 + # source://prism//lib/prism/node.rb#4258 sig { override.returns(Symbol) } def type; end @@ -5421,7 +5427,7 @@ class Prism::ClassVariableTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#4315 + # source://prism//lib/prism/node.rb#4268 def type; end end end @@ -5431,13 +5437,13 @@ end # @@foo = 1 # ^^^^^^^^^ # -# source://prism//lib/prism/node.rb#4332 +# source://prism//lib/prism/node.rb#4284 class Prism::ClassVariableWriteNode < ::Prism::Node # def initialize: (Symbol name, Location name_loc, Prism::node value, Location operator_loc, Location location) -> void # # @return [ClassVariableWriteNode] a new instance of ClassVariableWriteNode # - # source://prism//lib/prism/node.rb#4333 + # source://prism//lib/prism/node.rb#4286 sig do params( source: Prism::Source, @@ -5453,36 +5459,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#4452 + # source://prism//lib/prism/node.rb#4404 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4344 + # source://prism//lib/prism/node.rb#4296 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#4349 + # source://prism//lib/prism/node.rb#4301 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#4359 + # source://prism//lib/prism/node.rb#4311 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#4354 + # source://prism//lib/prism/node.rb#4306 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location, ?location: Location) -> ClassVariableWriteNode # - # source://prism//lib/prism/node.rb#4364 + # source://prism//lib/prism/node.rb#4316 sig do params( name: Symbol, @@ -5497,13 +5503,13 @@ class Prism::ClassVariableWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4349 + # source://prism//lib/prism/node.rb#4301 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#4372 + # source://prism//lib/prism/node.rb#4324 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -5512,7 +5518,7 @@ class Prism::ClassVariableWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#4418 + # source://prism//lib/prism/node.rb#4370 sig { override.returns(String) } def inspect; end @@ -5522,7 +5528,7 @@ class Prism::ClassVariableWriteNode < ::Prism::Node # # @@_test = :test # name `@@_test` # - # source://prism//lib/prism/node.rb#4381 + # source://prism//lib/prism/node.rb#4333 sig { returns(Symbol) } def name; end @@ -5531,13 +5537,13 @@ class Prism::ClassVariableWriteNode < ::Prism::Node # @@foo = :bar # ^^^^^ # - # source://prism//lib/prism/node.rb#4387 + # source://prism//lib/prism/node.rb#4339 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#4413 + # source://prism//lib/prism/node.rb#4365 sig { returns(String) } def operator; end @@ -5546,7 +5552,7 @@ class Prism::ClassVariableWriteNode < ::Prism::Node # @@foo = :bar # ^ # - # source://prism//lib/prism/node.rb#4406 + # source://prism//lib/prism/node.rb#4358 sig { returns(Prism::Location) } def operator_loc; end @@ -5565,7 +5571,7 @@ class Prism::ClassVariableWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#4436 + # source://prism//lib/prism/node.rb#4388 sig { override.returns(Symbol) } def type; end @@ -5577,7 +5583,7 @@ class Prism::ClassVariableWriteNode < ::Prism::Node # @@_xyz = 123 # ^^^ # - # source://prism//lib/prism/node.rb#4400 + # source://prism//lib/prism/node.rb#4352 sig { returns(Prism::Node) } def value; end @@ -5589,7 +5595,7 @@ class Prism::ClassVariableWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#4446 + # source://prism//lib/prism/node.rb#4398 def type; end end end @@ -5648,7 +5654,7 @@ end # Prism.parse("1 + 2").value.accept(SExpressions.new) # # => [:program, [[[:call, [[:integer], [:arguments, [[:integer]]]]]]]] # -# source://prism//lib/prism/compiler.rb#28 +# source://prism//lib/prism/compiler.rb#27 class Prism::Compiler < ::Prism::Visitor # Visit an individual node. # @@ -6190,6 +6196,12 @@ class Prism::Compiler < ::Prism::Visitor # 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 + def visit_it_local_variable_read_node(node); end + # Visit the child nodes of the given node. # Compile a ItParametersNode node # @@ -6574,13 +6586,13 @@ end # Target &&= value # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#4466 +# source://prism//lib/prism/node.rb#4417 class Prism::ConstantAndWriteNode < ::Prism::Node # def initialize: (Symbol name, Location name_loc, Location operator_loc, Prism::node value, Location location) -> void # # @return [ConstantAndWriteNode] a new instance of ConstantAndWriteNode # - # source://prism//lib/prism/node.rb#4467 + # source://prism//lib/prism/node.rb#4419 sig do params( source: Prism::Source, @@ -6596,36 +6608,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#4570 + # source://prism//lib/prism/node.rb#4521 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4478 + # source://prism//lib/prism/node.rb#4429 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#4483 + # source://prism//lib/prism/node.rb#4434 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#4493 + # source://prism//lib/prism/node.rb#4444 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#4488 + # source://prism//lib/prism/node.rb#4439 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> ConstantAndWriteNode # - # source://prism//lib/prism/node.rb#4498 + # source://prism//lib/prism/node.rb#4449 sig do params( name: Symbol, @@ -6640,13 +6652,13 @@ class Prism::ConstantAndWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4483 + # source://prism//lib/prism/node.rb#4434 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#4506 + # source://prism//lib/prism/node.rb#4457 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -6658,31 +6670,31 @@ class Prism::ConstantAndWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#4536 + # source://prism//lib/prism/node.rb#4487 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#4511 + # source://prism//lib/prism/node.rb#4462 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#4514 + # source://prism//lib/prism/node.rb#4465 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#4531 + # source://prism//lib/prism/node.rb#4482 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#4521 + # source://prism//lib/prism/node.rb#4472 sig { returns(Prism::Location) } def operator_loc; end @@ -6701,13 +6713,13 @@ class Prism::ConstantAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#4554 + # source://prism//lib/prism/node.rb#4505 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#4528 + # source://prism//lib/prism/node.rb#4479 sig { returns(Prism::Node) } def value; end @@ -6719,7 +6731,7 @@ class Prism::ConstantAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#4564 + # source://prism//lib/prism/node.rb#4515 def type; end end end @@ -6729,13 +6741,13 @@ end # Target += value # ^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#4584 +# source://prism//lib/prism/node.rb#4534 class Prism::ConstantOperatorWriteNode < ::Prism::Node # def initialize: (Symbol name, Location name_loc, Location binary_operator_loc, Prism::node value, Symbol binary_operator, Location location) -> void # # @return [ConstantOperatorWriteNode] a new instance of ConstantOperatorWriteNode # - # source://prism//lib/prism/node.rb#4585 + # source://prism//lib/prism/node.rb#4536 sig do params( source: Prism::Source, @@ -6752,48 +6764,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#4687 + # source://prism//lib/prism/node.rb#4637 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4597 + # source://prism//lib/prism/node.rb#4547 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader binary_operator: Symbol # - # source://prism//lib/prism/node.rb#4650 + # source://prism//lib/prism/node.rb#4600 sig { returns(Symbol) } def binary_operator; end # attr_reader binary_operator_loc: Location # - # source://prism//lib/prism/node.rb#4640 + # source://prism//lib/prism/node.rb#4590 sig { returns(Prism::Location) } def binary_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4602 + # source://prism//lib/prism/node.rb#4552 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#4612 + # source://prism//lib/prism/node.rb#4562 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#4607 + # source://prism//lib/prism/node.rb#4557 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol, ?location: Location) -> ConstantOperatorWriteNode # - # source://prism//lib/prism/node.rb#4617 + # source://prism//lib/prism/node.rb#4567 sig do params( name: Symbol, @@ -6809,13 +6821,13 @@ class Prism::ConstantOperatorWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4602 + # source://prism//lib/prism/node.rb#4552 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#4625 + # source://prism//lib/prism/node.rb#4575 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -6827,32 +6839,32 @@ class Prism::ConstantOperatorWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#4653 + # source://prism//lib/prism/node.rb#4603 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#4630 + # source://prism//lib/prism/node.rb#4580 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#4633 + # source://prism//lib/prism/node.rb#4583 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#339 + # 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#346 + # source://prism//lib/prism/node_ext.rb#362 def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -6870,13 +6882,13 @@ class Prism::ConstantOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#4671 + # source://prism//lib/prism/node.rb#4621 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#4647 + # source://prism//lib/prism/node.rb#4597 sig { returns(Prism::Node) } def value; end @@ -6888,7 +6900,7 @@ class Prism::ConstantOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#4681 + # source://prism//lib/prism/node.rb#4631 def type; end end end @@ -6898,13 +6910,13 @@ end # Target ||= value # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#4702 +# source://prism//lib/prism/node.rb#4651 class Prism::ConstantOrWriteNode < ::Prism::Node # def initialize: (Symbol name, Location name_loc, Location operator_loc, Prism::node value, Location location) -> void # # @return [ConstantOrWriteNode] a new instance of ConstantOrWriteNode # - # source://prism//lib/prism/node.rb#4703 + # source://prism//lib/prism/node.rb#4653 sig do params( source: Prism::Source, @@ -6920,36 +6932,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#4806 + # source://prism//lib/prism/node.rb#4755 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4714 + # source://prism//lib/prism/node.rb#4663 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#4719 + # source://prism//lib/prism/node.rb#4668 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#4729 + # source://prism//lib/prism/node.rb#4678 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#4724 + # source://prism//lib/prism/node.rb#4673 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> ConstantOrWriteNode # - # source://prism//lib/prism/node.rb#4734 + # source://prism//lib/prism/node.rb#4683 sig do params( name: Symbol, @@ -6964,13 +6976,13 @@ class Prism::ConstantOrWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4719 + # source://prism//lib/prism/node.rb#4668 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#4742 + # source://prism//lib/prism/node.rb#4691 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -6982,31 +6994,31 @@ class Prism::ConstantOrWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#4772 + # source://prism//lib/prism/node.rb#4721 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#4747 + # source://prism//lib/prism/node.rb#4696 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#4750 + # source://prism//lib/prism/node.rb#4699 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#4767 + # source://prism//lib/prism/node.rb#4716 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#4757 + # source://prism//lib/prism/node.rb#4706 sig { returns(Prism::Location) } def operator_loc; end @@ -7025,13 +7037,13 @@ class Prism::ConstantOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#4790 + # source://prism//lib/prism/node.rb#4739 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#4764 + # source://prism//lib/prism/node.rb#4713 sig { returns(Prism::Node) } def value; end @@ -7043,7 +7055,7 @@ class Prism::ConstantOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#4800 + # source://prism//lib/prism/node.rb#4749 def type; end end end @@ -7053,13 +7065,13 @@ end # Parent::Child &&= value # ^^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#4820 +# source://prism//lib/prism/node.rb#4768 class Prism::ConstantPathAndWriteNode < ::Prism::Node # def initialize: (ConstantPathNode target, Location operator_loc, Prism::node value, Location location) -> void # # @return [ConstantPathAndWriteNode] a new instance of ConstantPathAndWriteNode # - # source://prism//lib/prism/node.rb#4821 + # source://prism//lib/prism/node.rb#4770 sig do params( source: Prism::Source, @@ -7074,36 +7086,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#4916 + # source://prism//lib/prism/node.rb#4864 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4831 + # source://prism//lib/prism/node.rb#4779 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#4836 + # source://prism//lib/prism/node.rb#4784 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#4846 + # source://prism//lib/prism/node.rb#4794 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#4841 + # source://prism//lib/prism/node.rb#4789 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?target: ConstantPathNode, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> ConstantPathAndWriteNode # - # source://prism//lib/prism/node.rb#4851 + # source://prism//lib/prism/node.rb#4799 sig do params( target: Prism::ConstantPathNode, @@ -7117,13 +7129,13 @@ class Prism::ConstantPathAndWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4836 + # source://prism//lib/prism/node.rb#4784 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { target: ConstantPathNode, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#4859 + # source://prism//lib/prism/node.rb#4807 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -7132,25 +7144,25 @@ class Prism::ConstantPathAndWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#4882 + # source://prism//lib/prism/node.rb#4830 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#4877 + # source://prism//lib/prism/node.rb#4825 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#4867 + # source://prism//lib/prism/node.rb#4815 sig { returns(Prism::Location) } def operator_loc; end # attr_reader target: ConstantPathNode # - # source://prism//lib/prism/node.rb#4864 + # source://prism//lib/prism/node.rb#4812 sig { returns(Prism::ConstantPathNode) } def target; end @@ -7169,13 +7181,13 @@ class Prism::ConstantPathAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#4900 + # source://prism//lib/prism/node.rb#4848 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#4874 + # source://prism//lib/prism/node.rb#4822 sig { returns(Prism::Node) } def value; end @@ -7187,7 +7199,7 @@ class Prism::ConstantPathAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#4910 + # source://prism//lib/prism/node.rb#4858 def type; end end end @@ -7197,13 +7209,13 @@ end # Foo::Bar # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#4929 +# source://prism//lib/prism/node.rb#4876 class Prism::ConstantPathNode < ::Prism::Node # def initialize: (Prism::node? parent, Symbol? name, Location delimiter_loc, Location name_loc, Location location) -> void # # @return [ConstantPathNode] a new instance of ConstantPathNode # - # source://prism//lib/prism/node.rb#4930 + # source://prism//lib/prism/node.rb#4878 sig do params( source: Prism::Source, @@ -7219,12 +7231,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#5056 + # source://prism//lib/prism/node.rb#5003 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4941 + # source://prism//lib/prism/node.rb#4888 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -7232,30 +7244,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#181 + # source://prism//lib/prism/node_ext.rb#196 def child; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4946 + # source://prism//lib/prism/node.rb#4893 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#4958 + # source://prism//lib/prism/node.rb#4905 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#4951 + # source://prism//lib/prism/node.rb#4898 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?parent: Prism::node?, ?name: Symbol?, ?delimiter_loc: Location, ?name_loc: Location, ?location: Location) -> ConstantPathNode # - # source://prism//lib/prism/node.rb#4963 + # source://prism//lib/prism/node.rb#4910 sig do params( parent: T.nilable(Prism::Node), @@ -7270,19 +7282,19 @@ class Prism::ConstantPathNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4946 + # source://prism//lib/prism/node.rb#4893 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { parent: Prism::node?, name: Symbol?, delimiter_loc: Location, name_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#4971 + # source://prism//lib/prism/node.rb#4918 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#5017 + # source://prism//lib/prism/node.rb#4964 sig { returns(String) } def delimiter; end @@ -7294,7 +7306,7 @@ class Prism::ConstantPathNode < ::Prism::Node # One::Two # ^^ # - # source://prism//lib/prism/node.rb#4997 + # source://prism//lib/prism/node.rb#4944 sig { returns(Prism::Location) } def delimiter_loc; end @@ -7303,26 +7315,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#174 + # source://prism//lib/prism/node_ext.rb#189 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#152 + # source://prism//lib/prism/node_ext.rb#167 sig { returns(T::Array[Symbol]) } def full_name_parts; end # def inspect -> String # - # source://prism//lib/prism/node.rb#5022 + # source://prism//lib/prism/node.rb#4969 sig { override.returns(String) } def inspect; end # The name of the constant being accessed. This could be `nil` in the event of a syntax error. # - # source://prism//lib/prism/node.rb#4988 + # source://prism//lib/prism/node.rb#4935 sig { returns(T.nilable(Symbol)) } def name; end @@ -7334,7 +7346,7 @@ class Prism::ConstantPathNode < ::Prism::Node # One::Two # ^^^ # - # source://prism//lib/prism/node.rb#5010 + # source://prism//lib/prism/node.rb#4957 sig { returns(Prism::Location) } def name_loc; end @@ -7349,7 +7361,7 @@ class Prism::ConstantPathNode < ::Prism::Node # a.b::C # ^^^ # - # source://prism//lib/prism/node.rb#4985 + # source://prism//lib/prism/node.rb#4932 sig { returns(T.nilable(Prism::Node)) } def parent; end @@ -7368,7 +7380,7 @@ class Prism::ConstantPathNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#5040 + # source://prism//lib/prism/node.rb#4987 sig { override.returns(Symbol) } def type; end @@ -7380,7 +7392,7 @@ class Prism::ConstantPathNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#5050 + # source://prism//lib/prism/node.rb#4997 def type; end end end @@ -7392,14 +7404,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#143 +# source://prism//lib/prism/node_ext.rb#158 class Prism::ConstantPathNode::DynamicPartsInConstantPathError < ::StandardError; end # An error class raised when missing nodes are found while computing a # constant path's full name. For example: # Foo:: -> raises because the constant path is missing the last part # -# source://prism//lib/prism/node_ext.rb#148 +# source://prism//lib/prism/node_ext.rb#163 class Prism::ConstantPathNode::MissingNodesInConstantPathError < ::StandardError; end # Represents assigning to a constant path using an operator that isn't `=`. @@ -7407,13 +7419,13 @@ class Prism::ConstantPathNode::MissingNodesInConstantPathError < ::StandardError # Parent::Child += value # ^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#5070 +# source://prism//lib/prism/node.rb#5016 class Prism::ConstantPathOperatorWriteNode < ::Prism::Node # def initialize: (ConstantPathNode target, Location binary_operator_loc, Prism::node value, Symbol binary_operator, Location location) -> void # # @return [ConstantPathOperatorWriteNode] a new instance of ConstantPathOperatorWriteNode # - # source://prism//lib/prism/node.rb#5071 + # source://prism//lib/prism/node.rb#5018 sig do params( source: Prism::Source, @@ -7429,48 +7441,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#5165 + # source://prism//lib/prism/node.rb#5111 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5082 + # source://prism//lib/prism/node.rb#5028 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader binary_operator: Symbol # - # source://prism//lib/prism/node.rb#5128 + # source://prism//lib/prism/node.rb#5074 sig { returns(Symbol) } def binary_operator; end # attr_reader binary_operator_loc: Location # - # source://prism//lib/prism/node.rb#5118 + # source://prism//lib/prism/node.rb#5064 sig { returns(Prism::Location) } def binary_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5087 + # source://prism//lib/prism/node.rb#5033 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#5097 + # source://prism//lib/prism/node.rb#5043 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#5092 + # source://prism//lib/prism/node.rb#5038 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?target: ConstantPathNode, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol, ?location: Location) -> ConstantPathOperatorWriteNode # - # source://prism//lib/prism/node.rb#5102 + # source://prism//lib/prism/node.rb#5048 sig do params( target: Prism::ConstantPathNode, @@ -7485,13 +7497,13 @@ class Prism::ConstantPathOperatorWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5087 + # source://prism//lib/prism/node.rb#5033 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { target: ConstantPathNode, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#5110 + # source://prism//lib/prism/node.rb#5056 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -7500,25 +7512,25 @@ class Prism::ConstantPathOperatorWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#5131 + # source://prism//lib/prism/node.rb#5077 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#355 + # 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#362 + # source://prism//lib/prism/node_ext.rb#378 def operator_loc; end # attr_reader target: ConstantPathNode # - # source://prism//lib/prism/node.rb#5115 + # source://prism//lib/prism/node.rb#5061 sig { returns(Prism::ConstantPathNode) } def target; end @@ -7537,13 +7549,13 @@ class Prism::ConstantPathOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#5149 + # source://prism//lib/prism/node.rb#5095 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#5125 + # source://prism//lib/prism/node.rb#5071 sig { returns(Prism::Node) } def value; end @@ -7555,7 +7567,7 @@ class Prism::ConstantPathOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#5159 + # source://prism//lib/prism/node.rb#5105 def type; end end end @@ -7565,13 +7577,13 @@ end # Parent::Child ||= value # ^^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#5179 +# source://prism//lib/prism/node.rb#5124 class Prism::ConstantPathOrWriteNode < ::Prism::Node # def initialize: (ConstantPathNode target, Location operator_loc, Prism::node value, Location location) -> void # # @return [ConstantPathOrWriteNode] a new instance of ConstantPathOrWriteNode # - # source://prism//lib/prism/node.rb#5180 + # source://prism//lib/prism/node.rb#5126 sig do params( source: Prism::Source, @@ -7586,36 +7598,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#5275 + # source://prism//lib/prism/node.rb#5220 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5190 + # source://prism//lib/prism/node.rb#5135 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#5195 + # source://prism//lib/prism/node.rb#5140 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#5205 + # source://prism//lib/prism/node.rb#5150 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#5200 + # source://prism//lib/prism/node.rb#5145 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?target: ConstantPathNode, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> ConstantPathOrWriteNode # - # source://prism//lib/prism/node.rb#5210 + # source://prism//lib/prism/node.rb#5155 sig do params( target: Prism::ConstantPathNode, @@ -7629,13 +7641,13 @@ class Prism::ConstantPathOrWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5195 + # source://prism//lib/prism/node.rb#5140 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { target: ConstantPathNode, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#5218 + # source://prism//lib/prism/node.rb#5163 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -7644,25 +7656,25 @@ class Prism::ConstantPathOrWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#5241 + # source://prism//lib/prism/node.rb#5186 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#5236 + # source://prism//lib/prism/node.rb#5181 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#5226 + # source://prism//lib/prism/node.rb#5171 sig { returns(Prism::Location) } def operator_loc; end # attr_reader target: ConstantPathNode # - # source://prism//lib/prism/node.rb#5223 + # source://prism//lib/prism/node.rb#5168 sig { returns(Prism::ConstantPathNode) } def target; end @@ -7681,13 +7693,13 @@ class Prism::ConstantPathOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#5259 + # source://prism//lib/prism/node.rb#5204 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#5233 + # source://prism//lib/prism/node.rb#5178 sig { returns(Prism::Node) } def value; end @@ -7699,7 +7711,7 @@ class Prism::ConstantPathOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#5269 + # source://prism//lib/prism/node.rb#5214 def type; end end end @@ -7709,13 +7721,13 @@ end # Foo::Foo, Bar::Bar = baz # ^^^^^^^^ ^^^^^^^^ # -# source://prism//lib/prism/node.rb#5288 +# source://prism//lib/prism/node.rb#5232 class Prism::ConstantPathTargetNode < ::Prism::Node # def initialize: (Prism::node? parent, Symbol? name, Location delimiter_loc, Location name_loc, Location location) -> void # # @return [ConstantPathTargetNode] a new instance of ConstantPathTargetNode # - # source://prism//lib/prism/node.rb#5289 + # source://prism//lib/prism/node.rb#5234 sig do params( source: Prism::Source, @@ -7731,12 +7743,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#5394 + # source://prism//lib/prism/node.rb#5338 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5300 + # source://prism//lib/prism/node.rb#5244 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -7744,30 +7756,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#217 + # source://prism//lib/prism/node_ext.rb#232 def child; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5305 + # source://prism//lib/prism/node.rb#5249 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#5317 + # source://prism//lib/prism/node.rb#5261 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#5310 + # source://prism//lib/prism/node.rb#5254 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?parent: Prism::node?, ?name: Symbol?, ?delimiter_loc: Location, ?name_loc: Location, ?location: Location) -> ConstantPathTargetNode # - # source://prism//lib/prism/node.rb#5322 + # source://prism//lib/prism/node.rb#5266 sig do params( parent: T.nilable(Prism::Node), @@ -7782,25 +7794,25 @@ class Prism::ConstantPathTargetNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5305 + # source://prism//lib/prism/node.rb#5249 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { parent: Prism::node?, name: Symbol?, delimiter_loc: Location, name_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#5330 + # source://prism//lib/prism/node.rb#5274 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#5355 + # source://prism//lib/prism/node.rb#5299 sig { returns(String) } def delimiter; end # attr_reader delimiter_loc: Location # - # source://prism//lib/prism/node.rb#5341 + # source://prism//lib/prism/node.rb#5285 sig { returns(Prism::Location) } def delimiter_loc; end @@ -7809,38 +7821,38 @@ class Prism::ConstantPathTargetNode < ::Prism::Node # Returns the full name of this constant path. For example: "Foo::Bar" # - # source://prism//lib/prism/node_ext.rb#210 + # source://prism//lib/prism/node_ext.rb#225 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#190 + # source://prism//lib/prism/node_ext.rb#205 sig { returns(T::Array[Symbol]) } def full_name_parts; end # def inspect -> String # - # source://prism//lib/prism/node.rb#5360 + # source://prism//lib/prism/node.rb#5304 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol? # - # source://prism//lib/prism/node.rb#5338 + # source://prism//lib/prism/node.rb#5282 sig { returns(T.nilable(Symbol)) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#5348 + # source://prism//lib/prism/node.rb#5292 sig { returns(Prism::Location) } def name_loc; end # attr_reader parent: Prism::node? # - # source://prism//lib/prism/node.rb#5335 + # source://prism//lib/prism/node.rb#5279 sig { returns(T.nilable(Prism::Node)) } def parent; end @@ -7859,7 +7871,7 @@ class Prism::ConstantPathTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#5378 + # source://prism//lib/prism/node.rb#5322 sig { override.returns(Symbol) } def type; end @@ -7871,7 +7883,7 @@ class Prism::ConstantPathTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#5388 + # source://prism//lib/prism/node.rb#5332 def type; end end end @@ -7887,13 +7899,13 @@ end # ::Foo::Bar = 1 # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#5414 +# source://prism//lib/prism/node.rb#5357 class Prism::ConstantPathWriteNode < ::Prism::Node # def initialize: (ConstantPathNode target, Location operator_loc, Prism::node value, Location location) -> void # # @return [ConstantPathWriteNode] a new instance of ConstantPathWriteNode # - # source://prism//lib/prism/node.rb#5415 + # source://prism//lib/prism/node.rb#5359 sig do params( source: Prism::Source, @@ -7908,36 +7920,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#5522 + # source://prism//lib/prism/node.rb#5465 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5425 + # source://prism//lib/prism/node.rb#5368 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#5430 + # source://prism//lib/prism/node.rb#5373 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#5440 + # source://prism//lib/prism/node.rb#5383 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#5435 + # source://prism//lib/prism/node.rb#5378 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?target: ConstantPathNode, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> ConstantPathWriteNode # - # source://prism//lib/prism/node.rb#5445 + # source://prism//lib/prism/node.rb#5388 sig do params( target: Prism::ConstantPathNode, @@ -7951,13 +7963,13 @@ class Prism::ConstantPathWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5430 + # source://prism//lib/prism/node.rb#5373 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { target: ConstantPathNode, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#5453 + # source://prism//lib/prism/node.rb#5396 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -7966,13 +7978,13 @@ class Prism::ConstantPathWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#5488 + # source://prism//lib/prism/node.rb#5431 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#5483 + # source://prism//lib/prism/node.rb#5426 sig { returns(String) } def operator; end @@ -7981,7 +7993,7 @@ class Prism::ConstantPathWriteNode < ::Prism::Node # ::ABC = 123 # ^ # - # source://prism//lib/prism/node.rb#5470 + # source://prism//lib/prism/node.rb#5413 sig { returns(Prism::Location) } def operator_loc; end @@ -7993,7 +8005,7 @@ class Prism::ConstantPathWriteNode < ::Prism::Node # ::Foo = :abc # ^^^^^ # - # source://prism//lib/prism/node.rb#5464 + # source://prism//lib/prism/node.rb#5407 sig { returns(Prism::ConstantPathNode) } def target; end @@ -8012,7 +8024,7 @@ class Prism::ConstantPathWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#5506 + # source://prism//lib/prism/node.rb#5449 sig { override.returns(Symbol) } def type; end @@ -8021,7 +8033,7 @@ class Prism::ConstantPathWriteNode < ::Prism::Node # FOO::BAR = :abc # ^^^^ # - # source://prism//lib/prism/node.rb#5480 + # source://prism//lib/prism/node.rb#5423 sig { returns(Prism::Node) } def value; end @@ -8033,7 +8045,7 @@ class Prism::ConstantPathWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#5516 + # source://prism//lib/prism/node.rb#5459 def type; end end end @@ -8043,62 +8055,62 @@ end # Foo # ^^^ # -# source://prism//lib/prism/node.rb#5535 +# source://prism//lib/prism/node.rb#5477 class Prism::ConstantReadNode < ::Prism::Node # def initialize: (Symbol name, Location location) -> void # # @return [ConstantReadNode] a new instance of ConstantReadNode # - # source://prism//lib/prism/node.rb#5536 + # source://prism//lib/prism/node.rb#5479 sig { params(source: Prism::Source, name: Symbol, location: Prism::Location).void } def initialize(source, name, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#5618 + # source://prism//lib/prism/node.rb#5560 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5544 + # source://prism//lib/prism/node.rb#5486 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#5549 + # source://prism//lib/prism/node.rb#5491 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#5559 + # source://prism//lib/prism/node.rb#5501 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#5554 + # source://prism//lib/prism/node.rb#5496 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?location: Location) -> ConstantReadNode # - # source://prism//lib/prism/node.rb#5564 + # source://prism//lib/prism/node.rb#5506 sig { params(name: Symbol, location: Prism::Location).returns(Prism::ConstantReadNode) } def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5549 + # source://prism//lib/prism/node.rb#5491 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#5572 + # source://prism//lib/prism/node.rb#5514 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -8107,20 +8119,20 @@ class Prism::ConstantReadNode < ::Prism::Node # Returns the full name of this constant. For example: "Foo" # - # source://prism//lib/prism/node_ext.rb#118 + # source://prism//lib/prism/node_ext.rb#133 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#113 + # source://prism//lib/prism/node_ext.rb#128 sig { returns(T::Array[Symbol]) } def full_name_parts; end # def inspect -> String # - # source://prism//lib/prism/node.rb#5584 + # source://prism//lib/prism/node.rb#5526 sig { override.returns(String) } def inspect; end @@ -8130,7 +8142,7 @@ class Prism::ConstantReadNode < ::Prism::Node # # SOME_CONSTANT # name `:SOME_CONSTANT` # - # source://prism//lib/prism/node.rb#5581 + # source://prism//lib/prism/node.rb#5523 sig { returns(Symbol) } def name; end @@ -8149,7 +8161,7 @@ class Prism::ConstantReadNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#5602 + # source://prism//lib/prism/node.rb#5544 sig { override.returns(Symbol) } def type; end @@ -8161,7 +8173,7 @@ class Prism::ConstantReadNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#5612 + # source://prism//lib/prism/node.rb#5554 def type; end end end @@ -8171,62 +8183,62 @@ end # Foo, Bar = baz # ^^^ ^^^ # -# source://prism//lib/prism/node.rb#5629 +# source://prism//lib/prism/node.rb#5570 class Prism::ConstantTargetNode < ::Prism::Node # def initialize: (Symbol name, Location location) -> void # # @return [ConstantTargetNode] a new instance of ConstantTargetNode # - # source://prism//lib/prism/node.rb#5630 + # source://prism//lib/prism/node.rb#5572 sig { params(source: Prism::Source, name: Symbol, location: Prism::Location).void } def initialize(source, name, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#5708 + # source://prism//lib/prism/node.rb#5649 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5638 + # source://prism//lib/prism/node.rb#5579 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#5643 + # source://prism//lib/prism/node.rb#5584 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#5653 + # source://prism//lib/prism/node.rb#5594 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#5648 + # source://prism//lib/prism/node.rb#5589 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?location: Location) -> ConstantTargetNode # - # source://prism//lib/prism/node.rb#5658 + # source://prism//lib/prism/node.rb#5599 sig { params(name: Symbol, location: Prism::Location).returns(Prism::ConstantTargetNode) } def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5643 + # source://prism//lib/prism/node.rb#5584 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#5666 + # source://prism//lib/prism/node.rb#5607 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -8235,26 +8247,26 @@ class Prism::ConstantTargetNode < ::Prism::Node # Returns the full name of this constant. For example: "Foo" # - # source://prism//lib/prism/node_ext.rb#231 + # source://prism//lib/prism/node_ext.rb#246 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#226 + # source://prism//lib/prism/node_ext.rb#241 sig { returns(T::Array[Symbol]) } def full_name_parts; end # def inspect -> String # - # source://prism//lib/prism/node.rb#5674 + # source://prism//lib/prism/node.rb#5615 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#5671 + # source://prism//lib/prism/node.rb#5612 sig { returns(Symbol) } def name; end @@ -8273,7 +8285,7 @@ class Prism::ConstantTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#5692 + # source://prism//lib/prism/node.rb#5633 sig { override.returns(Symbol) } def type; end @@ -8285,7 +8297,7 @@ class Prism::ConstantTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#5702 + # source://prism//lib/prism/node.rb#5643 def type; end end end @@ -8295,13 +8307,13 @@ end # Foo = 1 # ^^^^^^^ # -# source://prism//lib/prism/node.rb#5719 +# source://prism//lib/prism/node.rb#5659 class Prism::ConstantWriteNode < ::Prism::Node # def initialize: (Symbol name, Location name_loc, Prism::node value, Location operator_loc, Location location) -> void # # @return [ConstantWriteNode] a new instance of ConstantWriteNode # - # source://prism//lib/prism/node.rb#5720 + # source://prism//lib/prism/node.rb#5661 sig do params( source: Prism::Source, @@ -8317,36 +8329,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#5839 + # source://prism//lib/prism/node.rb#5779 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5731 + # source://prism//lib/prism/node.rb#5671 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#5736 + # source://prism//lib/prism/node.rb#5676 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#5746 + # source://prism//lib/prism/node.rb#5686 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#5741 + # source://prism//lib/prism/node.rb#5681 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location, ?location: Location) -> ConstantWriteNode # - # source://prism//lib/prism/node.rb#5751 + # source://prism//lib/prism/node.rb#5691 sig do params( name: Symbol, @@ -8361,13 +8373,13 @@ class Prism::ConstantWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5736 + # source://prism//lib/prism/node.rb#5676 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#5759 + # source://prism//lib/prism/node.rb#5699 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -8376,20 +8388,20 @@ class Prism::ConstantWriteNode < ::Prism::Node # Returns the full name of this constant. For example: "Foo" # - # source://prism//lib/prism/node_ext.rb#131 + # source://prism//lib/prism/node_ext.rb#146 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#126 + # source://prism//lib/prism/node_ext.rb#141 sig { returns(T::Array[Symbol]) } def full_name_parts; end # def inspect -> String # - # source://prism//lib/prism/node.rb#5805 + # source://prism//lib/prism/node.rb#5745 sig { override.returns(String) } def inspect; end @@ -8399,7 +8411,7 @@ class Prism::ConstantWriteNode < ::Prism::Node # # XYZ = 1 # name `:XYZ` # - # source://prism//lib/prism/node.rb#5768 + # source://prism//lib/prism/node.rb#5708 sig { returns(Symbol) } def name; end @@ -8408,13 +8420,13 @@ class Prism::ConstantWriteNode < ::Prism::Node # FOO = 1 # ^^^ # - # source://prism//lib/prism/node.rb#5774 + # source://prism//lib/prism/node.rb#5714 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#5800 + # source://prism//lib/prism/node.rb#5740 sig { returns(String) } def operator; end @@ -8423,7 +8435,7 @@ class Prism::ConstantWriteNode < ::Prism::Node # FOO = :bar # ^ # - # source://prism//lib/prism/node.rb#5793 + # source://prism//lib/prism/node.rb#5733 sig { returns(Prism::Location) } def operator_loc; end @@ -8442,7 +8454,7 @@ class Prism::ConstantWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#5823 + # source://prism//lib/prism/node.rb#5763 sig { override.returns(Symbol) } def type; end @@ -8454,7 +8466,7 @@ class Prism::ConstantWriteNode < ::Prism::Node # MyClass = Class.new # ^^^^^^^^^ # - # source://prism//lib/prism/node.rb#5787 + # source://prism//lib/prism/node.rb#5727 sig { returns(Prism::Node) } def value; end @@ -8466,7 +8478,7 @@ class Prism::ConstantWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#5833 + # source://prism//lib/prism/node.rb#5773 def type; end end end @@ -8943,54 +8955,59 @@ module Prism::DSL # source://prism//lib/prism/dsl.rb#481 def InterpolatedXStringNode(opening_loc, parts, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end - # Create a new ItParametersNode node + # Create a new ItLocalVariableReadNode node # # source://prism//lib/prism/dsl.rb#486 + def ItLocalVariableReadNode(source = T.unsafe(nil), location = T.unsafe(nil)); end + + # Create a new ItParametersNode node + # + # source://prism//lib/prism/dsl.rb#491 def ItParametersNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new KeywordHashNode node # - # source://prism//lib/prism/dsl.rb#491 + # source://prism//lib/prism/dsl.rb#496 def KeywordHashNode(flags, elements, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new KeywordRestParameterNode node # - # source://prism//lib/prism/dsl.rb#496 + # source://prism//lib/prism/dsl.rb#501 def KeywordRestParameterNode(flags, name, name_loc, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new LambdaNode node # - # source://prism//lib/prism/dsl.rb#501 + # source://prism//lib/prism/dsl.rb#506 def LambdaNode(locals, operator_loc, opening_loc, closing_loc, parameters, body, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new LocalVariableAndWriteNode node # - # source://prism//lib/prism/dsl.rb#506 + # source://prism//lib/prism/dsl.rb#511 def LocalVariableAndWriteNode(name_loc, operator_loc, value, name, depth, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new LocalVariableOperatorWriteNode node # - # source://prism//lib/prism/dsl.rb#511 + # source://prism//lib/prism/dsl.rb#516 def LocalVariableOperatorWriteNode(name_loc, binary_operator_loc, value, name, binary_operator, depth, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new LocalVariableOrWriteNode node # - # source://prism//lib/prism/dsl.rb#516 + # source://prism//lib/prism/dsl.rb#521 def LocalVariableOrWriteNode(name_loc, operator_loc, value, name, depth, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new LocalVariableReadNode node # - # source://prism//lib/prism/dsl.rb#521 + # source://prism//lib/prism/dsl.rb#526 def LocalVariableReadNode(name, depth, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new LocalVariableTargetNode node # - # source://prism//lib/prism/dsl.rb#526 + # source://prism//lib/prism/dsl.rb#531 def LocalVariableTargetNode(name, depth, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new LocalVariableWriteNode node # - # source://prism//lib/prism/dsl.rb#531 + # source://prism//lib/prism/dsl.rb#536 def LocalVariableWriteNode(name, depth, name_loc, value, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new Location object @@ -9000,425 +9017,283 @@ module Prism::DSL # Create a new MatchLastLineNode node # - # source://prism//lib/prism/dsl.rb#536 + # source://prism//lib/prism/dsl.rb#541 def MatchLastLineNode(flags, opening_loc, content_loc, closing_loc, unescaped, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new MatchPredicateNode node # - # source://prism//lib/prism/dsl.rb#541 + # source://prism//lib/prism/dsl.rb#546 def MatchPredicateNode(value, pattern, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new MatchRequiredNode node # - # source://prism//lib/prism/dsl.rb#546 + # source://prism//lib/prism/dsl.rb#551 def MatchRequiredNode(value, pattern, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new MatchWriteNode node # - # source://prism//lib/prism/dsl.rb#551 + # source://prism//lib/prism/dsl.rb#556 def MatchWriteNode(call, targets, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new MissingNode node # - # source://prism//lib/prism/dsl.rb#556 + # source://prism//lib/prism/dsl.rb#561 def MissingNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ModuleNode node # - # source://prism//lib/prism/dsl.rb#561 + # source://prism//lib/prism/dsl.rb#566 def ModuleNode(locals, module_keyword_loc, constant_path, body, end_keyword_loc, name, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new MultiTargetNode node # - # source://prism//lib/prism/dsl.rb#566 + # source://prism//lib/prism/dsl.rb#571 def MultiTargetNode(lefts, rest, rights, lparen_loc, rparen_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new MultiWriteNode node # - # source://prism//lib/prism/dsl.rb#571 + # source://prism//lib/prism/dsl.rb#576 def MultiWriteNode(lefts, rest, rights, lparen_loc, rparen_loc, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new NextNode node # - # source://prism//lib/prism/dsl.rb#576 + # source://prism//lib/prism/dsl.rb#581 def NextNode(arguments, keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new NilNode node # - # source://prism//lib/prism/dsl.rb#581 + # source://prism//lib/prism/dsl.rb#586 def NilNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new NoKeywordsParameterNode node # - # source://prism//lib/prism/dsl.rb#586 + # source://prism//lib/prism/dsl.rb#591 def NoKeywordsParameterNode(operator_loc, keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new NumberedParametersNode node # - # source://prism//lib/prism/dsl.rb#591 + # source://prism//lib/prism/dsl.rb#596 def NumberedParametersNode(maximum, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new NumberedReferenceReadNode node # - # source://prism//lib/prism/dsl.rb#596 + # source://prism//lib/prism/dsl.rb#601 def NumberedReferenceReadNode(number, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new OptionalKeywordParameterNode node # - # source://prism//lib/prism/dsl.rb#601 + # source://prism//lib/prism/dsl.rb#606 def OptionalKeywordParameterNode(flags, name, name_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new OptionalParameterNode node # - # source://prism//lib/prism/dsl.rb#606 + # source://prism//lib/prism/dsl.rb#611 def OptionalParameterNode(flags, name, name_loc, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new OrNode node # - # source://prism//lib/prism/dsl.rb#611 + # source://prism//lib/prism/dsl.rb#616 def OrNode(left, right, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ParametersNode node # - # source://prism//lib/prism/dsl.rb#616 + # source://prism//lib/prism/dsl.rb#621 def ParametersNode(requireds, optionals, rest, posts, keywords, keyword_rest, block, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ParenthesesNode node # - # source://prism//lib/prism/dsl.rb#621 + # source://prism//lib/prism/dsl.rb#626 def ParenthesesNode(body, opening_loc, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new PinnedExpressionNode node # - # source://prism//lib/prism/dsl.rb#626 + # source://prism//lib/prism/dsl.rb#631 def PinnedExpressionNode(expression, operator_loc, lparen_loc, rparen_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new PinnedVariableNode node # - # source://prism//lib/prism/dsl.rb#631 + # source://prism//lib/prism/dsl.rb#636 def PinnedVariableNode(variable, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new PostExecutionNode node # - # source://prism//lib/prism/dsl.rb#636 + # source://prism//lib/prism/dsl.rb#641 def PostExecutionNode(statements, keyword_loc, opening_loc, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new PreExecutionNode node # - # source://prism//lib/prism/dsl.rb#641 + # source://prism//lib/prism/dsl.rb#646 def PreExecutionNode(statements, keyword_loc, opening_loc, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ProgramNode node # - # source://prism//lib/prism/dsl.rb#646 + # source://prism//lib/prism/dsl.rb#651 def ProgramNode(locals, statements, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RangeNode node # - # source://prism//lib/prism/dsl.rb#651 + # source://prism//lib/prism/dsl.rb#656 def RangeNode(flags, left, right, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RationalNode node # - # source://prism//lib/prism/dsl.rb#656 - def RationalNode(numeric, source = T.unsafe(nil), location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#661 + def RationalNode(flags, numerator, denominator, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RedoNode node # - # source://prism//lib/prism/dsl.rb#661 + # source://prism//lib/prism/dsl.rb#666 def RedoNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RegularExpressionNode node # - # source://prism//lib/prism/dsl.rb#666 + # source://prism//lib/prism/dsl.rb#671 def RegularExpressionNode(flags, opening_loc, content_loc, closing_loc, unescaped, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RequiredKeywordParameterNode node # - # source://prism//lib/prism/dsl.rb#671 + # source://prism//lib/prism/dsl.rb#676 def RequiredKeywordParameterNode(flags, name, name_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RequiredParameterNode node # - # source://prism//lib/prism/dsl.rb#676 + # source://prism//lib/prism/dsl.rb#681 def RequiredParameterNode(flags, name, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RescueModifierNode node # - # source://prism//lib/prism/dsl.rb#681 + # source://prism//lib/prism/dsl.rb#686 def RescueModifierNode(expression, keyword_loc, rescue_expression, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RescueNode node # - # source://prism//lib/prism/dsl.rb#686 + # source://prism//lib/prism/dsl.rb#691 def RescueNode(keyword_loc, exceptions, operator_loc, reference, statements, consequent, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RestParameterNode node # - # source://prism//lib/prism/dsl.rb#691 + # source://prism//lib/prism/dsl.rb#696 def RestParameterNode(flags, name, name_loc, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RetryNode node # - # source://prism//lib/prism/dsl.rb#696 + # source://prism//lib/prism/dsl.rb#701 def RetryNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ReturnNode node # - # source://prism//lib/prism/dsl.rb#701 + # source://prism//lib/prism/dsl.rb#706 def ReturnNode(flags, keyword_loc, arguments, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new SelfNode node # - # source://prism//lib/prism/dsl.rb#706 + # source://prism//lib/prism/dsl.rb#711 def SelfNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ShareableConstantNode node # - # source://prism//lib/prism/dsl.rb#711 + # source://prism//lib/prism/dsl.rb#716 def ShareableConstantNode(flags, write, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new SingletonClassNode node # - # source://prism//lib/prism/dsl.rb#716 + # source://prism//lib/prism/dsl.rb#721 def SingletonClassNode(locals, class_keyword_loc, operator_loc, expression, body, end_keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new SourceEncodingNode node # - # source://prism//lib/prism/dsl.rb#721 + # source://prism//lib/prism/dsl.rb#726 def SourceEncodingNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new SourceFileNode node # - # source://prism//lib/prism/dsl.rb#726 + # source://prism//lib/prism/dsl.rb#731 def SourceFileNode(flags, filepath, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new SourceLineNode node # - # source://prism//lib/prism/dsl.rb#731 + # source://prism//lib/prism/dsl.rb#736 def SourceLineNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new SplatNode node # - # source://prism//lib/prism/dsl.rb#736 + # source://prism//lib/prism/dsl.rb#741 def SplatNode(operator_loc, expression, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new StatementsNode node # - # source://prism//lib/prism/dsl.rb#741 + # source://prism//lib/prism/dsl.rb#746 def StatementsNode(body, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new StringNode node # - # source://prism//lib/prism/dsl.rb#746 + # source://prism//lib/prism/dsl.rb#751 def StringNode(flags, opening_loc, content_loc, closing_loc, unescaped, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new SuperNode node # - # source://prism//lib/prism/dsl.rb#751 + # source://prism//lib/prism/dsl.rb#756 def SuperNode(keyword_loc, lparen_loc, arguments, rparen_loc, block, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new SymbolNode node # - # source://prism//lib/prism/dsl.rb#756 + # source://prism//lib/prism/dsl.rb#761 def SymbolNode(flags, opening_loc, value_loc, closing_loc, unescaped, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new TrueNode node # - # source://prism//lib/prism/dsl.rb#761 + # source://prism//lib/prism/dsl.rb#766 def TrueNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new UndefNode node # - # source://prism//lib/prism/dsl.rb#766 + # source://prism//lib/prism/dsl.rb#771 def UndefNode(names, keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new UnlessNode node # - # source://prism//lib/prism/dsl.rb#771 + # source://prism//lib/prism/dsl.rb#776 def UnlessNode(keyword_loc, predicate, then_keyword_loc, statements, consequent, end_keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new UntilNode node # - # source://prism//lib/prism/dsl.rb#776 + # source://prism//lib/prism/dsl.rb#781 def UntilNode(flags, keyword_loc, closing_loc, predicate, statements, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new WhenNode node # - # source://prism//lib/prism/dsl.rb#781 + # source://prism//lib/prism/dsl.rb#786 def WhenNode(keyword_loc, conditions, then_keyword_loc, statements, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new WhileNode node # - # source://prism//lib/prism/dsl.rb#786 + # source://prism//lib/prism/dsl.rb#791 def WhileNode(flags, keyword_loc, closing_loc, predicate, statements, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new XStringNode node # - # source://prism//lib/prism/dsl.rb#791 + # source://prism//lib/prism/dsl.rb#796 def XStringNode(flags, opening_loc, content_loc, closing_loc, unescaped, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new YieldNode node # - # source://prism//lib/prism/dsl.rb#796 + # source://prism//lib/prism/dsl.rb#801 def YieldNode(keyword_loc, lparen_loc, arguments, rparen_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end end -# This module is used for testing and debugging and is not meant to be used by -# consumers of this library. -# -# source://prism//lib/prism/debug.rb#6 -module Prism::Debug - class << self - # :call-seq: - # Debug::cruby_locals(source) -> Array - # - # For the given source, compiles with CRuby and returns a list of all of the - # sets of local variables that were encountered. - # - # source://prism//lib/prism/debug.rb#54 - def cruby_locals(source); end - - def format_errors(_arg0, _arg1); end - def inspect_node(_arg0); end - def integer_parse(_arg0); end - def memsize(_arg0); end - def named_captures(_arg0); end - - # :call-seq: - # Debug::newlines(source) -> Array - # - # For the given source string, return the byte offsets of every newline in - # the source. - # - # source://prism//lib/prism/debug.rb#202 - def newlines(source); end - - # :call-seq: - # Debug::prism_locals(source) -> Array - # - # For the given source, parses with prism and returns a list of all of the - # sets of local variables that were encountered. - # - # source://prism//lib/prism/debug.rb#98 - def prism_locals(source); end - - def profile_file(_arg0); end - def static_inspect(*_arg0); end - end -end - -# Used to hold the place of a local that will be in the local table but -# cannot be accessed directly from the source code. For example, the -# iteration variable in a for loop or the positional parameter on a method -# definition that is destructured. -# -# source://prism//lib/prism/debug.rb#90 -Prism::Debug::AnonymousLocal = T.let(T.unsafe(nil), Object) - -# A wrapping around prism's internal encoding data structures. This is used -# for reflection and debugging purposes. -# -# source://prism//lib/prism/debug.rb#208 -class Prism::Debug::Encoding - # Initialize a new encoding with the given name and whether or not it is - # a multibyte encoding. - # - # @return [Encoding] a new instance of Encoding - # - # source://prism//lib/prism/debug.rb#214 - def initialize(name, multibyte); end - - # Returns true if the first character in the source string is a valid - # alphanumeric character for the encoding. - # - # @return [Boolean] - # - # source://prism//lib/prism/debug.rb#232 - def alnum?(source); end - - # Returns true if the first character in the source string is a valid - # alphabetic character for the encoding. - # - # @return [Boolean] - # - # source://prism//lib/prism/debug.rb#238 - def alpha?(source); end - - # Whether or not the encoding is a multibyte encoding. - # - # @return [Boolean] - # - # source://prism//lib/prism/debug.rb#220 - def multibyte?; end - - # The name of the encoding, that can be passed to Encoding.find. - # - # source://prism//lib/prism/debug.rb#210 - def name; end - - # Returns true if the first character in the source string is a valid - # uppercase character for the encoding. - # - # @return [Boolean] - # - # source://prism//lib/prism/debug.rb#244 - def upper?(source); end - - # Returns the number of bytes of the first character in the source string, - # if it is valid for the encoding. Otherwise, returns 0. - # - # source://prism//lib/prism/debug.rb#226 - def width(source); end - - class << self - def _alnum?(_arg0, _arg1); end - def _alpha?(_arg0, _arg1); end - def _upper?(_arg0, _arg1); end - def _width(_arg0, _arg1); end - def all; end - end -end - -# A wrapper around a RubyVM::InstructionSequence that provides a more -# convenient interface for accessing parts of the iseq. -# -# source://prism//lib/prism/debug.rb#9 -class Prism::Debug::ISeq - # @return [ISeq] a new instance of ISeq - # - # source://prism//lib/prism/debug.rb#12 - def initialize(parts); end - - # source://prism//lib/prism/debug.rb#28 - def each_child; end - - # source://prism//lib/prism/debug.rb#24 - def instructions; end - - # source://prism//lib/prism/debug.rb#20 - def local_table; end - - # source://prism//lib/prism/debug.rb#10 - def parts; end - - # source://prism//lib/prism/debug.rb#16 - def type; end -end - # Represents a method definition. # # def method # end # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#5854 +# source://prism//lib/prism/node.rb#5793 class Prism::DefNode < ::Prism::Node # def initialize: (Symbol name, Location name_loc, Prism::node? receiver, ParametersNode? parameters, Prism::node? body, Array[Symbol] locals, Location def_keyword_loc, Location? operator_loc, Location? lparen_loc, Location? rparen_loc, Location? equal_loc, Location? end_keyword_loc, Location location) -> void # # @return [DefNode] a new instance of DefNode # - # source://prism//lib/prism/node.rb#5855 + # source://prism//lib/prism/node.rb#5795 sig do params( source: Prism::Source, @@ -9442,42 +9317,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#6069 + # source://prism//lib/prism/node.rb#6008 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5874 + # source://prism//lib/prism/node.rb#5813 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader body: Prism::node? # - # source://prism//lib/prism/node.rb#5927 + # source://prism//lib/prism/node.rb#5866 sig { returns(T.nilable(Prism::Node)) } def body; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5879 + # source://prism//lib/prism/node.rb#5818 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#5893 + # source://prism//lib/prism/node.rb#5832 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#5884 + # source://prism//lib/prism/node.rb#5823 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?name_loc: Location, ?receiver: Prism::node?, ?parameters: ParametersNode?, ?body: Prism::node?, ?locals: Array[Symbol], ?def_keyword_loc: Location, ?operator_loc: Location?, ?lparen_loc: Location?, ?rparen_loc: Location?, ?equal_loc: Location?, ?end_keyword_loc: Location?, ?location: Location) -> DefNode # - # source://prism//lib/prism/node.rb#5898 + # source://prism//lib/prism/node.rb#5837 sig do params( name: Symbol, @@ -9500,49 +9375,49 @@ class Prism::DefNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5879 + # source://prism//lib/prism/node.rb#5818 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, receiver: Prism::node?, parameters: ParametersNode?, body: Prism::node?, locals: Array[Symbol], def_keyword_loc: Location, operator_loc: Location?, lparen_loc: Location?, rparen_loc: Location?, equal_loc: Location?, end_keyword_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#5906 + # source://prism//lib/prism/node.rb#5845 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#6005 + # source://prism//lib/prism/node.rb#5944 sig { returns(String) } def def_keyword; end # attr_reader def_keyword_loc: Location # - # source://prism//lib/prism/node.rb#5933 + # source://prism//lib/prism/node.rb#5872 sig { returns(Prism::Location) } def def_keyword_loc; end # def end_keyword: () -> String? # - # source://prism//lib/prism/node.rb#6030 + # source://prism//lib/prism/node.rb#5969 sig { returns(T.nilable(String)) } def end_keyword; end # attr_reader end_keyword_loc: Location? # - # source://prism//lib/prism/node.rb#5992 + # source://prism//lib/prism/node.rb#5931 sig { returns(T.nilable(Prism::Location)) } def end_keyword_loc; end # def equal: () -> String? # - # source://prism//lib/prism/node.rb#6025 + # source://prism//lib/prism/node.rb#5964 sig { returns(T.nilable(String)) } def equal; end # attr_reader equal_loc: Location? # - # source://prism//lib/prism/node.rb#5979 + # source://prism//lib/prism/node.rb#5918 sig { returns(T.nilable(Prism::Location)) } def equal_loc; end @@ -9551,73 +9426,73 @@ class Prism::DefNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#6035 + # source://prism//lib/prism/node.rb#5974 sig { override.returns(String) } def inspect; end # attr_reader locals: Array[Symbol] # - # source://prism//lib/prism/node.rb#5930 + # source://prism//lib/prism/node.rb#5869 sig { returns(T::Array[Symbol]) } def locals; end # def lparen: () -> String? # - # source://prism//lib/prism/node.rb#6015 + # source://prism//lib/prism/node.rb#5954 sig { returns(T.nilable(String)) } def lparen; end # attr_reader lparen_loc: Location? # - # source://prism//lib/prism/node.rb#5953 + # source://prism//lib/prism/node.rb#5892 sig { returns(T.nilable(Prism::Location)) } def lparen_loc; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#5911 + # source://prism//lib/prism/node.rb#5850 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#5914 + # source://prism//lib/prism/node.rb#5853 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String? # - # source://prism//lib/prism/node.rb#6010 + # source://prism//lib/prism/node.rb#5949 sig { returns(T.nilable(String)) } def operator; end # attr_reader operator_loc: Location? # - # source://prism//lib/prism/node.rb#5940 + # source://prism//lib/prism/node.rb#5879 sig { returns(T.nilable(Prism::Location)) } def operator_loc; end # attr_reader parameters: ParametersNode? # - # source://prism//lib/prism/node.rb#5924 + # source://prism//lib/prism/node.rb#5863 sig { returns(T.nilable(Prism::ParametersNode)) } def parameters; end # attr_reader receiver: Prism::node? # - # source://prism//lib/prism/node.rb#5921 + # source://prism//lib/prism/node.rb#5860 sig { returns(T.nilable(Prism::Node)) } def receiver; end # def rparen: () -> String? # - # source://prism//lib/prism/node.rb#6020 + # source://prism//lib/prism/node.rb#5959 sig { returns(T.nilable(String)) } def rparen; end # attr_reader rparen_loc: Location? # - # source://prism//lib/prism/node.rb#5966 + # source://prism//lib/prism/node.rb#5905 sig { returns(T.nilable(Prism::Location)) } def rparen_loc; end @@ -9636,7 +9511,7 @@ class Prism::DefNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#6053 + # source://prism//lib/prism/node.rb#5992 sig { override.returns(Symbol) } def type; end @@ -9648,7 +9523,7 @@ class Prism::DefNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#6063 + # source://prism//lib/prism/node.rb#6002 def type; end end end @@ -9658,13 +9533,13 @@ end # defined?(a) # ^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#6092 +# source://prism//lib/prism/node.rb#6030 class Prism::DefinedNode < ::Prism::Node # def initialize: (Location? lparen_loc, Prism::node value, Location? rparen_loc, Location keyword_loc, Location location) -> void # # @return [DefinedNode] a new instance of DefinedNode # - # source://prism//lib/prism/node.rb#6093 + # source://prism//lib/prism/node.rb#6032 sig do params( source: Prism::Source, @@ -9680,36 +9555,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#6222 + # source://prism//lib/prism/node.rb#6160 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6104 + # source://prism//lib/prism/node.rb#6042 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#6109 + # source://prism//lib/prism/node.rb#6047 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#6119 + # source://prism//lib/prism/node.rb#6057 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#6114 + # source://prism//lib/prism/node.rb#6052 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?lparen_loc: Location?, ?value: Prism::node, ?rparen_loc: Location?, ?keyword_loc: Location, ?location: Location) -> DefinedNode # - # source://prism//lib/prism/node.rb#6124 + # source://prism//lib/prism/node.rb#6062 sig do params( lparen_loc: T.nilable(Prism::Location), @@ -9724,13 +9599,13 @@ class Prism::DefinedNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6109 + # source://prism//lib/prism/node.rb#6047 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { lparen_loc: Location?, value: Prism::node, rparen_loc: Location?, keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#6132 + # source://prism//lib/prism/node.rb#6070 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -9739,43 +9614,43 @@ class Prism::DefinedNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#6188 + # source://prism//lib/prism/node.rb#6126 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#6183 + # source://prism//lib/prism/node.rb#6121 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#6166 + # source://prism//lib/prism/node.rb#6104 sig { returns(Prism::Location) } def keyword_loc; end # def lparen: () -> String? # - # source://prism//lib/prism/node.rb#6173 + # source://prism//lib/prism/node.rb#6111 sig { returns(T.nilable(String)) } def lparen; end # attr_reader lparen_loc: Location? # - # source://prism//lib/prism/node.rb#6137 + # source://prism//lib/prism/node.rb#6075 sig { returns(T.nilable(Prism::Location)) } def lparen_loc; end # def rparen: () -> String? # - # source://prism//lib/prism/node.rb#6178 + # source://prism//lib/prism/node.rb#6116 sig { returns(T.nilable(String)) } def rparen; end # attr_reader rparen_loc: Location? # - # source://prism//lib/prism/node.rb#6153 + # source://prism//lib/prism/node.rb#6091 sig { returns(T.nilable(Prism::Location)) } def rparen_loc; end @@ -9794,13 +9669,13 @@ class Prism::DefinedNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#6206 + # source://prism//lib/prism/node.rb#6144 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#6150 + # source://prism//lib/prism/node.rb#6088 sig { returns(Prism::Node) } def value; end @@ -9812,7 +9687,7 @@ class Prism::DefinedNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#6216 + # source://prism//lib/prism/node.rb#6154 def type; end end end @@ -9858,7 +9733,7 @@ end # DesugarCompiler is a compiler that desugars Ruby code into a more primitive # form. This is useful for consumers that want to deal with fewer node types. # -# source://prism//lib/prism/desugar_compiler.rb#223 +# source://prism//lib/prism/desugar_compiler.rb#218 class Prism::DesugarCompiler < ::Prism::MutationCompiler # @@foo &&= bar # @@ -10129,7 +10004,7 @@ 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#41 class Prism::Dispatcher < ::Prism::Visitor # Initialize a new dispatcher. # @@ -10686,1145 +10561,1156 @@ class Prism::Dispatcher < ::Prism::Visitor # source://prism//lib/prism/dispatcher.rb#759 def visit_interpolated_x_string_node(node); end - # Dispatch enter and leave events for ItParametersNode nodes and continue + # Dispatch enter and leave events for ItLocalVariableReadNode nodes and continue # walking the tree. # # source://prism//lib/prism/dispatcher.rb#767 + 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#775 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#775 + # source://prism//lib/prism/dispatcher.rb#783 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#783 + # source://prism//lib/prism/dispatcher.rb#791 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#791 + # source://prism//lib/prism/dispatcher.rb#799 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#799 + # source://prism//lib/prism/dispatcher.rb#807 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#807 + # source://prism//lib/prism/dispatcher.rb#815 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#815 + # source://prism//lib/prism/dispatcher.rb#823 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#823 + # source://prism//lib/prism/dispatcher.rb#831 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#831 + # source://prism//lib/prism/dispatcher.rb#839 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#839 + # source://prism//lib/prism/dispatcher.rb#847 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#847 + # source://prism//lib/prism/dispatcher.rb#855 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#855 + # source://prism//lib/prism/dispatcher.rb#863 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#863 + # source://prism//lib/prism/dispatcher.rb#871 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#871 + # source://prism//lib/prism/dispatcher.rb#879 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#879 + # source://prism//lib/prism/dispatcher.rb#887 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#887 + # source://prism//lib/prism/dispatcher.rb#895 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#895 + # source://prism//lib/prism/dispatcher.rb#903 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#903 + # source://prism//lib/prism/dispatcher.rb#911 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#911 + # source://prism//lib/prism/dispatcher.rb#919 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#919 + # source://prism//lib/prism/dispatcher.rb#927 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#927 + # source://prism//lib/prism/dispatcher.rb#935 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#935 + # source://prism//lib/prism/dispatcher.rb#943 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#943 + # source://prism//lib/prism/dispatcher.rb#951 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#951 + # source://prism//lib/prism/dispatcher.rb#959 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#959 + # source://prism//lib/prism/dispatcher.rb#967 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#967 + # source://prism//lib/prism/dispatcher.rb#975 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#975 + # source://prism//lib/prism/dispatcher.rb#983 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#983 + # source://prism//lib/prism/dispatcher.rb#991 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#991 + # source://prism//lib/prism/dispatcher.rb#999 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#999 + # source://prism//lib/prism/dispatcher.rb#1007 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#1007 + # source://prism//lib/prism/dispatcher.rb#1015 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#1015 + # source://prism//lib/prism/dispatcher.rb#1023 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#1023 + # source://prism//lib/prism/dispatcher.rb#1031 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#1031 + # source://prism//lib/prism/dispatcher.rb#1039 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#1039 + # source://prism//lib/prism/dispatcher.rb#1047 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#1047 + # source://prism//lib/prism/dispatcher.rb#1055 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#1055 + # source://prism//lib/prism/dispatcher.rb#1063 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#1063 + # source://prism//lib/prism/dispatcher.rb#1071 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#1071 + # source://prism//lib/prism/dispatcher.rb#1079 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#1079 + # source://prism//lib/prism/dispatcher.rb#1087 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#1087 + # source://prism//lib/prism/dispatcher.rb#1095 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#1095 + # source://prism//lib/prism/dispatcher.rb#1103 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#1103 + # source://prism//lib/prism/dispatcher.rb#1111 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#1111 + # source://prism//lib/prism/dispatcher.rb#1119 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#1119 + # source://prism//lib/prism/dispatcher.rb#1127 def visit_self_node(node); end # Dispatch enter and leave events for ShareableConstantNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1127 + # source://prism//lib/prism/dispatcher.rb#1135 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#1135 + # source://prism//lib/prism/dispatcher.rb#1143 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#1143 + # source://prism//lib/prism/dispatcher.rb#1151 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#1151 + # source://prism//lib/prism/dispatcher.rb#1159 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#1159 + # source://prism//lib/prism/dispatcher.rb#1167 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#1167 + # source://prism//lib/prism/dispatcher.rb#1175 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#1175 + # source://prism//lib/prism/dispatcher.rb#1183 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#1183 + # source://prism//lib/prism/dispatcher.rb#1191 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#1191 + # source://prism//lib/prism/dispatcher.rb#1199 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#1199 + # source://prism//lib/prism/dispatcher.rb#1207 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#1207 + # source://prism//lib/prism/dispatcher.rb#1215 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#1215 + # source://prism//lib/prism/dispatcher.rb#1223 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#1223 + # source://prism//lib/prism/dispatcher.rb#1231 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#1231 + # source://prism//lib/prism/dispatcher.rb#1239 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#1239 + # source://prism//lib/prism/dispatcher.rb#1247 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#1247 + # source://prism//lib/prism/dispatcher.rb#1255 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#1255 + # source://prism//lib/prism/dispatcher.rb#1263 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#1263 + # source://prism//lib/prism/dispatcher.rb#1271 def visit_yield_node(node); end end -# source://prism//lib/prism/dispatcher.rb#1269 +# source://prism//lib/prism/dispatcher.rb#1277 class Prism::Dispatcher::DispatchOnce < ::Prism::Visitor # @return [DispatchOnce] a new instance of DispatchOnce # - # source://prism//lib/prism/dispatcher.rb#1272 + # source://prism//lib/prism/dispatcher.rb#1280 def initialize(listeners); end # Returns the value of attribute listeners. # - # source://prism//lib/prism/dispatcher.rb#1270 + # source://prism//lib/prism/dispatcher.rb#1278 def listeners; end # Dispatch enter and leave events for AliasGlobalVariableNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1277 + # source://prism//lib/prism/dispatcher.rb#1285 def visit_alias_global_variable_node(node); end # Dispatch enter and leave events for AliasMethodNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1283 + # source://prism//lib/prism/dispatcher.rb#1291 def visit_alias_method_node(node); end # Dispatch enter and leave events for AlternationPatternNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1289 + # source://prism//lib/prism/dispatcher.rb#1297 def visit_alternation_pattern_node(node); end # Dispatch enter and leave events for AndNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1295 + # source://prism//lib/prism/dispatcher.rb#1303 def visit_and_node(node); end # Dispatch enter and leave events for ArgumentsNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1301 + # source://prism//lib/prism/dispatcher.rb#1309 def visit_arguments_node(node); end # Dispatch enter and leave events for ArrayNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1307 + # source://prism//lib/prism/dispatcher.rb#1315 def visit_array_node(node); end # Dispatch enter and leave events for ArrayPatternNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1313 + # source://prism//lib/prism/dispatcher.rb#1321 def visit_array_pattern_node(node); end # Dispatch enter and leave events for AssocNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1319 + # source://prism//lib/prism/dispatcher.rb#1327 def visit_assoc_node(node); end # Dispatch enter and leave events for AssocSplatNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1325 + # source://prism//lib/prism/dispatcher.rb#1333 def visit_assoc_splat_node(node); end # Dispatch enter and leave events for BackReferenceReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1331 + # source://prism//lib/prism/dispatcher.rb#1339 def visit_back_reference_read_node(node); end # Dispatch enter and leave events for BeginNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1337 + # source://prism//lib/prism/dispatcher.rb#1345 def visit_begin_node(node); end # Dispatch enter and leave events for BlockArgumentNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1343 + # source://prism//lib/prism/dispatcher.rb#1351 def visit_block_argument_node(node); end # Dispatch enter and leave events for BlockLocalVariableNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1349 + # source://prism//lib/prism/dispatcher.rb#1357 def visit_block_local_variable_node(node); end # Dispatch enter and leave events for BlockNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1355 + # source://prism//lib/prism/dispatcher.rb#1363 def visit_block_node(node); end # Dispatch enter and leave events for BlockParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1361 + # source://prism//lib/prism/dispatcher.rb#1369 def visit_block_parameter_node(node); end # Dispatch enter and leave events for BlockParametersNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1367 + # source://prism//lib/prism/dispatcher.rb#1375 def visit_block_parameters_node(node); end # Dispatch enter and leave events for BreakNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1373 + # source://prism//lib/prism/dispatcher.rb#1381 def visit_break_node(node); end # Dispatch enter and leave events for CallAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1379 + # source://prism//lib/prism/dispatcher.rb#1387 def visit_call_and_write_node(node); end # Dispatch enter and leave events for CallNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1385 + # source://prism//lib/prism/dispatcher.rb#1393 def visit_call_node(node); end # Dispatch enter and leave events for CallOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1391 + # source://prism//lib/prism/dispatcher.rb#1399 def visit_call_operator_write_node(node); end # Dispatch enter and leave events for CallOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1397 + # source://prism//lib/prism/dispatcher.rb#1405 def visit_call_or_write_node(node); end # Dispatch enter and leave events for CallTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1403 + # source://prism//lib/prism/dispatcher.rb#1411 def visit_call_target_node(node); end # Dispatch enter and leave events for CapturePatternNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1409 + # source://prism//lib/prism/dispatcher.rb#1417 def visit_capture_pattern_node(node); end # Dispatch enter and leave events for CaseMatchNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1415 + # source://prism//lib/prism/dispatcher.rb#1423 def visit_case_match_node(node); end # Dispatch enter and leave events for CaseNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1421 + # source://prism//lib/prism/dispatcher.rb#1429 def visit_case_node(node); end # Dispatch enter and leave events for ClassNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1427 + # source://prism//lib/prism/dispatcher.rb#1435 def visit_class_node(node); end # Dispatch enter and leave events for ClassVariableAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1433 + # source://prism//lib/prism/dispatcher.rb#1441 def visit_class_variable_and_write_node(node); end # Dispatch enter and leave events for ClassVariableOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1439 + # source://prism//lib/prism/dispatcher.rb#1447 def visit_class_variable_operator_write_node(node); end # Dispatch enter and leave events for ClassVariableOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1445 + # source://prism//lib/prism/dispatcher.rb#1453 def visit_class_variable_or_write_node(node); end # Dispatch enter and leave events for ClassVariableReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1451 + # source://prism//lib/prism/dispatcher.rb#1459 def visit_class_variable_read_node(node); end # Dispatch enter and leave events for ClassVariableTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1457 + # source://prism//lib/prism/dispatcher.rb#1465 def visit_class_variable_target_node(node); end # Dispatch enter and leave events for ClassVariableWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1463 + # source://prism//lib/prism/dispatcher.rb#1471 def visit_class_variable_write_node(node); end # Dispatch enter and leave events for ConstantAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1469 + # source://prism//lib/prism/dispatcher.rb#1477 def visit_constant_and_write_node(node); end # Dispatch enter and leave events for ConstantOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1475 + # source://prism//lib/prism/dispatcher.rb#1483 def visit_constant_operator_write_node(node); end # Dispatch enter and leave events for ConstantOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1481 + # source://prism//lib/prism/dispatcher.rb#1489 def visit_constant_or_write_node(node); end # Dispatch enter and leave events for ConstantPathAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1487 + # source://prism//lib/prism/dispatcher.rb#1495 def visit_constant_path_and_write_node(node); end # Dispatch enter and leave events for ConstantPathNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1493 + # source://prism//lib/prism/dispatcher.rb#1501 def visit_constant_path_node(node); end # Dispatch enter and leave events for ConstantPathOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1499 + # source://prism//lib/prism/dispatcher.rb#1507 def visit_constant_path_operator_write_node(node); end # Dispatch enter and leave events for ConstantPathOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1505 + # source://prism//lib/prism/dispatcher.rb#1513 def visit_constant_path_or_write_node(node); end # Dispatch enter and leave events for ConstantPathTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1511 + # source://prism//lib/prism/dispatcher.rb#1519 def visit_constant_path_target_node(node); end # Dispatch enter and leave events for ConstantPathWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1517 + # source://prism//lib/prism/dispatcher.rb#1525 def visit_constant_path_write_node(node); end # Dispatch enter and leave events for ConstantReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1523 + # source://prism//lib/prism/dispatcher.rb#1531 def visit_constant_read_node(node); end # Dispatch enter and leave events for ConstantTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1529 + # source://prism//lib/prism/dispatcher.rb#1537 def visit_constant_target_node(node); end # Dispatch enter and leave events for ConstantWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1535 + # source://prism//lib/prism/dispatcher.rb#1543 def visit_constant_write_node(node); end # Dispatch enter and leave events for DefNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1541 + # source://prism//lib/prism/dispatcher.rb#1549 def visit_def_node(node); end # Dispatch enter and leave events for DefinedNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1547 + # source://prism//lib/prism/dispatcher.rb#1555 def visit_defined_node(node); end # Dispatch enter and leave events for ElseNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1553 + # source://prism//lib/prism/dispatcher.rb#1561 def visit_else_node(node); end # Dispatch enter and leave events for EmbeddedStatementsNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1559 + # source://prism//lib/prism/dispatcher.rb#1567 def visit_embedded_statements_node(node); end # Dispatch enter and leave events for EmbeddedVariableNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1565 + # source://prism//lib/prism/dispatcher.rb#1573 def visit_embedded_variable_node(node); end # Dispatch enter and leave events for EnsureNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1571 + # source://prism//lib/prism/dispatcher.rb#1579 def visit_ensure_node(node); end # Dispatch enter and leave events for FalseNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1577 + # source://prism//lib/prism/dispatcher.rb#1585 def visit_false_node(node); end # Dispatch enter and leave events for FindPatternNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1583 + # source://prism//lib/prism/dispatcher.rb#1591 def visit_find_pattern_node(node); end # Dispatch enter and leave events for FlipFlopNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1589 + # source://prism//lib/prism/dispatcher.rb#1597 def visit_flip_flop_node(node); end # Dispatch enter and leave events for FloatNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1595 + # source://prism//lib/prism/dispatcher.rb#1603 def visit_float_node(node); end # Dispatch enter and leave events for ForNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1601 + # source://prism//lib/prism/dispatcher.rb#1609 def visit_for_node(node); end # Dispatch enter and leave events for ForwardingArgumentsNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1607 + # source://prism//lib/prism/dispatcher.rb#1615 def visit_forwarding_arguments_node(node); end # Dispatch enter and leave events for ForwardingParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1613 + # source://prism//lib/prism/dispatcher.rb#1621 def visit_forwarding_parameter_node(node); end # Dispatch enter and leave events for ForwardingSuperNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1619 + # source://prism//lib/prism/dispatcher.rb#1627 def visit_forwarding_super_node(node); end # Dispatch enter and leave events for GlobalVariableAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1625 + # source://prism//lib/prism/dispatcher.rb#1633 def visit_global_variable_and_write_node(node); end # Dispatch enter and leave events for GlobalVariableOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1631 + # source://prism//lib/prism/dispatcher.rb#1639 def visit_global_variable_operator_write_node(node); end # Dispatch enter and leave events for GlobalVariableOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1637 + # source://prism//lib/prism/dispatcher.rb#1645 def visit_global_variable_or_write_node(node); end # Dispatch enter and leave events for GlobalVariableReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1643 + # source://prism//lib/prism/dispatcher.rb#1651 def visit_global_variable_read_node(node); end # Dispatch enter and leave events for GlobalVariableTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1649 + # source://prism//lib/prism/dispatcher.rb#1657 def visit_global_variable_target_node(node); end # Dispatch enter and leave events for GlobalVariableWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1655 + # source://prism//lib/prism/dispatcher.rb#1663 def visit_global_variable_write_node(node); end # Dispatch enter and leave events for HashNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1661 + # source://prism//lib/prism/dispatcher.rb#1669 def visit_hash_node(node); end # Dispatch enter and leave events for HashPatternNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1667 + # source://prism//lib/prism/dispatcher.rb#1675 def visit_hash_pattern_node(node); end # Dispatch enter and leave events for IfNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1673 + # source://prism//lib/prism/dispatcher.rb#1681 def visit_if_node(node); end # Dispatch enter and leave events for ImaginaryNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1679 + # source://prism//lib/prism/dispatcher.rb#1687 def visit_imaginary_node(node); end # Dispatch enter and leave events for ImplicitNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1685 + # source://prism//lib/prism/dispatcher.rb#1693 def visit_implicit_node(node); end # Dispatch enter and leave events for ImplicitRestNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1691 + # source://prism//lib/prism/dispatcher.rb#1699 def visit_implicit_rest_node(node); end # Dispatch enter and leave events for InNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1697 + # source://prism//lib/prism/dispatcher.rb#1705 def visit_in_node(node); end # Dispatch enter and leave events for IndexAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1703 + # source://prism//lib/prism/dispatcher.rb#1711 def visit_index_and_write_node(node); end # Dispatch enter and leave events for IndexOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1709 + # source://prism//lib/prism/dispatcher.rb#1717 def visit_index_operator_write_node(node); end # Dispatch enter and leave events for IndexOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1715 + # source://prism//lib/prism/dispatcher.rb#1723 def visit_index_or_write_node(node); end # Dispatch enter and leave events for IndexTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1721 + # source://prism//lib/prism/dispatcher.rb#1729 def visit_index_target_node(node); end # Dispatch enter and leave events for InstanceVariableAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1727 + # source://prism//lib/prism/dispatcher.rb#1735 def visit_instance_variable_and_write_node(node); end # Dispatch enter and leave events for InstanceVariableOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1733 + # source://prism//lib/prism/dispatcher.rb#1741 def visit_instance_variable_operator_write_node(node); end # Dispatch enter and leave events for InstanceVariableOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1739 + # source://prism//lib/prism/dispatcher.rb#1747 def visit_instance_variable_or_write_node(node); end # Dispatch enter and leave events for InstanceVariableReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1745 + # source://prism//lib/prism/dispatcher.rb#1753 def visit_instance_variable_read_node(node); end # Dispatch enter and leave events for InstanceVariableTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1751 + # source://prism//lib/prism/dispatcher.rb#1759 def visit_instance_variable_target_node(node); end # Dispatch enter and leave events for InstanceVariableWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1757 + # source://prism//lib/prism/dispatcher.rb#1765 def visit_instance_variable_write_node(node); end # Dispatch enter and leave events for IntegerNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1763 + # source://prism//lib/prism/dispatcher.rb#1771 def visit_integer_node(node); end # Dispatch enter and leave events for InterpolatedMatchLastLineNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1769 + # source://prism//lib/prism/dispatcher.rb#1777 def visit_interpolated_match_last_line_node(node); end # Dispatch enter and leave events for InterpolatedRegularExpressionNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1775 + # source://prism//lib/prism/dispatcher.rb#1783 def visit_interpolated_regular_expression_node(node); end # Dispatch enter and leave events for InterpolatedStringNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1781 + # source://prism//lib/prism/dispatcher.rb#1789 def visit_interpolated_string_node(node); end # Dispatch enter and leave events for InterpolatedSymbolNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1787 + # source://prism//lib/prism/dispatcher.rb#1795 def visit_interpolated_symbol_node(node); end # Dispatch enter and leave events for InterpolatedXStringNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1793 + # source://prism//lib/prism/dispatcher.rb#1801 def visit_interpolated_x_string_node(node); end + # Dispatch enter and leave events for ItLocalVariableReadNode nodes. + # + # source://prism//lib/prism/dispatcher.rb#1807 + def visit_it_local_variable_read_node(node); end + # Dispatch enter and leave events for ItParametersNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1799 + # source://prism//lib/prism/dispatcher.rb#1813 def visit_it_parameters_node(node); end # Dispatch enter and leave events for KeywordHashNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1805 + # source://prism//lib/prism/dispatcher.rb#1819 def visit_keyword_hash_node(node); end # Dispatch enter and leave events for KeywordRestParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1811 + # source://prism//lib/prism/dispatcher.rb#1825 def visit_keyword_rest_parameter_node(node); end # Dispatch enter and leave events for LambdaNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1817 + # source://prism//lib/prism/dispatcher.rb#1831 def visit_lambda_node(node); end # Dispatch enter and leave events for LocalVariableAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1823 + # source://prism//lib/prism/dispatcher.rb#1837 def visit_local_variable_and_write_node(node); end # Dispatch enter and leave events for LocalVariableOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1829 + # source://prism//lib/prism/dispatcher.rb#1843 def visit_local_variable_operator_write_node(node); end # Dispatch enter and leave events for LocalVariableOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1835 + # source://prism//lib/prism/dispatcher.rb#1849 def visit_local_variable_or_write_node(node); end # Dispatch enter and leave events for LocalVariableReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1841 + # source://prism//lib/prism/dispatcher.rb#1855 def visit_local_variable_read_node(node); end # Dispatch enter and leave events for LocalVariableTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1847 + # source://prism//lib/prism/dispatcher.rb#1861 def visit_local_variable_target_node(node); end # Dispatch enter and leave events for LocalVariableWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1853 + # source://prism//lib/prism/dispatcher.rb#1867 def visit_local_variable_write_node(node); end # Dispatch enter and leave events for MatchLastLineNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1859 + # source://prism//lib/prism/dispatcher.rb#1873 def visit_match_last_line_node(node); end # Dispatch enter and leave events for MatchPredicateNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1865 + # source://prism//lib/prism/dispatcher.rb#1879 def visit_match_predicate_node(node); end # Dispatch enter and leave events for MatchRequiredNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1871 + # source://prism//lib/prism/dispatcher.rb#1885 def visit_match_required_node(node); end # Dispatch enter and leave events for MatchWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1877 + # source://prism//lib/prism/dispatcher.rb#1891 def visit_match_write_node(node); end # Dispatch enter and leave events for MissingNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1883 + # source://prism//lib/prism/dispatcher.rb#1897 def visit_missing_node(node); end # Dispatch enter and leave events for ModuleNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1889 + # source://prism//lib/prism/dispatcher.rb#1903 def visit_module_node(node); end # Dispatch enter and leave events for MultiTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1895 + # source://prism//lib/prism/dispatcher.rb#1909 def visit_multi_target_node(node); end # Dispatch enter and leave events for MultiWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1901 + # source://prism//lib/prism/dispatcher.rb#1915 def visit_multi_write_node(node); end # Dispatch enter and leave events for NextNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1907 + # source://prism//lib/prism/dispatcher.rb#1921 def visit_next_node(node); end # Dispatch enter and leave events for NilNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1913 + # source://prism//lib/prism/dispatcher.rb#1927 def visit_nil_node(node); end # Dispatch enter and leave events for NoKeywordsParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1919 + # source://prism//lib/prism/dispatcher.rb#1933 def visit_no_keywords_parameter_node(node); end # Dispatch enter and leave events for NumberedParametersNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1925 + # source://prism//lib/prism/dispatcher.rb#1939 def visit_numbered_parameters_node(node); end # Dispatch enter and leave events for NumberedReferenceReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1931 + # source://prism//lib/prism/dispatcher.rb#1945 def visit_numbered_reference_read_node(node); end # Dispatch enter and leave events for OptionalKeywordParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1937 + # source://prism//lib/prism/dispatcher.rb#1951 def visit_optional_keyword_parameter_node(node); end # Dispatch enter and leave events for OptionalParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1943 + # source://prism//lib/prism/dispatcher.rb#1957 def visit_optional_parameter_node(node); end # Dispatch enter and leave events for OrNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1949 + # source://prism//lib/prism/dispatcher.rb#1963 def visit_or_node(node); end # Dispatch enter and leave events for ParametersNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1955 + # source://prism//lib/prism/dispatcher.rb#1969 def visit_parameters_node(node); end # Dispatch enter and leave events for ParenthesesNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1961 + # source://prism//lib/prism/dispatcher.rb#1975 def visit_parentheses_node(node); end # Dispatch enter and leave events for PinnedExpressionNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1967 + # source://prism//lib/prism/dispatcher.rb#1981 def visit_pinned_expression_node(node); end # Dispatch enter and leave events for PinnedVariableNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1973 + # source://prism//lib/prism/dispatcher.rb#1987 def visit_pinned_variable_node(node); end # Dispatch enter and leave events for PostExecutionNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1979 + # source://prism//lib/prism/dispatcher.rb#1993 def visit_post_execution_node(node); end # Dispatch enter and leave events for PreExecutionNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1985 + # source://prism//lib/prism/dispatcher.rb#1999 def visit_pre_execution_node(node); end # Dispatch enter and leave events for ProgramNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1991 + # source://prism//lib/prism/dispatcher.rb#2005 def visit_program_node(node); end # Dispatch enter and leave events for RangeNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1997 + # source://prism//lib/prism/dispatcher.rb#2011 def visit_range_node(node); end # Dispatch enter and leave events for RationalNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2003 + # source://prism//lib/prism/dispatcher.rb#2017 def visit_rational_node(node); end # Dispatch enter and leave events for RedoNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2009 + # source://prism//lib/prism/dispatcher.rb#2023 def visit_redo_node(node); end # Dispatch enter and leave events for RegularExpressionNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2015 + # source://prism//lib/prism/dispatcher.rb#2029 def visit_regular_expression_node(node); end # Dispatch enter and leave events for RequiredKeywordParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2021 + # source://prism//lib/prism/dispatcher.rb#2035 def visit_required_keyword_parameter_node(node); end # Dispatch enter and leave events for RequiredParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2027 + # source://prism//lib/prism/dispatcher.rb#2041 def visit_required_parameter_node(node); end # Dispatch enter and leave events for RescueModifierNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2033 + # source://prism//lib/prism/dispatcher.rb#2047 def visit_rescue_modifier_node(node); end # Dispatch enter and leave events for RescueNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2039 + # source://prism//lib/prism/dispatcher.rb#2053 def visit_rescue_node(node); end # Dispatch enter and leave events for RestParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2045 + # source://prism//lib/prism/dispatcher.rb#2059 def visit_rest_parameter_node(node); end # Dispatch enter and leave events for RetryNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2051 + # source://prism//lib/prism/dispatcher.rb#2065 def visit_retry_node(node); end # Dispatch enter and leave events for ReturnNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2057 + # source://prism//lib/prism/dispatcher.rb#2071 def visit_return_node(node); end # Dispatch enter and leave events for SelfNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2063 + # source://prism//lib/prism/dispatcher.rb#2077 def visit_self_node(node); end # Dispatch enter and leave events for ShareableConstantNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2069 + # source://prism//lib/prism/dispatcher.rb#2083 def visit_shareable_constant_node(node); end # Dispatch enter and leave events for SingletonClassNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2075 + # source://prism//lib/prism/dispatcher.rb#2089 def visit_singleton_class_node(node); end # Dispatch enter and leave events for SourceEncodingNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2081 + # source://prism//lib/prism/dispatcher.rb#2095 def visit_source_encoding_node(node); end # Dispatch enter and leave events for SourceFileNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2087 + # source://prism//lib/prism/dispatcher.rb#2101 def visit_source_file_node(node); end # Dispatch enter and leave events for SourceLineNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2093 + # source://prism//lib/prism/dispatcher.rb#2107 def visit_source_line_node(node); end # Dispatch enter and leave events for SplatNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2099 + # source://prism//lib/prism/dispatcher.rb#2113 def visit_splat_node(node); end # Dispatch enter and leave events for StatementsNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2105 + # source://prism//lib/prism/dispatcher.rb#2119 def visit_statements_node(node); end # Dispatch enter and leave events for StringNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2111 + # source://prism//lib/prism/dispatcher.rb#2125 def visit_string_node(node); end # Dispatch enter and leave events for SuperNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2117 + # source://prism//lib/prism/dispatcher.rb#2131 def visit_super_node(node); end # Dispatch enter and leave events for SymbolNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2123 + # source://prism//lib/prism/dispatcher.rb#2137 def visit_symbol_node(node); end # Dispatch enter and leave events for TrueNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2129 + # source://prism//lib/prism/dispatcher.rb#2143 def visit_true_node(node); end # Dispatch enter and leave events for UndefNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2135 + # source://prism//lib/prism/dispatcher.rb#2149 def visit_undef_node(node); end # Dispatch enter and leave events for UnlessNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2141 + # source://prism//lib/prism/dispatcher.rb#2155 def visit_unless_node(node); end # Dispatch enter and leave events for UntilNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2147 + # source://prism//lib/prism/dispatcher.rb#2161 def visit_until_node(node); end # Dispatch enter and leave events for WhenNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2153 + # source://prism//lib/prism/dispatcher.rb#2167 def visit_when_node(node); end # Dispatch enter and leave events for WhileNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2159 + # source://prism//lib/prism/dispatcher.rb#2173 def visit_while_node(node); end # Dispatch enter and leave events for XStringNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2165 + # source://prism//lib/prism/dispatcher.rb#2179 def visit_x_string_node(node); end # Dispatch enter and leave events for YieldNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2171 + # source://prism//lib/prism/dispatcher.rb#2185 def visit_yield_node(node); end end @@ -12285,319 +12171,324 @@ class Prism::DotVisitor < ::Prism::Visitor # source://prism//lib/prism/dot_visitor.rb#2751 def visit_interpolated_x_string_node(node); end - # Visit a ItParametersNode node. + # Visit a ItLocalVariableReadNode node. # # 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 def visit_it_parameters_node(node); end # Visit a KeywordHashNode node. # - # source://prism//lib/prism/dot_visitor.rb#2798 + # 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#2828 + # 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#2856 + # 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#2894 + # 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#2924 + # 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#2957 + # 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#2987 + # 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#3007 + # 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#3027 + # 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#3057 + # 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#3086 + # 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#3111 + # 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#3136 + # 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#3167 + # 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#3181 + # 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#3217 + # 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#3273 + # 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#3336 + # 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#3359 + # 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#3373 + # 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#3393 + # 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#3410 + # 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#3427 + # 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#3454 + # 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#3484 + # 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#3509 + # 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#3593 + # 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#3619 + # 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#3646 + # 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#3667 + # 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#3696 + # 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#3725 + # 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#3746 + # 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#3778 + # 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#3796 + # 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#3810 + # 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#3839 + # 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#3862 + # 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#3882 + # 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#3907 + # 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#3960 + # 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#3988 + # 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#4002 + # 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#4028 + # source://prism//lib/prism/dot_visitor.rb#4047 def visit_self_node(node); end # Visit a ShareableConstantNode node. # - # source://prism//lib/prism/dot_visitor.rb#4042 + # source://prism//lib/prism/dot_visitor.rb#4061 def visit_shareable_constant_node(node); end # Visit a SingletonClassNode node. # - # source://prism//lib/prism/dot_visitor.rb#4063 + # source://prism//lib/prism/dot_visitor.rb#4082 def visit_singleton_class_node(node); end # Visit a SourceEncodingNode node. # - # source://prism//lib/prism/dot_visitor.rb#4099 + # source://prism//lib/prism/dot_visitor.rb#4118 def visit_source_encoding_node(node); end # Visit a SourceFileNode node. # - # source://prism//lib/prism/dot_visitor.rb#4113 + # source://prism//lib/prism/dot_visitor.rb#4132 def visit_source_file_node(node); end # Visit a SourceLineNode node. # - # source://prism//lib/prism/dot_visitor.rb#4133 + # source://prism//lib/prism/dot_visitor.rb#4152 def visit_source_line_node(node); end # Visit a SplatNode node. # - # source://prism//lib/prism/dot_visitor.rb#4147 + # source://prism//lib/prism/dot_visitor.rb#4166 def visit_splat_node(node); end # Visit a StatementsNode node. # - # source://prism//lib/prism/dot_visitor.rb#4170 + # source://prism//lib/prism/dot_visitor.rb#4189 def visit_statements_node(node); end # Visit a StringNode node. # - # source://prism//lib/prism/dot_visitor.rb#4197 + # source://prism//lib/prism/dot_visitor.rb#4216 def visit_string_node(node); end # Visit a SuperNode node. # - # source://prism//lib/prism/dot_visitor.rb#4230 + # source://prism//lib/prism/dot_visitor.rb#4249 def visit_super_node(node); end # Visit a SymbolNode node. # - # source://prism//lib/prism/dot_visitor.rb#4269 + # source://prism//lib/prism/dot_visitor.rb#4288 def visit_symbol_node(node); end # Visit a TrueNode node. # - # source://prism//lib/prism/dot_visitor.rb#4304 + # source://prism//lib/prism/dot_visitor.rb#4323 def visit_true_node(node); end # Visit a UndefNode node. # - # source://prism//lib/prism/dot_visitor.rb#4318 + # source://prism//lib/prism/dot_visitor.rb#4337 def visit_undef_node(node); end # Visit a UnlessNode node. # - # source://prism//lib/prism/dot_visitor.rb#4348 + # source://prism//lib/prism/dot_visitor.rb#4367 def visit_unless_node(node); end # Visit a UntilNode node. # - # source://prism//lib/prism/dot_visitor.rb#4391 + # source://prism//lib/prism/dot_visitor.rb#4410 def visit_until_node(node); end # Visit a WhenNode node. # - # source://prism//lib/prism/dot_visitor.rb#4426 + # source://prism//lib/prism/dot_visitor.rb#4445 def visit_when_node(node); end # Visit a WhileNode node. # - # source://prism//lib/prism/dot_visitor.rb#4467 + # source://prism//lib/prism/dot_visitor.rb#4486 def visit_while_node(node); end # Visit a XStringNode node. # - # source://prism//lib/prism/dot_visitor.rb#4502 + # source://prism//lib/prism/dot_visitor.rb#4521 def visit_x_string_node(node); end # Visit a YieldNode node. # - # source://prism//lib/prism/dot_visitor.rb#4531 + # source://prism//lib/prism/dot_visitor.rb#4550 def visit_yield_node(node); end private @@ -12605,101 +12496,101 @@ 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#4577 + # source://prism//lib/prism/dot_visitor.rb#4596 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#4586 + # 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#4594 + # 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#4605 + # 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#4614 + # 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#4625 + # 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#4634 + # 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#4571 + # source://prism//lib/prism/dot_visitor.rb#4590 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#4642 + # 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#4566 + # source://prism//lib/prism/dot_visitor.rb#4585 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#4650 + # 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#4658 + # 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#4666 + # source://prism//lib/prism/dot_visitor.rb#4685 def regular_expression_flags_inspect(node); end # Inspect a node that has return_node_flags flags to display the flags as a # comma-separated list. # - # source://prism//lib/prism/dot_visitor.rb#4684 + # source://prism//lib/prism/dot_visitor.rb#4703 def return_node_flags_inspect(node); end # Inspect a node that has shareable_constant_node_flags flags to display the flags as a # comma-separated list. # - # source://prism//lib/prism/dot_visitor.rb#4692 + # source://prism//lib/prism/dot_visitor.rb#4711 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#4702 + # source://prism//lib/prism/dot_visitor.rb#4721 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#4713 + # source://prism//lib/prism/dot_visitor.rb#4732 def symbol_flags_inspect(node); end end @@ -12793,13 +12684,13 @@ end # if a then b else c end # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#6236 +# source://prism//lib/prism/node.rb#6173 class Prism::ElseNode < ::Prism::Node # def initialize: (Location else_keyword_loc, StatementsNode? statements, Location? end_keyword_loc, Location location) -> void # # @return [ElseNode] a new instance of ElseNode # - # source://prism//lib/prism/node.rb#6237 + # source://prism//lib/prism/node.rb#6175 sig do params( source: Prism::Source, @@ -12814,36 +12705,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#6349 + # source://prism//lib/prism/node.rb#6286 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6247 + # source://prism//lib/prism/node.rb#6184 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#6252 + # source://prism//lib/prism/node.rb#6189 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#6264 + # source://prism//lib/prism/node.rb#6201 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#6257 + # source://prism//lib/prism/node.rb#6194 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?else_keyword_loc: Location, ?statements: StatementsNode?, ?end_keyword_loc: Location?, ?location: Location) -> ElseNode # - # source://prism//lib/prism/node.rb#6269 + # source://prism//lib/prism/node.rb#6206 sig do params( else_keyword_loc: Prism::Location, @@ -12857,37 +12748,37 @@ class Prism::ElseNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6252 + # source://prism//lib/prism/node.rb#6189 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { else_keyword_loc: Location, statements: StatementsNode?, end_keyword_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#6277 + # source://prism//lib/prism/node.rb#6214 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#6305 + # source://prism//lib/prism/node.rb#6242 sig { returns(String) } def else_keyword; end # attr_reader else_keyword_loc: Location # - # source://prism//lib/prism/node.rb#6282 + # source://prism//lib/prism/node.rb#6219 sig { returns(Prism::Location) } def else_keyword_loc; end # def end_keyword: () -> String? # - # source://prism//lib/prism/node.rb#6310 + # source://prism//lib/prism/node.rb#6247 sig { returns(T.nilable(String)) } def end_keyword; end # attr_reader end_keyword_loc: Location? # - # source://prism//lib/prism/node.rb#6292 + # source://prism//lib/prism/node.rb#6229 sig { returns(T.nilable(Prism::Location)) } def end_keyword_loc; end @@ -12896,13 +12787,13 @@ class Prism::ElseNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#6315 + # source://prism//lib/prism/node.rb#6252 sig { override.returns(String) } def inspect; end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#6289 + # source://prism//lib/prism/node.rb#6226 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end @@ -12921,7 +12812,7 @@ class Prism::ElseNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#6333 + # source://prism//lib/prism/node.rb#6270 sig { override.returns(Symbol) } def type; end @@ -12933,7 +12824,7 @@ class Prism::ElseNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#6343 + # source://prism//lib/prism/node.rb#6280 def type; end end end @@ -12941,7 +12832,7 @@ end # EmbDocComment objects correspond to comments that are surrounded by =begin # and =end. # -# source://prism//lib/prism/parse_result.rb#404 +# source://prism//lib/prism/parse_result.rb#403 class Prism::EmbDocComment < ::Prism::Comment # Returns a string representation of this comment. # @@ -12963,13 +12854,13 @@ end # "foo #{bar}" # ^^^^^^ # -# source://prism//lib/prism/node.rb#6362 +# source://prism//lib/prism/node.rb#6298 class Prism::EmbeddedStatementsNode < ::Prism::Node # def initialize: (Location opening_loc, StatementsNode? statements, Location closing_loc, Location location) -> void # # @return [EmbeddedStatementsNode] a new instance of EmbeddedStatementsNode # - # source://prism//lib/prism/node.rb#6363 + # source://prism//lib/prism/node.rb#6300 sig do params( source: Prism::Source, @@ -12984,48 +12875,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#6469 + # source://prism//lib/prism/node.rb#6405 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6373 + # source://prism//lib/prism/node.rb#6309 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#6378 + # source://prism//lib/prism/node.rb#6314 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#6430 + # source://prism//lib/prism/node.rb#6366 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#6418 + # source://prism//lib/prism/node.rb#6354 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#6390 + # source://prism//lib/prism/node.rb#6326 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#6383 + # source://prism//lib/prism/node.rb#6319 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?opening_loc: Location, ?statements: StatementsNode?, ?closing_loc: Location, ?location: Location) -> EmbeddedStatementsNode # - # source://prism//lib/prism/node.rb#6395 + # source://prism//lib/prism/node.rb#6331 sig do params( opening_loc: Prism::Location, @@ -13039,13 +12930,13 @@ class Prism::EmbeddedStatementsNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6378 + # source://prism//lib/prism/node.rb#6314 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { opening_loc: Location, statements: StatementsNode?, closing_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#6403 + # source://prism//lib/prism/node.rb#6339 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -13054,25 +12945,25 @@ class Prism::EmbeddedStatementsNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#6435 + # source://prism//lib/prism/node.rb#6371 sig { override.returns(String) } def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#6425 + # source://prism//lib/prism/node.rb#6361 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#6408 + # source://prism//lib/prism/node.rb#6344 sig { returns(Prism::Location) } def opening_loc; end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#6415 + # source://prism//lib/prism/node.rb#6351 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end @@ -13091,7 +12982,7 @@ class Prism::EmbeddedStatementsNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#6453 + # source://prism//lib/prism/node.rb#6389 sig { override.returns(Symbol) } def type; end @@ -13103,7 +12994,7 @@ class Prism::EmbeddedStatementsNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#6463 + # source://prism//lib/prism/node.rb#6399 def type; end end end @@ -13113,13 +13004,13 @@ end # "foo #@bar" # ^^^^^ # -# source://prism//lib/prism/node.rb#6482 +# source://prism//lib/prism/node.rb#6417 class Prism::EmbeddedVariableNode < ::Prism::Node # def initialize: (Location operator_loc, Prism::node variable, Location location) -> void # # @return [EmbeddedVariableNode] a new instance of EmbeddedVariableNode # - # source://prism//lib/prism/node.rb#6483 + # source://prism//lib/prism/node.rb#6419 sig do params( source: Prism::Source, @@ -13133,36 +13024,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#6574 + # source://prism//lib/prism/node.rb#6509 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6492 + # source://prism//lib/prism/node.rb#6427 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#6497 + # source://prism//lib/prism/node.rb#6432 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#6507 + # source://prism//lib/prism/node.rb#6442 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#6502 + # source://prism//lib/prism/node.rb#6437 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?operator_loc: Location, ?variable: Prism::node, ?location: Location) -> EmbeddedVariableNode # - # source://prism//lib/prism/node.rb#6512 + # source://prism//lib/prism/node.rb#6447 sig do params( operator_loc: Prism::Location, @@ -13175,13 +13066,13 @@ class Prism::EmbeddedVariableNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6497 + # source://prism//lib/prism/node.rb#6432 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { operator_loc: Location, variable: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#6520 + # source://prism//lib/prism/node.rb#6455 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -13190,19 +13081,19 @@ class Prism::EmbeddedVariableNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#6540 + # source://prism//lib/prism/node.rb#6475 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#6535 + # source://prism//lib/prism/node.rb#6470 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#6525 + # source://prism//lib/prism/node.rb#6460 sig { returns(Prism::Location) } def operator_loc; end @@ -13221,13 +13112,13 @@ class Prism::EmbeddedVariableNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#6558 + # source://prism//lib/prism/node.rb#6493 sig { override.returns(Symbol) } def type; end # attr_reader variable: Prism::node # - # source://prism//lib/prism/node.rb#6532 + # source://prism//lib/prism/node.rb#6467 sig { returns(Prism::Node) } def variable; end @@ -13239,24 +13130,24 @@ class Prism::EmbeddedVariableNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#6568 + # source://prism//lib/prism/node.rb#6503 def type; end end end # Flags for nodes that have unescaped content. # -# source://prism//lib/prism/node.rb#19232 +# source://prism//lib/prism/node.rb#19157 module Prism::EncodingFlags; end # internal bytes forced the encoding to binary # -# source://prism//lib/prism/node.rb#19237 +# source://prism//lib/prism/node.rb#19162 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#19234 +# source://prism//lib/prism/node.rb#19159 Prism::EncodingFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) # Represents an `ensure` clause in a `begin` statement. @@ -13268,13 +13159,13 @@ Prism::EncodingFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) # bar # end # -# source://prism//lib/prism/node.rb#6590 +# source://prism//lib/prism/node.rb#6524 class Prism::EnsureNode < ::Prism::Node # def initialize: (Location ensure_keyword_loc, StatementsNode? statements, Location end_keyword_loc, Location location) -> void # # @return [EnsureNode] a new instance of EnsureNode # - # source://prism//lib/prism/node.rb#6591 + # source://prism//lib/prism/node.rb#6526 sig do params( source: Prism::Source, @@ -13289,36 +13180,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#6697 + # source://prism//lib/prism/node.rb#6631 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6601 + # source://prism//lib/prism/node.rb#6535 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#6606 + # source://prism//lib/prism/node.rb#6540 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#6618 + # source://prism//lib/prism/node.rb#6552 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#6611 + # source://prism//lib/prism/node.rb#6545 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?ensure_keyword_loc: Location, ?statements: StatementsNode?, ?end_keyword_loc: Location, ?location: Location) -> EnsureNode # - # source://prism//lib/prism/node.rb#6623 + # source://prism//lib/prism/node.rb#6557 sig do params( ensure_keyword_loc: Prism::Location, @@ -13332,37 +13223,37 @@ class Prism::EnsureNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6606 + # source://prism//lib/prism/node.rb#6540 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { ensure_keyword_loc: Location, statements: StatementsNode?, end_keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#6631 + # source://prism//lib/prism/node.rb#6565 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#6658 + # source://prism//lib/prism/node.rb#6592 sig { returns(String) } def end_keyword; end # attr_reader end_keyword_loc: Location # - # source://prism//lib/prism/node.rb#6646 + # source://prism//lib/prism/node.rb#6580 sig { returns(Prism::Location) } def end_keyword_loc; end # def ensure_keyword: () -> String # - # source://prism//lib/prism/node.rb#6653 + # source://prism//lib/prism/node.rb#6587 sig { returns(String) } def ensure_keyword; end # attr_reader ensure_keyword_loc: Location # - # source://prism//lib/prism/node.rb#6636 + # source://prism//lib/prism/node.rb#6570 sig { returns(Prism::Location) } def ensure_keyword_loc; end @@ -13371,13 +13262,13 @@ class Prism::EnsureNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#6663 + # source://prism//lib/prism/node.rb#6597 sig { override.returns(String) } def inspect; end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#6643 + # source://prism//lib/prism/node.rb#6577 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end @@ -13396,7 +13287,7 @@ class Prism::EnsureNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#6681 + # source://prism//lib/prism/node.rb#6615 sig { override.returns(Symbol) } def type; end @@ -13408,7 +13299,7 @@ class Prism::EnsureNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#6691 + # source://prism//lib/prism/node.rb#6625 def type; end end end @@ -13418,62 +13309,62 @@ end # false # ^^^^^ # -# source://prism//lib/prism/node.rb#6710 +# source://prism//lib/prism/node.rb#6643 class Prism::FalseNode < ::Prism::Node # def initialize: (Location location) -> void # # @return [FalseNode] a new instance of FalseNode # - # source://prism//lib/prism/node.rb#6711 + # source://prism//lib/prism/node.rb#6645 sig { params(source: Prism::Source, location: Prism::Location).void } def initialize(source, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#6785 + # source://prism//lib/prism/node.rb#6718 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6718 + # source://prism//lib/prism/node.rb#6651 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#6723 + # source://prism//lib/prism/node.rb#6656 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#6733 + # source://prism//lib/prism/node.rb#6666 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#6728 + # source://prism//lib/prism/node.rb#6661 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?location: Location) -> FalseNode # - # source://prism//lib/prism/node.rb#6738 + # source://prism//lib/prism/node.rb#6671 sig { params(location: Prism::Location).returns(Prism::FalseNode) } def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6723 + # source://prism//lib/prism/node.rb#6656 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#6746 + # source://prism//lib/prism/node.rb#6679 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -13482,7 +13373,7 @@ class Prism::FalseNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#6751 + # source://prism//lib/prism/node.rb#6684 sig { override.returns(String) } def inspect; end @@ -13501,7 +13392,7 @@ class Prism::FalseNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#6769 + # source://prism//lib/prism/node.rb#6702 sig { override.returns(Symbol) } def type; end @@ -13513,7 +13404,7 @@ class Prism::FalseNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#6779 + # source://prism//lib/prism/node.rb#6712 def type; end end end @@ -13529,13 +13420,13 @@ end # foo in Foo(*bar, baz, *qux) # ^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#6801 +# source://prism//lib/prism/node.rb#6733 class Prism::FindPatternNode < ::Prism::Node # def initialize: (Prism::node? constant, Prism::node left, Array[Prism::node] requireds, Prism::node right, Location? opening_loc, Location? closing_loc, Location location) -> void # # @return [FindPatternNode] a new instance of FindPatternNode # - # source://prism//lib/prism/node.rb#6802 + # source://prism//lib/prism/node.rb#6735 sig do params( source: Prism::Source, @@ -13553,54 +13444,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#6935 + # source://prism//lib/prism/node.rb#6867 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6815 + # source://prism//lib/prism/node.rb#6747 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#6820 + # source://prism//lib/prism/node.rb#6752 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#6896 + # source://prism//lib/prism/node.rb#6828 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#6878 + # source://prism//lib/prism/node.rb#6810 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#6835 + # source://prism//lib/prism/node.rb#6767 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#6825 + # source://prism//lib/prism/node.rb#6757 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # attr_reader constant: Prism::node? # - # source://prism//lib/prism/node.rb#6853 + # source://prism//lib/prism/node.rb#6785 sig { returns(T.nilable(Prism::Node)) } def constant; end # def copy: (?constant: Prism::node?, ?left: Prism::node, ?requireds: Array[Prism::node], ?right: Prism::node, ?opening_loc: Location?, ?closing_loc: Location?, ?location: Location) -> FindPatternNode # - # source://prism//lib/prism/node.rb#6840 + # source://prism//lib/prism/node.rb#6772 sig do params( constant: T.nilable(Prism::Node), @@ -13617,13 +13508,13 @@ class Prism::FindPatternNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6820 + # source://prism//lib/prism/node.rb#6752 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { constant: Prism::node?, left: Prism::node, requireds: Array[Prism::node], right: Prism::node, opening_loc: Location?, closing_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#6848 + # source://prism//lib/prism/node.rb#6780 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -13632,37 +13523,37 @@ class Prism::FindPatternNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#6901 + # source://prism//lib/prism/node.rb#6833 sig { override.returns(String) } def inspect; end # attr_reader left: Prism::node # - # source://prism//lib/prism/node.rb#6856 + # source://prism//lib/prism/node.rb#6788 sig { returns(Prism::Node) } def left; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#6891 + # source://prism//lib/prism/node.rb#6823 sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#6865 + # source://prism//lib/prism/node.rb#6797 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end # attr_reader requireds: Array[Prism::node] # - # source://prism//lib/prism/node.rb#6859 + # source://prism//lib/prism/node.rb#6791 sig { returns(T::Array[Prism::Node]) } def requireds; end # attr_reader right: Prism::node # - # source://prism//lib/prism/node.rb#6862 + # source://prism//lib/prism/node.rb#6794 sig { returns(Prism::Node) } def right; end @@ -13681,7 +13572,7 @@ class Prism::FindPatternNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#6919 + # source://prism//lib/prism/node.rb#6851 sig { override.returns(Symbol) } def type; end @@ -13693,7 +13584,7 @@ class Prism::FindPatternNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#6929 + # source://prism//lib/prism/node.rb#6861 def type; end end end @@ -13703,13 +13594,13 @@ end # baz if foo .. bar # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#6952 +# source://prism//lib/prism/node.rb#6883 class Prism::FlipFlopNode < ::Prism::Node # def initialize: (Integer flags, Prism::node? left, Prism::node? right, Location operator_loc, Location location) -> void # # @return [FlipFlopNode] a new instance of FlipFlopNode # - # source://prism//lib/prism/node.rb#6953 + # source://prism//lib/prism/node.rb#6885 sig do params( source: Prism::Source, @@ -13725,36 +13616,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#7061 + # source://prism//lib/prism/node.rb#6992 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6964 + # source://prism//lib/prism/node.rb#6895 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#6969 + # source://prism//lib/prism/node.rb#6900 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#6982 + # source://prism//lib/prism/node.rb#6913 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#6974 + # source://prism//lib/prism/node.rb#6905 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?left: Prism::node?, ?right: Prism::node?, ?operator_loc: Location, ?location: Location) -> FlipFlopNode # - # source://prism//lib/prism/node.rb#6987 + # source://prism//lib/prism/node.rb#6918 sig do params( flags: Integer, @@ -13769,13 +13660,13 @@ class Prism::FlipFlopNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6969 + # source://prism//lib/prism/node.rb#6900 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, left: Prism::node?, right: Prism::node?, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#6995 + # source://prism//lib/prism/node.rb#6926 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -13783,7 +13674,7 @@ class Prism::FlipFlopNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#7017 + # source://prism//lib/prism/node.rb#6948 sig { returns(T::Boolean) } def exclude_end?; end @@ -13792,31 +13683,31 @@ class Prism::FlipFlopNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#7027 + # source://prism//lib/prism/node.rb#6958 sig { override.returns(String) } def inspect; end # attr_reader left: Prism::node? # - # source://prism//lib/prism/node.rb#7004 + # source://prism//lib/prism/node.rb#6935 sig { returns(T.nilable(Prism::Node)) } def left; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#7022 + # source://prism//lib/prism/node.rb#6953 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#7010 + # source://prism//lib/prism/node.rb#6941 sig { returns(Prism::Location) } def operator_loc; end # attr_reader right: Prism::node? # - # source://prism//lib/prism/node.rb#7007 + # source://prism//lib/prism/node.rb#6938 sig { returns(T.nilable(Prism::Node)) } def right; end @@ -13835,7 +13726,7 @@ class Prism::FlipFlopNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#7045 + # source://prism//lib/prism/node.rb#6976 sig { override.returns(Symbol) } def type; end @@ -13843,7 +13734,7 @@ class Prism::FlipFlopNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#7000 + # source://prism//lib/prism/node.rb#6931 sig { returns(Integer) } def flags; end @@ -13855,7 +13746,7 @@ class Prism::FlipFlopNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#7055 + # source://prism//lib/prism/node.rb#6986 def type; end end end @@ -13865,62 +13756,62 @@ end # 1.0 # ^^^ # -# source://prism//lib/prism/node.rb#7075 +# source://prism//lib/prism/node.rb#7005 class Prism::FloatNode < ::Prism::Node # def initialize: (Float value, Location location) -> void # # @return [FloatNode] a new instance of FloatNode # - # source://prism//lib/prism/node.rb#7076 + # source://prism//lib/prism/node.rb#7007 sig { params(source: Prism::Source, value: Float, location: Prism::Location).void } def initialize(source, value, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#7154 + # source://prism//lib/prism/node.rb#7084 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7084 + # source://prism//lib/prism/node.rb#7014 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#7089 + # source://prism//lib/prism/node.rb#7019 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#7099 + # source://prism//lib/prism/node.rb#7029 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#7094 + # source://prism//lib/prism/node.rb#7024 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?value: Float, ?location: Location) -> FloatNode # - # source://prism//lib/prism/node.rb#7104 + # source://prism//lib/prism/node.rb#7034 sig { params(value: Float, location: Prism::Location).returns(Prism::FloatNode) } def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7089 + # source://prism//lib/prism/node.rb#7019 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { value: Float, location: Location } # - # source://prism//lib/prism/node.rb#7112 + # source://prism//lib/prism/node.rb#7042 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -13929,7 +13820,7 @@ class Prism::FloatNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#7120 + # source://prism//lib/prism/node.rb#7050 sig { override.returns(String) } def inspect; end @@ -13948,13 +13839,13 @@ class Prism::FloatNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#7138 + # source://prism//lib/prism/node.rb#7068 sig { override.returns(Symbol) } def type; end # The value of the floating point number as a Float. # - # source://prism//lib/prism/node.rb#7117 + # source://prism//lib/prism/node.rb#7047 sig { returns(Float) } def value; end @@ -13966,7 +13857,7 @@ class Prism::FloatNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#7148 + # source://prism//lib/prism/node.rb#7078 def type; end end end @@ -13976,13 +13867,13 @@ end # for i in a end # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#7165 +# source://prism//lib/prism/node.rb#7094 class Prism::ForNode < ::Prism::Node # def initialize: (Prism::node index, Prism::node collection, StatementsNode? statements, Location for_keyword_loc, Location in_keyword_loc, Location? do_keyword_loc, Location end_keyword_loc, Location location) -> void # # @return [ForNode] a new instance of ForNode # - # source://prism//lib/prism/node.rb#7166 + # source://prism//lib/prism/node.rb#7096 sig do params( source: Prism::Source, @@ -14001,42 +13892,45 @@ 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#7314 + # source://prism//lib/prism/node.rb#7266 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7180 + # source://prism//lib/prism/node.rb#7109 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#7185 + # source://prism//lib/prism/node.rb#7114 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # attr_reader collection: Prism::node + # The collection to iterate over. + # + # for i in a end + # ^ # - # source://prism//lib/prism/node.rb#7220 + # source://prism//lib/prism/node.rb#7155 sig { returns(Prism::Node) } def collection; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#7199 + # source://prism//lib/prism/node.rb#7128 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#7190 + # source://prism//lib/prism/node.rb#7119 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?index: Prism::node, ?collection: Prism::node, ?statements: StatementsNode?, ?for_keyword_loc: Location, ?in_keyword_loc: Location, ?do_keyword_loc: Location?, ?end_keyword_loc: Location, ?location: Location) -> ForNode # - # source://prism//lib/prism/node.rb#7204 + # source://prism//lib/prism/node.rb#7133 sig do params( index: Prism::Node, @@ -14054,37 +13948,43 @@ class Prism::ForNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7185 + # source://prism//lib/prism/node.rb#7114 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { index: Prism::node, collection: Prism::node, statements: StatementsNode?, for_keyword_loc: Location, in_keyword_loc: Location, do_keyword_loc: Location?, end_keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#7212 + # source://prism//lib/prism/node.rb#7141 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#7270 + # source://prism//lib/prism/node.rb#7222 sig { returns(T.nilable(String)) } def do_keyword; end - # attr_reader do_keyword_loc: Location? + # The location of the `do` keyword, if present. # - # source://prism//lib/prism/node.rb#7240 + # for i in a do end + # ^^ + # + # source://prism//lib/prism/node.rb#7189 sig { returns(T.nilable(Prism::Location)) } def do_keyword_loc; end # def end_keyword: () -> String # - # source://prism//lib/prism/node.rb#7275 + # source://prism//lib/prism/node.rb#7227 sig { returns(String) } def end_keyword; end - # attr_reader end_keyword_loc: Location + # The location of the `end` keyword. # - # source://prism//lib/prism/node.rb#7253 + # for i in a end + # ^^^ + # + # source://prism//lib/prism/node.rb#7205 sig { returns(Prism::Location) } def end_keyword_loc; end @@ -14093,43 +13993,57 @@ class Prism::ForNode < ::Prism::Node # def for_keyword: () -> String # - # source://prism//lib/prism/node.rb#7260 + # source://prism//lib/prism/node.rb#7212 sig { returns(String) } def for_keyword; end - # attr_reader for_keyword_loc: Location + # The location of the `for` keyword. # - # source://prism//lib/prism/node.rb#7226 + # for i in a end + # ^^^ + # + # source://prism//lib/prism/node.rb#7169 sig { returns(Prism::Location) } def for_keyword_loc; end # def in_keyword: () -> String # - # source://prism//lib/prism/node.rb#7265 + # source://prism//lib/prism/node.rb#7217 sig { returns(String) } def in_keyword; end - # attr_reader in_keyword_loc: Location + # The location of the `in` keyword. + # + # for i in a end + # ^^ # - # source://prism//lib/prism/node.rb#7233 + # source://prism//lib/prism/node.rb#7179 sig { returns(Prism::Location) } def in_keyword_loc; end - # attr_reader index: Prism::node + # The index expression for `for` loops. # - # source://prism//lib/prism/node.rb#7217 + # for i in a end + # ^ + # + # source://prism//lib/prism/node.rb#7149 sig { returns(Prism::Node) } def index; end # def inspect -> String # - # source://prism//lib/prism/node.rb#7280 + # source://prism//lib/prism/node.rb#7232 sig { override.returns(String) } def inspect; end - # attr_reader statements: StatementsNode? + # Represents the body of statements to execute for each iteration of the loop. + # + # for i in a + # foo(i) + # ^^^^^^ + # end # - # source://prism//lib/prism/node.rb#7223 + # source://prism//lib/prism/node.rb#7163 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end @@ -14148,7 +14062,7 @@ class Prism::ForNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#7298 + # source://prism//lib/prism/node.rb#7250 sig { override.returns(Symbol) } def type; end @@ -14160,7 +14074,7 @@ class Prism::ForNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#7308 + # source://prism//lib/prism/node.rb#7260 def type; end end end @@ -14172,62 +14086,62 @@ end # ^^^ # end # -# source://prism//lib/prism/node.rb#7333 +# source://prism//lib/prism/node.rb#7284 class Prism::ForwardingArgumentsNode < ::Prism::Node # def initialize: (Location location) -> void # # @return [ForwardingArgumentsNode] a new instance of ForwardingArgumentsNode # - # source://prism//lib/prism/node.rb#7334 + # source://prism//lib/prism/node.rb#7286 sig { params(source: Prism::Source, location: Prism::Location).void } def initialize(source, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#7408 + # source://prism//lib/prism/node.rb#7359 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7341 + # source://prism//lib/prism/node.rb#7292 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#7346 + # source://prism//lib/prism/node.rb#7297 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#7356 + # source://prism//lib/prism/node.rb#7307 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#7351 + # source://prism//lib/prism/node.rb#7302 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?location: Location) -> ForwardingArgumentsNode # - # source://prism//lib/prism/node.rb#7361 + # source://prism//lib/prism/node.rb#7312 sig { params(location: Prism::Location).returns(Prism::ForwardingArgumentsNode) } def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7346 + # source://prism//lib/prism/node.rb#7297 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#7369 + # source://prism//lib/prism/node.rb#7320 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -14236,7 +14150,7 @@ class Prism::ForwardingArgumentsNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#7374 + # source://prism//lib/prism/node.rb#7325 sig { override.returns(String) } def inspect; end @@ -14255,7 +14169,7 @@ class Prism::ForwardingArgumentsNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#7392 + # source://prism//lib/prism/node.rb#7343 sig { override.returns(Symbol) } def type; end @@ -14267,7 +14181,7 @@ class Prism::ForwardingArgumentsNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#7402 + # source://prism//lib/prism/node.rb#7353 def type; end end end @@ -14278,62 +14192,62 @@ end # ^^^ # end # -# source://prism//lib/prism/node.rb#7419 +# source://prism//lib/prism/node.rb#7369 class Prism::ForwardingParameterNode < ::Prism::Node # def initialize: (Location location) -> void # # @return [ForwardingParameterNode] a new instance of ForwardingParameterNode # - # source://prism//lib/prism/node.rb#7420 + # source://prism//lib/prism/node.rb#7371 sig { params(source: Prism::Source, location: Prism::Location).void } def initialize(source, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#7494 + # source://prism//lib/prism/node.rb#7444 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7427 + # source://prism//lib/prism/node.rb#7377 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#7432 + # source://prism//lib/prism/node.rb#7382 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#7442 + # source://prism//lib/prism/node.rb#7392 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#7437 + # source://prism//lib/prism/node.rb#7387 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?location: Location) -> ForwardingParameterNode # - # source://prism//lib/prism/node.rb#7447 + # source://prism//lib/prism/node.rb#7397 sig { params(location: Prism::Location).returns(Prism::ForwardingParameterNode) } def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7432 + # source://prism//lib/prism/node.rb#7382 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#7455 + # source://prism//lib/prism/node.rb#7405 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -14342,7 +14256,7 @@ class Prism::ForwardingParameterNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#7460 + # source://prism//lib/prism/node.rb#7410 sig { override.returns(String) } def inspect; end @@ -14361,7 +14275,7 @@ class Prism::ForwardingParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#7478 + # source://prism//lib/prism/node.rb#7428 sig { override.returns(Symbol) } def type; end @@ -14373,7 +14287,7 @@ class Prism::ForwardingParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#7488 + # source://prism//lib/prism/node.rb#7438 def type; end end end @@ -14383,68 +14297,68 @@ end # super # ^^^^^ # -# source://prism//lib/prism/node.rb#7504 +# source://prism//lib/prism/node.rb#7453 class Prism::ForwardingSuperNode < ::Prism::Node # def initialize: (BlockNode? block, Location location) -> void # # @return [ForwardingSuperNode] a new instance of ForwardingSuperNode # - # source://prism//lib/prism/node.rb#7505 + # source://prism//lib/prism/node.rb#7455 sig { params(source: Prism::Source, block: T.nilable(Prism::BlockNode), location: Prism::Location).void } def initialize(source, block, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#7585 + # source://prism//lib/prism/node.rb#7534 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7513 + # source://prism//lib/prism/node.rb#7462 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader block: BlockNode? # - # source://prism//lib/prism/node.rb#7548 + # source://prism//lib/prism/node.rb#7497 sig { returns(T.nilable(Prism::BlockNode)) } def block; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7518 + # source://prism//lib/prism/node.rb#7467 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#7530 + # source://prism//lib/prism/node.rb#7479 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#7523 + # source://prism//lib/prism/node.rb#7472 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?block: BlockNode?, ?location: Location) -> ForwardingSuperNode # - # source://prism//lib/prism/node.rb#7535 + # source://prism//lib/prism/node.rb#7484 sig { params(block: T.nilable(Prism::BlockNode), location: Prism::Location).returns(Prism::ForwardingSuperNode) } def copy(block: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7518 + # source://prism//lib/prism/node.rb#7467 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { block: BlockNode?, location: Location } # - # source://prism//lib/prism/node.rb#7543 + # source://prism//lib/prism/node.rb#7492 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -14453,7 +14367,7 @@ class Prism::ForwardingSuperNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#7551 + # source://prism//lib/prism/node.rb#7500 sig { override.returns(String) } def inspect; end @@ -14472,7 +14386,7 @@ class Prism::ForwardingSuperNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#7569 + # source://prism//lib/prism/node.rb#7518 sig { override.returns(Symbol) } def type; end @@ -14484,7 +14398,7 @@ class Prism::ForwardingSuperNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#7579 + # source://prism//lib/prism/node.rb#7528 def type; end end end @@ -14494,13 +14408,13 @@ end # $target &&= value # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#7596 +# source://prism//lib/prism/node.rb#7544 class Prism::GlobalVariableAndWriteNode < ::Prism::Node # def initialize: (Symbol name, Location name_loc, Location operator_loc, Prism::node value, Location location) -> void # # @return [GlobalVariableAndWriteNode] a new instance of GlobalVariableAndWriteNode # - # source://prism//lib/prism/node.rb#7597 + # source://prism//lib/prism/node.rb#7546 sig do params( source: Prism::Source, @@ -14516,36 +14430,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#7700 + # source://prism//lib/prism/node.rb#7648 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7608 + # source://prism//lib/prism/node.rb#7556 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#7613 + # source://prism//lib/prism/node.rb#7561 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#7623 + # source://prism//lib/prism/node.rb#7571 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#7618 + # source://prism//lib/prism/node.rb#7566 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> GlobalVariableAndWriteNode # - # source://prism//lib/prism/node.rb#7628 + # source://prism//lib/prism/node.rb#7576 sig do params( name: Symbol, @@ -14560,13 +14474,13 @@ class Prism::GlobalVariableAndWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7613 + # source://prism//lib/prism/node.rb#7561 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#7636 + # source://prism//lib/prism/node.rb#7584 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -14578,31 +14492,31 @@ class Prism::GlobalVariableAndWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#7666 + # source://prism//lib/prism/node.rb#7614 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#7641 + # source://prism//lib/prism/node.rb#7589 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#7644 + # source://prism//lib/prism/node.rb#7592 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#7661 + # source://prism//lib/prism/node.rb#7609 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#7651 + # source://prism//lib/prism/node.rb#7599 sig { returns(Prism::Location) } def operator_loc; end @@ -14621,13 +14535,13 @@ class Prism::GlobalVariableAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#7684 + # source://prism//lib/prism/node.rb#7632 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#7658 + # source://prism//lib/prism/node.rb#7606 sig { returns(Prism::Node) } def value; end @@ -14639,7 +14553,7 @@ class Prism::GlobalVariableAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#7694 + # source://prism//lib/prism/node.rb#7642 def type; end end end @@ -14649,13 +14563,13 @@ end # $target += value # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#7714 +# source://prism//lib/prism/node.rb#7661 class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node # def initialize: (Symbol name, Location name_loc, Location binary_operator_loc, Prism::node value, Symbol binary_operator, Location location) -> void # # @return [GlobalVariableOperatorWriteNode] a new instance of GlobalVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#7715 + # source://prism//lib/prism/node.rb#7663 sig do params( source: Prism::Source, @@ -14672,48 +14586,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#7817 + # source://prism//lib/prism/node.rb#7764 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7727 + # source://prism//lib/prism/node.rb#7674 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader binary_operator: Symbol # - # source://prism//lib/prism/node.rb#7780 + # source://prism//lib/prism/node.rb#7727 sig { returns(Symbol) } def binary_operator; end # attr_reader binary_operator_loc: Location # - # source://prism//lib/prism/node.rb#7770 + # source://prism//lib/prism/node.rb#7717 sig { returns(Prism::Location) } def binary_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7732 + # source://prism//lib/prism/node.rb#7679 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#7742 + # source://prism//lib/prism/node.rb#7689 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#7737 + # source://prism//lib/prism/node.rb#7684 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol, ?location: Location) -> GlobalVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#7747 + # source://prism//lib/prism/node.rb#7694 sig do params( name: Symbol, @@ -14729,13 +14643,13 @@ class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7732 + # source://prism//lib/prism/node.rb#7679 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#7755 + # source://prism//lib/prism/node.rb#7702 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -14747,32 +14661,32 @@ class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#7783 + # source://prism//lib/prism/node.rb#7730 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#7760 + # source://prism//lib/prism/node.rb#7707 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#7763 + # source://prism//lib/prism/node.rb#7710 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#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#378 + # source://prism//lib/prism/node_ext.rb#394 def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -14790,13 +14704,13 @@ class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#7801 + # source://prism//lib/prism/node.rb#7748 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#7777 + # source://prism//lib/prism/node.rb#7724 sig { returns(Prism::Node) } def value; end @@ -14808,7 +14722,7 @@ class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#7811 + # source://prism//lib/prism/node.rb#7758 def type; end end end @@ -14818,13 +14732,13 @@ end # $target ||= value # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#7832 +# source://prism//lib/prism/node.rb#7778 class Prism::GlobalVariableOrWriteNode < ::Prism::Node # def initialize: (Symbol name, Location name_loc, Location operator_loc, Prism::node value, Location location) -> void # # @return [GlobalVariableOrWriteNode] a new instance of GlobalVariableOrWriteNode # - # source://prism//lib/prism/node.rb#7833 + # source://prism//lib/prism/node.rb#7780 sig do params( source: Prism::Source, @@ -14840,36 +14754,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#7936 + # source://prism//lib/prism/node.rb#7882 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7844 + # source://prism//lib/prism/node.rb#7790 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#7795 sig { 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#7805 sig { override.returns(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#7800 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> GlobalVariableOrWriteNode # - # source://prism//lib/prism/node.rb#7864 + # source://prism//lib/prism/node.rb#7810 sig do params( name: Symbol, @@ -14884,13 +14798,13 @@ class Prism::GlobalVariableOrWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7849 + # source://prism//lib/prism/node.rb#7795 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#7872 + # source://prism//lib/prism/node.rb#7818 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -14902,31 +14816,31 @@ class Prism::GlobalVariableOrWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#7902 + # source://prism//lib/prism/node.rb#7848 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#7877 + # source://prism//lib/prism/node.rb#7823 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#7880 + # source://prism//lib/prism/node.rb#7826 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#7897 + # source://prism//lib/prism/node.rb#7843 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#7887 + # source://prism//lib/prism/node.rb#7833 sig { returns(Prism::Location) } def operator_loc; end @@ -14945,13 +14859,13 @@ class Prism::GlobalVariableOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#7920 + # source://prism//lib/prism/node.rb#7866 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#7894 + # source://prism//lib/prism/node.rb#7840 sig { returns(Prism::Node) } def value; end @@ -14963,7 +14877,7 @@ class Prism::GlobalVariableOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#7930 + # source://prism//lib/prism/node.rb#7876 def type; end end end @@ -14973,62 +14887,62 @@ end # $foo # ^^^^ # -# source://prism//lib/prism/node.rb#7950 +# source://prism//lib/prism/node.rb#7895 class Prism::GlobalVariableReadNode < ::Prism::Node # def initialize: (Symbol name, Location location) -> void # # @return [GlobalVariableReadNode] a new instance of GlobalVariableReadNode # - # source://prism//lib/prism/node.rb#7951 + # source://prism//lib/prism/node.rb#7897 sig { params(source: Prism::Source, name: Symbol, location: Prism::Location).void } def initialize(source, name, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#8033 + # source://prism//lib/prism/node.rb#7978 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7959 + # source://prism//lib/prism/node.rb#7904 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#7964 + # source://prism//lib/prism/node.rb#7909 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#7974 + # source://prism//lib/prism/node.rb#7919 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#7969 + # source://prism//lib/prism/node.rb#7914 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?location: Location) -> GlobalVariableReadNode # - # source://prism//lib/prism/node.rb#7979 + # source://prism//lib/prism/node.rb#7924 sig { params(name: Symbol, location: Prism::Location).returns(Prism::GlobalVariableReadNode) } def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7964 + # source://prism//lib/prism/node.rb#7909 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#7987 + # source://prism//lib/prism/node.rb#7932 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -15037,7 +14951,7 @@ class Prism::GlobalVariableReadNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#7999 + # source://prism//lib/prism/node.rb#7944 sig { override.returns(String) } def inspect; end @@ -15047,7 +14961,7 @@ class Prism::GlobalVariableReadNode < ::Prism::Node # # $_Test # name `:$_Test` # - # source://prism//lib/prism/node.rb#7996 + # source://prism//lib/prism/node.rb#7941 sig { returns(Symbol) } def name; end @@ -15066,7 +14980,7 @@ class Prism::GlobalVariableReadNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#8017 + # source://prism//lib/prism/node.rb#7962 sig { override.returns(Symbol) } def type; end @@ -15078,7 +14992,7 @@ class Prism::GlobalVariableReadNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#8027 + # source://prism//lib/prism/node.rb#7972 def type; end end end @@ -15088,62 +15002,62 @@ end # $foo, $bar = baz # ^^^^ ^^^^ # -# source://prism//lib/prism/node.rb#8044 +# source://prism//lib/prism/node.rb#7988 class Prism::GlobalVariableTargetNode < ::Prism::Node # def initialize: (Symbol name, Location location) -> void # # @return [GlobalVariableTargetNode] a new instance of GlobalVariableTargetNode # - # source://prism//lib/prism/node.rb#8045 + # source://prism//lib/prism/node.rb#7990 sig { params(source: Prism::Source, name: Symbol, location: Prism::Location).void } def initialize(source, name, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#8123 + # source://prism//lib/prism/node.rb#8067 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8053 + # source://prism//lib/prism/node.rb#7997 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#8058 + # source://prism//lib/prism/node.rb#8002 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#8068 + # source://prism//lib/prism/node.rb#8012 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#8063 + # source://prism//lib/prism/node.rb#8007 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?location: Location) -> GlobalVariableTargetNode # - # source://prism//lib/prism/node.rb#8073 + # source://prism//lib/prism/node.rb#8017 sig { params(name: Symbol, location: Prism::Location).returns(Prism::GlobalVariableTargetNode) } def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8058 + # source://prism//lib/prism/node.rb#8002 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#8081 + # source://prism//lib/prism/node.rb#8025 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -15152,13 +15066,13 @@ class Prism::GlobalVariableTargetNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#8089 + # source://prism//lib/prism/node.rb#8033 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#8086 + # source://prism//lib/prism/node.rb#8030 sig { returns(Symbol) } def name; end @@ -15177,7 +15091,7 @@ class Prism::GlobalVariableTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#8107 + # source://prism//lib/prism/node.rb#8051 sig { override.returns(Symbol) } def type; end @@ -15189,7 +15103,7 @@ class Prism::GlobalVariableTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#8117 + # source://prism//lib/prism/node.rb#8061 def type; end end end @@ -15199,13 +15113,13 @@ end # $foo = 1 # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#8134 +# source://prism//lib/prism/node.rb#8077 class Prism::GlobalVariableWriteNode < ::Prism::Node # def initialize: (Symbol name, Location name_loc, Prism::node value, Location operator_loc, Location location) -> void # # @return [GlobalVariableWriteNode] a new instance of GlobalVariableWriteNode # - # source://prism//lib/prism/node.rb#8135 + # source://prism//lib/prism/node.rb#8079 sig do params( source: Prism::Source, @@ -15221,36 +15135,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#8254 + # source://prism//lib/prism/node.rb#8197 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8146 + # source://prism//lib/prism/node.rb#8089 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#8151 + # source://prism//lib/prism/node.rb#8094 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#8161 + # source://prism//lib/prism/node.rb#8104 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#8156 + # source://prism//lib/prism/node.rb#8099 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location, ?location: Location) -> GlobalVariableWriteNode # - # source://prism//lib/prism/node.rb#8166 + # source://prism//lib/prism/node.rb#8109 sig do params( name: Symbol, @@ -15265,13 +15179,13 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8151 + # source://prism//lib/prism/node.rb#8094 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#8174 + # source://prism//lib/prism/node.rb#8117 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -15280,7 +15194,7 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#8220 + # source://prism//lib/prism/node.rb#8163 sig { override.returns(String) } def inspect; end @@ -15290,7 +15204,7 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node # # $_Test = 123 # name `:$_Test` # - # source://prism//lib/prism/node.rb#8183 + # source://prism//lib/prism/node.rb#8126 sig { returns(Symbol) } def name; end @@ -15299,13 +15213,13 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node # $foo = :bar # ^^^^ # - # source://prism//lib/prism/node.rb#8189 + # source://prism//lib/prism/node.rb#8132 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#8215 + # source://prism//lib/prism/node.rb#8158 sig { returns(String) } def operator; end @@ -15314,7 +15228,7 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node # $foo = :bar # ^ # - # source://prism//lib/prism/node.rb#8208 + # source://prism//lib/prism/node.rb#8151 sig { returns(Prism::Location) } def operator_loc; end @@ -15333,7 +15247,7 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#8238 + # source://prism//lib/prism/node.rb#8181 sig { override.returns(Symbol) } def type; end @@ -15345,7 +15259,7 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node # $-xyz = 123 # ^^^ # - # source://prism//lib/prism/node.rb#8202 + # source://prism//lib/prism/node.rb#8145 sig { returns(Prism::Node) } def value; end @@ -15357,7 +15271,7 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#8248 + # source://prism//lib/prism/node.rb#8191 def type; end end end @@ -15367,13 +15281,13 @@ end # { a => b } # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#8268 +# source://prism//lib/prism/node.rb#8210 class Prism::HashNode < ::Prism::Node # def initialize: (Location opening_loc, Array[AssocNode | AssocSplatNode] elements, Location closing_loc, Location location) -> void # # @return [HashNode] a new instance of HashNode # - # source://prism//lib/prism/node.rb#8269 + # source://prism//lib/prism/node.rb#8212 sig do params( source: Prism::Source, @@ -15388,24 +15302,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#8385 + # source://prism//lib/prism/node.rb#8327 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8279 + # source://prism//lib/prism/node.rb#8221 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#8284 + # source://prism//lib/prism/node.rb#8226 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#8346 + # source://prism//lib/prism/node.rb#8288 sig { returns(String) } def closing; end @@ -15414,25 +15328,25 @@ class Prism::HashNode < ::Prism::Node # { a => b } # ^ # - # source://prism//lib/prism/node.rb#8334 + # source://prism//lib/prism/node.rb#8276 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#8294 + # source://prism//lib/prism/node.rb#8236 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#8289 + # source://prism//lib/prism/node.rb#8231 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?opening_loc: Location, ?elements: Array[AssocNode | AssocSplatNode], ?closing_loc: Location, ?location: Location) -> HashNode # - # source://prism//lib/prism/node.rb#8299 + # source://prism//lib/prism/node.rb#8241 sig do params( opening_loc: Prism::Location, @@ -15446,13 +15360,13 @@ class Prism::HashNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8284 + # source://prism//lib/prism/node.rb#8226 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { opening_loc: Location, elements: Array[AssocNode | AssocSplatNode], closing_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#8307 + # source://prism//lib/prism/node.rb#8249 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -15464,7 +15378,7 @@ class Prism::HashNode < ::Prism::Node # { **foo } # ^^^^^ # - # source://prism//lib/prism/node.rb#8328 + # source://prism//lib/prism/node.rb#8270 sig { returns(T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)]) } def elements; end @@ -15473,13 +15387,13 @@ class Prism::HashNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#8351 + # source://prism//lib/prism/node.rb#8293 sig { override.returns(String) } def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#8341 + # source://prism//lib/prism/node.rb#8283 sig { returns(String) } def opening; end @@ -15488,7 +15402,7 @@ class Prism::HashNode < ::Prism::Node # { a => b } # ^ # - # source://prism//lib/prism/node.rb#8315 + # source://prism//lib/prism/node.rb#8257 sig { returns(Prism::Location) } def opening_loc; end @@ -15507,7 +15421,7 @@ class Prism::HashNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#8369 + # source://prism//lib/prism/node.rb#8311 sig { override.returns(Symbol) } def type; end @@ -15519,7 +15433,7 @@ class Prism::HashNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#8379 + # source://prism//lib/prism/node.rb#8321 def type; end end end @@ -15532,13 +15446,13 @@ end # foo => { a: 1, b: 2, **c } # ^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#8402 +# source://prism//lib/prism/node.rb#8343 class Prism::HashPatternNode < ::Prism::Node # def initialize: (Prism::node? constant, Array[AssocNode] elements, AssocSplatNode | NoKeywordsParameterNode | nil rest, Location? opening_loc, Location? closing_loc, Location location) -> void # # @return [HashPatternNode] a new instance of HashPatternNode # - # source://prism//lib/prism/node.rb#8403 + # source://prism//lib/prism/node.rb#8345 sig do params( source: Prism::Source, @@ -15555,54 +15469,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#8531 + # source://prism//lib/prism/node.rb#8472 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8415 + # source://prism//lib/prism/node.rb#8356 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#8420 + # source://prism//lib/prism/node.rb#8361 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#8492 + # source://prism//lib/prism/node.rb#8433 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#8474 + # source://prism//lib/prism/node.rb#8415 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#8434 + # source://prism//lib/prism/node.rb#8375 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#8425 + # source://prism//lib/prism/node.rb#8366 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # attr_reader constant: Prism::node? # - # source://prism//lib/prism/node.rb#8452 + # source://prism//lib/prism/node.rb#8393 sig { returns(T.nilable(Prism::Node)) } def constant; end # def copy: (?constant: Prism::node?, ?elements: Array[AssocNode], ?rest: AssocSplatNode | NoKeywordsParameterNode | nil, ?opening_loc: Location?, ?closing_loc: Location?, ?location: Location) -> HashPatternNode # - # source://prism//lib/prism/node.rb#8439 + # source://prism//lib/prism/node.rb#8380 sig do params( constant: T.nilable(Prism::Node), @@ -15618,19 +15532,19 @@ class Prism::HashPatternNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8420 + # source://prism//lib/prism/node.rb#8361 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { constant: Prism::node?, elements: Array[AssocNode], rest: AssocSplatNode | NoKeywordsParameterNode | nil, opening_loc: Location?, closing_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#8447 + # source://prism//lib/prism/node.rb#8388 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#8455 + # source://prism//lib/prism/node.rb#8396 sig { returns(T::Array[Prism::AssocNode]) } def elements; end @@ -15639,25 +15553,25 @@ class Prism::HashPatternNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#8497 + # source://prism//lib/prism/node.rb#8438 sig { override.returns(String) } def inspect; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#8487 + # source://prism//lib/prism/node.rb#8428 sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#8461 + # source://prism//lib/prism/node.rb#8402 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end # attr_reader rest: AssocSplatNode | NoKeywordsParameterNode | nil # - # source://prism//lib/prism/node.rb#8458 + # source://prism//lib/prism/node.rb#8399 sig { returns(T.nilable(T.any(Prism::AssocSplatNode, Prism::NoKeywordsParameterNode))) } def rest; end @@ -15676,7 +15590,7 @@ class Prism::HashPatternNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#8515 + # source://prism//lib/prism/node.rb#8456 sig { override.returns(Symbol) } def type; end @@ -15688,18 +15602,18 @@ class Prism::HashPatternNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#8525 + # source://prism//lib/prism/node.rb#8466 def type; end end end -# source://prism//lib/prism/node_ext.rb#46 +# source://prism//lib/prism/node_ext.rb#49 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#48 + # source://prism//lib/prism/node_ext.rb#51 def heredoc?; end end @@ -15714,13 +15628,13 @@ end # foo ? bar : baz # ^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#8553 +# source://prism//lib/prism/node.rb#8493 class Prism::IfNode < ::Prism::Node # def initialize: (Location? if_keyword_loc, Prism::node predicate, Location? then_keyword_loc, StatementsNode? statements, Prism::node? consequent, Location? end_keyword_loc, Location location) -> void # # @return [IfNode] a new instance of IfNode # - # source://prism//lib/prism/node.rb#8554 + # source://prism//lib/prism/node.rb#8495 sig do params( source: Prism::Source, @@ -15738,30 +15652,30 @@ 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#8751 + # source://prism//lib/prism/node.rb#8687 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8567 + # source://prism//lib/prism/node.rb#8507 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#8576 + # source://prism//lib/prism/node.rb#8512 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#8590 + # source://prism//lib/prism/node.rb#8526 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#8581 + # source://prism//lib/prism/node.rb#8517 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end @@ -15779,13 +15693,13 @@ class Prism::IfNode < ::Prism::Node # if foo then bar else baz end # ^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#8681 + # source://prism//lib/prism/node.rb#8617 sig { returns(T.nilable(Prism::Node)) } def consequent; end # def copy: (?if_keyword_loc: Location?, ?predicate: Prism::node, ?then_keyword_loc: Location?, ?statements: StatementsNode?, ?consequent: Prism::node?, ?end_keyword_loc: Location?, ?location: Location) -> IfNode # - # source://prism//lib/prism/node.rb#8595 + # source://prism//lib/prism/node.rb#8531 sig do params( if_keyword_loc: T.nilable(Prism::Location), @@ -15802,19 +15716,19 @@ class Prism::IfNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8576 + # source://prism//lib/prism/node.rb#8512 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { if_keyword_loc: Location?, predicate: Prism::node, then_keyword_loc: Location?, statements: StatementsNode?, consequent: Prism::node?, end_keyword_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#8603 + # source://prism//lib/prism/node.rb#8539 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#8712 + # source://prism//lib/prism/node.rb#8648 sig { returns(T.nilable(String)) } def end_keyword; end @@ -15825,7 +15739,7 @@ class Prism::IfNode < ::Prism::Node # end # ^^^ # - # source://prism//lib/prism/node.rb#8689 + # source://prism//lib/prism/node.rb#8625 sig { returns(T.nilable(Prism::Location)) } def end_keyword_loc; end @@ -15834,7 +15748,7 @@ class Prism::IfNode < ::Prism::Node # def if_keyword: () -> String? # - # source://prism//lib/prism/node.rb#8702 + # source://prism//lib/prism/node.rb#8638 sig { returns(T.nilable(String)) } def if_keyword; end @@ -15845,16 +15759,19 @@ 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#8613 + # source://prism//lib/prism/node.rb#8549 sig { returns(T.nilable(Prism::Location)) } def if_keyword_loc; end # def inspect -> String # - # source://prism//lib/prism/node.rb#8717 + # source://prism//lib/prism/node.rb#8653 sig { override.returns(String) } def inspect; end + # source://prism//lib/prism/parse_result/newlines.rb#91 + def newline!(lines); end + # The node for the condition the `IfNode` is testing. # # if foo @@ -15868,13 +15785,10 @@ class Prism::IfNode < ::Prism::Node # foo ? bar : baz # ^^^ # - # source://prism//lib/prism/node.rb#8637 + # source://prism//lib/prism/node.rb#8573 sig { returns(Prism::Node) } def predicate; end - # source://prism//lib/prism/node.rb#8571 - def set_newline_flag(newline_marked); end - # Represents the body of statements that will be executed when the predicate is evaluated as truthy. Will be `nil` when no body is provided. # # if foo @@ -15884,13 +15798,13 @@ class Prism::IfNode < ::Prism::Node # ^^^ # end # - # source://prism//lib/prism/node.rb#8666 + # source://prism//lib/prism/node.rb#8602 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # def then_keyword: () -> String? # - # source://prism//lib/prism/node.rb#8707 + # source://prism//lib/prism/node.rb#8643 sig { returns(T.nilable(String)) } def then_keyword; end @@ -15902,7 +15816,7 @@ class Prism::IfNode < ::Prism::Node # a ? b : c # ^ # - # source://prism//lib/prism/node.rb#8646 + # source://prism//lib/prism/node.rb#8582 sig { returns(T.nilable(Prism::Location)) } def then_keyword_loc; end @@ -15921,7 +15835,7 @@ class Prism::IfNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#8735 + # source://prism//lib/prism/node.rb#8671 sig { override.returns(Symbol) } def type; end @@ -15933,7 +15847,7 @@ class Prism::IfNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#8745 + # source://prism//lib/prism/node.rb#8681 def type; end end end @@ -15943,13 +15857,13 @@ end # 1.0i # ^^^^ # -# source://prism//lib/prism/node.rb#8767 +# source://prism//lib/prism/node.rb#8702 class Prism::ImaginaryNode < ::Prism::Node # def initialize: (FloatNode | IntegerNode | RationalNode numeric, Location location) -> void # # @return [ImaginaryNode] a new instance of ImaginaryNode # - # source://prism//lib/prism/node.rb#8768 + # source://prism//lib/prism/node.rb#8704 sig do params( source: Prism::Source, @@ -15962,36 +15876,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#8846 + # source://prism//lib/prism/node.rb#8781 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8776 + # source://prism//lib/prism/node.rb#8711 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#8781 + # source://prism//lib/prism/node.rb#8716 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#8791 + # source://prism//lib/prism/node.rb#8726 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#8786 + # source://prism//lib/prism/node.rb#8721 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?numeric: FloatNode | IntegerNode | RationalNode, ?location: Location) -> ImaginaryNode # - # source://prism//lib/prism/node.rb#8796 + # source://prism//lib/prism/node.rb#8731 sig do params( numeric: T.any(Prism::FloatNode, Prism::IntegerNode, Prism::RationalNode), @@ -16003,13 +15917,13 @@ class Prism::ImaginaryNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8781 + # source://prism//lib/prism/node.rb#8716 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { numeric: FloatNode | IntegerNode | RationalNode, location: Location } # - # source://prism//lib/prism/node.rb#8804 + # source://prism//lib/prism/node.rb#8739 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -16018,13 +15932,13 @@ class Prism::ImaginaryNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#8812 + # source://prism//lib/prism/node.rb#8747 sig { override.returns(String) } def inspect; end # attr_reader numeric: FloatNode | IntegerNode | RationalNode # - # source://prism//lib/prism/node.rb#8809 + # source://prism//lib/prism/node.rb#8744 sig { returns(T.any(Prism::FloatNode, Prism::IntegerNode, Prism::RationalNode)) } def numeric; end @@ -16043,13 +15957,13 @@ class Prism::ImaginaryNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#8830 + # source://prism//lib/prism/node.rb#8765 sig { override.returns(Symbol) } def type; end # Returns the value of the node as a Ruby Complex. # - # source://prism//lib/prism/node_ext.rb#98 + # source://prism//lib/prism/node_ext.rb#101 sig { returns(Complex) } def value; end @@ -16061,7 +15975,7 @@ class Prism::ImaginaryNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#8840 + # source://prism//lib/prism/node.rb#8775 def type; end end end @@ -16077,62 +15991,62 @@ end # foo in { bar: } # ^^^^ # -# source://prism//lib/prism/node.rb#8863 +# source://prism//lib/prism/node.rb#8797 class Prism::ImplicitNode < ::Prism::Node # def initialize: (Prism::node value, Location location) -> void # # @return [ImplicitNode] a new instance of ImplicitNode # - # source://prism//lib/prism/node.rb#8864 + # source://prism//lib/prism/node.rb#8799 sig { params(source: Prism::Source, value: Prism::Node, location: Prism::Location).void } def initialize(source, value, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#8942 + # source://prism//lib/prism/node.rb#8876 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8872 + # source://prism//lib/prism/node.rb#8806 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#8877 + # source://prism//lib/prism/node.rb#8811 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#8887 + # source://prism//lib/prism/node.rb#8821 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#8882 + # source://prism//lib/prism/node.rb#8816 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?value: Prism::node, ?location: Location) -> ImplicitNode # - # source://prism//lib/prism/node.rb#8892 + # source://prism//lib/prism/node.rb#8826 sig { params(value: Prism::Node, location: Prism::Location).returns(Prism::ImplicitNode) } def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8877 + # source://prism//lib/prism/node.rb#8811 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#8900 + # source://prism//lib/prism/node.rb#8834 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -16141,7 +16055,7 @@ class Prism::ImplicitNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#8908 + # source://prism//lib/prism/node.rb#8842 sig { override.returns(String) } def inspect; end @@ -16160,13 +16074,13 @@ class Prism::ImplicitNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#8926 + # source://prism//lib/prism/node.rb#8860 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#8905 + # source://prism//lib/prism/node.rb#8839 sig { returns(Prism::Node) } def value; end @@ -16178,7 +16092,7 @@ class Prism::ImplicitNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#8936 + # source://prism//lib/prism/node.rb#8870 def type; end end end @@ -16197,62 +16111,62 @@ end # foo, = bar # ^ # -# source://prism//lib/prism/node.rb#8962 +# source://prism//lib/prism/node.rb#8895 class Prism::ImplicitRestNode < ::Prism::Node # def initialize: (Location location) -> void # # @return [ImplicitRestNode] a new instance of ImplicitRestNode # - # source://prism//lib/prism/node.rb#8963 + # source://prism//lib/prism/node.rb#8897 sig { params(source: Prism::Source, location: Prism::Location).void } def initialize(source, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#9037 + # source://prism//lib/prism/node.rb#8970 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8970 + # source://prism//lib/prism/node.rb#8903 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#8975 + # source://prism//lib/prism/node.rb#8908 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#8985 + # source://prism//lib/prism/node.rb#8918 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#8980 + # source://prism//lib/prism/node.rb#8913 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?location: Location) -> ImplicitRestNode # - # source://prism//lib/prism/node.rb#8990 + # source://prism//lib/prism/node.rb#8923 sig { params(location: Prism::Location).returns(Prism::ImplicitRestNode) } def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8975 + # source://prism//lib/prism/node.rb#8908 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#8998 + # source://prism//lib/prism/node.rb#8931 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -16261,7 +16175,7 @@ class Prism::ImplicitRestNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#9003 + # source://prism//lib/prism/node.rb#8936 sig { override.returns(String) } def inspect; end @@ -16280,7 +16194,7 @@ class Prism::ImplicitRestNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#9021 + # source://prism//lib/prism/node.rb#8954 sig { override.returns(Symbol) } def type; end @@ -16292,7 +16206,7 @@ class Prism::ImplicitRestNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#9031 + # source://prism//lib/prism/node.rb#8964 def type; end end end @@ -16302,13 +16216,13 @@ end # case a; in b then c end # ^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#9047 +# source://prism//lib/prism/node.rb#8979 class Prism::InNode < ::Prism::Node # def initialize: (Prism::node pattern, StatementsNode? statements, Location in_loc, Location? then_loc, Location location) -> void # # @return [InNode] a new instance of InNode # - # source://prism//lib/prism/node.rb#9048 + # source://prism//lib/prism/node.rb#8981 sig do params( source: Prism::Source, @@ -16324,36 +16238,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#9165 + # source://prism//lib/prism/node.rb#9097 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#9059 + # source://prism//lib/prism/node.rb#8991 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#9064 + # source://prism//lib/prism/node.rb#8996 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#9077 + # source://prism//lib/prism/node.rb#9009 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#9069 + # source://prism//lib/prism/node.rb#9001 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?pattern: Prism::node, ?statements: StatementsNode?, ?in_loc: Location, ?then_loc: Location?, ?location: Location) -> InNode # - # source://prism//lib/prism/node.rb#9082 + # source://prism//lib/prism/node.rb#9014 sig do params( pattern: Prism::Node, @@ -16368,13 +16282,13 @@ class Prism::InNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9064 + # source://prism//lib/prism/node.rb#8996 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { pattern: Prism::node, statements: StatementsNode?, in_loc: Location, then_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#9090 + # source://prism//lib/prism/node.rb#9022 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -16383,43 +16297,43 @@ class Prism::InNode < ::Prism::Node # def in: () -> String # - # source://prism//lib/prism/node.rb#9121 + # source://prism//lib/prism/node.rb#9053 sig { returns(String) } def in; end # attr_reader in_loc: Location # - # source://prism//lib/prism/node.rb#9101 + # source://prism//lib/prism/node.rb#9033 sig { returns(Prism::Location) } def in_loc; end # def inspect -> String # - # source://prism//lib/prism/node.rb#9131 + # source://prism//lib/prism/node.rb#9063 sig { override.returns(String) } def inspect; end # attr_reader pattern: Prism::node # - # source://prism//lib/prism/node.rb#9095 + # source://prism//lib/prism/node.rb#9027 sig { returns(Prism::Node) } def pattern; end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#9098 + # source://prism//lib/prism/node.rb#9030 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # def then: () -> String? # - # source://prism//lib/prism/node.rb#9126 + # source://prism//lib/prism/node.rb#9058 sig { returns(T.nilable(String)) } def then; end # attr_reader then_loc: Location? # - # source://prism//lib/prism/node.rb#9108 + # source://prism//lib/prism/node.rb#9040 sig { returns(T.nilable(Prism::Location)) } def then_loc; end @@ -16438,7 +16352,7 @@ class Prism::InNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#9149 + # source://prism//lib/prism/node.rb#9081 sig { override.returns(Symbol) } def type; end @@ -16450,7 +16364,7 @@ class Prism::InNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#9159 + # source://prism//lib/prism/node.rb#9091 def type; end end end @@ -16460,13 +16374,13 @@ end # foo.bar[baz] &&= value # ^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#9179 +# source://prism//lib/prism/node.rb#9110 class Prism::IndexAndWriteNode < ::Prism::Node # def initialize: (Integer flags, Prism::node? receiver, Location? call_operator_loc, Location opening_loc, ArgumentsNode? arguments, Location closing_loc, Prism::node? block, Location operator_loc, Prism::node value, Location location) -> void # # @return [IndexAndWriteNode] a new instance of IndexAndWriteNode # - # source://prism//lib/prism/node.rb#9180 + # source://prism//lib/prism/node.rb#9112 sig do params( source: Prism::Source, @@ -16487,18 +16401,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#9358 + # source://prism//lib/prism/node.rb#9289 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#9196 + # source://prism//lib/prism/node.rb#9127 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#9261 + # source://prism//lib/prism/node.rb#9192 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end @@ -16506,61 +16420,61 @@ class Prism::IndexAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9294 + # source://prism//lib/prism/node.rb#9225 sig { returns(T::Boolean) } def attribute_write?; end # attr_reader block: Prism::node? # - # source://prism//lib/prism/node.rb#9271 + # source://prism//lib/prism/node.rb#9202 sig { returns(T.nilable(Prism::Node)) } def block; end # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#9304 + # source://prism//lib/prism/node.rb#9235 sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//lib/prism/node.rb#9241 + # source://prism//lib/prism/node.rb#9172 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9201 + # source://prism//lib/prism/node.rb#9132 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#9314 + # source://prism//lib/prism/node.rb#9245 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#9264 + # source://prism//lib/prism/node.rb#9195 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#9216 + # source://prism//lib/prism/node.rb#9147 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#9206 + # source://prism//lib/prism/node.rb#9137 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: Prism::node?, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> IndexAndWriteNode # - # source://prism//lib/prism/node.rb#9221 + # source://prism//lib/prism/node.rb#9152 sig do params( flags: Integer, @@ -16580,13 +16494,13 @@ class Prism::IndexAndWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9201 + # source://prism//lib/prism/node.rb#9132 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Prism::node?, call_operator_loc: Location?, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: Prism::node?, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#9229 + # source://prism//lib/prism/node.rb#9160 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -16597,43 +16511,43 @@ class Prism::IndexAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9299 + # source://prism//lib/prism/node.rb#9230 sig { returns(T::Boolean) } def ignore_visibility?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#9324 + # source://prism//lib/prism/node.rb#9255 sig { override.returns(String) } def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#9309 + # source://prism//lib/prism/node.rb#9240 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#9254 + # source://prism//lib/prism/node.rb#9185 sig { returns(Prism::Location) } def opening_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#9319 + # source://prism//lib/prism/node.rb#9250 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#9274 + # source://prism//lib/prism/node.rb#9205 sig { returns(Prism::Location) } def operator_loc; end # attr_reader receiver: Prism::node? # - # source://prism//lib/prism/node.rb#9238 + # source://prism//lib/prism/node.rb#9169 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -16641,7 +16555,7 @@ class Prism::IndexAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9284 + # source://prism//lib/prism/node.rb#9215 sig { returns(T::Boolean) } def safe_navigation?; end @@ -16660,13 +16574,13 @@ class Prism::IndexAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#9342 + # source://prism//lib/prism/node.rb#9273 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#9281 + # source://prism//lib/prism/node.rb#9212 sig { returns(Prism::Node) } def value; end @@ -16674,7 +16588,7 @@ class Prism::IndexAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9289 + # source://prism//lib/prism/node.rb#9220 sig { returns(T::Boolean) } def variable_call?; end @@ -16682,7 +16596,7 @@ class Prism::IndexAndWriteNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#9234 + # source://prism//lib/prism/node.rb#9165 sig { returns(Integer) } def flags; end @@ -16694,7 +16608,7 @@ class Prism::IndexAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#9352 + # source://prism//lib/prism/node.rb#9283 def type; end end end @@ -16704,13 +16618,13 @@ end # foo.bar[baz] += value # ^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#9377 +# source://prism//lib/prism/node.rb#9307 class Prism::IndexOperatorWriteNode < ::Prism::Node # def initialize: (Integer flags, Prism::node? receiver, Location? call_operator_loc, Location opening_loc, ArgumentsNode? arguments, Location closing_loc, Prism::node? block, Symbol binary_operator, Location binary_operator_loc, Prism::node value, Location location) -> void # # @return [IndexOperatorWriteNode] a new instance of IndexOperatorWriteNode # - # source://prism//lib/prism/node.rb#9378 + # source://prism//lib/prism/node.rb#9309 sig do params( source: Prism::Source, @@ -16732,18 +16646,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#9555 + # source://prism//lib/prism/node.rb#9485 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#9395 + # source://prism//lib/prism/node.rb#9325 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#9460 + # source://prism//lib/prism/node.rb#9390 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end @@ -16751,73 +16665,73 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9496 + # source://prism//lib/prism/node.rb#9426 sig { returns(T::Boolean) } def attribute_write?; end # attr_reader binary_operator: Symbol # - # source://prism//lib/prism/node.rb#9473 + # source://prism//lib/prism/node.rb#9403 sig { returns(Symbol) } def binary_operator; end # attr_reader binary_operator_loc: Location # - # source://prism//lib/prism/node.rb#9476 + # source://prism//lib/prism/node.rb#9406 sig { returns(Prism::Location) } def binary_operator_loc; end # attr_reader block: Prism::node? # - # source://prism//lib/prism/node.rb#9470 + # source://prism//lib/prism/node.rb#9400 sig { returns(T.nilable(Prism::Node)) } def block; end # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#9506 + # source://prism//lib/prism/node.rb#9436 sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//lib/prism/node.rb#9440 + # source://prism//lib/prism/node.rb#9370 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9400 + # source://prism//lib/prism/node.rb#9330 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#9516 + # source://prism//lib/prism/node.rb#9446 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#9463 + # source://prism//lib/prism/node.rb#9393 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#9415 + # source://prism//lib/prism/node.rb#9345 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#9405 + # source://prism//lib/prism/node.rb#9335 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: Prism::node?, ?binary_operator: Symbol, ?binary_operator_loc: Location, ?value: Prism::node, ?location: Location) -> IndexOperatorWriteNode # - # source://prism//lib/prism/node.rb#9420 + # source://prism//lib/prism/node.rb#9350 sig do params( flags: Integer, @@ -16838,13 +16752,13 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9400 + # source://prism//lib/prism/node.rb#9330 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Prism::node?, call_operator_loc: Location?, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: Prism::node?, binary_operator: Symbol, binary_operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#9428 + # source://prism//lib/prism/node.rb#9358 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -16855,43 +16769,43 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9501 + # source://prism//lib/prism/node.rb#9431 sig { returns(T::Boolean) } def ignore_visibility?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#9521 + # source://prism//lib/prism/node.rb#9451 sig { override.returns(String) } def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#9511 + # source://prism//lib/prism/node.rb#9441 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#9453 + # source://prism//lib/prism/node.rb#9383 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#387 + # 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#394 + # source://prism//lib/prism/node_ext.rb#410 def operator_loc; end # attr_reader receiver: Prism::node? # - # source://prism//lib/prism/node.rb#9437 + # source://prism//lib/prism/node.rb#9367 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -16899,7 +16813,7 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9486 + # source://prism//lib/prism/node.rb#9416 sig { returns(T::Boolean) } def safe_navigation?; end @@ -16918,13 +16832,13 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#9539 + # source://prism//lib/prism/node.rb#9469 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#9483 + # source://prism//lib/prism/node.rb#9413 sig { returns(Prism::Node) } def value; end @@ -16932,7 +16846,7 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9491 + # source://prism//lib/prism/node.rb#9421 sig { returns(T::Boolean) } def variable_call?; end @@ -16940,7 +16854,7 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#9433 + # source://prism//lib/prism/node.rb#9363 sig { returns(Integer) } def flags; end @@ -16952,7 +16866,7 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#9549 + # source://prism//lib/prism/node.rb#9479 def type; end end end @@ -16962,13 +16876,13 @@ end # foo.bar[baz] ||= value # ^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#9575 +# source://prism//lib/prism/node.rb#9504 class Prism::IndexOrWriteNode < ::Prism::Node # def initialize: (Integer flags, Prism::node? receiver, Location? call_operator_loc, Location opening_loc, ArgumentsNode? arguments, Location closing_loc, Prism::node? block, Location operator_loc, Prism::node value, Location location) -> void # # @return [IndexOrWriteNode] a new instance of IndexOrWriteNode # - # source://prism//lib/prism/node.rb#9576 + # source://prism//lib/prism/node.rb#9506 sig do params( source: Prism::Source, @@ -16989,18 +16903,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#9754 + # source://prism//lib/prism/node.rb#9683 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#9592 + # source://prism//lib/prism/node.rb#9521 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#9657 + # source://prism//lib/prism/node.rb#9586 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end @@ -17008,61 +16922,61 @@ class Prism::IndexOrWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9690 + # source://prism//lib/prism/node.rb#9619 sig { returns(T::Boolean) } def attribute_write?; end # attr_reader block: Prism::node? # - # source://prism//lib/prism/node.rb#9667 + # source://prism//lib/prism/node.rb#9596 sig { returns(T.nilable(Prism::Node)) } def block; end # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#9700 + # source://prism//lib/prism/node.rb#9629 sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//lib/prism/node.rb#9637 + # source://prism//lib/prism/node.rb#9566 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9597 + # source://prism//lib/prism/node.rb#9526 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#9710 + # source://prism//lib/prism/node.rb#9639 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#9660 + # source://prism//lib/prism/node.rb#9589 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#9612 + # source://prism//lib/prism/node.rb#9541 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#9602 + # source://prism//lib/prism/node.rb#9531 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: Prism::node?, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> IndexOrWriteNode # - # source://prism//lib/prism/node.rb#9617 + # source://prism//lib/prism/node.rb#9546 sig do params( flags: Integer, @@ -17082,13 +16996,13 @@ class Prism::IndexOrWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9597 + # source://prism//lib/prism/node.rb#9526 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Prism::node?, call_operator_loc: Location?, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: Prism::node?, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#9625 + # source://prism//lib/prism/node.rb#9554 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -17099,43 +17013,43 @@ class Prism::IndexOrWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9695 + # source://prism//lib/prism/node.rb#9624 sig { returns(T::Boolean) } def ignore_visibility?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#9720 + # source://prism//lib/prism/node.rb#9649 sig { override.returns(String) } def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#9705 + # source://prism//lib/prism/node.rb#9634 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#9650 + # source://prism//lib/prism/node.rb#9579 sig { returns(Prism::Location) } def opening_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#9715 + # source://prism//lib/prism/node.rb#9644 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#9670 + # source://prism//lib/prism/node.rb#9599 sig { returns(Prism::Location) } def operator_loc; end # attr_reader receiver: Prism::node? # - # source://prism//lib/prism/node.rb#9634 + # source://prism//lib/prism/node.rb#9563 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -17143,7 +17057,7 @@ class Prism::IndexOrWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9680 + # source://prism//lib/prism/node.rb#9609 sig { returns(T::Boolean) } def safe_navigation?; end @@ -17162,13 +17076,13 @@ class Prism::IndexOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#9738 + # source://prism//lib/prism/node.rb#9667 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#9677 + # source://prism//lib/prism/node.rb#9606 sig { returns(Prism::Node) } def value; end @@ -17176,7 +17090,7 @@ class Prism::IndexOrWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9685 + # source://prism//lib/prism/node.rb#9614 sig { returns(T::Boolean) } def variable_call?; end @@ -17184,7 +17098,7 @@ class Prism::IndexOrWriteNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#9630 + # source://prism//lib/prism/node.rb#9559 sig { returns(Integer) } def flags; end @@ -17196,7 +17110,7 @@ class Prism::IndexOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#9748 + # source://prism//lib/prism/node.rb#9677 def type; end end end @@ -17214,13 +17128,13 @@ end # for foo[bar] in baz do end # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#9781 +# source://prism//lib/prism/node.rb#9709 class Prism::IndexTargetNode < ::Prism::Node # def initialize: (Integer flags, Prism::node receiver, Location opening_loc, ArgumentsNode? arguments, Location closing_loc, Prism::node? block, Location location) -> void # # @return [IndexTargetNode] a new instance of IndexTargetNode # - # source://prism//lib/prism/node.rb#9782 + # source://prism//lib/prism/node.rb#9711 sig do params( source: Prism::Source, @@ -17238,18 +17152,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#9923 + # source://prism//lib/prism/node.rb#9851 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#9795 + # source://prism//lib/prism/node.rb#9723 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#9846 + # source://prism//lib/prism/node.rb#9774 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end @@ -17257,49 +17171,49 @@ class Prism::IndexTargetNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9869 + # source://prism//lib/prism/node.rb#9797 sig { returns(T::Boolean) } def attribute_write?; end # attr_reader block: Prism::node? # - # source://prism//lib/prism/node.rb#9856 + # source://prism//lib/prism/node.rb#9784 sig { returns(T.nilable(Prism::Node)) } def block; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9800 + # source://prism//lib/prism/node.rb#9728 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#9884 + # source://prism//lib/prism/node.rb#9812 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#9849 + # source://prism//lib/prism/node.rb#9777 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#9814 + # source://prism//lib/prism/node.rb#9742 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#9805 + # source://prism//lib/prism/node.rb#9733 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?receiver: Prism::node, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: Prism::node?, ?location: Location) -> IndexTargetNode # - # source://prism//lib/prism/node.rb#9819 + # source://prism//lib/prism/node.rb#9747 sig do params( flags: Integer, @@ -17316,13 +17230,13 @@ class Prism::IndexTargetNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9800 + # source://prism//lib/prism/node.rb#9728 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Prism::node, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: Prism::node?, location: Location } # - # source://prism//lib/prism/node.rb#9827 + # source://prism//lib/prism/node.rb#9755 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -17333,31 +17247,31 @@ class Prism::IndexTargetNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9874 + # source://prism//lib/prism/node.rb#9802 sig { returns(T::Boolean) } def ignore_visibility?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#9889 + # source://prism//lib/prism/node.rb#9817 sig { override.returns(String) } def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#9879 + # source://prism//lib/prism/node.rb#9807 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#9839 + # source://prism//lib/prism/node.rb#9767 sig { returns(Prism::Location) } def opening_loc; end # attr_reader receiver: Prism::node # - # source://prism//lib/prism/node.rb#9836 + # source://prism//lib/prism/node.rb#9764 sig { returns(Prism::Node) } def receiver; end @@ -17365,7 +17279,7 @@ class Prism::IndexTargetNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9859 + # source://prism//lib/prism/node.rb#9787 sig { returns(T::Boolean) } def safe_navigation?; end @@ -17384,7 +17298,7 @@ class Prism::IndexTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#9907 + # source://prism//lib/prism/node.rb#9835 sig { override.returns(Symbol) } def type; end @@ -17392,7 +17306,7 @@ class Prism::IndexTargetNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9864 + # source://prism//lib/prism/node.rb#9792 sig { returns(T::Boolean) } def variable_call?; end @@ -17400,7 +17314,7 @@ class Prism::IndexTargetNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#9832 + # source://prism//lib/prism/node.rb#9760 sig { returns(Integer) } def flags; end @@ -17412,7 +17326,7 @@ class Prism::IndexTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#9917 + # source://prism//lib/prism/node.rb#9845 def type; end end end @@ -17420,7 +17334,7 @@ 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#390 +# source://prism//lib/prism/parse_result.rb#388 class Prism::InlineComment < ::Prism::Comment # Returns a string representation of this comment. # @@ -17441,7 +17355,7 @@ 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#16 +# source://prism//lib/prism/inspect_visitor.rb#12 class Prism::InspectVisitor < ::Prism::Visitor # Initializes a new instance of the InspectVisitor. # @@ -17903,331 +17817,336 @@ class Prism::InspectVisitor < ::Prism::Visitor # source://prism//lib/prism/inspect_visitor.rb#1298 def visit_interpolated_x_string_node(node); end - # Inspect a ItParametersNode node. + # Inspect a ItLocalVariableReadNode node. # # source://prism//lib/prism/inspect_visitor.rb#1314 + def visit_it_local_variable_read_node(node); end + + # Inspect a ItParametersNode node. + # + # source://prism//lib/prism/inspect_visitor.rb#1319 def visit_it_parameters_node(node); end # Inspect a KeywordHashNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1319 + # source://prism//lib/prism/inspect_visitor.rb#1324 def visit_keyword_hash_node(node); end # Inspect a KeywordRestParameterNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1335 + # source://prism//lib/prism/inspect_visitor.rb#1340 def visit_keyword_rest_parameter_node(node); end # Inspect a LambdaNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1349 + # source://prism//lib/prism/inspect_visitor.rb#1354 def visit_lambda_node(node); end # Inspect a LocalVariableAndWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1370 + # source://prism//lib/prism/inspect_visitor.rb#1375 def visit_local_variable_and_write_node(node); end # Inspect a LocalVariableOperatorWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1381 + # source://prism//lib/prism/inspect_visitor.rb#1386 def visit_local_variable_operator_write_node(node); end # Inspect a LocalVariableOrWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1393 + # source://prism//lib/prism/inspect_visitor.rb#1398 def visit_local_variable_or_write_node(node); end # Inspect a LocalVariableReadNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1404 + # source://prism//lib/prism/inspect_visitor.rb#1409 def visit_local_variable_read_node(node); end # Inspect a LocalVariableTargetNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1411 + # source://prism//lib/prism/inspect_visitor.rb#1416 def visit_local_variable_target_node(node); end # Inspect a LocalVariableWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1418 + # source://prism//lib/prism/inspect_visitor.rb#1423 def visit_local_variable_write_node(node); end # Inspect a MatchLastLineNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1429 + # source://prism//lib/prism/inspect_visitor.rb#1434 def visit_match_last_line_node(node); end # Inspect a MatchPredicateNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1440 + # source://prism//lib/prism/inspect_visitor.rb#1445 def visit_match_predicate_node(node); end # Inspect a MatchRequiredNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1450 + # source://prism//lib/prism/inspect_visitor.rb#1455 def visit_match_required_node(node); end # Inspect a MatchWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1460 + # source://prism//lib/prism/inspect_visitor.rb#1465 def visit_match_write_node(node); end # Inspect a MissingNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1476 + # source://prism//lib/prism/inspect_visitor.rb#1481 def visit_missing_node(node); end # Inspect a ModuleNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1481 + # source://prism//lib/prism/inspect_visitor.rb#1486 def visit_module_node(node); end # Inspect a MultiTargetNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1498 + # source://prism//lib/prism/inspect_visitor.rb#1503 def visit_multi_target_node(node); end # Inspect a MultiWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1529 + # source://prism//lib/prism/inspect_visitor.rb#1534 def visit_multi_write_node(node); end # Inspect a NextNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1563 + # source://prism//lib/prism/inspect_visitor.rb#1568 def visit_next_node(node); end # Inspect a NilNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1575 + # source://prism//lib/prism/inspect_visitor.rb#1580 def visit_nil_node(node); end # Inspect a NoKeywordsParameterNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1580 + # source://prism//lib/prism/inspect_visitor.rb#1585 def visit_no_keywords_parameter_node(node); end # Inspect a NumberedParametersNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1587 + # source://prism//lib/prism/inspect_visitor.rb#1592 def visit_numbered_parameters_node(node); end # Inspect a NumberedReferenceReadNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1593 + # source://prism//lib/prism/inspect_visitor.rb#1598 def visit_numbered_reference_read_node(node); end # Inspect a OptionalKeywordParameterNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1599 + # source://prism//lib/prism/inspect_visitor.rb#1604 def visit_optional_keyword_parameter_node(node); end # Inspect a OptionalParameterNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1610 + # source://prism//lib/prism/inspect_visitor.rb#1615 def visit_optional_parameter_node(node); end # Inspect a OrNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1622 + # source://prism//lib/prism/inspect_visitor.rb#1627 def visit_or_node(node); end # Inspect a ParametersNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1632 + # source://prism//lib/prism/inspect_visitor.rb#1637 def visit_parameters_node(node); end # Inspect a ParenthesesNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1691 + # source://prism//lib/prism/inspect_visitor.rb#1696 def visit_parentheses_node(node); end # Inspect a PinnedExpressionNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1704 + # source://prism//lib/prism/inspect_visitor.rb#1709 def visit_pinned_expression_node(node); end # Inspect a PinnedVariableNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1714 + # source://prism//lib/prism/inspect_visitor.rb#1719 def visit_pinned_variable_node(node); end # Inspect a PostExecutionNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1722 + # source://prism//lib/prism/inspect_visitor.rb#1727 def visit_post_execution_node(node); end # Inspect a PreExecutionNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1736 + # source://prism//lib/prism/inspect_visitor.rb#1741 def visit_pre_execution_node(node); end # Inspect a ProgramNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1750 + # source://prism//lib/prism/inspect_visitor.rb#1755 def visit_program_node(node); end # Inspect a RangeNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1758 + # source://prism//lib/prism/inspect_visitor.rb#1763 def visit_range_node(node); end # Inspect a RationalNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1778 + # source://prism//lib/prism/inspect_visitor.rb#1783 def visit_rational_node(node); end # Inspect a RedoNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1785 + # source://prism//lib/prism/inspect_visitor.rb#1792 def visit_redo_node(node); end # Inspect a RegularExpressionNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1790 + # source://prism//lib/prism/inspect_visitor.rb#1797 def visit_regular_expression_node(node); end # Inspect a RequiredKeywordParameterNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1801 + # source://prism//lib/prism/inspect_visitor.rb#1808 def visit_required_keyword_parameter_node(node); end # Inspect a RequiredParameterNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1810 + # source://prism//lib/prism/inspect_visitor.rb#1817 def visit_required_parameter_node(node); end # Inspect a RescueModifierNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1818 + # source://prism//lib/prism/inspect_visitor.rb#1825 def visit_rescue_modifier_node(node); end # Inspect a RescueNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1828 + # source://prism//lib/prism/inspect_visitor.rb#1835 def visit_rescue_node(node); end # Inspect a RestParameterNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1862 + # source://prism//lib/prism/inspect_visitor.rb#1869 def visit_rest_parameter_node(node); end # Inspect a RetryNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1876 + # source://prism//lib/prism/inspect_visitor.rb#1883 def visit_retry_node(node); end # Inspect a ReturnNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1881 + # source://prism//lib/prism/inspect_visitor.rb#1888 def visit_return_node(node); end # Inspect a SelfNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1895 + # source://prism//lib/prism/inspect_visitor.rb#1902 def visit_self_node(node); end # Inspect a ShareableConstantNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1900 + # source://prism//lib/prism/inspect_visitor.rb#1907 def visit_shareable_constant_node(node); end # Inspect a SingletonClassNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1909 + # source://prism//lib/prism/inspect_visitor.rb#1916 def visit_singleton_class_node(node); end # Inspect a SourceEncodingNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1926 + # source://prism//lib/prism/inspect_visitor.rb#1933 def visit_source_encoding_node(node); end # Inspect a SourceFileNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1931 + # source://prism//lib/prism/inspect_visitor.rb#1938 def visit_source_file_node(node); end # Inspect a SourceLineNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1939 + # source://prism//lib/prism/inspect_visitor.rb#1946 def visit_source_line_node(node); end # Inspect a SplatNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1944 + # source://prism//lib/prism/inspect_visitor.rb#1951 def visit_splat_node(node); end # Inspect a StatementsNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1956 + # source://prism//lib/prism/inspect_visitor.rb#1963 def visit_statements_node(node); end # Inspect a StringNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1970 + # source://prism//lib/prism/inspect_visitor.rb#1977 def visit_string_node(node); end # Inspect a SuperNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1981 + # source://prism//lib/prism/inspect_visitor.rb#1988 def visit_super_node(node); end # Inspect a SymbolNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2001 + # source://prism//lib/prism/inspect_visitor.rb#2008 def visit_symbol_node(node); end # Inspect a TrueNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2012 + # source://prism//lib/prism/inspect_visitor.rb#2019 def visit_true_node(node); end # Inspect a UndefNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2017 + # source://prism//lib/prism/inspect_visitor.rb#2024 def visit_undef_node(node); end # Inspect a UnlessNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2032 + # source://prism//lib/prism/inspect_visitor.rb#2039 def visit_unless_node(node); end # Inspect a UntilNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2054 + # source://prism//lib/prism/inspect_visitor.rb#2061 def visit_until_node(node); end # Inspect a WhenNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2071 + # source://prism//lib/prism/inspect_visitor.rb#2078 def visit_when_node(node); end # Inspect a WhileNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2093 + # source://prism//lib/prism/inspect_visitor.rb#2100 def visit_while_node(node); end # Inspect a XStringNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2110 + # source://prism//lib/prism/inspect_visitor.rb#2117 def visit_x_string_node(node); end # Inspect a YieldNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2121 + # source://prism//lib/prism/inspect_visitor.rb#2128 def visit_yield_node(node); end private # Compose a string representing the given inner location field. # - # source://prism//lib/prism/inspect_visitor.rb#2148 + # source://prism//lib/prism/inspect_visitor.rb#2150 def inspect_location(location); end # Compose a header for the given node. # - # source://prism//lib/prism/inspect_visitor.rb#2137 + # source://prism//lib/prism/inspect_visitor.rb#2144 def inspect_node(name, node); end class << self @@ -18260,13 +18179,13 @@ end # @target &&= value # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#9939 +# source://prism//lib/prism/node.rb#9866 class Prism::InstanceVariableAndWriteNode < ::Prism::Node # def initialize: (Symbol name, Location name_loc, Location operator_loc, Prism::node value, Location location) -> void # # @return [InstanceVariableAndWriteNode] a new instance of InstanceVariableAndWriteNode # - # source://prism//lib/prism/node.rb#9940 + # source://prism//lib/prism/node.rb#9868 sig do params( source: Prism::Source, @@ -18282,36 +18201,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#10043 + # source://prism//lib/prism/node.rb#9970 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#9951 + # source://prism//lib/prism/node.rb#9878 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#9956 + # source://prism//lib/prism/node.rb#9883 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#9966 + # source://prism//lib/prism/node.rb#9893 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#9961 + # source://prism//lib/prism/node.rb#9888 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> InstanceVariableAndWriteNode # - # source://prism//lib/prism/node.rb#9971 + # source://prism//lib/prism/node.rb#9898 sig do params( name: Symbol, @@ -18326,13 +18245,13 @@ class Prism::InstanceVariableAndWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9956 + # source://prism//lib/prism/node.rb#9883 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#9979 + # source://prism//lib/prism/node.rb#9906 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -18344,31 +18263,31 @@ class Prism::InstanceVariableAndWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#10009 + # source://prism//lib/prism/node.rb#9936 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#9984 + # source://prism//lib/prism/node.rb#9911 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#9987 + # source://prism//lib/prism/node.rb#9914 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#10004 + # source://prism//lib/prism/node.rb#9931 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#9994 + # source://prism//lib/prism/node.rb#9921 sig { returns(Prism::Location) } def operator_loc; end @@ -18387,13 +18306,13 @@ class Prism::InstanceVariableAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#10027 + # source://prism//lib/prism/node.rb#9954 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#10001 + # source://prism//lib/prism/node.rb#9928 sig { returns(Prism::Node) } def value; end @@ -18405,7 +18324,7 @@ class Prism::InstanceVariableAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#10037 + # source://prism//lib/prism/node.rb#9964 def type; end end end @@ -18415,13 +18334,13 @@ end # @target += value # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#10057 +# source://prism//lib/prism/node.rb#9983 class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node # def initialize: (Symbol name, Location name_loc, Location binary_operator_loc, Prism::node value, Symbol binary_operator, Location location) -> void # # @return [InstanceVariableOperatorWriteNode] a new instance of InstanceVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#10058 + # source://prism//lib/prism/node.rb#9985 sig do params( source: Prism::Source, @@ -18438,48 +18357,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#10160 + # source://prism//lib/prism/node.rb#10086 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#10070 + # source://prism//lib/prism/node.rb#9996 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader binary_operator: Symbol # - # source://prism//lib/prism/node.rb#10123 + # source://prism//lib/prism/node.rb#10049 sig { returns(Symbol) } def binary_operator; end # attr_reader binary_operator_loc: Location # - # source://prism//lib/prism/node.rb#10113 + # source://prism//lib/prism/node.rb#10039 sig { returns(Prism::Location) } def binary_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#10075 + # source://prism//lib/prism/node.rb#10001 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#10085 + # source://prism//lib/prism/node.rb#10011 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#10080 + # source://prism//lib/prism/node.rb#10006 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol, ?location: Location) -> InstanceVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#10090 + # source://prism//lib/prism/node.rb#10016 sig do params( name: Symbol, @@ -18495,13 +18414,13 @@ class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#10075 + # source://prism//lib/prism/node.rb#10001 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#10098 + # source://prism//lib/prism/node.rb#10024 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -18513,32 +18432,32 @@ class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#10126 + # source://prism//lib/prism/node.rb#10052 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#10103 + # source://prism//lib/prism/node.rb#10029 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#10106 + # source://prism//lib/prism/node.rb#10032 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#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#410 + # source://prism//lib/prism/node_ext.rb#426 def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -18556,13 +18475,13 @@ class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#10144 + # source://prism//lib/prism/node.rb#10070 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#10120 + # source://prism//lib/prism/node.rb#10046 sig { returns(Prism::Node) } def value; end @@ -18574,7 +18493,7 @@ class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#10154 + # source://prism//lib/prism/node.rb#10080 def type; end end end @@ -18584,13 +18503,13 @@ end # @target ||= value # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#10175 +# source://prism//lib/prism/node.rb#10100 class Prism::InstanceVariableOrWriteNode < ::Prism::Node # def initialize: (Symbol name, Location name_loc, Location operator_loc, Prism::node value, Location location) -> void # # @return [InstanceVariableOrWriteNode] a new instance of InstanceVariableOrWriteNode # - # source://prism//lib/prism/node.rb#10176 + # source://prism//lib/prism/node.rb#10102 sig do params( source: Prism::Source, @@ -18606,36 +18525,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#10279 + # source://prism//lib/prism/node.rb#10204 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#10187 + # source://prism//lib/prism/node.rb#10112 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#10192 + # source://prism//lib/prism/node.rb#10117 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#10202 + # source://prism//lib/prism/node.rb#10127 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#10197 + # source://prism//lib/prism/node.rb#10122 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> InstanceVariableOrWriteNode # - # source://prism//lib/prism/node.rb#10207 + # source://prism//lib/prism/node.rb#10132 sig do params( name: Symbol, @@ -18650,13 +18569,13 @@ class Prism::InstanceVariableOrWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#10192 + # source://prism//lib/prism/node.rb#10117 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#10215 + # source://prism//lib/prism/node.rb#10140 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -18668,31 +18587,31 @@ class Prism::InstanceVariableOrWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#10245 + # source://prism//lib/prism/node.rb#10170 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#10220 + # source://prism//lib/prism/node.rb#10145 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#10223 + # source://prism//lib/prism/node.rb#10148 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#10240 + # source://prism//lib/prism/node.rb#10165 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#10230 + # source://prism//lib/prism/node.rb#10155 sig { returns(Prism::Location) } def operator_loc; end @@ -18711,13 +18630,13 @@ class Prism::InstanceVariableOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#10263 + # source://prism//lib/prism/node.rb#10188 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#10237 + # source://prism//lib/prism/node.rb#10162 sig { returns(Prism::Node) } def value; end @@ -18729,7 +18648,7 @@ class Prism::InstanceVariableOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#10273 + # source://prism//lib/prism/node.rb#10198 def type; end end end @@ -18739,62 +18658,62 @@ end # @foo # ^^^^ # -# source://prism//lib/prism/node.rb#10293 +# source://prism//lib/prism/node.rb#10217 class Prism::InstanceVariableReadNode < ::Prism::Node # def initialize: (Symbol name, Location location) -> void # # @return [InstanceVariableReadNode] a new instance of InstanceVariableReadNode # - # source://prism//lib/prism/node.rb#10294 + # source://prism//lib/prism/node.rb#10219 sig { params(source: Prism::Source, name: Symbol, location: Prism::Location).void } def initialize(source, name, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#10376 + # source://prism//lib/prism/node.rb#10300 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#10302 + # source://prism//lib/prism/node.rb#10226 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#10307 + # source://prism//lib/prism/node.rb#10231 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#10317 + # source://prism//lib/prism/node.rb#10241 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#10312 + # source://prism//lib/prism/node.rb#10236 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?location: Location) -> InstanceVariableReadNode # - # source://prism//lib/prism/node.rb#10322 + # source://prism//lib/prism/node.rb#10246 sig { params(name: Symbol, location: Prism::Location).returns(Prism::InstanceVariableReadNode) } def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#10307 + # source://prism//lib/prism/node.rb#10231 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#10330 + # source://prism//lib/prism/node.rb#10254 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -18803,7 +18722,7 @@ class Prism::InstanceVariableReadNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#10342 + # source://prism//lib/prism/node.rb#10266 sig { override.returns(String) } def inspect; end @@ -18813,7 +18732,7 @@ class Prism::InstanceVariableReadNode < ::Prism::Node # # @_test # name `:@_test` # - # source://prism//lib/prism/node.rb#10339 + # source://prism//lib/prism/node.rb#10263 sig { returns(Symbol) } def name; end @@ -18832,7 +18751,7 @@ class Prism::InstanceVariableReadNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#10360 + # source://prism//lib/prism/node.rb#10284 sig { override.returns(Symbol) } def type; end @@ -18844,7 +18763,7 @@ class Prism::InstanceVariableReadNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#10370 + # source://prism//lib/prism/node.rb#10294 def type; end end end @@ -18854,62 +18773,62 @@ end # @foo, @bar = baz # ^^^^ ^^^^ # -# source://prism//lib/prism/node.rb#10387 +# source://prism//lib/prism/node.rb#10310 class Prism::InstanceVariableTargetNode < ::Prism::Node # def initialize: (Symbol name, Location location) -> void # # @return [InstanceVariableTargetNode] a new instance of InstanceVariableTargetNode # - # source://prism//lib/prism/node.rb#10388 + # source://prism//lib/prism/node.rb#10312 sig { params(source: Prism::Source, name: Symbol, location: Prism::Location).void } def initialize(source, name, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#10466 + # source://prism//lib/prism/node.rb#10389 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#10396 + # source://prism//lib/prism/node.rb#10319 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#10401 + # source://prism//lib/prism/node.rb#10324 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#10411 + # source://prism//lib/prism/node.rb#10334 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#10406 + # source://prism//lib/prism/node.rb#10329 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?location: Location) -> InstanceVariableTargetNode # - # source://prism//lib/prism/node.rb#10416 + # source://prism//lib/prism/node.rb#10339 sig { params(name: Symbol, location: Prism::Location).returns(Prism::InstanceVariableTargetNode) } def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#10401 + # source://prism//lib/prism/node.rb#10324 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#10424 + # source://prism//lib/prism/node.rb#10347 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -18918,13 +18837,13 @@ class Prism::InstanceVariableTargetNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#10432 + # source://prism//lib/prism/node.rb#10355 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#10429 + # source://prism//lib/prism/node.rb#10352 sig { returns(Symbol) } def name; end @@ -18943,7 +18862,7 @@ class Prism::InstanceVariableTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#10450 + # source://prism//lib/prism/node.rb#10373 sig { override.returns(Symbol) } def type; end @@ -18955,7 +18874,7 @@ class Prism::InstanceVariableTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#10460 + # source://prism//lib/prism/node.rb#10383 def type; end end end @@ -18965,13 +18884,13 @@ end # @foo = 1 # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#10477 +# source://prism//lib/prism/node.rb#10399 class Prism::InstanceVariableWriteNode < ::Prism::Node # def initialize: (Symbol name, Location name_loc, Prism::node value, Location operator_loc, Location location) -> void # # @return [InstanceVariableWriteNode] a new instance of InstanceVariableWriteNode # - # source://prism//lib/prism/node.rb#10478 + # source://prism//lib/prism/node.rb#10401 sig do params( source: Prism::Source, @@ -18987,36 +18906,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#10597 + # source://prism//lib/prism/node.rb#10519 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#10489 + # source://prism//lib/prism/node.rb#10411 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#10494 + # source://prism//lib/prism/node.rb#10416 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#10504 + # source://prism//lib/prism/node.rb#10426 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#10499 + # source://prism//lib/prism/node.rb#10421 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location, ?location: Location) -> InstanceVariableWriteNode # - # source://prism//lib/prism/node.rb#10509 + # source://prism//lib/prism/node.rb#10431 sig do params( name: Symbol, @@ -19031,13 +18950,13 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#10494 + # source://prism//lib/prism/node.rb#10416 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#10517 + # source://prism//lib/prism/node.rb#10439 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -19046,7 +18965,7 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#10563 + # source://prism//lib/prism/node.rb#10485 sig { override.returns(String) } def inspect; end @@ -19056,7 +18975,7 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node # # @_foo = "bar" # name `@_foo` # - # source://prism//lib/prism/node.rb#10526 + # source://prism//lib/prism/node.rb#10448 sig { returns(Symbol) } def name; end @@ -19065,13 +18984,13 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node # @_x = 1 # ^^^ # - # source://prism//lib/prism/node.rb#10532 + # source://prism//lib/prism/node.rb#10454 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#10558 + # source://prism//lib/prism/node.rb#10480 sig { returns(String) } def operator; end @@ -19080,7 +18999,7 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node # @x = y # ^ # - # source://prism//lib/prism/node.rb#10551 + # source://prism//lib/prism/node.rb#10473 sig { returns(Prism::Location) } def operator_loc; end @@ -19099,7 +19018,7 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#10581 + # source://prism//lib/prism/node.rb#10503 sig { override.returns(Symbol) } def type; end @@ -19111,7 +19030,7 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node # @_x = 1234 # ^^^^ # - # source://prism//lib/prism/node.rb#10545 + # source://prism//lib/prism/node.rb#10467 sig { returns(Prism::Node) } def value; end @@ -19123,34 +19042,34 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#10591 + # source://prism//lib/prism/node.rb#10513 def type; end end end # Flags for integer nodes that correspond to the base of the integer. # -# source://prism//lib/prism/node.rb#19241 +# source://prism//lib/prism/node.rb#19166 module Prism::IntegerBaseFlags; end # 0b prefix # -# source://prism//lib/prism/node.rb#19243 +# source://prism//lib/prism/node.rb#19168 Prism::IntegerBaseFlags::BINARY = T.let(T.unsafe(nil), Integer) # 0d or no prefix # -# source://prism//lib/prism/node.rb#19246 +# source://prism//lib/prism/node.rb#19171 Prism::IntegerBaseFlags::DECIMAL = T.let(T.unsafe(nil), Integer) # 0x prefix # -# source://prism//lib/prism/node.rb#19252 +# source://prism//lib/prism/node.rb#19177 Prism::IntegerBaseFlags::HEXADECIMAL = T.let(T.unsafe(nil), Integer) # 0o or 0 prefix # -# source://prism//lib/prism/node.rb#19249 +# source://prism//lib/prism/node.rb#19174 Prism::IntegerBaseFlags::OCTAL = T.let(T.unsafe(nil), Integer) # Represents an integer number literal. @@ -19158,25 +19077,25 @@ Prism::IntegerBaseFlags::OCTAL = T.let(T.unsafe(nil), Integer) # 1 # ^ # -# source://prism//lib/prism/node.rb#10611 +# source://prism//lib/prism/node.rb#10532 class Prism::IntegerNode < ::Prism::Node # def initialize: (Integer flags, Integer value, Location location) -> void # # @return [IntegerNode] a new instance of IntegerNode # - # source://prism//lib/prism/node.rb#10612 + # source://prism//lib/prism/node.rb#10534 sig { params(source: Prism::Source, flags: Integer, value: Integer, location: Prism::Location).void } def initialize(source, flags, value, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#10715 + # source://prism//lib/prism/node.rb#10636 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#10621 + # source://prism//lib/prism/node.rb#10542 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -19184,31 +19103,31 @@ class Prism::IntegerNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10661 + # source://prism//lib/prism/node.rb#10582 sig { returns(T::Boolean) } def binary?; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#10626 + # source://prism//lib/prism/node.rb#10547 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#10636 + # source://prism//lib/prism/node.rb#10557 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#10631 + # source://prism//lib/prism/node.rb#10552 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?value: Integer, ?location: Location) -> IntegerNode # - # source://prism//lib/prism/node.rb#10641 + # source://prism//lib/prism/node.rb#10562 sig { params(flags: Integer, value: Integer, location: Prism::Location).returns(Prism::IntegerNode) } def copy(flags: T.unsafe(nil), value: T.unsafe(nil), location: T.unsafe(nil)); end @@ -19216,20 +19135,20 @@ class Prism::IntegerNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10666 + # source://prism//lib/prism/node.rb#10587 sig { returns(T::Boolean) } def decimal?; end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#10626 + # source://prism//lib/prism/node.rb#10547 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, value: Integer, location: Location } # - # source://prism//lib/prism/node.rb#10649 + # source://prism//lib/prism/node.rb#10570 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -19240,13 +19159,13 @@ class Prism::IntegerNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10676 + # source://prism//lib/prism/node.rb#10597 sig { returns(T::Boolean) } def hexadecimal?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#10681 + # source://prism//lib/prism/node.rb#10602 sig { override.returns(String) } def inspect; end @@ -19254,7 +19173,7 @@ class Prism::IntegerNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10671 + # source://prism//lib/prism/node.rb#10592 sig { returns(T::Boolean) } def octal?; end @@ -19273,13 +19192,13 @@ class Prism::IntegerNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#10699 + # source://prism//lib/prism/node.rb#10620 sig { override.returns(Symbol) } def type; end # The value of the integer literal as a number. # - # source://prism//lib/prism/node.rb#10658 + # source://prism//lib/prism/node.rb#10579 sig { returns(Integer) } def value; end @@ -19287,7 +19206,7 @@ class Prism::IntegerNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#10654 + # source://prism//lib/prism/node.rb#10575 sig { returns(Integer) } def flags; end @@ -19299,7 +19218,7 @@ class Prism::IntegerNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#10709 + # source://prism//lib/prism/node.rb#10630 def type; end end end @@ -19309,7 +19228,7 @@ end # if /foo #{bar} baz/ then end # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#10727 +# source://prism//lib/prism/node.rb#10647 class Prism::InterpolatedMatchLastLineNode < ::Prism::Node include ::Prism::RegularExpressionOptions @@ -19317,7 +19236,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [InterpolatedMatchLastLineNode] a new instance of InterpolatedMatchLastLineNode # - # source://prism//lib/prism/node.rb#10728 + # source://prism//lib/prism/node.rb#10649 sig do params( source: Prism::Source, @@ -19333,12 +19252,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#10897 + # source://prism//lib/prism/node.rb#10812 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#10739 + # source://prism//lib/prism/node.rb#10659 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -19346,43 +19265,43 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10823 + # source://prism//lib/prism/node.rb#10738 sig { returns(T::Boolean) } def ascii_8bit?; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#10749 + # source://prism//lib/prism/node.rb#10664 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#10858 + # source://prism//lib/prism/node.rb#10773 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#10791 + # source://prism//lib/prism/node.rb#10706 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#10759 + # source://prism//lib/prism/node.rb#10674 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#10754 + # source://prism//lib/prism/node.rb#10669 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?opening_loc: Location, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location, ?location: Location) -> InterpolatedMatchLastLineNode # - # source://prism//lib/prism/node.rb#10764 + # source://prism//lib/prism/node.rb#10679 sig do params( flags: Integer, @@ -19397,13 +19316,13 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#10749 + # source://prism//lib/prism/node.rb#10664 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#10772 + # source://prism//lib/prism/node.rb#10687 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -19411,7 +19330,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10818 + # source://prism//lib/prism/node.rb#10733 sig { returns(T::Boolean) } def euc_jp?; end @@ -19419,7 +19338,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10803 + # source://prism//lib/prism/node.rb#10718 sig { returns(T::Boolean) } def extended?; end @@ -19430,7 +19349,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10843 + # source://prism//lib/prism/node.rb#10758 sig { returns(T::Boolean) } def forced_binary_encoding?; end @@ -19438,7 +19357,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10848 + # source://prism//lib/prism/node.rb#10763 sig { returns(T::Boolean) } def forced_us_ascii_encoding?; end @@ -19446,7 +19365,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10838 + # source://prism//lib/prism/node.rb#10753 sig { returns(T::Boolean) } def forced_utf8_encoding?; end @@ -19454,13 +19373,13 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10798 + # source://prism//lib/prism/node.rb#10713 sig { returns(T::Boolean) } def ignore_case?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#10863 + # source://prism//lib/prism/node.rb#10778 sig { override.returns(String) } def inspect; end @@ -19468,27 +19387,30 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10808 + # source://prism//lib/prism/node.rb#10723 sig { returns(T::Boolean) } def multi_line?; end + # source://prism//lib/prism/parse_result/newlines.rb#121 + def newline!(lines); end + # def once?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10813 + # source://prism//lib/prism/node.rb#10728 sig { returns(T::Boolean) } def once?; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#10853 + # source://prism//lib/prism/node.rb#10768 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#10781 + # source://prism//lib/prism/node.rb#10696 sig { returns(Prism::Location) } def opening_loc; end @@ -19497,13 +19419,10 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode] # - # source://prism//lib/prism/node.rb#10788 + # source://prism//lib/prism/node.rb#10703 sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) } def parts; end - # source://prism//lib/prism/node.rb#10743 - def set_newline_flag(newline_marked); end - # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by # calling `[cls1, cls2].include?(node.class)` or putting the node into a @@ -19519,7 +19438,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#10881 + # source://prism//lib/prism/node.rb#10796 sig { override.returns(Symbol) } def type; end @@ -19527,7 +19446,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10833 + # source://prism//lib/prism/node.rb#10748 sig { returns(T::Boolean) } def utf_8?; end @@ -19535,7 +19454,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10828 + # source://prism//lib/prism/node.rb#10743 sig { returns(T::Boolean) } def windows_31j?; end @@ -19543,7 +19462,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#10777 + # source://prism//lib/prism/node.rb#10692 sig { returns(Integer) } def flags; end @@ -19555,7 +19474,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#10891 + # source://prism//lib/prism/node.rb#10806 def type; end end end @@ -19565,7 +19484,7 @@ end # /foo #{bar} baz/ # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#10912 +# source://prism//lib/prism/node.rb#10826 class Prism::InterpolatedRegularExpressionNode < ::Prism::Node include ::Prism::RegularExpressionOptions @@ -19573,7 +19492,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [InterpolatedRegularExpressionNode] a new instance of InterpolatedRegularExpressionNode # - # source://prism//lib/prism/node.rb#10913 + # source://prism//lib/prism/node.rb#10828 sig do params( source: Prism::Source, @@ -19589,12 +19508,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#11082 + # source://prism//lib/prism/node.rb#10991 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#10924 + # source://prism//lib/prism/node.rb#10838 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -19602,43 +19521,43 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#11008 + # source://prism//lib/prism/node.rb#10917 sig { returns(T::Boolean) } def ascii_8bit?; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#10934 + # source://prism//lib/prism/node.rb#10843 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#11043 + # source://prism//lib/prism/node.rb#10952 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#10976 + # source://prism//lib/prism/node.rb#10885 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#10944 + # source://prism//lib/prism/node.rb#10853 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#10939 + # source://prism//lib/prism/node.rb#10848 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?opening_loc: Location, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location, ?location: Location) -> InterpolatedRegularExpressionNode # - # source://prism//lib/prism/node.rb#10949 + # source://prism//lib/prism/node.rb#10858 sig do params( flags: Integer, @@ -19653,13 +19572,13 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#10934 + # source://prism//lib/prism/node.rb#10843 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#10957 + # source://prism//lib/prism/node.rb#10866 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -19667,7 +19586,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#11003 + # source://prism//lib/prism/node.rb#10912 sig { returns(T::Boolean) } def euc_jp?; end @@ -19675,7 +19594,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10988 + # source://prism//lib/prism/node.rb#10897 sig { returns(T::Boolean) } def extended?; end @@ -19686,7 +19605,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#11028 + # source://prism//lib/prism/node.rb#10937 sig { returns(T::Boolean) } def forced_binary_encoding?; end @@ -19694,7 +19613,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#11033 + # source://prism//lib/prism/node.rb#10942 sig { returns(T::Boolean) } def forced_us_ascii_encoding?; end @@ -19702,7 +19621,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#11023 + # source://prism//lib/prism/node.rb#10932 sig { returns(T::Boolean) } def forced_utf8_encoding?; end @@ -19710,13 +19629,13 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10983 + # source://prism//lib/prism/node.rb#10892 sig { returns(T::Boolean) } def ignore_case?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#11048 + # source://prism//lib/prism/node.rb#10957 sig { override.returns(String) } def inspect; end @@ -19724,27 +19643,30 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10993 + # source://prism//lib/prism/node.rb#10902 sig { returns(T::Boolean) } def multi_line?; end + # source://prism//lib/prism/parse_result/newlines.rb#128 + def newline!(lines); end + # def once?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10998 + # source://prism//lib/prism/node.rb#10907 sig { returns(T::Boolean) } def once?; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#11038 + # source://prism//lib/prism/node.rb#10947 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#10966 + # source://prism//lib/prism/node.rb#10875 sig { returns(Prism::Location) } def opening_loc; end @@ -19753,13 +19675,10 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode] # - # source://prism//lib/prism/node.rb#10973 + # source://prism//lib/prism/node.rb#10882 sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) } def parts; end - # source://prism//lib/prism/node.rb#10928 - def set_newline_flag(newline_marked); end - # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by # calling `[cls1, cls2].include?(node.class)` or putting the node into a @@ -19775,7 +19694,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#11066 + # source://prism//lib/prism/node.rb#10975 sig { override.returns(Symbol) } def type; end @@ -19783,7 +19702,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#11018 + # source://prism//lib/prism/node.rb#10927 sig { returns(T::Boolean) } def utf_8?; end @@ -19791,7 +19710,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#11013 + # source://prism//lib/prism/node.rb#10922 sig { returns(T::Boolean) } def windows_31j?; end @@ -19799,7 +19718,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#10962 + # source://prism//lib/prism/node.rb#10871 sig { returns(Integer) } def flags; end @@ -19811,7 +19730,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#11076 + # source://prism//lib/prism/node.rb#10985 def type; end end end @@ -19821,7 +19740,7 @@ end # "foo #{bar} baz" # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#11097 +# source://prism//lib/prism/node.rb#11005 class Prism::InterpolatedStringNode < ::Prism::Node include ::Prism::HeredocQuery @@ -19829,7 +19748,7 @@ class Prism::InterpolatedStringNode < ::Prism::Node # # @return [InterpolatedStringNode] a new instance of InterpolatedStringNode # - # source://prism//lib/prism/node.rb#11098 + # source://prism//lib/prism/node.rb#11007 sig do params( source: Prism::Source, @@ -19845,48 +19764,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#11234 + # source://prism//lib/prism/node.rb#11137 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11109 + # source://prism//lib/prism/node.rb#11017 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#11119 + # source://prism//lib/prism/node.rb#11022 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#11195 + # source://prism//lib/prism/node.rb#11098 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#11167 + # source://prism//lib/prism/node.rb#11070 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11129 + # source://prism//lib/prism/node.rb#11032 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#11124 + # source://prism//lib/prism/node.rb#11027 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?opening_loc: Location?, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode | InterpolatedStringNode], ?closing_loc: Location?, ?location: Location) -> InterpolatedStringNode # - # source://prism//lib/prism/node.rb#11134 + # source://prism//lib/prism/node.rb#11037 sig do params( flags: Integer, @@ -19901,13 +19820,13 @@ class Prism::InterpolatedStringNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11119 + # source://prism//lib/prism/node.rb#11022 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location?, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode | InterpolatedStringNode], closing_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#11142 + # source://prism//lib/prism/node.rb#11045 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -19918,7 +19837,7 @@ class Prism::InterpolatedStringNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#11180 + # source://prism//lib/prism/node.rb#11083 sig { returns(T::Boolean) } def frozen?; end @@ -19927,7 +19846,7 @@ class Prism::InterpolatedStringNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#11200 + # source://prism//lib/prism/node.rb#11103 sig { override.returns(String) } def inspect; end @@ -19935,33 +19854,33 @@ class Prism::InterpolatedStringNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#11185 + # source://prism//lib/prism/node.rb#11088 sig { returns(T::Boolean) } def mutable?; end + # source://prism//lib/prism/parse_result/newlines.rb#135 + def newline!(lines); end + # def opening: () -> String? # - # source://prism//lib/prism/node.rb#11190 + # source://prism//lib/prism/node.rb#11093 sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#11151 + # source://prism//lib/prism/node.rb#11054 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode | InterpolatedStringNode] # - # source://prism//lib/prism/node.rb#11164 + # source://prism//lib/prism/node.rb#11067 sig do returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode, Prism::InterpolatedStringNode)]) end def parts; end - # source://prism//lib/prism/node.rb#11113 - def set_newline_flag(newline_marked); end - # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by # calling `[cls1, cls2].include?(node.class)` or putting the node into a @@ -19977,7 +19896,7 @@ class Prism::InterpolatedStringNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#11218 + # source://prism//lib/prism/node.rb#11121 sig { override.returns(Symbol) } def type; end @@ -19985,7 +19904,7 @@ class Prism::InterpolatedStringNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#11147 + # source://prism//lib/prism/node.rb#11050 sig { returns(Integer) } def flags; end @@ -19997,20 +19916,20 @@ class Prism::InterpolatedStringNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#11228 + # source://prism//lib/prism/node.rb#11131 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#19256 +# source://prism//lib/prism/node.rb#19181 module Prism::InterpolatedStringNodeFlags; end -# source://prism//lib/prism/node.rb#19258 +# source://prism//lib/prism/node.rb#19183 Prism::InterpolatedStringNodeFlags::FROZEN = T.let(T.unsafe(nil), Integer) -# source://prism//lib/prism/node.rb#19261 +# source://prism//lib/prism/node.rb#19186 Prism::InterpolatedStringNodeFlags::MUTABLE = T.let(T.unsafe(nil), Integer) # Represents a symbol literal that contains interpolation. @@ -20018,13 +19937,13 @@ Prism::InterpolatedStringNodeFlags::MUTABLE = T.let(T.unsafe(nil), Integer) # :"foo #{bar} baz" # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#11249 +# source://prism//lib/prism/node.rb#11151 class Prism::InterpolatedSymbolNode < ::Prism::Node # def initialize: (Location? opening_loc, Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode] parts, Location? closing_loc, Location location) -> void # # @return [InterpolatedSymbolNode] a new instance of InterpolatedSymbolNode # - # source://prism//lib/prism/node.rb#11250 + # source://prism//lib/prism/node.rb#11153 sig do params( source: Prism::Source, @@ -20039,48 +19958,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#11371 + # source://prism//lib/prism/node.rb#11268 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11260 + # source://prism//lib/prism/node.rb#11162 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#11270 + # source://prism//lib/prism/node.rb#11167 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#11332 + # source://prism//lib/prism/node.rb#11229 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#11314 + # source://prism//lib/prism/node.rb#11211 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11280 + # source://prism//lib/prism/node.rb#11177 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#11275 + # source://prism//lib/prism/node.rb#11172 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?opening_loc: Location?, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location?, ?location: Location) -> InterpolatedSymbolNode # - # source://prism//lib/prism/node.rb#11285 + # source://prism//lib/prism/node.rb#11182 sig do params( opening_loc: T.nilable(Prism::Location), @@ -20094,13 +20013,13 @@ class Prism::InterpolatedSymbolNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11270 + # source://prism//lib/prism/node.rb#11167 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { opening_loc: Location?, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#11293 + # source://prism//lib/prism/node.rb#11190 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -20109,31 +20028,31 @@ class Prism::InterpolatedSymbolNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#11337 + # source://prism//lib/prism/node.rb#11234 sig { override.returns(String) } def inspect; end + # source://prism//lib/prism/parse_result/newlines.rb#142 + def newline!(lines); end + # def opening: () -> String? # - # source://prism//lib/prism/node.rb#11327 + # source://prism//lib/prism/node.rb#11224 sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#11298 + # source://prism//lib/prism/node.rb#11195 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode] # - # source://prism//lib/prism/node.rb#11311 + # source://prism//lib/prism/node.rb#11208 sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) } def parts; end - # source://prism//lib/prism/node.rb#11264 - def set_newline_flag(newline_marked); end - # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by # calling `[cls1, cls2].include?(node.class)` or putting the node into a @@ -20149,7 +20068,7 @@ class Prism::InterpolatedSymbolNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#11355 + # source://prism//lib/prism/node.rb#11252 sig { override.returns(Symbol) } def type; end @@ -20161,7 +20080,7 @@ class Prism::InterpolatedSymbolNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#11365 + # source://prism//lib/prism/node.rb#11262 def type; end end end @@ -20171,7 +20090,7 @@ end # `foo #{bar} baz` # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#11385 +# source://prism//lib/prism/node.rb#11281 class Prism::InterpolatedXStringNode < ::Prism::Node include ::Prism::HeredocQuery @@ -20179,7 +20098,7 @@ class Prism::InterpolatedXStringNode < ::Prism::Node # # @return [InterpolatedXStringNode] a new instance of InterpolatedXStringNode # - # source://prism//lib/prism/node.rb#11386 + # source://prism//lib/prism/node.rb#11283 sig do params( source: Prism::Source, @@ -20194,48 +20113,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#11495 + # source://prism//lib/prism/node.rb#11386 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11396 + # source://prism//lib/prism/node.rb#11292 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#11406 + # source://prism//lib/prism/node.rb#11297 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#11456 + # source://prism//lib/prism/node.rb#11347 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#11444 + # source://prism//lib/prism/node.rb#11335 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11416 + # source://prism//lib/prism/node.rb#11307 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#11411 + # source://prism//lib/prism/node.rb#11302 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?opening_loc: Location, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location, ?location: Location) -> InterpolatedXStringNode # - # source://prism//lib/prism/node.rb#11421 + # source://prism//lib/prism/node.rb#11312 sig do params( opening_loc: Prism::Location, @@ -20249,13 +20168,13 @@ class Prism::InterpolatedXStringNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11406 + # source://prism//lib/prism/node.rb#11297 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { opening_loc: Location, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#11429 + # source://prism//lib/prism/node.rb#11320 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -20267,30 +20186,135 @@ class Prism::InterpolatedXStringNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#11461 + # source://prism//lib/prism/node.rb#11352 sig { override.returns(String) } def inspect; end + # source://prism//lib/prism/parse_result/newlines.rb#149 + def newline!(lines); end + # def opening: () -> String # - # source://prism//lib/prism/node.rb#11451 + # source://prism//lib/prism/node.rb#11342 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#11434 + # source://prism//lib/prism/node.rb#11325 sig { returns(Prism::Location) } def opening_loc; end # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode] # - # source://prism//lib/prism/node.rb#11441 + # source://prism//lib/prism/node.rb#11332 sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) } def parts; end - # source://prism//lib/prism/node.rb#11400 - def set_newline_flag(newline_marked); end + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. + # + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. + # + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#11370 + sig { override.returns(Symbol) } + def type; end + + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#11380 + def type; end + end +end + +# Represents reading from the implicit `it` local variable. +# +# -> { it } +# ^^ +# +# source://prism//lib/prism/node.rb#11399 +class Prism::ItLocalVariableReadNode < ::Prism::Node + # def initialize: (Location location) -> void + # + # @return [ItLocalVariableReadNode] a new instance of ItLocalVariableReadNode + # + # source://prism//lib/prism/node.rb#11401 + sig { params(source: Prism::Source, location: Prism::Location).void } + def initialize(source, location); end + + # Implements case-equality for the node. This is effectively == but without + # comparing the value of locations. Locations are checked only for presence. + # + # source://prism//lib/prism/node.rb#11474 + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#11407 + 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#11412 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end + + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#11422 + sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } + def comment_targets; end + + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#11417 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end + + # def copy: (?location: Location) -> ItLocalVariableReadNode + # + # source://prism//lib/prism/node.rb#11427 + sig { params(location: Prism::Location).returns(Prism::ItLocalVariableReadNode) } + def copy(location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#11412 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } + # + # source://prism//lib/prism/node.rb#11435 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } + def deconstruct_keys(keys); end + + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String + # + # source://prism//lib/prism/node.rb#11440 + sig { override.returns(String) } + def inspect; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -20307,7 +20331,7 @@ class Prism::InterpolatedXStringNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#11479 + # source://prism//lib/prism/node.rb#11458 sig { override.returns(Symbol) } def type; end @@ -20319,7 +20343,7 @@ class Prism::InterpolatedXStringNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#11489 + # source://prism//lib/prism/node.rb#11468 def type; end end end @@ -20329,62 +20353,62 @@ end # -> { it + it } # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#11509 +# source://prism//lib/prism/node.rb#11483 class Prism::ItParametersNode < ::Prism::Node # def initialize: (Location location) -> void # # @return [ItParametersNode] a new instance of ItParametersNode # - # source://prism//lib/prism/node.rb#11510 + # source://prism//lib/prism/node.rb#11485 sig { params(source: Prism::Source, location: Prism::Location).void } def initialize(source, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#11584 + # source://prism//lib/prism/node.rb#11558 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11517 + # source://prism//lib/prism/node.rb#11491 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11522 + # source://prism//lib/prism/node.rb#11496 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11532 + # source://prism//lib/prism/node.rb#11506 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#11527 + # source://prism//lib/prism/node.rb#11501 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?location: Location) -> ItParametersNode # - # source://prism//lib/prism/node.rb#11537 + # source://prism//lib/prism/node.rb#11511 sig { params(location: Prism::Location).returns(Prism::ItParametersNode) } def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11522 + # source://prism//lib/prism/node.rb#11496 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#11545 + # source://prism//lib/prism/node.rb#11519 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -20393,7 +20417,7 @@ class Prism::ItParametersNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#11550 + # source://prism//lib/prism/node.rb#11524 sig { override.returns(String) } def inspect; end @@ -20412,7 +20436,7 @@ class Prism::ItParametersNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#11568 + # source://prism//lib/prism/node.rb#11542 sig { override.returns(Symbol) } def type; end @@ -20424,7 +20448,7 @@ class Prism::ItParametersNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#11578 + # source://prism//lib/prism/node.rb#11552 def type; end end end @@ -20434,13 +20458,13 @@ end # foo(a: b) # ^^^^ # -# source://prism//lib/prism/node.rb#11594 +# source://prism//lib/prism/node.rb#11567 class Prism::KeywordHashNode < ::Prism::Node # def initialize: (Integer flags, Array[AssocNode | AssocSplatNode] elements, Location location) -> void # # @return [KeywordHashNode] a new instance of KeywordHashNode # - # source://prism//lib/prism/node.rb#11595 + # source://prism//lib/prism/node.rb#11569 sig do params( source: Prism::Source, @@ -20454,36 +20478,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#11683 + # source://prism//lib/prism/node.rb#11656 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11604 + # source://prism//lib/prism/node.rb#11577 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#11609 + # source://prism//lib/prism/node.rb#11582 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11619 + # source://prism//lib/prism/node.rb#11592 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#11614 + # source://prism//lib/prism/node.rb#11587 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?elements: Array[AssocNode | AssocSplatNode], ?location: Location) -> KeywordHashNode # - # source://prism//lib/prism/node.rb#11624 + # source://prism//lib/prism/node.rb#11597 sig do params( flags: Integer, @@ -20496,19 +20520,19 @@ class Prism::KeywordHashNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11609 + # source://prism//lib/prism/node.rb#11582 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, elements: Array[AssocNode | AssocSplatNode], location: Location } # - # source://prism//lib/prism/node.rb#11632 + # source://prism//lib/prism/node.rb#11605 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#11641 + # source://prism//lib/prism/node.rb#11614 sig { returns(T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)]) } def elements; end @@ -20517,7 +20541,7 @@ class Prism::KeywordHashNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#11649 + # source://prism//lib/prism/node.rb#11622 sig { override.returns(String) } def inspect; end @@ -20525,7 +20549,7 @@ class Prism::KeywordHashNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#11644 + # source://prism//lib/prism/node.rb#11617 sig { returns(T::Boolean) } def symbol_keys?; end @@ -20544,7 +20568,7 @@ class Prism::KeywordHashNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#11667 + # source://prism//lib/prism/node.rb#11640 sig { override.returns(Symbol) } def type; end @@ -20552,7 +20576,7 @@ class Prism::KeywordHashNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#11637 + # source://prism//lib/prism/node.rb#11610 sig { returns(Integer) } def flags; end @@ -20564,19 +20588,19 @@ class Prism::KeywordHashNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#11677 + # source://prism//lib/prism/node.rb#11650 def type; end end end # Flags for keyword hash nodes. # -# source://prism//lib/prism/node.rb#19265 +# source://prism//lib/prism/node.rb#19190 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#19267 +# source://prism//lib/prism/node.rb#19192 Prism::KeywordHashNodeFlags::SYMBOL_KEYS = T.let(T.unsafe(nil), Integer) # Represents a keyword rest parameter to a method, block, or lambda definition. @@ -20585,13 +20609,13 @@ Prism::KeywordHashNodeFlags::SYMBOL_KEYS = T.let(T.unsafe(nil), Integer) # ^^^ # end # -# source://prism//lib/prism/node.rb#11697 +# source://prism//lib/prism/node.rb#11669 class Prism::KeywordRestParameterNode < ::Prism::Node # def initialize: (Integer flags, Symbol? name, Location? name_loc, Location operator_loc, Location location) -> void # # @return [KeywordRestParameterNode] a new instance of KeywordRestParameterNode # - # source://prism//lib/prism/node.rb#11698 + # source://prism//lib/prism/node.rb#11671 sig do params( source: Prism::Source, @@ -20607,36 +20631,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#11813 + # source://prism//lib/prism/node.rb#11785 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11709 + # source://prism//lib/prism/node.rb#11681 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#11714 + # source://prism//lib/prism/node.rb#11686 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11724 + # source://prism//lib/prism/node.rb#11696 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#11719 + # source://prism//lib/prism/node.rb#11691 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?name: Symbol?, ?name_loc: Location?, ?operator_loc: Location, ?location: Location) -> KeywordRestParameterNode # - # source://prism//lib/prism/node.rb#11729 + # source://prism//lib/prism/node.rb#11701 sig do params( flags: Integer, @@ -20651,13 +20675,13 @@ class Prism::KeywordRestParameterNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11714 + # source://prism//lib/prism/node.rb#11686 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol?, name_loc: Location?, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#11737 + # source://prism//lib/prism/node.rb#11709 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -20666,31 +20690,31 @@ class Prism::KeywordRestParameterNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#11779 + # source://prism//lib/prism/node.rb#11751 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol? # - # source://prism//lib/prism/node.rb#11746 + # source://prism//lib/prism/node.rb#11718 sig { returns(T.nilable(Symbol)) } def name; end # attr_reader name_loc: Location? # - # source://prism//lib/prism/node.rb#11749 + # source://prism//lib/prism/node.rb#11721 sig { returns(T.nilable(Prism::Location)) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#11774 + # source://prism//lib/prism/node.rb#11746 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#11762 + # source://prism//lib/prism/node.rb#11734 sig { returns(Prism::Location) } def operator_loc; end @@ -20698,7 +20722,7 @@ class Prism::KeywordRestParameterNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#11769 + # source://prism//lib/prism/node.rb#11741 sig { returns(T::Boolean) } def repeated_parameter?; end @@ -20717,7 +20741,7 @@ class Prism::KeywordRestParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#11797 + # source://prism//lib/prism/node.rb#11769 sig { override.returns(Symbol) } def type; end @@ -20725,7 +20749,7 @@ class Prism::KeywordRestParameterNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#11742 + # source://prism//lib/prism/node.rb#11714 sig { returns(Integer) } def flags; end @@ -20737,7 +20761,7 @@ class Prism::KeywordRestParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#11807 + # source://prism//lib/prism/node.rb#11779 def type; end end end @@ -20747,13 +20771,13 @@ end # ->(value) { value * 2 } # ^^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#11827 +# source://prism//lib/prism/node.rb#11798 class Prism::LambdaNode < ::Prism::Node # def initialize: (Array[Symbol] locals, Location operator_loc, Location opening_loc, Location closing_loc, Prism::node? parameters, Prism::node? body, Location location) -> void # # @return [LambdaNode] a new instance of LambdaNode # - # source://prism//lib/prism/node.rb#11828 + # source://prism//lib/prism/node.rb#11800 sig do params( source: Prism::Source, @@ -20771,54 +20795,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#11956 + # source://prism//lib/prism/node.rb#11927 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11841 + # source://prism//lib/prism/node.rb#11812 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader body: Prism::node? # - # source://prism//lib/prism/node.rb#11904 + # source://prism//lib/prism/node.rb#11875 sig { returns(T.nilable(Prism::Node)) } def body; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11846 + # source://prism//lib/prism/node.rb#11817 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#11917 + # source://prism//lib/prism/node.rb#11888 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#11894 + # source://prism//lib/prism/node.rb#11865 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11859 + # source://prism//lib/prism/node.rb#11830 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#11851 + # source://prism//lib/prism/node.rb#11822 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?locals: Array[Symbol], ?operator_loc: Location, ?opening_loc: Location, ?closing_loc: Location, ?parameters: Prism::node?, ?body: Prism::node?, ?location: Location) -> LambdaNode # - # source://prism//lib/prism/node.rb#11864 + # source://prism//lib/prism/node.rb#11835 sig do params( locals: T::Array[Symbol], @@ -20835,13 +20859,13 @@ class Prism::LambdaNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11846 + # source://prism//lib/prism/node.rb#11817 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], operator_loc: Location, opening_loc: Location, closing_loc: Location, parameters: Prism::node?, body: Prism::node?, location: Location } # - # source://prism//lib/prism/node.rb#11872 + # source://prism//lib/prism/node.rb#11843 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -20850,43 +20874,43 @@ class Prism::LambdaNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#11922 + # source://prism//lib/prism/node.rb#11893 sig { override.returns(String) } def inspect; end # attr_reader locals: Array[Symbol] # - # source://prism//lib/prism/node.rb#11877 + # source://prism//lib/prism/node.rb#11848 sig { returns(T::Array[Symbol]) } def locals; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#11912 + # source://prism//lib/prism/node.rb#11883 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#11887 + # source://prism//lib/prism/node.rb#11858 sig { returns(Prism::Location) } def opening_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#11907 + # source://prism//lib/prism/node.rb#11878 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#11880 + # source://prism//lib/prism/node.rb#11851 sig { returns(Prism::Location) } def operator_loc; end # attr_reader parameters: Prism::node? # - # source://prism//lib/prism/node.rb#11901 + # source://prism//lib/prism/node.rb#11872 sig { returns(T.nilable(Prism::Node)) } def parameters; end @@ -20905,7 +20929,7 @@ class Prism::LambdaNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#11940 + # source://prism//lib/prism/node.rb#11911 sig { override.returns(Symbol) } def type; end @@ -20917,7 +20941,7 @@ class Prism::LambdaNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#11950 + # source://prism//lib/prism/node.rb#11921 def type; end end end @@ -21124,7 +21148,7 @@ 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#15 +# 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. # @@ -21148,7 +21172,7 @@ 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#205 +# source://prism//lib/prism/lex_compat.rb#204 class Prism::LexCompat::Token < ::SimpleDelegator # The type of the token. # @@ -21173,13 +21197,13 @@ end # This is a result specific to the `lex` and `lex_file` methods. # -# source://prism//lib/prism/parse_result.rb#594 +# source://prism//lib/prism/parse_result.rb#610 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#598 + # source://prism//lib/prism/parse_result.rb#615 sig do params( value: T::Array[T.untyped], @@ -21195,13 +21219,13 @@ class Prism::LexResult < ::Prism::Result # Implement the hash pattern matching interface for LexResult. # - # source://prism//lib/prism/parse_result.rb#604 + # source://prism//lib/prism/parse_result.rb#621 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#595 + # source://prism//lib/prism/parse_result.rb#612 sig { returns(T::Array[T.untyped]) } def value; end end @@ -21233,13 +21257,13 @@ end # target &&= value # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#11973 +# source://prism//lib/prism/node.rb#11943 class Prism::LocalVariableAndWriteNode < ::Prism::Node # def initialize: (Location name_loc, Location operator_loc, Prism::node value, Symbol name, Integer depth, Location location) -> void # # @return [LocalVariableAndWriteNode] a new instance of LocalVariableAndWriteNode # - # source://prism//lib/prism/node.rb#11974 + # source://prism//lib/prism/node.rb#11945 sig do params( source: Prism::Source, @@ -21256,36 +21280,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#12081 + # source://prism//lib/prism/node.rb#12051 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11986 + # source://prism//lib/prism/node.rb#11956 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#11991 + # source://prism//lib/prism/node.rb#11961 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12001 + # source://prism//lib/prism/node.rb#11971 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#11996 + # source://prism//lib/prism/node.rb#11966 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?name: Symbol, ?depth: Integer, ?location: Location) -> LocalVariableAndWriteNode # - # source://prism//lib/prism/node.rb#12006 + # source://prism//lib/prism/node.rb#11976 sig do params( name_loc: Prism::Location, @@ -21301,19 +21325,19 @@ class Prism::LocalVariableAndWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11991 + # source://prism//lib/prism/node.rb#11961 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name_loc: Location, operator_loc: Location, value: Prism::node, name: Symbol, depth: Integer, location: Location } # - # source://prism//lib/prism/node.rb#12014 + # source://prism//lib/prism/node.rb#11984 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#12039 + # source://prism//lib/prism/node.rb#12009 sig { returns(Integer) } def depth; end @@ -21325,31 +21349,31 @@ class Prism::LocalVariableAndWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#12047 + # source://prism//lib/prism/node.rb#12017 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#12036 + # source://prism//lib/prism/node.rb#12006 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#12019 + # source://prism//lib/prism/node.rb#11989 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#12042 + # source://prism//lib/prism/node.rb#12012 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#12026 + # source://prism//lib/prism/node.rb#11996 sig { returns(Prism::Location) } def operator_loc; end @@ -21368,13 +21392,13 @@ class Prism::LocalVariableAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#12065 + # source://prism//lib/prism/node.rb#12035 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#12033 + # source://prism//lib/prism/node.rb#12003 sig { returns(Prism::Node) } def value; end @@ -21386,7 +21410,7 @@ class Prism::LocalVariableAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#12075 + # source://prism//lib/prism/node.rb#12045 def type; end end end @@ -21396,13 +21420,13 @@ end # target += value # ^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#12096 +# source://prism//lib/prism/node.rb#12065 class Prism::LocalVariableOperatorWriteNode < ::Prism::Node # def initialize: (Location name_loc, Location binary_operator_loc, Prism::node value, Symbol name, Symbol binary_operator, Integer depth, Location location) -> void # # @return [LocalVariableOperatorWriteNode] a new instance of LocalVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#12097 + # source://prism//lib/prism/node.rb#12067 sig do params( source: Prism::Source, @@ -21420,48 +21444,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#12203 + # source://prism//lib/prism/node.rb#12172 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12110 + # source://prism//lib/prism/node.rb#12079 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader binary_operator: Symbol # - # source://prism//lib/prism/node.rb#12163 + # source://prism//lib/prism/node.rb#12132 sig { returns(Symbol) } def binary_operator; end # attr_reader binary_operator_loc: Location # - # source://prism//lib/prism/node.rb#12150 + # source://prism//lib/prism/node.rb#12119 sig { returns(Prism::Location) } def binary_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12115 + # source://prism//lib/prism/node.rb#12084 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12125 + # source://prism//lib/prism/node.rb#12094 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#12120 + # source://prism//lib/prism/node.rb#12089 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?name: Symbol, ?binary_operator: Symbol, ?depth: Integer, ?location: Location) -> LocalVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#12130 + # source://prism//lib/prism/node.rb#12099 sig do params( name_loc: Prism::Location, @@ -21478,19 +21502,19 @@ class Prism::LocalVariableOperatorWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12115 + # source://prism//lib/prism/node.rb#12084 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name_loc: Location, binary_operator_loc: Location, value: Prism::node, name: Symbol, binary_operator: Symbol, depth: Integer, location: Location } # - # source://prism//lib/prism/node.rb#12138 + # source://prism//lib/prism/node.rb#12107 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#12166 + # source://prism//lib/prism/node.rb#12135 sig { returns(Integer) } def depth; end @@ -21502,32 +21526,32 @@ class Prism::LocalVariableOperatorWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#12169 + # source://prism//lib/prism/node.rb#12138 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#12160 + # source://prism//lib/prism/node.rb#12129 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#12143 + # source://prism//lib/prism/node.rb#12112 sig { returns(Prism::Location) } def name_loc; end # Returns the binary operator used to modify the receiver. This method is # deprecated in favor of #binary_operator. # - # source://prism//lib/prism/node_ext.rb#419 + # 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#426 + # source://prism//lib/prism/node_ext.rb#442 def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -21545,13 +21569,13 @@ class Prism::LocalVariableOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#12187 + # source://prism//lib/prism/node.rb#12156 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#12157 + # source://prism//lib/prism/node.rb#12126 sig { returns(Prism::Node) } def value; end @@ -21563,7 +21587,7 @@ class Prism::LocalVariableOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#12197 + # source://prism//lib/prism/node.rb#12166 def type; end end end @@ -21573,13 +21597,13 @@ end # target ||= value # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#12219 +# source://prism//lib/prism/node.rb#12187 class Prism::LocalVariableOrWriteNode < ::Prism::Node # def initialize: (Location name_loc, Location operator_loc, Prism::node value, Symbol name, Integer depth, Location location) -> void # # @return [LocalVariableOrWriteNode] a new instance of LocalVariableOrWriteNode # - # source://prism//lib/prism/node.rb#12220 + # source://prism//lib/prism/node.rb#12189 sig do params( source: Prism::Source, @@ -21596,36 +21620,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#12327 + # source://prism//lib/prism/node.rb#12295 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12232 + # source://prism//lib/prism/node.rb#12200 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#12237 + # source://prism//lib/prism/node.rb#12205 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12247 + # source://prism//lib/prism/node.rb#12215 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#12242 + # source://prism//lib/prism/node.rb#12210 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?name: Symbol, ?depth: Integer, ?location: Location) -> LocalVariableOrWriteNode # - # source://prism//lib/prism/node.rb#12252 + # source://prism//lib/prism/node.rb#12220 sig do params( name_loc: Prism::Location, @@ -21641,19 +21665,19 @@ class Prism::LocalVariableOrWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12237 + # source://prism//lib/prism/node.rb#12205 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name_loc: Location, operator_loc: Location, value: Prism::node, name: Symbol, depth: Integer, location: Location } # - # source://prism//lib/prism/node.rb#12260 + # source://prism//lib/prism/node.rb#12228 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#12285 + # source://prism//lib/prism/node.rb#12253 sig { returns(Integer) } def depth; end @@ -21665,31 +21689,31 @@ class Prism::LocalVariableOrWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#12293 + # source://prism//lib/prism/node.rb#12261 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#12282 + # source://prism//lib/prism/node.rb#12250 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#12265 + # source://prism//lib/prism/node.rb#12233 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#12288 + # source://prism//lib/prism/node.rb#12256 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#12272 + # source://prism//lib/prism/node.rb#12240 sig { returns(Prism::Location) } def operator_loc; end @@ -21708,13 +21732,13 @@ class Prism::LocalVariableOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#12311 + # source://prism//lib/prism/node.rb#12279 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#12279 + # source://prism//lib/prism/node.rb#12247 sig { returns(Prism::Node) } def value; end @@ -21726,7 +21750,7 @@ class Prism::LocalVariableOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#12321 + # source://prism//lib/prism/node.rb#12289 def type; end end end @@ -21736,62 +21760,62 @@ end # foo # ^^^ # -# source://prism//lib/prism/node.rb#12342 +# source://prism//lib/prism/node.rb#12309 class Prism::LocalVariableReadNode < ::Prism::Node # def initialize: (Symbol name, Integer depth, Location location) -> void # # @return [LocalVariableReadNode] a new instance of LocalVariableReadNode # - # source://prism//lib/prism/node.rb#12343 + # source://prism//lib/prism/node.rb#12311 sig { params(source: Prism::Source, name: Symbol, depth: Integer, location: Prism::Location).void } def initialize(source, name, depth, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#12443 + # source://prism//lib/prism/node.rb#12406 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12352 + # source://prism//lib/prism/node.rb#12319 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#12357 + # source://prism//lib/prism/node.rb#12324 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12367 + # source://prism//lib/prism/node.rb#12334 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#12362 + # source://prism//lib/prism/node.rb#12329 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?depth: Integer, ?location: Location) -> LocalVariableReadNode # - # source://prism//lib/prism/node.rb#12372 + # source://prism//lib/prism/node.rb#12339 sig { params(name: Symbol, depth: Integer, location: Prism::Location).returns(Prism::LocalVariableReadNode) } def copy(name: T.unsafe(nil), depth: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12357 + # source://prism//lib/prism/node.rb#12324 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, depth: Integer, location: Location } # - # source://prism//lib/prism/node.rb#12380 + # source://prism//lib/prism/node.rb#12347 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -21803,7 +21827,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#12406 + # source://prism//lib/prism/node.rb#12369 sig { returns(Integer) } def depth; end @@ -21812,7 +21836,7 @@ class Prism::LocalVariableReadNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#12409 + # source://prism//lib/prism/node.rb#12372 sig { override.returns(String) } def inspect; end @@ -21826,11 +21850,7 @@ class Prism::LocalVariableReadNode < ::Prism::Node # # _1 # name `:_1` # - # Finally, for the default `it` block parameter, the name is `0it`. This is to distinguish it from an `it` local variable that is explicitly declared. - # - # it # name `:0it` - # - # source://prism//lib/prism/node.rb#12397 + # source://prism//lib/prism/node.rb#12360 sig { returns(Symbol) } def name; end @@ -21849,7 +21869,7 @@ class Prism::LocalVariableReadNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#12427 + # source://prism//lib/prism/node.rb#12390 sig { override.returns(Symbol) } def type; end @@ -21861,7 +21881,7 @@ class Prism::LocalVariableReadNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#12437 + # source://prism//lib/prism/node.rb#12400 def type; end end end @@ -21871,68 +21891,68 @@ end # foo, bar = baz # ^^^ ^^^ # -# source://prism//lib/prism/node.rb#12455 +# source://prism//lib/prism/node.rb#12417 class Prism::LocalVariableTargetNode < ::Prism::Node # def initialize: (Symbol name, Integer depth, Location location) -> void # # @return [LocalVariableTargetNode] a new instance of LocalVariableTargetNode # - # source://prism//lib/prism/node.rb#12456 + # source://prism//lib/prism/node.rb#12419 sig { params(source: Prism::Source, name: Symbol, depth: Integer, location: Prism::Location).void } def initialize(source, name, depth, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#12538 + # source://prism//lib/prism/node.rb#12500 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12465 + # source://prism//lib/prism/node.rb#12427 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#12470 + # source://prism//lib/prism/node.rb#12432 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12480 + # source://prism//lib/prism/node.rb#12442 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#12475 + # source://prism//lib/prism/node.rb#12437 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?depth: Integer, ?location: Location) -> LocalVariableTargetNode # - # source://prism//lib/prism/node.rb#12485 + # source://prism//lib/prism/node.rb#12447 sig { params(name: Symbol, depth: Integer, location: Prism::Location).returns(Prism::LocalVariableTargetNode) } def copy(name: T.unsafe(nil), depth: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12470 + # source://prism//lib/prism/node.rb#12432 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, depth: Integer, location: Location } # - # source://prism//lib/prism/node.rb#12493 + # source://prism//lib/prism/node.rb#12455 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#12501 + # source://prism//lib/prism/node.rb#12463 sig { returns(Integer) } def depth; end @@ -21941,13 +21961,13 @@ class Prism::LocalVariableTargetNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#12504 + # source://prism//lib/prism/node.rb#12466 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#12498 + # source://prism//lib/prism/node.rb#12460 sig { returns(Symbol) } def name; end @@ -21966,7 +21986,7 @@ class Prism::LocalVariableTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#12522 + # source://prism//lib/prism/node.rb#12484 sig { override.returns(Symbol) } def type; end @@ -21978,7 +21998,7 @@ class Prism::LocalVariableTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#12532 + # source://prism//lib/prism/node.rb#12494 def type; end end end @@ -21988,13 +22008,13 @@ end # foo = 1 # ^^^^^^^ # -# source://prism//lib/prism/node.rb#12550 +# source://prism//lib/prism/node.rb#12511 class Prism::LocalVariableWriteNode < ::Prism::Node # def initialize: (Symbol name, Integer depth, Location name_loc, Prism::node value, Location operator_loc, Location location) -> void # # @return [LocalVariableWriteNode] a new instance of LocalVariableWriteNode # - # source://prism//lib/prism/node.rb#12551 + # source://prism//lib/prism/node.rb#12513 sig do params( source: Prism::Source, @@ -22011,36 +22031,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#12684 + # source://prism//lib/prism/node.rb#12645 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12563 + # source://prism//lib/prism/node.rb#12524 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#12568 + # source://prism//lib/prism/node.rb#12529 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12578 + # source://prism//lib/prism/node.rb#12539 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#12573 + # source://prism//lib/prism/node.rb#12534 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?name: Symbol, ?depth: Integer, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location, ?location: Location) -> LocalVariableWriteNode # - # source://prism//lib/prism/node.rb#12583 + # source://prism//lib/prism/node.rb#12544 sig do params( name: Symbol, @@ -22056,13 +22076,13 @@ class Prism::LocalVariableWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12568 + # source://prism//lib/prism/node.rb#12529 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, depth: Integer, name_loc: Location, value: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#12591 + # source://prism//lib/prism/node.rb#12552 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -22074,7 +22094,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#12609 + # source://prism//lib/prism/node.rb#12570 sig { returns(Integer) } def depth; end @@ -22083,7 +22103,7 @@ class Prism::LocalVariableWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#12650 + # source://prism//lib/prism/node.rb#12611 sig { override.returns(String) } def inspect; end @@ -22093,7 +22113,7 @@ class Prism::LocalVariableWriteNode < ::Prism::Node # # abc = 123 # name `:abc` # - # source://prism//lib/prism/node.rb#12600 + # source://prism//lib/prism/node.rb#12561 sig { returns(Symbol) } def name; end @@ -22102,13 +22122,13 @@ class Prism::LocalVariableWriteNode < ::Prism::Node # foo = :bar # ^^^ # - # source://prism//lib/prism/node.rb#12615 + # source://prism//lib/prism/node.rb#12576 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#12645 + # source://prism//lib/prism/node.rb#12606 sig { returns(String) } def operator; end @@ -22117,7 +22137,7 @@ class Prism::LocalVariableWriteNode < ::Prism::Node # x = :y # ^ # - # source://prism//lib/prism/node.rb#12638 + # source://prism//lib/prism/node.rb#12599 sig { returns(Prism::Location) } def operator_loc; end @@ -22136,7 +22156,7 @@ class Prism::LocalVariableWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#12668 + # source://prism//lib/prism/node.rb#12629 sig { override.returns(Symbol) } def type; end @@ -22152,7 +22172,7 @@ class Prism::LocalVariableWriteNode < ::Prism::Node # # foo = foo # - # source://prism//lib/prism/node.rb#12632 + # source://prism//lib/prism/node.rb#12593 sig { returns(Prism::Node) } def value; end @@ -22164,7 +22184,7 @@ class Prism::LocalVariableWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#12678 + # source://prism//lib/prism/node.rb#12639 def type; end end end @@ -22403,12 +22423,12 @@ end # Flags for while and until loop nodes. # -# source://prism//lib/prism/node.rb#19271 +# source://prism//lib/prism/node.rb#19196 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#19273 +# source://prism//lib/prism/node.rb#19198 Prism::LoopFlags::BEGIN_MODIFIER = T.let(T.unsafe(nil), Integer) # This represents a magic comment that was encountered during parsing. @@ -22465,7 +22485,7 @@ end # if /foo/i then end # ^^^^^^ # -# source://prism//lib/prism/node.rb#12699 +# source://prism//lib/prism/node.rb#12659 class Prism::MatchLastLineNode < ::Prism::Node include ::Prism::RegularExpressionOptions @@ -22473,7 +22493,7 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [MatchLastLineNode] a new instance of MatchLastLineNode # - # source://prism//lib/prism/node.rb#12700 + # source://prism//lib/prism/node.rb#12661 sig do params( source: Prism::Source, @@ -22490,12 +22510,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#12877 + # source://prism//lib/prism/node.rb#12837 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12712 + # source://prism//lib/prism/node.rb#12672 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -22503,55 +22523,55 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12798 + # source://prism//lib/prism/node.rb#12758 sig { returns(T::Boolean) } def ascii_8bit?; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12717 + # source://prism//lib/prism/node.rb#12677 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#12838 + # source://prism//lib/prism/node.rb#12798 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#12763 + # source://prism//lib/prism/node.rb#12723 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12727 + # source://prism//lib/prism/node.rb#12687 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#12722 + # source://prism//lib/prism/node.rb#12682 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def content: () -> String # - # source://prism//lib/prism/node.rb#12833 + # source://prism//lib/prism/node.rb#12793 sig { returns(String) } def content; end # attr_reader content_loc: Location # - # source://prism//lib/prism/node.rb#12756 + # source://prism//lib/prism/node.rb#12716 sig { returns(Prism::Location) } def content_loc; end # def copy: (?flags: Integer, ?opening_loc: Location, ?content_loc: Location, ?closing_loc: Location, ?unescaped: String, ?location: Location) -> MatchLastLineNode # - # source://prism//lib/prism/node.rb#12732 + # source://prism//lib/prism/node.rb#12692 sig do params( flags: Integer, @@ -22567,13 +22587,13 @@ class Prism::MatchLastLineNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12717 + # source://prism//lib/prism/node.rb#12677 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String, location: Location } # - # source://prism//lib/prism/node.rb#12740 + # source://prism//lib/prism/node.rb#12700 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -22581,7 +22601,7 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12793 + # source://prism//lib/prism/node.rb#12753 sig { returns(T::Boolean) } def euc_jp?; end @@ -22589,7 +22609,7 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12778 + # source://prism//lib/prism/node.rb#12738 sig { returns(T::Boolean) } def extended?; end @@ -22600,7 +22620,7 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12818 + # source://prism//lib/prism/node.rb#12778 sig { returns(T::Boolean) } def forced_binary_encoding?; end @@ -22608,7 +22628,7 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12823 + # source://prism//lib/prism/node.rb#12783 sig { returns(T::Boolean) } def forced_us_ascii_encoding?; end @@ -22616,7 +22636,7 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12813 + # source://prism//lib/prism/node.rb#12773 sig { returns(T::Boolean) } def forced_utf8_encoding?; end @@ -22624,13 +22644,13 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12773 + # source://prism//lib/prism/node.rb#12733 sig { returns(T::Boolean) } def ignore_case?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#12843 + # source://prism//lib/prism/node.rb#12803 sig { override.returns(String) } def inspect; end @@ -22638,7 +22658,7 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12783 + # source://prism//lib/prism/node.rb#12743 sig { returns(T::Boolean) } def multi_line?; end @@ -22646,19 +22666,19 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12788 + # source://prism//lib/prism/node.rb#12748 sig { returns(T::Boolean) } def once?; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#12828 + # source://prism//lib/prism/node.rb#12788 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#12749 + # source://prism//lib/prism/node.rb#12709 sig { returns(Prism::Location) } def opening_loc; end @@ -22680,13 +22700,13 @@ class Prism::MatchLastLineNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#12861 + # source://prism//lib/prism/node.rb#12821 sig { override.returns(Symbol) } def type; end # attr_reader unescaped: String # - # source://prism//lib/prism/node.rb#12770 + # source://prism//lib/prism/node.rb#12730 sig { returns(String) } def unescaped; end @@ -22694,7 +22714,7 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12808 + # source://prism//lib/prism/node.rb#12768 sig { returns(T::Boolean) } def utf_8?; end @@ -22702,7 +22722,7 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12803 + # source://prism//lib/prism/node.rb#12763 sig { returns(T::Boolean) } def windows_31j?; end @@ -22710,7 +22730,7 @@ class Prism::MatchLastLineNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#12745 + # source://prism//lib/prism/node.rb#12705 sig { returns(Integer) } def flags; end @@ -22722,7 +22742,7 @@ class Prism::MatchLastLineNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#12871 + # source://prism//lib/prism/node.rb#12831 def type; end end end @@ -22732,13 +22752,13 @@ end # foo in bar # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#12892 +# source://prism//lib/prism/node.rb#12851 class Prism::MatchPredicateNode < ::Prism::Node # def initialize: (Prism::node value, Prism::node pattern, Location operator_loc, Location location) -> void # # @return [MatchPredicateNode] a new instance of MatchPredicateNode # - # source://prism//lib/prism/node.rb#12893 + # source://prism//lib/prism/node.rb#12853 sig do params( source: Prism::Source, @@ -22753,36 +22773,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#12988 + # source://prism//lib/prism/node.rb#12947 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12903 + # source://prism//lib/prism/node.rb#12862 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#12908 + # source://prism//lib/prism/node.rb#12867 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12918 + # source://prism//lib/prism/node.rb#12877 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#12913 + # source://prism//lib/prism/node.rb#12872 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?value: Prism::node, ?pattern: Prism::node, ?operator_loc: Location, ?location: Location) -> MatchPredicateNode # - # source://prism//lib/prism/node.rb#12923 + # source://prism//lib/prism/node.rb#12882 sig do params( value: Prism::Node, @@ -22796,13 +22816,13 @@ class Prism::MatchPredicateNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12908 + # source://prism//lib/prism/node.rb#12867 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { value: Prism::node, pattern: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#12931 + # source://prism//lib/prism/node.rb#12890 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -22811,25 +22831,25 @@ class Prism::MatchPredicateNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#12954 + # source://prism//lib/prism/node.rb#12913 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#12949 + # source://prism//lib/prism/node.rb#12908 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#12942 + # source://prism//lib/prism/node.rb#12901 sig { returns(Prism::Location) } def operator_loc; end # attr_reader pattern: Prism::node # - # source://prism//lib/prism/node.rb#12939 + # source://prism//lib/prism/node.rb#12898 sig { returns(Prism::Node) } def pattern; end @@ -22848,13 +22868,13 @@ class Prism::MatchPredicateNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#12972 + # source://prism//lib/prism/node.rb#12931 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#12936 + # source://prism//lib/prism/node.rb#12895 sig { returns(Prism::Node) } def value; end @@ -22866,7 +22886,7 @@ class Prism::MatchPredicateNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#12982 + # source://prism//lib/prism/node.rb#12941 def type; end end end @@ -22876,13 +22896,13 @@ end # foo => bar # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#13001 +# source://prism//lib/prism/node.rb#12959 class Prism::MatchRequiredNode < ::Prism::Node # def initialize: (Prism::node value, Prism::node pattern, Location operator_loc, Location location) -> void # # @return [MatchRequiredNode] a new instance of MatchRequiredNode # - # source://prism//lib/prism/node.rb#13002 + # source://prism//lib/prism/node.rb#12961 sig do params( source: Prism::Source, @@ -22897,36 +22917,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#13097 + # source://prism//lib/prism/node.rb#13055 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13012 + # source://prism//lib/prism/node.rb#12970 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#13017 + # source://prism//lib/prism/node.rb#12975 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#13027 + # source://prism//lib/prism/node.rb#12985 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#13022 + # source://prism//lib/prism/node.rb#12980 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?value: Prism::node, ?pattern: Prism::node, ?operator_loc: Location, ?location: Location) -> MatchRequiredNode # - # source://prism//lib/prism/node.rb#13032 + # source://prism//lib/prism/node.rb#12990 sig do params( value: Prism::Node, @@ -22940,13 +22960,13 @@ class Prism::MatchRequiredNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13017 + # source://prism//lib/prism/node.rb#12975 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { value: Prism::node, pattern: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#13040 + # source://prism//lib/prism/node.rb#12998 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -22955,25 +22975,25 @@ class Prism::MatchRequiredNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#13063 + # source://prism//lib/prism/node.rb#13021 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#13058 + # source://prism//lib/prism/node.rb#13016 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#13051 + # source://prism//lib/prism/node.rb#13009 sig { returns(Prism::Location) } def operator_loc; end # attr_reader pattern: Prism::node # - # source://prism//lib/prism/node.rb#13048 + # source://prism//lib/prism/node.rb#13006 sig { returns(Prism::Node) } def pattern; end @@ -22992,13 +23012,13 @@ class Prism::MatchRequiredNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#13081 + # source://prism//lib/prism/node.rb#13039 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#13045 + # source://prism//lib/prism/node.rb#13003 sig { returns(Prism::Node) } def value; end @@ -23010,7 +23030,7 @@ class Prism::MatchRequiredNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#13091 + # source://prism//lib/prism/node.rb#13049 def type; end end end @@ -23020,13 +23040,13 @@ end # /(?bar)/ =~ baz # ^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#13110 +# source://prism//lib/prism/node.rb#13067 class Prism::MatchWriteNode < ::Prism::Node # def initialize: (CallNode call, Array[LocalVariableTargetNode] targets, Location location) -> void # # @return [MatchWriteNode] a new instance of MatchWriteNode # - # source://prism//lib/prism/node.rb#13111 + # source://prism//lib/prism/node.rb#13069 sig do params( source: Prism::Source, @@ -23040,42 +23060,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#13193 + # source://prism//lib/prism/node.rb#13150 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13120 + # source://prism//lib/prism/node.rb#13077 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader call: CallNode # - # source://prism//lib/prism/node.rb#13153 + # source://prism//lib/prism/node.rb#13110 sig { returns(Prism::CallNode) } def call; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13125 + # source://prism//lib/prism/node.rb#13082 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#13135 + # source://prism//lib/prism/node.rb#13092 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#13130 + # source://prism//lib/prism/node.rb#13087 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?call: CallNode, ?targets: Array[LocalVariableTargetNode], ?location: Location) -> MatchWriteNode # - # source://prism//lib/prism/node.rb#13140 + # source://prism//lib/prism/node.rb#13097 sig do params( call: Prism::CallNode, @@ -23088,13 +23108,13 @@ class Prism::MatchWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13125 + # source://prism//lib/prism/node.rb#13082 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { call: CallNode, targets: Array[LocalVariableTargetNode], location: Location } # - # source://prism//lib/prism/node.rb#13148 + # source://prism//lib/prism/node.rb#13105 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -23103,13 +23123,13 @@ class Prism::MatchWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#13159 + # source://prism//lib/prism/node.rb#13116 sig { override.returns(String) } def inspect; end # attr_reader targets: Array[LocalVariableTargetNode] # - # source://prism//lib/prism/node.rb#13156 + # source://prism//lib/prism/node.rb#13113 sig { returns(T::Array[Prism::LocalVariableTargetNode]) } def targets; end @@ -23128,7 +23148,7 @@ class Prism::MatchWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#13177 + # source://prism//lib/prism/node.rb#13134 sig { override.returns(Symbol) } def type; end @@ -23140,69 +23160,69 @@ class Prism::MatchWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#13187 + # source://prism//lib/prism/node.rb#13144 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#13203 +# source://prism//lib/prism/node.rb#13159 class Prism::MissingNode < ::Prism::Node # def initialize: (Location location) -> void # # @return [MissingNode] a new instance of MissingNode # - # source://prism//lib/prism/node.rb#13204 + # source://prism//lib/prism/node.rb#13161 sig { params(source: Prism::Source, location: Prism::Location).void } def initialize(source, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#13278 + # source://prism//lib/prism/node.rb#13234 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13211 + # source://prism//lib/prism/node.rb#13167 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#13216 + # source://prism//lib/prism/node.rb#13172 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#13226 + # source://prism//lib/prism/node.rb#13182 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#13221 + # source://prism//lib/prism/node.rb#13177 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?location: Location) -> MissingNode # - # source://prism//lib/prism/node.rb#13231 + # source://prism//lib/prism/node.rb#13187 sig { params(location: Prism::Location).returns(Prism::MissingNode) } def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13216 + # source://prism//lib/prism/node.rb#13172 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#13239 + # source://prism//lib/prism/node.rb#13195 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -23211,7 +23231,7 @@ class Prism::MissingNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#13244 + # source://prism//lib/prism/node.rb#13200 sig { override.returns(String) } def inspect; end @@ -23230,7 +23250,7 @@ class Prism::MissingNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#13262 + # source://prism//lib/prism/node.rb#13218 sig { override.returns(Symbol) } def type; end @@ -23242,7 +23262,7 @@ class Prism::MissingNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#13272 + # source://prism//lib/prism/node.rb#13228 def type; end end end @@ -23252,13 +23272,13 @@ end # module Foo end # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#13288 +# source://prism//lib/prism/node.rb#13243 class Prism::ModuleNode < ::Prism::Node # def initialize: (Array[Symbol] locals, Location module_keyword_loc, Prism::node constant_path, Prism::node? body, Location end_keyword_loc, Symbol name, Location location) -> void # # @return [ModuleNode] a new instance of ModuleNode # - # source://prism//lib/prism/node.rb#13289 + # source://prism//lib/prism/node.rb#13245 sig do params( source: Prism::Source, @@ -23276,48 +23296,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#13408 + # source://prism//lib/prism/node.rb#13363 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13302 + # source://prism//lib/prism/node.rb#13257 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader body: Prism::node? # - # source://prism//lib/prism/node.rb#13351 + # source://prism//lib/prism/node.rb#13306 sig { returns(T.nilable(Prism::Node)) } def body; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13307 + # source://prism//lib/prism/node.rb#13262 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#13320 + # source://prism//lib/prism/node.rb#13275 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#13312 + # source://prism//lib/prism/node.rb#13267 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # attr_reader constant_path: Prism::node # - # source://prism//lib/prism/node.rb#13348 + # source://prism//lib/prism/node.rb#13303 sig { returns(Prism::Node) } def constant_path; end # def copy: (?locals: Array[Symbol], ?module_keyword_loc: Location, ?constant_path: Prism::node, ?body: Prism::node?, ?end_keyword_loc: Location, ?name: Symbol, ?location: Location) -> ModuleNode # - # source://prism//lib/prism/node.rb#13325 + # source://prism//lib/prism/node.rb#13280 sig do params( locals: T::Array[Symbol], @@ -23334,25 +23354,25 @@ class Prism::ModuleNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13307 + # source://prism//lib/prism/node.rb#13262 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], module_keyword_loc: Location, constant_path: Prism::node, body: Prism::node?, end_keyword_loc: Location, name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#13333 + # source://prism//lib/prism/node.rb#13288 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#13369 + # source://prism//lib/prism/node.rb#13324 sig { returns(String) } def end_keyword; end # attr_reader end_keyword_loc: Location # - # source://prism//lib/prism/node.rb#13354 + # source://prism//lib/prism/node.rb#13309 sig { returns(Prism::Location) } def end_keyword_loc; end @@ -23361,31 +23381,31 @@ class Prism::ModuleNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#13374 + # source://prism//lib/prism/node.rb#13329 sig { override.returns(String) } def inspect; end # attr_reader locals: Array[Symbol] # - # source://prism//lib/prism/node.rb#13338 + # source://prism//lib/prism/node.rb#13293 sig { returns(T::Array[Symbol]) } def locals; end # def module_keyword: () -> String # - # source://prism//lib/prism/node.rb#13364 + # source://prism//lib/prism/node.rb#13319 sig { returns(String) } def module_keyword; end # attr_reader module_keyword_loc: Location # - # source://prism//lib/prism/node.rb#13341 + # source://prism//lib/prism/node.rb#13296 sig { returns(Prism::Location) } def module_keyword_loc; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#13361 + # source://prism//lib/prism/node.rb#13316 sig { returns(Symbol) } def name; end @@ -23404,7 +23424,7 @@ class Prism::ModuleNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#13392 + # source://prism//lib/prism/node.rb#13347 sig { override.returns(Symbol) } def type; end @@ -23416,7 +23436,7 @@ class Prism::ModuleNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#13402 + # source://prism//lib/prism/node.rb#13357 def type; end end end @@ -23426,13 +23446,13 @@ end # a, (b, c) = 1, 2, 3 # ^^^^^^ # -# source://prism//lib/prism/node.rb#13425 +# source://prism//lib/prism/node.rb#13379 class Prism::MultiTargetNode < ::Prism::Node # def initialize: (Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode] lefts, Prism::node? rest, Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode] rights, Location? lparen_loc, Location? rparen_loc, Location location) -> void # # @return [MultiTargetNode] a new instance of MultiTargetNode # - # source://prism//lib/prism/node.rb#13426 + # source://prism//lib/prism/node.rb#13381 sig do params( source: Prism::Source, @@ -23449,36 +23469,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#13554 + # source://prism//lib/prism/node.rb#13508 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13438 + # source://prism//lib/prism/node.rb#13392 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#13443 + # source://prism//lib/prism/node.rb#13397 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#13457 + # source://prism//lib/prism/node.rb#13411 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#13448 + # source://prism//lib/prism/node.rb#13402 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode], ?rest: Prism::node?, ?rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode], ?lparen_loc: Location?, ?rparen_loc: Location?, ?location: Location) -> MultiTargetNode # - # source://prism//lib/prism/node.rb#13462 + # source://prism//lib/prism/node.rb#13416 sig do params( lefts: T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::RequiredParameterNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)], @@ -23494,13 +23514,13 @@ class Prism::MultiTargetNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13443 + # source://prism//lib/prism/node.rb#13397 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode], rest: Prism::node?, rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode], lparen_loc: Location?, rparen_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#13470 + # source://prism//lib/prism/node.rb#13424 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -23509,13 +23529,13 @@ class Prism::MultiTargetNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#13520 + # source://prism//lib/prism/node.rb#13474 sig { override.returns(String) } def inspect; end # attr_reader lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode] # - # source://prism//lib/prism/node.rb#13475 + # source://prism//lib/prism/node.rb#13429 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 @@ -23523,25 +23543,25 @@ class Prism::MultiTargetNode < ::Prism::Node # def lparen: () -> String? # - # source://prism//lib/prism/node.rb#13510 + # source://prism//lib/prism/node.rb#13464 sig { returns(T.nilable(String)) } def lparen; end # attr_reader lparen_loc: Location? # - # source://prism//lib/prism/node.rb#13484 + # source://prism//lib/prism/node.rb#13438 sig { returns(T.nilable(Prism::Location)) } def lparen_loc; end # attr_reader rest: Prism::node? # - # source://prism//lib/prism/node.rb#13478 + # source://prism//lib/prism/node.rb#13432 sig { returns(T.nilable(Prism::Node)) } def rest; end # attr_reader rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode] # - # source://prism//lib/prism/node.rb#13481 + # source://prism//lib/prism/node.rb#13435 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)]) end @@ -23549,13 +23569,13 @@ class Prism::MultiTargetNode < ::Prism::Node # def rparen: () -> String? # - # source://prism//lib/prism/node.rb#13515 + # source://prism//lib/prism/node.rb#13469 sig { returns(T.nilable(String)) } def rparen; end # attr_reader rparen_loc: Location? # - # source://prism//lib/prism/node.rb#13497 + # source://prism//lib/prism/node.rb#13451 sig { returns(T.nilable(Prism::Location)) } def rparen_loc; end @@ -23574,7 +23594,7 @@ class Prism::MultiTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#13538 + # source://prism//lib/prism/node.rb#13492 sig { override.returns(Symbol) } def type; end @@ -23586,7 +23606,7 @@ class Prism::MultiTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#13548 + # source://prism//lib/prism/node.rb#13502 def type; end end end @@ -23596,13 +23616,13 @@ end # a, b, c = 1, 2, 3 # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#13571 +# source://prism//lib/prism/node.rb#13524 class Prism::MultiWriteNode < ::Prism::Node # def initialize: (Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode] lefts, Prism::node? rest, Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode] rights, Location? lparen_loc, Location? rparen_loc, Location operator_loc, Prism::node value, Location location) -> void # # @return [MultiWriteNode] a new instance of MultiWriteNode # - # source://prism//lib/prism/node.rb#13572 + # source://prism//lib/prism/node.rb#13526 sig do params( source: Prism::Source, @@ -23621,36 +23641,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#13718 + # source://prism//lib/prism/node.rb#13671 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13586 + # source://prism//lib/prism/node.rb#13539 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#13591 + # source://prism//lib/prism/node.rb#13544 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#13606 + # source://prism//lib/prism/node.rb#13559 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#13596 + # source://prism//lib/prism/node.rb#13549 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode], ?rest: Prism::node?, ?rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode], ?lparen_loc: Location?, ?rparen_loc: Location?, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> MultiWriteNode # - # source://prism//lib/prism/node.rb#13611 + # source://prism//lib/prism/node.rb#13564 sig do params( lefts: T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode)], @@ -23668,13 +23688,13 @@ class Prism::MultiWriteNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13591 + # source://prism//lib/prism/node.rb#13544 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode], rest: Prism::node?, rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode], lparen_loc: Location?, rparen_loc: Location?, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#13619 + # source://prism//lib/prism/node.rb#13572 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -23683,13 +23703,13 @@ class Prism::MultiWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#13684 + # source://prism//lib/prism/node.rb#13637 sig { override.returns(String) } def inspect; end # attr_reader lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode] # - # source://prism//lib/prism/node.rb#13624 + # source://prism//lib/prism/node.rb#13577 sig do returns(T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode)]) end @@ -23697,37 +23717,37 @@ class Prism::MultiWriteNode < ::Prism::Node # def lparen: () -> String? # - # source://prism//lib/prism/node.rb#13669 + # source://prism//lib/prism/node.rb#13622 sig { returns(T.nilable(String)) } def lparen; end # attr_reader lparen_loc: Location? # - # source://prism//lib/prism/node.rb#13633 + # source://prism//lib/prism/node.rb#13586 sig { returns(T.nilable(Prism::Location)) } def lparen_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#13679 + # source://prism//lib/prism/node.rb#13632 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#13659 + # source://prism//lib/prism/node.rb#13612 sig { returns(Prism::Location) } def operator_loc; end # attr_reader rest: Prism::node? # - # source://prism//lib/prism/node.rb#13627 + # source://prism//lib/prism/node.rb#13580 sig { returns(T.nilable(Prism::Node)) } def rest; end # attr_reader rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode] # - # source://prism//lib/prism/node.rb#13630 + # source://prism//lib/prism/node.rb#13583 sig do returns(T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode)]) end @@ -23735,13 +23755,13 @@ class Prism::MultiWriteNode < ::Prism::Node # def rparen: () -> String? # - # source://prism//lib/prism/node.rb#13674 + # source://prism//lib/prism/node.rb#13627 sig { returns(T.nilable(String)) } def rparen; end # attr_reader rparen_loc: Location? # - # source://prism//lib/prism/node.rb#13646 + # source://prism//lib/prism/node.rb#13599 sig { returns(T.nilable(Prism::Location)) } def rparen_loc; end @@ -23760,13 +23780,13 @@ class Prism::MultiWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#13702 + # source://prism//lib/prism/node.rb#13655 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#13666 + # source://prism//lib/prism/node.rb#13619 sig { returns(Prism::Node) } def value; end @@ -23778,7 +23798,7 @@ class Prism::MultiWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#13712 + # source://prism//lib/prism/node.rb#13665 def type; end end end @@ -23787,7 +23807,7 @@ 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#14 +# source://prism//lib/prism/mutation_compiler.rb#13 class Prism::MutationCompiler < ::Prism::Compiler # Copy a AliasGlobalVariableNode node # @@ -24224,319 +24244,324 @@ class Prism::MutationCompiler < ::Prism::Compiler # source://prism//lib/prism/mutation_compiler.rb#445 def visit_interpolated_x_string_node(node); end - # Copy a ItParametersNode node + # Copy a ItLocalVariableReadNode node # # 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 def visit_it_parameters_node(node); end # Copy a KeywordHashNode node # - # source://prism//lib/prism/mutation_compiler.rb#455 + # 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#460 + # 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#465 + # 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#470 + # 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#475 + # 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#480 + # 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#485 + # 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#490 + # 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#495 + # 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#500 + # 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#505 + # 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#510 + # 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#515 + # 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#520 + # 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#525 + # 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#530 + # 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#535 + # 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#540 + # 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#545 + # 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#550 + # 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#555 + # 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#560 + # 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#565 + # 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#570 + # 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#575 + # 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#580 + # 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#585 + # 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#590 + # 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#595 + # 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#600 + # 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#605 + # 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#610 + # 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#615 + # 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#620 + # 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#625 + # 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#630 + # 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#635 + # 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#640 + # 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#645 + # 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#650 + # 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#655 + # 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#660 + # 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#665 + # 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#670 + # 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#675 + # 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#680 + # 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#685 + # 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#690 + # 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#695 + # 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#700 + # 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#705 + # 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#710 + # 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#715 + # 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#720 + # 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#725 + # 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#730 + # 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#735 + # 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#740 + # 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#745 + # 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#750 + # 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#755 + # 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#760 + # source://prism//lib/prism/mutation_compiler.rb#765 def visit_yield_node(node); end end @@ -24545,13 +24570,13 @@ end # next 1 # ^^^^^^ # -# source://prism//lib/prism/node.rb#13737 +# source://prism//lib/prism/node.rb#13689 class Prism::NextNode < ::Prism::Node # def initialize: (ArgumentsNode? arguments, Location keyword_loc, Location location) -> void # # @return [NextNode] a new instance of NextNode # - # source://prism//lib/prism/node.rb#13738 + # source://prism//lib/prism/node.rb#13691 sig do params( source: Prism::Source, @@ -24565,42 +24590,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#13831 + # source://prism//lib/prism/node.rb#13783 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13747 + # source://prism//lib/prism/node.rb#13699 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#13782 + # source://prism//lib/prism/node.rb#13734 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13752 + # source://prism//lib/prism/node.rb#13704 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#13764 + # source://prism//lib/prism/node.rb#13716 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#13757 + # source://prism//lib/prism/node.rb#13709 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?arguments: ArgumentsNode?, ?keyword_loc: Location, ?location: Location) -> NextNode # - # source://prism//lib/prism/node.rb#13769 + # source://prism//lib/prism/node.rb#13721 sig do params( arguments: T.nilable(Prism::ArgumentsNode), @@ -24613,13 +24638,13 @@ class Prism::NextNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13752 + # source://prism//lib/prism/node.rb#13704 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { arguments: ArgumentsNode?, keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#13777 + # source://prism//lib/prism/node.rb#13729 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -24628,19 +24653,19 @@ class Prism::NextNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#13797 + # source://prism//lib/prism/node.rb#13749 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#13792 + # source://prism//lib/prism/node.rb#13744 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#13785 + # source://prism//lib/prism/node.rb#13737 sig { returns(Prism::Location) } def keyword_loc; end @@ -24659,7 +24684,7 @@ class Prism::NextNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#13815 + # source://prism//lib/prism/node.rb#13767 sig { override.returns(Symbol) } def type; end @@ -24671,7 +24696,7 @@ class Prism::NextNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#13825 + # source://prism//lib/prism/node.rb#13777 def type; end end end @@ -24681,62 +24706,62 @@ end # nil # ^^^ # -# source://prism//lib/prism/node.rb#13843 +# source://prism//lib/prism/node.rb#13794 class Prism::NilNode < ::Prism::Node # def initialize: (Location location) -> void # # @return [NilNode] a new instance of NilNode # - # source://prism//lib/prism/node.rb#13844 + # source://prism//lib/prism/node.rb#13796 sig { params(source: Prism::Source, location: Prism::Location).void } def initialize(source, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#13918 + # source://prism//lib/prism/node.rb#13869 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13851 + # source://prism//lib/prism/node.rb#13802 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#13856 + # source://prism//lib/prism/node.rb#13807 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#13866 + # source://prism//lib/prism/node.rb#13817 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#13861 + # source://prism//lib/prism/node.rb#13812 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?location: Location) -> NilNode # - # source://prism//lib/prism/node.rb#13871 + # source://prism//lib/prism/node.rb#13822 sig { params(location: Prism::Location).returns(Prism::NilNode) } def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13856 + # source://prism//lib/prism/node.rb#13807 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#13879 + # source://prism//lib/prism/node.rb#13830 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -24745,7 +24770,7 @@ class Prism::NilNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#13884 + # source://prism//lib/prism/node.rb#13835 sig { override.returns(String) } def inspect; end @@ -24764,7 +24789,7 @@ class Prism::NilNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#13902 + # source://prism//lib/prism/node.rb#13853 sig { override.returns(Symbol) } def type; end @@ -24776,7 +24801,7 @@ class Prism::NilNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#13912 + # source://prism//lib/prism/node.rb#13863 def type; end end end @@ -24787,13 +24812,13 @@ end # ^^^^^ # end # -# source://prism//lib/prism/node.rb#13929 +# source://prism//lib/prism/node.rb#13879 class Prism::NoKeywordsParameterNode < ::Prism::Node # def initialize: (Location operator_loc, Location keyword_loc, Location location) -> void # # @return [NoKeywordsParameterNode] a new instance of NoKeywordsParameterNode # - # source://prism//lib/prism/node.rb#13930 + # source://prism//lib/prism/node.rb#13881 sig do params( source: Prism::Source, @@ -24807,36 +24832,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#14030 + # source://prism//lib/prism/node.rb#13980 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13939 + # source://prism//lib/prism/node.rb#13889 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#13944 + # source://prism//lib/prism/node.rb#13894 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#13954 + # source://prism//lib/prism/node.rb#13904 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#13949 + # source://prism//lib/prism/node.rb#13899 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?operator_loc: Location, ?keyword_loc: Location, ?location: Location) -> NoKeywordsParameterNode # - # source://prism//lib/prism/node.rb#13959 + # source://prism//lib/prism/node.rb#13909 sig do params( operator_loc: Prism::Location, @@ -24849,13 +24874,13 @@ class Prism::NoKeywordsParameterNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13944 + # source://prism//lib/prism/node.rb#13894 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { operator_loc: Location, keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#13967 + # source://prism//lib/prism/node.rb#13917 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -24864,31 +24889,31 @@ class Prism::NoKeywordsParameterNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#13996 + # source://prism//lib/prism/node.rb#13946 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#13991 + # source://prism//lib/prism/node.rb#13941 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#13979 + # source://prism//lib/prism/node.rb#13929 sig { returns(Prism::Location) } def keyword_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#13986 + # source://prism//lib/prism/node.rb#13936 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#13972 + # source://prism//lib/prism/node.rb#13922 sig { returns(Prism::Location) } def operator_loc; end @@ -24907,7 +24932,7 @@ class Prism::NoKeywordsParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#14014 + # source://prism//lib/prism/node.rb#13964 sig { override.returns(Symbol) } def type; end @@ -24919,7 +24944,7 @@ class Prism::NoKeywordsParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#14024 + # source://prism//lib/prism/node.rb#13974 def type; end end end @@ -24935,7 +24960,7 @@ class Prism::Node # # @raise [NoMethodError] # - # source://prism//lib/prism/node.rb#143 + # source://prism//lib/prism/node.rb#131 sig { abstract.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -24944,7 +24969,7 @@ class Prism::Node # # @raise [NoMethodError] # - # source://prism//lib/prism/node.rb#149 + # source://prism//lib/prism/node.rb#137 sig { abstract.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end @@ -24953,7 +24978,7 @@ class Prism::Node # # @raise [NoMethodError] # - # source://prism//lib/prism/node.rb#163 + # source://prism//lib/prism/node.rb#151 sig { abstract.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end @@ -24962,7 +24987,7 @@ class Prism::Node # # @raise [NoMethodError] # - # source://prism//lib/prism/node.rb#157 + # source://prism//lib/prism/node.rb#145 sig { abstract.returns(T::Array[Prism::Node]) } def compact_child_nodes; end @@ -24971,7 +24996,7 @@ class Prism::Node # # @raise [NoMethodError] # - # source://prism//lib/prism/node.rb#149 + # source://prism//lib/prism/node.rb#137 sig { abstract.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end @@ -24992,7 +25017,7 @@ class Prism::Node # # @raise [NoMethodError] # - # source://prism//lib/prism/node.rb#174 + # source://prism//lib/prism/node.rb#162 sig { abstract.returns(String) } def inspect; end @@ -25003,15 +25028,18 @@ class Prism::Node sig { returns(Prism::Location) } def location; end + # source://prism//lib/prism/parse_result/newlines.rb#69 + def newline!(lines); end + # @return [Boolean] # - # source://prism//lib/prism/node.rb#39 + # source://prism//lib/prism/parse_result/newlines.rb#65 def newline?; end # Similar to inspect, but respects the current level of indentation given by # the pretty print object. # - # source://prism//lib/prism/node.rb#74 + # source://prism//lib/prism/node.rb#62 sig { params(q: T.untyped).void } def pretty_print(q); end @@ -25019,16 +25047,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#52 + # source://prism//lib/prism/node.rb#40 sig { returns(T::Array[String]) } def script_lines; end - # source://prism//lib/prism/node.rb#43 - def set_newline_flag(newline_marked); end - # Slice the location of the node from the source. # - # source://prism//lib/prism/node.rb#61 + # source://prism//lib/prism/node.rb#49 sig { returns(String) } def slice; end @@ -25036,13 +25061,13 @@ 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#68 + # source://prism//lib/prism/node.rb#56 sig { returns(String) } def slice_lines; end # Returns all of the lines of the source code associated with this node. # - # source://prism//lib/prism/node.rb#52 + # source://prism//lib/prism/node.rb#40 sig { returns(T::Array[String]) } def source_lines; end @@ -25055,7 +25080,7 @@ class Prism::Node # Convert this node into a graphviz dot graph string. # - # source://prism//lib/prism/node.rb#82 + # source://prism//lib/prism/node.rb#70 sig { returns(String) } def to_dot; end @@ -25066,7 +25091,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#93 + # source://prism//lib/prism/node.rb#81 sig { params(line: Integer, column: Integer).returns(T::Array[Prism::Node]) } def tunnel(line, column); end @@ -25075,7 +25100,7 @@ class Prism::Node # # @raise [NoMethodError] # - # source://prism//lib/prism/node.rb#169 + # source://prism//lib/prism/node.rb#157 sig { abstract.returns(Symbol) } def type; end @@ -25094,14 +25119,14 @@ class Prism::Node # # @raise [NoMethodError] # - # source://prism//lib/prism/node.rb#127 + # source://prism//lib/prism/node.rb#115 def fields; end # Returns the type of the node as a symbol. # # @raise [NoMethodError] # - # source://prism//lib/prism/node.rb#179 + # source://prism//lib/prism/node.rb#167 def type; end end end @@ -25111,62 +25136,62 @@ end # -> { _1 + _2 } # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#14042 +# source://prism//lib/prism/node.rb#13991 class Prism::NumberedParametersNode < ::Prism::Node # def initialize: (Integer maximum, Location location) -> void # # @return [NumberedParametersNode] a new instance of NumberedParametersNode # - # source://prism//lib/prism/node.rb#14043 + # source://prism//lib/prism/node.rb#13993 sig { params(source: Prism::Source, maximum: Integer, location: Prism::Location).void } def initialize(source, maximum, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#14121 + # source://prism//lib/prism/node.rb#14070 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14051 + # source://prism//lib/prism/node.rb#14000 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14056 + # source://prism//lib/prism/node.rb#14005 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#14066 + # source://prism//lib/prism/node.rb#14015 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#14061 + # source://prism//lib/prism/node.rb#14010 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?maximum: Integer, ?location: Location) -> NumberedParametersNode # - # source://prism//lib/prism/node.rb#14071 + # source://prism//lib/prism/node.rb#14020 sig { params(maximum: Integer, location: Prism::Location).returns(Prism::NumberedParametersNode) } def copy(maximum: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14056 + # source://prism//lib/prism/node.rb#14005 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { maximum: Integer, location: Location } # - # source://prism//lib/prism/node.rb#14079 + # source://prism//lib/prism/node.rb#14028 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -25175,13 +25200,13 @@ class Prism::NumberedParametersNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#14087 + # source://prism//lib/prism/node.rb#14036 sig { override.returns(String) } def inspect; end # attr_reader maximum: Integer # - # source://prism//lib/prism/node.rb#14084 + # source://prism//lib/prism/node.rb#14033 sig { returns(Integer) } def maximum; end @@ -25200,7 +25225,7 @@ class Prism::NumberedParametersNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#14105 + # source://prism//lib/prism/node.rb#14054 sig { override.returns(Symbol) } def type; end @@ -25212,7 +25237,7 @@ class Prism::NumberedParametersNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#14115 + # source://prism//lib/prism/node.rb#14064 def type; end end end @@ -25222,62 +25247,62 @@ end # $1 # ^^ # -# source://prism//lib/prism/node.rb#14132 +# source://prism//lib/prism/node.rb#14080 class Prism::NumberedReferenceReadNode < ::Prism::Node # def initialize: (Integer number, Location location) -> void # # @return [NumberedReferenceReadNode] a new instance of NumberedReferenceReadNode # - # source://prism//lib/prism/node.rb#14133 + # source://prism//lib/prism/node.rb#14082 sig { params(source: Prism::Source, number: Integer, location: Prism::Location).void } def initialize(source, number, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#14217 + # source://prism//lib/prism/node.rb#14165 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14141 + # source://prism//lib/prism/node.rb#14089 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14146 + # source://prism//lib/prism/node.rb#14094 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#14156 + # source://prism//lib/prism/node.rb#14104 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#14151 + # source://prism//lib/prism/node.rb#14099 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?number: Integer, ?location: Location) -> NumberedReferenceReadNode # - # source://prism//lib/prism/node.rb#14161 + # source://prism//lib/prism/node.rb#14109 sig { params(number: Integer, location: Prism::Location).returns(Prism::NumberedReferenceReadNode) } def copy(number: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14146 + # source://prism//lib/prism/node.rb#14094 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { number: Integer, location: Location } # - # source://prism//lib/prism/node.rb#14169 + # source://prism//lib/prism/node.rb#14117 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -25286,7 +25311,7 @@ class Prism::NumberedReferenceReadNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#14183 + # source://prism//lib/prism/node.rb#14131 sig { override.returns(String) } def inspect; end @@ -25298,7 +25323,7 @@ class Prism::NumberedReferenceReadNode < ::Prism::Node # # $4294967296 # number `0` # - # source://prism//lib/prism/node.rb#14180 + # source://prism//lib/prism/node.rb#14128 sig { returns(Integer) } def number; end @@ -25317,7 +25342,7 @@ class Prism::NumberedReferenceReadNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#14201 + # source://prism//lib/prism/node.rb#14149 sig { override.returns(Symbol) } def type; end @@ -25329,7 +25354,7 @@ class Prism::NumberedReferenceReadNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#14211 + # source://prism//lib/prism/node.rb#14159 def type; end end end @@ -25340,13 +25365,13 @@ end # ^^^^ # end # -# source://prism//lib/prism/node.rb#14229 +# source://prism//lib/prism/node.rb#14176 class Prism::OptionalKeywordParameterNode < ::Prism::Node # def initialize: (Integer flags, Symbol name, Location name_loc, Prism::node value, Location location) -> void # # @return [OptionalKeywordParameterNode] a new instance of OptionalKeywordParameterNode # - # source://prism//lib/prism/node.rb#14230 + # source://prism//lib/prism/node.rb#14178 sig do params( source: Prism::Source, @@ -25362,36 +25387,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#14330 + # source://prism//lib/prism/node.rb#14277 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14241 + # source://prism//lib/prism/node.rb#14188 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14246 + # source://prism//lib/prism/node.rb#14193 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#14256 + # source://prism//lib/prism/node.rb#14203 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#14251 + # source://prism//lib/prism/node.rb#14198 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?location: Location) -> OptionalKeywordParameterNode # - # source://prism//lib/prism/node.rb#14261 + # source://prism//lib/prism/node.rb#14208 sig do params( flags: Integer, @@ -25406,13 +25431,13 @@ class Prism::OptionalKeywordParameterNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14246 + # source://prism//lib/prism/node.rb#14193 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol, name_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#14269 + # source://prism//lib/prism/node.rb#14216 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -25421,19 +25446,19 @@ class Prism::OptionalKeywordParameterNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#14296 + # source://prism//lib/prism/node.rb#14243 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#14278 + # source://prism//lib/prism/node.rb#14225 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#14281 + # source://prism//lib/prism/node.rb#14228 sig { returns(Prism::Location) } def name_loc; end @@ -25441,7 +25466,7 @@ class Prism::OptionalKeywordParameterNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#14291 + # source://prism//lib/prism/node.rb#14238 sig { returns(T::Boolean) } def repeated_parameter?; end @@ -25460,13 +25485,13 @@ class Prism::OptionalKeywordParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#14314 + # source://prism//lib/prism/node.rb#14261 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#14288 + # source://prism//lib/prism/node.rb#14235 sig { returns(Prism::Node) } def value; end @@ -25474,7 +25499,7 @@ class Prism::OptionalKeywordParameterNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#14274 + # source://prism//lib/prism/node.rb#14221 sig { returns(Integer) } def flags; end @@ -25486,7 +25511,7 @@ class Prism::OptionalKeywordParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#14324 + # source://prism//lib/prism/node.rb#14271 def type; end end end @@ -25497,13 +25522,13 @@ end # ^^^^^ # end # -# source://prism//lib/prism/node.rb#14345 +# source://prism//lib/prism/node.rb#14291 class Prism::OptionalParameterNode < ::Prism::Node # def initialize: (Integer flags, Symbol name, Location name_loc, Location operator_loc, Prism::node value, Location location) -> void # # @return [OptionalParameterNode] a new instance of OptionalParameterNode # - # source://prism//lib/prism/node.rb#14346 + # source://prism//lib/prism/node.rb#14293 sig do params( source: Prism::Source, @@ -25520,36 +25545,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#14459 + # source://prism//lib/prism/node.rb#14405 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14358 + # source://prism//lib/prism/node.rb#14304 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14363 + # source://prism//lib/prism/node.rb#14309 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#14373 + # source://prism//lib/prism/node.rb#14319 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#14368 + # source://prism//lib/prism/node.rb#14314 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> OptionalParameterNode # - # source://prism//lib/prism/node.rb#14378 + # source://prism//lib/prism/node.rb#14324 sig do params( flags: Integer, @@ -25565,13 +25590,13 @@ class Prism::OptionalParameterNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14363 + # source://prism//lib/prism/node.rb#14309 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#14386 + # source://prism//lib/prism/node.rb#14332 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -25580,31 +25605,31 @@ class Prism::OptionalParameterNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#14425 + # source://prism//lib/prism/node.rb#14371 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#14395 + # source://prism//lib/prism/node.rb#14341 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#14398 + # source://prism//lib/prism/node.rb#14344 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#14420 + # source://prism//lib/prism/node.rb#14366 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#14405 + # source://prism//lib/prism/node.rb#14351 sig { returns(Prism::Location) } def operator_loc; end @@ -25612,7 +25637,7 @@ class Prism::OptionalParameterNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#14415 + # source://prism//lib/prism/node.rb#14361 sig { returns(T::Boolean) } def repeated_parameter?; end @@ -25631,13 +25656,13 @@ class Prism::OptionalParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#14443 + # source://prism//lib/prism/node.rb#14389 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#14412 + # source://prism//lib/prism/node.rb#14358 sig { returns(Prism::Node) } def value; end @@ -25645,7 +25670,7 @@ class Prism::OptionalParameterNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#14391 + # source://prism//lib/prism/node.rb#14337 sig { returns(Integer) } def flags; end @@ -25657,7 +25682,7 @@ class Prism::OptionalParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#14453 + # source://prism//lib/prism/node.rb#14399 def type; end end end @@ -25667,13 +25692,13 @@ end # left or right # ^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#14474 +# source://prism//lib/prism/node.rb#14419 class Prism::OrNode < ::Prism::Node # def initialize: (Prism::node left, Prism::node right, Location operator_loc, Location location) -> void # # @return [OrNode] a new instance of OrNode # - # source://prism//lib/prism/node.rb#14475 + # source://prism//lib/prism/node.rb#14421 sig do params( source: Prism::Source, @@ -25688,36 +25713,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#14585 + # source://prism//lib/prism/node.rb#14530 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14485 + # source://prism//lib/prism/node.rb#14430 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14490 + # source://prism//lib/prism/node.rb#14435 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#14500 + # source://prism//lib/prism/node.rb#14445 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#14495 + # source://prism//lib/prism/node.rb#14440 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?left: Prism::node, ?right: Prism::node, ?operator_loc: Location, ?location: Location) -> OrNode # - # source://prism//lib/prism/node.rb#14505 + # source://prism//lib/prism/node.rb#14450 sig do params( left: Prism::Node, @@ -25731,13 +25756,13 @@ class Prism::OrNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14490 + # source://prism//lib/prism/node.rb#14435 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { left: Prism::node, right: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#14513 + # source://prism//lib/prism/node.rb#14458 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -25746,7 +25771,7 @@ class Prism::OrNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#14551 + # source://prism//lib/prism/node.rb#14496 sig { override.returns(String) } def inspect; end @@ -25758,13 +25783,13 @@ class Prism::OrNode < ::Prism::Node # 1 || 2 # ^ # - # source://prism//lib/prism/node.rb#14524 + # source://prism//lib/prism/node.rb#14469 sig { returns(Prism::Node) } def left; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#14546 + # source://prism//lib/prism/node.rb#14491 sig { returns(String) } def operator; end @@ -25773,7 +25798,7 @@ class Prism::OrNode < ::Prism::Node # left or right # ^^ # - # source://prism//lib/prism/node.rb#14539 + # source://prism//lib/prism/node.rb#14484 sig { returns(Prism::Location) } def operator_loc; end @@ -25785,7 +25810,7 @@ class Prism::OrNode < ::Prism::Node # 1 or 2 # ^ # - # source://prism//lib/prism/node.rb#14533 + # source://prism//lib/prism/node.rb#14478 sig { returns(Prism::Node) } def right; end @@ -25804,7 +25829,7 @@ class Prism::OrNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#14569 + # source://prism//lib/prism/node.rb#14514 sig { override.returns(Symbol) } def type; end @@ -25816,7 +25841,7 @@ class Prism::OrNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#14579 + # source://prism//lib/prism/node.rb#14524 def type; end end end @@ -26065,12 +26090,12 @@ Prism::Pack::UTF8 = T.let(T.unsafe(nil), Symbol) # Flags for parameter nodes. # -# source://prism//lib/prism/node.rb#19277 +# source://prism//lib/prism/node.rb#19202 module Prism::ParameterFlags; end # a parameter name that has been repeated in the method signature # -# source://prism//lib/prism/node.rb#19279 +# source://prism//lib/prism/node.rb#19204 Prism::ParameterFlags::REPEATED_PARAMETER = T.let(T.unsafe(nil), Integer) # Represents the list of parameters on a method, block, or lambda definition. @@ -26079,13 +26104,13 @@ Prism::ParameterFlags::REPEATED_PARAMETER = T.let(T.unsafe(nil), Integer) # ^^^^^^^ # end # -# source://prism//lib/prism/node.rb#14599 +# source://prism//lib/prism/node.rb#14543 class Prism::ParametersNode < ::Prism::Node # def initialize: (Array[RequiredParameterNode | MultiTargetNode] requireds, Array[OptionalParameterNode] optionals, RestParameterNode | ImplicitRestNode | nil rest, Array[RequiredParameterNode | MultiTargetNode | KeywordRestParameterNode | NoKeywordsParameterNode | ForwardingParameterNode] posts, Array[RequiredKeywordParameterNode | OptionalKeywordParameterNode] keywords, KeywordRestParameterNode | ForwardingParameterNode | NoKeywordsParameterNode | nil keyword_rest, BlockParameterNode? block, Location location) -> void # # @return [ParametersNode] a new instance of ParametersNode # - # source://prism//lib/prism/node.rb#14600 + # source://prism//lib/prism/node.rb#14545 sig do params( source: Prism::Source, @@ -26104,42 +26129,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#14710 + # source://prism//lib/prism/node.rb#14654 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14614 + # source://prism//lib/prism/node.rb#14558 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader block: BlockParameterNode? # - # source://prism//lib/prism/node.rb#14673 + # source://prism//lib/prism/node.rb#14617 sig { returns(T.nilable(Prism::BlockParameterNode)) } def block; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14619 + # source://prism//lib/prism/node.rb#14563 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#14637 + # source://prism//lib/prism/node.rb#14581 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#14624 + # source://prism//lib/prism/node.rb#14568 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?requireds: Array[RequiredParameterNode | MultiTargetNode], ?optionals: Array[OptionalParameterNode], ?rest: RestParameterNode | ImplicitRestNode | nil, ?posts: Array[RequiredParameterNode | MultiTargetNode | KeywordRestParameterNode | NoKeywordsParameterNode | ForwardingParameterNode], ?keywords: Array[RequiredKeywordParameterNode | OptionalKeywordParameterNode], ?keyword_rest: KeywordRestParameterNode | ForwardingParameterNode | NoKeywordsParameterNode | nil, ?block: BlockParameterNode?, ?location: Location) -> ParametersNode # - # source://prism//lib/prism/node.rb#14642 + # source://prism//lib/prism/node.rb#14586 sig do params( requireds: T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode)], @@ -26157,13 +26182,13 @@ class Prism::ParametersNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14619 + # source://prism//lib/prism/node.rb#14563 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { requireds: Array[RequiredParameterNode | MultiTargetNode], optionals: Array[OptionalParameterNode], rest: RestParameterNode | ImplicitRestNode | nil, posts: Array[RequiredParameterNode | MultiTargetNode | KeywordRestParameterNode | NoKeywordsParameterNode | ForwardingParameterNode], keywords: Array[RequiredKeywordParameterNode | OptionalKeywordParameterNode], keyword_rest: KeywordRestParameterNode | ForwardingParameterNode | NoKeywordsParameterNode | nil, block: BlockParameterNode?, location: Location } # - # source://prism//lib/prism/node.rb#14650 + # source://prism//lib/prism/node.rb#14594 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -26172,13 +26197,13 @@ class Prism::ParametersNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#14676 + # source://prism//lib/prism/node.rb#14620 sig { override.returns(String) } def inspect; end # attr_reader keyword_rest: KeywordRestParameterNode | ForwardingParameterNode | NoKeywordsParameterNode | nil # - # source://prism//lib/prism/node.rb#14670 + # source://prism//lib/prism/node.rb#14614 sig do returns(T.nilable(T.any(Prism::KeywordRestParameterNode, Prism::ForwardingParameterNode, Prism::NoKeywordsParameterNode))) end @@ -26186,19 +26211,19 @@ class Prism::ParametersNode < ::Prism::Node # attr_reader keywords: Array[RequiredKeywordParameterNode | OptionalKeywordParameterNode] # - # source://prism//lib/prism/node.rb#14667 + # source://prism//lib/prism/node.rb#14611 sig { returns(T::Array[T.any(Prism::RequiredKeywordParameterNode, Prism::OptionalKeywordParameterNode)]) } def keywords; end # attr_reader optionals: Array[OptionalParameterNode] # - # source://prism//lib/prism/node.rb#14658 + # source://prism//lib/prism/node.rb#14602 sig { returns(T::Array[Prism::OptionalParameterNode]) } def optionals; end # attr_reader posts: Array[RequiredParameterNode | MultiTargetNode | KeywordRestParameterNode | NoKeywordsParameterNode | ForwardingParameterNode] # - # source://prism//lib/prism/node.rb#14664 + # source://prism//lib/prism/node.rb#14608 sig do returns(T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode, Prism::KeywordRestParameterNode, Prism::NoKeywordsParameterNode, Prism::ForwardingParameterNode)]) end @@ -26206,19 +26231,19 @@ class Prism::ParametersNode < ::Prism::Node # attr_reader requireds: Array[RequiredParameterNode | MultiTargetNode] # - # source://prism//lib/prism/node.rb#14655 + # source://prism//lib/prism/node.rb#14599 sig { returns(T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode)]) } def requireds; end # attr_reader rest: RestParameterNode | ImplicitRestNode | nil # - # source://prism//lib/prism/node.rb#14661 + # source://prism//lib/prism/node.rb#14605 sig { returns(T.nilable(T.any(Prism::RestParameterNode, Prism::ImplicitRestNode))) } def rest; end # Mirrors the Method#parameters method. # - # source://prism//lib/prism/node_ext.rb#238 + # source://prism//lib/prism/node_ext.rb#253 sig { returns(T::Array[T.any([Symbol, Symbol], [Symbol])]) } def signature; end @@ -26237,7 +26262,7 @@ class Prism::ParametersNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#14694 + # source://prism//lib/prism/node.rb#14638 sig { override.returns(Symbol) } def type; end @@ -26249,7 +26274,7 @@ class Prism::ParametersNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#14704 + # source://prism//lib/prism/node.rb#14648 def type; end end end @@ -26259,13 +26284,13 @@ end # (10 + 34) # ^^^^^^^^^ # -# source://prism//lib/prism/node.rb#14731 +# source://prism//lib/prism/node.rb#14674 class Prism::ParenthesesNode < ::Prism::Node # def initialize: (Prism::node? body, Location opening_loc, Location closing_loc, Location location) -> void # # @return [ParenthesesNode] a new instance of ParenthesesNode # - # source://prism//lib/prism/node.rb#14732 + # source://prism//lib/prism/node.rb#14676 sig do params( source: Prism::Source, @@ -26280,54 +26305,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#14842 + # source://prism//lib/prism/node.rb#14781 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14742 + # source://prism//lib/prism/node.rb#14685 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader body: Prism::node? # - # source://prism//lib/prism/node.rb#14781 + # source://prism//lib/prism/node.rb#14720 sig { returns(T.nilable(Prism::Node)) } def body; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14751 + # source://prism//lib/prism/node.rb#14690 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#14803 + # source://prism//lib/prism/node.rb#14742 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#14791 + # source://prism//lib/prism/node.rb#14730 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#14763 + # source://prism//lib/prism/node.rb#14702 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#14756 + # source://prism//lib/prism/node.rb#14695 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?body: Prism::node?, ?opening_loc: Location, ?closing_loc: Location, ?location: Location) -> ParenthesesNode # - # source://prism//lib/prism/node.rb#14768 + # source://prism//lib/prism/node.rb#14707 sig do params( body: T.nilable(Prism::Node), @@ -26341,13 +26366,13 @@ class Prism::ParenthesesNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14751 + # source://prism//lib/prism/node.rb#14690 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { body: Prism::node?, opening_loc: Location, closing_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#14776 + # source://prism//lib/prism/node.rb#14715 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -26356,25 +26381,25 @@ class Prism::ParenthesesNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#14808 + # source://prism//lib/prism/node.rb#14747 sig { override.returns(String) } def inspect; end + # source://prism//lib/prism/parse_result/newlines.rb#85 + def newline!(lines); end + # def opening: () -> String # - # source://prism//lib/prism/node.rb#14798 + # source://prism//lib/prism/node.rb#14737 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#14784 + # source://prism//lib/prism/node.rb#14723 sig { returns(Prism::Location) } def opening_loc; end - # source://prism//lib/prism/node.rb#14746 - def set_newline_flag(newline_marked); end - # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by # calling `[cls1, cls2].include?(node.class)` or putting the node into a @@ -26390,7 +26415,7 @@ class Prism::ParenthesesNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#14826 + # source://prism//lib/prism/node.rb#14765 sig { override.returns(Symbol) } def type; end @@ -26402,7 +26427,7 @@ class Prism::ParenthesesNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#14836 + # source://prism//lib/prism/node.rb#14775 def type; end end end @@ -26459,13 +26484,13 @@ end # This is a result specific to the `parse_lex` and `parse_lex_file` methods. # -# source://prism//lib/prism/parse_result.rb#612 +# source://prism//lib/prism/parse_result.rb#627 class Prism::ParseLexResult < ::Prism::Result # Create a new parse lex result object with the given values. # # @return [ParseLexResult] a new instance of ParseLexResult # - # source://prism//lib/prism/parse_result.rb#616 + # source://prism//lib/prism/parse_result.rb#633 sig do params( value: [Prism::ProgramNode, T::Array[T.untyped]], @@ -26481,27 +26506,27 @@ class Prism::ParseLexResult < ::Prism::Result # Implement the hash pattern matching interface for ParseLexResult. # - # source://prism//lib/prism/parse_result.rb#622 + # source://prism//lib/prism/parse_result.rb#639 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # A tuple of the syntax tree and the list of tokens that were parsed from # the source code. # - # source://prism//lib/prism/parse_result.rb#613 + # source://prism//lib/prism/parse_result.rb#630 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#577 +# source://prism//lib/prism/parse_result.rb#576 class Prism::ParseResult < ::Prism::Result # Create a new parse result object with the given values. # # @return [ParseResult] a new instance of ParseResult # - # source://prism//lib/prism/parse_result.rb#581 + # source://prism//lib/prism/parse_result.rb#587 sig do params( value: Prism::ProgramNode, @@ -26517,23 +26542,24 @@ class Prism::ParseResult < ::Prism::Result # Attach the list of comments to their respective locations in the tree. # - # source://prism//lib/prism/parse_result/comments.rb#190 + # source://prism//lib/prism/parse_result.rb#598 def attach_comments!; end # Implement the hash pattern matching interface for ParseResult. # - # source://prism//lib/prism/parse_result.rb#587 + # source://prism//lib/prism/parse_result.rb#593 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # Walk the tree and mark nodes that are on a new line. + # 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/newlines.rb#60 + # source://prism//lib/prism/parse_result.rb#604 def mark_newlines!; end # The syntax tree that was parsed from the source code. # - # source://prism//lib/prism/parse_result.rb#578 + # source://prism//lib/prism/parse_result.rb#584 sig { returns(Prism::ProgramNode) } def value; end end @@ -26661,38 +26687,43 @@ end # MarkNewlinesVisitor, since that visitor is responsible for marking the # newlines for JRuby/TruffleRuby. # -# source://prism//lib/prism/parse_result/newlines.rb#21 +# This file is autoloaded only when `mark_newlines!` is called, so the +# re-opening of the various nodes in this file will only be performed in +# 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 class Prism::ParseResult::Newlines < ::Prism::Visitor # Create a new Newlines visitor with the given newline offsets. # # @return [Newlines] a new instance of Newlines # - # source://prism//lib/prism/parse_result/newlines.rb#22 - def initialize(newline_marked); end + # 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#27 + # 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#41 + # 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#27 + # 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#49 + # 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#41 + # source://prism//lib/prism/parse_result/newlines.rb#47 def visit_unless_node(node); end end @@ -26896,7 +26927,7 @@ 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#42 +# 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. @@ -26912,13 +26943,13 @@ end # foo in ^(bar) # ^^^^^^ # -# source://prism//lib/prism/node.rb#14855 +# source://prism//lib/prism/node.rb#14793 class Prism::PinnedExpressionNode < ::Prism::Node # def initialize: (Prism::node expression, Location operator_loc, Location lparen_loc, Location rparen_loc, Location location) -> void # # @return [PinnedExpressionNode] a new instance of PinnedExpressionNode # - # source://prism//lib/prism/node.rb#14856 + # source://prism//lib/prism/node.rb#14795 sig do params( source: Prism::Source, @@ -26934,36 +26965,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#14973 + # source://prism//lib/prism/node.rb#14911 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14867 + # source://prism//lib/prism/node.rb#14805 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14872 + # source://prism//lib/prism/node.rb#14810 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#14882 + # source://prism//lib/prism/node.rb#14820 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#14877 + # source://prism//lib/prism/node.rb#14815 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?expression: Prism::node, ?operator_loc: Location, ?lparen_loc: Location, ?rparen_loc: Location, ?location: Location) -> PinnedExpressionNode # - # source://prism//lib/prism/node.rb#14887 + # source://prism//lib/prism/node.rb#14825 sig do params( expression: Prism::Node, @@ -26978,19 +27009,19 @@ class Prism::PinnedExpressionNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14872 + # source://prism//lib/prism/node.rb#14810 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { expression: Prism::node, operator_loc: Location, lparen_loc: Location, rparen_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#14895 + # source://prism//lib/prism/node.rb#14833 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # attr_reader expression: Prism::node # - # source://prism//lib/prism/node.rb#14900 + # source://prism//lib/prism/node.rb#14838 sig { returns(Prism::Node) } def expression; end @@ -26999,43 +27030,43 @@ class Prism::PinnedExpressionNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#14939 + # source://prism//lib/prism/node.rb#14877 sig { override.returns(String) } def inspect; end # def lparen: () -> String # - # source://prism//lib/prism/node.rb#14929 + # source://prism//lib/prism/node.rb#14867 sig { returns(String) } def lparen; end # attr_reader lparen_loc: Location # - # source://prism//lib/prism/node.rb#14910 + # source://prism//lib/prism/node.rb#14848 sig { returns(Prism::Location) } def lparen_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#14924 + # source://prism//lib/prism/node.rb#14862 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#14903 + # source://prism//lib/prism/node.rb#14841 sig { returns(Prism::Location) } def operator_loc; end # def rparen: () -> String # - # source://prism//lib/prism/node.rb#14934 + # source://prism//lib/prism/node.rb#14872 sig { returns(String) } def rparen; end # attr_reader rparen_loc: Location # - # source://prism//lib/prism/node.rb#14917 + # source://prism//lib/prism/node.rb#14855 sig { returns(Prism::Location) } def rparen_loc; end @@ -27054,7 +27085,7 @@ class Prism::PinnedExpressionNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#14957 + # source://prism//lib/prism/node.rb#14895 sig { override.returns(Symbol) } def type; end @@ -27066,7 +27097,7 @@ class Prism::PinnedExpressionNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#14967 + # source://prism//lib/prism/node.rb#14905 def type; end end end @@ -27076,13 +27107,13 @@ end # foo in ^bar # ^^^^ # -# source://prism//lib/prism/node.rb#14987 +# source://prism//lib/prism/node.rb#14924 class Prism::PinnedVariableNode < ::Prism::Node # def initialize: (Prism::node variable, Location operator_loc, Location location) -> void # # @return [PinnedVariableNode] a new instance of PinnedVariableNode # - # source://prism//lib/prism/node.rb#14988 + # source://prism//lib/prism/node.rb#14926 sig do params( source: Prism::Source, @@ -27096,36 +27127,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#15079 + # source://prism//lib/prism/node.rb#15016 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14997 + # source://prism//lib/prism/node.rb#14934 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15002 + # source://prism//lib/prism/node.rb#14939 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#15012 + # source://prism//lib/prism/node.rb#14949 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#15007 + # source://prism//lib/prism/node.rb#14944 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?variable: Prism::node, ?operator_loc: Location, ?location: Location) -> PinnedVariableNode # - # source://prism//lib/prism/node.rb#15017 + # source://prism//lib/prism/node.rb#14954 sig do params( variable: Prism::Node, @@ -27138,13 +27169,13 @@ class Prism::PinnedVariableNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15002 + # source://prism//lib/prism/node.rb#14939 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { variable: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#15025 + # source://prism//lib/prism/node.rb#14962 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -27153,19 +27184,19 @@ class Prism::PinnedVariableNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#15045 + # source://prism//lib/prism/node.rb#14982 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#15040 + # source://prism//lib/prism/node.rb#14977 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#15033 + # source://prism//lib/prism/node.rb#14970 sig { returns(Prism::Location) } def operator_loc; end @@ -27184,13 +27215,13 @@ class Prism::PinnedVariableNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#15063 + # source://prism//lib/prism/node.rb#15000 sig { override.returns(Symbol) } def type; end # attr_reader variable: Prism::node # - # source://prism//lib/prism/node.rb#15030 + # source://prism//lib/prism/node.rb#14967 sig { returns(Prism::Node) } def variable; end @@ -27202,7 +27233,7 @@ class Prism::PinnedVariableNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#15073 + # source://prism//lib/prism/node.rb#15010 def type; end end end @@ -27212,13 +27243,13 @@ end # END { foo } # ^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#15091 +# source://prism//lib/prism/node.rb#15027 class Prism::PostExecutionNode < ::Prism::Node # def initialize: (StatementsNode? statements, Location keyword_loc, Location opening_loc, Location closing_loc, Location location) -> void # # @return [PostExecutionNode] a new instance of PostExecutionNode # - # source://prism//lib/prism/node.rb#15092 + # source://prism//lib/prism/node.rb#15029 sig do params( source: Prism::Source, @@ -27234,48 +27265,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#15211 + # source://prism//lib/prism/node.rb#15147 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15103 + # source://prism//lib/prism/node.rb#15039 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15108 + # source://prism//lib/prism/node.rb#15044 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#15172 + # source://prism//lib/prism/node.rb#15108 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#15155 + # source://prism//lib/prism/node.rb#15091 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#15120 + # source://prism//lib/prism/node.rb#15056 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#15113 + # source://prism//lib/prism/node.rb#15049 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?statements: StatementsNode?, ?keyword_loc: Location, ?opening_loc: Location, ?closing_loc: Location, ?location: Location) -> PostExecutionNode # - # source://prism//lib/prism/node.rb#15125 + # source://prism//lib/prism/node.rb#15061 sig do params( statements: T.nilable(Prism::StatementsNode), @@ -27290,13 +27321,13 @@ class Prism::PostExecutionNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15108 + # source://prism//lib/prism/node.rb#15044 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { statements: StatementsNode?, keyword_loc: Location, opening_loc: Location, closing_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#15133 + # source://prism//lib/prism/node.rb#15069 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -27305,37 +27336,37 @@ class Prism::PostExecutionNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#15177 + # source://prism//lib/prism/node.rb#15113 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#15162 + # source://prism//lib/prism/node.rb#15098 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#15141 + # source://prism//lib/prism/node.rb#15077 sig { returns(Prism::Location) } def keyword_loc; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#15167 + # source://prism//lib/prism/node.rb#15103 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#15148 + # source://prism//lib/prism/node.rb#15084 sig { returns(Prism::Location) } def opening_loc; end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#15138 + # source://prism//lib/prism/node.rb#15074 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end @@ -27354,7 +27385,7 @@ class Prism::PostExecutionNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#15195 + # source://prism//lib/prism/node.rb#15131 sig { override.returns(Symbol) } def type; end @@ -27366,7 +27397,7 @@ class Prism::PostExecutionNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#15205 + # source://prism//lib/prism/node.rb#15141 def type; end end end @@ -27376,13 +27407,13 @@ end # BEGIN { foo } # ^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#15225 +# source://prism//lib/prism/node.rb#15160 class Prism::PreExecutionNode < ::Prism::Node # def initialize: (StatementsNode? statements, Location keyword_loc, Location opening_loc, Location closing_loc, Location location) -> void # # @return [PreExecutionNode] a new instance of PreExecutionNode # - # source://prism//lib/prism/node.rb#15226 + # source://prism//lib/prism/node.rb#15162 sig do params( source: Prism::Source, @@ -27398,48 +27429,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#15345 + # source://prism//lib/prism/node.rb#15280 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15237 + # source://prism//lib/prism/node.rb#15172 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15242 + # source://prism//lib/prism/node.rb#15177 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#15306 + # source://prism//lib/prism/node.rb#15241 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#15289 + # source://prism//lib/prism/node.rb#15224 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#15254 + # source://prism//lib/prism/node.rb#15189 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#15247 + # source://prism//lib/prism/node.rb#15182 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?statements: StatementsNode?, ?keyword_loc: Location, ?opening_loc: Location, ?closing_loc: Location, ?location: Location) -> PreExecutionNode # - # source://prism//lib/prism/node.rb#15259 + # source://prism//lib/prism/node.rb#15194 sig do params( statements: T.nilable(Prism::StatementsNode), @@ -27454,13 +27485,13 @@ class Prism::PreExecutionNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15242 + # source://prism//lib/prism/node.rb#15177 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { statements: StatementsNode?, keyword_loc: Location, opening_loc: Location, closing_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#15267 + # source://prism//lib/prism/node.rb#15202 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -27469,37 +27500,37 @@ class Prism::PreExecutionNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#15311 + # source://prism//lib/prism/node.rb#15246 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#15296 + # source://prism//lib/prism/node.rb#15231 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#15275 + # source://prism//lib/prism/node.rb#15210 sig { returns(Prism::Location) } def keyword_loc; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#15301 + # source://prism//lib/prism/node.rb#15236 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#15282 + # source://prism//lib/prism/node.rb#15217 sig { returns(Prism::Location) } def opening_loc; end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#15272 + # source://prism//lib/prism/node.rb#15207 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end @@ -27518,7 +27549,7 @@ class Prism::PreExecutionNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#15329 + # source://prism//lib/prism/node.rb#15264 sig { override.returns(Symbol) } def type; end @@ -27530,20 +27561,20 @@ class Prism::PreExecutionNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#15339 + # source://prism//lib/prism/node.rb#15274 def type; end end end # The top level node of any parse tree. # -# source://prism//lib/prism/node.rb#15356 +# source://prism//lib/prism/node.rb#15290 class Prism::ProgramNode < ::Prism::Node # def initialize: (Array[Symbol] locals, StatementsNode statements, Location location) -> void # # @return [ProgramNode] a new instance of ProgramNode # - # source://prism//lib/prism/node.rb#15357 + # source://prism//lib/prism/node.rb#15292 sig do params( source: Prism::Source, @@ -27557,36 +27588,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#15439 + # source://prism//lib/prism/node.rb#15373 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15366 + # source://prism//lib/prism/node.rb#15300 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15371 + # source://prism//lib/prism/node.rb#15305 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#15381 + # source://prism//lib/prism/node.rb#15315 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#15376 + # source://prism//lib/prism/node.rb#15310 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?locals: Array[Symbol], ?statements: StatementsNode, ?location: Location) -> ProgramNode # - # source://prism//lib/prism/node.rb#15386 + # source://prism//lib/prism/node.rb#15320 sig do params( locals: T::Array[Symbol], @@ -27599,13 +27630,13 @@ class Prism::ProgramNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15371 + # source://prism//lib/prism/node.rb#15305 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], statements: StatementsNode, location: Location } # - # source://prism//lib/prism/node.rb#15394 + # source://prism//lib/prism/node.rb#15328 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -27614,19 +27645,19 @@ class Prism::ProgramNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#15405 + # source://prism//lib/prism/node.rb#15339 sig { override.returns(String) } def inspect; end # attr_reader locals: Array[Symbol] # - # source://prism//lib/prism/node.rb#15399 + # source://prism//lib/prism/node.rb#15333 sig { returns(T::Array[Symbol]) } def locals; end # attr_reader statements: StatementsNode # - # source://prism//lib/prism/node.rb#15402 + # source://prism//lib/prism/node.rb#15336 sig { returns(Prism::StatementsNode) } def statements; end @@ -27645,7 +27676,7 @@ class Prism::ProgramNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#15423 + # source://prism//lib/prism/node.rb#15357 sig { override.returns(Symbol) } def type; end @@ -27657,19 +27688,19 @@ class Prism::ProgramNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#15433 + # source://prism//lib/prism/node.rb#15367 def type; end end end # Flags for range and flip-flop nodes. # -# source://prism//lib/prism/node.rb#19283 +# source://prism//lib/prism/node.rb#19208 module Prism::RangeFlags; end # ... operator # -# source://prism//lib/prism/node.rb#19285 +# source://prism//lib/prism/node.rb#19210 Prism::RangeFlags::EXCLUDE_END = T.let(T.unsafe(nil), Integer) # Represents the use of the `..` or `...` operators. @@ -27680,13 +27711,13 @@ Prism::RangeFlags::EXCLUDE_END = T.let(T.unsafe(nil), Integer) # c if a =~ /left/ ... b =~ /right/ # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#15455 +# source://prism//lib/prism/node.rb#15388 class Prism::RangeNode < ::Prism::Node # def initialize: (Integer flags, Prism::node? left, Prism::node? right, Location operator_loc, Location location) -> void # # @return [RangeNode] a new instance of RangeNode # - # source://prism//lib/prism/node.rb#15456 + # source://prism//lib/prism/node.rb#15390 sig do params( source: Prism::Source, @@ -27702,36 +27733,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#15577 + # source://prism//lib/prism/node.rb#15510 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15467 + # source://prism//lib/prism/node.rb#15400 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#15472 + # source://prism//lib/prism/node.rb#15405 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#15485 + # source://prism//lib/prism/node.rb#15418 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#15477 + # source://prism//lib/prism/node.rb#15410 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?left: Prism::node?, ?right: Prism::node?, ?operator_loc: Location, ?location: Location) -> RangeNode # - # source://prism//lib/prism/node.rb#15490 + # source://prism//lib/prism/node.rb#15423 sig do params( flags: Integer, @@ -27746,13 +27777,13 @@ class Prism::RangeNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15472 + # source://prism//lib/prism/node.rb#15405 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, left: Prism::node?, right: Prism::node?, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#15498 + # source://prism//lib/prism/node.rb#15431 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -27760,7 +27791,7 @@ class Prism::RangeNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15533 + # source://prism//lib/prism/node.rb#15466 sig { returns(T::Boolean) } def exclude_end?; end @@ -27769,7 +27800,7 @@ class Prism::RangeNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#15543 + # source://prism//lib/prism/node.rb#15476 sig { override.returns(String) } def inspect; end @@ -27781,19 +27812,19 @@ class Prism::RangeNode < ::Prism::Node # hello...goodbye # ^^^^^ # - # source://prism//lib/prism/node.rb#15513 + # source://prism//lib/prism/node.rb#15446 sig { returns(T.nilable(Prism::Node)) } def left; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#15538 + # source://prism//lib/prism/node.rb#15471 sig { returns(String) } def operator; end # The location of the `..` or `...` operator. # - # source://prism//lib/prism/node.rb#15526 + # source://prism//lib/prism/node.rb#15459 sig { returns(Prism::Location) } def operator_loc; end @@ -27806,7 +27837,7 @@ 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#15523 + # source://prism//lib/prism/node.rb#15456 sig { returns(T.nilable(Prism::Node)) } def right; end @@ -27825,7 +27856,7 @@ class Prism::RangeNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#15561 + # source://prism//lib/prism/node.rb#15494 sig { override.returns(Symbol) } def type; end @@ -27833,7 +27864,7 @@ class Prism::RangeNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#15503 + # source://prism//lib/prism/node.rb#15436 sig { returns(Integer) } def flags; end @@ -27845,7 +27876,7 @@ class Prism::RangeNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#15571 + # source://prism//lib/prism/node.rb#15504 def type; end end end @@ -27855,80 +27886,143 @@ end # 1.0r # ^^^^ # -# source://prism//lib/prism/node.rb#15591 +# source://prism//lib/prism/node.rb#15523 class Prism::RationalNode < ::Prism::Node - # def initialize: (Prism::node numeric, Location location) -> void + # def initialize: (Integer flags, Integer numerator, Integer denominator, Location location) -> void # # @return [RationalNode] a new instance of RationalNode # - # source://prism//lib/prism/node.rb#15592 - sig { params(source: Prism::Source, numeric: Prism::Node, location: Prism::Location).void } - def initialize(source, numeric, location); end + # source://prism//lib/prism/node.rb#15525 + sig do + params( + source: Prism::Source, + flags: Integer, + numerator: Integer, + denominator: Integer, + location: Prism::Location + ).void + end + def initialize(source, flags, numerator, denominator, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#15670 + # source://prism//lib/prism/node.rb#15635 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15600 + # source://prism//lib/prism/node.rb#15534 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end + # def binary?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#15581 + sig { returns(T::Boolean) } + def binary?; end + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15605 + # source://prism//lib/prism/node.rb#15539 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#15615 + # source://prism//lib/prism/node.rb#15549 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#15610 + # source://prism//lib/prism/node.rb#15544 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (?numeric: Prism::node, ?location: Location) -> RationalNode + # def copy: (?flags: Integer, ?numerator: Integer, ?denominator: Integer, ?location: Location) -> RationalNode # - # source://prism//lib/prism/node.rb#15620 - sig { params(numeric: Prism::Node, location: Prism::Location).returns(Prism::RationalNode) } - def copy(numeric: T.unsafe(nil), location: T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#15554 + sig do + params( + flags: Integer, + numerator: Integer, + denominator: Integer, + location: Prism::Location + ).returns(Prism::RationalNode) + end + def copy(flags: T.unsafe(nil), numerator: T.unsafe(nil), denominator: T.unsafe(nil), location: T.unsafe(nil)); end + + # def decimal?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#15586 + sig { returns(T::Boolean) } + def decimal?; end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15605 + # source://prism//lib/prism/node.rb#15539 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { numeric: Prism::node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, numerator: Integer, denominator: Integer, location: Location } # - # source://prism//lib/prism/node.rb#15628 + # source://prism//lib/prism/node.rb#15562 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end + # The denominator of the rational number. + # + # 1.5r # denominator 2 + # + # source://prism//lib/prism/node.rb#15578 + sig { returns(Integer) } + def denominator; end + sig { override.returns(T::Array[Prism::Reflection::Field]) } def fields; end + # def hexadecimal?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#15596 + sig { returns(T::Boolean) } + def hexadecimal?; end + # def inspect -> String # - # source://prism//lib/prism/node.rb#15636 + # source://prism//lib/prism/node.rb#15601 sig { override.returns(String) } def inspect; end - # attr_reader numeric: Prism::node + # The numerator of the rational number. # - # source://prism//lib/prism/node.rb#15633 - sig { returns(Prism::Node) } + # 1.5r # numerator 3 + # + # source://prism//lib/prism/node.rb#15573 + 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#114 def numeric; end + # def octal?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#15591 + sig { returns(T::Boolean) } + def octal?; end + # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by # calling `[cls1, cls2].include?(node.class)` or putting the node into a @@ -27944,16 +28038,24 @@ class Prism::RationalNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#15654 + # source://prism//lib/prism/node.rb#15619 sig { override.returns(Symbol) } def type; end # Returns the value of the node as a Ruby Rational. # - # source://prism//lib/prism/node_ext.rb#105 + # source://prism//lib/prism/node_ext.rb#108 sig { returns(Rational) } def value; end + protected + + # protected attr_reader flags: Integer + # + # source://prism//lib/prism/node.rb#15567 + sig { returns(Integer) } + def flags; end + class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -27962,7 +28064,7 @@ class Prism::RationalNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#15664 + # source://prism//lib/prism/node.rb#15629 def type; end end end @@ -27972,62 +28074,62 @@ end # redo # ^^^^ # -# source://prism//lib/prism/node.rb#15681 +# source://prism//lib/prism/node.rb#15647 class Prism::RedoNode < ::Prism::Node # def initialize: (Location location) -> void # # @return [RedoNode] a new instance of RedoNode # - # source://prism//lib/prism/node.rb#15682 + # source://prism//lib/prism/node.rb#15649 sig { params(source: Prism::Source, location: Prism::Location).void } def initialize(source, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#15756 + # source://prism//lib/prism/node.rb#15722 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15689 + # source://prism//lib/prism/node.rb#15655 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#15694 + # source://prism//lib/prism/node.rb#15660 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#15704 + # source://prism//lib/prism/node.rb#15670 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#15699 + # source://prism//lib/prism/node.rb#15665 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?location: Location) -> RedoNode # - # source://prism//lib/prism/node.rb#15709 + # source://prism//lib/prism/node.rb#15675 sig { params(location: Prism::Location).returns(Prism::RedoNode) } def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15694 + # source://prism//lib/prism/node.rb#15660 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#15717 + # source://prism//lib/prism/node.rb#15683 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -28036,7 +28138,7 @@ class Prism::RedoNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#15722 + # source://prism//lib/prism/node.rb#15688 sig { override.returns(String) } def inspect; end @@ -28055,7 +28157,7 @@ class Prism::RedoNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#15740 + # source://prism//lib/prism/node.rb#15706 sig { override.returns(Symbol) } def type; end @@ -28067,7 +28169,7 @@ class Prism::RedoNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#15750 + # source://prism//lib/prism/node.rb#15716 def type; end end end @@ -28125,7 +28227,7 @@ 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#93 +# source://prism//lib/prism/reflection.rb#92 class Prism::Reflection::FlagsField < ::Prism::Reflection::Field # Initializes the flags field with the given name and flags. # @@ -28204,62 +28306,62 @@ class Prism::Reflection::StringField < ::Prism::Reflection::Field; end # Flags for regular expression and match last line nodes. # -# source://prism//lib/prism/node.rb#19289 +# source://prism//lib/prism/node.rb#19214 module Prism::RegularExpressionFlags; end # n - forces the ASCII-8BIT encoding # -# source://prism//lib/prism/node.rb#19306 +# source://prism//lib/prism/node.rb#19231 Prism::RegularExpressionFlags::ASCII_8BIT = T.let(T.unsafe(nil), Integer) # e - forces the EUC-JP encoding # -# source://prism//lib/prism/node.rb#19303 +# source://prism//lib/prism/node.rb#19228 Prism::RegularExpressionFlags::EUC_JP = T.let(T.unsafe(nil), Integer) # x - ignores whitespace and allows comments in regular expressions # -# source://prism//lib/prism/node.rb#19294 +# source://prism//lib/prism/node.rb#19219 Prism::RegularExpressionFlags::EXTENDED = T.let(T.unsafe(nil), Integer) # internal bytes forced the encoding to binary # -# source://prism//lib/prism/node.rb#19318 +# source://prism//lib/prism/node.rb#19243 Prism::RegularExpressionFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer) # internal bytes forced the encoding to US-ASCII # -# source://prism//lib/prism/node.rb#19321 +# source://prism//lib/prism/node.rb#19246 Prism::RegularExpressionFlags::FORCED_US_ASCII_ENCODING = T.let(T.unsafe(nil), Integer) # internal bytes forced the encoding to UTF-8 # -# source://prism//lib/prism/node.rb#19315 +# source://prism//lib/prism/node.rb#19240 Prism::RegularExpressionFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) # i - ignores the case of characters when matching # -# source://prism//lib/prism/node.rb#19291 +# source://prism//lib/prism/node.rb#19216 Prism::RegularExpressionFlags::IGNORE_CASE = T.let(T.unsafe(nil), Integer) # m - allows $ to match the end of lines within strings # -# source://prism//lib/prism/node.rb#19297 +# source://prism//lib/prism/node.rb#19222 Prism::RegularExpressionFlags::MULTI_LINE = T.let(T.unsafe(nil), Integer) # o - only interpolates values into the regular expression once # -# source://prism//lib/prism/node.rb#19300 +# source://prism//lib/prism/node.rb#19225 Prism::RegularExpressionFlags::ONCE = T.let(T.unsafe(nil), Integer) # u - forces the UTF-8 encoding # -# source://prism//lib/prism/node.rb#19312 +# source://prism//lib/prism/node.rb#19237 Prism::RegularExpressionFlags::UTF_8 = T.let(T.unsafe(nil), Integer) # s - forces the Windows-31J encoding # -# source://prism//lib/prism/node.rb#19309 +# source://prism//lib/prism/node.rb#19234 Prism::RegularExpressionFlags::WINDOWS_31J = T.let(T.unsafe(nil), Integer) # Represents a regular expression literal with no interpolation. @@ -28267,7 +28369,7 @@ Prism::RegularExpressionFlags::WINDOWS_31J = T.let(T.unsafe(nil), Integer) # /foo/i # ^^^^^^ # -# source://prism//lib/prism/node.rb#15766 +# source://prism//lib/prism/node.rb#15731 class Prism::RegularExpressionNode < ::Prism::Node include ::Prism::RegularExpressionOptions @@ -28275,7 +28377,7 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [RegularExpressionNode] a new instance of RegularExpressionNode # - # source://prism//lib/prism/node.rb#15767 + # source://prism//lib/prism/node.rb#15733 sig do params( source: Prism::Source, @@ -28292,12 +28394,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#15944 + # source://prism//lib/prism/node.rb#15909 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15779 + # source://prism//lib/prism/node.rb#15744 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -28305,55 +28407,55 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15865 + # source://prism//lib/prism/node.rb#15830 sig { returns(T::Boolean) } def ascii_8bit?; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15784 + # source://prism//lib/prism/node.rb#15749 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#15905 + # source://prism//lib/prism/node.rb#15870 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#15830 + # source://prism//lib/prism/node.rb#15795 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#15794 + # source://prism//lib/prism/node.rb#15759 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#15789 + # source://prism//lib/prism/node.rb#15754 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def content: () -> String # - # source://prism//lib/prism/node.rb#15900 + # source://prism//lib/prism/node.rb#15865 sig { returns(String) } def content; end # attr_reader content_loc: Location # - # source://prism//lib/prism/node.rb#15823 + # source://prism//lib/prism/node.rb#15788 sig { returns(Prism::Location) } def content_loc; end # def copy: (?flags: Integer, ?opening_loc: Location, ?content_loc: Location, ?closing_loc: Location, ?unescaped: String, ?location: Location) -> RegularExpressionNode # - # source://prism//lib/prism/node.rb#15799 + # source://prism//lib/prism/node.rb#15764 sig do params( flags: Integer, @@ -28369,13 +28471,13 @@ class Prism::RegularExpressionNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15784 + # source://prism//lib/prism/node.rb#15749 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String, location: Location } # - # source://prism//lib/prism/node.rb#15807 + # source://prism//lib/prism/node.rb#15772 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -28383,7 +28485,7 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15860 + # source://prism//lib/prism/node.rb#15825 sig { returns(T::Boolean) } def euc_jp?; end @@ -28391,7 +28493,7 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15845 + # source://prism//lib/prism/node.rb#15810 sig { returns(T::Boolean) } def extended?; end @@ -28402,7 +28504,7 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15885 + # source://prism//lib/prism/node.rb#15850 sig { returns(T::Boolean) } def forced_binary_encoding?; end @@ -28410,7 +28512,7 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15890 + # source://prism//lib/prism/node.rb#15855 sig { returns(T::Boolean) } def forced_us_ascii_encoding?; end @@ -28418,7 +28520,7 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15880 + # source://prism//lib/prism/node.rb#15845 sig { returns(T::Boolean) } def forced_utf8_encoding?; end @@ -28426,13 +28528,13 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15840 + # source://prism//lib/prism/node.rb#15805 sig { returns(T::Boolean) } def ignore_case?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#15910 + # source://prism//lib/prism/node.rb#15875 sig { override.returns(String) } def inspect; end @@ -28440,7 +28542,7 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15850 + # source://prism//lib/prism/node.rb#15815 sig { returns(T::Boolean) } def multi_line?; end @@ -28448,19 +28550,19 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15855 + # source://prism//lib/prism/node.rb#15820 sig { returns(T::Boolean) } def once?; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#15895 + # source://prism//lib/prism/node.rb#15860 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#15816 + # source://prism//lib/prism/node.rb#15781 sig { returns(Prism::Location) } def opening_loc; end @@ -28482,13 +28584,13 @@ class Prism::RegularExpressionNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#15928 + # source://prism//lib/prism/node.rb#15893 sig { override.returns(Symbol) } def type; end # attr_reader unescaped: String # - # source://prism//lib/prism/node.rb#15837 + # source://prism//lib/prism/node.rb#15802 sig { returns(String) } def unescaped; end @@ -28496,7 +28598,7 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15875 + # source://prism//lib/prism/node.rb#15840 sig { returns(T::Boolean) } def utf_8?; end @@ -28504,7 +28606,7 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15870 + # source://prism//lib/prism/node.rb#15835 sig { returns(T::Boolean) } def windows_31j?; end @@ -28512,7 +28614,7 @@ class Prism::RegularExpressionNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#15812 + # source://prism//lib/prism/node.rb#15777 sig { returns(Integer) } def flags; end @@ -28524,17 +28626,17 @@ class Prism::RegularExpressionNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#15938 + # source://prism//lib/prism/node.rb#15903 def type; end end end -# source://prism//lib/prism/node_ext.rb#17 +# 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#20 + # source://prism//lib/prism/node_ext.rb#23 def options; end end @@ -28544,13 +28646,13 @@ end # ^^ # end # -# source://prism//lib/prism/node.rb#15960 +# source://prism//lib/prism/node.rb#15924 class Prism::RequiredKeywordParameterNode < ::Prism::Node # def initialize: (Integer flags, Symbol name, Location name_loc, Location location) -> void # # @return [RequiredKeywordParameterNode] a new instance of RequiredKeywordParameterNode # - # source://prism//lib/prism/node.rb#15961 + # source://prism//lib/prism/node.rb#15926 sig do params( source: Prism::Source, @@ -28565,36 +28667,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#16057 + # source://prism//lib/prism/node.rb#16021 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15971 + # source://prism//lib/prism/node.rb#15935 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#15976 + # source://prism//lib/prism/node.rb#15940 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#15986 + # source://prism//lib/prism/node.rb#15950 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#15981 + # source://prism//lib/prism/node.rb#15945 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?name: Symbol, ?name_loc: Location, ?location: Location) -> RequiredKeywordParameterNode # - # source://prism//lib/prism/node.rb#15991 + # source://prism//lib/prism/node.rb#15955 sig do params( flags: Integer, @@ -28608,13 +28710,13 @@ class Prism::RequiredKeywordParameterNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15976 + # source://prism//lib/prism/node.rb#15940 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol, name_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#15999 + # source://prism//lib/prism/node.rb#15963 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -28623,19 +28725,19 @@ class Prism::RequiredKeywordParameterNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#16023 + # source://prism//lib/prism/node.rb#15987 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#16008 + # source://prism//lib/prism/node.rb#15972 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#16011 + # source://prism//lib/prism/node.rb#15975 sig { returns(Prism::Location) } def name_loc; end @@ -28643,7 +28745,7 @@ class Prism::RequiredKeywordParameterNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#16018 + # source://prism//lib/prism/node.rb#15982 sig { returns(T::Boolean) } def repeated_parameter?; end @@ -28662,7 +28764,7 @@ class Prism::RequiredKeywordParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#16041 + # source://prism//lib/prism/node.rb#16005 sig { override.returns(Symbol) } def type; end @@ -28670,7 +28772,7 @@ class Prism::RequiredKeywordParameterNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#16004 + # source://prism//lib/prism/node.rb#15968 sig { returns(Integer) } def flags; end @@ -28682,7 +28784,7 @@ class Prism::RequiredKeywordParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#16051 + # source://prism//lib/prism/node.rb#16015 def type; end end end @@ -28693,62 +28795,62 @@ end # ^ # end # -# source://prism//lib/prism/node.rb#16071 +# source://prism//lib/prism/node.rb#16034 class Prism::RequiredParameterNode < ::Prism::Node # def initialize: (Integer flags, Symbol name, Location location) -> void # # @return [RequiredParameterNode] a new instance of RequiredParameterNode # - # source://prism//lib/prism/node.rb#16072 + # source://prism//lib/prism/node.rb#16036 sig { params(source: Prism::Source, flags: Integer, name: Symbol, location: Prism::Location).void } def initialize(source, flags, name, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#16160 + # source://prism//lib/prism/node.rb#16123 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16081 + # source://prism//lib/prism/node.rb#16044 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#16086 + # source://prism//lib/prism/node.rb#16049 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16096 + # source://prism//lib/prism/node.rb#16059 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#16091 + # source://prism//lib/prism/node.rb#16054 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?name: Symbol, ?location: Location) -> RequiredParameterNode # - # source://prism//lib/prism/node.rb#16101 + # source://prism//lib/prism/node.rb#16064 sig { params(flags: Integer, name: Symbol, location: Prism::Location).returns(Prism::RequiredParameterNode) } def copy(flags: T.unsafe(nil), name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16086 + # source://prism//lib/prism/node.rb#16049 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#16109 + # source://prism//lib/prism/node.rb#16072 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -28757,13 +28859,13 @@ class Prism::RequiredParameterNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#16126 + # source://prism//lib/prism/node.rb#16089 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#16118 + # source://prism//lib/prism/node.rb#16081 sig { returns(Symbol) } def name; end @@ -28771,7 +28873,7 @@ class Prism::RequiredParameterNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#16121 + # source://prism//lib/prism/node.rb#16084 sig { returns(T::Boolean) } def repeated_parameter?; end @@ -28790,7 +28892,7 @@ class Prism::RequiredParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#16144 + # source://prism//lib/prism/node.rb#16107 sig { override.returns(Symbol) } def type; end @@ -28798,7 +28900,7 @@ class Prism::RequiredParameterNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#16114 + # source://prism//lib/prism/node.rb#16077 sig { returns(Integer) } def flags; end @@ -28810,7 +28912,7 @@ class Prism::RequiredParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#16154 + # source://prism//lib/prism/node.rb#16117 def type; end end end @@ -28820,13 +28922,13 @@ end # foo rescue nil # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#16172 +# source://prism//lib/prism/node.rb#16134 class Prism::RescueModifierNode < ::Prism::Node # def initialize: (Prism::node expression, Location keyword_loc, Prism::node rescue_expression, Location location) -> void # # @return [RescueModifierNode] a new instance of RescueModifierNode # - # source://prism//lib/prism/node.rb#16173 + # source://prism//lib/prism/node.rb#16136 sig do params( source: Prism::Source, @@ -28841,36 +28943,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#16272 + # source://prism//lib/prism/node.rb#16230 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16183 + # source://prism//lib/prism/node.rb#16145 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#16192 + # source://prism//lib/prism/node.rb#16150 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16202 + # source://prism//lib/prism/node.rb#16160 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#16197 + # source://prism//lib/prism/node.rb#16155 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?expression: Prism::node, ?keyword_loc: Location, ?rescue_expression: Prism::node, ?location: Location) -> RescueModifierNode # - # source://prism//lib/prism/node.rb#16207 + # source://prism//lib/prism/node.rb#16165 sig do params( expression: Prism::Node, @@ -28884,19 +28986,19 @@ class Prism::RescueModifierNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16192 + # source://prism//lib/prism/node.rb#16150 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { expression: Prism::node, keyword_loc: Location, rescue_expression: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#16215 + # source://prism//lib/prism/node.rb#16173 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#16220 + # source://prism//lib/prism/node.rb#16178 sig { returns(Prism::Node) } def expression; end @@ -28905,31 +29007,31 @@ class Prism::RescueModifierNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#16238 + # source://prism//lib/prism/node.rb#16196 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#16233 + # source://prism//lib/prism/node.rb#16191 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#16223 + # source://prism//lib/prism/node.rb#16181 sig { returns(Prism::Location) } def keyword_loc; end + # source://prism//lib/prism/parse_result/newlines.rb#115 + def newline!(lines); end + # attr_reader rescue_expression: Prism::node # - # source://prism//lib/prism/node.rb#16230 + # source://prism//lib/prism/node.rb#16188 sig { returns(Prism::Node) } def rescue_expression; end - # source://prism//lib/prism/node.rb#16187 - def set_newline_flag(newline_marked); end - # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by # calling `[cls1, cls2].include?(node.class)` or putting the node into a @@ -28945,7 +29047,7 @@ class Prism::RescueModifierNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#16256 + # source://prism//lib/prism/node.rb#16214 sig { override.returns(Symbol) } def type; end @@ -28957,7 +29059,7 @@ class Prism::RescueModifierNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#16266 + # source://prism//lib/prism/node.rb#16224 def type; end end end @@ -28972,13 +29074,13 @@ end # # `Foo, *splat, Bar` are in the `exceptions` field. `ex` is in the `exception` field. # -# source://prism//lib/prism/node.rb#16290 +# source://prism//lib/prism/node.rb#16247 class Prism::RescueNode < ::Prism::Node # def initialize: (Location keyword_loc, Array[Prism::node] exceptions, Location? operator_loc, Prism::node? reference, StatementsNode? statements, RescueNode? consequent, Location location) -> void # # @return [RescueNode] a new instance of RescueNode # - # source://prism//lib/prism/node.rb#16291 + # source://prism//lib/prism/node.rb#16249 sig do params( source: Prism::Source, @@ -28996,42 +29098,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#16418 + # source://prism//lib/prism/node.rb#16375 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16304 + # source://prism//lib/prism/node.rb#16261 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#16309 + # source://prism//lib/prism/node.rb#16266 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16324 + # source://prism//lib/prism/node.rb#16281 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#16314 + # source://prism//lib/prism/node.rb#16271 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # attr_reader consequent: RescueNode? # - # source://prism//lib/prism/node.rb#16371 + # source://prism//lib/prism/node.rb#16328 sig { returns(T.nilable(Prism::RescueNode)) } def consequent; end # def copy: (?keyword_loc: Location, ?exceptions: Array[Prism::node], ?operator_loc: Location?, ?reference: Prism::node?, ?statements: StatementsNode?, ?consequent: RescueNode?, ?location: Location) -> RescueNode # - # source://prism//lib/prism/node.rb#16329 + # source://prism//lib/prism/node.rb#16286 sig do params( keyword_loc: Prism::Location, @@ -29048,19 +29150,19 @@ class Prism::RescueNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16309 + # source://prism//lib/prism/node.rb#16266 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, exceptions: Array[Prism::node], operator_loc: Location?, reference: Prism::node?, statements: StatementsNode?, consequent: RescueNode?, location: Location } # - # source://prism//lib/prism/node.rb#16337 + # source://prism//lib/prism/node.rb#16294 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#16349 + # source://prism//lib/prism/node.rb#16306 sig { returns(T::Array[Prism::Node]) } def exceptions; end @@ -29069,43 +29171,43 @@ class Prism::RescueNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#16384 + # source://prism//lib/prism/node.rb#16341 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#16374 + # source://prism//lib/prism/node.rb#16331 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#16342 + # source://prism//lib/prism/node.rb#16299 sig { returns(Prism::Location) } def keyword_loc; end # def operator: () -> String? # - # source://prism//lib/prism/node.rb#16379 + # source://prism//lib/prism/node.rb#16336 sig { returns(T.nilable(String)) } def operator; end # attr_reader operator_loc: Location? # - # source://prism//lib/prism/node.rb#16352 + # source://prism//lib/prism/node.rb#16309 sig { returns(T.nilable(Prism::Location)) } def operator_loc; end # attr_reader reference: Prism::node? # - # source://prism//lib/prism/node.rb#16365 + # source://prism//lib/prism/node.rb#16322 sig { returns(T.nilable(Prism::Node)) } def reference; end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#16368 + # source://prism//lib/prism/node.rb#16325 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end @@ -29124,7 +29226,7 @@ class Prism::RescueNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#16402 + # source://prism//lib/prism/node.rb#16359 sig { override.returns(Symbol) } def type; end @@ -29136,7 +29238,7 @@ class Prism::RescueNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#16412 + # source://prism//lib/prism/node.rb#16369 def type; end end end @@ -29147,13 +29249,13 @@ end # ^^ # end # -# source://prism//lib/prism/node.rb#16436 +# source://prism//lib/prism/node.rb#16392 class Prism::RestParameterNode < ::Prism::Node # def initialize: (Integer flags, Symbol? name, Location? name_loc, Location operator_loc, Location location) -> void # # @return [RestParameterNode] a new instance of RestParameterNode # - # source://prism//lib/prism/node.rb#16437 + # source://prism//lib/prism/node.rb#16394 sig do params( source: Prism::Source, @@ -29169,294 +29271,294 @@ 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#16552 - def ===(other); end - - # def accept: (Visitor visitor) -> void - # - # source://prism//lib/prism/node.rb#16448 - sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } - def accept(visitor); end - - # def child_nodes: () -> Array[nil | Node] - # - # source://prism//lib/prism/node.rb#16453 - sig { override.returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end - - # def comment_targets: () -> Array[Node | Location] - # - # source://prism//lib/prism/node.rb#16463 - sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } - def comment_targets; end - - # def compact_child_nodes: () -> Array[Node] - # - # source://prism//lib/prism/node.rb#16458 - sig { override.returns(T::Array[Prism::Node]) } - def compact_child_nodes; end - - # def copy: (?flags: Integer, ?name: Symbol?, ?name_loc: Location?, ?operator_loc: Location, ?location: Location) -> RestParameterNode - # - # source://prism//lib/prism/node.rb#16468 - sig do - params( - flags: Integer, - name: T.nilable(Symbol), - name_loc: T.nilable(Prism::Location), - operator_loc: Prism::Location, - location: Prism::Location - ).returns(Prism::RestParameterNode) - end - def copy(flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end - - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] - # - # source://prism//lib/prism/node.rb#16453 - sig { override.returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end - - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol?, name_loc: Location?, operator_loc: Location, location: Location } - # - # source://prism//lib/prism/node.rb#16476 - sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } - def deconstruct_keys(keys); end - - sig { override.returns(T::Array[Prism::Reflection::Field]) } - def fields; end - - # def inspect -> String - # - # source://prism//lib/prism/node.rb#16518 - sig { override.returns(String) } - def inspect; end - - # attr_reader name: Symbol? - # - # source://prism//lib/prism/node.rb#16485 - sig { returns(T.nilable(Symbol)) } - def name; end - - # attr_reader name_loc: Location? - # - # source://prism//lib/prism/node.rb#16488 - sig { returns(T.nilable(Prism::Location)) } - def name_loc; end - - # def operator: () -> String - # - # source://prism//lib/prism/node.rb#16513 - sig { returns(String) } - def operator; end - - # attr_reader operator_loc: Location - # - # source://prism//lib/prism/node.rb#16501 - sig { returns(Prism::Location) } - def operator_loc; end - - # def repeated_parameter?: () -> bool - # - # @return [Boolean] - # # source://prism//lib/prism/node.rb#16508 - sig { returns(T::Boolean) } - def repeated_parameter?; end - - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. - # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. - # - # def type: () -> Symbol - # - # source://prism//lib/prism/node.rb#16536 - sig { override.returns(Symbol) } - def type; end - - protected - - # protected attr_reader flags: Integer - # - # source://prism//lib/prism/node.rb#16481 - sig { returns(Integer) } - def flags; end - - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#16546 - def type; end - end -end - -# This represents the result of a call to ::parse or ::parse_file. It contains -# the requested structure, any comments that were encounters, and any errors -# that were encountered. -# -# source://prism//lib/prism/parse_result.rb#521 -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#543 - sig do - params( - comments: T::Array[Prism::Comment], - magic_comments: T::Array[Prism::MagicComment], - data_loc: T.nilable(Prism::Location), - errors: T::Array[Prism::ParseError], - warnings: T::Array[Prism::ParseWarning], - source: Prism::Source - ).void - end - def initialize(comments, magic_comments, data_loc, errors, warnings, source); end - - # The list of comments that were encountered during parsing. - # - # source://prism//lib/prism/parse_result.rb#523 - sig { returns(T::Array[Prism::Comment]) } - def comments; end - - # An optional location that represents the location of the __END__ marker - # and the rest of the content of the file. This content is loaded into the - # DATA constant when the file being parsed is the main file being executed. - # - # source://prism//lib/prism/parse_result.rb#531 - 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#553 - 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#558 - sig { returns(Encoding) } - def encoding; end - - # The list of errors that were generated during parsing. - # - # source://prism//lib/prism/parse_result.rb#534 - sig { returns(T::Array[Prism::ParseError]) } - def errors; end - - # Returns true if there were errors during parsing and false if there were - # not. - # - # @return [Boolean] - # - # source://prism//lib/prism/parse_result.rb#570 - sig { returns(T::Boolean) } - def failure?; end - - # The list of magic comments that were encountered during parsing. - # - # source://prism//lib/prism/parse_result.rb#526 - 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#540 - sig { returns(Prism::Source) } - def source; end - - # Returns true if there were no errors during parsing and false if there - # were. - # - # @return [Boolean] - # - # source://prism//lib/prism/parse_result.rb#564 - sig { returns(T::Boolean) } - def success?; end - - # The list of warnings that were generated during parsing. - # - # source://prism//lib/prism/parse_result.rb#537 - sig { returns(T::Array[Prism::ParseWarning]) } - def warnings; end -end - -# Represents the use of the `retry` keyword. -# -# retry -# ^^^^^ -# -# source://prism//lib/prism/node.rb#16566 -class Prism::RetryNode < ::Prism::Node - # def initialize: (Location location) -> void - # - # @return [RetryNode] a new instance of RetryNode - # - # source://prism//lib/prism/node.rb#16567 - sig { params(source: Prism::Source, location: Prism::Location).void } - def initialize(source, location); end - - # Implements case-equality for the node. This is effectively == but without - # comparing the value of locations. Locations are checked only for presence. - # - # source://prism//lib/prism/node.rb#16641 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16574 + # source://prism//lib/prism/node.rb#16404 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#16579 + # source://prism//lib/prism/node.rb#16409 sig { 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#16419 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#16584 + # source://prism//lib/prism/node.rb#16414 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end + + # def copy: (?flags: Integer, ?name: Symbol?, ?name_loc: Location?, ?operator_loc: Location, ?location: Location) -> RestParameterNode + # + # source://prism//lib/prism/node.rb#16424 + sig do + params( + flags: Integer, + name: T.nilable(Symbol), + name_loc: T.nilable(Prism::Location), + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::RestParameterNode) + end + def copy(flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#16409 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol?, name_loc: Location?, operator_loc: Location, location: Location } + # + # source://prism//lib/prism/node.rb#16432 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } + def deconstruct_keys(keys); end + + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String + # + # source://prism//lib/prism/node.rb#16474 + sig { override.returns(String) } + def inspect; end + + # attr_reader name: Symbol? + # + # source://prism//lib/prism/node.rb#16441 + sig { returns(T.nilable(Symbol)) } + def name; end + + # attr_reader name_loc: Location? + # + # source://prism//lib/prism/node.rb#16444 + sig { returns(T.nilable(Prism::Location)) } + def name_loc; end + + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#16469 + sig { returns(String) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#16457 + sig { returns(Prism::Location) } + def operator_loc; end + + # def repeated_parameter?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#16464 + sig { returns(T::Boolean) } + def repeated_parameter?; end + + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. + # + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. + # + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#16492 + sig { override.returns(Symbol) } + def type; end + + protected + + # protected attr_reader flags: Integer + # + # source://prism//lib/prism/node.rb#16437 + sig { returns(Integer) } + def flags; end + + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#16502 + def type; end + end +end + +# This represents the result of a call to ::parse or ::parse_file. It contains +# the requested structure, any comments that were encounters, and any errors +# that were encountered. +# +# source://prism//lib/prism/parse_result.rb#521 +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#543 + sig do + params( + comments: T::Array[Prism::Comment], + magic_comments: T::Array[Prism::MagicComment], + data_loc: T.nilable(Prism::Location), + errors: T::Array[Prism::ParseError], + warnings: T::Array[Prism::ParseWarning], + source: Prism::Source + ).void + end + def initialize(comments, magic_comments, data_loc, errors, warnings, source); end + + # The list of comments that were encountered during parsing. + # + # source://prism//lib/prism/parse_result.rb#523 + sig { returns(T::Array[Prism::Comment]) } + def comments; end + + # An optional location that represents the location of the __END__ marker + # and the rest of the content of the file. This content is loaded into the + # DATA constant when the file being parsed is the main file being executed. + # + # source://prism//lib/prism/parse_result.rb#531 + 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#553 + 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#558 + sig { returns(Encoding) } + def encoding; end + + # The list of errors that were generated during parsing. + # + # source://prism//lib/prism/parse_result.rb#534 + sig { returns(T::Array[Prism::ParseError]) } + def errors; end + + # Returns true if there were errors during parsing and false if there were + # not. + # + # @return [Boolean] + # + # source://prism//lib/prism/parse_result.rb#570 + sig { returns(T::Boolean) } + def failure?; end + + # The list of magic comments that were encountered during parsing. + # + # source://prism//lib/prism/parse_result.rb#526 + 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#540 + sig { returns(Prism::Source) } + def source; end + + # Returns true if there were no errors during parsing and false if there + # were. + # + # @return [Boolean] + # + # source://prism//lib/prism/parse_result.rb#564 + sig { returns(T::Boolean) } + def success?; end + + # The list of warnings that were generated during parsing. + # + # source://prism//lib/prism/parse_result.rb#537 + sig { returns(T::Array[Prism::ParseWarning]) } + def warnings; end +end + +# Represents the use of the `retry` keyword. +# +# retry +# ^^^^^ +# +# source://prism//lib/prism/node.rb#16521 +class Prism::RetryNode < ::Prism::Node + # def initialize: (Location location) -> void + # + # @return [RetryNode] a new instance of RetryNode + # + # source://prism//lib/prism/node.rb#16523 + sig { params(source: Prism::Source, location: Prism::Location).void } + def initialize(source, location); end + + # Implements case-equality for the node. This is effectively == but without + # comparing the value of locations. Locations are checked only for presence. + # + # source://prism//lib/prism/node.rb#16596 + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#16529 + 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#16534 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end + + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#16544 + sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } + def comment_targets; end + + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#16539 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?location: Location) -> RetryNode # - # source://prism//lib/prism/node.rb#16594 + # source://prism//lib/prism/node.rb#16549 sig { params(location: Prism::Location).returns(Prism::RetryNode) } def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16579 + # source://prism//lib/prism/node.rb#16534 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#16602 + # source://prism//lib/prism/node.rb#16557 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -29465,7 +29567,7 @@ class Prism::RetryNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#16607 + # source://prism//lib/prism/node.rb#16562 sig { override.returns(String) } def inspect; end @@ -29484,7 +29586,7 @@ class Prism::RetryNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#16625 + # source://prism//lib/prism/node.rb#16580 sig { override.returns(Symbol) } def type; end @@ -29496,7 +29598,7 @@ class Prism::RetryNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#16635 + # source://prism//lib/prism/node.rb#16590 def type; end end end @@ -29506,13 +29608,13 @@ end # return 1 # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#16651 +# source://prism//lib/prism/node.rb#16605 class Prism::ReturnNode < ::Prism::Node # def initialize: (Integer flags, Location keyword_loc, ArgumentsNode? arguments, Location location) -> void # # @return [ReturnNode] a new instance of ReturnNode # - # source://prism//lib/prism/node.rb#16652 + # source://prism//lib/prism/node.rb#16607 sig do params( source: Prism::Source, @@ -29527,42 +29629,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#16755 + # source://prism//lib/prism/node.rb#16709 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16662 + # source://prism//lib/prism/node.rb#16616 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#16708 + # source://prism//lib/prism/node.rb#16662 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16667 + # source://prism//lib/prism/node.rb#16621 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16679 + # source://prism//lib/prism/node.rb#16633 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#16672 + # source://prism//lib/prism/node.rb#16626 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?keyword_loc: Location, ?arguments: ArgumentsNode?, ?location: Location) -> ReturnNode # - # source://prism//lib/prism/node.rb#16684 + # source://prism//lib/prism/node.rb#16638 sig do params( flags: Integer, @@ -29576,13 +29678,13 @@ class Prism::ReturnNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16667 + # source://prism//lib/prism/node.rb#16621 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, keyword_loc: Location, arguments: ArgumentsNode?, location: Location } # - # source://prism//lib/prism/node.rb#16692 + # source://prism//lib/prism/node.rb#16646 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -29591,19 +29693,19 @@ class Prism::ReturnNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#16721 + # source://prism//lib/prism/node.rb#16675 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#16716 + # source://prism//lib/prism/node.rb#16670 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#16701 + # source://prism//lib/prism/node.rb#16655 sig { returns(Prism::Location) } def keyword_loc; end @@ -29611,7 +29713,7 @@ class Prism::ReturnNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#16711 + # source://prism//lib/prism/node.rb#16665 sig { returns(T::Boolean) } def redundant?; end @@ -29630,7 +29732,7 @@ class Prism::ReturnNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#16739 + # source://prism//lib/prism/node.rb#16693 sig { override.returns(Symbol) } def type; end @@ -29638,7 +29740,7 @@ class Prism::ReturnNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#16697 + # source://prism//lib/prism/node.rb#16651 sig { returns(Integer) } def flags; end @@ -29650,19 +29752,19 @@ class Prism::ReturnNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#16749 + # source://prism//lib/prism/node.rb#16703 def type; end end end # Flags for return nodes. # -# source://prism//lib/prism/node.rb#19325 +# source://prism//lib/prism/node.rb#19250 module Prism::ReturnNodeFlags; end # a return statement that is redundant because it is the last statement in a method # -# source://prism//lib/prism/node.rb#19327 +# source://prism//lib/prism/node.rb#19252 Prism::ReturnNodeFlags::REDUNDANT = T.let(T.unsafe(nil), Integer) # Represents the `self` keyword. @@ -29670,62 +29772,62 @@ Prism::ReturnNodeFlags::REDUNDANT = T.let(T.unsafe(nil), Integer) # self # ^^^^ # -# source://prism//lib/prism/node.rb#16768 +# source://prism//lib/prism/node.rb#16721 class Prism::SelfNode < ::Prism::Node # def initialize: (Location location) -> void # # @return [SelfNode] a new instance of SelfNode # - # source://prism//lib/prism/node.rb#16769 + # source://prism//lib/prism/node.rb#16723 sig { params(source: Prism::Source, location: Prism::Location).void } def initialize(source, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#16843 + # source://prism//lib/prism/node.rb#16796 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16776 + # source://prism//lib/prism/node.rb#16729 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#16781 + # source://prism//lib/prism/node.rb#16734 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16791 + # source://prism//lib/prism/node.rb#16744 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#16786 + # source://prism//lib/prism/node.rb#16739 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?location: Location) -> SelfNode # - # source://prism//lib/prism/node.rb#16796 + # source://prism//lib/prism/node.rb#16749 sig { params(location: Prism::Location).returns(Prism::SelfNode) } def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16781 + # source://prism//lib/prism/node.rb#16734 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#16804 + # source://prism//lib/prism/node.rb#16757 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -29734,7 +29836,7 @@ class Prism::SelfNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#16809 + # source://prism//lib/prism/node.rb#16762 sig { override.returns(String) } def inspect; end @@ -29753,7 +29855,7 @@ class Prism::SelfNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#16827 + # source://prism//lib/prism/node.rb#16780 sig { override.returns(Symbol) } def type; end @@ -29765,7 +29867,7 @@ class Prism::SelfNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#16837 + # source://prism//lib/prism/node.rb#16790 def type; end end end @@ -29832,22 +29934,22 @@ class Prism::Serialize::Loader # source://prism//lib/prism/serialize.rb#114 def load_line_offsets; end - # source://prism//lib/prism/serialize.rb#433 + # source://prism//lib/prism/serialize.rb#438 def load_metadata; end - # source://prism//lib/prism/serialize.rb#467 + # source://prism//lib/prism/serialize.rb#472 def load_nodes; end - # source://prism//lib/prism/serialize.rb#481 + # source://prism//lib/prism/serialize.rb#486 def load_result; end # source://prism//lib/prism/serialize.rb#110 def load_start_line; end - # source://prism//lib/prism/serialize.rb#442 + # source://prism//lib/prism/serialize.rb#447 def load_tokens; end - # source://prism//lib/prism/serialize.rb#455 + # source://prism//lib/prism/serialize.rb#460 def load_tokens_result; end # Returns the value of attribute serialized. @@ -29867,61 +29969,61 @@ class Prism::Serialize::Loader private - # source://prism//lib/prism/serialize.rb#567 + # source://prism//lib/prism/serialize.rb#572 def load_constant(index); end - # source://prism//lib/prism/serialize.rb#520 + # source://prism//lib/prism/serialize.rb#525 def load_double; end - # source://prism//lib/prism/serialize.rb#535 + # source://prism//lib/prism/serialize.rb#540 def load_embedded_string; end - # source://prism//lib/prism/serialize.rb#597 + # source://prism//lib/prism/serialize.rb#602 def load_error_level; end - # source://prism//lib/prism/serialize.rb#509 + # source://prism//lib/prism/serialize.rb#514 def load_integer; end - # source://prism//lib/prism/serialize.rb#551 + # source://prism//lib/prism/serialize.rb#556 def load_location; end - # source://prism//lib/prism/serialize.rb#555 + # source://prism//lib/prism/serialize.rb#560 def load_location_object; end - # source://prism//lib/prism/serialize.rb#626 + # source://prism//lib/prism/serialize.rb#631 def load_node; end - # source://prism//lib/prism/serialize.rb#592 + # source://prism//lib/prism/serialize.rb#597 def load_optional_constant; end - # source://prism//lib/prism/serialize.rb#559 + # source://prism//lib/prism/serialize.rb#564 def load_optional_location; end - # source://prism//lib/prism/serialize.rb#563 + # source://prism//lib/prism/serialize.rb#568 def load_optional_location_object; end - # source://prism//lib/prism/serialize.rb#528 + # source://prism//lib/prism/serialize.rb#533 def load_optional_node; end - # source://prism//lib/prism/serialize.rb#588 + # source://prism//lib/prism/serialize.rb#593 def load_required_constant; end - # source://prism//lib/prism/serialize.rb#539 + # source://prism//lib/prism/serialize.rb#544 def load_string; end - # source://prism//lib/prism/serialize.rb#524 + # source://prism//lib/prism/serialize.rb#529 def load_uint32; end - # source://prism//lib/prism/serialize.rb#504 + # source://prism//lib/prism/serialize.rb#509 def load_varsint; end # variable-length integer using https://en.wikipedia.org/wiki/LEB128 # This is also what protobuf uses: https://protobuf.dev/programming-guides/encoding/#varints # - # source://prism//lib/prism/serialize.rb#490 + # source://prism//lib/prism/serialize.rb#495 def load_varuint; end - # source://prism//lib/prism/serialize.rb#612 + # source://prism//lib/prism/serialize.rb#617 def load_warning_level; end end @@ -29953,7 +30055,7 @@ 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#1850 +# source://prism//lib/prism/serialize.rb#1863 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. @@ -29961,13 +30063,13 @@ Prism::Serialize::TOKEN_TYPES = T.let(T.unsafe(nil), Array) # C = { a: 1 } # ^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#16854 +# source://prism//lib/prism/node.rb#16806 class Prism::ShareableConstantNode < ::Prism::Node # def initialize: (Integer flags, ConstantWriteNode | ConstantAndWriteNode | ConstantOrWriteNode | ConstantOperatorWriteNode | ConstantPathWriteNode | ConstantPathAndWriteNode | ConstantPathOrWriteNode | ConstantPathOperatorWriteNode write, Location location) -> void # # @return [ShareableConstantNode] a new instance of ShareableConstantNode # - # source://prism//lib/prism/node.rb#16855 + # source://prism//lib/prism/node.rb#16808 sig do params( source: Prism::Source, @@ -29981,36 +30083,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#16953 + # source://prism//lib/prism/node.rb#16905 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16864 + # source://prism//lib/prism/node.rb#16816 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#16869 + # source://prism//lib/prism/node.rb#16821 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16879 + # source://prism//lib/prism/node.rb#16831 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#16874 + # source://prism//lib/prism/node.rb#16826 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?write: ConstantWriteNode | ConstantAndWriteNode | ConstantOrWriteNode | ConstantOperatorWriteNode | ConstantPathWriteNode | ConstantPathAndWriteNode | ConstantPathOrWriteNode | ConstantPathOperatorWriteNode, ?location: Location) -> ShareableConstantNode # - # source://prism//lib/prism/node.rb#16884 + # source://prism//lib/prism/node.rb#16836 sig do params( flags: Integer, @@ -30023,13 +30125,13 @@ class Prism::ShareableConstantNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16869 + # source://prism//lib/prism/node.rb#16821 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, write: ConstantWriteNode | ConstantAndWriteNode | ConstantOrWriteNode | ConstantOperatorWriteNode | ConstantPathWriteNode | ConstantPathAndWriteNode | ConstantPathOrWriteNode | ConstantPathOperatorWriteNode, location: Location } # - # source://prism//lib/prism/node.rb#16892 + # source://prism//lib/prism/node.rb#16844 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -30037,7 +30139,7 @@ class Prism::ShareableConstantNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#16914 + # source://prism//lib/prism/node.rb#16866 sig { returns(T::Boolean) } def experimental_copy?; end @@ -30045,7 +30147,7 @@ class Prism::ShareableConstantNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#16909 + # source://prism//lib/prism/node.rb#16861 sig { returns(T::Boolean) } def experimental_everything?; end @@ -30054,7 +30156,7 @@ class Prism::ShareableConstantNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#16919 + # source://prism//lib/prism/node.rb#16871 sig { override.returns(String) } def inspect; end @@ -30062,7 +30164,7 @@ class Prism::ShareableConstantNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#16904 + # source://prism//lib/prism/node.rb#16856 sig { returns(T::Boolean) } def literal?; end @@ -30081,13 +30183,13 @@ class Prism::ShareableConstantNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#16937 + # source://prism//lib/prism/node.rb#16889 sig { override.returns(Symbol) } def type; end # The constant write that should be modified with the shareability state. # - # source://prism//lib/prism/node.rb#16901 + # source://prism//lib/prism/node.rb#16853 sig do returns(T.any(Prism::ConstantWriteNode, Prism::ConstantAndWriteNode, Prism::ConstantOrWriteNode, Prism::ConstantOperatorWriteNode, Prism::ConstantPathWriteNode, Prism::ConstantPathAndWriteNode, Prism::ConstantPathOrWriteNode, Prism::ConstantPathOperatorWriteNode)) end @@ -30097,7 +30199,7 @@ class Prism::ShareableConstantNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#16897 + # source://prism//lib/prism/node.rb#16849 sig { returns(Integer) } def flags; end @@ -30109,29 +30211,29 @@ class Prism::ShareableConstantNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#16947 + # source://prism//lib/prism/node.rb#16899 def type; end end end # Flags for shareable constant nodes. # -# source://prism//lib/prism/node.rb#19331 +# source://prism//lib/prism/node.rb#19256 module Prism::ShareableConstantNodeFlags; end # constant writes that should be modified with shareable constant value experimental copy # -# source://prism//lib/prism/node.rb#19339 +# source://prism//lib/prism/node.rb#19264 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#19336 +# source://prism//lib/prism/node.rb#19261 Prism::ShareableConstantNodeFlags::EXPERIMENTAL_EVERYTHING = T.let(T.unsafe(nil), Integer) # constant writes that should be modified with shareable constant value literal # -# source://prism//lib/prism/node.rb#19333 +# source://prism//lib/prism/node.rb#19258 Prism::ShareableConstantNodeFlags::LITERAL = T.let(T.unsafe(nil), Integer) # Represents a singleton class declaration involving the `class` keyword. @@ -30139,13 +30241,13 @@ Prism::ShareableConstantNodeFlags::LITERAL = T.let(T.unsafe(nil), Integer) # class << self end # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#16965 +# source://prism//lib/prism/node.rb#16916 class Prism::SingletonClassNode < ::Prism::Node # def initialize: (Array[Symbol] locals, Location class_keyword_loc, Location operator_loc, Prism::node expression, Prism::node? body, Location end_keyword_loc, Location location) -> void # # @return [SingletonClassNode] a new instance of SingletonClassNode # - # source://prism//lib/prism/node.rb#16966 + # source://prism//lib/prism/node.rb#16918 sig do params( source: Prism::Source, @@ -30163,54 +30265,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#17094 + # source://prism//lib/prism/node.rb#17045 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16979 + # source://prism//lib/prism/node.rb#16930 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader body: Prism::node? # - # source://prism//lib/prism/node.rb#17035 + # source://prism//lib/prism/node.rb#16986 sig { returns(T.nilable(Prism::Node)) } def body; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16984 + # source://prism//lib/prism/node.rb#16935 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def class_keyword: () -> String # - # source://prism//lib/prism/node.rb#17045 + # source://prism//lib/prism/node.rb#16996 sig { returns(String) } def class_keyword; end # attr_reader class_keyword_loc: Location # - # source://prism//lib/prism/node.rb#17018 + # source://prism//lib/prism/node.rb#16969 sig { returns(Prism::Location) } def class_keyword_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16997 + # source://prism//lib/prism/node.rb#16948 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#16989 + # source://prism//lib/prism/node.rb#16940 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?locals: Array[Symbol], ?class_keyword_loc: Location, ?operator_loc: Location, ?expression: Prism::node, ?body: Prism::node?, ?end_keyword_loc: Location, ?location: Location) -> SingletonClassNode # - # source://prism//lib/prism/node.rb#17002 + # source://prism//lib/prism/node.rb#16953 sig do params( locals: T::Array[Symbol], @@ -30227,31 +30329,31 @@ class Prism::SingletonClassNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16984 + # source://prism//lib/prism/node.rb#16935 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], class_keyword_loc: Location, operator_loc: Location, expression: Prism::node, body: Prism::node?, end_keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#17010 + # source://prism//lib/prism/node.rb#16961 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#17055 + # source://prism//lib/prism/node.rb#17006 sig { returns(String) } def end_keyword; end # attr_reader end_keyword_loc: Location # - # source://prism//lib/prism/node.rb#17038 + # source://prism//lib/prism/node.rb#16989 sig { returns(Prism::Location) } def end_keyword_loc; end # attr_reader expression: Prism::node # - # source://prism//lib/prism/node.rb#17032 + # source://prism//lib/prism/node.rb#16983 sig { returns(Prism::Node) } def expression; end @@ -30260,25 +30362,25 @@ class Prism::SingletonClassNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#17060 + # source://prism//lib/prism/node.rb#17011 sig { override.returns(String) } def inspect; end # attr_reader locals: Array[Symbol] # - # source://prism//lib/prism/node.rb#17015 + # source://prism//lib/prism/node.rb#16966 sig { returns(T::Array[Symbol]) } def locals; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#17050 + # source://prism//lib/prism/node.rb#17001 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#17025 + # source://prism//lib/prism/node.rb#16976 sig { returns(Prism::Location) } def operator_loc; end @@ -30297,7 +30399,7 @@ class Prism::SingletonClassNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#17078 + # source://prism//lib/prism/node.rb#17029 sig { override.returns(Symbol) } def type; end @@ -30309,7 +30411,7 @@ class Prism::SingletonClassNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#17088 + # source://prism//lib/prism/node.rb#17039 def type; end end end @@ -30446,62 +30548,62 @@ end # __ENCODING__ # ^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#17111 +# source://prism//lib/prism/node.rb#17061 class Prism::SourceEncodingNode < ::Prism::Node # def initialize: (Location location) -> void # # @return [SourceEncodingNode] a new instance of SourceEncodingNode # - # source://prism//lib/prism/node.rb#17112 + # source://prism//lib/prism/node.rb#17063 sig { params(source: Prism::Source, location: Prism::Location).void } def initialize(source, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#17186 + # source://prism//lib/prism/node.rb#17136 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#17119 + # source://prism//lib/prism/node.rb#17069 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#17124 + # source://prism//lib/prism/node.rb#17074 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#17134 + # source://prism//lib/prism/node.rb#17084 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#17129 + # source://prism//lib/prism/node.rb#17079 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?location: Location) -> SourceEncodingNode # - # source://prism//lib/prism/node.rb#17139 + # source://prism//lib/prism/node.rb#17089 sig { params(location: Prism::Location).returns(Prism::SourceEncodingNode) } def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#17124 + # source://prism//lib/prism/node.rb#17074 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#17147 + # source://prism//lib/prism/node.rb#17097 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -30510,7 +30612,7 @@ class Prism::SourceEncodingNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#17152 + # source://prism//lib/prism/node.rb#17102 sig { override.returns(String) } def inspect; end @@ -30529,7 +30631,7 @@ class Prism::SourceEncodingNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#17170 + # source://prism//lib/prism/node.rb#17120 sig { override.returns(Symbol) } def type; end @@ -30541,7 +30643,7 @@ class Prism::SourceEncodingNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#17180 + # source://prism//lib/prism/node.rb#17130 def type; end end end @@ -30551,62 +30653,62 @@ end # __FILE__ # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#17196 +# source://prism//lib/prism/node.rb#17145 class Prism::SourceFileNode < ::Prism::Node # def initialize: (Integer flags, String filepath, Location location) -> void # # @return [SourceFileNode] a new instance of SourceFileNode # - # source://prism//lib/prism/node.rb#17197 + # source://prism//lib/prism/node.rb#17147 sig { params(source: Prism::Source, flags: Integer, filepath: String, location: Prism::Location).void } def initialize(source, flags, filepath, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#17300 + # source://prism//lib/prism/node.rb#17249 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#17206 + # source://prism//lib/prism/node.rb#17155 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#17211 + # source://prism//lib/prism/node.rb#17160 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#17221 + # source://prism//lib/prism/node.rb#17170 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#17216 + # source://prism//lib/prism/node.rb#17165 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?filepath: String, ?location: Location) -> SourceFileNode # - # source://prism//lib/prism/node.rb#17226 + # source://prism//lib/prism/node.rb#17175 sig { params(flags: Integer, filepath: String, location: Prism::Location).returns(Prism::SourceFileNode) } def copy(flags: T.unsafe(nil), filepath: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#17211 + # source://prism//lib/prism/node.rb#17160 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, filepath: String, location: Location } # - # source://prism//lib/prism/node.rb#17234 + # source://prism//lib/prism/node.rb#17183 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -30615,7 +30717,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#17243 + # source://prism//lib/prism/node.rb#17192 sig { returns(String) } def filepath; end @@ -30623,7 +30725,7 @@ class Prism::SourceFileNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#17251 + # source://prism//lib/prism/node.rb#17200 sig { returns(T::Boolean) } def forced_binary_encoding?; end @@ -30631,7 +30733,7 @@ class Prism::SourceFileNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#17246 + # source://prism//lib/prism/node.rb#17195 sig { returns(T::Boolean) } def forced_utf8_encoding?; end @@ -30639,13 +30741,13 @@ class Prism::SourceFileNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#17256 + # source://prism//lib/prism/node.rb#17205 sig { returns(T::Boolean) } def frozen?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#17266 + # source://prism//lib/prism/node.rb#17215 sig { override.returns(String) } def inspect; end @@ -30653,7 +30755,7 @@ class Prism::SourceFileNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#17261 + # source://prism//lib/prism/node.rb#17210 sig { returns(T::Boolean) } def mutable?; end @@ -30672,7 +30774,7 @@ class Prism::SourceFileNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#17284 + # source://prism//lib/prism/node.rb#17233 sig { override.returns(Symbol) } def type; end @@ -30680,7 +30782,7 @@ class Prism::SourceFileNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#17239 + # source://prism//lib/prism/node.rb#17188 sig { returns(Integer) } def flags; end @@ -30692,7 +30794,7 @@ class Prism::SourceFileNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#17294 + # source://prism//lib/prism/node.rb#17243 def type; end end end @@ -30702,62 +30804,62 @@ end # __LINE__ # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#17312 +# source://prism//lib/prism/node.rb#17260 class Prism::SourceLineNode < ::Prism::Node # def initialize: (Location location) -> void # # @return [SourceLineNode] a new instance of SourceLineNode # - # source://prism//lib/prism/node.rb#17313 + # source://prism//lib/prism/node.rb#17262 sig { params(source: Prism::Source, location: Prism::Location).void } def initialize(source, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#17387 + # source://prism//lib/prism/node.rb#17335 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#17320 + # source://prism//lib/prism/node.rb#17268 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#17325 + # source://prism//lib/prism/node.rb#17273 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#17335 + # source://prism//lib/prism/node.rb#17283 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#17330 + # source://prism//lib/prism/node.rb#17278 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?location: Location) -> SourceLineNode # - # source://prism//lib/prism/node.rb#17340 + # source://prism//lib/prism/node.rb#17288 sig { params(location: Prism::Location).returns(Prism::SourceLineNode) } def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#17325 + # source://prism//lib/prism/node.rb#17273 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#17348 + # source://prism//lib/prism/node.rb#17296 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -30766,7 +30868,7 @@ class Prism::SourceLineNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#17353 + # source://prism//lib/prism/node.rb#17301 sig { override.returns(String) } def inspect; end @@ -30785,7 +30887,7 @@ class Prism::SourceLineNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#17371 + # source://prism//lib/prism/node.rb#17319 sig { override.returns(Symbol) } def type; end @@ -30797,7 +30899,7 @@ class Prism::SourceLineNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#17381 + # source://prism//lib/prism/node.rb#17329 def type; end end end @@ -30807,13 +30909,13 @@ end # [*a] # ^^ # -# source://prism//lib/prism/node.rb#17397 +# source://prism//lib/prism/node.rb#17344 class Prism::SplatNode < ::Prism::Node # def initialize: (Location operator_loc, Prism::node? expression, Location location) -> void # # @return [SplatNode] a new instance of SplatNode # - # source://prism//lib/prism/node.rb#17398 + # source://prism//lib/prism/node.rb#17346 sig do params( source: Prism::Source, @@ -30827,36 +30929,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#17491 + # source://prism//lib/prism/node.rb#17438 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#17407 + # source://prism//lib/prism/node.rb#17354 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#17412 + # source://prism//lib/prism/node.rb#17359 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#17424 + # source://prism//lib/prism/node.rb#17371 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#17417 + # source://prism//lib/prism/node.rb#17364 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?operator_loc: Location, ?expression: Prism::node?, ?location: Location) -> SplatNode # - # source://prism//lib/prism/node.rb#17429 + # source://prism//lib/prism/node.rb#17376 sig do params( operator_loc: Prism::Location, @@ -30869,19 +30971,19 @@ class Prism::SplatNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#17412 + # source://prism//lib/prism/node.rb#17359 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { operator_loc: Location, expression: Prism::node?, location: Location } # - # source://prism//lib/prism/node.rb#17437 + # source://prism//lib/prism/node.rb#17384 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#17449 + # source://prism//lib/prism/node.rb#17396 sig { returns(T.nilable(Prism::Node)) } def expression; end @@ -30890,19 +30992,19 @@ class Prism::SplatNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#17457 + # source://prism//lib/prism/node.rb#17404 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#17452 + # source://prism//lib/prism/node.rb#17399 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#17442 + # source://prism//lib/prism/node.rb#17389 sig { returns(Prism::Location) } def operator_loc; end @@ -30921,7 +31023,7 @@ class Prism::SplatNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#17475 + # source://prism//lib/prism/node.rb#17422 sig { override.returns(Symbol) } def type; end @@ -30933,7 +31035,7 @@ class Prism::SplatNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#17485 + # source://prism//lib/prism/node.rb#17432 def type; end end end @@ -30943,68 +31045,68 @@ end # foo; bar; baz # ^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#17503 +# source://prism//lib/prism/node.rb#17449 class Prism::StatementsNode < ::Prism::Node # def initialize: (Array[Prism::node] body, Location location) -> void # # @return [StatementsNode] a new instance of StatementsNode # - # source://prism//lib/prism/node.rb#17504 + # source://prism//lib/prism/node.rb#17451 sig { params(source: Prism::Source, body: T::Array[Prism::Node], location: Prism::Location).void } def initialize(source, body, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#17582 + # source://prism//lib/prism/node.rb#17528 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#17512 + # source://prism//lib/prism/node.rb#17458 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#17545 + # source://prism//lib/prism/node.rb#17491 sig { returns(T::Array[Prism::Node]) } def body; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#17517 + # source://prism//lib/prism/node.rb#17463 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#17527 + # source://prism//lib/prism/node.rb#17473 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#17522 + # source://prism//lib/prism/node.rb#17468 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?body: Array[Prism::node], ?location: Location) -> StatementsNode # - # source://prism//lib/prism/node.rb#17532 + # source://prism//lib/prism/node.rb#17478 sig { params(body: T::Array[Prism::Node], location: Prism::Location).returns(Prism::StatementsNode) } def copy(body: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#17517 + # source://prism//lib/prism/node.rb#17463 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { body: Array[Prism::node], location: Location } # - # source://prism//lib/prism/node.rb#17540 + # source://prism//lib/prism/node.rb#17486 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -31013,7 +31115,7 @@ class Prism::StatementsNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#17548 + # source://prism//lib/prism/node.rb#17494 sig { override.returns(String) } def inspect; end @@ -31032,7 +31134,7 @@ class Prism::StatementsNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#17566 + # source://prism//lib/prism/node.rb#17512 sig { override.returns(Symbol) } def type; end @@ -31044,30 +31146,30 @@ class Prism::StatementsNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#17576 + # source://prism//lib/prism/node.rb#17522 def type; end end end # Flags for string nodes. # -# source://prism//lib/prism/node.rb#19343 +# source://prism//lib/prism/node.rb#19268 module Prism::StringFlags; end # internal bytes forced the encoding to binary # -# source://prism//lib/prism/node.rb#19348 +# source://prism//lib/prism/node.rb#19273 Prism::StringFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer) # internal bytes forced the encoding to UTF-8 # -# source://prism//lib/prism/node.rb#19345 +# source://prism//lib/prism/node.rb#19270 Prism::StringFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) -# source://prism//lib/prism/node.rb#19351 +# source://prism//lib/prism/node.rb#19276 Prism::StringFlags::FROZEN = T.let(T.unsafe(nil), Integer) -# source://prism//lib/prism/node.rb#19354 +# source://prism//lib/prism/node.rb#19279 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. @@ -31081,7 +31183,7 @@ Prism::StringFlags::MUTABLE = T.let(T.unsafe(nil), Integer) # "foo #{bar} baz" # ^^^^ ^^^^ # -# source://prism//lib/prism/node.rb#17600 +# source://prism//lib/prism/node.rb#17545 class Prism::StringNode < ::Prism::Node include ::Prism::HeredocQuery @@ -31089,7 +31191,7 @@ class Prism::StringNode < ::Prism::Node # # @return [StringNode] a new instance of StringNode # - # source://prism//lib/prism/node.rb#17601 + # source://prism//lib/prism/node.rb#17547 sig do params( source: Prism::Source, @@ -31106,60 +31208,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#17755 + # source://prism//lib/prism/node.rb#17700 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#17613 + # source://prism//lib/prism/node.rb#17558 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#17618 + # source://prism//lib/prism/node.rb#17563 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#17716 + # source://prism//lib/prism/node.rb#17661 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#17670 + # source://prism//lib/prism/node.rb#17615 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#17628 + # source://prism//lib/prism/node.rb#17573 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#17623 + # source://prism//lib/prism/node.rb#17568 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def content: () -> String # - # source://prism//lib/prism/node.rb#17711 + # source://prism//lib/prism/node.rb#17656 sig { returns(String) } def content; end # attr_reader content_loc: Location # - # source://prism//lib/prism/node.rb#17663 + # source://prism//lib/prism/node.rb#17608 sig { returns(Prism::Location) } def content_loc; end # def copy: (?flags: Integer, ?opening_loc: Location?, ?content_loc: Location, ?closing_loc: Location?, ?unescaped: String, ?location: Location) -> StringNode # - # source://prism//lib/prism/node.rb#17633 + # source://prism//lib/prism/node.rb#17578 sig do params( flags: Integer, @@ -31175,13 +31277,13 @@ class Prism::StringNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#17618 + # source://prism//lib/prism/node.rb#17563 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location?, content_loc: Location, closing_loc: Location?, unescaped: String, location: Location } # - # source://prism//lib/prism/node.rb#17641 + # source://prism//lib/prism/node.rb#17586 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -31192,7 +31294,7 @@ class Prism::StringNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#17691 + # source://prism//lib/prism/node.rb#17636 sig { returns(T::Boolean) } def forced_binary_encoding?; end @@ -31200,7 +31302,7 @@ class Prism::StringNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#17686 + # source://prism//lib/prism/node.rb#17631 sig { returns(T::Boolean) } def forced_utf8_encoding?; end @@ -31208,7 +31310,7 @@ class Prism::StringNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#17696 + # source://prism//lib/prism/node.rb#17641 sig { returns(T::Boolean) } def frozen?; end @@ -31217,7 +31319,7 @@ class Prism::StringNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#17721 + # source://prism//lib/prism/node.rb#17666 sig { override.returns(String) } def inspect; end @@ -31225,26 +31327,26 @@ class Prism::StringNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#17701 + # source://prism//lib/prism/node.rb#17646 sig { returns(T::Boolean) } def mutable?; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#17706 + # source://prism//lib/prism/node.rb#17651 sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#17650 + # source://prism//lib/prism/node.rb#17595 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end # Occasionally it's helpful to treat a string as if it were interpolated so # that there's a consistent interface for working with strings. # - # source://prism//lib/prism/node_ext.rb#66 + # source://prism//lib/prism/node_ext.rb#69 sig { returns(Prism::InterpolatedStringNode) } def to_interpolated; end @@ -31263,13 +31365,13 @@ class Prism::StringNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#17739 + # source://prism//lib/prism/node.rb#17684 sig { override.returns(Symbol) } def type; end # attr_reader unescaped: String # - # source://prism//lib/prism/node.rb#17683 + # source://prism//lib/prism/node.rb#17628 sig { returns(String) } def unescaped; end @@ -31277,7 +31379,7 @@ class Prism::StringNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#17646 + # source://prism//lib/prism/node.rb#17591 sig { returns(Integer) } def flags; end @@ -31289,7 +31391,7 @@ class Prism::StringNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#17749 + # source://prism//lib/prism/node.rb#17694 def type; end end end @@ -31302,13 +31404,13 @@ end # super foo, bar # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#17773 +# source://prism//lib/prism/node.rb#17717 class Prism::SuperNode < ::Prism::Node # def initialize: (Location keyword_loc, Location? lparen_loc, ArgumentsNode? arguments, Location? rparen_loc, Prism::node? block, Location location) -> void # # @return [SuperNode] a new instance of SuperNode # - # source://prism//lib/prism/node.rb#17774 + # source://prism//lib/prism/node.rb#17719 sig do params( source: Prism::Source, @@ -31325,48 +31427,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#17910 + # source://prism//lib/prism/node.rb#17854 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#17786 + # source://prism//lib/prism/node.rb#17730 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#17842 + # source://prism//lib/prism/node.rb#17786 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end # attr_reader block: Prism::node? # - # source://prism//lib/prism/node.rb#17858 + # source://prism//lib/prism/node.rb#17802 sig { returns(T.nilable(Prism::Node)) } def block; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#17791 + # source://prism//lib/prism/node.rb#17735 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#17804 + # source://prism//lib/prism/node.rb#17748 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#17796 + # source://prism//lib/prism/node.rb#17740 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?keyword_loc: Location, ?lparen_loc: Location?, ?arguments: ArgumentsNode?, ?rparen_loc: Location?, ?block: Prism::node?, ?location: Location) -> SuperNode # - # source://prism//lib/prism/node.rb#17809 + # source://prism//lib/prism/node.rb#17753 sig do params( keyword_loc: Prism::Location, @@ -31382,13 +31484,13 @@ class Prism::SuperNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#17791 + # source://prism//lib/prism/node.rb#17735 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, lparen_loc: Location?, arguments: ArgumentsNode?, rparen_loc: Location?, block: Prism::node?, location: Location } # - # source://prism//lib/prism/node.rb#17817 + # source://prism//lib/prism/node.rb#17761 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -31397,43 +31499,43 @@ class Prism::SuperNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#17876 + # source://prism//lib/prism/node.rb#17820 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#17861 + # source://prism//lib/prism/node.rb#17805 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#17822 + # source://prism//lib/prism/node.rb#17766 sig { returns(Prism::Location) } def keyword_loc; end # def lparen: () -> String? # - # source://prism//lib/prism/node.rb#17866 + # source://prism//lib/prism/node.rb#17810 sig { returns(T.nilable(String)) } def lparen; end # attr_reader lparen_loc: Location? # - # source://prism//lib/prism/node.rb#17829 + # source://prism//lib/prism/node.rb#17773 sig { returns(T.nilable(Prism::Location)) } def lparen_loc; end # def rparen: () -> String? # - # source://prism//lib/prism/node.rb#17871 + # source://prism//lib/prism/node.rb#17815 sig { returns(T.nilable(String)) } def rparen; end # attr_reader rparen_loc: Location? # - # source://prism//lib/prism/node.rb#17845 + # source://prism//lib/prism/node.rb#17789 sig { returns(T.nilable(Prism::Location)) } def rparen_loc; end @@ -31452,7 +31554,7 @@ class Prism::SuperNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#17894 + # source://prism//lib/prism/node.rb#17838 sig { override.returns(Symbol) } def type; end @@ -31464,29 +31566,29 @@ class Prism::SuperNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#17904 + # source://prism//lib/prism/node.rb#17848 def type; end end end # Flags for symbol nodes. # -# source://prism//lib/prism/node.rb#19358 +# source://prism//lib/prism/node.rb#19283 module Prism::SymbolFlags; end # internal bytes forced the encoding to binary # -# source://prism//lib/prism/node.rb#19363 +# source://prism//lib/prism/node.rb#19288 Prism::SymbolFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer) # internal bytes forced the encoding to US-ASCII # -# source://prism//lib/prism/node.rb#19366 +# source://prism//lib/prism/node.rb#19291 Prism::SymbolFlags::FORCED_US_ASCII_ENCODING = T.let(T.unsafe(nil), Integer) # internal bytes forced the encoding to UTF-8 # -# source://prism//lib/prism/node.rb#19360 +# source://prism//lib/prism/node.rb#19285 Prism::SymbolFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) # Represents a symbol literal or a symbol contained within a `%i` list. @@ -31497,13 +31599,13 @@ Prism::SymbolFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) # %i[foo] # ^^^ # -# source://prism//lib/prism/node.rb#17928 +# source://prism//lib/prism/node.rb#17871 class Prism::SymbolNode < ::Prism::Node # def initialize: (Integer flags, Location? opening_loc, Location? value_loc, Location? closing_loc, String unescaped, Location location) -> void # # @return [SymbolNode] a new instance of SymbolNode # - # source://prism//lib/prism/node.rb#17929 + # source://prism//lib/prism/node.rb#17873 sig do params( source: Prism::Source, @@ -31520,48 +31622,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#18084 + # source://prism//lib/prism/node.rb#18027 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#17941 + # source://prism//lib/prism/node.rb#17884 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#17946 + # source://prism//lib/prism/node.rb#17889 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#18045 + # source://prism//lib/prism/node.rb#17988 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#18004 + # source://prism//lib/prism/node.rb#17947 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#17956 + # source://prism//lib/prism/node.rb#17899 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#17951 + # source://prism//lib/prism/node.rb#17894 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?opening_loc: Location?, ?value_loc: Location?, ?closing_loc: Location?, ?unescaped: String, ?location: Location) -> SymbolNode # - # source://prism//lib/prism/node.rb#17961 + # source://prism//lib/prism/node.rb#17904 sig do params( flags: Integer, @@ -31577,13 +31679,13 @@ class Prism::SymbolNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#17946 + # source://prism//lib/prism/node.rb#17889 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location?, value_loc: Location?, closing_loc: Location?, unescaped: String, location: Location } # - # source://prism//lib/prism/node.rb#17969 + # source://prism//lib/prism/node.rb#17912 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -31594,7 +31696,7 @@ class Prism::SymbolNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#18025 + # source://prism//lib/prism/node.rb#17968 sig { returns(T::Boolean) } def forced_binary_encoding?; end @@ -31602,7 +31704,7 @@ class Prism::SymbolNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#18030 + # source://prism//lib/prism/node.rb#17973 sig { returns(T::Boolean) } def forced_us_ascii_encoding?; end @@ -31610,25 +31712,25 @@ class Prism::SymbolNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#18020 + # source://prism//lib/prism/node.rb#17963 sig { returns(T::Boolean) } def forced_utf8_encoding?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#18050 + # source://prism//lib/prism/node.rb#17993 sig { override.returns(String) } def inspect; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#18035 + # source://prism//lib/prism/node.rb#17978 sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#17978 + # source://prism//lib/prism/node.rb#17921 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end @@ -31647,25 +31749,25 @@ class Prism::SymbolNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#18068 + # source://prism//lib/prism/node.rb#18011 sig { override.returns(Symbol) } def type; end # attr_reader unescaped: String # - # source://prism//lib/prism/node.rb#18017 + # source://prism//lib/prism/node.rb#17960 sig { returns(String) } def unescaped; end # def value: () -> String? # - # source://prism//lib/prism/node.rb#18040 + # source://prism//lib/prism/node.rb#17983 sig { returns(T.nilable(String)) } def value; end # attr_reader value_loc: Location? # - # source://prism//lib/prism/node.rb#17991 + # source://prism//lib/prism/node.rb#17934 sig { returns(T.nilable(Prism::Location)) } def value_loc; end @@ -31673,7 +31775,7 @@ class Prism::SymbolNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#17974 + # source://prism//lib/prism/node.rb#17917 sig { returns(Integer) } def flags; end @@ -31685,56 +31787,56 @@ class Prism::SymbolNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#18078 + # source://prism//lib/prism/node.rb#18021 def type; end end end # This represents a token from the Ruby source. # -# source://prism//lib/prism/parse_result.rb#628 +# source://prism//lib/prism/parse_result.rb#645 class Prism::Token # Create a new token object with the given type, value, and location. # # @return [Token] a new instance of Token # - # source://prism//lib/prism/parse_result.rb#640 + # source://prism//lib/prism/parse_result.rb#657 sig { params(source: Prism::Source, type: Symbol, value: String, location: T.any(Integer, Prism::Location)).void } def initialize(source, type, value, location); end # Returns true if the given other token is equal to this token. # - # source://prism//lib/prism/parse_result.rb#675 + # source://prism//lib/prism/parse_result.rb#692 sig { params(other: T.untyped).returns(T::Boolean) } def ==(other); end # Implement the hash pattern matching interface for Token. # - # source://prism//lib/prism/parse_result.rb#648 + # source://prism//lib/prism/parse_result.rb#665 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # A Location object representing the location of this token in the source. # - # source://prism//lib/prism/parse_result.rb#653 + # source://prism//lib/prism/parse_result.rb#670 sig { returns(Prism::Location) } def location; end # Implement the pretty print interface for Token. # - # source://prism//lib/prism/parse_result.rb#660 + # source://prism//lib/prism/parse_result.rb#677 sig { params(q: T.untyped).void } def pretty_print(q); end # The type of token that this token is. # - # source://prism//lib/prism/parse_result.rb#634 + # source://prism//lib/prism/parse_result.rb#651 sig { returns(Symbol) } def type; end # A byteslice of the source that this token represents. # - # source://prism//lib/prism/parse_result.rb#637 + # source://prism//lib/prism/parse_result.rb#654 sig { returns(String) } def value; end @@ -31742,7 +31844,7 @@ class Prism::Token # The Source object that represents the source this token came from. # - # source://prism//lib/prism/parse_result.rb#630 + # source://prism//lib/prism/parse_result.rb#647 sig { returns(Prism::Source) } def source; end end @@ -31758,52 +31860,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#11 +# 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#36 + # 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#44 + # 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#57 + # 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#74 + # 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#100 + # source://prism//lib/prism/translation/parser.rb#105 def try_declare_numparam(node); end - # source://prism//lib/prism/translation/parser.rb#31 + # source://prism//lib/prism/translation/parser.rb#36 sig { overridable.returns(Integer) } def version; end - # source://prism//lib/prism/translation/parser.rb#40 + # 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#258 + # 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#263 + # 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 @@ -31814,33 +31916,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#241 + # 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#275 + # 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#270 + # 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#284 + # 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#119 + # 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#219 + # 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 @@ -31848,7 +31950,7 @@ class Prism::Translation::Parser < ::Parser::Base # # @return [Boolean] # - # source://prism//lib/prism/translation/parser.rb#108 + # 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 @@ -31856,12 +31958,12 @@ class Prism::Translation::Parser < ::Parser::Base # # @return [Boolean] # - # source://prism//lib/prism/translation/parser.rb#114 + # 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#192 + # source://prism//lib/prism/translation/parser.rb#197 def warning_diagnostic(warning, offset_cache); end end @@ -31886,7 +31988,7 @@ 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#9 +# 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. @@ -31961,7 +32063,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # foo(bar) # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#101 + # source://prism//lib/prism/translation/parser/compiler.rb#105 def visit_arguments_node(node); end # [] @@ -31979,7 +32081,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # { a: 1 } # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#107 + # source://prism//lib/prism/translation/parser/compiler.rb#111 def visit_assoc_node(node); end # def foo(**); bar(**); end @@ -31988,49 +32090,49 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # { **foo } # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#148 + # source://prism//lib/prism/translation/parser/compiler.rb#160 def visit_assoc_splat_node(node); end # $+ # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#158 + # 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#164 + # 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#202 + # 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#208 + # 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#213 + # 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#219 + # 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#224 + # source://prism//lib/prism/translation/parser/compiler.rb#238 def visit_block_parameters_node(node); end # break @@ -32039,13 +32141,13 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # break foo # ^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#233 + # 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#338 + # source://prism//lib/prism/translation/parser/compiler.rb#352 def visit_call_and_write_node(node); end # foo @@ -32057,133 +32159,133 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # foo.bar() {} # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#245 + # 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#319 + # 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#357 + # 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#376 + # 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#388 + # 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#407 + # 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#394 + # 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#420 + # 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#459 + # 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#449 + # 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#469 + # 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#433 + # 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#479 + # 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#439 + # 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#510 + # 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#500 + # 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#520 + # 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#576 + # 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#536 + # 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#566 + # 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#586 + # 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#596 + # source://prism//lib/prism/translation/parser/compiler.rb#610 def visit_constant_path_target_node(node); end # Foo::Bar = 1 @@ -32192,19 +32294,19 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # Foo::Foo, Bar::Bar = 1 # ^^^^^^^^ ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#556 + # 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#485 + # 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#530 + # source://prism//lib/prism/translation/parser/compiler.rb#544 def visit_constant_target_node(node); end # Foo = 1 @@ -32213,7 +32315,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # Foo, Bar = 1 # ^^^ ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#494 + # source://prism//lib/prism/translation/parser/compiler.rb#508 def visit_constant_write_node(node); end # def foo; end @@ -32222,7 +32324,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # def self.foo; end # ^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#605 + # source://prism//lib/prism/translation/parser/compiler.rb#619 def visit_def_node(node); end # defined? a @@ -32231,25 +32333,25 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # defined?(a) # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#652 + # 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#664 + # 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#670 + # 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#680 + # source://prism//lib/prism/translation/parser/compiler.rb#694 def visit_embedded_variable_node(node); end # begin; foo; ensure; bar; end @@ -32257,19 +32359,19 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # # @raise [CompilationError] # - # source://prism//lib/prism/translation/parser/compiler.rb#686 + # source://prism//lib/prism/translation/parser/compiler.rb#700 def visit_ensure_node(node); end # false # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#692 + # 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#698 + # source://prism//lib/prism/translation/parser/compiler.rb#712 def visit_find_pattern_node(node); end # 0..5 @@ -32277,31 +32379,31 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # if foo .. bar; end # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1494 + # 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#710 + # 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#716 + # 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#734 + # 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#740 + # source://prism//lib/prism/translation/parser/compiler.rb#754 def visit_forwarding_parameter_node(node); end # super @@ -32310,55 +32412,55 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # super {} # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#749 + # 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#787 + # 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#777 + # 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#797 + # 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#761 + # 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#807 + # 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#767 + # 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#813 + # source://prism//lib/prism/translation/parser/compiler.rb#827 def visit_hash_node(node); end # foo => {} # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#823 + # source://prism//lib/prism/translation/parser/compiler.rb#837 def visit_hash_pattern_node(node); end # if foo then bar end @@ -32370,13 +32472,13 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # foo ? bar : baz # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#841 + # source://prism//lib/prism/translation/parser/compiler.rb#855 def visit_if_node(node); end # 1i # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#883 + # source://prism//lib/prism/translation/parser/compiler.rb#897 def visit_imaginary_node(node); end # { foo: } @@ -32384,7 +32486,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # # @raise [CompilationError] # - # source://prism//lib/prism/translation/parser/compiler.rb#889 + # source://prism//lib/prism/translation/parser/compiler.rb#903 def visit_implicit_node(node); end # foo { |bar,| } @@ -32392,74 +32494,74 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # # @raise [CompilationError] # - # source://prism//lib/prism/translation/parser/compiler.rb#895 + # 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#901 + # 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#945 + # 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#927 + # 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#963 + # 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#981 + # source://prism//lib/prism/translation/parser/compiler.rb#995 def visit_index_target_node(node); end # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1018 + # 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#1008 + # 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#1028 + # 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#992 + # 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#1038 + # 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#998 + # 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#1044 + # source://prism//lib/prism/translation/parser/compiler.rb#1058 def visit_integer_node(node); end # /foo #{bar}/ @@ -32467,43 +32569,49 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # if /foo #{bar}/ then end # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1050 + # 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#1050 + # 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#1065 + # 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#1128 + # 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#1138 + # 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 + def visit_it_local_variable_read_node(node); end + # -> { it } # ^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1153 + # 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#1159 + # source://prism//lib/prism/translation/parser/compiler.rb#1149 def visit_keyword_hash_node(node); end # def foo(**bar); end @@ -32512,49 +32620,49 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # def foo(**); end # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1168 + # 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#1177 + # 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#1236 + # 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#1226 + # 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#1246 + # 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#1203 + # 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#1256 + # 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#1216 + # source://prism//lib/prism/translation/parser/compiler.rb#1199 def visit_local_variable_write_node(node); end # /foo/ @@ -32562,50 +32670,50 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # if /foo/ then end # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1528 + # 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#1266 + # 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#1276 + # source://prism//lib/prism/translation/parser/compiler.rb#1259 def visit_match_required_node(node); end # /(?foo)/ =~ bar # ^^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1286 + # 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#1297 + # 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#1303 + # 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#1314 + # 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#1328 + # source://prism//lib/prism/translation/parser/compiler.rb#1307 def visit_multi_write_node(node); end # next @@ -32614,55 +32722,55 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # next foo # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1349 + # source://prism//lib/prism/translation/parser/compiler.rb#1330 def visit_next_node(node); end # nil # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1361 + # 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#1367 + # 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#1377 + # 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#1383 + # 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#1389 + # 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#1395 + # 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#1401 + # 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#1407 + # source://prism//lib/prism/translation/parser/compiler.rb#1388 def visit_parameters_node(node); end # () @@ -32671,76 +32779,76 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # (1) # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1446 + # 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#1456 + # 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#1463 + # 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#1468 + # 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#1478 + # 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#1488 + # 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#1494 + # source://prism//lib/prism/translation/parser/compiler.rb#1475 def visit_range_node(node); end # 1r # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1516 + # source://prism//lib/prism/translation/parser/compiler.rb#1497 def visit_rational_node(node); end # redo # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1522 + # source://prism//lib/prism/translation/parser/compiler.rb#1503 def visit_redo_node(node); end # /foo/ # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1528 + # 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#1543 + # 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#1549 + # 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#1555 + # source://prism//lib/prism/translation/parser/compiler.rb#1547 def visit_rescue_modifier_node(node); end # begin; rescue; end @@ -32748,7 +32856,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # # @raise [CompilationError] # - # source://prism//lib/prism/translation/parser/compiler.rb#1573 + # source://prism//lib/prism/translation/parser/compiler.rb#1565 def visit_rescue_node(node); end # def foo(*bar); end @@ -32757,13 +32865,13 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # def foo(*); end # ^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1582 + # 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#1588 + # source://prism//lib/prism/translation/parser/compiler.rb#1580 def visit_retry_node(node); end # return @@ -32772,42 +32880,42 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # return 1 # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1597 + # source://prism//lib/prism/translation/parser/compiler.rb#1589 def visit_return_node(node); end # self # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1609 + # 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#1614 + # 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#1620 + # 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#1632 + # 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#1638 + # 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#1644 + # source://prism//lib/prism/translation/parser/compiler.rb#1636 def visit_source_line_node(node); end # foo(*bar) @@ -32819,42 +32927,42 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # def foo(*); bar(*); end # ^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1656 + # 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#1669 + # source://prism//lib/prism/translation/parser/compiler.rb#1661 def visit_statements_node(node); end # "foo" # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1675 + # 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#1716 + # source://prism//lib/prism/translation/parser/compiler.rb#1709 def visit_super_node(node); end # :foo # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1739 + # source://prism//lib/prism/translation/parser/compiler.rb#1732 def visit_symbol_node(node); end # true # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1771 + # 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#1777 + # source://prism//lib/prism/translation/parser/compiler.rb#1770 def visit_undef_node(node); end # unless foo; bar end @@ -32863,7 +32971,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # bar unless foo # ^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1786 + # source://prism//lib/prism/translation/parser/compiler.rb#1779 def visit_unless_node(node); end # until foo; bar end @@ -32872,13 +32980,13 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # bar until foo # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1816 + # 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#1838 + # source://prism//lib/prism/translation/parser/compiler.rb#1831 def visit_when_node(node); end # while foo; bar end @@ -32887,13 +32995,13 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # bar while foo # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1856 + # source://prism//lib/prism/translation/parser/compiler.rb#1849 def visit_while_node(node); end # `foo` # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1878 + # source://prism//lib/prism/translation/parser/compiler.rb#1871 def visit_x_string_node(node); end # yield @@ -32902,29 +33010,34 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # yield 1 # ^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1910 + # source://prism//lib/prism/translation/parser/compiler.rb#1902 def visit_yield_node(node); end private + # 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 + 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#1924 + # 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#1931 + # source://prism//lib/prism/translation/parser/compiler.rb#1923 def find_forwarding(node); end - # Because we have mutated the AST to allow for newlines in the middle of - # a rational, we need to manually handle the value here. + # Returns the set of targets for a MultiTargetNode or a MultiWriteNode. # - # source://prism//lib/prism/translation/parser/compiler.rb#1945 - def imaginary_value(node); end + # 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 # have a negative sign on one line and then a number on the next line. @@ -32932,7 +33045,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#1954 + # 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 @@ -32941,18 +33054,12 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # # @return [Boolean] # - # source://prism//lib/prism/translation/parser/compiler.rb#1966 + # source://prism//lib/prism/translation/parser/compiler.rb#1962 def procarg0?(parameters); end - # Because we have mutated the AST to allow for newlines in the middle of - # a rational, we need to manually handle the value here. - # - # source://prism//lib/prism/translation/parser/compiler.rb#1979 - def rational_value(node); end - # Constructs a new source range from the given start and end offsets. # - # source://prism//lib/prism/translation/parser/compiler.rb#1993 + # 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 @@ -32962,37 +33069,37 @@ 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#2008 + # 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#1998 + # 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#2018 + # 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#2023 + # 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#2057 + # 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#2103 + # 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#2115 + # source://prism//lib/prism/translation/parser/compiler.rb#2135 def within_pattern; end end @@ -33005,10 +33112,10 @@ class Prism::Translation::Parser::Compiler::CompilationError < ::StandardError; # store a reference to its constant to make it slightly faster to look # up. # -# source://prism//lib/prism/translation/parser/compiler.rb#1990 +# source://prism//lib/prism/translation/parser/compiler.rb#1976 Prism::Translation::Parser::Compiler::Range = Parser::Source::Range -# source://prism//lib/prism/translation/parser.rb#12 +# 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 @@ -33094,22 +33201,22 @@ Prism::Translation::Parser::Lexer::TYPES = T.let(T.unsafe(nil), Hash) # messages. We create our own diagnostic class in order to set our own # error messages. # -# source://prism//lib/prism/translation/parser.rb#19 +# 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#23 + # 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#20 + # source://prism//lib/prism/translation/parser.rb#25 def message; end end -# source://prism//lib/prism/translation/parser.rb#29 +# 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 @@ -33148,7 +33255,7 @@ 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#45 +# source://prism//lib/prism/translation/ripper.rb#43 class Prism::Translation::Ripper < ::Prism::Compiler # Create a new Translation::Ripper object with the given source. # @@ -33745,15 +33852,21 @@ class Prism::Translation::Ripper < ::Prism::Compiler def visit_interpolated_x_string_node(node); end # -> { it } - # ^^^^^^^^^ + # ^^ # # 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 def visit_it_parameters_node(node); end # foo(bar: baz) # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2227 + # source://prism//lib/prism/translation/ripper.rb#2234 def visit_keyword_hash_node(node); end # def foo(**bar); end @@ -33762,96 +33875,96 @@ class Prism::Translation::Ripper < ::Prism::Compiler # def foo(**); end # ^^ # - # source://prism//lib/prism/translation/ripper.rb#2239 + # source://prism//lib/prism/translation/ripper.rb#2246 def visit_keyword_rest_parameter_node(node); end # -> {} # - # source://prism//lib/prism/translation/ripper.rb#2253 + # source://prism//lib/prism/translation/ripper.rb#2260 def visit_lambda_node(node); end # foo &&= bar # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2350 + # 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#2336 + # 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#2364 + # 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#2313 + # 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#2378 + # 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#2325 + # 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#2385 + # 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#2400 + # source://prism//lib/prism/translation/ripper.rb#2402 def visit_match_predicate_node(node); end # foo => bar # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2409 + # source://prism//lib/prism/translation/ripper.rb#2411 def visit_match_required_node(node); end # /(?foo)/ =~ bar # ^^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2418 + # 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#2424 + # source://prism//lib/prism/translation/ripper.rb#2426 def visit_missing_node(node); end # module Foo; end # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2430 + # 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#2447 + # 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#2501 + # source://prism//lib/prism/translation/ripper.rb#2503 def visit_multi_write_node(node); end # next @@ -33860,55 +33973,55 @@ class Prism::Translation::Ripper < ::Prism::Compiler # next foo # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2521 + # source://prism//lib/prism/translation/ripper.rb#2523 def visit_next_node(node); end # nil # ^^^ # - # source://prism//lib/prism/translation/ripper.rb#2535 + # 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#2542 + # 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#2551 + # source://prism//lib/prism/translation/ripper.rb#2553 def visit_numbered_parameters_node(node); end # $1 # ^^ # - # source://prism//lib/prism/translation/ripper.rb#2556 + # 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#2563 + # 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#2573 + # 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#2583 + # 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#2593 + # source://prism//lib/prism/translation/ripper.rb#2595 def visit_parameters_node(node); end # () @@ -33917,84 +34030,84 @@ class Prism::Translation::Ripper < ::Prism::Compiler # (1) # ^^^ # - # source://prism//lib/prism/translation/ripper.rb#2620 + # source://prism//lib/prism/translation/ripper.rb#2622 def visit_parentheses_node(node); end # foo => ^(bar) # ^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2634 + # 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#2643 + # source://prism//lib/prism/translation/ripper.rb#2645 def visit_pinned_variable_node(node); end # END {} # ^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2649 + # source://prism//lib/prism/translation/ripper.rb#2651 def visit_post_execution_node(node); end # BEGIN {} # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2664 + # 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#2678 + # source://prism//lib/prism/translation/ripper.rb#2680 def visit_program_node(node); end # 0..5 # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2689 + # source://prism//lib/prism/translation/ripper.rb#2691 def visit_range_node(node); end # 1r # ^^ # - # source://prism//lib/prism/translation/ripper.rb#2703 + # source://prism//lib/prism/translation/ripper.rb#2705 def visit_rational_node(node); end # redo # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2709 + # source://prism//lib/prism/translation/ripper.rb#2711 def visit_redo_node(node); end # /foo/ # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2716 + # 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#2738 + # 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#2745 + # 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#2752 + # 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#2762 + # source://prism//lib/prism/translation/ripper.rb#2764 def visit_rescue_node(node); end # def foo(*bar); end @@ -34003,13 +34116,13 @@ class Prism::Translation::Ripper < ::Prism::Compiler # def foo(*); end # ^ # - # source://prism//lib/prism/translation/ripper.rb#2820 + # source://prism//lib/prism/translation/ripper.rb#2822 def visit_rest_parameter_node(node); end # retry # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2832 + # source://prism//lib/prism/translation/ripper.rb#2834 def visit_retry_node(node); end # return @@ -34018,42 +34131,42 @@ class Prism::Translation::Ripper < ::Prism::Compiler # return 1 # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2842 + # source://prism//lib/prism/translation/ripper.rb#2844 def visit_return_node(node); end # self # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2856 + # source://prism//lib/prism/translation/ripper.rb#2858 def visit_self_node(node); end # A shareable constant. # - # source://prism//lib/prism/translation/ripper.rb#2862 + # 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#2868 + # source://prism//lib/prism/translation/ripper.rb#2870 def visit_singleton_class_node(node); end # __ENCODING__ # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2878 + # source://prism//lib/prism/translation/ripper.rb#2880 def visit_source_encoding_node(node); end # __FILE__ # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2885 + # source://prism//lib/prism/translation/ripper.rb#2887 def visit_source_file_node(node); end # __LINE__ # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2892 + # source://prism//lib/prism/translation/ripper.rb#2894 def visit_source_line_node(node); end # foo(*bar) @@ -34065,42 +34178,42 @@ class Prism::Translation::Ripper < ::Prism::Compiler # def foo(*); bar(*); end # ^ # - # source://prism//lib/prism/translation/ripper.rb#2905 + # 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#2910 + # source://prism//lib/prism/translation/ripper.rb#2912 def visit_statements_node(node); end # "foo" # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2927 + # source://prism//lib/prism/translation/ripper.rb#2929 def visit_string_node(node); end # super(foo) # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#3059 + # source://prism//lib/prism/translation/ripper.rb#3061 def visit_super_node(node); end # :foo # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#3080 + # source://prism//lib/prism/translation/ripper.rb#3082 def visit_symbol_node(node); end # true # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#3104 + # source://prism//lib/prism/translation/ripper.rb#3106 def visit_true_node(node); end # undef foo # ^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#3111 + # source://prism//lib/prism/translation/ripper.rb#3113 def visit_undef_node(node); end # unless foo; bar end @@ -34109,7 +34222,7 @@ class Prism::Translation::Ripper < ::Prism::Compiler # bar unless foo # ^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#3123 + # source://prism//lib/prism/translation/ripper.rb#3125 def visit_unless_node(node); end # until foo; bar end @@ -34118,13 +34231,13 @@ class Prism::Translation::Ripper < ::Prism::Compiler # bar until foo # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#3151 + # 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#3175 + # source://prism//lib/prism/translation/ripper.rb#3177 def visit_when_node(node); end # while foo; bar end @@ -34133,13 +34246,13 @@ class Prism::Translation::Ripper < ::Prism::Compiler # bar while foo # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#3196 + # source://prism//lib/prism/translation/ripper.rb#3198 def visit_while_node(node); end # `foo` # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#3220 + # source://prism//lib/prism/translation/ripper.rb#3222 def visit_x_string_node(node); end # yield @@ -34148,32 +34261,32 @@ class Prism::Translation::Ripper < ::Prism::Compiler # yield 1 # ^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#3243 + # source://prism//lib/prism/translation/ripper.rb#3245 def visit_yield_node(node); end private # :stopdoc: # - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def _dispatch_0; end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def _dispatch_1(_); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def _dispatch_2(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3390 + # source://prism//lib/prism/translation/ripper.rb#3392 def _dispatch_3(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3391 + # source://prism//lib/prism/translation/ripper.rb#3393 def _dispatch_4(_, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3392 + # source://prism//lib/prism/translation/ripper.rb#3394 def _dispatch_5(_, _, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3393 + # source://prism//lib/prism/translation/ripper.rb#3395 def _dispatch_7(_, _, _, _, _, _, _); end # This method is responsible for updating lineno and column information @@ -34182,7 +34295,7 @@ 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#3377 + # source://prism//lib/prism/translation/ripper.rb#3379 def bounds(location); end # Returns true if the given node is a command node. @@ -34194,7 +34307,7 @@ class Prism::Translation::Ripper < ::Prism::Compiler # This method is called when the parser found syntax error. # - # source://prism//lib/prism/translation/ripper.rb#3415 + # source://prism//lib/prism/translation/ripper.rb#3417 def compile_error(msg); end # This method is provided by the Ripper C extension. It is called when a @@ -34202,589 +34315,589 @@ 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#3430 + # source://prism//lib/prism/translation/ripper.rb#3432 def dedent_string(string, width); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_BEGIN(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_CHAR(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_END(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on___end__(_); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_alias(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_alias_error(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_aref(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_aref_field(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_arg_ambiguous(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_arg_paren(_); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_args_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_args_add_block(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_args_add_star(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_args_forward; end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_args_new; end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_array(_); end - # source://prism//lib/prism/translation/ripper.rb#3391 + # source://prism//lib/prism/translation/ripper.rb#3393 def on_aryptn(_, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_assign(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_assign_error(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_assoc_new(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_assoc_splat(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_assoclist_from_args(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_backref(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_backtick(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_bare_assoc_hash(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_begin(_); end - # source://prism//lib/prism/translation/ripper.rb#3390 + # source://prism//lib/prism/translation/ripper.rb#3392 def on_binary(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_block_var(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_blockarg(_); end - # source://prism//lib/prism/translation/ripper.rb#3391 + # source://prism//lib/prism/translation/ripper.rb#3393 def on_bodystmt(_, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_brace_block(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_break(_); end - # source://prism//lib/prism/translation/ripper.rb#3390 + # source://prism//lib/prism/translation/ripper.rb#3392 def on_call(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_case(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3390 + # source://prism//lib/prism/translation/ripper.rb#3392 def on_class(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_class_name_error(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_comma(_); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_command(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3391 + # source://prism//lib/prism/translation/ripper.rb#3393 def on_command_call(_, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_comment(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_const(_); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_const_path_field(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_const_path_ref(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_const_ref(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_cvar(_); end - # source://prism//lib/prism/translation/ripper.rb#3390 + # source://prism//lib/prism/translation/ripper.rb#3392 def on_def(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_defined(_); end - # source://prism//lib/prism/translation/ripper.rb#3392 + # source://prism//lib/prism/translation/ripper.rb#3394 def on_defs(_, _, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_do_block(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_dot2(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_dot3(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_dyna_symbol(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_else(_); end - # source://prism//lib/prism/translation/ripper.rb#3390 + # source://prism//lib/prism/translation/ripper.rb#3392 def on_elsif(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_embdoc(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_embdoc_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_embdoc_end(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_embexpr_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_embexpr_end(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_embvar(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_ensure(_); end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_excessed_comma; end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_fcall(_); end - # source://prism//lib/prism/translation/ripper.rb#3390 + # source://prism//lib/prism/translation/ripper.rb#3392 def on_field(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_float(_); end - # source://prism//lib/prism/translation/ripper.rb#3391 + # source://prism//lib/prism/translation/ripper.rb#3393 def on_fndptn(_, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3390 + # source://prism//lib/prism/translation/ripper.rb#3392 def on_for(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_gvar(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_hash(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_heredoc_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_heredoc_dedent(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_heredoc_end(_); end - # source://prism//lib/prism/translation/ripper.rb#3390 + # source://prism//lib/prism/translation/ripper.rb#3392 def on_hshptn(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_ident(_); end - # source://prism//lib/prism/translation/ripper.rb#3390 + # source://prism//lib/prism/translation/ripper.rb#3392 def on_if(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_if_mod(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3390 + # source://prism//lib/prism/translation/ripper.rb#3392 def on_ifop(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_ignored_nl(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_ignored_sp(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_imaginary(_); end - # source://prism//lib/prism/translation/ripper.rb#3390 + # source://prism//lib/prism/translation/ripper.rb#3392 def on_in(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_int(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_ivar(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_kw(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_kwrest_param(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_label(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_label_end(_); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_lambda(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_lbrace(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_lbracket(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_lparen(_); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_magic_comment(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_massign(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_method_add_arg(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_method_add_block(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_mlhs_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_mlhs_add_post(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_mlhs_add_star(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_mlhs_new; end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_mlhs_paren(_); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_module(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_mrhs_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_mrhs_add_star(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_mrhs_new; end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_mrhs_new_from_args(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_next(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_nl(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_nokw_param(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_op(_); end - # source://prism//lib/prism/translation/ripper.rb#3390 + # source://prism//lib/prism/translation/ripper.rb#3392 def on_opassign(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_operator_ambiguous(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_param_error(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3393 + # source://prism//lib/prism/translation/ripper.rb#3395 def on_params(_, _, _, _, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_paren(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_parse_error(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_period(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_program(_); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_qsymbols_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_qsymbols_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_qsymbols_new; end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_qwords_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_qwords_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_qwords_new; end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_rational(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_rbrace(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_rbracket(_); end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_redo; end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_regexp_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_regexp_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_regexp_end(_); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_regexp_literal(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_regexp_new; end - # source://prism//lib/prism/translation/ripper.rb#3391 + # source://prism//lib/prism/translation/ripper.rb#3393 def on_rescue(_, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_rescue_mod(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_rest_param(_); end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_retry; end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_return(_); end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_return0; end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_rparen(_); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_sclass(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_semicolon(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_sp(_); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_stmts_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_stmts_new; end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_string_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_string_concat(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_string_content; end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_string_dvar(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_string_embexpr(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_string_literal(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_super(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_symbeg(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_symbol(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_symbol_literal(_); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_symbols_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_symbols_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_symbols_new; end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_tlambda(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_tlambeg(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_top_const_field(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_top_const_ref(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_tstring_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_tstring_content(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_tstring_end(_); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_unary(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_undef(_); end - # source://prism//lib/prism/translation/ripper.rb#3390 + # source://prism//lib/prism/translation/ripper.rb#3392 def on_unless(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_unless_mod(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_until(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_until_mod(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_var_alias(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_var_field(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_var_ref(_); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_vcall(_); end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_void_stmt; end - # source://prism//lib/prism/translation/ripper.rb#3390 + # source://prism//lib/prism/translation/ripper.rb#3392 def on_when(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_while(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_while_mod(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_word_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_word_new; end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_words_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_words_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_words_new; end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_words_sep(_); end - # source://prism//lib/prism/translation/ripper.rb#3389 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_xstring_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_xstring_literal(_); end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_xstring_new; end - # source://prism//lib/prism/translation/ripper.rb#3388 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_yield(_); end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_yield0; end - # source://prism//lib/prism/translation/ripper.rb#3387 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_zsuper; end # Lazily initialize the parse result. # - # source://prism//lib/prism/translation/ripper.rb#3269 + # 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#3282 + # source://prism//lib/prism/translation/ripper.rb#3284 def trailing_comma?(left, right); end # Visit one side of an alias global variable node. @@ -34821,12 +34934,12 @@ class Prism::Translation::Ripper < ::Prism::Compiler # Visit a destructured positional parameter node. # - # source://prism//lib/prism/translation/ripper.rb#2607 + # 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#2978 + # 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 @@ -34835,28 +34948,28 @@ 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#2953 + # 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#3024 + # 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#3041 + # 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#2460 + # 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#3321 + # source://prism//lib/prism/translation/ripper.rb#3323 def visit_number_node(node); end # Visit a pattern within a pattern match. This is used to bypass the @@ -34870,7 +34983,7 @@ 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#2919 + # source://prism//lib/prism/translation/ripper.rb#2921 def visit_statements_node_body(body); end # Visit an individual part of a string-like node. @@ -34881,7 +34994,7 @@ class Prism::Translation::Ripper < ::Prism::Compiler # Visit the string content of a particular node. This method is used to # split into the various token types. # - # source://prism//lib/prism/translation/ripper.rb#3294 + # source://prism//lib/prism/translation/ripper.rb#3296 def visit_token(token, allow_keywords = T.unsafe(nil)); end # Dispatch a words_sep event that contains the space between the elements @@ -34893,26 +35006,26 @@ class Prism::Translation::Ripper < ::Prism::Compiler # Visit a node that represents a write value. This is used to handle the # special case of an implicit array that is generated without brackets. # - # source://prism//lib/prism/translation/ripper.rb#3339 + # source://prism//lib/prism/translation/ripper.rb#3341 def visit_write_value(node); end # Returns true if there is a semicolon between the two locations. # # @return [Boolean] # - # source://prism//lib/prism/translation/ripper.rb#3287 + # source://prism//lib/prism/translation/ripper.rb#3289 def void_stmt?(left, right, allow_newline); end # This method is called when weak warning is produced by the parser. # +fmt+ and +args+ is printf style. # - # source://prism//lib/prism/translation/ripper.rb#3406 + # source://prism//lib/prism/translation/ripper.rb#3408 def warn(fmt, *args); end # This method is called when strong warning is produced by the parser. # +fmt+ and +args+ is printf style. # - # source://prism//lib/prism/translation/ripper.rb#3411 + # source://prism//lib/prism/translation/ripper.rb#3413 def warning(fmt, *args); end class << self @@ -35036,7 +35149,7 @@ 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#11 +# source://prism//lib/prism/translation/ripper/sexp.rb#10 class Prism::Translation::Ripper::SexpBuilder < ::Prism::Translation::Ripper # :stopdoc: # @@ -35629,7 +35742,7 @@ 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#75 +# source://prism//lib/prism/translation/ripper/sexp.rb#74 class Prism::Translation::Ripper::SexpBuilderPP < ::Prism::Translation::Ripper::SexpBuilder private @@ -35721,67 +35834,1171 @@ class Prism::Translation::Ripper::SexpBuilderPP < ::Prism::Translation::Ripper:: 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 +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#1556 + 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#1562 + def parse_file(filepath); end + + private + + # Translate the given parse result and filepath into the + # seattlerb/ruby_parser gem's Sexp format. + # + # source://prism//lib/prism/translation/ruby_parser.rb#1584 + 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#1569 + 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#1575 + def parse_file(filepath); end + end +end + +# A prism visitor that builds Sexp objects. +# +# 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 + 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 + 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 + 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 + def in_pattern; end + + # alias $foo $bar + # ^^^^^^^^^^^^^^^ + # + # 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 + def visit_alias_method_node(node); end + + # foo => bar | baz + # ^^^^^^^^^ + # + # 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 + def visit_and_node(node); end + + # foo(bar) + # ^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#96 + def visit_arguments_node(node); end + + # [] + # ^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#63 + def visit_array_node(node); end + + # foo => [bar] + # ^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#73 + def visit_array_pattern_node(node); end + + # { a: 1 } + # ^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#102 + def visit_assoc_node(node); end + + # def foo(**); bar(**); end + # ^^ + # + # { **foo } + # ^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#111 + def visit_assoc_splat_node(node); end + + # $+ + # ^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#121 + def visit_back_reference_read_node(node); end + + # begin end + # ^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#127 + def visit_begin_node(node); end + + # foo(&bar) + # ^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#160 + def visit_block_argument_node(node); end + + # foo { |; bar| } + # ^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#168 + def visit_block_local_variable_node(node); end + + # A block on a keyword or method call. + # + # source://prism//lib/prism/translation/ruby_parser.rb#173 + def visit_block_node(node); end + + # def foo(&bar); end + # ^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#179 + def visit_block_parameter_node(node); end + + # A block's parameters. + # + # source://prism//lib/prism/translation/ruby_parser.rb#184 + def visit_block_parameters_node(node); end + + # break + # ^^^^^ + # + # break foo + # ^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#224 + def visit_break_node(node); end + + # foo.bar &&= baz + # ^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#287 + def visit_call_and_write_node(node); end + + # foo + # ^^^ + # + # foo.bar + # ^^^^^^^ + # + # foo.bar() {} + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#242 + def visit_call_node(node); end + + # foo.bar += baz + # ^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#277 + def visit_call_operator_write_node(node); end + + # foo.bar ||= baz + # ^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#297 + def visit_call_or_write_node(node); end + + # foo.bar, = 1 + # ^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#320 + def visit_call_target_node(node); end + + # foo => bar => baz + # ^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#326 + def visit_capture_pattern_node(node); end + + # case foo; in bar; end + # ^^^^^^^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#338 + def visit_case_match_node(node); end + + # case foo; when bar; end + # ^^^^^^^^^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#332 + def visit_case_node(node); end + + # class Foo; end + # ^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#344 + def visit_class_node(node); end + + # @@foo &&= bar + # ^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#385 + def visit_class_variable_and_write_node(node); end + + # @@foo += bar + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#379 + def visit_class_variable_operator_write_node(node); end + + # @@foo ||= bar + # ^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#391 + def visit_class_variable_or_write_node(node); end + + # @@foo + # ^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#364 + def visit_class_variable_read_node(node); end + + # @@foo, = bar + # ^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#397 + def visit_class_variable_target_node(node); end + + # @@foo = 1 + # ^^^^^^^^^ + # + # @@foo, @@bar = 1 + # ^^^^^ ^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#373 + def visit_class_variable_write_node(node); end + + # Foo &&= bar + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#430 + def visit_constant_and_write_node(node); end + + # Foo += bar + # ^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#424 + def visit_constant_operator_write_node(node); end + + # Foo ||= bar + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#436 + def visit_constant_or_write_node(node); end + + # Foo::Bar &&= baz + # ^^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#473 + def visit_constant_path_and_write_node(node); end + + # Foo::Bar + # ^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#448 + def visit_constant_path_node(node); end + + # Foo::Bar += baz + # ^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#467 + def visit_constant_path_operator_write_node(node); end + + # Foo::Bar ||= baz + # ^^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#479 + def visit_constant_path_or_write_node(node); end + + # Foo::Bar, = baz + # ^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#485 + def visit_constant_path_target_node(node); end + + # Foo::Bar = 1 + # ^^^^^^^^^^^^ + # + # Foo::Foo, Bar::Bar = 1 + # ^^^^^^^^ ^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#461 + def visit_constant_path_write_node(node); end + + # Foo + # ^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#409 + def visit_constant_read_node(node); end + + # Foo, = bar + # ^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#442 + def visit_constant_target_node(node); end + + # Foo = 1 + # ^^^^^^^ + # + # Foo, Bar = 1 + # ^^^ ^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#418 + def visit_constant_write_node(node); end + + # def foo; end + # ^^^^^^^^^^^^ + # + # def self.foo; end + # ^^^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#501 + def visit_def_node(node); end + + # defined? a + # ^^^^^^^^^^ + # + # defined?(a) + # ^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#532 + def visit_defined_node(node); end + + # if foo then bar else baz end + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#538 + def visit_else_node(node); end + + # "foo #{bar}" + # ^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#544 + def visit_embedded_statements_node(node); end + + # "foo #@bar" + # ^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#552 + def visit_embedded_variable_node(node); end + + # begin; foo; ensure; bar; end + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#558 + def visit_ensure_node(node); end + + # false + # ^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#564 + def visit_false_node(node); end + + # foo => [*, bar, *] + # ^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#570 + def visit_find_pattern_node(node); end + + # if foo .. bar; end + # ^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#576 + def visit_flip_flop_node(node); end + + # 1.0 + # ^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#586 + def visit_float_node(node); end + + # for foo in bar do end + # ^^^^^^^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#592 + def visit_for_node(node); end + + # def foo(...); bar(...); end + # ^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#598 + def visit_forwarding_arguments_node(node); end + + # def foo(...); end + # ^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#604 + def visit_forwarding_parameter_node(node); end + + # super + # ^^^^^ + # + # super {} + # ^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#613 + def visit_forwarding_super_node(node); end + + # $foo &&= bar + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#640 + def visit_global_variable_and_write_node(node); end + + # $foo += bar + # ^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#634 + def visit_global_variable_operator_write_node(node); end + + # $foo ||= bar + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#646 + def visit_global_variable_or_write_node(node); end + + # $foo + # ^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#619 + def visit_global_variable_read_node(node); end + + # $foo, = bar + # ^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#652 + def visit_global_variable_target_node(node); end + + # $foo = 1 + # ^^^^^^^^ + # + # $foo, $bar = 1 + # ^^^^ ^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#628 + def visit_global_variable_write_node(node); end + + # {} + # ^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#658 + def visit_hash_node(node); end + + # foo => {} + # ^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#664 + def visit_hash_pattern_node(node); end + + # if foo then bar end + # ^^^^^^^^^^^^^^^^^^^ + # + # bar if foo + # ^^^^^^^^^^ + # + # foo ? bar : baz + # ^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#685 + def visit_if_node(node); end + + # 1i + # + # source://prism//lib/prism/translation/ruby_parser.rb#690 + def visit_imaginary_node(node); end + + # { foo: } + # ^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#696 + def visit_implicit_node(node); end + + # foo { |bar,| } + # ^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#701 + def visit_implicit_rest_node(node); end + + # case foo; in bar; end + # ^^^^^^^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#706 + def visit_in_node(node); end + + # foo[bar] &&= baz + # ^^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#732 + def visit_index_and_write_node(node); end + + # foo[bar] += baz + # ^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#719 + def visit_index_operator_write_node(node); end + + # foo[bar] ||= baz + # ^^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#745 + def visit_index_or_write_node(node); end + + # foo[bar], = 1 + # ^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#758 + def visit_index_target_node(node); end + + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#788 + def visit_instance_variable_and_write_node(node); end + + # ^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#782 + def visit_instance_variable_operator_write_node(node); end + + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#794 + def visit_instance_variable_or_write_node(node); end + + # ^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#767 + def visit_instance_variable_read_node(node); end + + # @foo, = bar + # ^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#800 + def visit_instance_variable_target_node(node); end + + # ^^^^^^^^ + # + # @foo, @bar = 1 + # ^^^^ ^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#776 + def visit_instance_variable_write_node(node); end + + # 1 + # ^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#806 + def visit_integer_node(node); end + + # if /foo #{bar}/ then end + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#812 + def visit_interpolated_match_last_line_node(node); end + + # /foo #{bar}/ + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#829 + def visit_interpolated_regular_expression_node(node); end + + # "foo #{bar}" + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#844 + def visit_interpolated_string_node(node); end + + # :"foo #{bar}" + # ^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#851 + def visit_interpolated_symbol_node(node); end + + # `foo #{bar}` + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#858 + def visit_interpolated_x_string_node(node); end + + # -> { it } + # ^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#923 + def visit_it_local_variable_read_node(node); end + + # foo(bar: baz) + # ^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#929 + def visit_keyword_hash_node(node); end + + # def foo(**bar); end + # ^^^^^ + # + # def foo(**); end + # ^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#938 + def visit_keyword_rest_parameter_node(node); end + + # -> {} + # + # source://prism//lib/prism/translation/ruby_parser.rb#943 + def visit_lambda_node(node); end + + # foo &&= bar + # ^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#986 + def visit_local_variable_and_write_node(node); end + + # foo += bar + # ^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#980 + def visit_local_variable_operator_write_node(node); end + + # foo ||= bar + # ^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#992 + def visit_local_variable_or_write_node(node); end + + # foo + # ^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#961 + def visit_local_variable_read_node(node); end + + # foo, = bar + # ^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#998 + def visit_local_variable_target_node(node); end + + # foo = 1 + # ^^^^^^^ + # + # foo, bar = 1 + # ^^^ ^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#974 + def visit_local_variable_write_node(node); end + + # if /foo/ then end + # ^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1004 + def visit_match_last_line_node(node); end + + # foo in bar + # ^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1010 + def visit_match_predicate_node(node); end + + # foo => bar + # ^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1016 + def visit_match_required_node(node); end + + # /(?foo)/ =~ bar + # ^^^^^^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1022 + 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#1029 + def visit_missing_node(node); end + + # module Foo; end + # ^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1035 + def visit_module_node(node); end + + # foo, bar = baz + # ^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1055 + def visit_multi_target_node(node); end + + # foo, bar = baz + # ^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1065 + def visit_multi_write_node(node); end + + # next + # ^^^^ + # + # next foo + # ^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1089 + def visit_next_node(node); end + + # nil + # ^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1102 + def visit_nil_node(node); end + + # def foo(**nil); end + # ^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1108 + def visit_no_keywords_parameter_node(node); end + + # -> { _1 + _2 } + # ^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1114 + def visit_numbered_parameters_node(node); end + + # $1 + # ^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1120 + def visit_numbered_reference_read_node(node); end + + # def foo(bar: baz); end + # ^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1126 + def visit_optional_keyword_parameter_node(node); end + + # def foo(bar = 1); end + # ^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1132 + def visit_optional_parameter_node(node); end + + # a or b + # ^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1138 + def visit_or_node(node); end + + # def foo(bar, *baz); end + # ^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1144 + def visit_parameters_node(node); end + + # () + # ^^ + # + # (1) + # ^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1182 + def visit_parentheses_node(node); end + + # foo => ^(bar) + # ^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1192 + def visit_pinned_expression_node(node); end + + # foo = 1 and bar => ^foo + # ^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1198 + def visit_pinned_variable_node(node); end + + # END {} + # + # source://prism//lib/prism/translation/ruby_parser.rb#1207 + def visit_post_execution_node(node); end + + # BEGIN {} + # + # source://prism//lib/prism/translation/ruby_parser.rb#1212 + def visit_pre_execution_node(node); end + + # The top-level program node. + # + # source://prism//lib/prism/translation/ruby_parser.rb#1217 + def visit_program_node(node); end + + # 0..5 + # ^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1223 + def visit_range_node(node); end + + # 1r + # ^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1245 + def visit_rational_node(node); end + + # redo + # ^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1251 + def visit_redo_node(node); end + + # /foo/ + # ^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1257 + def visit_regular_expression_node(node); end + + # def foo(bar:); end + # ^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1263 + def visit_required_keyword_parameter_node(node); end + + # def foo(bar); end + # ^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1269 + def visit_required_parameter_node(node); end + + # foo rescue bar + # ^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1275 + def visit_rescue_modifier_node(node); end + + # begin; rescue; end + # ^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1281 + def visit_rescue_node(node); end + + # def foo(*bar); end + # ^^^^ + # + # def foo(*); end + # ^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1301 + def visit_rest_parameter_node(node); end + + # retry + # ^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1307 + def visit_retry_node(node); end + + # return + # ^^^^^^ + # + # return 1 + # ^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1316 + def visit_return_node(node); end + + # self + # ^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1329 + def visit_self_node(node); end + + # A shareable constant. + # + # source://prism//lib/prism/translation/ruby_parser.rb#1334 + def visit_shareable_constant_node(node); end + + # class << self; end + # ^^^^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1340 + def visit_singleton_class_node(node); end + + # __ENCODING__ + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1348 + def visit_source_encoding_node(node); end + + # __FILE__ + # ^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1355 + def visit_source_file_node(node); end + + # __LINE__ + # ^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1361 + def visit_source_line_node(node); end + + # foo(*bar) + # ^^^^ + # + # def foo((bar, *baz)); end + # ^^^^ + # + # def foo(*); bar(*); end + # ^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1373 + def visit_splat_node(node); end + + # A list of statements. + # + # source://prism//lib/prism/translation/ruby_parser.rb#1382 + def visit_statements_node(node); end + + # "foo" + # ^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1394 + def visit_string_node(node); end + + # super(foo) + # ^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1400 + def visit_super_node(node); end + + # :foo + # ^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1414 + def visit_symbol_node(node); end + + # true + # ^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1420 + def visit_true_node(node); end + + # undef foo + # ^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1426 + def visit_undef_node(node); end + + # unless foo; bar end + # ^^^^^^^^^^^^^^^^^^^ + # + # bar unless foo + # ^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1436 + def visit_unless_node(node); end + + # until foo; bar end + # ^^^^^^^^^^^^^^^^^ + # + # bar until foo + # ^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1445 + def visit_until_node(node); end + + # case foo; when bar; end + # ^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1451 + def visit_when_node(node); end + + # while foo; bar end + # ^^^^^^^^^^^^^^^^^^ + # + # bar while foo + # ^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1460 + def visit_while_node(node); end + + # `foo` + # ^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1466 + def visit_x_string_node(node); end + + # yield + # ^^^^^ + # + # yield 1 + # ^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1482 + def visit_yield_node(node); end + + private + + # 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#403 + def class_variable_write_type; end + + # Create a new compiler with the given options. + # + # source://prism//lib/prism/translation/ruby_parser.rb#1489 + 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 + # op_asgn2 nodes. That is determined by their call operator and their + # right-hand side. + # + # @return [Boolean] + # + # source://prism//lib/prism/translation/ruby_parser.rb#308 + 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#314 + 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#1494 + 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#1504 + def visit_block(node, sexp, block); end + + # def foo((bar, baz)); end + # ^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ruby_parser.rb#1159 + def visit_destructured_parameter(node); end + + # Visit the interpolated content of the string-like node. + # + # source://prism//lib/prism/translation/ruby_parser.rb#865 + def visit_interpolated_parts(parts); end + + # Pattern constants get wrapped in another layer of :const. + # + # source://prism//lib/prism/translation/ruby_parser.rb#1525 + 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#1235 + 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#1539 + def visit_write_value(node); end +end + # Represents the use of the literal `true` keyword. # # true # ^^^^ # -# source://prism//lib/prism/node.rb#18099 +# source://prism//lib/prism/node.rb#18041 class Prism::TrueNode < ::Prism::Node # def initialize: (Location location) -> void # # @return [TrueNode] a new instance of TrueNode # - # source://prism//lib/prism/node.rb#18100 + # source://prism//lib/prism/node.rb#18043 sig { params(source: Prism::Source, location: Prism::Location).void } def initialize(source, location); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#18174 + # source://prism//lib/prism/node.rb#18116 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#18107 + # source://prism//lib/prism/node.rb#18049 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#18112 + # source://prism//lib/prism/node.rb#18054 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#18122 + # source://prism//lib/prism/node.rb#18064 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#18117 + # source://prism//lib/prism/node.rb#18059 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?location: Location) -> TrueNode # - # source://prism//lib/prism/node.rb#18127 + # source://prism//lib/prism/node.rb#18069 sig { params(location: Prism::Location).returns(Prism::TrueNode) } def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18112 + # source://prism//lib/prism/node.rb#18054 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#18135 + # source://prism//lib/prism/node.rb#18077 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -35790,7 +37007,7 @@ class Prism::TrueNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#18140 + # source://prism//lib/prism/node.rb#18082 sig { override.returns(String) } def inspect; end @@ -35809,7 +37026,7 @@ class Prism::TrueNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#18158 + # source://prism//lib/prism/node.rb#18100 sig { override.returns(Symbol) } def type; end @@ -35821,7 +37038,7 @@ class Prism::TrueNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#18168 + # source://prism//lib/prism/node.rb#18110 def type; end end end @@ -35831,13 +37048,13 @@ end # undef :foo, :bar, :baz # ^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#18184 +# source://prism//lib/prism/node.rb#18125 class Prism::UndefNode < ::Prism::Node # def initialize: (Array[SymbolNode | InterpolatedSymbolNode] names, Location keyword_loc, Location location) -> void # # @return [UndefNode] a new instance of UndefNode # - # source://prism//lib/prism/node.rb#18185 + # source://prism//lib/prism/node.rb#18127 sig do params( source: Prism::Source, @@ -35851,36 +37068,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#18276 + # source://prism//lib/prism/node.rb#18217 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#18194 + # source://prism//lib/prism/node.rb#18135 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#18199 + # source://prism//lib/prism/node.rb#18140 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#18209 + # source://prism//lib/prism/node.rb#18150 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#18204 + # source://prism//lib/prism/node.rb#18145 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?names: Array[SymbolNode | InterpolatedSymbolNode], ?keyword_loc: Location, ?location: Location) -> UndefNode # - # source://prism//lib/prism/node.rb#18214 + # source://prism//lib/prism/node.rb#18155 sig do params( names: T::Array[T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode)], @@ -35893,13 +37110,13 @@ class Prism::UndefNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18199 + # source://prism//lib/prism/node.rb#18140 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { names: Array[SymbolNode | InterpolatedSymbolNode], keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#18222 + # source://prism//lib/prism/node.rb#18163 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -35908,25 +37125,25 @@ class Prism::UndefNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#18242 + # source://prism//lib/prism/node.rb#18183 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#18237 + # source://prism//lib/prism/node.rb#18178 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#18230 + # source://prism//lib/prism/node.rb#18171 sig { returns(Prism::Location) } def keyword_loc; end # attr_reader names: Array[SymbolNode | InterpolatedSymbolNode] # - # source://prism//lib/prism/node.rb#18227 + # source://prism//lib/prism/node.rb#18168 sig { returns(T::Array[T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode)]) } def names; end @@ -35945,7 +37162,7 @@ class Prism::UndefNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#18260 + # source://prism//lib/prism/node.rb#18201 sig { override.returns(Symbol) } def type; end @@ -35957,7 +37174,7 @@ class Prism::UndefNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#18270 + # source://prism//lib/prism/node.rb#18211 def type; end end end @@ -35970,13 +37187,13 @@ end # unless foo then bar end # ^^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#18292 +# source://prism//lib/prism/node.rb#18232 class Prism::UnlessNode < ::Prism::Node # def initialize: (Location keyword_loc, Prism::node predicate, Location? then_keyword_loc, StatementsNode? statements, ElseNode? consequent, Location? end_keyword_loc, Location location) -> void # # @return [UnlessNode] a new instance of UnlessNode # - # source://prism//lib/prism/node.rb#18293 + # source://prism//lib/prism/node.rb#18234 sig do params( source: Prism::Source, @@ -35994,30 +37211,30 @@ 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#18461 + # source://prism//lib/prism/node.rb#18399 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#18306 + # source://prism//lib/prism/node.rb#18246 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#18315 + # source://prism//lib/prism/node.rb#18251 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#18329 + # source://prism//lib/prism/node.rb#18265 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#18320 + # source://prism//lib/prism/node.rb#18256 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end @@ -36026,13 +37243,13 @@ class Prism::UnlessNode < ::Prism::Node # unless cond then bar else baz end # ^^^^^^^^ # - # source://prism//lib/prism/node.rb#18393 + # source://prism//lib/prism/node.rb#18331 sig { returns(T.nilable(Prism::ElseNode)) } def consequent; end # def copy: (?keyword_loc: Location, ?predicate: Prism::node, ?then_keyword_loc: Location?, ?statements: StatementsNode?, ?consequent: ElseNode?, ?end_keyword_loc: Location?, ?location: Location) -> UnlessNode # - # source://prism//lib/prism/node.rb#18334 + # source://prism//lib/prism/node.rb#18270 sig do params( keyword_loc: Prism::Location, @@ -36049,19 +37266,19 @@ class Prism::UnlessNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18315 + # source://prism//lib/prism/node.rb#18251 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, predicate: Prism::node, then_keyword_loc: Location?, statements: StatementsNode?, consequent: ElseNode?, end_keyword_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#18342 + # source://prism//lib/prism/node.rb#18278 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#18422 + # source://prism//lib/prism/node.rb#18360 sig { returns(T.nilable(String)) } def end_keyword; end @@ -36070,7 +37287,7 @@ class Prism::UnlessNode < ::Prism::Node # unless cond then bar end # ^^^ # - # source://prism//lib/prism/node.rb#18399 + # source://prism//lib/prism/node.rb#18337 sig { returns(T.nilable(Prism::Location)) } def end_keyword_loc; end @@ -36079,13 +37296,13 @@ class Prism::UnlessNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#18427 + # source://prism//lib/prism/node.rb#18365 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#18412 + # source://prism//lib/prism/node.rb#18350 sig { returns(String) } def keyword; end @@ -36097,10 +37314,13 @@ class Prism::UnlessNode < ::Prism::Node # bar unless cond # ^^^^^^ # - # source://prism//lib/prism/node.rb#18353 + # source://prism//lib/prism/node.rb#18289 sig { returns(Prism::Location) } def keyword_loc; end + # source://prism//lib/prism/parse_result/newlines.rb#97 + def newline!(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). # # unless cond then bar end @@ -36109,33 +37329,32 @@ class Prism::UnlessNode < ::Prism::Node # bar unless cond # ^^^^ # - # source://prism//lib/prism/node.rb#18366 + # source://prism//lib/prism/node.rb#18302 sig { returns(Prism::Node) } def predicate; end - # source://prism//lib/prism/node.rb#18310 - def set_newline_flag(newline_marked); end - # The body of statements that will executed if the unless condition is # falsey. Will be `nil` if no body is provided. # # unless cond then bar end # ^^^ # - # source://prism//lib/prism/node.rb#18387 + # source://prism//lib/prism/node.rb#18325 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # def then_keyword: () -> String? # - # source://prism//lib/prism/node.rb#18417 + # source://prism//lib/prism/node.rb#18355 sig { returns(T.nilable(String)) } def then_keyword; end # The location of the `then` keyword, if present. - # unless cond then bar end ^^^^ # - # source://prism//lib/prism/node.rb#18370 + # unless cond then bar end + # ^^^^ + # + # source://prism//lib/prism/node.rb#18308 sig { returns(T.nilable(Prism::Location)) } def then_keyword_loc; end @@ -36154,7 +37373,7 @@ class Prism::UnlessNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#18445 + # source://prism//lib/prism/node.rb#18383 sig { override.returns(Symbol) } def type; end @@ -36166,7 +37385,7 @@ class Prism::UnlessNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#18455 + # source://prism//lib/prism/node.rb#18393 def type; end end end @@ -36179,13 +37398,13 @@ end # until foo do bar end # ^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#18480 +# source://prism//lib/prism/node.rb#18417 class Prism::UntilNode < ::Prism::Node # def initialize: (Integer flags, Location keyword_loc, Location? closing_loc, Prism::node predicate, StatementsNode? statements, Location location) -> void # # @return [UntilNode] a new instance of UntilNode # - # source://prism//lib/prism/node.rb#18481 + # source://prism//lib/prism/node.rb#18419 sig do params( source: Prism::Source, @@ -36202,12 +37421,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#18612 + # source://prism//lib/prism/node.rb#18545 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#18493 + # source://prism//lib/prism/node.rb#18430 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -36215,43 +37434,43 @@ class Prism::UntilNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#18563 + # source://prism//lib/prism/node.rb#18496 sig { returns(T::Boolean) } def begin_modifier?; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18502 + # source://prism//lib/prism/node.rb#18435 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#18573 + # source://prism//lib/prism/node.rb#18506 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#18544 + # source://prism//lib/prism/node.rb#18477 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#18515 + # source://prism//lib/prism/node.rb#18448 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#18507 + # source://prism//lib/prism/node.rb#18440 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?keyword_loc: Location, ?closing_loc: Location?, ?predicate: Prism::node, ?statements: StatementsNode?, ?location: Location) -> UntilNode # - # source://prism//lib/prism/node.rb#18520 + # source://prism//lib/prism/node.rb#18453 sig do params( flags: Integer, @@ -36267,13 +37486,13 @@ class Prism::UntilNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18502 + # source://prism//lib/prism/node.rb#18435 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, keyword_loc: Location, closing_loc: Location?, predicate: Prism::node, statements: StatementsNode?, location: Location } # - # source://prism//lib/prism/node.rb#18528 + # source://prism//lib/prism/node.rb#18461 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -36282,34 +37501,34 @@ class Prism::UntilNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#18578 + # source://prism//lib/prism/node.rb#18511 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#18568 + # source://prism//lib/prism/node.rb#18501 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#18537 + # source://prism//lib/prism/node.rb#18470 sig { returns(Prism::Location) } def keyword_loc; end + # source://prism//lib/prism/parse_result/newlines.rb#103 + def newline!(lines); end + # attr_reader predicate: Prism::node # - # source://prism//lib/prism/node.rb#18557 + # source://prism//lib/prism/node.rb#18490 sig { returns(Prism::Node) } def predicate; end - # source://prism//lib/prism/node.rb#18497 - def set_newline_flag(newline_marked); end - # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#18560 + # source://prism//lib/prism/node.rb#18493 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end @@ -36328,7 +37547,7 @@ class Prism::UntilNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#18596 + # source://prism//lib/prism/node.rb#18529 sig { override.returns(Symbol) } def type; end @@ -36336,7 +37555,7 @@ class Prism::UntilNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#18533 + # source://prism//lib/prism/node.rb#18466 sig { returns(Integer) } def flags; end @@ -36348,7 +37567,7 @@ class Prism::UntilNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#18606 + # source://prism//lib/prism/node.rb#18539 def type; end end end @@ -36375,7 +37594,7 @@ Prism::VERSION = T.let(T.unsafe(nil), String) # end # end # -# source://prism//lib/prism/visitor.rb#55 +# source://prism//lib/prism/visitor.rb#54 class Prism::Visitor < ::Prism::BasicVisitor # Visit a AliasGlobalVariableNode node # @@ -36899,6 +38118,12 @@ class Prism::Visitor < ::Prism::BasicVisitor 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 + 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 @@ -37285,13 +38510,13 @@ end # ^^^^^^^^^ # end # -# source://prism//lib/prism/node.rb#18629 +# source://prism//lib/prism/node.rb#18561 class Prism::WhenNode < ::Prism::Node # def initialize: (Location keyword_loc, Array[Prism::node] conditions, Location? then_keyword_loc, StatementsNode? statements, Location location) -> void # # @return [WhenNode] a new instance of WhenNode # - # source://prism//lib/prism/node.rb#18630 + # source://prism//lib/prism/node.rb#18563 sig do params( source: Prism::Source, @@ -37307,42 +38532,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#18747 + # source://prism//lib/prism/node.rb#18679 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#18641 + # source://prism//lib/prism/node.rb#18573 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#18646 + # source://prism//lib/prism/node.rb#18578 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#18659 + # source://prism//lib/prism/node.rb#18591 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#18651 + # source://prism//lib/prism/node.rb#18583 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # attr_reader conditions: Array[Prism::node] # - # source://prism//lib/prism/node.rb#18684 + # source://prism//lib/prism/node.rb#18616 sig { returns(T::Array[Prism::Node]) } def conditions; end # def copy: (?keyword_loc: Location, ?conditions: Array[Prism::node], ?then_keyword_loc: Location?, ?statements: StatementsNode?, ?location: Location) -> WhenNode # - # source://prism//lib/prism/node.rb#18664 + # source://prism//lib/prism/node.rb#18596 sig do params( keyword_loc: Prism::Location, @@ -37357,13 +38582,13 @@ class Prism::WhenNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18646 + # source://prism//lib/prism/node.rb#18578 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, conditions: Array[Prism::node], then_keyword_loc: Location?, statements: StatementsNode?, location: Location } # - # source://prism//lib/prism/node.rb#18672 + # source://prism//lib/prism/node.rb#18604 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -37372,37 +38597,37 @@ class Prism::WhenNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#18713 + # source://prism//lib/prism/node.rb#18645 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#18703 + # source://prism//lib/prism/node.rb#18635 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#18677 + # source://prism//lib/prism/node.rb#18609 sig { returns(Prism::Location) } def keyword_loc; end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#18700 + # source://prism//lib/prism/node.rb#18632 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # def then_keyword: () -> String? # - # source://prism//lib/prism/node.rb#18708 + # source://prism//lib/prism/node.rb#18640 sig { returns(T.nilable(String)) } def then_keyword; end # attr_reader then_keyword_loc: Location? # - # source://prism//lib/prism/node.rb#18687 + # source://prism//lib/prism/node.rb#18619 sig { returns(T.nilable(Prism::Location)) } def then_keyword_loc; end @@ -37421,7 +38646,7 @@ class Prism::WhenNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#18731 + # source://prism//lib/prism/node.rb#18663 sig { override.returns(Symbol) } def type; end @@ -37433,7 +38658,7 @@ class Prism::WhenNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#18741 + # source://prism//lib/prism/node.rb#18673 def type; end end end @@ -37446,13 +38671,13 @@ end # while foo do bar end # ^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#18765 +# source://prism//lib/prism/node.rb#18696 class Prism::WhileNode < ::Prism::Node # def initialize: (Integer flags, Location keyword_loc, Location? closing_loc, Prism::node predicate, StatementsNode? statements, Location location) -> void # # @return [WhileNode] a new instance of WhileNode # - # source://prism//lib/prism/node.rb#18766 + # source://prism//lib/prism/node.rb#18698 sig do params( source: Prism::Source, @@ -37469,12 +38694,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#18897 + # source://prism//lib/prism/node.rb#18824 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#18778 + # source://prism//lib/prism/node.rb#18709 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -37482,43 +38707,43 @@ class Prism::WhileNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#18848 + # source://prism//lib/prism/node.rb#18775 sig { returns(T::Boolean) } def begin_modifier?; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18787 + # source://prism//lib/prism/node.rb#18714 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#18858 + # source://prism//lib/prism/node.rb#18785 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#18829 + # source://prism//lib/prism/node.rb#18756 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#18800 + # source://prism//lib/prism/node.rb#18727 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#18792 + # source://prism//lib/prism/node.rb#18719 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?flags: Integer, ?keyword_loc: Location, ?closing_loc: Location?, ?predicate: Prism::node, ?statements: StatementsNode?, ?location: Location) -> WhileNode # - # source://prism//lib/prism/node.rb#18805 + # source://prism//lib/prism/node.rb#18732 sig do params( flags: Integer, @@ -37534,13 +38759,13 @@ class Prism::WhileNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18787 + # source://prism//lib/prism/node.rb#18714 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, keyword_loc: Location, closing_loc: Location?, predicate: Prism::node, statements: StatementsNode?, location: Location } # - # source://prism//lib/prism/node.rb#18813 + # source://prism//lib/prism/node.rb#18740 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -37549,34 +38774,34 @@ class Prism::WhileNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#18863 + # source://prism//lib/prism/node.rb#18790 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#18853 + # source://prism//lib/prism/node.rb#18780 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#18822 + # source://prism//lib/prism/node.rb#18749 sig { returns(Prism::Location) } def keyword_loc; end + # source://prism//lib/prism/parse_result/newlines.rb#109 + def newline!(lines); end + # attr_reader predicate: Prism::node # - # source://prism//lib/prism/node.rb#18842 + # source://prism//lib/prism/node.rb#18769 sig { returns(Prism::Node) } def predicate; end - # source://prism//lib/prism/node.rb#18782 - def set_newline_flag(newline_marked); end - # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#18845 + # source://prism//lib/prism/node.rb#18772 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end @@ -37595,7 +38820,7 @@ class Prism::WhileNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#18881 + # source://prism//lib/prism/node.rb#18808 sig { override.returns(Symbol) } def type; end @@ -37603,7 +38828,7 @@ class Prism::WhileNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#18818 + # source://prism//lib/prism/node.rb#18745 sig { returns(Integer) } def flags; end @@ -37615,7 +38840,7 @@ class Prism::WhileNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#18891 + # source://prism//lib/prism/node.rb#18818 def type; end end end @@ -37625,7 +38850,7 @@ end # `foo` # ^^^^^ # -# source://prism//lib/prism/node.rb#18912 +# source://prism//lib/prism/node.rb#18838 class Prism::XStringNode < ::Prism::Node include ::Prism::HeredocQuery @@ -37633,7 +38858,7 @@ class Prism::XStringNode < ::Prism::Node # # @return [XStringNode] a new instance of XStringNode # - # source://prism//lib/prism/node.rb#18913 + # source://prism//lib/prism/node.rb#18840 sig do params( source: Prism::Source, @@ -37650,60 +38875,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#19045 + # source://prism//lib/prism/node.rb#18971 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#18925 + # source://prism//lib/prism/node.rb#18851 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#18930 + # source://prism//lib/prism/node.rb#18856 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#19006 + # source://prism//lib/prism/node.rb#18932 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#18976 + # source://prism//lib/prism/node.rb#18902 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#18940 + # source://prism//lib/prism/node.rb#18866 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#18935 + # source://prism//lib/prism/node.rb#18861 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def content: () -> String # - # source://prism//lib/prism/node.rb#19001 + # source://prism//lib/prism/node.rb#18927 sig { returns(String) } def content; end # attr_reader content_loc: Location # - # source://prism//lib/prism/node.rb#18969 + # source://prism//lib/prism/node.rb#18895 sig { returns(Prism::Location) } def content_loc; end # def copy: (?flags: Integer, ?opening_loc: Location, ?content_loc: Location, ?closing_loc: Location, ?unescaped: String, ?location: Location) -> XStringNode # - # source://prism//lib/prism/node.rb#18945 + # source://prism//lib/prism/node.rb#18871 sig do params( flags: Integer, @@ -37719,13 +38944,13 @@ class Prism::XStringNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18930 + # source://prism//lib/prism/node.rb#18856 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String, location: Location } # - # source://prism//lib/prism/node.rb#18953 + # source://prism//lib/prism/node.rb#18879 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -37736,7 +38961,7 @@ class Prism::XStringNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#18991 + # source://prism//lib/prism/node.rb#18917 sig { returns(T::Boolean) } def forced_binary_encoding?; end @@ -37744,7 +38969,7 @@ class Prism::XStringNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#18986 + # source://prism//lib/prism/node.rb#18912 sig { returns(T::Boolean) } def forced_utf8_encoding?; end @@ -37753,26 +38978,26 @@ class Prism::XStringNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#19011 + # source://prism//lib/prism/node.rb#18937 sig { override.returns(String) } def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#18996 + # source://prism//lib/prism/node.rb#18922 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#18962 + # source://prism//lib/prism/node.rb#18888 sig { returns(Prism::Location) } def opening_loc; end # Occasionally it's helpful to treat a string as if it were interpolated so # that there's a consistent interface for working with strings. # - # source://prism//lib/prism/node_ext.rb#83 + # source://prism//lib/prism/node_ext.rb#86 sig { returns(Prism::InterpolatedXStringNode) } def to_interpolated; end @@ -37791,13 +39016,13 @@ class Prism::XStringNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#19029 + # source://prism//lib/prism/node.rb#18955 sig { override.returns(Symbol) } def type; end # attr_reader unescaped: String # - # source://prism//lib/prism/node.rb#18983 + # source://prism//lib/prism/node.rb#18909 sig { returns(String) } def unescaped; end @@ -37805,7 +39030,7 @@ class Prism::XStringNode < ::Prism::Node # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#18958 + # source://prism//lib/prism/node.rb#18884 sig { returns(Integer) } def flags; end @@ -37817,7 +39042,7 @@ class Prism::XStringNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#19039 + # source://prism//lib/prism/node.rb#18965 def type; end end end @@ -37827,13 +39052,13 @@ end # yield 1 # ^^^^^^^ # -# source://prism//lib/prism/node.rb#19060 +# source://prism//lib/prism/node.rb#18985 class Prism::YieldNode < ::Prism::Node # def initialize: (Location keyword_loc, Location? lparen_loc, ArgumentsNode? arguments, Location? rparen_loc, Location location) -> void # # @return [YieldNode] a new instance of YieldNode # - # source://prism//lib/prism/node.rb#19061 + # source://prism//lib/prism/node.rb#18987 sig do params( source: Prism::Source, @@ -37849,42 +39074,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#19192 + # source://prism//lib/prism/node.rb#19117 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#19072 + # source://prism//lib/prism/node.rb#18997 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#19127 + # source://prism//lib/prism/node.rb#19052 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#19077 + # source://prism//lib/prism/node.rb#19002 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#19089 + # source://prism//lib/prism/node.rb#19014 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#19082 + # source://prism//lib/prism/node.rb#19007 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?keyword_loc: Location, ?lparen_loc: Location?, ?arguments: ArgumentsNode?, ?rparen_loc: Location?, ?location: Location) -> YieldNode # - # source://prism//lib/prism/node.rb#19094 + # source://prism//lib/prism/node.rb#19019 sig do params( keyword_loc: Prism::Location, @@ -37899,13 +39124,13 @@ class Prism::YieldNode < ::Prism::Node # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#19077 + # source://prism//lib/prism/node.rb#19002 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, lparen_loc: Location?, arguments: ArgumentsNode?, rparen_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#19102 + # source://prism//lib/prism/node.rb#19027 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -37914,43 +39139,43 @@ class Prism::YieldNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#19158 + # source://prism//lib/prism/node.rb#19083 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#19143 + # source://prism//lib/prism/node.rb#19068 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#19107 + # source://prism//lib/prism/node.rb#19032 sig { returns(Prism::Location) } def keyword_loc; end # def lparen: () -> String? # - # source://prism//lib/prism/node.rb#19148 + # source://prism//lib/prism/node.rb#19073 sig { returns(T.nilable(String)) } def lparen; end # attr_reader lparen_loc: Location? # - # source://prism//lib/prism/node.rb#19114 + # source://prism//lib/prism/node.rb#19039 sig { returns(T.nilable(Prism::Location)) } def lparen_loc; end # def rparen: () -> String? # - # source://prism//lib/prism/node.rb#19153 + # source://prism//lib/prism/node.rb#19078 sig { returns(T.nilable(String)) } def rparen; end # attr_reader rparen_loc: Location? # - # source://prism//lib/prism/node.rb#19130 + # source://prism//lib/prism/node.rb#19055 sig { returns(T.nilable(Prism::Location)) } def rparen_loc; end @@ -37969,7 +39194,7 @@ class Prism::YieldNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#19176 + # source://prism//lib/prism/node.rb#19101 sig { override.returns(Symbol) } def type; end @@ -37981,7 +39206,7 @@ class Prism::YieldNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#19186 + # source://prism//lib/prism/node.rb#19111 def type; end end end diff --git a/Library/Homebrew/sorbet/rbi/gems/rspec-expectations@3.13.0.rbi b/Library/Homebrew/sorbet/rbi/gems/rspec-expectations@3.13.1.rbi similarity index 99% rename from Library/Homebrew/sorbet/rbi/gems/rspec-expectations@3.13.0.rbi rename to Library/Homebrew/sorbet/rbi/gems/rspec-expectations@3.13.1.rbi index 8d33d8e46f0aa6..c8a25cf29fc091 100644 --- a/Library/Homebrew/sorbet/rbi/gems/rspec-expectations@3.13.0.rbi +++ b/Library/Homebrew/sorbet/rbi/gems/rspec-expectations@3.13.1.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `rspec-expectations` gem. # Please instead update this file by running `bin/tapioca gem rspec-expectations`. + # RSpec's top level namespace. All of rspec-expectations is contained # in the `RSpec::Expectations` and `RSpec::Matchers` namespaces. # @@ -3317,7 +3318,7 @@ end # # @private # -# source://rspec-expectations//lib/rspec/matchers/aliased_matcher.rb#65 +# source://rspec-expectations//lib/rspec/matchers/aliased_matcher.rb#64 class RSpec::Matchers::AliasedMatcherWithOperatorSupport < ::RSpec::Matchers::AliasedMatcher; end # @private @@ -3390,7 +3391,7 @@ module RSpec::Matchers::BuiltIn; end # # @api private # -# source://rspec-expectations//lib/rspec/matchers/built_in/all.rb#8 +# source://rspec-expectations//lib/rspec/matchers/built_in/all.rb#7 class RSpec::Matchers::BuiltIn::All < ::RSpec::Matchers::BuiltIn::BaseMatcher # @api private # @return [All] a new instance of All @@ -3827,7 +3828,7 @@ end # # @api private # -# source://rspec-expectations//lib/rspec/matchers/built_in/be_instance_of.rb#9 +# source://rspec-expectations//lib/rspec/matchers/built_in/be_instance_of.rb#7 class RSpec::Matchers::BuiltIn::BeAnInstanceOf < ::RSpec::Matchers::BuiltIn::BaseMatcher # @api private # @return [String] @@ -3971,7 +3972,7 @@ end # # @api private # -# source://rspec-expectations//lib/rspec/matchers/built_in/be.rb#32 +# source://rspec-expectations//lib/rspec/matchers/built_in/be.rb#30 class RSpec::Matchers::BuiltIn::BeFalsey < ::RSpec::Matchers::BuiltIn::BaseMatcher # @api private # @return [String] @@ -4020,7 +4021,7 @@ end # # @api private # -# source://rspec-expectations//lib/rspec/matchers/built_in/be.rb#55 +# source://rspec-expectations//lib/rspec/matchers/built_in/be.rb#53 class RSpec::Matchers::BuiltIn::BeNil < ::RSpec::Matchers::BuiltIn::BaseMatcher # @api private # @return [String] @@ -4047,7 +4048,7 @@ end # # @api private # -# source://rspec-expectations//lib/rspec/matchers/built_in/has.rb#138 +# source://rspec-expectations//lib/rspec/matchers/built_in/has.rb#137 class RSpec::Matchers::BuiltIn::BePredicate < ::RSpec::Matchers::BuiltIn::DynamicPredicate private @@ -4088,7 +4089,7 @@ RSpec::Matchers::BuiltIn::BePredicate::REGEX = T.let(T.unsafe(nil), Regexp) # # @api private # -# source://rspec-expectations//lib/rspec/matchers/built_in/be.rb#9 +# source://rspec-expectations//lib/rspec/matchers/built_in/be.rb#7 class RSpec::Matchers::BuiltIn::BeTruthy < ::RSpec::Matchers::BuiltIn::BaseMatcher # @api private # @return [String] @@ -4221,7 +4222,7 @@ end # # @api private # -# source://rspec-expectations//lib/rspec/matchers/built_in/change.rb#9 +# source://rspec-expectations//lib/rspec/matchers/built_in/change.rb#7 class RSpec::Matchers::BuiltIn::Change < ::RSpec::Matchers::BuiltIn::BaseMatcher # @api private # @return [Change] a new instance of Change @@ -4539,7 +4540,7 @@ end # # @api private # -# source://rspec-expectations//lib/rspec/matchers/built_in/compound.rb#7 +# source://rspec-expectations//lib/rspec/matchers/built_in/compound.rb#6 class RSpec::Matchers::BuiltIn::Compound < ::RSpec::Matchers::BuiltIn::BaseMatcher # @api private # @return [Compound] a new instance of Compound @@ -4678,7 +4679,7 @@ end # # @api public # -# source://rspec-expectations//lib/rspec/matchers/built_in/compound.rb#244 +# source://rspec-expectations//lib/rspec/matchers/built_in/compound.rb#242 class RSpec::Matchers::BuiltIn::Compound::And < ::RSpec::Matchers::BuiltIn::Compound # @api private # @return [String] @@ -4787,7 +4788,7 @@ end # # @api public # -# source://rspec-expectations//lib/rspec/matchers/built_in/compound.rb#271 +# source://rspec-expectations//lib/rspec/matchers/built_in/compound.rb#269 class RSpec::Matchers::BuiltIn::Compound::Or < ::RSpec::Matchers::BuiltIn::Compound # @api private # @return [String] @@ -4832,7 +4833,7 @@ end # # @api private # -# source://rspec-expectations//lib/rspec/matchers/built_in/contain_exactly.rb#10 +# source://rspec-expectations//lib/rspec/matchers/built_in/contain_exactly.rb#8 class RSpec::Matchers::BuiltIn::ContainExactly < ::RSpec::Matchers::BuiltIn::BaseMatcher # @api private # @return [String] @@ -5430,7 +5431,7 @@ end # # @api private # -# source://rspec-expectations//lib/rspec/matchers/built_in/eq.rb#9 +# source://rspec-expectations//lib/rspec/matchers/built_in/eq.rb#7 class RSpec::Matchers::BuiltIn::Eq < ::RSpec::Matchers::BuiltIn::BaseMatcher # @api private # @return [String] @@ -5469,7 +5470,7 @@ end # # @api private # -# source://rspec-expectations//lib/rspec/matchers/built_in/eql.rb#9 +# source://rspec-expectations//lib/rspec/matchers/built_in/eql.rb#7 class RSpec::Matchers::BuiltIn::Eql < ::RSpec::Matchers::BuiltIn::BaseMatcher # @api private # @return [Boolean] @@ -5502,7 +5503,7 @@ end # # @api private # -# source://rspec-expectations//lib/rspec/matchers/built_in/equal.rb#9 +# source://rspec-expectations//lib/rspec/matchers/built_in/equal.rb#7 class RSpec::Matchers::BuiltIn::Equal < ::RSpec::Matchers::BuiltIn::BaseMatcher # @api private # @return [Boolean] @@ -5604,7 +5605,7 @@ end # # @api private # -# source://rspec-expectations//lib/rspec/matchers/built_in/exist.rb#45 +# source://rspec-expectations//lib/rspec/matchers/built_in/exist.rb#43 class RSpec::Matchers::BuiltIn::Exist::ExistenceTest < ::Struct # @api private # @return [Boolean] @@ -5652,7 +5653,7 @@ end # # @api private # -# source://rspec-expectations//lib/rspec/matchers/built_in/has.rb#126 +# source://rspec-expectations//lib/rspec/matchers/built_in/has.rb#125 class RSpec::Matchers::BuiltIn::Has < ::RSpec::Matchers::BuiltIn::DynamicPredicate private @@ -5672,7 +5673,7 @@ RSpec::Matchers::BuiltIn::Has::REGEX = T.let(T.unsafe(nil), Regexp) # # @api private # -# source://rspec-expectations//lib/rspec/matchers/built_in/have_attributes.rb#8 +# source://rspec-expectations//lib/rspec/matchers/built_in/have_attributes.rb#7 class RSpec::Matchers::BuiltIn::HaveAttributes < ::RSpec::Matchers::BuiltIn::BaseMatcher # @api private # @return [HaveAttributes] a new instance of HaveAttributes @@ -6237,176 +6238,176 @@ class RSpec::Matchers::BuiltIn::RaiseError # @api private # @return [RaiseError] a new instance of RaiseError # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#18 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#22 def initialize(expected_error_or_message, expected_message, &block); end # @api private # @return [String] # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#113 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#117 def description; end # @api private # @private # @return [Boolean] # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#79 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#83 def does_not_match?(given_proc); end # @api private # @private # @return [Boolean] # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#95 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#99 def expects_call_stack_jump?; end # @api private # @return [String] # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#101 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#105 def failure_message; end # @api private # @return [String] # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#107 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#111 def failure_message_when_negated; end # @api private # @private # @return [Boolean] # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#48 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#52 def matches?(given_proc, negative_expectation = T.unsafe(nil), &block); end # @api private # @private # @return [Boolean] # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#85 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#89 def supports_block_expectations?; end # @api private # @private # @return [Boolean] # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#90 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#94 def supports_value_expectations?; end # Specifies the expected error message. # # @api public # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#39 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#43 def with_message(expected_message); end private # @api private # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#119 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#123 def actual_error_message; end # @api private # @return [Boolean] # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#133 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#137 def block_matches?; end # @api private # @return [Boolean] # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#129 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#133 def error_and_message_match?; end # @api private # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#141 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#145 def eval_block; end # @api private # @return [Boolean] # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#125 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#129 def expectation_matched?; end # @api private # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#222 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#226 def expected_error; end # @api private # @return [Boolean] # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#253 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#257 def expecting_specific_exception?; end # @api private # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#237 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#241 def format_backtrace(backtrace); end # @api private # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#242 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#246 def given_error; end # @api private # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#172 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#176 def handle_warning(message); end # @api private # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#257 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#261 def raise_message_already_set; end # @api private # @return [Boolean] # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#137 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#141 def ready_to_eval_block?; end # @api private # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#151 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#155 def verify_message; end # @api private # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#184 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#188 def warn_about_bare_error!; end # @api private # @return [Boolean] # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#176 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#180 def warn_about_bare_error?; end # @api private # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#210 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#214 def warn_about_negative_false_positive!(expression); end # @api private # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#197 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#201 def warn_about_nil_error!; end # @api private # @return [Boolean] # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#180 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#184 def warn_about_nil_error?; end # @api private # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#156 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#160 def warn_for_negative_false_positives!; end # @api private # - # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#262 + # source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#266 def warning; end end @@ -6415,9 +6416,13 @@ end # passed in a different way. It's an Object, not a Module, since Module's `===` # does not evaluate to true when compared to itself. # +# Note; this _is_ the default value supplied for expected_error_or_message, but +# because there are two method-calls involved, that default is actually supplied +# in the definition of the _matcher_ method, `RSpec::Matchers#raise_error` +# # @api private # -# source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#16 +# source://rspec-expectations//lib/rspec/matchers/built_in/raise_error.rb#20 RSpec::Matchers::BuiltIn::RaiseError::UndefinedValue = T.let(T.unsafe(nil), Object) # Used to wrap match data and make it reliable for 1.8.7 @@ -6714,7 +6719,7 @@ end # # @api private # -# source://rspec-expectations//lib/rspec/matchers/built_in/change.rb#182 +# source://rspec-expectations//lib/rspec/matchers/built_in/change.rb#181 class RSpec::Matchers::BuiltIn::SpecificValuesChange < ::RSpec::Matchers::BuiltIn::BaseMatcher # @api private # @return [SpecificValuesChange] a new instance of SpecificValuesChange @@ -7261,7 +7266,7 @@ end # # @api private # -# source://rspec-expectations//lib/rspec/matchers/built_in/yield.rb#150 +# source://rspec-expectations//lib/rspec/matchers/built_in/yield.rb#149 class RSpec::Matchers::BuiltIn::YieldWithNoArgs < ::RSpec::Matchers::BuiltIn::BaseMatcher # @api private # @private diff --git a/Library/Homebrew/sorbet/rbi/gems/rubocop@1.64.0.rbi b/Library/Homebrew/sorbet/rbi/gems/rubocop@1.64.1.rbi similarity index 99% rename from Library/Homebrew/sorbet/rbi/gems/rubocop@1.64.0.rbi rename to Library/Homebrew/sorbet/rbi/gems/rubocop@1.64.1.rbi index 996d8598097c95..bf26afceb129ad 100644 --- a/Library/Homebrew/sorbet/rbi/gems/rubocop@1.64.0.rbi +++ b/Library/Homebrew/sorbet/rbi/gems/rubocop@1.64.1.rbi @@ -5093,7 +5093,7 @@ class RuboCop::Cop::Corrector < ::Parser::Source::TreeRewriter # Legacy # - # source://parser/3.3.1.0/lib/parser/source/tree_rewriter.rb#252 + # source://parser/3.3.2.0/lib/parser/source/tree_rewriter.rb#252 def rewrite; end # Swaps sources at the given ranges. @@ -5536,37 +5536,53 @@ RuboCop::Cop::ForToEachCorrector::CORRECTION = T.let(T.unsafe(nil), String) class RuboCop::Cop::Force # @return [Force] a new instance of Force # - # source://rubocop//lib/rubocop/cop/force.rb#22 + # source://rubocop//lib/rubocop/cop/force.rb#32 def initialize(cops); end # Returns the value of attribute cops. # - # source://rubocop//lib/rubocop/cop/force.rb#7 + # source://rubocop//lib/rubocop/cop/force.rb#17 def cops; end - # source://rubocop//lib/rubocop/cop/force.rb#38 + # source://rubocop//lib/rubocop/cop/force.rb#50 def investigate(_processed_source); end - # source://rubocop//lib/rubocop/cop/force.rb#26 + # source://rubocop//lib/rubocop/cop/force.rb#36 def name; end - # source://rubocop//lib/rubocop/cop/force.rb#30 + # source://rubocop//lib/rubocop/cop/force.rb#40 def run_hook(method_name, *args); end class << self - # source://rubocop//lib/rubocop/cop/force.rb#9 + # source://rubocop//lib/rubocop/cop/force.rb#19 def all; end - # source://rubocop//lib/rubocop/cop/force.rb#18 + # source://rubocop//lib/rubocop/cop/force.rb#28 def force_name; end # @private # - # source://rubocop//lib/rubocop/cop/force.rb#13 + # source://rubocop//lib/rubocop/cop/force.rb#23 def inherited(subclass); end end end +# @api private +# +# source://rubocop//lib/rubocop/cop/force.rb#8 +class RuboCop::Cop::Force::HookError < ::StandardError + # @api private + # @return [HookError] a new instance of HookError + # + # source://rubocop//lib/rubocop/cop/force.rb#11 + def initialize(joining_cop); end + + # @api private + # + # source://rubocop//lib/rubocop/cop/force.rb#9 + def joining_cop; end +end + # Common functionality for dealing with frozen string literals. # # source://rubocop//lib/rubocop/cop/mixin/frozen_string_literal.rb#6 @@ -16267,23 +16283,20 @@ class RuboCop::Cop::Layout::SpaceInsideStringInterpolation < ::RuboCop::Cop::Bas include ::RuboCop::Cop::ConfigurableEnforcedStyle extend ::RuboCop::Cop::AutoCorrector - # source://rubocop//lib/rubocop/cop/layout/space_inside_string_interpolation.rb#31 + # source://rubocop//lib/rubocop/cop/layout/space_inside_string_interpolation.rb#30 def on_interpolation(begin_node); end private - # source://rubocop//lib/rubocop/cop/layout/space_inside_string_interpolation.rb#47 + # source://rubocop//lib/rubocop/cop/layout/space_inside_string_interpolation.rb#46 def autocorrect(corrector, begin_node); end - # source://rubocop//lib/rubocop/cop/layout/space_inside_string_interpolation.rb#57 + # source://rubocop//lib/rubocop/cop/layout/space_inside_string_interpolation.rb#56 def delimiters(begin_node); end end # source://rubocop//lib/rubocop/cop/layout/space_inside_string_interpolation.rb#28 -RuboCop::Cop::Layout::SpaceInsideStringInterpolation::NO_SPACE_MSG = T.let(T.unsafe(nil), String) - -# source://rubocop//lib/rubocop/cop/layout/space_inside_string_interpolation.rb#29 -RuboCop::Cop::Layout::SpaceInsideStringInterpolation::SPACE_MSG = T.let(T.unsafe(nil), String) +RuboCop::Cop::Layout::SpaceInsideStringInterpolation::MSG = T.let(T.unsafe(nil), String) # Looks for trailing blank lines and a final newline in the # source code. @@ -19156,36 +19169,45 @@ class RuboCop::Cop::Lint::ErbNewArguments < ::RuboCop::Cop::Base extend ::RuboCop::Cop::AutoCorrector extend ::RuboCop::Cop::TargetRubyVersion - # source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#83 + # source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#81 def erb_new_with_non_keyword_arguments(param0 = T.unsafe(nil)); end - # source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#88 + # source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#86 def on_send(node); end private - # source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#153 + # source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#160 def arguments_range(node); end - # source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#108 + # source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#115 def autocorrect(corrector, node); end - # source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#123 + # source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#130 def build_kwargs(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#119 + # source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#126 def correct_arguments?(arguments); end - # source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#140 + # source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#104 + def message(positional_argument_index, arg_value); end + + # source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#147 def override_by_legacy_args(kwargs, node); end end +# source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#74 +RuboCop::Cop::Lint::ErbNewArguments::MESSAGE_EOUTVAR = T.let(T.unsafe(nil), String) + # source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#68 -RuboCop::Cop::Lint::ErbNewArguments::MESSAGES = T.let(T.unsafe(nil), Array) +RuboCop::Cop::Lint::ErbNewArguments::MESSAGE_SAFE_LEVEL = T.let(T.unsafe(nil), String) -# source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#80 +# source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#71 +RuboCop::Cop::Lint::ErbNewArguments::MESSAGE_TRIM_MODE = T.let(T.unsafe(nil), String) + +# source://rubocop//lib/rubocop/cop/lint/erb_new_arguments.rb#78 RuboCop::Cop::Lint::ErbNewArguments::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array) # Looks for uses of flip-flop operator @@ -34228,10 +34250,10 @@ class RuboCop::Cop::Style::Copyright < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/copyright.rb#83 + # source://rubocop//lib/rubocop/cop/style/copyright.rb#86 def encoding_token?(processed_source, token_index); end - # source://rubocop//lib/rubocop/cop/style/copyright.rb#69 + # source://rubocop//lib/rubocop/cop/style/copyright.rb#72 def insert_notice_before(processed_source); end # source://rubocop//lib/rubocop/cop/style/copyright.rb#52 @@ -34239,12 +34261,12 @@ class RuboCop::Cop::Style::Copyright < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/copyright.rb#90 + # source://rubocop//lib/rubocop/cop/style/copyright.rb#93 def notice_found?(processed_source); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/copyright.rb#76 + # source://rubocop//lib/rubocop/cop/style/copyright.rb#79 def shebang_token?(processed_source, token_index); end # @raise [Warning] @@ -45992,47 +46014,47 @@ class RuboCop::Cop::Style::RedundantLineContinuation < ::RuboCop::Cop::Base include ::RuboCop::Cop::MatchRange extend ::RuboCop::Cop::AutoCorrector - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#78 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#79 def on_new_investigation; end private # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#182 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#183 def argument_is_method?(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#146 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#147 def argument_newline?(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#101 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#102 def ends_with_backslash_without_comment?(source_line); end - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#162 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#163 def find_node_for_line(line); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#131 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#132 def inside_string_literal?(range, token); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#109 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#110 def inside_string_literal_or_method_with_argument?(range); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#117 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#118 def leading_dot_method_chain_with_blank_line?(range); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#189 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#190 def method_call_with_arguments?(node); end # A method call without parentheses such as the following cannot remove `\`: @@ -46042,38 +46064,41 @@ class RuboCop::Cop::Style::RedundantLineContinuation < ::RuboCop::Cop::Base # # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#139 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#140 def method_with_argument?(current_token, next_token); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#123 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#124 def redundant_line_continuation?(range); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#93 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#94 def require_line_continuation?(range); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#168 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#169 def same_line?(node, line); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#193 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#194 def start_with_arithmetic_operator?(source_line); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#105 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#106 def string_concatenation?(source_line); end end # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#72 RuboCop::Cop::Style::RedundantLineContinuation::ALLOWED_STRING_TOKENS = T.let(T.unsafe(nil), Array) +# source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#77 +RuboCop::Cop::Style::RedundantLineContinuation::ARGUMENT_TAKING_FLOW_TOKEN_TYPES = T.let(T.unsafe(nil), Array) + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#73 RuboCop::Cop::Style::RedundantLineContinuation::ARGUMENT_TYPES = T.let(T.unsafe(nil), Array) @@ -48446,26 +48471,32 @@ RuboCop::Cop::Style::Send::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array) class RuboCop::Cop::Style::SendWithLiteralMethodName < ::RuboCop::Cop::Base extend ::RuboCop::Cop::AutoCorrector - # source://rubocop//lib/rubocop/cop/style/send_with_literal_method_name.rb#48 + # source://rubocop//lib/rubocop/cop/style/send_with_literal_method_name.rb#54 def on_send(node); end private # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/send_with_literal_method_name.rb#69 + # source://rubocop//lib/rubocop/cop/style/send_with_literal_method_name.rb#76 def allow_send?; end - # source://rubocop//lib/rubocop/cop/style/send_with_literal_method_name.rb#73 + # source://rubocop//lib/rubocop/cop/style/send_with_literal_method_name.rb#80 def offense_range(node); end - # source://rubocop//lib/rubocop/cop/style/send_with_literal_method_name.rb#77 + # source://rubocop//lib/rubocop/cop/style/send_with_literal_method_name.rb#84 def removal_argument_range(first_argument, second_argument); end end +# source://rubocop//lib/rubocop/cop/style/send_with_literal_method_name.rb#46 +RuboCop::Cop::Style::SendWithLiteralMethodName::METHOD_NAME_PATTERN = T.let(T.unsafe(nil), Regexp) + # source://rubocop//lib/rubocop/cop/style/send_with_literal_method_name.rb#43 RuboCop::Cop::Style::SendWithLiteralMethodName::MSG = T.let(T.unsafe(nil), String) +# source://rubocop//lib/rubocop/cop/style/send_with_literal_method_name.rb#47 +RuboCop::Cop::Style::SendWithLiteralMethodName::RESERVED_WORDS = T.let(T.unsafe(nil), Array) + # source://rubocop//lib/rubocop/cop/style/send_with_literal_method_name.rb#44 RuboCop::Cop::Style::SendWithLiteralMethodName::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array) @@ -49857,61 +49888,80 @@ RuboCop::Cop::Style::StructInheritance::MSG = T.let(T.unsafe(nil), String) # super() # end # -# source://rubocop//lib/rubocop/cop/style/super_arguments.rb#29 +# # good - assigning to the block variable before calling super +# def method(&block) +# # Assigning to the block variable would pass the old value to super, +# # under this circumstance the block must be referenced explicitly. +# block ||= proc { 'fallback behavior' } +# super(&block) +# end +# +# source://rubocop//lib/rubocop/cop/style/super_arguments.rb#37 class RuboCop::Cop::Style::SuperArguments < ::RuboCop::Cop::Base extend ::RuboCop::Cop::AutoCorrector - # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#36 + # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#45 def on_super(super_node); end private # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#52 - def arguments_identical?(def_args, super_args); end + # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#62 + def arguments_identical?(def_node, def_args, super_args); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#107 - def block_arg_same?(def_arg, super_arg); end + # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#117 + def block_arg_same?(def_node, def_arg, super_arg); end + + # Reassigning the block argument will still pass along the original block to super + # https://bugs.ruby-lang.org/issues/20505 + # + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#128 + def block_reassigned?(def_node, block_arg_name); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#119 + # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#138 def define_method?(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#115 + # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#134 def forward_arg_same?(def_arg, super_arg); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#87 + # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#97 def keyword_arg_same?(def_arg, super_arg); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#97 + # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#107 def keyword_rest_arg_same?(def_arg, super_arg); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#70 + # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#80 def positional_arg_same?(def_arg, super_arg); end - # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#77 + # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#87 def positional_rest_arg_same(def_arg, super_arg); end - # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#125 + # source://rubocop//lib/rubocop/cop/style/super_arguments.rb#144 def preprocess_super_args(super_args); end end -# source://rubocop//lib/rubocop/cop/style/super_arguments.rb#32 +# source://rubocop//lib/rubocop/cop/style/super_arguments.rb#41 +RuboCop::Cop::Style::SuperArguments::ASSIGN_TYPES = T.let(T.unsafe(nil), Array) + +# source://rubocop//lib/rubocop/cop/style/super_arguments.rb#40 RuboCop::Cop::Style::SuperArguments::DEF_TYPES = T.let(T.unsafe(nil), Array) -# source://rubocop//lib/rubocop/cop/style/super_arguments.rb#34 +# source://rubocop//lib/rubocop/cop/style/super_arguments.rb#43 RuboCop::Cop::Style::SuperArguments::MSG = T.let(T.unsafe(nil), String) # Enforces the presence of parentheses in `super` containing arguments. @@ -52277,10 +52327,10 @@ class RuboCop::Cop::Team # source://rubocop//lib/rubocop/cop/team.rb#207 def each_corrector(report); end - # source://rubocop//lib/rubocop/cop/team.rb#257 + # source://rubocop//lib/rubocop/cop/team.rb#259 def handle_error(error, location, cop); end - # source://rubocop//lib/rubocop/cop/team.rb#249 + # source://rubocop//lib/rubocop/cop/team.rb#251 def handle_warning(error, location); end # @return [Commissioner::InvestigationReport] diff --git a/Library/Homebrew/sorbet/rbi/gems/ruby-macho@4.0.1.rbi b/Library/Homebrew/sorbet/rbi/gems/ruby-macho@4.1.0.rbi similarity index 91% rename from Library/Homebrew/sorbet/rbi/gems/ruby-macho@4.0.1.rbi rename to Library/Homebrew/sorbet/rbi/gems/ruby-macho@4.1.0.rbi index af14c571712998..943f1e37cc8e95 100644 --- a/Library/Homebrew/sorbet/rbi/gems/ruby-macho@4.0.1.rbi +++ b/Library/Homebrew/sorbet/rbi/gems/ruby-macho@4.1.0.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `ruby-macho` gem. # Please instead update this file by running `bin/tapioca gem ruby-macho`. + # The primary namespace for ruby-macho. # # source://ruby-macho//lib/macho/utils.rb#3 @@ -36,7 +37,7 @@ end # Raised when the CPU type/sub-type pair is unknown. # -# source://ruby-macho//lib/macho/exceptions.rb#106 +# source://ruby-macho//lib/macho/exceptions.rb#104 class MachO::CPUSubtypeError < ::MachO::MachOError # @param cputype [Integer] the CPU type of the unknown pair # @param cpusubtype [Integer] the CPU sub-type of the unknown pair @@ -48,7 +49,7 @@ end # Raised when the CPU type is unknown. # -# source://ruby-macho//lib/macho/exceptions.rb#97 +# source://ruby-macho//lib/macho/exceptions.rb#96 class MachO::CPUTypeError < ::MachO::MachOError # @param cputype [Integer] the unknown CPU type # @return [CPUTypeError] a new instance of CPUTypeError @@ -98,7 +99,7 @@ end # Raised when attempting to change a dylib name that doesn't exist. # -# source://ruby-macho//lib/macho/exceptions.rb#186 +# source://ruby-macho//lib/macho/exceptions.rb#185 class MachO::DylibUnknownError < ::MachO::RecoverableModificationError # @param dylib [String] the unknown shared library name # @return [DylibUnknownError] a new instance of DylibUnknownError @@ -110,7 +111,7 @@ end # Raised when attempting to create a {FatFile} from one or more {MachOFile}s # whose offsets will not fit within the resulting 32-bit {Headers::FatArch#offset} fields. # -# source://ruby-macho//lib/macho/exceptions.rb#226 +# source://ruby-macho//lib/macho/exceptions.rb#225 class MachO::FatArchOffsetOverflowError < ::MachO::MachOError # @param offset [Integer] the offending offset # @return [FatArchOffsetOverflowError] a new instance of FatArchOffsetOverflowError @@ -163,7 +164,7 @@ class MachO::FatFile # @return [Boolean] whether or not the file is of type `MH_BUNDLE` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def bundle?(*args, **_arg1, &block); end # Changes all dependent shared library install names from `old_name` to @@ -228,7 +229,7 @@ class MachO::FatFile # @return [Boolean] whether or not the file is of type `MH_CORE` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def core?(*args, **_arg1, &block); end # Delete the given runtime path from the file's Mach-Os. @@ -245,17 +246,17 @@ class MachO::FatFile # @return [Boolean] whether or not the file is of type `MH_DSYM` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def dsym?(*args, **_arg1, &block); end # @return [Boolean] whether or not the file is of type `MH_DYLIB` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def dylib?(*args, **_arg1, &block); end # @return [String, nil] the Mach-O's dylib ID # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def dylib_id(*args, **_arg1, &block); end # Changes the file's dylib ID to `new_id`. If the file is not a dylib, @@ -282,12 +283,12 @@ class MachO::FatFile # @return [Boolean] whether or not the file is of type `MH_DYLINKER` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def dylinker?(*args, **_arg1, &block); end # @return [Boolean] whether or not the file is of type `MH_EXECUTE` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def executable?(*args, **_arg1, &block); end # Extract a Mach-O with the given CPU type from the file. @@ -317,12 +318,12 @@ class MachO::FatFile # @return [Symbol] a string representation of the Mach-O's filetype # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def filetype(*args, **_arg1, &block); end # @return [Boolean] whether or not the file is of type `MH_FVMLIB` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def fvmlib?(*args, **_arg1, &block); end # @return [Headers::FatHeader] the file's header @@ -340,7 +341,7 @@ class MachO::FatFile # @return [Boolean] whether or not the file is of type `MH_KEXT_BUNDLE` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def kext?(*args, **_arg1, &block); end # All shared libraries linked to the file's Mach-Os. @@ -358,7 +359,7 @@ class MachO::FatFile # @return [Integer] the magic number of the header (and file) # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def magic(*args, **_arg1, &block); end # @return [String] a string representation of the file's magic number @@ -368,7 +369,7 @@ class MachO::FatFile # @return [Boolean] whether or not the file is of type `MH_OBJECT` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def object?(*args, **_arg1, &block); end # @note Options specified in a {FatFile} trickle down into the internal {MachOFile}s. @@ -387,7 +388,7 @@ class MachO::FatFile # @return [Boolean] whether or not the file is of type `MH_PRELOAD` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def preload?(*args, **_arg1, &block); end # All runtime paths associated with the file's Mach-Os. @@ -515,7 +516,7 @@ end # Raised when a mach-o file's filetype field is unknown. # -# source://ruby-macho//lib/macho/exceptions.rb#115 +# source://ruby-macho//lib/macho/exceptions.rb#114 class MachO::FiletypeError < ::MachO::MachOError # @param num [Integer] the unknown number # @return [FiletypeError] a new instance of FiletypeError @@ -526,7 +527,7 @@ end # Raised when load commands are too large to fit in the current file. # -# source://ruby-macho//lib/macho/exceptions.rb#176 +# source://ruby-macho//lib/macho/exceptions.rb#175 class MachO::HeaderPadError < ::MachO::ModificationError # @param filename [String] the filename # @return [HeaderPadError] a new instance of HeaderPadError @@ -1060,7 +1061,7 @@ MachO::Headers::FAT_MAGIC_64 = T.let(T.unsafe(nil), Integer) # Mach-Os that it points to necessarily *are* 32-bit. # @see MachO::Headers::FatHeader # -# source://ruby-macho//lib/macho/headers.rb#534 +# source://ruby-macho//lib/macho/headers.rb#533 class MachO::Headers::FatArch < ::MachO::MachOStructure # @return [Integer] the alignment, as a power of 2 # @@ -1105,7 +1106,7 @@ end # Mach-Os that it points to necessarily *are* 64-bit. # @see MachO::Headers::FatHeader # -# source://ruby-macho//lib/macho/headers.rb#574 +# source://ruby-macho//lib/macho/headers.rb#573 class MachO::Headers::FatArch64 < ::MachO::Headers::FatArch # @return [Integer] the file offset to the beginning of the Mach-O data # @@ -1137,7 +1138,7 @@ end # # @see MachO::FatArch # -# source://ruby-macho//lib/macho/headers.rb#507 +# source://ruby-macho//lib/macho/headers.rb#506 class MachO::Headers::FatHeader < ::MachO::MachOStructure # @return [Integer] the magic number of the header (and file) # @@ -1296,7 +1297,7 @@ MachO::Headers::MH_PRELOAD = T.let(T.unsafe(nil), Integer) # 32-bit Mach-O file header structure # -# source://ruby-macho//lib/macho/headers.rb#598 +# source://ruby-macho//lib/macho/headers.rb#597 class MachO::Headers::MachHeader < ::MachO::MachOStructure # @return [Integer] the file's internal alignment # @@ -1419,7 +1420,7 @@ end # 64-bit Mach-O file header structure # -# source://ruby-macho//lib/macho/headers.rb#722 +# source://ruby-macho//lib/macho/headers.rb#721 class MachO::Headers::MachHeader64 < ::MachO::Headers::MachHeader # @return [void] # @@ -1434,7 +1435,7 @@ end # Prelinked kernel/"kernelcache" header structure # -# source://ruby-macho//lib/macho/headers.rb#735 +# source://ruby-macho//lib/macho/headers.rb#734 class MachO::Headers::PrelinkedKernelHeader < ::MachO::MachOStructure # @return [Integer] a checksum for the uncompressed data # @@ -1514,7 +1515,7 @@ end # Raised when a load command string is malformed in some way. # -# source://ruby-macho//lib/macho/exceptions.rb#159 +# source://ruby-macho//lib/macho/exceptions.rb#158 class MachO::LCStrMalformedError < ::MachO::MachOError # @param lc [MachO::LoadCommand] the load command containing the string # @return [LCStrMalformedError] a new instance of LCStrMalformedError @@ -1526,7 +1527,7 @@ end # Raised when the number of arguments used to create a load command manually # is wrong. # -# source://ruby-macho//lib/macho/exceptions.rb#142 +# source://ruby-macho//lib/macho/exceptions.rb#139 class MachO::LoadCommandCreationArityError < ::MachO::MachOError # @param cmd_sym [Symbol] the load command's symbol # @param expected_arity [Integer] the number of arguments expected @@ -1539,7 +1540,7 @@ end # Raised when an unknown load command is encountered. # -# source://ruby-macho//lib/macho/exceptions.rb#123 +# source://ruby-macho//lib/macho/exceptions.rb#122 class MachO::LoadCommandError < ::MachO::MachOError # @param num [Integer] the unknown number # @return [LoadCommandError] a new instance of LoadCommandError @@ -1550,7 +1551,7 @@ end # Raised when a load command can't be created manually. # -# source://ruby-macho//lib/macho/exceptions.rb#131 +# source://ruby-macho//lib/macho/exceptions.rb#130 class MachO::LoadCommandNotCreatableError < ::MachO::MachOError # @param cmd_sym [Symbol] the uncreatable load command's symbol # @return [LoadCommandNotCreatableError] a new instance of LoadCommandNotCreatableError @@ -1561,7 +1562,7 @@ end # Raised when a load command can't be serialized. # -# source://ruby-macho//lib/macho/exceptions.rb#151 +# source://ruby-macho//lib/macho/exceptions.rb#150 class MachO::LoadCommandNotSerializableError < ::MachO::MachOError # @param cmd_sym [Symbol] the load command's symbol # @return [LoadCommandNotSerializableError] a new instance of LoadCommandNotSerializableError @@ -1579,7 +1580,7 @@ module MachO::LoadCommands; end # the binary was built for its platform. # Corresponds to LC_BUILD_VERSION. # -# source://ruby-macho//lib/macho/load_commands.rb#1061 +# source://ruby-macho//lib/macho/load_commands.rb#1159 class MachO::LoadCommands::BuildVersionCommand < ::MachO::LoadCommands::LoadCommand # @return [Integer] the minimum OS version X.Y.Z packed as x16.y8.z8 # @@ -1590,7 +1591,7 @@ class MachO::LoadCommands::BuildVersionCommand < ::MachO::LoadCommands::LoadComm # # @return [String] a string representing the minimum OS version. # - # source://ruby-macho//lib/macho/load_commands.rb#1075 + # source://ruby-macho//lib/macho/load_commands.rb#1174 def minos_string; end # @return [Integer] @@ -1607,12 +1608,12 @@ class MachO::LoadCommands::BuildVersionCommand < ::MachO::LoadCommands::LoadComm # # @return [String] a string representing the SDK version. # - # source://ruby-macho//lib/macho/load_commands.rb#1086 + # source://ruby-macho//lib/macho/load_commands.rb#1185 def sdk_string; end # @return [Hash] a hash representation of this {BuildVersionCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#1096 + # source://ruby-macho//lib/macho/load_commands.rb#1195 def to_h; end # @return [ToolEntries] tool entries @@ -1624,47 +1625,47 @@ end # A representation of the tool versions exposed # by a {BuildVersionCommand} (`LC_BUILD_VERSION`). # -# source://ruby-macho//lib/macho/load_commands.rb#1109 +# source://ruby-macho//lib/macho/load_commands.rb#1208 class MachO::LoadCommands::BuildVersionCommand::ToolEntries # @api private # @param view [MachO::MachOView] the view into the current Mach-O # @param ntools [Integer] the number of tools # @return [ToolEntries] a new instance of ToolEntries # - # source://ruby-macho//lib/macho/load_commands.rb#1116 + # source://ruby-macho//lib/macho/load_commands.rb#1215 def initialize(view, ntools); end # @return [Array] all tools # - # source://ruby-macho//lib/macho/load_commands.rb#1111 + # source://ruby-macho//lib/macho/load_commands.rb#1210 def tools; end end # An individual tool. # -# source://ruby-macho//lib/macho/load_commands.rb#1125 +# source://ruby-macho//lib/macho/load_commands.rb#1224 class MachO::LoadCommands::BuildVersionCommand::ToolEntries::Tool # @api private # @param tool [Integer] 32-bit integer # @param version [Integer] 32-bit integer # @return [Tool] a new instance of Tool # - # source://ruby-macho//lib/macho/load_commands.rb#1135 + # source://ruby-macho//lib/macho/load_commands.rb#1234 def initialize(tool, version); end # @return [Hash] a hash representation of this {Tool} # - # source://ruby-macho//lib/macho/load_commands.rb#1141 + # source://ruby-macho//lib/macho/load_commands.rb#1240 def to_h; end # @return [Integer] the enum for the tool # - # source://ruby-macho//lib/macho/load_commands.rb#1127 + # source://ruby-macho//lib/macho/load_commands.rb#1226 def tool; end # @return [Integer] the tool's version number # - # source://ruby-macho//lib/macho/load_commands.rb#1130 + # source://ruby-macho//lib/macho/load_commands.rb#1229 def version; end end @@ -1672,21 +1673,36 @@ end # # @api private # -# source://ruby-macho//lib/macho/load_commands.rb#86 +# source://ruby-macho//lib/macho/load_commands.rb#87 MachO::LoadCommands::CREATABLE_LOAD_COMMANDS = T.let(T.unsafe(nil), Array) # load commands responsible for loading dylibs # # @api private # -# source://ruby-macho//lib/macho/load_commands.rb#76 +# source://ruby-macho//lib/macho/load_commands.rb#77 MachO::LoadCommands::DYLIB_LOAD_COMMANDS = T.let(T.unsafe(nil), Array) +# association of dylib use flag symbols to values +# +# @api private +# +# source://ruby-macho//lib/macho/load_commands.rb#200 +MachO::LoadCommands::DYLIB_USE_FLAGS = T.let(T.unsafe(nil), Hash) + +# the marker used to denote a newer style dylib use command. +# the value is the timestamp 24 January 1984 18:12:16 +# +# @api private +# +# source://ruby-macho//lib/macho/load_commands.rb#210 +MachO::LoadCommands::DYLIB_USE_MARKER = T.let(T.unsafe(nil), Integer) + # A load command containing the file offsets and sizes of the new # compressed form of the information dyld needs to load the image. # Corresponds to LC_DYLD_INFO and LC_DYLD_INFO_ONLY. # -# source://ruby-macho//lib/macho/load_commands.rb#1155 +# source://ruby-macho//lib/macho/load_commands.rb#1253 class MachO::LoadCommands::DyldInfoCommand < ::MachO::LoadCommands::LoadCommand # @return [Integer] the file offset to the binding information # @@ -1730,7 +1746,7 @@ class MachO::LoadCommands::DyldInfoCommand < ::MachO::LoadCommands::LoadCommand # @return [Hash] a hash representation of this {DyldInfoCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#1186 + # source://ruby-macho//lib/macho/load_commands.rb#1285 def to_h; end # @return [Integer] the file offset to the weak binding information @@ -1748,7 +1764,7 @@ end # on filetype. Corresponds to LC_ID_DYLIB, LC_LOAD_DYLIB, # LC_LOAD_WEAK_DYLIB, and LC_REEXPORT_DYLIB. # -# source://ruby-macho//lib/macho/load_commands.rb#517 +# source://ruby-macho//lib/macho/load_commands.rb#538 class MachO::LoadCommands::DylibCommand < ::MachO::LoadCommands::LoadCommand # @return [Integer] the library's compatibility version number # @@ -1760,6 +1776,14 @@ class MachO::LoadCommands::DylibCommand < ::MachO::LoadCommands::LoadCommand # source://ruby-macho//lib/macho/structure.rb#269 def current_version; end + # @example + # puts "this dylib is weakly loaded" if dylib_command.flag?(:DYLIB_USE_WEAK_LINK) + # @param flag [Symbol] a dylib use command flag symbol + # @return [Boolean] true if `flag` applies to this dylib command + # + # source://ruby-macho//lib/macho/load_commands.rb#556 + def flag?(flag); end + # @return [LCStr] the library's path # name as an LCStr # @@ -1770,7 +1794,7 @@ class MachO::LoadCommands::DylibCommand < ::MachO::LoadCommands::LoadCommand # @param context [SerializationContext] the context # @return [String] the serialized fields of the load command # - # source://ruby-macho//lib/macho/load_commands.rb#533 + # source://ruby-macho//lib/macho/load_commands.rb#573 def serialize(context); end # @return [Integer] the library's build time stamp @@ -1780,18 +1804,65 @@ class MachO::LoadCommands::DylibCommand < ::MachO::LoadCommands::LoadCommand # @return [Hash] a hash representation of this {DylibCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#544 + # source://ruby-macho//lib/macho/load_commands.rb#584 def to_h; end # source://ruby-macho//lib/macho/structure.rb#278 def to_s; end end +# The newer format of load command representing some aspect of shared libraries, +# depending on filetype. Corresponds to LC_LOAD_DYLIB or LC_LOAD_WEAK_DYLIB. +# +# source://ruby-macho//lib/macho/load_commands.rb#596 +class MachO::LoadCommands::DylibUseCommand < ::MachO::LoadCommands::DylibCommand + # @example + # puts "this dylib is weakly loaded" if dylib_command.flag?(:DYLIB_USE_WEAK_LINK) + # @param flag [Symbol] a dylib use command flag symbol + # @return [Boolean] true if `flag` applies to this dylib command + # + # source://ruby-macho//lib/macho/load_commands.rb#623 + def flag?(flag); end + + # @return [Integer] any flags associated with this dylib use command + # + # source://ruby-macho//lib/macho/structure.rb#269 + def flags; end + + # source://ruby-macho//lib/macho/structure.rb#269 + def marker; end + + # @api private + # @param context [SerializationContext] the context + # @return [String] the serialized fields of the load command + # + # source://ruby-macho//lib/macho/load_commands.rb#635 + def serialize(context); end + + # @return [Hash] a hash representation of this {DylibUseCommand} + # + # source://ruby-macho//lib/macho/load_commands.rb#646 + def to_h; end + + class << self + # Instantiates a new DylibCommand or DylibUseCommand. + # macOS 15 and later use a new format for dylib commands (DylibUseCommand), + # which is determined based on a special timestamp and the name offset. + # + # @api private + # @param view [MachO::MachOView] the load command's raw view + # @return [DylibCommand] the new dylib load command + # + # source://ruby-macho//lib/macho/load_commands.rb#608 + def new_from_bin(view); end + end +end + # A load command representing some aspect of the dynamic linker, depending # on filetype. Corresponds to LC_ID_DYLINKER, LC_LOAD_DYLINKER, and # LC_DYLD_ENVIRONMENT. # -# source://ruby-macho//lib/macho/load_commands.rb#559 +# source://ruby-macho//lib/macho/load_commands.rb#656 class MachO::LoadCommands::DylinkerCommand < ::MachO::LoadCommands::LoadCommand # @return [LCStr] the dynamic linker's # path name as an LCStr @@ -1803,12 +1874,12 @@ class MachO::LoadCommands::DylinkerCommand < ::MachO::LoadCommands::LoadCommand # @param context [SerializationContext] the context # @return [String] the serialized fields of the load command # - # source://ruby-macho//lib/macho/load_commands.rb#566 + # source://ruby-macho//lib/macho/load_commands.rb#665 def serialize(context); end # @return [Hash] a hash representation of this {DylinkerCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#576 + # source://ruby-macho//lib/macho/load_commands.rb#675 def to_h; end # source://ruby-macho//lib/macho/structure.rb#278 @@ -1818,7 +1889,7 @@ end # A load command containing symbolic information needed to support data # structures used by the dynamic link editor. Corresponds to LC_DYSYMTAB. # -# source://ruby-macho//lib/macho/load_commands.rb#771 +# source://ruby-macho//lib/macho/load_commands.rb#869 class MachO::LoadCommands::DysymtabCommand < ::MachO::LoadCommands::LoadCommand # @return [Integer] the file offset to the referenced symbol table # @@ -1907,7 +1978,7 @@ class MachO::LoadCommands::DysymtabCommand < ::MachO::LoadCommands::LoadCommand # @return [Hash] a hash representation of this {DysymtabCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#826 + # source://ruby-macho//lib/macho/load_commands.rb#925 def to_h; end # @return [Integer] the file offset to the table of contents @@ -1919,7 +1990,7 @@ end # A load command representing the offset to and size of an encrypted # segment. Corresponds to LC_ENCRYPTION_INFO. # -# source://ruby-macho//lib/macho/load_commands.rb#981 +# source://ruby-macho//lib/macho/load_commands.rb#1079 class MachO::LoadCommands::EncryptionInfoCommand < ::MachO::LoadCommands::LoadCommand # @return [Integer] the encryption system, or 0 if not encrypted yet # @@ -1938,14 +2009,14 @@ class MachO::LoadCommands::EncryptionInfoCommand < ::MachO::LoadCommands::LoadCo # @return [Hash] a hash representation of this {EncryptionInfoCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#991 + # source://ruby-macho//lib/macho/load_commands.rb#1090 def to_h; end end # A load command representing the offset to and size of an encrypted # segment. Corresponds to LC_ENCRYPTION_INFO_64. # -# source://ruby-macho//lib/macho/load_commands.rb#1003 +# source://ruby-macho//lib/macho/load_commands.rb#1101 class MachO::LoadCommands::EncryptionInfoCommand64 < ::MachO::LoadCommands::EncryptionInfoCommand # @return [Integer] 64-bit padding value # @@ -1954,13 +2025,13 @@ class MachO::LoadCommands::EncryptionInfoCommand64 < ::MachO::LoadCommands::Encr # @return [Hash] a hash representation of this {EncryptionInfoCommand64} # - # source://ruby-macho//lib/macho/load_commands.rb#1007 + # source://ruby-macho//lib/macho/load_commands.rb#1106 def to_h; end end # A load command specifying the offset of main(). Corresponds to LC_MAIN. # -# source://ruby-macho//lib/macho/load_commands.rb#1218 +# source://ruby-macho//lib/macho/load_commands.rb#1316 class MachO::LoadCommands::EntryPointCommand < ::MachO::LoadCommands::LoadCommand # @return [Integer] the file (__TEXT) offset of main() # @@ -1974,7 +2045,7 @@ class MachO::LoadCommands::EntryPointCommand < ::MachO::LoadCommands::LoadComman # @return [Hash] a hash representation of this {EntryPointCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#1225 + # source://ruby-macho//lib/macho/load_commands.rb#1324 def to_h; end end @@ -1982,7 +2053,7 @@ end # Each entry is further described by its own Mach header. # Corresponds to LC_FILESET_ENTRY. # -# source://ruby-macho//lib/macho/load_commands.rb#1350 +# source://ruby-macho//lib/macho/load_commands.rb#1448 class MachO::LoadCommands::FilesetEntryCommand < ::MachO::LoadCommands::LoadCommand # @return [LCStr] the entry's ID # @@ -2001,12 +2072,12 @@ class MachO::LoadCommands::FilesetEntryCommand < ::MachO::LoadCommands::LoadComm # @return [SegmentCommand64, nil] the matching segment command or nil if nothing matches # - # source://ruby-macho//lib/macho/load_commands.rb#1373 + # source://ruby-macho//lib/macho/load_commands.rb#1472 def segment; end # @return [Hash] a hash representation of this {FilesetEntryCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#1363 + # source://ruby-macho//lib/macho/load_commands.rb#1462 def to_h; end # source://ruby-macho//lib/macho/structure.rb#278 @@ -2021,7 +2092,7 @@ end # An obsolete load command containing the path to a file to be loaded into # memory. Corresponds to LC_FVMFILE. # -# source://ruby-macho//lib/macho/load_commands.rb#1287 +# source://ruby-macho//lib/macho/load_commands.rb#1385 class MachO::LoadCommands::FvmfileCommand < ::MachO::LoadCommands::LoadCommand # @return [Integer] the virtual address being loaded at # @@ -2035,7 +2106,7 @@ class MachO::LoadCommands::FvmfileCommand < ::MachO::LoadCommands::LoadCommand # @return [Hash] a hash representation of this {FvmfileCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#1294 + # source://ruby-macho//lib/macho/load_commands.rb#1393 def to_h; end # source://ruby-macho//lib/macho/structure.rb#278 @@ -2045,7 +2116,7 @@ end # An obsolete load command containing the path to a library to be loaded # into memory. Corresponds to LC_LOADFVMLIB and LC_IDFVMLIB. # -# source://ruby-macho//lib/macho/load_commands.rb#1305 +# source://ruby-macho//lib/macho/load_commands.rb#1403 class MachO::LoadCommands::FvmlibCommand < ::MachO::LoadCommands::LoadCommand # @return [Integer] the library's header address # @@ -2064,7 +2135,7 @@ class MachO::LoadCommands::FvmlibCommand < ::MachO::LoadCommands::LoadCommand # @return [Hash] a hash representation of this {FvmlibCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#1315 + # source://ruby-macho//lib/macho/load_commands.rb#1414 def to_h; end # source://ruby-macho//lib/macho/structure.rb#278 @@ -2075,7 +2146,7 @@ end # string is null-terminated and the command is zero-padded to a multiple of # 4. Corresponds to LC_IDENT. # -# source://ruby-macho//lib/macho/load_commands.rb#1281 +# source://ruby-macho//lib/macho/load_commands.rb#1380 class MachO::LoadCommands::IdentCommand < ::MachO::LoadCommands::LoadCommand; end # load commands added after OS X 10.1 need to be bitwise ORed with @@ -2090,7 +2161,7 @@ MachO::LoadCommands::LC_REQ_DYLD = T.let(T.unsafe(nil), Integer) # # @api private # -# source://ruby-macho//lib/macho/load_commands.rb#94 +# source://ruby-macho//lib/macho/load_commands.rb#95 MachO::LoadCommands::LC_STRUCTURES = T.let(T.unsafe(nil), Hash) # association of load commands to symbol representations @@ -2104,16 +2175,16 @@ MachO::LoadCommands::LOAD_COMMANDS = T.let(T.unsafe(nil), Hash) # # @api private # -# source://ruby-macho//lib/macho/load_commands.rb#72 +# source://ruby-macho//lib/macho/load_commands.rb#73 MachO::LoadCommands::LOAD_COMMAND_CONSTANTS = T.let(T.unsafe(nil), Hash) # A load command representing the offsets and sizes of a blob of data in # the __LINKEDIT segment. Corresponds to LC_CODE_SIGNATURE, # LC_SEGMENT_SPLIT_INFO, LC_FUNCTION_STARTS, LC_DATA_IN_CODE, # LC_DYLIB_CODE_SIGN_DRS, LC_LINKER_OPTIMIZATION_HINT, LC_DYLD_EXPORTS_TRIE, -# or LC_DYLD_CHAINED_FIXUPS. +# LC_DYLD_CHAINED_FIXUPS, or LC_ATOM_INFO. # -# source://ruby-macho//lib/macho/load_commands.rb#963 +# source://ruby-macho//lib/macho/load_commands.rb#1061 class MachO::LoadCommands::LinkeditDataCommand < ::MachO::LoadCommands::LoadCommand # @return [Integer] offset to the data in the __LINKEDIT segment # @@ -2127,14 +2198,14 @@ class MachO::LoadCommands::LinkeditDataCommand < ::MachO::LoadCommands::LoadComm # @return [Hash] a hash representation of this {LinkeditDataCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#970 + # source://ruby-macho//lib/macho/load_commands.rb#1069 def to_h; end end # A load command containing linker options embedded in object files. # Corresponds to LC_LINKER_OPTION. # -# source://ruby-macho//lib/macho/load_commands.rb#1205 +# source://ruby-macho//lib/macho/load_commands.rb#1303 class MachO::LoadCommands::LinkerOptionCommand < ::MachO::LoadCommands::LoadCommand # @return [Integer] the number of strings # @@ -2143,7 +2214,7 @@ class MachO::LoadCommands::LinkerOptionCommand < ::MachO::LoadCommands::LoadComm # @return [Hash] a hash representation of this {LinkerOptionCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#1209 + # source://ruby-macho//lib/macho/load_commands.rb#1308 def to_h; end end @@ -2152,7 +2223,7 @@ end # This is the most generic load command -- only the type ID and size are # represented. Used when a more specific class isn't available or isn't implemented. # -# source://ruby-macho//lib/macho/load_commands.rb#202 +# source://ruby-macho//lib/macho/load_commands.rb#216 class MachO::LoadCommands::LoadCommand < ::MachO::MachOStructure # @return [Integer] the load command's type ID # @@ -2167,12 +2238,12 @@ class MachO::LoadCommands::LoadCommand < ::MachO::MachOStructure # @deprecated use {#view} instead # @return [Integer] the load command's offset in the source file # - # source://ruby-macho//lib/macho/load_commands.rb#258 + # source://ruby-macho//lib/macho/load_commands.rb#281 def offset; end # @return [Boolean] whether the load command can be serialized # - # source://ruby-macho//lib/macho/load_commands.rb#240 + # source://ruby-macho//lib/macho/load_commands.rb#263 def serializable?; end # @api private @@ -2182,31 +2253,31 @@ class MachO::LoadCommands::LoadCommand < ::MachO::MachOStructure # @return [String, nil] the serialized fields of the load command, or nil # if the load command can't be serialized # - # source://ruby-macho//lib/macho/load_commands.rb#249 + # source://ruby-macho//lib/macho/load_commands.rb#272 def serialize(context); end # @note Children should override this to include additional information. # @return [Hash] a hash representation of this load command # - # source://ruby-macho//lib/macho/load_commands.rb#278 + # source://ruby-macho//lib/macho/load_commands.rb#301 def to_h; end # @return [String] a string representation of the load command's # identifying number # - # source://ruby-macho//lib/macho/load_commands.rb#272 + # source://ruby-macho//lib/macho/load_commands.rb#295 def to_s; end # @return [Symbol, nil] a symbol representation of the load command's # type ID, or nil if the ID doesn't correspond to a known load command class # - # source://ruby-macho//lib/macho/load_commands.rb#264 + # source://ruby-macho//lib/macho/load_commands.rb#287 def to_sym; end # @return [Symbol, nil] a symbol representation of the load command's # type ID, or nil if the ID doesn't correspond to a known load command class # - # source://ruby-macho//lib/macho/load_commands.rb#264 + # source://ruby-macho//lib/macho/load_commands.rb#287 def type; end # @return [MachO::MachOView, nil] the raw view associated with the load command, @@ -2222,7 +2293,7 @@ class MachO::LoadCommands::LoadCommand < ::MachO::MachOStructure # @param args [Array] the arguments for the load command being created # @raise [LoadCommandNotCreatableError] # - # source://ruby-macho//lib/macho/load_commands.rb#225 + # source://ruby-macho//lib/macho/load_commands.rb#241 def create(cmd_sym, *args); end # Instantiates a new LoadCommand given a view into its origin Mach-O @@ -2231,7 +2302,7 @@ class MachO::LoadCommands::LoadCommand < ::MachO::MachOStructure # @param view [MachO::MachOView] the load command's raw view # @return [LoadCommand] the new load command # - # source://ruby-macho//lib/macho/load_commands.rb#215 + # source://ruby-macho//lib/macho/load_commands.rb#231 def new_from_bin(view); end end end @@ -2241,7 +2312,7 @@ end # pretend that strings stored in LCs are immediately available without # explicit operations on the raw Mach-O data. # -# source://ruby-macho//lib/macho/load_commands.rb#291 +# source://ruby-macho//lib/macho/load_commands.rb#314 class MachO::LoadCommands::LoadCommand::LCStr # @api private # @param lc [LoadCommand] the load command @@ -2253,48 +2324,48 @@ class MachO::LoadCommands::LoadCommand::LCStr # interpreted differently depending on `lc.view`. The current behavior # is a hack to allow viewless load command creation. # - # source://ruby-macho//lib/macho/load_commands.rb#300 + # source://ruby-macho//lib/macho/load_commands.rb#323 def initialize(lc, lc_str); end # @return [Hash] a hash representation of this {LCStr}. # - # source://ruby-macho//lib/macho/load_commands.rb#330 + # source://ruby-macho//lib/macho/load_commands.rb#353 def to_h; end # @return [Integer] the offset to the beginning of the string in the # load command # - # source://ruby-macho//lib/macho/load_commands.rb#325 + # source://ruby-macho//lib/macho/load_commands.rb#348 def to_i; end # @return [String] a string representation of the LCStr # - # source://ruby-macho//lib/macho/load_commands.rb#319 + # source://ruby-macho//lib/macho/load_commands.rb#342 def to_s; end end # Represents the contextual information needed by a load command to # serialize itself correctly into a binary string. # -# source://ruby-macho//lib/macho/load_commands.rb#340 +# source://ruby-macho//lib/macho/load_commands.rb#363 class MachO::LoadCommands::LoadCommand::SerializationContext # @api private # @param endianness [Symbol] the endianness of the context # @param alignment [Integer] the alignment of the context # @return [SerializationContext] a new instance of SerializationContext # - # source://ruby-macho//lib/macho/load_commands.rb#358 + # source://ruby-macho//lib/macho/load_commands.rb#381 def initialize(endianness, alignment); end # @return [Integer] the constant alignment value used to pad the # serialized load command # - # source://ruby-macho//lib/macho/load_commands.rb#346 + # source://ruby-macho//lib/macho/load_commands.rb#369 def alignment; end # @return [Symbol] the endianness of the serialized load command # - # source://ruby-macho//lib/macho/load_commands.rb#342 + # source://ruby-macho//lib/macho/load_commands.rb#365 def endianness; end class << self @@ -2302,7 +2373,7 @@ class MachO::LoadCommands::LoadCommand::SerializationContext # @return [SerializationContext] the # resulting context # - # source://ruby-macho//lib/macho/load_commands.rb#351 + # source://ruby-macho//lib/macho/load_commands.rb#374 def context_for(macho); end end end @@ -2310,7 +2381,7 @@ end # A load command containing an owner name and offset/size for an arbitrary data region. # Corresponds to LC_NOTE. # -# source://ruby-macho//lib/macho/load_commands.rb#1327 +# source://ruby-macho//lib/macho/load_commands.rb#1425 class MachO::LoadCommands::NoteCommand < ::MachO::LoadCommands::LoadCommand # @return [String] the name of the owner for this note # @@ -2329,7 +2400,7 @@ class MachO::LoadCommands::NoteCommand < ::MachO::LoadCommands::LoadCommand # @return [Hash] a hash representation of this {NoteCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#1337 + # source://ruby-macho//lib/macho/load_commands.rb#1436 def to_h; end # source://ruby-macho//lib/macho/structure.rb#278 @@ -2339,7 +2410,7 @@ end # A load command containing the value of the original checksum for prebound # files, or zero. Corresponds to LC_PREBIND_CKSUM. # -# source://ruby-macho//lib/macho/load_commands.rb#919 +# source://ruby-macho//lib/macho/load_commands.rb#1017 class MachO::LoadCommands::PrebindCksumCommand < ::MachO::LoadCommands::LoadCommand # @return [Integer] the checksum or 0 # @@ -2348,14 +2419,14 @@ class MachO::LoadCommands::PrebindCksumCommand < ::MachO::LoadCommands::LoadComm # @return [Hash] a hash representation of this {PrebindCksumCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#923 + # source://ruby-macho//lib/macho/load_commands.rb#1022 def to_h; end end # A load command used to indicate dynamic libraries used in prebinding. # Corresponds to LC_PREBOUND_DYLIB. # -# source://ruby-macho//lib/macho/load_commands.rb#587 +# source://ruby-macho//lib/macho/load_commands.rb#684 class MachO::LoadCommands::PreboundDylibCommand < ::MachO::LoadCommands::LoadCommand # @return [Integer] a bit vector of linked modules # @@ -2375,7 +2446,7 @@ class MachO::LoadCommands::PreboundDylibCommand < ::MachO::LoadCommands::LoadCom # @return [Hash] a hash representation of this {PreboundDylibCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#597 + # source://ruby-macho//lib/macho/load_commands.rb#696 def to_h; end # source://ruby-macho//lib/macho/structure.rb#278 @@ -2386,7 +2457,7 @@ end # initialization routine and an index into the module table for the module # that defines the routine. Corresponds to LC_ROUTINES. # -# source://ruby-macho//lib/macho/load_commands.rb#616 +# source://ruby-macho//lib/macho/load_commands.rb#714 class MachO::LoadCommands::RoutinesCommand < ::MachO::LoadCommands::LoadCommand # @return [Integer] the address of the initialization routine # @@ -2431,7 +2502,7 @@ class MachO::LoadCommands::RoutinesCommand < ::MachO::LoadCommands::LoadCommand # @return [Hash] a hash representation of this {RoutinesCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#642 + # source://ruby-macho//lib/macho/load_commands.rb#741 def to_h; end end @@ -2439,7 +2510,7 @@ end # initialization routine and an index into the module table for the module # that defines the routine. Corresponds to LC_ROUTINES_64. # -# source://ruby-macho//lib/macho/load_commands.rb#660 +# source://ruby-macho//lib/macho/load_commands.rb#758 class MachO::LoadCommands::RoutinesCommand64 < ::MachO::LoadCommands::RoutinesCommand # @return [Integer] the address of the initialization routine # @@ -2487,7 +2558,7 @@ end # be added to the current run path used to find @rpath prefixed dylibs. # Corresponds to LC_RPATH. # -# source://ruby-macho//lib/macho/load_commands.rb#934 +# source://ruby-macho//lib/macho/load_commands.rb#1032 class MachO::LoadCommands::RpathCommand < ::MachO::LoadCommands::LoadCommand # @return [LCStr] the path to add to the run path as an LCStr # @@ -2498,12 +2569,12 @@ class MachO::LoadCommands::RpathCommand < ::MachO::LoadCommands::LoadCommand # @param context [SerializationContext] the context # @return [String] the serialized fields of the load command # - # source://ruby-macho//lib/macho/load_commands.rb#940 + # source://ruby-macho//lib/macho/load_commands.rb#1039 def serialize(context); end # @return [Hash] a hash representation of this {RpathCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#950 + # source://ruby-macho//lib/macho/load_commands.rb#1049 def to_h; end # source://ruby-macho//lib/macho/structure.rb#278 @@ -2514,20 +2585,20 @@ end # # @api private # -# source://ruby-macho//lib/macho/load_commands.rb#188 +# source://ruby-macho//lib/macho/load_commands.rb#190 MachO::LoadCommands::SEGMENT_FLAGS = T.let(T.unsafe(nil), Hash) # association of segment name symbols to names # # @api private # -# source://ruby-macho//lib/macho/load_commands.rb#160 +# source://ruby-macho//lib/macho/load_commands.rb#162 MachO::LoadCommands::SEGMENT_NAMES = T.let(T.unsafe(nil), Hash) # A load command indicating that part of this file is to be mapped into # the task's address space. Corresponds to LC_SEGMENT. # -# source://ruby-macho//lib/macho/load_commands.rb#400 +# source://ruby-macho//lib/macho/load_commands.rb#422 class MachO::LoadCommands::SegmentCommand < ::MachO::LoadCommands::LoadCommand # @return [Integer] the file offset of the segment # @@ -2544,7 +2615,7 @@ class MachO::LoadCommands::SegmentCommand < ::MachO::LoadCommands::LoadCommand # @param flag [Symbol] a segment flag symbol # @return [Boolean] true if `flag` is present in the segment's flag field # - # source://ruby-macho//lib/macho/load_commands.rb#451 + # source://ruby-macho//lib/macho/load_commands.rb#474 def flag?(flag); end # @return [Integer] any flags associated with the segment @@ -2557,7 +2628,7 @@ class MachO::LoadCommands::SegmentCommand < ::MachO::LoadCommands::LoadCommand # @note See `guess_align` in `cctools/misc/lipo.c` # @return [Integer] the guessed alignment, as a power of 2 # - # source://ruby-macho//lib/macho/load_commands.rb#462 + # source://ruby-macho//lib/macho/load_commands.rb#485 def guess_align; end # @return [Integer] the initial VM protection @@ -2580,7 +2651,7 @@ class MachO::LoadCommands::SegmentCommand < ::MachO::LoadCommands::LoadCommand # @return [Array] if the Mach-O is 32-bit # @return [Array] if the Mach-O is 64-bit # - # source://ruby-macho//lib/macho/load_commands.rb#430 + # source://ruby-macho//lib/macho/load_commands.rb#453 def sections; end # @return [String] the name of the segment @@ -2590,7 +2661,7 @@ class MachO::LoadCommands::SegmentCommand < ::MachO::LoadCommands::LoadCommand # @return [Hash] a hash representation of this {SegmentCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#480 + # source://ruby-macho//lib/macho/load_commands.rb#503 def to_h; end # source://ruby-macho//lib/macho/structure.rb#278 @@ -2610,7 +2681,7 @@ end # A load command indicating that part of this file is to be mapped into # the task's address space. Corresponds to LC_SEGMENT_64. # -# source://ruby-macho//lib/macho/load_commands.rb#499 +# source://ruby-macho//lib/macho/load_commands.rb#521 class MachO::LoadCommands::SegmentCommand64 < ::MachO::LoadCommands::SegmentCommand # @return [Integer] the file offset of the segment # @@ -2636,11 +2707,11 @@ end # A load command specifying the version of the sources used to build the # binary. Corresponds to LC_SOURCE_VERSION. # -# source://ruby-macho//lib/macho/load_commands.rb#1236 +# source://ruby-macho//lib/macho/load_commands.rb#1334 class MachO::LoadCommands::SourceVersionCommand < ::MachO::LoadCommands::LoadCommand # @return [Hash] a hash representation of this {SourceVersionCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#1252 + # source://ruby-macho//lib/macho/load_commands.rb#1351 def to_h; end # @return [Integer] the version packed as a24.b10.c10.d10.e10 @@ -2652,14 +2723,14 @@ class MachO::LoadCommands::SourceVersionCommand < ::MachO::LoadCommands::LoadCom # # @return [String] a string representation of the version # - # source://ruby-macho//lib/macho/load_commands.rb#1241 + # source://ruby-macho//lib/macho/load_commands.rb#1340 def version_string; end end # A load command signifying a shared library that is a subframework of # an umbrella framework. Corresponds to LC_SUB_CLIENT. # -# source://ruby-macho//lib/macho/load_commands.rb#731 +# source://ruby-macho//lib/macho/load_commands.rb#829 class MachO::LoadCommands::SubClientCommand < ::MachO::LoadCommands::LoadCommand # @return [LCStr] the subclient name as an LCStr # @@ -2668,7 +2739,7 @@ class MachO::LoadCommands::SubClientCommand < ::MachO::LoadCommands::LoadCommand # @return [Hash] a hash representation of this {SubClientCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#735 + # source://ruby-macho//lib/macho/load_commands.rb#834 def to_h; end # source://ruby-macho//lib/macho/structure.rb#278 @@ -2678,11 +2749,11 @@ end # A load command signifying membership of a subframework containing the name # of an umbrella framework. Corresponds to LC_SUB_FRAMEWORK. # -# source://ruby-macho//lib/macho/load_commands.rb#689 +# source://ruby-macho//lib/macho/load_commands.rb#787 class MachO::LoadCommands::SubFrameworkCommand < ::MachO::LoadCommands::LoadCommand # @return [Hash] a hash representation of this {SubFrameworkCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#693 + # source://ruby-macho//lib/macho/load_commands.rb#792 def to_h; end # source://ruby-macho//lib/macho/structure.rb#278 @@ -2697,7 +2768,7 @@ end # A load command signifying a sublibrary of a shared library. Corresponds # to LC_SUB_LIBRARY. # -# source://ruby-macho//lib/macho/load_commands.rb#717 +# source://ruby-macho//lib/macho/load_commands.rb#815 class MachO::LoadCommands::SubLibraryCommand < ::MachO::LoadCommands::LoadCommand # @return [LCStr] the sublibrary name as an LCStr # @@ -2706,7 +2777,7 @@ class MachO::LoadCommands::SubLibraryCommand < ::MachO::LoadCommands::LoadComman # @return [Hash] a hash representation of this {SubLibraryCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#721 + # source://ruby-macho//lib/macho/load_commands.rb#820 def to_h; end # source://ruby-macho//lib/macho/structure.rb#278 @@ -2716,7 +2787,7 @@ end # A load command signifying membership of a subumbrella containing the name # of an umbrella framework. Corresponds to LC_SUB_UMBRELLA. # -# source://ruby-macho//lib/macho/load_commands.rb#703 +# source://ruby-macho//lib/macho/load_commands.rb#801 class MachO::LoadCommands::SubUmbrellaCommand < ::MachO::LoadCommands::LoadCommand # @return [LCStr] the subumbrella framework name as an LCStr # @@ -2725,7 +2796,7 @@ class MachO::LoadCommands::SubUmbrellaCommand < ::MachO::LoadCommands::LoadComma # @return [Hash] a hash representation of this {SubUmbrellaCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#707 + # source://ruby-macho//lib/macho/load_commands.rb#806 def to_h; end # source://ruby-macho//lib/macho/structure.rb#278 @@ -2735,7 +2806,7 @@ end # An obsolete load command containing the offset and size of the (GNU style) # symbol table information. Corresponds to LC_SYMSEG. # -# source://ruby-macho//lib/macho/load_commands.rb#1263 +# source://ruby-macho//lib/macho/load_commands.rb#1361 class MachO::LoadCommands::SymsegCommand < ::MachO::LoadCommands::LoadCommand # @return [Integer] the offset to the symbol segment # @@ -2749,14 +2820,14 @@ class MachO::LoadCommands::SymsegCommand < ::MachO::LoadCommands::LoadCommand # @return [Hash] a hash representation of this {SymsegCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#1270 + # source://ruby-macho//lib/macho/load_commands.rb#1369 def to_h; end end # A load command containing the offsets and sizes of the link-edit 4.3BSD # "stab" style symbol table information. Corresponds to LC_SYMTAB. # -# source://ruby-macho//lib/macho/load_commands.rb#745 +# source://ruby-macho//lib/macho/load_commands.rb#843 class MachO::LoadCommands::SymtabCommand < ::MachO::LoadCommands::LoadCommand # @return [Integer] the number of symbol table entries # @@ -2780,7 +2851,7 @@ class MachO::LoadCommands::SymtabCommand < ::MachO::LoadCommands::LoadCommand # @return [Hash] a hash representation of this {SymtabCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#758 + # source://ruby-macho//lib/macho/load_commands.rb#857 def to_h; end end @@ -2789,13 +2860,13 @@ end # # @note cctools-870 and onwards have all fields of thread_command commented # -# source://ruby-macho//lib/macho/load_commands.rb#609 +# source://ruby-macho//lib/macho/load_commands.rb#708 class MachO::LoadCommands::ThreadCommand < ::MachO::LoadCommands::LoadCommand; end # A load command containing the offset and number of hints in the two-level # namespace lookup hints table. Corresponds to LC_TWOLEVEL_HINTS. # -# source://ruby-macho//lib/macho/load_commands.rb#853 +# source://ruby-macho//lib/macho/load_commands.rb#951 class MachO::LoadCommands::TwolevelHintsCommand < ::MachO::LoadCommands::LoadCommand # @return [Integer] the offset to the hint table # @@ -2814,14 +2885,14 @@ class MachO::LoadCommands::TwolevelHintsCommand < ::MachO::LoadCommands::LoadCom # @return [Hash] a hash representation of this {TwolevelHintsCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#864 + # source://ruby-macho//lib/macho/load_commands.rb#963 def to_h; end end # A representation of the two-level namespace lookup hints table exposed # by a {TwolevelHintsCommand} (`LC_TWOLEVEL_HINTS`). # -# source://ruby-macho//lib/macho/load_commands.rb#874 +# source://ruby-macho//lib/macho/load_commands.rb#973 class MachO::LoadCommands::TwolevelHintsCommand::TwolevelHintsTable # @api private # @param view [MachO::MachOView] the view into the current Mach-O @@ -2829,39 +2900,39 @@ class MachO::LoadCommands::TwolevelHintsCommand::TwolevelHintsTable # @param nhints [Integer] the number of two-level hints in the table # @return [TwolevelHintsTable] a new instance of TwolevelHintsTable # - # source://ruby-macho//lib/macho/load_commands.rb#882 + # source://ruby-macho//lib/macho/load_commands.rb#981 def initialize(view, htoffset, nhints); end # @return [Array] all hints in the table # - # source://ruby-macho//lib/macho/load_commands.rb#876 + # source://ruby-macho//lib/macho/load_commands.rb#975 def hints; end end # An individual two-level namespace lookup hint. # -# source://ruby-macho//lib/macho/load_commands.rb#891 +# source://ruby-macho//lib/macho/load_commands.rb#990 class MachO::LoadCommands::TwolevelHintsCommand::TwolevelHintsTable::TwolevelHint # @api private # @param blob [Integer] the 32-bit number containing the lookup hint # @return [TwolevelHint] a new instance of TwolevelHint # - # source://ruby-macho//lib/macho/load_commands.rb#900 + # source://ruby-macho//lib/macho/load_commands.rb#999 def initialize(blob); end # @return [Integer] the index into the sub-images # - # source://ruby-macho//lib/macho/load_commands.rb#893 + # source://ruby-macho//lib/macho/load_commands.rb#992 def isub_image; end # @return [Integer] the index into the table of contents # - # source://ruby-macho//lib/macho/load_commands.rb#896 + # source://ruby-macho//lib/macho/load_commands.rb#995 def itoc; end # @return [Hash] a hash representation of this {TwolevelHint} # - # source://ruby-macho//lib/macho/load_commands.rb#906 + # source://ruby-macho//lib/macho/load_commands.rb#1005 def to_h; end end @@ -2869,16 +2940,16 @@ end # identifying an object produced by static link editor. Corresponds to # LC_UUID. # -# source://ruby-macho//lib/macho/load_commands.rb#369 +# source://ruby-macho//lib/macho/load_commands.rb#391 class MachO::LoadCommands::UUIDCommand < ::MachO::LoadCommands::LoadCommand # @return [Hash] returns a hash representation of this {UUIDCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#389 + # source://ruby-macho//lib/macho/load_commands.rb#412 def to_h; end # @return [String] an alias for uuid_string # - # source://ruby-macho//lib/macho/load_commands.rb#384 + # source://ruby-macho//lib/macho/load_commands.rb#407 def to_s; end # @return [Array] the UUID @@ -2888,7 +2959,7 @@ class MachO::LoadCommands::UUIDCommand < ::MachO::LoadCommands::LoadCommand # @return [String] a string representation of the UUID # - # source://ruby-macho//lib/macho/load_commands.rb#373 + # source://ruby-macho//lib/macho/load_commands.rb#396 def uuid_string; end end @@ -2896,7 +2967,7 @@ end # was built to run. Corresponds to LC_VERSION_MIN_MACOSX and # LC_VERSION_MIN_IPHONEOS. # -# source://ruby-macho//lib/macho/load_commands.rb#1018 +# source://ruby-macho//lib/macho/load_commands.rb#1116 class MachO::LoadCommands::VersionMinCommand < ::MachO::LoadCommands::LoadCommand # @return [Integer] the SDK version X.Y.Z packed as x16.y8.z8 # @@ -2907,12 +2978,12 @@ class MachO::LoadCommands::VersionMinCommand < ::MachO::LoadCommands::LoadComman # # @return [String] a string representing the SDK version. # - # source://ruby-macho//lib/macho/load_commands.rb#1037 + # source://ruby-macho//lib/macho/load_commands.rb#1136 def sdk_string; end # @return [Hash] a hash representation of this {VersionMinCommand} # - # source://ruby-macho//lib/macho/load_commands.rb#1047 + # source://ruby-macho//lib/macho/load_commands.rb#1146 def to_h; end # @return [Integer] the version X.Y.Z packed as x16.y8.z8 @@ -2924,7 +2995,7 @@ class MachO::LoadCommands::VersionMinCommand < ::MachO::LoadCommands::LoadComman # # @return [String] a string representing the minimum OS version. # - # source://ruby-macho//lib/macho/load_commands.rb#1026 + # source://ruby-macho//lib/macho/load_commands.rb#1125 def version_string; end end @@ -3015,12 +3086,12 @@ class MachO::MachOFile # @return [Integer] the file's internal alignment # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def alignment(*args, **_arg1, &block); end # @return [Boolean] whether or not the file is of type `MH_BUNDLE` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def bundle?(*args, **_arg1, &block); end # Changes the shared library `old_name` to `new_name` @@ -3095,7 +3166,7 @@ class MachO::MachOFile # @return [Boolean] whether or not the file is of type `MH_CORE` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def core?(*args, **_arg1, &block); end # @return [Symbol] a symbol representation of the Mach-O's CPU subtype @@ -3147,12 +3218,12 @@ class MachO::MachOFile # @return [Boolean] whether or not the file is of type `MH_DSYM` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def dsym?(*args, **_arg1, &block); end # @return [Boolean] whether or not the file is of type `MH_DYLIB` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def dylib?(*args, **_arg1, &block); end # The Mach-O's dylib ID, or `nil` if not a dylib. @@ -3187,7 +3258,7 @@ class MachO::MachOFile # @return [Boolean] whether or not the file is of type `MH_DYLINKER` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def dylinker?(*args, **_arg1, &block); end # @return [Symbol] the endianness of the file, :big or :little @@ -3197,7 +3268,7 @@ class MachO::MachOFile # @return [Boolean] whether or not the file is of type `MH_EXECUTE` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def executable?(*args, **_arg1, &block); end # @return [String, nil] the filename loaded from, or nil if loaded from a binary @@ -3219,12 +3290,12 @@ class MachO::MachOFile # @return [Integer] the header flags associated with the Mach-O # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def flags(*args, **_arg1, &block); end # @return [Boolean] whether or not the file is of type `MH_FVMLIB` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def fvmlib?(*args, **_arg1, &block); end # @return [Headers::MachHeader] if the Mach-O is 32-bit @@ -3257,7 +3328,7 @@ class MachO::MachOFile # @return [Boolean] whether or not the file is of type `MH_KEXT_BUNDLE` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def kext?(*args, **_arg1, &block); end # All shared libraries linked to the Mach-O. @@ -3276,17 +3347,17 @@ class MachO::MachOFile # @return [Integer] the magic number # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def magic(*args, **_arg1, &block); end # @return [Boolean] true if the Mach-O has 32-bit magic, false otherwise # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def magic32?(*args, **_arg1, &block); end # @return [Boolean] true if the Mach-O has 64-bit magic, false otherwise # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def magic64?(*args, **_arg1, &block); end # @return [String] a string representation of the file's magic number @@ -3296,12 +3367,12 @@ class MachO::MachOFile # @return [Integer] the number of load commands in the Mach-O # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def ncmds(*args, **_arg1, &block); end # @return [Boolean] whether or not the file is of type `MH_OBJECT` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def object?(*args, **_arg1, &block); end # @return [Hash] any parser options that the instance was created with @@ -3321,7 +3392,7 @@ class MachO::MachOFile # @return [Boolean] whether or not the file is of type `MH_PRELOAD` # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def preload?(*args, **_arg1, &block); end # Replace a load command with another command in the Mach-O, preserving location. @@ -3369,7 +3440,7 @@ class MachO::MachOFile # @return [Integer] the size of all load commands, in bytes, in the Mach-O # - # source://forwardable/1.3.2/forwardable.rb#229 + # source://forwardable/1.3.3/forwardable.rb#231 def sizeofcmds(*args, **_arg1, &block); end # @return [Hash] a hash representation of this {MachOFile} @@ -3727,7 +3798,7 @@ end # Raised when a file's magic bytes are not valid Mach-O magic. # -# source://ruby-macho//lib/macho/exceptions.rb#46 +# source://ruby-macho//lib/macho/exceptions.rb#45 class MachO::MagicError < ::MachO::NotAMachOError # @param num [Integer] the unknown number # @return [MagicError] a new instance of MagicError @@ -3748,7 +3819,7 @@ class MachO::NotAMachOError < ::MachO::MachOError; end # Raised when a change at an offset is not valid. # -# source://ruby-macho//lib/macho/exceptions.rb#168 +# source://ruby-macho//lib/macho/exceptions.rb#167 class MachO::OffsetInsertionError < ::MachO::ModificationError # @param offset [Integer] the invalid offset # @return [OffsetInsertionError] a new instance of OffsetInsertionError @@ -3760,7 +3831,7 @@ end # Raised when a Mach-O file modification fails but can be recovered when # operating on multiple Mach-O slices of a fat binary in non-strict mode. # -# source://ruby-macho//lib/macho/exceptions.rb#22 +# source://ruby-macho//lib/macho/exceptions.rb#19 class MachO::RecoverableModificationError < ::MachO::ModificationError # @return [Integer, nil] The index of the Mach-O slice of a fat binary for # which modification failed or `nil` if not a fat binary. This is used to @@ -3784,7 +3855,7 @@ end # Raised when attempting to add an rpath that already exists. # -# source://ruby-macho//lib/macho/exceptions.rb#209 +# source://ruby-macho//lib/macho/exceptions.rb#208 class MachO::RpathExistsError < ::MachO::RecoverableModificationError # @param path [String] the extant path # @return [RpathExistsError] a new instance of RpathExistsError @@ -3795,7 +3866,7 @@ end # Raised when attempting to change an rpath that doesn't exist. # -# source://ruby-macho//lib/macho/exceptions.rb#201 +# source://ruby-macho//lib/macho/exceptions.rb#200 class MachO::RpathUnknownError < ::MachO::RecoverableModificationError # @param path [String] the unknown runtime path # @return [RpathUnknownError] a new instance of RpathUnknownError @@ -3866,7 +3937,7 @@ MachO::Sections::SECTION_TYPE_MASK = T.let(T.unsafe(nil), Integer) # Represents a section of a segment for 32-bit architectures. # -# source://ruby-macho//lib/macho/sections.rb#91 +# source://ruby-macho//lib/macho/sections.rb#90 class MachO::Sections::Section < ::MachO::MachOStructure # @return [Integer] the memory address of the section # @@ -3982,7 +4053,7 @@ end # Represents a section of a segment for 64-bit architectures. # -# source://ruby-macho//lib/macho/sections.rb#199 +# source://ruby-macho//lib/macho/sections.rb#198 class MachO::Sections::Section64 < ::MachO::Sections::Section # @return [Integer] the memory address of the section # @@ -4104,7 +4175,7 @@ end # Raised whenever unfinished code is called. # -# source://ruby-macho//lib/macho/exceptions.rb#217 +# source://ruby-macho//lib/macho/exceptions.rb#216 class MachO::UnimplementedError < ::MachO::MachOError # @param thing [String] the thing that is unimplemented # @return [UnimplementedError] a new instance of UnimplementedError diff --git a/Library/Homebrew/sorbet/rbi/gems/tapioca@0.14.2.rbi b/Library/Homebrew/sorbet/rbi/gems/tapioca@0.14.3.rbi similarity index 99% rename from Library/Homebrew/sorbet/rbi/gems/tapioca@0.14.2.rbi rename to Library/Homebrew/sorbet/rbi/gems/tapioca@0.14.3.rbi index 6ece0be3e376d7..7fdf9189aaa12f 100644 --- a/Library/Homebrew/sorbet/rbi/gems/tapioca@0.14.2.rbi +++ b/Library/Homebrew/sorbet/rbi/gems/tapioca@0.14.3.rbi @@ -232,7 +232,7 @@ class RBI::TypedParam < ::T::Struct const :type, ::String class << self - # source://sorbet-runtime/0.5.11375/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11394/lib/types/struct.rb#13 def inherited(s); end end end @@ -1150,7 +1150,7 @@ class Tapioca::ConfigHelper::ConfigError < ::T::Struct const :message_parts, T::Array[::Tapioca::ConfigHelper::ConfigErrorMessagePart] class << self - # source://sorbet-runtime/0.5.11375/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11394/lib/types/struct.rb#13 def inherited(s); end end end @@ -1161,7 +1161,7 @@ class Tapioca::ConfigHelper::ConfigErrorMessagePart < ::T::Struct const :colors, T::Array[::Symbol] class << self - # source://sorbet-runtime/0.5.11375/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11394/lib/types/struct.rb#13 def inherited(s); end end end @@ -2467,7 +2467,7 @@ class Tapioca::Loaders::Loader # @param engine [T.class_of(Rails::Engine)] # @return [Array] # - # source://sorbet-runtime/0.5.11375/lib/types/private/methods/_methods.rb#257 + # source://sorbet-runtime/0.5.11394/lib/types/private/methods/_methods.rb#257 def eager_load_paths(*args, **_arg1, &blk); end # source://tapioca//lib/tapioca/loaders/loader.rb#188 @@ -2575,19 +2575,19 @@ module Tapioca::RBIFilesHelper private - # source://tapioca//lib/tapioca/helpers/rbi_files_helper.rb#209 + # source://tapioca//lib/tapioca/helpers/rbi_files_helper.rb#223 sig { params(nodes: T::Array[::RBI::Node]).returns(T::Array[::RBI::Scope]) } def extract_empty_scopes(nodes); end - # source://tapioca//lib/tapioca/helpers/rbi_files_helper.rb#214 + # source://tapioca//lib/tapioca/helpers/rbi_files_helper.rb#228 sig { params(nodes: T::Array[::RBI::Node]).returns(T::Array[T.any(::RBI::Attr, ::RBI::Method)]) } def extract_methods_and_attrs(nodes); end - # source://tapioca//lib/tapioca/helpers/rbi_files_helper.rb#224 + # source://tapioca//lib/tapioca/helpers/rbi_files_helper.rb#238 sig { params(nodes: T::Array[::RBI::Node]).returns(T::Array[T.any(::RBI::Mixin, ::RBI::RequiresAncestor)]) } def extract_mixins(nodes); end - # source://tapioca//lib/tapioca/helpers/rbi_files_helper.rb#234 + # source://tapioca//lib/tapioca/helpers/rbi_files_helper.rb#248 sig do params( nodes: T::Array[T.any(::RBI::Attr, ::RBI::Method)] @@ -2595,7 +2595,7 @@ module Tapioca::RBIFilesHelper end def extract_nodes_with_sigs(nodes); end - # source://tapioca//lib/tapioca/helpers/rbi_files_helper.rb#202 + # source://tapioca//lib/tapioca/helpers/rbi_files_helper.rb#216 sig do params( nodes: T::Array[::RBI::Node], @@ -2605,7 +2605,7 @@ module Tapioca::RBIFilesHelper end def extract_shims_and_todos(nodes, shim_rbi_dir:, todo_rbi_file:); end - # source://tapioca//lib/tapioca/helpers/rbi_files_helper.rb#266 + # source://tapioca//lib/tapioca/helpers/rbi_files_helper.rb#280 sig { params(path: ::String).returns(::String) } def gem_name_from_rbi_path(path); end @@ -2617,7 +2617,7 @@ module Tapioca::RBIFilesHelper sig { params(nodes: T::Array[::RBI::Node], shim_rbi_dir: ::String, todo_rbi_file: ::String).returns(T::Boolean) } def shims_or_todos_have_duplicates?(nodes, shim_rbi_dir:, todo_rbi_file:); end - # source://tapioca//lib/tapioca/helpers/rbi_files_helper.rb#239 + # source://tapioca//lib/tapioca/helpers/rbi_files_helper.rb#253 sig { params(errors: T::Array[::Spoom::Sorbet::Errors::Error], gem_dir: ::String).void } def update_gem_rbis_strictnesses(errors, gem_dir); end end @@ -2743,7 +2743,7 @@ module Tapioca::Runtime; end # available, it implements finding the attached class of a singleton # class by iterating through ObjectSpace. module Tapioca::Runtime::AttachedClassOf - # source://tapioca//lib/tapioca/runtime/attached_class_of_legacy.rb#17 + # source://tapioca//lib/tapioca/runtime/attached_class_of_32.rb#14 sig { params(singleton_class: ::Class).returns(T.nilable(::Module)) } def attached_class_of(singleton_class); end end @@ -3375,7 +3375,7 @@ module Tapioca::Static::SymbolLoader # @return [Array] # - # source://sorbet-runtime/0.5.11375/lib/types/private/methods/_methods.rb#257 + # source://sorbet-runtime/0.5.11394/lib/types/private/methods/_methods.rb#257 def engines(*args, **_arg1, &blk); end # source://tapioca//lib/tapioca/static/symbol_loader.rb#82 @@ -3498,14 +3498,14 @@ class URI::Source < ::URI::File sig { params(v: T.nilable(::String)).returns(T::Boolean) } def check_host(v); end - # source://uri/0.12.1/uri/generic.rb#243 + # source://uri/0.13.0/uri/generic.rb#243 def gem_name; end # source://tapioca//lib/tapioca/helpers/source_uri.rb#25 sig { returns(T.nilable(::String)) } def gem_version; end - # source://uri/0.12.1/uri/generic.rb#283 + # source://uri/0.13.0/uri/generic.rb#283 def line_number; end # source://tapioca//lib/tapioca/helpers/source_uri.rb#51 diff --git a/Library/Homebrew/sorbet/rbi/gems/warning@1.3.0.rbi b/Library/Homebrew/sorbet/rbi/gems/warning@1.4.0.rbi similarity index 92% rename from Library/Homebrew/sorbet/rbi/gems/warning@1.3.0.rbi rename to Library/Homebrew/sorbet/rbi/gems/warning@1.4.0.rbi index b0cc819fe3dd37..cc47d5eff23ad8 100644 --- a/Library/Homebrew/sorbet/rbi/gems/warning@1.3.0.rbi +++ b/Library/Homebrew/sorbet/rbi/gems/warning@1.4.0.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `warning` gem. # Please instead update this file by running `bin/tapioca gem warning`. + # source://warning//lib/warning.rb#3 module Warning extend ::Warning @@ -28,17 +29,17 @@ module Warning::Processor # end # # Previous warning state restored when block exists # - # source://warning//lib/warning.rb#48 + # source://warning//lib/warning.rb#49 def clear; end # Deduplicate warnings, suppress warning messages if the same warning message # has already occurred. Note that this can lead to unbounded memory use # if unique warnings are generated. # - # source://warning//lib/warning.rb#79 + # source://warning//lib/warning.rb#80 def dedup; end - # source://warning//lib/warning.rb#83 + # source://warning//lib/warning.rb#84 def freeze; end # Ignore any warning messages matching the given regexp, if they @@ -81,7 +82,7 @@ module Warning::Processor # # Ignore all uninitialized instance variable and method redefined warnings in current file # Warning.ignore([:missing_ivar, :method_redefined], __FILE__) # - # source://warning//lib/warning.rb#128 + # source://warning//lib/warning.rb#129 def ignore(regexp, path = T.unsafe(nil)); end # Handle all warnings starting with the given path, instead of @@ -114,7 +115,7 @@ module Warning::Processor # /instance variable @\w+ not initialized/ => proc do |warning| # LOGGER.warning(warning) # end, - # /global variable `\$\w+' not initialized/ => proc do |warning| + # /global variable [`']\$\w+' not initialized/ => proc do |warning| # LOGGER.error(warning) # end # ) @@ -125,26 +126,26 @@ module Warning::Processor # # Warning.process(__FILE__, :missing_ivar=>:backtrace, :keyword_separation=>:raise) # - # source://warning//lib/warning.rb#179 + # source://warning//lib/warning.rb#180 def process(path = T.unsafe(nil), actions = T.unsafe(nil), &block); end - # source://warning//lib/warning.rb#220 + # source://warning//lib/warning.rb#221 def warn(str, category: T.unsafe(nil)); end private # Convert the given Regexp, Symbol, or Array of Symbols into a Regexp. # - # source://warning//lib/warning.rb#272 + # source://warning//lib/warning.rb#273 def convert_regexp(regexp); end - # source://warning//lib/warning.rb#285 + # source://warning//lib/warning.rb#286 def synchronize(&block); end end # Map of action symbols to procs that return the symbol # -# source://warning//lib/warning.rb#26 +# source://warning//lib/warning.rb#27 Warning::Processor::ACTION_PROC_MAP = T.let(T.unsafe(nil), Hash) # Map of symbols to regexps for warning messages to ignore. diff --git a/Library/Homebrew/sorbet/tapioca/config.yml b/Library/Homebrew/sorbet/tapioca/config.yml index 1f951da848ce7e..54d00d518c0a61 100644 --- a/Library/Homebrew/sorbet/tapioca/config.yml +++ b/Library/Homebrew/sorbet/tapioca/config.yml @@ -23,12 +23,9 @@ gem: - rspec-retry - rspec - rspec_junit_formatter - - rubocop-capybara - - rubocop-factory_bot - rubocop-md - rubocop-performance - rubocop-rspec - - rubocop-rspec_rails - rubocop-sorbet - ruby-prof - simplecov_json_formatter diff --git a/Library/Homebrew/standalone/init.rb b/Library/Homebrew/standalone/init.rb index 5d673bf8ef8613..a0dd6c0feae5e7 100644 --- a/Library/Homebrew/standalone/init.rb +++ b/Library/Homebrew/standalone/init.rb @@ -29,6 +29,7 @@ require "pathname" dir = __dir__ || raise("__dir__ is not defined") HOMEBREW_LIBRARY_PATH = Pathname(dir).parent.realpath.freeze +HOMEBREW_USING_PORTABLE_RUBY = RbConfig.ruby.include?("/vendor/portable-ruby/").freeze require_relative "../utils/gems" Homebrew.setup_gem_environment!(setup_path: false) @@ -39,14 +40,6 @@ ENV["HOMEBREW_SKIP_INITIAL_GEM_INSTALL"] = "1" end -if Pathname.new(RbConfig.ruby).to_s.include?("/vendor/portable-ruby/") - ruby_version = RbConfig::CONFIG["ruby_version"] - ruby_path = "#{RbConfig::CONFIG["rubylibprefix"]}/gems/#{ruby_version}" - - $LOAD_PATH.unshift "#{ruby_path}/extensions/#{Gem::Platform.local}/#{ruby_version}-static/debug-1.9.1" - $LOAD_PATH.unshift "#{ruby_path}/gems/debug-1.9.1/lib" -end - unless $LOAD_PATH.include?(HOMEBREW_LIBRARY_PATH.to_s) # Insert the path after any existing Homebrew paths (e.g. those inserted by tests and parent processes) last_homebrew_path_idx = $LOAD_PATH.rindex do |path| @@ -55,6 +48,7 @@ $LOAD_PATH.insert(last_homebrew_path_idx + 1, HOMEBREW_LIBRARY_PATH.to_s) end require_relative "../vendor/bundle/bundler/setup" +require "portable_ruby_gems" if HOMEBREW_USING_PORTABLE_RUBY $LOAD_PATH.unshift "#{HOMEBREW_LIBRARY_PATH}/vendor/bundle/#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/" \ "bundler-#{Homebrew::HOMEBREW_BUNDLER_VERSION}/lib" $LOAD_PATH.uniq! diff --git a/Library/Homebrew/startup/bootsnap.rb b/Library/Homebrew/startup/bootsnap.rb index e64fb36b227c7d..29bdd6983ea2dc 100644 --- a/Library/Homebrew/startup/bootsnap.rb +++ b/Library/Homebrew/startup/bootsnap.rb @@ -1,4 +1,4 @@ -# typed: true +# typed: strict # frozen_string_literal: true homebrew_bootsnap_enabled = ENV["HOMEBREW_NO_BOOTSNAP"].nil? && !ENV["HOMEBREW_BOOTSNAP"].nil? @@ -14,7 +14,7 @@ begin require "bootsnap" rescue LoadError - raise if ENV["HOMEBREW_BOOTSNAP_RETRY"] + raise if ENV["HOMEBREW_BOOTSNAP_RETRY"] || HOMEBREW_USING_PORTABLE_RUBY Homebrew.install_bundler_gems!(groups: ["bootsnap"], only_warn_on_failure: true) diff --git a/Library/Homebrew/startup/bootstrap.rbi b/Library/Homebrew/startup/bootstrap.rbi new file mode 100644 index 00000000000000..8a35aa087b5e9b --- /dev/null +++ b/Library/Homebrew/startup/bootstrap.rbi @@ -0,0 +1,28 @@ +# typed: strict + +module Bootsnap + sig { + params( + cache_dir: String, + development_mode: T::Boolean, + load_path_cache: T::Boolean, + ignore_directories: T.nilable(T::Array[String]), + readonly: T::Boolean, + revalidation: T::Boolean, + compile_cache_iseq: T::Boolean, + compile_cache_yaml: T::Boolean, + compile_cache_json: T::Boolean, + ).void + } + def self.setup( + cache_dir:, + development_mode: true, + load_path_cache: true, + ignore_directories: nil, + readonly: false, + revalidation: false, + compile_cache_iseq: true, + compile_cache_yaml: true, + compile_cache_json: true + ); end +end diff --git a/Library/Homebrew/style.rb b/Library/Homebrew/style.rb index 52c14b638f9e38..0f0dd36b96425e 100644 --- a/Library/Homebrew/style.rb +++ b/Library/Homebrew/style.rb @@ -44,11 +44,31 @@ def self.check_style_impl(files, output_type, debug: false, verbose: false) raise ArgumentError, "Invalid output type: #{output_type.inspect}" if [:print, :json].exclude?(output_type) - shell_files, ruby_files = - Array(files).map(&method(:Pathname)) - .partition { |f| f.realpath == HOMEBREW_BREW_FILE.realpath || f.extname == ".sh" } + ruby_files = T.let([], T::Array[Pathname]) + shell_files = T.let([], T::Array[Pathname]) + actionlint_files = T.let([], T::Array[Pathname]) + Array(files).map(&method(:Pathname)) + .each do |path| + case path.extname + when ".rb" + ruby_files << path + when ".sh" + shell_files << path + when ".yml" + actionlint_files << path if path.realpath.to_s.include?("/.github/workflows/") + else + ruby_files << path + shell_files += if [HOMEBREW_PREFIX, HOMEBREW_REPOSITORY].include?(path) + shell_scripts + else + path.glob("**/*.sh") + .reject { |path| path.to_s.include?("/vendor/") || path.directory? } + end + actionlint_files += (path/".github/workflows").glob("*.y{,a}ml") + end + end - rubocop_result = if shell_files.any? && ruby_files.none? + rubocop_result = if files.present? && ruby_files.empty? (output_type == :json) ? [] : true else run_rubocop(ruby_files, output_type, @@ -59,22 +79,28 @@ def self.check_style_impl(files, output_type, debug:, verbose:) end - shellcheck_result = if ruby_files.any? && shell_files.none? + shellcheck_result = if files.present? && shell_files.empty? (output_type == :json) ? [] : true else run_shellcheck(shell_files, output_type, fix:) end - shfmt_result = if ruby_files.any? && shell_files.none? + shfmt_result = if files.present? && shell_files.empty? true else run_shfmt(shell_files, fix:) end + actionlint_result = if files.present? && actionlint_files.empty? + true + else + run_actionlint(actionlint_files) + end + if output_type == :json Offenses.new(rubocop_result + shellcheck_result) else - rubocop_result && shellcheck_result && shfmt_result + rubocop_result && shellcheck_result && shfmt_result && actionlint_result end end @@ -125,8 +151,8 @@ def self.run_rubocop(files, output_type, files&.map!(&:expand_path) if files.blank? || files == [HOMEBREW_REPOSITORY] files = [HOMEBREW_LIBRARY_PATH] - elsif files.any? { |f| f.to_s.start_with? HOMEBREW_REPOSITORY/"docs" } - args << "--config" << (HOMEBREW_REPOSITORY/"docs/.rubocop.yml") + elsif files.any? { |f| f.to_s.start_with?(HOMEBREW_REPOSITORY/"docs") || (f.basename.to_s == "docs") } + args << "--config" << (HOMEBREW_REPOSITORY/"docs/docs_rubocop_style.yml") elsif files.none? { |f| f.to_s.start_with? HOMEBREW_LIBRARY_PATH } args << "--config" << (HOMEBREW_LIBRARY/".rubocop.yml") end @@ -242,6 +268,17 @@ def self.run_shfmt(files, fix: false) $CHILD_STATUS.success? end + def self.run_actionlint(files) + files = github_workflow_files if files.blank? + # the ignore is to avoid false positives in e.g. actions, homebrew-test-bot + system actionlint, "-shellcheck", shellcheck, + "-config-file", HOMEBREW_REPOSITORY/".github/actionlint.yaml", + "-ignore", "image: string; options: string", + "-ignore", "label .* is unknown", + *files + $CHILD_STATUS.success? + end + def self.json_result!(result) # An exit status of 1 just means violations were found; other numbers mean # execution errors. @@ -270,6 +307,15 @@ def self.shell_scripts ] end + def self.github_workflow_files + HOMEBREW_REPOSITORY.glob(".github/workflows/*.yml") + end + + def self.rubocop + ensure_formula_installed!("rubocop", latest: true, + reason: "Ruby style checks").opt_bin/"rubocop" + end + def self.shellcheck ensure_formula_installed!("shellcheck", latest: true, reason: "shell style checks").opt_bin/"shellcheck" @@ -281,6 +327,11 @@ def self.shfmt HOMEBREW_LIBRARY/"Homebrew/utils/shfmt.sh" end + def self.actionlint + ensure_formula_installed!("actionlint", latest: true, + reason: "GitHub Actions checks").opt_bin/"actionlint" + end + # Collection of style offenses. class Offenses include Enumerable diff --git a/Library/Homebrew/tap.rb b/Library/Homebrew/tap.rb index 6a0dfd7ec599ee..d04fdec0c7b9c4 100644 --- a/Library/Homebrew/tap.rb +++ b/Library/Homebrew/tap.rb @@ -9,10 +9,10 @@ # A {Tap} is used to extend the formulae provided by Homebrew core. # Usually, it's synced with a remote Git repository. And it's likely -# a GitHub repository with the name of `user/homebrew-repo`. In such -# cases, `user/repo` will be used as the {#name} of this {Tap}, where -# {#user} represents the GitHub username and {#repo} represents the repository -# name without the leading `homebrew-`. +# a GitHub repository with the name of `user/homebrew-repository`. In such +# cases, `user/repository` will be used as the {#name} of this {Tap}, where +# {#user} represents the GitHub username and {#repository} represents the +# repository name without the leading `homebrew-`. class Tap extend Cachable @@ -160,11 +160,13 @@ def self.forbidden_taps # The repository name of this {Tap} without the leading `homebrew-`. # # @api public - attr_reader :repo + attr_reader :repository + # odeprecated: use repository instead. + alias repo repository - # The name of this {Tap}. It combines {#user} and {#repo} with a slash. + # The name of this {Tap}. It combines {#user} and {#repository} with a slash. # {#name} is always in lowercase. - # e.g. `user/repo` + # e.g. `user/repository` # # @api public attr_reader :name @@ -174,14 +176,14 @@ def self.forbidden_taps def to_s = name # The full name of this {Tap}, including the `homebrew-` prefix. - # It combines {#user} and 'homebrew-'-prefixed {#repo} with a slash. - # e.g. `user/homebrew-repo` + # It combines {#user} and 'homebrew-'-prefixed {#repository} with a slash. + # e.g. `user/homebrew-repository` # # @api public attr_reader :full_name # The local path to this {Tap}. - # e.g. `/usr/local/Library/Taps/user/homebrew-repo` + # e.g. `/usr/local/Library/Taps/user/homebrew-repository` # # @api public sig { returns(Pathname) } @@ -189,24 +191,24 @@ def to_s = name # The git repository of this {Tap}. sig { returns(GitRepository) } - attr_reader :git_repo + attr_reader :git_repository # Always use `Tap.fetch` instead of `Tap.new`. private_class_method :new - def initialize(user, repo) + def initialize(user, repository) @user = user - @repo = repo - @name = "#{@user}/#{@repo}".downcase - @full_name = "#{@user}/homebrew-#{@repo}" + @repository = repository + @name = "#{@user}/#{@repository}".downcase + @full_name = "#{@user}/homebrew-#{@repository}" @path = TAP_DIRECTORY/@full_name.downcase - @git_repo = GitRepository.new(@path) + @git_repository = GitRepository.new(@path) end # Clear internal cache. def clear_cache @remote = nil - @repo_var_suffix = nil + @repository_var_suffix = nil remove_instance_variable(:@private) if instance_variable_defined?(:@private) @formula_dir = nil @@ -253,17 +255,17 @@ def ensure_installed! end # The remote path to this {Tap}. - # e.g. `https://github.com/user/homebrew-repo` + # e.g. `https://github.com/user/homebrew-repository` # # @api public def remote return default_remote unless installed? - @remote ||= git_repo.origin_url + @remote ||= git_repository.origin_url end # The remote repository name of this {Tap}. - # e.g. `user/homebrew-repo` + # e.g. `user/homebrew-repository` # # @api public sig { returns(T.nilable(String)) } @@ -282,18 +284,20 @@ def default_remote end sig { returns(String) } - def repo_var_suffix - @repo_var_suffix ||= path.to_s - .delete_prefix(TAP_DIRECTORY.to_s) - .tr("^A-Za-z0-9", "_") - .upcase + def repository_var_suffix + @repository_var_suffix ||= path.to_s + .delete_prefix(TAP_DIRECTORY.to_s) + .tr("^A-Za-z0-9", "_") + .upcase end + # odeprecated: use repository_var_suffix instead. + alias repo_var_suffix repository_var_suffix # Check whether this {Tap} is a Git repository. # # @api public def git? - git_repo.git_repo? + git_repository.git_repository? end # Git branch for this {Tap}. @@ -302,7 +306,7 @@ def git? def git_branch raise TapUnavailableError, name unless installed? - git_repo.branch_name + git_repository.branch_name end # Git HEAD for this {Tap}. @@ -311,7 +315,7 @@ def git_branch def git_head raise TapUnavailableError, name unless installed? - @git_head ||= git_repo.head_ref + @git_head ||= git_repository.head_ref end # Time since last git commit for this {Tap}. @@ -320,7 +324,7 @@ def git_head def git_last_commit raise TapUnavailableError, name unless installed? - git_repo.last_committed + git_repository.last_committed end # The issues URL of this {Tap}. @@ -564,22 +568,22 @@ def fix_remote_configuration(requested_remote: nil, quiet: false) end return unless remote - current_upstream_head = T.must(git_repo.origin_branch_name) - return if requested_remote.blank? && git_repo.origin_has_branch?(current_upstream_head) + current_upstream_head = T.must(git_repository.origin_branch_name) + return if requested_remote.blank? && git_repository.origin_has_branch?(current_upstream_head) args = %w[fetch] args << "--quiet" if quiet args << "origin" args << "+refs/heads/*:refs/remotes/origin/*" safe_system "git", "-C", path, *args - git_repo.set_head_origin_auto + git_repository.set_head_origin_auto - new_upstream_head = T.must(git_repo.origin_branch_name) + new_upstream_head = T.must(git_repository.origin_branch_name) return if new_upstream_head == current_upstream_head safe_system "git", "-C", path, "config", "remote.origin.fetch", "+refs/heads/*:refs/remotes/origin/*" - git_repo.rename_branch old: current_upstream_head, new: new_upstream_head - git_repo.set_upstream_branch local: new_upstream_head, origin: new_upstream_head + git_repository.rename_branch old: current_upstream_head, new: new_upstream_head + git_repository.set_upstream_branch local: new_upstream_head, origin: new_upstream_head return if quiet diff --git a/Library/Homebrew/test/attestation_spec.rb b/Library/Homebrew/test/attestation_spec.rb index a6a37bfb616f73..097861eff523f3 100644 --- a/Library/Homebrew/test/attestation_spec.rb +++ b/Library/Homebrew/test/attestation_spec.rb @@ -8,10 +8,20 @@ let(:fake_error_status) { instance_double(Process::Status, exitstatus: 1, termsig: nil) } let(:fake_auth_status) { instance_double(Process::Status, exitstatus: 4, termsig: nil) } let(:cached_download) { "/fake/cached/download" } - let(:fake_bottle_filename) { instance_double(Bottle::Filename, to_s: "fakebottle--1.0.faketag.bottle.tar.gz") } + let(:fake_bottle_filename) do + instance_double(Bottle::Filename, name: "fakebottle", version: "1.0", + to_s: "fakebottle--1.0.faketag.bottle.tar.gz") + end let(:fake_bottle_url) { "https://example.com/#{fake_bottle_filename}" } + let(:fake_bottle_tag) { instance_double(Utils::Bottles::Tag, to_sym: :faketag) } + let(:fake_all_bottle_tag) { instance_double(Utils::Bottles::Tag, to_sym: :all) } let(:fake_bottle) do - instance_double(Bottle, cached_download:, filename: fake_bottle_filename, url: fake_bottle_url) + instance_double(Bottle, cached_download:, filename: fake_bottle_filename, url: fake_bottle_url, + tag: fake_bottle_tag) + end + let(:fake_all_bottle) do + instance_double(Bottle, cached_download:, filename: fake_bottle_filename, url: fake_bottle_url, + tag: fake_all_bottle_tag) end let(:fake_result_invalid_json) { instance_double(SystemCommand::Result, stdout: "\"invalid JSON") } let(:fake_result_json_resp) do @@ -143,6 +153,19 @@ described_class::HOMEBREW_CORE_REPO end.to raise_error(described_class::InvalidAttestationError) end + + it "checks subject prefix when the bottle is an :all bottle" do + expect(GitHub::API).to receive(:credentials) + .and_return(fake_gh_creds) + + expect(described_class).to receive(:system_command!) + .with(fake_gh, args: ["attestation", "verify", cached_download, "--repo", + described_class::HOMEBREW_CORE_REPO, "--format", "json"], + env: { "GH_TOKEN" => fake_gh_creds }, secrets: [fake_gh_creds]) + .and_return(fake_result_json_resp) + + described_class.check_attestation fake_all_bottle, described_class::HOMEBREW_CORE_REPO + end end describe "::check_core_attestation" do diff --git a/Library/Homebrew/test/cask/audit_spec.rb b/Library/Homebrew/test/cask/audit_spec.rb index 72a330e61d68f7..6da7326f7fdf94 100644 --- a/Library/Homebrew/test/cask/audit_spec.rb +++ b/Library/Homebrew/test/cask/audit_spec.rb @@ -932,17 +932,21 @@ def tmp_cask(name, text) it { is_expected.not_to error_with(message) } end + end - context "with incorrect OSDN URL format" do - let(:cask_token) { "osdn-incorrect-url-format" } + describe "disable OSDN download url" do + let(:only) { ["download_url_is_osdn"] } + let(:message) { /OSDN download urls are disabled./ } + let(:cask_token) { "osdn-urls" } - it { is_expected.to error_with(message) } + context "when --strict is not passed" do + it { is_expected.not_to error_with(message) } end - context "with correct OSDN URL format" do - let(:cask_token) { "osdn-correct-url-format" } + context "when --strict is passed" do + let(:strict) { true } - it { is_expected.not_to error_with(message) } + it { is_expected.to error_with(message) } end end diff --git a/Library/Homebrew/test/cask/cask_loader_spec.rb b/Library/Homebrew/test/cask/cask_loader_spec.rb index 62be102cea7b34..c867e0b32276c0 100644 --- a/Library/Homebrew/test/cask/cask_loader_spec.rb +++ b/Library/Homebrew/test/cask/cask_loader_spec.rb @@ -82,6 +82,41 @@ (old_tap.path/"tap_migrations.json").write tap_migrations.to_json end + context "to a cask in an other tap" do + # Can't use local-caffeine. It is a fixture in the :core_cask_tap and would take precendence over :new_tap. + let(:token) { "some-cask" } + + let(:old_tap) { Tap.fetch("homebrew", "foo") } + let(:new_tap) { Tap.fetch("homebrew", "bar") } + + let(:cask_file) { new_tap.cask_dir/"#{token}.rb" } + + before do + new_tap.cask_dir.mkpath + FileUtils.touch cask_file + end + + # FIXME + # It would be preferable not to print a warning when installing with the short token + it "warns when loading the short token" do + expect do + described_class.for(token) + end.to output(%r{Cask #{old_tap}/#{token} was renamed to #{new_tap}/#{token}\.}).to_stderr + end + + it "does not warn when loading the full token in the new tap" do + expect do + described_class.for("#{new_tap}/#{token}") + end.not_to output.to_stderr + end + + it "warns when loading the full token in the old tap" do + expect do + described_class.for("#{old_tap}/#{token}") + end.to output(%r{Cask #{old_tap}/#{token} was renamed to #{new_tap}/#{token}\.}).to_stderr + end + end + context "to a formula in the default tap" do let(:old_tap) { core_cask_tap } let(:new_tap) { core_tap } diff --git a/Library/Homebrew/test/cmd/autoremove_spec.rb b/Library/Homebrew/test/cmd/autoremove_spec.rb index db0a80e62161e2..07b29812107b3c 100644 --- a/Library/Homebrew/test/cmd/autoremove_spec.rb +++ b/Library/Homebrew/test/cmd/autoremove_spec.rb @@ -11,13 +11,18 @@ let(:unused_formula) { Formula["testball2"] } before do + # Make testball1 poured from a bottle install_test_formula "testball1" - install_test_formula "testball2" + tab = Tab.for_name("testball1") + tab.poured_from_bottle = true + tab.write - # Make testball2 an unused dependency + # Make testball2 poured from a bottle and an unused dependency + install_test_formula "testball2" tab = Tab.for_name("testball2") tab.installed_on_request = false tab.installed_as_dependency = true + tab.poured_from_bottle = true tab.write end diff --git a/Library/Homebrew/test/cmd/tab_spec.rb b/Library/Homebrew/test/cmd/tab_spec.rb new file mode 100644 index 00000000000000..db67e2ed9b43d5 --- /dev/null +++ b/Library/Homebrew/test/cmd/tab_spec.rb @@ -0,0 +1,33 @@ +# frozen_string_literal: true + +require "cmd/tab" +require "cmd/shared_examples/args_parse" +require "tab" + +RSpec.describe Homebrew::Cmd::TabCmd do + def installed_on_request?(formula) + # `brew` subprocesses can change the tab, invalidating the cached values. + Tab.clear_cache + Tab.for_formula(formula).installed_on_request + end + + it_behaves_like "parseable arguments" + + it "marks or unmarks a formula as installed on request", :integration_test do + setup_test_formula "foo", + tab_attributes: { "installed_on_request" => false } + foo = Formula["foo"] + + expect { brew "tab", "--installed-on-request", "foo" } + .to be_a_success + .and output(/foo is now marked as installed on request/).to_stdout + .and not_to_output.to_stderr + expect(installed_on_request?(foo)).to be true + + expect { brew "tab", "--no-installed-on-request", "foo" } + .to be_a_success + .and output(/foo is now marked as not installed on request/).to_stdout + .and not_to_output.to_stderr + expect(installed_on_request?(foo)).to be false + end +end diff --git a/Library/Homebrew/test/dev-cmd/determine-test-runners_spec.rb b/Library/Homebrew/test/dev-cmd/determine-test-runners_spec.rb index 75125ecfb2a499..32cd05b0c1d964 100644 --- a/Library/Homebrew/test/dev-cmd/determine-test-runners_spec.rb +++ b/Library/Homebrew/test/dev-cmd/determine-test-runners_spec.rb @@ -22,9 +22,9 @@ def get_runners(file) let(:ephemeral_suffix) { "-12345" } let(:runner_env) do { - "HOMEBREW_LINUX_RUNNER" => linux_runner, - "HOMEBREW_MACOS_TIMEOUT" => "90", - "GITHUB_RUN_ID" => ephemeral_suffix.split("-").second, + "HOMEBREW_LINUX_RUNNER" => linux_runner, + "HOMEBREW_MACOS_LONG_TIMEOUT" => "false", + "GITHUB_RUN_ID" => ephemeral_suffix.split("-").second, }.freeze end let(:all_runners) do diff --git a/Library/Homebrew/test/dev-cmd/pr-pull_spec.rb b/Library/Homebrew/test/dev-cmd/pr-pull_spec.rb index 8850c1cb989cd3..777d4c25b5c6a6 100644 --- a/Library/Homebrew/test/dev-cmd/pr-pull_spec.rb +++ b/Library/Homebrew/test/dev-cmd/pr-pull_spec.rb @@ -99,8 +99,8 @@ class Foo < Formula File.write(formula_file, formula_version) safe_system Utils::Git.git, "commit", formula_file, "-m", "version", "--author=#{secondary_author}" pr_pull.autosquash!(original_hash, tap:) - expect(tap.git_repo.commit_message).to include("foo 2.0") - expect(tap.git_repo.commit_message).to include("Co-authored-by: #{secondary_author}") + expect(tap.git_repository.commit_message).to include("foo 2.0") + expect(tap.git_repository.commit_message).to include("Co-authored-by: #{secondary_author}") end (path/"Casks").mkpath @@ -130,8 +130,8 @@ class Foo < Formula safe_system Utils::Git.git, "add", formula_file safe_system Utils::Git.git, "commit", "-m", "foo 1.0 (new formula)" end - pr_pull.signoff!(tap.git_repo) - expect(tap.git_repo.commit_message).to include("Signed-off-by:") + pr_pull.signoff!(tap.git_repository) + expect(tap.git_repository.commit_message).to include("Signed-off-by:") (path/"Casks").mkpath cask_file.write(cask) @@ -139,8 +139,8 @@ class Foo < Formula safe_system Utils::Git.git, "add", cask_file safe_system Utils::Git.git, "commit", "-m", "food 1.0 (new cask)" end - pr_pull.signoff!(tap.git_repo) - expect(tap.git_repo.commit_message).to include("Signed-off-by:") + pr_pull.signoff!(tap.git_repository) + expect(tap.git_repository.commit_message).to include("Signed-off-by:") end end diff --git a/Library/Homebrew/test/download_strategies/curl_github_packages_spec.rb b/Library/Homebrew/test/download_strategies/curl_github_packages_spec.rb index 0828ee26c685cf..07d7d7ada1a012 100644 --- a/Library/Homebrew/test/download_strategies/curl_github_packages_spec.rb +++ b/Library/Homebrew/test/download_strategies/curl_github_packages_spec.rb @@ -56,7 +56,7 @@ strategy.fetch end - context "with Github Packages authentication defined" do + context "with GitHub Packages authentication defined" do let(:authorization) { "Bearer dead-beef-cafe" } it "calls curl with the provided header value" do diff --git a/Library/Homebrew/test/formula_auditor_spec.rb b/Library/Homebrew/test/formula_auditor_spec.rb index f8103cda3eb736..cb52b57c580f86 100644 --- a/Library/Homebrew/test/formula_auditor_spec.rb +++ b/Library/Homebrew/test/formula_auditor_spec.rb @@ -281,7 +281,7 @@ class Foo < Formula end it "checks online and verifies that a standard license id is the same " \ - "as what is indicated on its Github repo", :needs_network do + "as what is indicated on its GitHub repo", :needs_network do formula_text = <<~RUBY class Cask < Formula url "https://github.com/cask/cask/archive/v0.8.4.tar.gz" @@ -297,7 +297,7 @@ class Cask < Formula end it "checks online and verifies that a standard license id with AND is the same " \ - "as what is indicated on its Github repo", :needs_network do + "as what is indicated on its GitHub repo", :needs_network do formula_text = <<~RUBY class Cask < Formula url "https://github.com/cask/cask/archive/v0.8.4.tar.gz" @@ -313,7 +313,7 @@ class Cask < Formula end it "checks online and verifies that a standard license id with WITH is the same " \ - "as what is indicated on its Github repo", :needs_network do + "as what is indicated on its GitHub repo", :needs_network do formula_text = <<~RUBY class Cask < Formula url "https://github.com/cask/cask/archive/v0.8.4.tar.gz" @@ -395,7 +395,7 @@ class Cask < Formula end it "checks online and detects that a formula-specified license is not " \ - "the same as what is indicated on its Github repository", :needs_network do + "the same as what is indicated on its GitHub repository", :needs_network do formula_text = <<~RUBY class Cask < Formula url "https://github.com/cask/cask/archive/v0.8.4.tar.gz" @@ -429,7 +429,7 @@ class Cask < Formula end it "checks online and detects that an array of license does not contain " \ - "what is indicated on its Github repository", :needs_network do + "what is indicated on its GitHub repository", :needs_network do formula_text = <<~RUBY class Cask < Formula url "https://github.com/cask/cask/archive/v0.8.4.tar.gz" @@ -446,7 +446,7 @@ class Cask < Formula end it "checks online and verifies that an array of license contains " \ - "what is indicated on its Github repository", :needs_network do + "what is indicated on its GitHub repository", :needs_network do formula_text = <<~RUBY class Cask < Formula url "https://github.com/cask/cask/archive/v0.8.4.tar.gz" diff --git a/Library/Homebrew/test/formulary_spec.rb b/Library/Homebrew/test/formulary_spec.rb index 6b53acf40c6e74..e5293ffc7a42c0 100644 --- a/Library/Homebrew/test/formulary_spec.rb +++ b/Library/Homebrew/test/formulary_spec.rb @@ -641,6 +641,45 @@ def formula_json_contents(extra_items = {}) # end # end end + + context "to a third-party tap" do + let(:old_tap) { Tap.fetch("another", "foo") } + let(:new_tap) { Tap.fetch("another", "bar") } + let(:formula_file) { new_tap.formula_dir/"#{token}.rb" } + + before do + new_tap.formula_dir.mkpath + FileUtils.touch formula_file + end + + after do + FileUtils.rm_rf Tap::TAP_DIRECTORY/"another" + end + + # FIXME + # It would be preferable not to print a warning when installing with the short token + it "warns when loading the short token" do + expect do + described_class.loader_for(token) + end.to output( + a_string_including("Formula #{old_tap}/#{token} was renamed to #{new_tap}/#{token}.").once, + ).to_stderr + end + + it "does not warn when loading the full token in the new tap" do + expect do + described_class.loader_for("#{new_tap}/#{token}") + end.not_to output.to_stderr + end + + it "warns when loading the full token in the old tap" do + expect do + described_class.loader_for("#{old_tap}/#{token}") + end.to output( + a_string_including("Formula #{old_tap}/#{token} was renamed to #{new_tap}/#{token}.").once, + ).to_stderr + end + end end end end diff --git a/Library/Homebrew/test/github_runner_matrix_spec.rb b/Library/Homebrew/test/github_runner_matrix_spec.rb index 01bed6f6089887..99f457e01ec1bc 100644 --- a/Library/Homebrew/test/github_runner_matrix_spec.rb +++ b/Library/Homebrew/test/github_runner_matrix_spec.rb @@ -6,7 +6,7 @@ RSpec.describe GitHubRunnerMatrix do before do allow(ENV).to receive(:fetch).with("HOMEBREW_LINUX_RUNNER").and_return("ubuntu-latest") - allow(ENV).to receive(:fetch).with("HOMEBREW_MACOS_TIMEOUT").and_return("90") + allow(ENV).to receive(:fetch).with("HOMEBREW_MACOS_LONG_TIMEOUT", "false").and_return("false") allow(ENV).to receive(:fetch).with("HOMEBREW_MACOS_BUILD_ON_GITHUB_RUNNER", "false").and_return("false") allow(ENV).to receive(:fetch).with("GITHUB_RUN_ID").and_return("12345") end diff --git a/Library/Homebrew/test/livecheck/strategy/github_latest_spec.rb b/Library/Homebrew/test/livecheck/strategy/github_latest_spec.rb index 0a14f238de2370..f527b96c68a8a5 100644 --- a/Library/Homebrew/test/livecheck/strategy/github_latest_spec.rb +++ b/Library/Homebrew/test/livecheck/strategy/github_latest_spec.rb @@ -54,7 +54,7 @@ expect(github_latest.generate_input_values(github_urls[:repository_upload])).to eq(generated) end - it "returns an empty hash for a non-Github URL" do + it "returns an empty hash for a non-GitHub URL" do expect(github_latest.generate_input_values(non_github_url)).to eq({}) end end diff --git a/Library/Homebrew/test/livecheck/strategy/github_releases_spec.rb b/Library/Homebrew/test/livecheck/strategy/github_releases_spec.rb index d9dd1897a47695..8b9effa65b2229 100644 --- a/Library/Homebrew/test/livecheck/strategy/github_releases_spec.rb +++ b/Library/Homebrew/test/livecheck/strategy/github_releases_spec.rb @@ -114,7 +114,7 @@ expect(github_releases.generate_input_values(github_urls[:repository_upload])).to eq(generated) end - it "returns an empty hash for a non-Github URL" do + it "returns an empty hash for a non-GitHub URL" do expect(github_releases.generate_input_values(non_github_url)).to eq({}) end end diff --git a/Library/Homebrew/test/macos_version_spec.rb b/Library/Homebrew/test/macos_version_spec.rb index e4de970bd54567..826059ecb9addc 100644 --- a/Library/Homebrew/test/macos_version_spec.rb +++ b/Library/Homebrew/test/macos_version_spec.rb @@ -80,6 +80,10 @@ expect(described_class.new("10.14").pretty_name).to eq("Mojave") end + specify "#inspect" do + expect(described_class.new("11").inspect).to eq("#") + end + specify "#requires_nehalem_cpu?", :needs_macos do expect(Hardware::CPU).to receive(:type).at_least(:twice).and_return(:intel) expect(described_class.new("10.14").requires_nehalem_cpu?).to be true diff --git a/Library/Homebrew/test/requirements/macos_requirement_spec.rb b/Library/Homebrew/test/requirements/macos_requirement_spec.rb index 5d8101219376c6..d18e95feced81f 100644 --- a/Library/Homebrew/test/requirements/macos_requirement_spec.rb +++ b/Library/Homebrew/test/requirements/macos_requirement_spec.rb @@ -5,6 +5,8 @@ RSpec.describe MacOSRequirement do subject(:requirement) { described_class.new } + let(:big_sur_major) { MacOSVersion.new("11.0") } + describe "#satisfied?" do it "returns true on macOS" do expect(requirement.satisfied?).to eq OS.mac? @@ -20,4 +22,15 @@ expect(requirement.satisfied?).to eq MacOS.version <= :catalina end end + + specify "#allows?" do + max_requirement = described_class.new([:mojave], comparator: "<=") + min_requirement = described_class.new([:catalina], comparator: ">=") + exact_requirement = described_class.new([:big_sur], comparator: "==") + range_requirement = described_class.new([[:monterey, :big_sur]], comparator: "==") + expect(max_requirement.allows?(big_sur_major)).to be false + expect(min_requirement.allows?(big_sur_major)).to be true + expect(exact_requirement.allows?(big_sur_major)).to be true + expect(range_requirement.allows?(big_sur_major)).to be true + end end diff --git a/Library/Homebrew/test/rubocops/cask/homepage_url_trailing_slash_spec.rb b/Library/Homebrew/test/rubocops/cask/homepage_url_styling_spec.rb similarity index 91% rename from Library/Homebrew/test/rubocops/cask/homepage_url_trailing_slash_spec.rb rename to Library/Homebrew/test/rubocops/cask/homepage_url_styling_spec.rb index a89971b68a4c58..28b4978856326a 100644 --- a/Library/Homebrew/test/rubocops/cask/homepage_url_trailing_slash_spec.rb +++ b/Library/Homebrew/test/rubocops/cask/homepage_url_styling_spec.rb @@ -2,7 +2,7 @@ require "rubocops/rubocop-cask" -RSpec.describe RuboCop::Cop::Cask::HomepageUrlTrailingSlash, :config do +RSpec.describe RuboCop::Cop::Cask::HomepageUrlStyling, :config do it "accepts a homepage URL ending with a slash" do expect_no_offenses <<~CASK cask 'foo' do diff --git a/Library/Homebrew/test/sorbet/tapioca/config_spec.rb b/Library/Homebrew/test/sorbet/tapioca/config_spec.rb index 3fb51016183aa7..bb37b78ad8b304 100644 --- a/Library/Homebrew/test/sorbet/tapioca/config_spec.rb +++ b/Library/Homebrew/test/sorbet/tapioca/config_spec.rb @@ -1,6 +1,6 @@ # frozen_string_literal: true -require "rubygems" +require "bundler" require "yaml" RSpec.describe "Tapioca Config", type: :system do @@ -8,7 +8,11 @@ it "only excludes dependencies" do exclusions = config.dig("gem", "exclude") - dependencies = Gem::Specification.all.map(&:name) + dependencies = Bundler::Definition.build( + HOMEBREW_LIBRARY_PATH/"Gemfile", + HOMEBREW_LIBRARY_PATH/"Gemfile.lock", + false, + ).resolve.names expect(exclusions - dependencies).to be_empty end end diff --git a/Library/Homebrew/test/support/fixtures/bottles/testball_bottle-0.1.arm64_sequoia.bottle.tar.gz b/Library/Homebrew/test/support/fixtures/bottles/testball_bottle-0.1.arm64_sequoia.bottle.tar.gz new file mode 120000 index 00000000000000..3e989830ba206a --- /dev/null +++ b/Library/Homebrew/test/support/fixtures/bottles/testball_bottle-0.1.arm64_sequoia.bottle.tar.gz @@ -0,0 +1 @@ +testball_bottle-0.1.yosemite.bottle.tar.gz \ No newline at end of file diff --git a/Library/Homebrew/test/support/fixtures/bottles/testball_bottle-0.1.sequoia.bottle.tar.gz b/Library/Homebrew/test/support/fixtures/bottles/testball_bottle-0.1.sequoia.bottle.tar.gz new file mode 120000 index 00000000000000..3e989830ba206a --- /dev/null +++ b/Library/Homebrew/test/support/fixtures/bottles/testball_bottle-0.1.sequoia.bottle.tar.gz @@ -0,0 +1 @@ +testball_bottle-0.1.yosemite.bottle.tar.gz \ No newline at end of file diff --git a/Library/Homebrew/test/support/fixtures/cask/Casks/osdn-incorrect-url-format.rb b/Library/Homebrew/test/support/fixtures/cask/Casks/osdn-incorrect-url-format.rb deleted file mode 100644 index 10a36d10cc58d8..00000000000000 --- a/Library/Homebrew/test/support/fixtures/cask/Casks/osdn-incorrect-url-format.rb +++ /dev/null @@ -1,6 +0,0 @@ -cask "osdn-incorrect-url-format" do - version "1.2.3" - - url "https://osdn.jp/projects/something/files/Something-1.2.3.dmg/download" - homepage "https://osdn.jp/projects/something/" -end diff --git a/Library/Homebrew/test/support/fixtures/cask/Casks/osdn-correct-url-format.rb b/Library/Homebrew/test/support/fixtures/cask/Casks/osdn-urls.rb similarity index 80% rename from Library/Homebrew/test/support/fixtures/cask/Casks/osdn-correct-url-format.rb rename to Library/Homebrew/test/support/fixtures/cask/Casks/osdn-urls.rb index c80bdacf6d3ebf..569859db53c50d 100644 --- a/Library/Homebrew/test/support/fixtures/cask/Casks/osdn-correct-url-format.rb +++ b/Library/Homebrew/test/support/fixtures/cask/Casks/osdn-urls.rb @@ -1,4 +1,4 @@ -cask "osdn-correct-url-format" do +cask "osdn-urls" do version "1.2.3" url "https://user.dl.osdn.jp/something/id/Something-1.2.3.dmg" diff --git a/Library/Homebrew/test/support/helper/spec/shared_context/integration_test.rb b/Library/Homebrew/test/support/helper/spec/shared_context/integration_test.rb index fbc361dd0e760c..c11c4e4d4df9da 100644 --- a/Library/Homebrew/test/support/helper/spec/shared_context/integration_test.rb +++ b/Library/Homebrew/test/support/helper/spec/shared_context/integration_test.rb @@ -129,7 +129,8 @@ def brew_sh(*args) end end - def setup_test_formula(name, content = nil, tap: CoreTap.instance, bottle_block: nil) + def setup_test_formula(name, content = nil, tap: CoreTap.instance, + bottle_block: nil, tab_attributes: nil) case name when /^testball/ tarball = if OS.linux? @@ -174,8 +175,8 @@ def install RUBY end - Formulary.find_formula_in_tap(name.downcase, tap).tap do |formula_path| - formula_path.write <<~RUBY + formula_path = Formulary.find_formula_in_tap(name.downcase, tap).tap do |path| + path.write <<~RUBY class #{Formulary.class_s(name)} < Formula #{content.gsub(/^(?!$)/, " ")} end @@ -183,6 +184,20 @@ class #{Formulary.class_s(name)} < Formula tap.clear_cache end + + return formula_path if tab_attributes.nil? + + keg = Formula[name].prefix + keg.mkpath + + tab = Tab.for_name(name) + tab.tabfile ||= keg/Tab::FILENAME + tab_attributes.each do |key, value| + tab.instance_variable_set(:"@#{key}", value) + end + tab.write + + formula_path end def install_test_formula(name, content = nil, build_bottle: false) diff --git a/Library/Homebrew/test/utils/autoremove_spec.rb b/Library/Homebrew/test/utils/autoremove_spec.rb index da67a09c0dd6d9..d1be63a7dd1fa4 100644 --- a/Library/Homebrew/test/utils/autoremove_spec.rb +++ b/Library/Homebrew/test/utils/autoremove_spec.rb @@ -61,7 +61,7 @@ end end - describe "::formulae_with_no_formula_dependents" do + describe "::bottled_formulae_with_no_formula_dependents" do include_context "with formulae for dependency testing" before do @@ -72,17 +72,17 @@ it "filters out runtime dependencies" do allow(tab_from_keg).to receive(:poured_from_bottle).and_return(true) - expect(described_class.send(:formulae_with_no_formula_dependents, formulae)) + expect(described_class.send(:bottled_formulae_with_no_formula_dependents, formulae)) .to eq([formula_with_deps, formula_is_build_dep]) end end context "when formulae are built from source" do - it "filters out runtime and build dependencies" do + it "filters out formulae" do allow(tab_from_keg).to receive(:poured_from_bottle).and_return(false) - expect(described_class.send(:formulae_with_no_formula_dependents, formulae)) - .to eq([formula_with_deps]) + expect(described_class.send(:bottled_formulae_with_no_formula_dependents, formulae)) + .to eq([]) end end end diff --git a/Library/Homebrew/test/utils/github_spec.rb b/Library/Homebrew/test/utils/github_spec.rb index 56a047c5afc1fe..2e4e4cb3329ec7 100644 --- a/Library/Homebrew/test/utils/github_spec.rb +++ b/Library/Homebrew/test/utils/github_spec.rb @@ -99,48 +99,48 @@ it "counts commits authored by a user" do allow(described_class).to receive(:repo_commits_for_user) - .with("homebrew/cask", "user1", "author", {}, nil).and_return(five_shas) + .with("homebrew/cask", "user1", "author", nil, nil, nil).and_return(five_shas) allow(described_class).to receive(:repo_commits_for_user) - .with("homebrew/cask", "user1", "committer", {}, nil).and_return([]) + .with("homebrew/cask", "user1", "committer", nil, nil, nil).and_return([]) - expect(described_class.count_repo_commits("homebrew/cask", "user1", {})).to eq([5, 0]) + expect(described_class.count_repo_commits("homebrew/cask", "user1")).to eq([5, 0]) end it "counts commits committed by a user" do allow(described_class).to receive(:repo_commits_for_user) - .with("homebrew/core", "user1", "author", {}, nil).and_return([]) + .with("homebrew/core", "user1", "author", nil, nil, nil).and_return([]) allow(described_class).to receive(:repo_commits_for_user) - .with("homebrew/core", "user1", "committer", {}, nil).and_return(five_shas) + .with("homebrew/core", "user1", "committer", nil, nil, nil).and_return(five_shas) - expect(described_class.count_repo_commits("homebrew/core", "user1", {})).to eq([0, 5]) + expect(described_class.count_repo_commits("homebrew/core", "user1")).to eq([0, 5]) end it "calculates correctly when authored > committed with different shas" do allow(described_class).to receive(:repo_commits_for_user) - .with("homebrew/cask", "user1", "author", {}, nil).and_return(ten_shas) + .with("homebrew/cask", "user1", "author", nil, nil, nil).and_return(ten_shas) allow(described_class).to receive(:repo_commits_for_user) - .with("homebrew/cask", "user1", "committer", {}, nil).and_return(%w[1 2 3 4 5]) + .with("homebrew/cask", "user1", "committer", nil, nil, nil).and_return(%w[1 2 3 4 5]) - expect(described_class.count_repo_commits("homebrew/cask", "user1", {})).to eq([10, 5]) + expect(described_class.count_repo_commits("homebrew/cask", "user1")).to eq([10, 5]) end it "calculates correctly when committed > authored" do allow(described_class).to receive(:repo_commits_for_user) - .with("homebrew/cask", "user1", "author", {}, nil).and_return(five_shas) + .with("homebrew/cask", "user1", "author", nil, nil, nil).and_return(five_shas) allow(described_class).to receive(:repo_commits_for_user) - .with("homebrew/cask", "user1", "committer", {}, nil).and_return(ten_shas) + .with("homebrew/cask", "user1", "committer", nil, nil, nil).and_return(ten_shas) - expect(described_class.count_repo_commits("homebrew/cask", "user1", {})).to eq([5, 5]) + expect(described_class.count_repo_commits("homebrew/cask", "user1")).to eq([5, 5]) end it "deduplicates commits authored and committed by the same user" do allow(described_class).to receive(:repo_commits_for_user) - .with("homebrew/core", "user1", "author", {}, nil).and_return(five_shas) + .with("homebrew/core", "user1", "author", nil, nil, nil).and_return(five_shas) allow(described_class).to receive(:repo_commits_for_user) - .with("homebrew/core", "user1", "committer", {}, nil).and_return(five_shas) + .with("homebrew/core", "user1", "committer", nil, nil, nil).and_return(five_shas) # Because user1 authored and committed the same 5 commits. - expect(described_class.count_repo_commits("homebrew/core", "user1", {})).to eq([5, 0]) + expect(described_class.count_repo_commits("homebrew/core", "user1")).to eq([5, 0]) end end end diff --git a/Library/Homebrew/test/utils/shell_spec.rb b/Library/Homebrew/test/utils/shell_spec.rb index f3f2fb9bce7427..16bb3670a3a5b2 100644 --- a/Library/Homebrew/test/utils/shell_spec.rb +++ b/Library/Homebrew/test/utils/shell_spec.rb @@ -21,13 +21,13 @@ it "returns /tmp/.zshrc for Zsh if ZDOTDIR is /tmp" do ENV["SHELL"] = "/bin/zsh" - ENV["ZDOTDIR"] = "/tmp" + ENV["HOMEBREW_ZDOTDIR"] = "/tmp" expect(described_class.profile).to eq("/tmp/.zshrc") end it "returns ~/.zshrc for Zsh" do ENV["SHELL"] = "/bin/zsh" - ENV["ZDOTDIR"] = nil + ENV["HOMEBREW_ZDOTDIR"] = nil expect(described_class.profile).to eq("~/.zshrc") end diff --git a/Library/Homebrew/unpack_strategy/uncompressed.rb b/Library/Homebrew/unpack_strategy/uncompressed.rb index fdde716dcbf4c4..5d2c3dd5113180 100644 --- a/Library/Homebrew/unpack_strategy/uncompressed.rb +++ b/Library/Homebrew/unpack_strategy/uncompressed.rb @@ -1,4 +1,4 @@ -# typed: true +# typed: strict # frozen_string_literal: true module UnpackStrategy diff --git a/Library/Homebrew/utils/autoremove.rb b/Library/Homebrew/utils/autoremove.rb index 5b14c8d5053d3b..b84d99bb16ff9c 100644 --- a/Library/Homebrew/utils/autoremove.rb +++ b/Library/Homebrew/utils/autoremove.rb @@ -29,26 +29,31 @@ def formulae_with_cask_dependents(casks) .flat_map { |f| [f, *f.runtime_formula_dependencies].compact } end - # An array of all installed {Formula} without runtime {Formula} + # An array of all installed bottled {Formula} without runtime {Formula} # dependents for bottles and without build {Formula} dependents # for those built from source. # @private sig { params(formulae: T::Array[Formula]).returns(T::Array[Formula]) } - def formulae_with_no_formula_dependents(formulae) - dependents = T.let([], T::Array[Formula]) + def bottled_formulae_with_no_formula_dependents(formulae) + formulae_to_keep = T.let([], T::Array[Formula]) formulae.each do |formula| - dependents += formula.runtime_formula_dependencies + formulae_to_keep += formula.runtime_formula_dependencies - # Ignore build dependencies when the formula is a bottle - next if formula.any_installed_keg&.tab&.poured_from_bottle + if (tab = formula.any_installed_keg&.tab) + # Ignore build dependencies when the formula is a bottle + next if tab.poured_from_bottle + + # Keep the formula if it was built from source + formulae_to_keep << formula + end formula.deps.select(&:build?).each do |dep| - dependents << dep.to_formula + formulae_to_keep << dep.to_formula rescue FormulaUnavailableError # do nothing end end - formulae - dependents + formulae - formulae_to_keep end # Recursive function that returns an array of {Formula} without @@ -56,7 +61,7 @@ def formulae_with_no_formula_dependents(formulae) # @private sig { params(formulae: T::Array[Formula]).returns(T::Array[Formula]) } def unused_formulae_with_no_formula_dependents(formulae) - unused_formulae = formulae_with_no_formula_dependents(formulae).reject do |f| + unused_formulae = bottled_formulae_with_no_formula_dependents(formulae).reject do |f| f.any_installed_keg&.tab&.installed_on_request end diff --git a/Library/Homebrew/utils/curl.rb b/Library/Homebrew/utils/curl.rb index 4b3389f6a8d01f..7c3a0f8b2ed228 100644 --- a/Library/Homebrew/utils/curl.rb +++ b/Library/Homebrew/utils/curl.rb @@ -12,6 +12,13 @@ module Curl include SystemCommand::Mixin extend SystemCommand::Mixin + # Error returned when the server sent data curl could not parse. + CURL_WEIRD_SERVER_REPLY_EXIT_CODE = 8 + + # Error returned when `--fail` is used and the HTTP server returns an error + # code that is >= 400. + CURL_HTTP_RETURNED_ERROR_EXIT_CODE = 22 + # This regex is used to extract the part of an ETag within quotation marks, # ignoring any leading weak validator indicator (`W/`). This simplifies # ETag comparison in `#curl_check_http_content`. @@ -26,7 +33,10 @@ module Curl # the status code and any following descriptive text (e.g. `Not Found`). HTTP_STATUS_LINE_REGEX = %r{^HTTP/.* (?\d+)(?: (?[^\r\n]+))?} - private_constant :ETAG_VALUE_REGEX, :HTTP_RESPONSE_BODY_SEPARATOR, :HTTP_STATUS_LINE_REGEX + private_constant :CURL_WEIRD_SERVER_REPLY_EXIT_CODE, + :CURL_HTTP_RETURNED_ERROR_EXIT_CODE, + :ETAG_VALUE_REGEX, :HTTP_RESPONSE_BODY_SEPARATOR, + :HTTP_STATUS_LINE_REGEX module_function @@ -222,8 +232,10 @@ def curl_headers(*args, wanted_headers: [], **options) **options ) - # 22 means a non-successful HTTP status code, not a `curl` error, so we still got some headers. - if result.success? || result.exit_status == 22 + # We still receive usable headers with certain non-successful exit + # statuses, so we special case them below. + if result.success? || + [CURL_WEIRD_SERVER_REPLY_EXIT_CODE, CURL_HTTP_RETURNED_ERROR_EXIT_CODE].include?(result.exit_status) parsed_output = parse_curl_output(result.stdout) if request_args.empty? @@ -235,7 +247,8 @@ def curl_headers(*args, wanted_headers: [], **options) next if (400..499).cover?(parsed_output.fetch(:responses).last&.fetch(:status_code).to_i) end - return parsed_output if result.success? + return parsed_output if result.success? || + result.exit_status == CURL_WEIRD_SERVER_REPLY_EXIT_CODE end result.assert_success! diff --git a/Library/Homebrew/utils/gems.rb b/Library/Homebrew/utils/gems.rb index 6766db8b56cf28..717a5a006c651c 100644 --- a/Library/Homebrew/utils/gems.rb +++ b/Library/Homebrew/utils/gems.rb @@ -10,7 +10,7 @@ module Homebrew # Keep in sync with the `Gemfile.lock`'s BUNDLED WITH. # After updating this, run `brew vendor-gems --update=--bundler`. - HOMEBREW_BUNDLER_VERSION = "2.5.9" + HOMEBREW_BUNDLER_VERSION = "2.5.11" # Bump this whenever a committed vendored gem is later added to or exclusion removed from gitignore. # This will trigger it to reinstall properly if `brew install-bundler-gems` needs it. @@ -241,6 +241,7 @@ def install_bundler_gems!(only_warn_on_failure: false, setup_path: true, groups: # Combine the passed groups with the ones stored in settings. groups |= (user_gem_groups & valid_gem_groups) + groups.delete("bootsnap") if HOMEBREW_USING_PORTABLE_RUBY groups.sort! if (homebrew_bundle_user_cache = ENV.fetch("HOMEBREW_BUNDLE_USER_CACHE", nil)) @@ -299,7 +300,12 @@ def install_bundler_gems!(only_warn_on_failure: false, setup_path: true, groups: end bundle_installed = if bundle_install_required - if system bundle, "install", out: :err + Process.wait(fork do + # Native build scripts fail if EUID != UID + Process::UID.change_privilege(Process.euid) if Process.euid != Process.uid + exec bundle, "install", out: :err + end) + if $CHILD_STATUS.success? true else message = <<~EOS diff --git a/Library/Homebrew/utils/github.rb b/Library/Homebrew/utils/github.rb index d34ac967bd3a4f..2b0c11a98968fa 100644 --- a/Library/Homebrew/utils/github.rb +++ b/Library/Homebrew/utils/github.rb @@ -151,17 +151,18 @@ def self.private_repo?(full_name) def self.search_query_string(*main_params, **qualifiers) params = main_params - if (args = qualifiers.fetch(:args, nil)) - params << if args.from && args.to - "created:#{args.from}..#{args.to}" - elsif args.from - "created:>=#{args.from}" - elsif args.to - "created:<=#{args.to}" - end + from = qualifiers.fetch(:from, nil) + to = qualifiers.fetch(:to, nil) + + params << if from && to + "created:#{from}..#{to}" + elsif from + "created:>=#{from}" + elsif to + "created:<=#{to}" end - params += qualifiers.except(:args).flat_map do |key, value| + params += qualifiers.except(:args, :from, :to).flat_map do |key, value| Array(value).map { |v| "#{key.to_s.tr("_", "-")}:#{v}" } end @@ -694,7 +695,7 @@ def self.create_bump_pr(info, args:) old_contents = info[:old_contents] additional_files = info[:additional_files] || [] remote = info[:remote] || "origin" - remote_branch = info[:remote_branch] || tap.git_repo.origin_branch_name + remote_branch = info[:remote_branch] || tap.git_repository.origin_branch_name branch = info[:branch_name] commit_message = info[:commit_message] previous_branch = info[:previous_branch] || "-" @@ -841,12 +842,12 @@ def self.multiple_short_commits_exist?(user, repo, commit) output[/^Status: (200)/, 1] != "200" end - def self.repo_commits_for_user(nwo, user, filter, args, max) + def self.repo_commits_for_user(nwo, user, filter, from, to, max) return if Homebrew::EnvConfig.no_github_api? params = ["#{filter}=#{user}"] - params << "since=#{DateTime.parse(args.from).iso8601}" if args.from - params << "until=#{DateTime.parse(args.to).iso8601}" if args.to + params << "since=#{DateTime.parse(from).iso8601}" if from.present? + params << "until=#{DateTime.parse(to).iso8601}" if to.present? commits = [] API.paginate_rest("#{API_URL}/repos/#{nwo}/commits", additional_query_params: params.join("&")) do |result| @@ -859,11 +860,11 @@ def self.repo_commits_for_user(nwo, user, filter, args, max) commits end - def self.count_repo_commits(nwo, user, args, max: nil) + def self.count_repo_commits(nwo, user, from: nil, to: nil, max: nil) odie "Cannot count commits, HOMEBREW_NO_GITHUB_API set!" if Homebrew::EnvConfig.no_github_api? - author_shas = repo_commits_for_user(nwo, user, "author", args, max) - committer_shas = repo_commits_for_user(nwo, user, "committer", args, max) + author_shas = repo_commits_for_user(nwo, user, "author", from, to, max) + committer_shas = repo_commits_for_user(nwo, user, "committer", from, to, max) return [0, 0] if author_shas.blank? && committer_shas.blank? author_count = author_shas.count diff --git a/Library/Homebrew/utils/github/actions.rb b/Library/Homebrew/utils/github/actions.rb index 5ddb61ec74ae9d..3d6e57cc47db19 100644 --- a/Library/Homebrew/utils/github/actions.rb +++ b/Library/Homebrew/utils/github/actions.rb @@ -50,8 +50,10 @@ def self.env_set? def self.puts_annotation_if_env_set(type, message, file: nil, line: nil) # Don't print annotations during tests, too messy to handle these. return if ENV.fetch("HOMEBREW_TESTS", false) + return unless env_set? - puts Annotation.new(type, message) if env_set? + std = (type == :notice) ? $stdout : $stderr + std.puts Annotation.new(type, message) end # Helper class for formatting annotations on GitHub Actions. diff --git a/Library/Homebrew/utils/helpers.sh b/Library/Homebrew/utils/helpers.sh new file mode 100644 index 00000000000000..10388d6875cfb6 --- /dev/null +++ b/Library/Homebrew/utils/helpers.sh @@ -0,0 +1,88 @@ +# These variables are set from the user environment. +# shellcheck disable=SC2154 +ohai() { + # Check whether stdout is a tty. + if [[ -n "${HOMEBREW_COLOR}" || (-t 1 && -z "${HOMEBREW_NO_COLOR}") ]] + then + echo -e "\\033[34m==>\\033[0m \\033[1m$*\\033[0m" # blue arrow and bold text + else + echo "==> $*" + fi +} + +opoo() { + # Check whether stderr is a tty. + if [[ -n "${HOMEBREW_COLOR}" || (-t 2 && -z "${HOMEBREW_NO_COLOR}") ]] + then + echo -ne "\\033[4;33mWarning\\033[0m: " >&2 # highlight Warning with underline and yellow color + else + echo -n "Warning: " >&2 + fi + if [[ $# -eq 0 ]] + then + cat >&2 + else + echo "$*" >&2 + fi +} + +bold() { + # Check whether stderr is a tty. + if [[ -n "${HOMEBREW_COLOR}" || (-t 2 && -z "${HOMEBREW_NO_COLOR}") ]] + then + echo -e "\\033[1m""$*""\\033[0m" + else + echo "$*" + fi +} + +onoe() { + # Check whether stderr is a tty. + if [[ -n "${HOMEBREW_COLOR}" || (-t 2 && -z "${HOMEBREW_NO_COLOR}") ]] + then + echo -ne "\\033[4;31mError\\033[0m: " >&2 # highlight Error with underline and red color + else + echo -n "Error: " >&2 + fi + if [[ $# -eq 0 ]] + then + cat >&2 + else + echo "$*" >&2 + fi +} + +odie() { + onoe "$@" + exit 1 +} + +safe_cd() { + cd "$@" >/dev/null || odie "Failed to cd to $*!" +} + +brew() { + # This variable is set by bin/brew + # shellcheck disable=SC2154 + "${HOMEBREW_BREW_FILE}" "$@" +} + +curl() { + "${HOMEBREW_LIBRARY}/Homebrew/shims/shared/curl" "$@" +} + +git() { + "${HOMEBREW_LIBRARY}/Homebrew/shims/shared/git" "$@" +} + +# Search given executable in PATH (remove dependency for `which` command) +which() { + # Alias to Bash built-in command `type -P` + type -P "$@" +} + +numeric() { + # Condense the exploded argument into a single return value. + # shellcheck disable=SC2086,SC2183 + printf "%01d%02d%02d%03d" ${1//[.rc]/ } 2>/dev/null +} diff --git a/Library/Homebrew/utils/ruby.sh b/Library/Homebrew/utils/ruby.sh index 21d4ff13ecaa9c..dcf45c9ff30b93 100644 --- a/Library/Homebrew/utils/ruby.sh +++ b/Library/Homebrew/utils/ruby.sh @@ -1,11 +1,14 @@ # When bumping, run `brew vendor-gems --update=--ruby` # When bumping to a new major/minor version, also update the bounds in the Gemfile -export HOMEBREW_REQUIRED_RUBY_VERSION=3.3 +# HOMEBREW_LIBRARY set by bin/brew +# shellcheck disable=SC2154 +export HOMEBREW_REQUIRED_RUBY_VERSION="3.3" +HOMEBREW_PORTABLE_RUBY_VERSION="$(cat "${HOMEBREW_LIBRARY}/Homebrew/vendor/portable-ruby-version")" # Disable Ruby options we don't need. export HOMEBREW_RUBY_DISABLE_OPTIONS="--disable=gems,rubyopt" -# HOMEBREW_LIBRARY is from the user environment +# HOMEBREW_LIBRARY set by bin/brew # shellcheck disable=SC2154 test_ruby() { if [[ ! -x "$1" ]] @@ -88,7 +91,6 @@ setup-ruby-path() { local vendor_ruby_root local vendor_ruby_path local vendor_ruby_terminfo - local vendor_ruby_latest_version local vendor_ruby_current_version local ruby_exec local upgrade_fail @@ -113,7 +115,6 @@ If there's no Homebrew Portable Ruby available for your processor: vendor_ruby_root="${vendor_dir}/portable-ruby/current" vendor_ruby_path="${vendor_ruby_root}/bin/ruby" vendor_ruby_terminfo="${vendor_ruby_root}/share/terminfo" - vendor_ruby_latest_version="$(cat "${vendor_dir}/portable-ruby-version")" vendor_ruby_current_version="$(readlink "${vendor_ruby_root}")" unset HOMEBREW_RUBY_PATH @@ -127,7 +128,7 @@ If there's no Homebrew Portable Ruby available for your processor: then HOMEBREW_RUBY_PATH="${vendor_ruby_path}" TERMINFO_DIRS="${vendor_ruby_terminfo}" - if [[ "${vendor_ruby_current_version}" != "${vendor_ruby_latest_version}" ]] + if [[ "${vendor_ruby_current_version}" != "${HOMEBREW_PORTABLE_RUBY_VERSION}" ]] then brew vendor-install ruby || odie "${upgrade_fail}" fi diff --git a/Library/Homebrew/utils/shell.rb b/Library/Homebrew/utils/shell.rb index 186fc038e68289..d514f5914fd0c1 100644 --- a/Library/Homebrew/utils/shell.rb +++ b/Library/Homebrew/utils/shell.rb @@ -60,7 +60,7 @@ def profile rc_profile = "#{Dir.home}/.rcrc" return rc_profile if File.exist? rc_profile when :zsh - return "#{ENV["ZDOTDIR"]}/.zshrc" if ENV["ZDOTDIR"].present? + return "#{ENV["HOMEBREW_ZDOTDIR"]}/.zshrc" if ENV["HOMEBREW_ZDOTDIR"].present? end SHELL_PROFILE_MAP.fetch(preferred, "~/.profile") diff --git a/Library/Homebrew/vendor/bundle/bundler/setup.rb b/Library/Homebrew/vendor/bundle/bundler/setup.rb index 01759df119f777..b7863154c86f50 100644 --- a/Library/Homebrew/vendor/bundle/bundler/setup.rb +++ b/Library/Homebrew/vendor/bundle/bundler/setup.rb @@ -34,10 +34,9 @@ def self.extension_api_version end end end -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/public_suffix-5.0.5/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/public_suffix-5.1.1/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/addressable-2.8.6/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/ast-2.4.2/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/base64-0.2.0/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/extensions/arm64-darwin-20/#{Gem.extension_api_version}/bigdecimal-3.1.8") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/bigdecimal-3.1.8/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/bindata-2.5.0/lib") @@ -46,45 +45,45 @@ def self.extension_api_version $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/extensions/arm64-darwin-20/#{Gem.extension_api_version}/bootsnap-1.18.3") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/bootsnap-1.18.3/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/coderay-1.1.3/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/highline-2.0.3/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/commander-4.6.0/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/highline-3.0.1/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/commander-5.0.0/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/diff-lcs-1.5.1/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/docile-1.4.0/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/elftools-1.3.1/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/erubi-1.12.0/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/erubi-1.13.0/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/hana-1.3.7/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/extensions/arm64-darwin-20/#{Gem.extension_api_version}/json-2.7.2") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/json-2.7.2/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/regexp_parser-2.9.2/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/simpleidn-0.2.3/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/json_schemer-2.2.1/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/json_schemer-2.3.0/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/extensions/arm64-darwin-20/#{Gem.extension_api_version}/strscan-3.1.0") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/strscan-3.1.0/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rexml-3.2.8/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rexml-3.3.0/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/kramdown-2.4.0/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/language_server-protocol-3.17.0.3/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/method_source-1.1.0/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/minitest-5.23.1/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/netrc-0.11.0/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/parallel-1.24.0/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/parallel-1.25.1/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/parallel_tests-4.7.1/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/extensions/arm64-darwin-20/#{Gem.extension_api_version}/racc-1.8.0") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/racc-1.8.0/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/parser-3.3.1.0/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/parser-3.3.3.0/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rainbow-3.1.1/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/sorbet-runtime-0.5.11388/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/parlour-8.1.0/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/sorbet-runtime-0.5.11435/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/parlour-9.0.0/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/patchelf-1.5.1/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/plist-3.7.1/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/extensions/arm64-darwin-20/#{Gem.extension_api_version}/prism-0.29.0") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/prism-0.29.0/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/extensions/arm64-darwin-20/#{Gem.extension_api_version}/prism-0.30.0") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/prism-0.30.0/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/pry-0.14.2/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rbi-0.1.13/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/extensions/arm64-darwin-20/#{Gem.extension_api_version}/redcarpet-3.6.0") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/redcarpet-3.6.0/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rspec-support-3.13.1/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rspec-core-3.13.0/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rspec-expectations-3.13.0/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rspec-expectations-3.13.1/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rspec-mocks-3.13.1/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rspec-3.13.0/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rspec-github-2.4.0/lib") @@ -94,31 +93,28 @@ def self.extension_api_version $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rubocop-ast-1.31.3/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/ruby-progressbar-1.13.0/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/unicode-display_width-2.5.0/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rubocop-1.64.0/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rubocop-capybara-2.20.0/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rubocop-factory_bot-2.25.1/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rubocop-1.64.1/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rubocop-md-1.2.2/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rubocop-performance-1.21.0/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rubocop-rspec_rails-2.28.3/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rubocop-rspec-2.29.2/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rubocop-performance-1.21.1/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rubocop-rspec-3.0.1/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/rubocop-sorbet-0.8.3/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/ruby-macho-4.0.1/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/ruby-macho-4.1.0/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/extensions/arm64-darwin-20/#{Gem.extension_api_version}/ruby-prof-1.7.0") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/ruby-prof-1.7.0/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/simplecov-html-0.12.3/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/simplecov_json_formatter-0.1.4/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/simplecov-0.22.0/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/simplecov-cobertura-2.1.0/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/sorbet-static-0.5.11388-universal-darwin/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/sorbet-0.5.11388/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/sorbet-static-and-runtime-0.5.11388/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/sorbet-static-0.5.11435-universal-darwin/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/sorbet-0.5.11435/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/sorbet-static-and-runtime-0.5.11435/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/thor-1.3.1/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/spoom-1.3.2/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/extensions/arm64-darwin-20/#{Gem.extension_api_version}/stackprof-0.2.26") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/stackprof-0.2.26/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/yard-0.9.36/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/yard-sorbet-0.8.1/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/tapioca-0.14.2/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/tapioca-0.14.3/lib") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/extensions/arm64-darwin-20/#{Gem.extension_api_version}/vernier-1.0.1") $:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/vernier-1.0.1/lib") -$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/warning-1.3.0/lib") +$:.unshift File.expand_path("#{__dir__}/../#{RUBY_ENGINE}/#{Gem.ruby_api_version}/gems/warning-1.4.0/lib") diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.0.5/LICENSE.txt b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.1.1/LICENSE.txt similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.0.5/LICENSE.txt rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.1.1/LICENSE.txt diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.0.5/data/list.txt b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.1.1/data/list.txt similarity index 99% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.0.5/data/list.txt rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.1.1/data/list.txt index 21df77442b7ff8..291197fb899cb5 100644 --- a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.0.5/data/list.txt +++ b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.1.1/data/list.txt @@ -12076,6 +12076,7 @@ autocode.dev // AVM : https://avm.de // Submitted by Andreas Weise +myfritz.link myfritz.net // AVStack Pte. Ltd. : https://avstack.io @@ -12353,6 +12354,12 @@ pages.dev r2.dev workers.dev +// cloudscale.ch AG : https://www.cloudscale.ch/ +// Submitted by Gaudenz Steinlin +cust.cloudscale.ch +objects.lpg.cloudscale.ch +objects.rma.cloudscale.ch + // Clovyr : https://clovyr.io // Submitted by Patrick Nielsen wnext.app @@ -12370,22 +12377,33 @@ co.cz // CDN77.com : http://www.cdn77.com // Submitted by Jan Krpes -c.cdn77.org +cdn77-storage.com +rsc.contentproxy9.cz cdn77-ssl.net r.cdn77.net -rsc.cdn77.org ssl.origin.cdn77-secure.org +c.cdn77.org +rsc.cdn77.org // Cloud DNS Ltd : http://www.cloudns.net -// Submitted by Aleksander Hristov +// Submitted by Aleksander Hristov & Boyan Peychev cloudns.asia +cloudns.be cloudns.biz -cloudns.club cloudns.cc +cloudns.ch +cloudns.cl +cloudns.club +dnsabr.com +cloudns.cx cloudns.eu cloudns.in cloudns.info +dns-cloud.net +dns-dynamic.net +cloudns.nz cloudns.org +cloudns.ph cloudns.pro cloudns.pw cloudns.us @@ -12398,6 +12416,11 @@ cnpy.gdn // Submitted by Moritz Marquardt codeberg.page +// CodeSandbox B.V. : https://codesandbox.io +// Submitted by Ives van Hoorne +csb.app +preview.csb.app + // CoDNS B.V. co.nl co.no @@ -12516,6 +12539,7 @@ dyndns.dappnode.io // Dark, Inc. : https://darklang.com // Submitted by Paul Biggar builtwithdark.com +darklang.io // DataDetect, LLC. : https://datadetect.com // Submitted by Andrew Banchich @@ -12955,6 +12979,14 @@ easypanel.host // Submitted by *.ewp.live +// Electromagnetic Field : https://www.emfcamp.org +// Submitted by +at.emf.camp + +// Elefunc, Inc. : https://elefunc.com +// Submitted by Cetin Sert +rt.ht + // Elementor : Elementor Ltd. // Submitted by Anton Barkan elementor.cloud @@ -13246,7 +13278,8 @@ forgeblocks.com id.forgerock.io // Framer : https://www.framer.com -// Submitted by Koen Rouwhorst +// Submitted by Koen Rouwhorst +framer.ai framer.app framercanvas.com framer.media @@ -13287,6 +13320,24 @@ freemyip.com // Submitted by Daniel A. Maierhofer wien.funkfeuer.at +// Future Versatile Group. :https://www.fvg-on.net/ +// T.Kabu +daemon.asia +dix.asia +mydns.bz +0am.jp +0g0.jp +0j0.jp +0t0.jp +mydns.jp +pgw.jp +wjg.jp +keyword-on.net +live-on.net +server-on.net +mydns.tw +mydns.vc + // Futureweb GmbH : https://www.futureweb.at // Submitted by Andreas Schnederle-Wagner *.futurecms.at @@ -13330,6 +13381,12 @@ gentlentapis.com lab.ms cdn-edges.net +// Getlocalcert: https://www.getlocalcert.net +// Submitted by Robert Alexander +localcert.net +localhostcert.net +corpnet.work + // Ghost Foundation : https://ghost.org // Submitted by Matt Hanley ghost.io @@ -13599,6 +13656,10 @@ goupile.fr // Submitted by gov.nl +// GrayJay Web Solutions Inc. : https://grayjaysports.ca +// Submitted by Matt Yamkowy +grayjayleagues.com + // Group 53, LLC : https://www.group53.com // Submitted by Tyler Todd awsmppl.com @@ -13633,6 +13694,11 @@ hasura-app.io // Submitted by Richard Zowalla pages.it.hs-heilbronn.de +// Helio Networks : https://heliohost.org +// Submitted by Ben Frede +helioho.st +heliohost.us + // Hepforge : https://www.hepforge.org // Submitted by David Grellscheid hepforge.org @@ -13646,7 +13712,6 @@ herokussl.com // Submitted by Oren Eini ravendb.cloud ravendb.community -ravendb.me development.run ravendb.run @@ -13786,6 +13851,10 @@ iopsys.se // Submitted by Matthew Hardeman ipifony.net +// is-a.dev : https://www.is-a.dev +// Submitted by William Harrison +is-a.dev + // ir.md : https://nic.ir.md // Submitted by Ali Soizi ir.md @@ -13971,6 +14040,10 @@ lpusercontent.com // Submitted by Lelux Admin lelux.site +// Libre IT Ltd : https://libre.nz +// Submitted by Tomas Maggio +runcontainers.dev + // Lifetime Hosting : https://Lifetime.Hosting/ // Submitted by Mike Fillator co.business @@ -14252,8 +14325,9 @@ ngrok.pro torun.pl // Nimbus Hosting Ltd. : https://www.nimbushosting.co.uk/ -// Submitted by Nicholas Ford +// Submitted by Nicholas Ford nh-serv.co.uk +nimsite.uk // NFSN, Inc. : https://www.NearlyFreeSpeech.NET/ // Submitted by Jeff Wheelhouse @@ -14442,7 +14516,6 @@ omniwe.site 123minsida.se 123miweb.es 123paginaweb.pt -123sait.ru 123siteweb.fr 123webseite.at 123webseite.de @@ -14460,6 +14533,13 @@ simplesite.pl // Submitted by Eddie Jones nid.io +// Open Domains : https://open-domains.net +// Submitted by William Harrison +is-cool.dev +is-not-a.dev +localplayer.dev +is-local.org + // Open Social : https://www.getopensocial.com/ // Submitted by Alexander Varwijk opensocial.site @@ -14480,6 +14560,11 @@ operaunite.com // Submitted by Alexandre Linte tech.orange +// OsSav Technology Ltd. : https://ossav.com/ +// TLD Nic: http://nic.can.re - TLD Whois Server: whois.can.re +// Submitted by OsSav Technology Ltd. +can.re + // Oursky Limited : https://authgear.com/, https://skygear.io/ // Submitted by Authgear Team , Skygear Developer authgear-staging.com @@ -14530,10 +14615,14 @@ pagexl.com // pcarrier.ca Software Inc: https://pcarrier.ca/ // Submitted by Pierre Carrier +*.xmit.co bar0.net bar1.net bar2.net rdv.to +srv.us +gh.srv.us +gl.srv.us // .pl domains (grandfathered) art.pl @@ -14923,6 +15012,10 @@ service.gov.scot // Submitted by Shante Adam scrysec.com +// Scrypted : https://scrypted.app +// Submitted by Koushik Dutta +client.scrypted.io + // Securepoint GmbH : https://www.securepoint.de // Submitted by Erik Anders firewall-gateway.com @@ -15032,9 +15125,9 @@ small-web.org vp4.me // Snowflake Inc : https://www.snowflake.com/ -// Submitted by Faith Olapade -snowflake.app -privatelink.snowflake.app +// Submitted by Sam Haar +*.snowflake.app +*.privatelink.snowflake.app streamlit.app streamlitapp.com @@ -15046,6 +15139,12 @@ try-snowplow.com // Submitted by Drew DeVault srht.site +// StackBlitz : https://stackblitz.com +// Submitted by Dominic Elm +w-corp-staticblitz.com +w-credentialless-staticblitz.com +w-staticblitz.com + // Stackhero : https://www.stackhero.io // Submitted by Adrien Gillon stackhero-network.com @@ -15347,6 +15446,10 @@ inc.hk // Submitted by ITComdomains it.com +// Unison Computing, PBC : https://unison.cloud +// Submitted by Simon Højberg +unison-services.cloud + // UNIVERSAL DOMAIN REGISTRY : https://www.udr.org.yt/ // see also: whois -h whois.udr.org.yt help // Submitted by Atanunu Igbunuroghene @@ -15465,6 +15568,10 @@ reserve-online.com bookonline.app hotelwithflight.com +// WebWaddle Ltd: https://webwaddle.com/ +// Submitted by Merlin Glander +*.wadl.top + // WeDeploy by Liferay, Inc. : https://www.wedeploy.com // Submitted by Henrique Vicente wedeploy.io diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.0.5/lib/public_suffix.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.1.1/lib/public_suffix.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.0.5/lib/public_suffix.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.1.1/lib/public_suffix.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.0.5/lib/public_suffix/domain.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.1.1/lib/public_suffix/domain.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.0.5/lib/public_suffix/domain.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.1.1/lib/public_suffix/domain.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.0.5/lib/public_suffix/errors.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.1.1/lib/public_suffix/errors.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.0.5/lib/public_suffix/errors.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.1.1/lib/public_suffix/errors.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.0.5/lib/public_suffix/list.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.1.1/lib/public_suffix/list.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.0.5/lib/public_suffix/list.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.1.1/lib/public_suffix/list.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.0.5/lib/public_suffix/rule.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.1.1/lib/public_suffix/rule.rb similarity index 99% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.0.5/lib/public_suffix/rule.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.1.1/lib/public_suffix/rule.rb index 31d8daaf0898d4..23696f34880deb 100644 --- a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.0.5/lib/public_suffix/rule.rb +++ b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.1.1/lib/public_suffix/rule.rb @@ -230,7 +230,7 @@ def self.build(content, private: false) # @param length [Integer] # @param private [Boolean] def initialize(value:, length: nil, private: false) - super(value: value, length: length, private: private) + super length or @length += 1 # * counts as 1 end diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.0.5/lib/public_suffix/version.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.1.1/lib/public_suffix/version.rb similarity index 92% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.0.5/lib/public_suffix/version.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.1.1/lib/public_suffix/version.rb index 7f725afeb57e6d..07611a896a0d27 100644 --- a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.0.5/lib/public_suffix/version.rb +++ b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/public_suffix-5.1.1/lib/public_suffix/version.rb @@ -9,6 +9,6 @@ module PublicSuffix # @return [String] the current library version - VERSION = "5.0.5" + VERSION = "5.1.1" end diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/LICENSE b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/LICENSE similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/LICENSE rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/LICENSE diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho.rb similarity index 99% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho.rb index 12f701364be74e..b9a90bb833360a 100644 --- a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho.rb +++ b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho.rb @@ -16,7 +16,7 @@ # The primary namespace for ruby-macho. module MachO # release version - VERSION = "4.0.1" + VERSION = "4.1.0" # Opens the given filename as a MachOFile or FatFile, depending on its magic. # @param filename [String] the file being opened diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/exceptions.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/exceptions.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/exceptions.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/exceptions.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/fat_file.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/fat_file.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/fat_file.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/fat_file.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/headers.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/headers.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/headers.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/headers.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/load_commands.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/load_commands.rb similarity index 92% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/load_commands.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/load_commands.rb index c420c8bd992461..1ed24a58beed45 100644 --- a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/load_commands.rb +++ b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/load_commands.rb @@ -65,6 +65,7 @@ module LoadCommands (LC_REQ_DYLD | 0x33) => :LC_DYLD_EXPORTS_TRIE, (LC_REQ_DYLD | 0x34) => :LC_DYLD_CHAINED_FIXUPS, (LC_REQ_DYLD | 0x35) => :LC_FILESET_ENTRY, + 0x36 => :LC_ATOM_INFO, }.freeze # association of symbol representations to load command constants @@ -110,7 +111,7 @@ module LoadCommands # "reserved for internal use only", no public struct :LC_PREPAGE => "LoadCommand", :LC_DYSYMTAB => "DysymtabCommand", - :LC_LOAD_DYLIB => "DylibCommand", + :LC_LOAD_DYLIB => "DylibUseCommand", :LC_ID_DYLIB => "DylibCommand", :LC_LOAD_DYLINKER => "DylinkerCommand", :LC_ID_DYLINKER => "DylinkerCommand", @@ -122,7 +123,7 @@ module LoadCommands :LC_SUB_LIBRARY => "SubLibraryCommand", :LC_TWOLEVEL_HINTS => "TwolevelHintsCommand", :LC_PREBIND_CKSUM => "PrebindCksumCommand", - :LC_LOAD_WEAK_DYLIB => "DylibCommand", + :LC_LOAD_WEAK_DYLIB => "DylibUseCommand", :LC_SEGMENT_64 => "SegmentCommand64", :LC_ROUTINES_64 => "RoutinesCommand64", :LC_UUID => "UUIDCommand", @@ -153,6 +154,7 @@ module LoadCommands :LC_DYLD_EXPORTS_TRIE => "LinkeditDataCommand", :LC_DYLD_CHAINED_FIXUPS => "LinkeditDataCommand", :LC_FILESET_ENTRY => "FilesetEntryCommand", + :LC_ATOM_INFO => "LinkeditDataCommand", }.freeze # association of segment name symbols to names @@ -193,6 +195,20 @@ module LoadCommands :SG_READ_ONLY => 0x10, }.freeze + # association of dylib use flag symbols to values + # @api private + DYLIB_USE_FLAGS = { + :DYLIB_USE_WEAK_LINK => 0x1, + :DYLIB_USE_REEXPORT => 0x2, + :DYLIB_USE_UPWARD => 0x4, + :DYLIB_USE_DELAYED_INIT => 0x8, + }.freeze + + # the marker used to denote a newer style dylib use command. + # the value is the timestamp 24 January 1984 18:12:16 + # @api private + DYLIB_USE_MARKER = 0x1a741800 + # The top-level Mach-O load command structure. # # This is the most generic load command -- only the type ID and size are @@ -231,6 +247,13 @@ def self.create(cmd_sym, *args) # cmd will be filled in, view and cmdsize will be left unpopulated klass_arity = klass.min_args - 3 + # macOS 15 introduces a new dylib load command that adds a flags field to the end. + # It uses the same commands with it dynamically being created if the dylib has a flags field + if klass == DylibUseCommand && (args[1] != DYLIB_USE_MARKER || args.size <= DylibCommand.min_args - 3) + klass = DylibCommand + klass_arity = klass.min_args - 3 + end + raise LoadCommandCreationArityError.new(cmd_sym, klass_arity, args.size) if klass_arity > args.size klass.new(nil, cmd, nil, *args) @@ -526,6 +549,23 @@ class DylibCommand < LoadCommand # @return [Integer] the library's compatibility version number field :compatibility_version, :uint32 + # @example + # puts "this dylib is weakly loaded" if dylib_command.flag?(:DYLIB_USE_WEAK_LINK) + # @param flag [Symbol] a dylib use command flag symbol + # @return [Boolean] true if `flag` applies to this dylib command + def flag?(flag) + case cmd + when LOAD_COMMAND_CONSTANTS[:LC_LOAD_WEAK_DYLIB] + flag == :DYLIB_USE_WEAK_LINK + when LOAD_COMMAND_CONSTANTS[:LC_REEXPORT_DYLIB] + flag == :DYLIB_USE_REEXPORT + when LOAD_COMMAND_CONSTANTS[:LC_LOAD_UPWARD_DYLIB] + flag == :DYLIB_USE_UPWARD + else + false + end + end + # @param context [SerializationContext] # the context # @return [String] the serialized fields of the load command @@ -551,6 +591,65 @@ def to_h end end + # The newer format of load command representing some aspect of shared libraries, + # depending on filetype. Corresponds to LC_LOAD_DYLIB or LC_LOAD_WEAK_DYLIB. + class DylibUseCommand < DylibCommand + # @return [Integer] any flags associated with this dylib use command + field :flags, :uint32 + + alias marker timestamp + + # Instantiates a new DylibCommand or DylibUseCommand. + # macOS 15 and later use a new format for dylib commands (DylibUseCommand), + # which is determined based on a special timestamp and the name offset. + # @param view [MachO::MachOView] the load command's raw view + # @return [DylibCommand] the new dylib load command + # @api private + def self.new_from_bin(view) + dylib_command = DylibCommand.new_from_bin(view) + + if dylib_command.timestamp == DYLIB_USE_MARKER && + dylib_command.name.to_i == DylibUseCommand.bytesize + super(view) + else + dylib_command + end + end + + # @example + # puts "this dylib is weakly loaded" if dylib_command.flag?(:DYLIB_USE_WEAK_LINK) + # @param flag [Symbol] a dylib use command flag symbol + # @return [Boolean] true if `flag` applies to this dylib command + def flag?(flag) + flag = DYLIB_USE_FLAGS[flag] + + return false if flag.nil? + + flags & flag == flag + end + + # @param context [SerializationContext] + # the context + # @return [String] the serialized fields of the load command + # @api private + def serialize(context) + format = Utils.specialize_format(self.class.format, context.endianness) + string_payload, string_offsets = Utils.pack_strings(self.class.bytesize, + context.alignment, + :name => name.to_s) + cmdsize = self.class.bytesize + string_payload.bytesize + [cmd, cmdsize, string_offsets[:name], marker, current_version, + compatibility_version, flags].pack(format) + string_payload + end + + # @return [Hash] a hash representation of this {DylibUseCommand} + def to_h + { + "flags" => flags, + }.merge super + end + end + # A load command representing some aspect of the dynamic linker, depending # on filetype. Corresponds to LC_ID_DYLINKER, LC_LOAD_DYLINKER, and # LC_DYLD_ENVIRONMENT. @@ -958,7 +1057,7 @@ def to_h # the __LINKEDIT segment. Corresponds to LC_CODE_SIGNATURE, # LC_SEGMENT_SPLIT_INFO, LC_FUNCTION_STARTS, LC_DATA_IN_CODE, # LC_DYLIB_CODE_SIGN_DRS, LC_LINKER_OPTIMIZATION_HINT, LC_DYLD_EXPORTS_TRIE, - # or LC_DYLD_CHAINED_FIXUPS. + # LC_DYLD_CHAINED_FIXUPS, or LC_ATOM_INFO. class LinkeditDataCommand < LoadCommand # @return [Integer] offset to the data in the __LINKEDIT segment field :dataoff, :uint32 diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/macho_file.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/macho_file.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/macho_file.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/macho_file.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/sections.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/sections.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/sections.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/sections.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/structure.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/structure.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/structure.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/structure.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/tools.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/tools.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/tools.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/tools.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/utils.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/utils.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/utils.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/utils.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/view.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/view.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.0.1/lib/macho/view.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/ruby-macho-4.1.0/lib/macho/view.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/sorbet-runtime.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/sorbet-runtime.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/sorbet-runtime.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/sorbet-runtime.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/_types.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/_types.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/_types.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/_types.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/abstract_utils.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/abstract_utils.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/abstract_utils.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/abstract_utils.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/boolean.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/boolean.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/boolean.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/boolean.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/compatibility_patches.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/compatibility_patches.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/compatibility_patches.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/compatibility_patches.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/configuration.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/configuration.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/configuration.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/configuration.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/enum.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/enum.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/enum.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/enum.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/generic.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/generic.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/generic.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/generic.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/helpers.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/helpers.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/helpers.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/helpers.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/non_forcing_constants.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/non_forcing_constants.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/non_forcing_constants.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/non_forcing_constants.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/abstract/data.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/abstract/data.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/abstract/data.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/abstract/data.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/abstract/declare.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/abstract/declare.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/abstract/declare.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/abstract/declare.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/abstract/hooks.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/abstract/hooks.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/abstract/hooks.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/abstract/hooks.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/abstract/validate.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/abstract/validate.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/abstract/validate.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/abstract/validate.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/caller_utils.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/caller_utils.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/caller_utils.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/caller_utils.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/casts.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/casts.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/casts.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/casts.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/class_utils.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/class_utils.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/class_utils.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/class_utils.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/decl_state.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/decl_state.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/decl_state.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/decl_state.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/final.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/final.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/final.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/final.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/methods/_methods.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/methods/_methods.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/methods/_methods.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/methods/_methods.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/methods/call_validation.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/methods/call_validation.rb similarity index 96% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/methods/call_validation.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/methods/call_validation.rb index 18714f2702878b..ce5d5f2f1fa8a1 100644 --- a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/methods/call_validation.rb +++ b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/methods/call_validation.rb @@ -291,11 +291,21 @@ def self.validate_call(instance, original_method, method_sig, args, blk) def self.report_error(method_sig, error_message, kind, name, type, value, caller_offset: 0) caller_loc = T.must(caller_locations(3 + caller_offset, 1))[0] - definition_file, definition_line = method_sig.method.source_location + method = method_sig.method + definition_file, definition_line = method.source_location + + owner = method.owner + pretty_method_name = + if owner.singleton_class? && owner.respond_to?(:attached_object) + # attached_object is new in Ruby 3.2 + "#{owner.attached_object}.#{method.name}" + else + "#{owner}##{method.name}" + end pretty_message = "#{kind}#{name ? " '#{name}'" : ''}: #{error_message}\n" \ "Caller: #{caller_loc.path}:#{caller_loc.lineno}\n" \ - "Definition: #{definition_file}:#{definition_line}" + "Definition: #{definition_file}:#{definition_line} (#{pretty_method_name})" T::Configuration.call_validation_error_handler( method_sig, diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/methods/call_validation_2_6.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/methods/call_validation_2_6.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/methods/call_validation_2_6.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/methods/call_validation_2_6.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/methods/call_validation_2_7.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/methods/call_validation_2_7.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/methods/call_validation_2_7.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/methods/call_validation_2_7.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/methods/decl_builder.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/methods/decl_builder.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/methods/decl_builder.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/methods/decl_builder.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/methods/modes.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/methods/modes.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/methods/modes.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/methods/modes.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/methods/signature.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/methods/signature.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/methods/signature.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/methods/signature.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/methods/signature_validation.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/methods/signature_validation.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/methods/signature_validation.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/methods/signature_validation.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/mixins/mixins.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/mixins/mixins.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/mixins/mixins.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/mixins/mixins.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/retry.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/retry.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/retry.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/retry.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/runtime_levels.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/runtime_levels.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/runtime_levels.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/runtime_levels.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/sealed.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/sealed.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/sealed.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/sealed.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/types/not_typed.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/types/not_typed.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/types/not_typed.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/types/not_typed.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/types/simple_pair_union.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/types/simple_pair_union.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/types/simple_pair_union.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/types/simple_pair_union.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/types/string_holder.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/types/string_holder.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/types/string_holder.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/types/string_holder.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/types/type_alias.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/types/type_alias.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/types/type_alias.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/types/type_alias.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/types/void.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/types/void.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/private/types/void.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/private/types/void.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/_props.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/_props.rb similarity index 95% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/_props.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/_props.rb index fae252aa048f79..420e1d2651f2b5 100644 --- a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/_props.rb +++ b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/_props.rb @@ -110,7 +110,7 @@ def reload_decorator! # # @return [void] sig {params(name: Symbol, cls: T.untyped, rules: T.untyped).void} - def prop(name, cls, rules={}) + def prop(name, cls, **rules) cls = T::Utils.coerce(cls) if !cls.is_a?(Module) decorator.prop_defined(name, cls, rules) end @@ -132,16 +132,16 @@ def plugin(mod) end # Shorthand helper to define a `prop` with `immutable => true` - sig {params(name: Symbol, cls_or_args: T.untyped, args: T::Hash[Symbol, T.untyped]).void} - def const(name, cls_or_args, args={}) + sig {params(name: Symbol, cls_or_args: T.untyped, args: T.untyped).void} + def const(name, cls_or_args, **args) if (cls_or_args.is_a?(Hash) && cls_or_args.key?(:immutable)) || args.key?(:immutable) Kernel.raise ArgumentError.new("Cannot pass 'immutable' argument when using 'const' keyword to define a prop") end if cls_or_args.is_a?(Hash) - self.prop(name, cls_or_args.merge(immutable: true)) + self.prop(name, **cls_or_args.merge(immutable: true)) else - self.prop(name, cls_or_args, args.merge(immutable: true)) + self.prop(name, cls_or_args, **args.merge(immutable: true)) end end diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/constructor.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/constructor.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/constructor.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/constructor.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/custom_type.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/custom_type.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/custom_type.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/custom_type.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/decorator.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/decorator.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/decorator.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/decorator.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/errors.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/errors.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/errors.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/errors.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/generated_code_validation.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/generated_code_validation.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/generated_code_validation.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/generated_code_validation.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/has_lazily_specialized_methods.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/has_lazily_specialized_methods.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/has_lazily_specialized_methods.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/has_lazily_specialized_methods.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/optional.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/optional.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/optional.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/optional.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/plugin.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/plugin.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/plugin.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/plugin.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/pretty_printable.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/pretty_printable.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/pretty_printable.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/pretty_printable.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/private/apply_default.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/private/apply_default.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/private/apply_default.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/private/apply_default.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/private/deserializer_generator.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/private/deserializer_generator.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/private/deserializer_generator.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/private/deserializer_generator.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/private/parser.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/private/parser.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/private/parser.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/private/parser.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/private/serde_transform.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/private/serde_transform.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/private/serde_transform.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/private/serde_transform.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/private/serializer_generator.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/private/serializer_generator.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/private/serializer_generator.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/private/serializer_generator.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/private/setter_factory.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/private/setter_factory.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/private/setter_factory.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/private/setter_factory.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/serializable.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/serializable.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/serializable.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/serializable.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/type_validation.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/type_validation.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/type_validation.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/type_validation.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/utils.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/utils.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/utils.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/utils.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/weak_constructor.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/weak_constructor.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/props/weak_constructor.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/props/weak_constructor.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/sig.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/sig.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/sig.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/sig.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/struct.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/struct.rb similarity index 97% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/struct.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/struct.rb index 49d61ec4a17634..3ca17fe459e931 100644 --- a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/struct.rb +++ b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/struct.rb @@ -39,7 +39,7 @@ def initialize(hash={}) # Matches the signature in Props, but raises since this is an immutable struct and only const is allowed sig {params(name: Symbol, cls: T.untyped, rules: T.untyped).void} - def self.prop(name, cls, rules={}) + def self.prop(name, cls, **rules) return super if (cls.is_a?(Hash) && cls[:immutable]) || rules[:immutable] raise "Cannot use `prop` in #{self.name} because it is an immutable struct. Use `const` instead" diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/anything.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/anything.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/anything.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/anything.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/attached_class.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/attached_class.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/attached_class.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/attached_class.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/base.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/base.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/base.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/base.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/class_of.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/class_of.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/class_of.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/class_of.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/enum.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/enum.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/enum.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/enum.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/fixed_array.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/fixed_array.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/fixed_array.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/fixed_array.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/fixed_hash.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/fixed_hash.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/fixed_hash.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/fixed_hash.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/intersection.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/intersection.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/intersection.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/intersection.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/noreturn.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/noreturn.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/noreturn.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/noreturn.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/proc.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/proc.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/proc.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/proc.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/self_type.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/self_type.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/self_type.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/self_type.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/simple.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/simple.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/simple.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/simple.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/t_enum.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/t_enum.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/t_enum.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/t_enum.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/type_member.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/type_member.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/type_member.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/type_member.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/type_parameter.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/type_parameter.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/type_parameter.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/type_parameter.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/type_template.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/type_template.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/type_template.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/type_template.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/type_variable.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/type_variable.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/type_variable.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/type_variable.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/typed_array.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/typed_array.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/typed_array.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/typed_array.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/typed_class.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/typed_class.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/typed_class.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/typed_class.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/typed_enumerable.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/typed_enumerable.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/typed_enumerable.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/typed_enumerable.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/typed_enumerator.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/typed_enumerator.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/typed_enumerator.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/typed_enumerator.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/typed_enumerator_chain.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/typed_enumerator_chain.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/typed_enumerator_chain.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/typed_enumerator_chain.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/typed_enumerator_lazy.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/typed_enumerator_lazy.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/typed_enumerator_lazy.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/typed_enumerator_lazy.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/typed_hash.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/typed_hash.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/typed_hash.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/typed_hash.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/typed_range.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/typed_range.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/typed_range.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/typed_range.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/typed_set.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/typed_set.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/typed_set.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/typed_set.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/union.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/union.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/union.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/union.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/untyped.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/untyped.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/types/untyped.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/types/untyped.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/utils.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/utils.rb similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11388/lib/types/utils.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/sorbet-runtime-0.5.11435/lib/types/utils.rb diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/warning-1.3.0/MIT-LICENSE b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/warning-1.4.0/MIT-LICENSE similarity index 100% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/warning-1.3.0/MIT-LICENSE rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/warning-1.4.0/MIT-LICENSE diff --git a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/warning-1.3.0/lib/warning.rb b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/warning-1.4.0/lib/warning.rb similarity index 92% rename from Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/warning-1.3.0/lib/warning.rb rename to Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/warning-1.4.0/lib/warning.rb index 9179aa377359d7..db5794c5c5ca66 100644 --- a/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/warning-1.3.0/lib/warning.rb +++ b/Library/Homebrew/vendor/bundle/ruby/3.3.0/gems/warning-1.4.0/lib/warning.rb @@ -4,18 +4,19 @@ module Warning module Processor # Map of symbols to regexps for warning messages to ignore. IGNORE_MAP = { - ambiguous_slash: /: warning: ambiguous first argument; put parentheses or a space even after `\/' operator\n\z|: warning: ambiguity between regexp and two divisions: wrap regexp in parentheses or add a space after `\/' operator\n\z/, - arg_prefix: /: warning: `[&\*]' interpreted as argument prefix\n\z/, + ambiguous_slash: /: warning: ambiguous first argument; put parentheses or a space even after [`']\/' operator\n\z|: warning: ambiguity between regexp and two divisions: wrap regexp in parentheses or add a space after [`']\/' operator\n\z/, + arg_prefix: /: warning: [`'][&\*]' interpreted as argument prefix\n\z/, bignum: /: warning: constant ::Bignum is deprecated\n\z/, fixnum: /: warning: constant ::Fixnum is deprecated\n\z/, + ignored_block: /: warning: the block passed to '.+' defined at .+:\d+ may be ignored\n\z/, method_redefined: /: warning: method redefined; discarding old .+\n\z|: warning: previous definition of .+ was here\n\z/, - missing_gvar: /: warning: global variable `\$.+' not initialized\n\z/, + missing_gvar: /: warning: global variable [`']\$.+' not initialized\n\z/, missing_ivar: /: warning: instance variable @.+ not initialized\n\z/, not_reached: /: warning: statement not reached\n\z/, shadow: /: warning: shadowing outer local variable - \w+\n\z/, unused_var: /: warning: assigned but unused variable - \w+\n\z/, useless_operator: /: warning: possibly useless use of [> proc do |warning| # LOGGER.warning(warning) # end, - # /global variable `\$\w+' not initialized/ => proc do |warning| + # /global variable [`']\$\w+' not initialized/ => proc do |warning| # LOGGER.error(warning) # end # ) diff --git a/Library/Homebrew/vendor/gems/mechanize b/Library/Homebrew/vendor/gems/mechanize index 0cef0a4d1feba6..a426d8a69a4363 120000 --- a/Library/Homebrew/vendor/gems/mechanize +++ b/Library/Homebrew/vendor/gems/mechanize @@ -1 +1 @@ -mechanize-2.10.0/ \ No newline at end of file +mechanize-2.10.1/ \ No newline at end of file diff --git a/Library/Homebrew/vendor/gems/mechanize-2.10.0/LICENSE.txt b/Library/Homebrew/vendor/gems/mechanize-2.10.1/LICENSE.txt similarity index 100% rename from Library/Homebrew/vendor/gems/mechanize-2.10.0/LICENSE.txt rename to Library/Homebrew/vendor/gems/mechanize-2.10.1/LICENSE.txt diff --git a/Library/Homebrew/vendor/gems/mechanize-2.10.0/lib/mechanize/http/content_disposition_parser.rb b/Library/Homebrew/vendor/gems/mechanize-2.10.1/lib/mechanize/http/content_disposition_parser.rb similarity index 100% rename from Library/Homebrew/vendor/gems/mechanize-2.10.0/lib/mechanize/http/content_disposition_parser.rb rename to Library/Homebrew/vendor/gems/mechanize-2.10.1/lib/mechanize/http/content_disposition_parser.rb diff --git a/Library/Homebrew/vendor/gems/mechanize-2.10.0/lib/mechanize/version.rb b/Library/Homebrew/vendor/gems/mechanize-2.10.1/lib/mechanize/version.rb similarity index 70% rename from Library/Homebrew/vendor/gems/mechanize-2.10.0/lib/mechanize/version.rb rename to Library/Homebrew/vendor/gems/mechanize-2.10.1/lib/mechanize/version.rb index 442e458abd9ac5..4e94c12931f00c 100644 --- a/Library/Homebrew/vendor/gems/mechanize-2.10.0/lib/mechanize/version.rb +++ b/Library/Homebrew/vendor/gems/mechanize-2.10.1/lib/mechanize/version.rb @@ -1,4 +1,4 @@ # frozen_string_literal: true class Mechanize - VERSION = "2.10.0" + VERSION = "2.10.1" end diff --git a/Library/Homebrew/vendor/portable-ruby-version b/Library/Homebrew/vendor/portable-ruby-version index bea438e9ade770..619b537668489e 100644 --- a/Library/Homebrew/vendor/portable-ruby-version +++ b/Library/Homebrew/vendor/portable-ruby-version @@ -1 +1 @@ -3.3.1 +3.3.3 diff --git a/Library/Homebrew/version.rb b/Library/Homebrew/version.rb index f6cf4435267d90..3ab67d324ccd93 100644 --- a/Library/Homebrew/version.rb +++ b/Library/Homebrew/version.rb @@ -1,7 +1,6 @@ -# typed: true +# typed: strict # frozen_string_literal: true -require "pkg_version" require "version/parser" # A formula's version. @@ -141,7 +140,7 @@ def inspect private_constant :NullToken # Represents the absence of a token. - NULL_TOKEN = NullToken.new.freeze + NULL_TOKEN = T.let(NullToken.new.freeze, NullToken) # A token string. class StringToken < Token @@ -328,7 +327,7 @@ def <=>(other) end end - SCAN_PATTERN = Regexp.union( + SCAN_PATTERN = T.let(Regexp.union( AlphaToken::PATTERN, BetaToken::PATTERN, PreToken::PATTERN, @@ -337,7 +336,7 @@ def <=>(other) PostToken::PATTERN, NumericToken::PATTERN, StringToken::PATTERN, - ).freeze + ).freeze, Regexp) private_constant :SCAN_PATTERN sig { params(url: T.any(String, Pathname), specs: T.untyped).returns(Version) } @@ -345,7 +344,7 @@ def self.detect(url, **specs) parse(specs.fetch(:tag, url), detected_from_url: true) end - sig { params(spec: T.any(String, Pathname), detected_from_url: T::Boolean).returns(T.attached_class) } + sig { params(spec: T.any(String, Pathname), detected_from_url: T::Boolean).returns(Version) } def self.parse(spec, detected_from_url: false) spec = CGI.unescape(spec.to_s) if detected_from_url @@ -359,22 +358,22 @@ def self.parse(spec, detected_from_url: false) NULL end - NUMERIC_WITH_OPTIONAL_DOTS = /(?:\d+(?:\.\d+)*)/.source.freeze + NUMERIC_WITH_OPTIONAL_DOTS = T.let(/(?:\d+(?:\.\d+)*)/.source.freeze, String) private_constant :NUMERIC_WITH_OPTIONAL_DOTS - NUMERIC_WITH_DOTS = /(?:\d+(?:\.\d+)+)/.source.freeze + NUMERIC_WITH_DOTS = T.let(/(?:\d+(?:\.\d+)+)/.source.freeze, String) private_constant :NUMERIC_WITH_DOTS - MINOR_OR_PATCH = /(?:\d+(?:\.\d+){1,2})/.source.freeze + MINOR_OR_PATCH = T.let(/(?:\d+(?:\.\d+){1,2})/.source.freeze, String) private_constant :MINOR_OR_PATCH - CONTENT_SUFFIX = /(?:[._-](?i:bin|dist|stable|src|sources?|final|full))/.source.freeze + CONTENT_SUFFIX = T.let(/(?:[._-](?i:bin|dist|stable|src|sources?|final|full))/.source.freeze, String) private_constant :CONTENT_SUFFIX - PRERELEASE_SUFFIX = /(?:[._-]?(?i:alpha|beta|pre|rc)\.?\d{,2})/.source.freeze + PRERELEASE_SUFFIX = T.let(/(?:[._-]?(?i:alpha|beta|pre|rc)\.?\d{,2})/.source.freeze, String) private_constant :PRERELEASE_SUFFIX - VERSION_PARSERS = [ + VERSION_PARSERS = T.let([ # date-based versioning # e.g. `2023-09-28.tar.gz` # e.g. `ltopers-v2017-04-14.tar.gz` @@ -486,15 +485,15 @@ def self.parse(spec, detected_from_url: false) # e.g. `https://secure.php.net/get/php-7.1.10.tar.bz2/from/this/mirror` UrlParser.new(/[-.vV]?(#{NUMERIC_WITH_DOTS}#{PRERELEASE_SUFFIX}?)/), - ].freeze + ].freeze, T::Array[Version::Parser]) private_constant :VERSION_PARSERS - sig { params(val: T.any(PkgVersion, String, Version), detected_from_url: T::Boolean).void } + sig { params(val: T.any(String, Version), detected_from_url: T::Boolean).void } def initialize(val, detected_from_url: false) version = val.to_str raise ArgumentError, "Version must not be empty" if version.blank? - @version = version + @version = T.let(version, String) @detected_from_url = detected_from_url end @@ -760,7 +759,10 @@ def freeze sig { returns(T::Array[Token]) } def tokens - @tokens ||= version&.scan(SCAN_PATTERN)&.map { |token| Token.create(T.cast(token, String)) } || [] + @tokens ||= T.let( + version&.scan(SCAN_PATTERN)&.map { |token| Token.create(T.cast(token, String)) } || [], + T.nilable(T::Array[Token]), + ) end private @@ -773,5 +775,5 @@ def max(first, second) # Represents the absence of a version. # # NOTE: Constructor needs to called with an arbitrary non-empty version which is then set to `nil`. - NULL = Version.new("NULL").tap { |v| v.instance_variable_set(:@version, nil) }.freeze + NULL = T.let(Version.new("NULL").tap { |v| v.instance_variable_set(:@version, nil) }.freeze, Version) end diff --git a/Library/Homebrew/version.rbi b/Library/Homebrew/version.rbi deleted file mode 100644 index ef503c15546216..00000000000000 --- a/Library/Homebrew/version.rbi +++ /dev/null @@ -1,10 +0,0 @@ -# typed: strict - -class Version - # For `alias eql? ==` - # See discussions: - # - https://github.com/sorbet/sorbet/pull/1443 - # - https://github.com/sorbet/sorbet/issues/2378 - sig { params(other: T.untyped).returns(T::Boolean) } - def ==(other); end -end diff --git a/Library/Homebrew/version/parser.rb b/Library/Homebrew/version/parser.rb index 76732dd92bf598..99beb4f82d0118 100644 --- a/Library/Homebrew/version/parser.rb +++ b/Library/Homebrew/version/parser.rb @@ -1,4 +1,4 @@ -# typed: true +# typed: strict # frozen_string_literal: true class Version diff --git a/README.md b/README.md index 9fba65ab851f84..38292276ee209f 100644 --- a/README.md +++ b/README.md @@ -59,7 +59,7 @@ Homebrew's [Project Leadership Committee](https://docs.brew.sh/Homebrew-Governan Homebrew's [Technical Steering Committee](https://docs.brew.sh/Homebrew-Governance#7-technical-steering-committee) is [Bo Anderson](https://github.com/Bo98), [FX Coudert](https://github.com/fxcoudert), [Michka Popoff](https://github.com/iMichka), [Mike McQuaid](https://github.com/MikeMcQuaid) and [Rylan Polster](https://github.com/Rylan12). -Homebrew's maintainers are [Alexander Bayandin](https://github.com/bayandin), [Bevan Kay](https://github.com/bevanjkay), [Bo Anderson](https://github.com/Bo98), [Branch Vincent](https://github.com/branchvincent), [Caleb Xu](https://github.com/alebcay), [Carlo Cabrera](https://github.com/carlocab), [David Baumgold](https://github.com/singingwolfboy), [Douglas Eichelberger](https://github.com/dduugg), [Dustin Rodrigues](https://github.com/dtrodrigues), [Eric Knibbe](https://github.com/EricFromCanada), [FX Coudert](https://github.com/fxcoudert), [Issy Long](https://github.com/issyl0), [Justin Krehel](https://github.com/krehel), [Markus Reiter](https://github.com/reitermarkus), [Miccal Matthews](https://github.com/miccal), [Michael Cho](https://github.com/cho-m), [Michka Popoff](https://github.com/iMichka), [Mike McQuaid](https://github.com/MikeMcQuaid), [Nanda H Krishna](https://github.com/nandahkrishna), [Patrick Linnane](https://github.com/p-linnane), [Razvan Azamfirei](https://github.com/razvanazamfirei), [Rui Chen](https://github.com/chenrui333), [Ruoyu Zhong](https://github.com/ZhongRuoyu), [Rylan Polster](https://github.com/Rylan12), [Sam Ford](https://github.com/samford), [Sean Molenaar](https://github.com/SMillerDev), [Thierry Moisan](https://github.com/Moisan), [Timothy Sutton](https://github.com/timsutton) and [William Woodruff](https://github.com/woodruffw). +Homebrew's maintainers are [Alexander Bayandin](https://github.com/bayandin), [Bevan Kay](https://github.com/bevanjkay), [Bo Anderson](https://github.com/Bo98), [Branch Vincent](https://github.com/branchvincent), [Caleb Xu](https://github.com/alebcay), [Carlo Cabrera](https://github.com/carlocab), [Douglas Eichelberger](https://github.com/dduugg), [Dustin Rodrigues](https://github.com/dtrodrigues), [Eric Knibbe](https://github.com/EricFromCanada), [FX Coudert](https://github.com/fxcoudert), [Issy Long](https://github.com/issyl0), [Justin Krehel](https://github.com/krehel), [Markus Reiter](https://github.com/reitermarkus), [Miccal Matthews](https://github.com/miccal), [Michael Cho](https://github.com/cho-m), [Michka Popoff](https://github.com/iMichka), [Mike McQuaid](https://github.com/MikeMcQuaid), [Nanda H Krishna](https://github.com/nandahkrishna), [Patrick Linnane](https://github.com/p-linnane), [Razvan Azamfirei](https://github.com/razvanazamfirei), [Rui Chen](https://github.com/chenrui333), [Ruoyu Zhong](https://github.com/ZhongRuoyu), [Rylan Polster](https://github.com/Rylan12), [Sam Ford](https://github.com/samford), [Sean Molenaar](https://github.com/SMillerDev), [Thierry Moisan](https://github.com/Moisan), [Timothy Sutton](https://github.com/timsutton) and [William Woodruff](https://github.com/woodruffw). Former maintainers with significant contributions include [Misty De Méo](https://github.com/mistydemeo), [Shaun Jackman](https://github.com/sjackman), [Vítor Galvão](https://github.com/vitorgalvao), [Claudia Pellegrino](https://github.com/claui), [Seeker](https://github.com/SeekingMeaning), [Jan Viljanen](https://github.com/javian), [JCount](https://github.com/jcount), [commitay](https://github.com/commitay), [Dominyk Tiller](https://github.com/DomT4), [Tim Smith](https://github.com/tdsmith), [Baptiste Fontaine](https://github.com/bfontaine), [Xu Cheng](https://github.com/xu-cheng), [Martin Afanasjew](https://github.com/UniqMartin), [Brett Koonce](https://github.com/asparagui), [Charlie Sharpsteen](https://github.com/Sharpie), [Jack Nagel](https://github.com/jacknagel), [Adam Vandenberg](https://github.com/adamv), [Andrew Janke](https://github.com/apjanke), [Alex Dunn](https://github.com/dunn), [neutric](https://github.com/neutric), [Tomasz Pajor](https://github.com/nijikon), [Uladzislau Shablinski](https://github.com/vladshablinsky), [Alyssa Ross](https://github.com/alyssais), [ilovezfs](https://github.com/ilovezfs), [Chongyu Zhu](https://github.com/lembacon) and Homebrew's creator: [Max Howell](https://github.com/mxcl). @@ -87,6 +87,6 @@ Flaky test detection and tracking is provided by [BuildPulse](https://buildpulse [![DNSimple](https://cdn.dnsimple.com/assets/resolving-with-us/logo-light.png)](https://dnsimple.com/resolving/homebrew#gh-light-mode-only) [![DNSimple](https://cdn.dnsimple.com/assets/resolving-with-us/logo-dark.png)](https://dnsimple.com/resolving/homebrew#gh-dark-mode-only) -Homebrew is generously supported by [GitHub](https://github.com/github), [Custom Ink](https://github.com/customink), [Randy Reddig](https://github.com/ydnar), [Codecademy](https://github.com/Codecademy), [MacPaw Inc.](https://github.com/MacPaw), [fly.io](https://github.com/superfly), [Workbrew](https://github.com/Workbrew) and many other users and organisations via [GitHub Sponsors](https://github.com/sponsors/Homebrew). +Homebrew is generously supported by [GitHub](https://github.com/github), [Custom Ink](https://github.com/customink), [Randy Reddig](https://github.com/ydnar), [Codecademy](https://github.com/Codecademy), [MacPaw Inc.](https://github.com/MacPaw), [fly.io](https://github.com/superfly), [Sasha Suarez](https://github.com/sashansuarez), [Workbrew](https://github.com/Workbrew) and many other users and organisations via [GitHub Sponsors](https://github.com/sponsors/Homebrew). [![GitHub](https://github.com/github.png?size=64)](https://github.com/github)[![fly.io](https://github.com/superfly.png?size=64)](https://github.com/superfly) diff --git a/bin/brew b/bin/brew index e83837ecedc6fb..3d70018d67daa1 100755 --- a/bin/brew +++ b/bin/brew @@ -57,6 +57,12 @@ do done unset cmd +# Take the HOMEBREW_PATH if we are running brew within brew, otherwise we would lose the original path. +if [[ -n "${HOMEBREW_BREW_FILE:-}" && -n "${HOMEBREW_PATH:-}" ]] +then + PATH="${HOMEBREW_PATH}" +fi + BREW_FILE_DIRECTORY="$(quiet_cd "${0%/*}/" && pwd -P)" HOMEBREW_BREW_FILE="${BREW_FILE_DIRECTORY%/}/${0##*/}" HOMEBREW_PREFIX="${HOMEBREW_BREW_FILE%/*/*}" @@ -174,6 +180,7 @@ USED_BY_HOMEBREW_VARS=( TMUX XDG_CACHE_HOME XDG_RUNTIME_DIR + ZDOTDIR ) for VAR in "${USED_BY_HOMEBREW_VARS[@]}" do diff --git a/completions/bash/brew b/completions/bash/brew index e05248d8a0687d..d0dd3b1b888fe7 100644 --- a/completions/bash/brew +++ b/completions/bash/brew @@ -601,8 +601,8 @@ _brew_cleanup() { --prune --prune-prefix --quiet + --scrub --verbose - -s " return ;; @@ -2107,6 +2107,25 @@ _brew_style() { __brew_complete_casks } +_brew_tab() { + local cur="${COMP_WORDS[COMP_CWORD]}" + case "${cur}" in + -*) + __brewcomp " + --debug + --help + --installed-on-request + --no-installed-on-request + --quiet + --verbose + " + return + ;; + *) ;; + esac + __brew_complete_formulae +} + _brew_tap() { local cur="${COMP_WORDS[COMP_CWORD]}" case "${cur}" in @@ -2765,6 +2784,7 @@ _brew() { search) _brew_search ;; sh) _brew_sh ;; style) _brew_style ;; + tab) _brew_tab ;; tap) _brew_tap ;; tap-info) _brew_tap_info ;; tap-new) _brew_tap_new ;; diff --git a/completions/fish/brew.fish b/completions/fish/brew.fish index b49787810a924d..7dc4fddc68fd48 100644 --- a/completions/fish/brew.fish +++ b/completions/fish/brew.fish @@ -487,8 +487,8 @@ __fish_brew_complete_arg 'cleanup' -l help -d 'Show this message' __fish_brew_complete_arg 'cleanup' -l prune -d 'Remove all cache files older than specified days. If you want to remove everything, use `--prune=all`' __fish_brew_complete_arg 'cleanup' -l prune-prefix -d 'Only prune the symlinks and directories from the prefix and remove no other files' __fish_brew_complete_arg 'cleanup' -l quiet -d 'Make some output more quiet' +__fish_brew_complete_arg 'cleanup' -l scrub -d 'Scrub the cache, including downloads for even the latest versions. Note that downloads for any installed formulae or casks will still not be deleted. If you want to delete those too: `rm -rf "$(brew --cache)"`' __fish_brew_complete_arg 'cleanup' -l verbose -d 'Make some output more verbose' -__fish_brew_complete_arg 'cleanup' -l s -d 'Scrub the cache, including downloads for even the latest versions. Note that downloads for any installed formulae or casks will still not be deleted. If you want to delete those too: `rm -rf "$(brew --cache)"`' __fish_brew_complete_arg 'cleanup' -a '(__fish_brew_suggest_formulae_all)' __fish_brew_complete_arg 'cleanup' -a '(__fish_brew_suggest_casks_all)' @@ -1413,6 +1413,16 @@ __fish_brew_complete_arg 'style; and not __fish_seen_argument -l cask -l casks' __fish_brew_complete_arg 'style; and not __fish_seen_argument -l formula -l formulae' -a '(__fish_brew_suggest_casks_all)' +__fish_brew_complete_cmd 'tab' 'Edit tab information for installed formulae' +__fish_brew_complete_arg 'tab' -l debug -d 'Display any debugging information' +__fish_brew_complete_arg 'tab' -l help -d 'Show this message' +__fish_brew_complete_arg 'tab' -l installed-on-request -d 'Mark formula as installed on request' +__fish_brew_complete_arg 'tab' -l no-installed-on-request -d 'Mark formula as not installed on request' +__fish_brew_complete_arg 'tab' -l quiet -d 'Make some output more quiet' +__fish_brew_complete_arg 'tab' -l verbose -d 'Make some output more verbose' +__fish_brew_complete_arg 'tab' -a '(__fish_brew_suggest_formulae_all)' + + __fish_brew_complete_cmd 'tap' 'Tap a formula repository' __fish_brew_complete_arg 'tap' -l custom-remote -d 'Install or change a tap with a custom remote. Useful for mirrors' __fish_brew_complete_arg 'tap' -l debug -d 'Display any debugging information' diff --git a/completions/internal_commands_list.txt b/completions/internal_commands_list.txt index 6c5b7423f36334..58ca1ea8c556f9 100644 --- a/completions/internal_commands_list.txt +++ b/completions/internal_commands_list.txt @@ -90,6 +90,7 @@ setup-ruby sh shellenv style +tab tap tap-info tap-new diff --git a/completions/zsh/_brew b/completions/zsh/_brew index b8001fc2d0d22c..2ff535c60b235b 100644 --- a/completions/zsh/_brew +++ b/completions/zsh/_brew @@ -210,6 +210,7 @@ __brew_internal_commands() { 'sh:Enter an interactive shell for Homebrew'\''s build environment' 'shellenv:Print export statements' 'style:Check formulae or files for conformance to Homebrew style guidelines' + 'tab:Edit tab information for installed formulae' 'tap:Tap a formula repository' 'tap-info:Show detailed information about one or more taps' 'tap-new:Generate the template files for a new tap' @@ -626,8 +627,8 @@ _brew_cleanup() { '--prune[Remove all cache files older than specified days. If you want to remove everything, use `--prune=all`]' \ '--prune-prefix[Only prune the symlinks and directories from the prefix and remove no other files]' \ '--quiet[Make some output more quiet]' \ + '--scrub[Scrub the cache, including downloads for even the latest versions. Note that downloads for any installed formulae or casks will still not be deleted. If you want to delete those too: `rm -rf "$(brew --cache)"`]' \ '--verbose[Make some output more verbose]' \ - '-s[Scrub the cache, including downloads for even the latest versions. Note that downloads for any installed formulae or casks will still not be deleted. If you want to delete those too: `rm -rf "$(brew --cache)"`]' \ - formula \ '*::formula:__brew_formulae' \ - cask \ @@ -1747,6 +1748,19 @@ _brew_style() { '*::cask:__brew_casks' } +# brew tab +_brew_tab() { + _arguments \ + '--debug[Display any debugging information]' \ + '--help[Show this message]' \ + '(--no-installed-on-request)--installed-on-request[Mark formula as installed on request]' \ + '(--installed-on-request)--no-installed-on-request[Mark formula as not installed on request]' \ + '--quiet[Make some output more quiet]' \ + '--verbose[Make some output more verbose]' \ + - formula \ + '*::formula:__brew_formulae' +} + # brew tap _brew_tap() { _arguments \ diff --git a/dagger/main.go b/dagger/main.go index 4f6a340a2d6521..7ea8cb077590d7 100644 --- a/dagger/main.go +++ b/dagger/main.go @@ -40,35 +40,40 @@ func (m *Brew) PublishAll(ctx context.Context, src *Directory, hubUsername strin // publishes image to specified registry func (m *Brew) Publish(ctx context.Context, src *Directory, registry, username string, token *Secret, commitSHA string, brewVersion string) error { - for _, version := range versions { - c := m.BaseContainer(src, version, commitSHA, "franela/brew", "franela", version, brewVersion) + eg := errgroup.Group{} - addr, err := c. - WithRegistryAuth(registry, username, token). - Publish(ctx, registry+"/"+username+"/brew-ubuntu:"+version) - if err != nil { - return err - } - fmt.Println("published at", addr) + eg.Go(func() error { + for _, version := range versions { + c := m.BaseContainer(src, version, commitSHA, "franela/brew", "franela", version, brewVersion) - addr, err = c. - Publish(ctx, registry+"/"+username+"/brew-ubuntu:latest") - if err != nil { - return err - } + addr, err := c. + WithRegistryAuth(registry, username, token). + Publish(ctx, registry+"/"+username+"/brew-ubuntu:"+version) + if err != nil { + return err + } + fmt.Println("published at", addr) - if version == "22.04" { addr, err = c. - Publish(ctx, registry+"/"+username+"/brew:latest") + Publish(ctx, registry+"/"+username+"/brew-ubuntu:latest") if err != nil { return err } - } - fmt.Println("published at", addr) - } + if version == "22.04" { + addr, err = c. + Publish(ctx, registry+"/"+username+"/brew:latest") + if err != nil { + return err + } + } - return nil + fmt.Println("published at", addr) + } + return nil + }) + + return eg.Wait() } // runs brew test-bot against latest ubuntu image diff --git a/docs/.mdl_ruleset.rb b/docs/.mdl_ruleset.rb index a32f752d2e6546..7cf80606d77e7c 100644 --- a/docs/.mdl_ruleset.rb +++ b/docs/.mdl_ruleset.rb @@ -1,6 +1,9 @@ -rule 'HB034', 'Bare unstyled URL used' do +# typed: true +# frozen_string_literal: true + +rule "HB034", "Bare unstyled URL used" do tags :links, :url - aliases 'no-bare-unstyled-urls' + aliases "no-bare-unstyled-urls" check do |doc| doc.matching_text_element_lines(%r{(?<=\s)https?://}) end diff --git a/docs/.mdl_style.rb b/docs/.mdl_style.rb index d7a297fede2041..dda5902a4e8da4 100644 --- a/docs/.mdl_style.rb +++ b/docs/.mdl_style.rb @@ -1,8 +1,11 @@ +# typed: true +# frozen_string_literal: true + all -rule 'MD007', indent: 2 # Unordered list indentation -rule 'MD026', punctuation: ',;:' # Trailing punctuation in header -exclude_rule 'MD013' # Line length -exclude_rule 'MD029' # Ordered list item prefix -exclude_rule 'MD033' # Inline HTML -exclude_rule 'MD034' # Bare URL used (replaced by HB034) -exclude_rule 'MD046' # Code block style +rule "MD007", indent: 2 # Unordered list indentation +rule "MD026", punctuation: ",;:" # Trailing punctuation in header +exclude_rule "MD013" # Line length +exclude_rule "MD029" # Ordered list item prefix +exclude_rule "MD033" # Inline HTML +exclude_rule "MD034" # Bare URL used (replaced by HB034) +exclude_rule "MD046" # Code block style diff --git a/docs/.rubocop.yml b/docs/.rubocop.yml index 62beffad295467..1c984c707e2dec 100644 --- a/docs/.rubocop.yml +++ b/docs/.rubocop.yml @@ -2,11 +2,9 @@ inherit_from: ../Library/.rubocop.yml AllCops: Exclude: - - Gemfile - - ".mdl*.rb" - - Rakefile - - "_site/**/*" - - Manpage.md + - "**/_site/**/*" + - "**/Manpage.md" + - "**/vendor/**/*" # These are included in docs deliberately to show what # `brew create` does and what the user should replace. @@ -21,7 +19,7 @@ FormulaAudit/Homepage: Layout/LineLength: Exclude: - - Bottles.md # The bottle block line length is long in its full form. + - "**/Bottles.md" # The bottle block line length is long in its full form. # Apparently Casks are allowed to have constant definitions in blocks and we document this. Lint/ConstantDefinitionInBlock: @@ -30,3 +28,7 @@ Lint/ConstantDefinitionInBlock: # A fake regexp is deliberately documented for `inreplace` in the Formula Cookbook. Style/RedundantRegexpArgument: Enabled: false + +# Want to be able to display partial formulae in the docs. +Style/TopLevelMethodDefinition: + Enabled: false diff --git a/docs/.ruby-version b/docs/.ruby-version deleted file mode 100644 index bea438e9ade770..00000000000000 --- a/docs/.ruby-version +++ /dev/null @@ -1 +0,0 @@ -3.3.1 diff --git a/docs/.ruby-version b/docs/.ruby-version new file mode 120000 index 00000000000000..120ff9fc88ee53 --- /dev/null +++ b/docs/.ruby-version @@ -0,0 +1 @@ +../Library/Homebrew/.ruby-version \ No newline at end of file diff --git a/docs/Brew-Livecheck.md b/docs/Brew-Livecheck.md index 36cfce54bf8c6a..bca5bde5ac25b9 100644 --- a/docs/Brew-Livecheck.md +++ b/docs/Brew-Livecheck.md @@ -188,7 +188,7 @@ A `strategy` block for `Git` is a bit different, as the block receives an array livecheck do url :stable strategy :git do |tags| - tags.map { |tag| tag[/^(\d{4}-\d{2}-\d{2})$/i, 1]&.gsub(/\D/, "") }.compact + tags.filter_map { |tag| tag[/^(\d{4}-\d{2}-\d{2})$/i, 1]&.gsub(/\D/, "") } end end ``` diff --git a/docs/External-Commands.md b/docs/External-Commands.md index ec5f5f4c84ca7e..05ab51e46a2bba 100644 --- a/docs/External-Commands.md +++ b/docs/External-Commands.md @@ -73,9 +73,9 @@ module Homebrew Do something. Place a description here. EOS switch "-f", "--force", - description: "Force doing something in the command." + description: "Force doing something in the command." flag "--file=", - description: "Specify a file to do something with in the command." + description: "Specify a file to do something with in the command." comma_array "--names", description: "Add a list of names to the command." diff --git a/docs/Gemfile b/docs/Gemfile index f45f45b95f0de6..12ef85fa9750c8 100644 --- a/docs/Gemfile +++ b/docs/Gemfile @@ -1,3 +1,5 @@ +# frozen_string_literal: true + source "https://rubygems.org" ruby file: ".ruby-version" diff --git a/docs/Homebrew-Governance.md b/docs/Homebrew-Governance.md index 012d34ee9c50e1..db47f3d6cc672a 100644 --- a/docs/Homebrew-Governance.md +++ b/docs/Homebrew-Governance.md @@ -64,7 +64,7 @@ 1. When a PLC seat is up for election or is vacant, any member may become a candidate for the PLC by providing a brief statement in the `#members` channel in Homebrew's Slack expressing relevant experience and intentions if elected no later than three weeks before the AGM. The PLC will maintain the candidate list until ballots are sent out one week before the AGM, during which time members should cast their votes. Candidates should deliver remarks in writing or verbally before or during the AGM but votes already cast are not changeable. The current PLC should vote on and publish a statement recommending their preferred candidates within the three-week period between the candidate deadline and the AGM. -1. The PLC must report all minutes, participants in discussions and breakdowns of any votes cast to Homebrew members in the Homebrew/homebrew-governance-private GitHub repository no later than one week after the action has been taken. At the AGM, the PLC must present a summary of their activities and decisions since the last AGM. Financial statements can be viewed by anyone on the internet on Homebrew's OpenCollectives ( and ). +1. The PLC must report all minutes, participants in discussions and breakdowns of any votes cast to Homebrew members in the Homebrew/homebrew-governance-private GitHub repository no later than one week after the action has been taken. At the AGM, the PLC must present a summary of their activities and decisions since the last AGM. Financial statements can be viewed by anyone on the internet on [Homebrew's OpenCollective](https://opencollective.com/homebrew). 1. No more than two employees of the same employer may serve on the PLC. diff --git a/docs/How-to-Create-and-Maintain-a-Tap.md b/docs/How-to-Create-and-Maintain-a-Tap.md index 995f74fd045ce0..9a5fcf5c1db91a 100644 --- a/docs/How-to-Create-and-Maintain-a-Tap.md +++ b/docs/How-to-Create-and-Maintain-a-Tap.md @@ -18,9 +18,9 @@ If a formula in your tap has the same name as a Homebrew/homebrew-core formula t ## Installing -If it’s on GitHub, users can install any of your formulae with `brew install user/repo/formula`. Homebrew will automatically add your `github.com/user/homebrew-repo` tap before installing the formula. `user/repo/formula` points to the `github.com/user/homebrew-repo/**/formula.rb` file here. +If it’s on GitHub, users can install any of your formulae with `brew install user/repo/formula`. Homebrew will automatically add your `github.com/user/homebrew-repository` tap before installing the formula. `user/repo/formula` points to the `github.com/user/homebrew-repo/**/formula.rb` file here. -To install your tap without installing any formula at the same time, users can add it with the [`brew tap` command](Taps.md). If it’s on GitHub, they can use `brew tap user/repo`, where `user` is your GitHub username and `homebrew-repo` is your repository. If it’s hosted outside of GitHub, they have to use `brew tap user/repo `, where `user` and `repo` will be used to refer to your tap and `` is your Git clone URL. +To install your tap without installing any formula at the same time, users can add it with the [`brew tap` command](Taps.md). If it’s on GitHub, they can use `brew tap user/repository`, where `user` is your GitHub username and `homebrew-repository` is your repository. If it’s hosted outside of GitHub, they have to use `brew tap user/repo `, where `user` and `repository` will be used to refer to your tap and `` is your Git clone URL. Users can then install your formulae either with `brew install foo` if there’s no core formula with the same name, or with `brew install user/repo/foo` to avoid conflicts. diff --git a/docs/Manpage.md b/docs/Manpage.md index 5baf1665b1f061..a26e4165a8d84d 100644 --- a/docs/Manpage.md +++ b/docs/Manpage.md @@ -142,7 +142,7 @@ old. This can be adjusted with `HOMEBREW_CLEANUP_MAX_AGE_DAYS`. : Show what would be removed, but do not actually remove anything. -`-s` +`-s`, `--scrub` : Scrub the cache, including downloads for even the latest versions. Note that downloads for any installed formulae or casks will still not be deleted. If @@ -1162,6 +1162,23 @@ evaluation of this command's output to your dotfiles (e.g. `~/.bash_profile` or The shell can be specified explicitly with a supported shell name parameter. Unknown shells will output POSIX exports. +### `tab` \[`--installed-on-request`\] \[`--no-installed-on-request`\] *`formula`* \[...\] + +Edit tab information for installed formulae. + +This can be useful when you want to control whether an installed formula should +be removed by `brew autoremove`. To prevent removal, mark the formula as +installed on request; to allow removal, mark the formula as not installed on +request. + +`--installed-on-request` + +: Mark *`formula`* as installed on request. + +`--no-installed-on-request` + +: Mark *`formula`* as not installed on request. + ### `tap` \[*`options`*\] \[*`user`*`/`*`repo`*\] \[*`URL`*\] Tap a formula repository. If no arguments are provided, list all installed taps. @@ -4067,11 +4084,11 @@ Homebrew's Technical Steering Committee is Bo Anderson, FX Coudert, Michka Popoff, Mike McQuaid and Rylan Polster. Homebrew's maintainers are Alexander Bayandin, Bevan Kay, Bo Anderson, Branch -Vincent, Caleb Xu, Carlo Cabrera, David Baumgold, Douglas Eichelberger, Dustin -Rodrigues, Eric Knibbe, FX Coudert, Issy Long, Justin Krehel, Markus Reiter, -Miccal Matthews, Michael Cho, Michka Popoff, Mike McQuaid, Nanda H Krishna, -Patrick Linnane, Razvan Azamfirei, Rui Chen, Ruoyu Zhong, Rylan Polster, Sam -Ford, Sean Molenaar, Thierry Moisan, Timothy Sutton and William Woodruff. +Vincent, Caleb Xu, Carlo Cabrera, Douglas Eichelberger, Dustin Rodrigues, Eric +Knibbe, FX Coudert, Issy Long, Justin Krehel, Markus Reiter, Miccal Matthews, +Michael Cho, Michka Popoff, Mike McQuaid, Nanda H Krishna, Patrick Linnane, +Razvan Azamfirei, Rui Chen, Ruoyu Zhong, Rylan Polster, Sam Ford, Sean Molenaar, +Thierry Moisan, Timothy Sutton and William Woodruff. Former maintainers with significant contributions include Misty De Méo, Shaun Jackman, Vítor Galvão, Claudia Pellegrino, Seeker, Jan Viljanen, JCount, diff --git a/docs/Rakefile b/docs/Rakefile index a0c160583d8cf0..4d76f69297f900 100644 --- a/docs/Rakefile +++ b/docs/Rakefile @@ -1,3 +1,5 @@ +# frozen_string_literal: true + require "rake" task default: :build @@ -17,26 +19,27 @@ task test: :build do require "html-proofer" HTMLProofer.check_directory( "./_site", - parallel: { in_threads: 4 }, - favicon: true, + parallel: { in_threads: 4 }, + favicon: true, ignore_status_codes: [0, 403], - check_favicon: true, - check_opengraph: true, - check_html: true, - check_img_http: true, - enforce_https: true, - ignore_files: [ - %r{Kickstarter-Supporters}, + check_favicon: true, + check_opengraph: true, + check_html: true, + check_img_http: true, + enforce_https: true, + ignore_files: [ + /Kickstarter-Supporters/, ], - ignore_urls: [ + ignore_urls: [ + "/", %r{https://formulae.brew.sh"}, %r{https://github.com/}, - 'https://legacy.python.org/dev/peps/pep-0453/#recommendations-for-downstream-distributors', + "https://legacy.python.org/dev/peps/pep-0453/#recommendations-for-downstream-distributors", ], - cache: { + cache: { timeframe: { - external: "1h" - } - } + external: "1h", + }, + }, ).run end diff --git a/docs/docs_rubocop_style.yml b/docs/docs_rubocop_style.yml new file mode 120000 index 00000000000000..62a9e6e71f1c23 --- /dev/null +++ b/docs/docs_rubocop_style.yml @@ -0,0 +1 @@ +.rubocop.yml \ No newline at end of file diff --git a/manpages/brew.1 b/manpages/brew.1 index a911bcc8f9a445..b0207e1d06327d 100644 --- a/manpages/brew.1 +++ b/manpages/brew.1 @@ -1,5 +1,5 @@ .\" generated by kramdown -.TH "BREW" "1" "May 2024" "Homebrew" +.TH "BREW" "1" "June 2024" "Homebrew" .SH NAME brew \- The Missing Package Manager for macOS (or Linux) .SH "SYNOPSIS" @@ -88,7 +88,7 @@ Remove all cache files older than specified \fIdays\fP\&\. If you want to remove \fB\-n\fP, \fB\-\-dry\-run\fP Show what would be removed, but do not actually remove anything\. .TP -\fB\-s\fP +\fB\-s\fP, \fB\-\-scrub\fP Scrub the cache, including downloads for even the latest versions\. Note that downloads for any installed formulae or casks will still not be deleted\. If you want to delete those too: \fBrm \-rf "$(brew \-\-cache)"\fP .TP \fB\-\-prune\-prefix\fP @@ -727,6 +727,16 @@ Print export statements\. When run in a shell, this installation of Homebrew wil The variables \fBHOMEBREW_PREFIX\fP, \fBHOMEBREW_CELLAR\fP and \fBHOMEBREW_REPOSITORY\fP are also exported to avoid querying them multiple times\. To help guarantee idempotence, this command produces no output when Homebrew\[u2019]s \fBbin\fP and \fBsbin\fP directories are first and second respectively in your \fBPATH\fP\&\. Consider adding evaluation of this command\[u2019]s output to your dotfiles (e\.g\. \fB~/\.bash_profile\fP or \fB~/\.zprofile\fP on macOS and \fB~/\.bashrc\fP or \fB~/\.zshrc\fP on Linux) with: \fBeval "$(brew shellenv)"\fP .P The shell can be specified explicitly with a supported shell name parameter\. Unknown shells will output POSIX exports\. +.SS "\fBtab\fP \fR[\fB\-\-installed\-on\-request\fP] \fR[\fB\-\-no\-installed\-on\-request\fP] \fIformula\fP \fR[\.\.\.]" +Edit tab information for installed formulae\. +.P +This can be useful when you want to control whether an installed formula should be removed by \fBbrew autoremove\fP\&\. To prevent removal, mark the formula as installed on request; to allow removal, mark the formula as not installed on request\. +.TP +\fB\-\-installed\-on\-request\fP +Mark \fIformula\fP as installed on request\. +.TP +\fB\-\-no\-installed\-on\-request\fP +Mark \fIformula\fP as not installed on request\. .SS "\fBtap\fP \fR[\fIoptions\fP] \fR[\fIuser\fP\fB/\fP\fIrepo\fP] \fR[\fIURL\fP]" Tap a formula repository\. If no arguments are provided, list all installed taps\. .P @@ -2674,7 +2684,7 @@ Homebrew\[u2019]s Project Leadership Committee is Colin Dean, Issy Long, Mike Mc .P Homebrew\[u2019]s Technical Steering Committee is Bo Anderson, FX Coudert, Michka Popoff, Mike McQuaid and Rylan Polster\. .P -Homebrew\[u2019]s maintainers are Alexander Bayandin, Bevan Kay, Bo Anderson, Branch Vincent, Caleb Xu, Carlo Cabrera, David Baumgold, Douglas Eichelberger, Dustin Rodrigues, Eric Knibbe, FX Coudert, Issy Long, Justin Krehel, Markus Reiter, Miccal Matthews, Michael Cho, Michka Popoff, Mike McQuaid, Nanda H Krishna, Patrick Linnane, Razvan Azamfirei, Rui Chen, Ruoyu Zhong, Rylan Polster, Sam Ford, Sean Molenaar, Thierry Moisan, Timothy Sutton and William Woodruff\. +Homebrew\[u2019]s maintainers are Alexander Bayandin, Bevan Kay, Bo Anderson, Branch Vincent, Caleb Xu, Carlo Cabrera, Douglas Eichelberger, Dustin Rodrigues, Eric Knibbe, FX Coudert, Issy Long, Justin Krehel, Markus Reiter, Miccal Matthews, Michael Cho, Michka Popoff, Mike McQuaid, Nanda H Krishna, Patrick Linnane, Razvan Azamfirei, Rui Chen, Ruoyu Zhong, Rylan Polster, Sam Ford, Sean Molenaar, Thierry Moisan, Timothy Sutton and William Woodruff\. .P Former maintainers with significant contributions include Misty De Méo, Shaun Jackman, Vítor Galvão, Claudia Pellegrino, Seeker, Jan Viljanen, JCount, commitay, Dominyk Tiller, Tim Smith, Baptiste Fontaine, Xu Cheng, Martin Afanasjew, Brett Koonce, Charlie Sharpsteen, Jack Nagel, Adam Vandenberg, Andrew Janke, Alex Dunn, neutric, Tomasz Pajor, Uladzislau Shablinski, Alyssa Ross, ilovezfs, Chongyu Zhu and Homebrew\[u2019]s creator: Max Howell\. .SH "BUGS" diff --git a/package/scripts/postinstall b/package/scripts/postinstall index f07b2a8f67800c..4296700b9059ec 100755 --- a/package/scripts/postinstall +++ b/package/scripts/postinstall @@ -61,7 +61,7 @@ then fi # create missing directories -mkdir -vp Cellar Frameworks etc include lib opt sbin share var/homebrew/linked +mkdir -vp Caskroom Cellar Frameworks etc include lib opt sbin share var/homebrew/linked # optionally define an install user at /var/tmp/.homebrew_pkg_user.plist homebrew_pkg_user_plist="/var/tmp/.homebrew_pkg_user.plist" @@ -74,9 +74,12 @@ else fi # set permissions +chmod ug=rwx Caskroom Cellar Frameworks bin etc include lib opt sbin share var var/homebrew var/homebrew/linked if [[ "${homebrew_directory}" == "/usr/local/Homebrew" ]] then - chown -R "${homebrew_pkg_user}:admin" Cellar Frameworks Homebrew bin etc include lib sbin share opt var + chown -h "${homebrew_pkg_user}:admin" bin bin/brew etc include lib opt sbin share var + chown -h -R "${homebrew_pkg_user}:admin" Caskroom Cellar Frameworks Homebrew var/homebrew + chown -h -R "${homebrew_pkg_user}" etc include share var else chown -R "${homebrew_pkg_user}:admin" . fi