diff --git a/.editorconfig b/.editorconfig deleted file mode 100644 index 80f3fca..0000000 --- a/.editorconfig +++ /dev/null @@ -1,189 +0,0 @@ -#/ -# @license Apache-2.0 -# -# Copyright (c) 2017 The Stdlib Authors. -# -# Licensed under the Apache License, Version 2.0 (the "License"); -# you may not use this file except in compliance with the License. -# You may obtain a copy of the License at -# -# http://www.apache.org/licenses/LICENSE-2.0 -# -# Unless required by applicable law or agreed to in writing, software -# distributed under the License is distributed on an "AS IS" BASIS, -# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -# See the License for the specific language governing permissions and -# limitations under the License. -#/ - -# EditorConfig configuration file (see ). - -# Indicate that this file is a root-level configuration file: -root = true - -# Set properties for all files: -[*] -end_of_line = lf -charset = utf-8 -trim_trailing_whitespace = true -insert_final_newline = true - -# Set properties for JavaScript files: -[*.{js,js.txt}] -indent_style = tab - -# Set properties for JavaScript ES module files: -[*.{mjs,mjs.txt}] -indent_style = tab - -# Set properties for JavaScript CommonJS files: -[*.{cjs,cjs.txt}] -indent_style = tab - -# Set properties for JSON files: -[*.{json,json.txt}] -indent_style = space -indent_size = 2 - -# Set properties for `cli_opts.json` files: -[cli_opts.json] -indent_style = tab - -# Set properties for TypeScript files: -[*.ts] -indent_style = tab - -# Set properties for Python files: -[*.{py,py.txt}] -indent_style = space -indent_size = 4 - -# Set properties for Julia files: -[*.{jl,jl.txt}] -indent_style = tab - -# Set properties for R files: -[*.{R,R.txt}] -indent_style = tab - -# Set properties for C files: -[*.{c,c.txt}] -indent_style = tab - -# Set properties for C header files: -[*.{h,h.txt}] -indent_style = tab - -# Set properties for C++ files: -[*.{cpp,cpp.txt}] -indent_style = tab - -# Set properties for C++ header files: -[*.{hpp,hpp.txt}] -indent_style = tab - -# Set properties for Fortran files: -[*.{f,f.txt}] -indent_style = space -indent_size = 2 - -# Set properties for shell files: -[*.{sh,sh.txt}] -indent_style = tab - -# Set properties for AWK files: -[*.{awk,awk.txt}] -indent_style = tab - -# Set properties for HTML files: -[*.{html,html.txt}] -indent_style = tab -tab_width = 2 - -# Set properties for XML files: -[*.{xml,xml.txt}] -indent_style = tab -tab_width = 2 - -# Set properties for CSS files: -[*.{css,css.txt}] -indent_style = tab - -# Set properties for Makefiles: -[Makefile] -indent_style = tab - -[*.{mk,mk.txt}] -indent_style = tab - -# Set properties for Markdown files: -[*.{md,md.txt}] -indent_style = space -indent_size = 4 -trim_trailing_whitespace = true # Note: this disables using two spaces to force a hard line break, which is permitted in Markdown. As we don't typically follow that practice (TMK), we should be safe to automatically trim. - -# Set properties for `usage.txt` files: -[usage.txt] -indent_style = space -indent_size = 2 - -# Set properties for `repl.txt` files: -[repl.txt] -indent_style = space -indent_size = 4 - -# Set properties for `package.json` files: -[package.{json,json.txt}] -indent_style = space -indent_size = 2 - -# Set properties for `datapackage.json` files: -[datapackage.json] -indent_style = space -indent_size = 2 - -# Set properties for `manifest.json` files: -[manifest.json] -indent_style = space -indent_size = 2 - -# Set properties for `tsconfig.json` files: -[tsconfig.json] -indent_style = space -indent_size = 2 - -# Set properties for LaTeX files: -[*.{tex,tex.txt}] -indent_style = tab - -# Set properties for LaTeX Bibliography files: -[*.{bib,bib.txt}] -indent_style = tab - -# Set properties for YAML files: -[*.{yml,yml.txt}] -indent_style = space -indent_size = 2 - -# Ignore generated lock files for GitHub Agentic Workflows: -[*.lock.yml] -charset = unset -end_of_line = unset -indent_style = unset -indent_size = unset -trim_trailing_whitespace = unset -insert_final_newline = unset - -# Set properties for GYP files: -[binding.gyp] -indent_style = space -indent_size = 2 - -[*.gypi] -indent_style = space -indent_size = 2 - -# Set properties for citation files: -[*.{cff,cff.txt}] -indent_style = space -indent_size = 2 diff --git a/.eslintrc.js b/.eslintrc.js deleted file mode 100644 index 5f30286..0000000 --- a/.eslintrc.js +++ /dev/null @@ -1 +0,0 @@ -/* For the `eslint` rules of this project, consult the main repository at https://github.com/stdlib-js/stdlib */ diff --git a/.gitattributes b/.gitattributes deleted file mode 100644 index 24b327f..0000000 --- a/.gitattributes +++ /dev/null @@ -1,68 +0,0 @@ -#/ -# @license Apache-2.0 -# -# Copyright (c) 2017 The Stdlib Authors. -# -# Licensed under the Apache License, Version 2.0 (the "License"); -# you may not use this file except in compliance with the License. -# You may obtain a copy of the License at -# -# http://www.apache.org/licenses/LICENSE-2.0 -# -# Unless required by applicable law or agreed to in writing, software -# distributed under the License is distributed on an "AS IS" BASIS, -# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -# See the License for the specific language governing permissions and -# limitations under the License. -#/ - -# Configuration file which assigns attributes to pathnames. -# -# [1]: https://git-scm.com/docs/gitattributes - -# Automatically normalize the line endings of any committed text files: -* text=auto - -# Override line endings for certain files on checkout: -*.crlf.csv text eol=crlf - -# Denote that certain files are binary and should not be modified: -*.png binary -*.jpg binary -*.jpeg binary -*.gif binary -*.ico binary -*.gz binary -*.zip binary -*.7z binary -*.mp3 binary -*.mp4 binary -*.mov binary - -# Override what is considered "vendored" by GitHub's linguist: -/lib/node_modules/** -linguist-vendored -linguist-generated - -# Configure directories which should *not* be included in GitHub language statistics: -/deps/** linguist-vendored -/dist/** linguist-generated -/workshops/** linguist-vendored - -benchmark/** linguist-vendored -docs/* linguist-documentation -etc/** linguist-vendored -examples/** linguist-documentation -scripts/** linguist-vendored -test/** linguist-vendored -tools/** linguist-vendored - -# Configure files which should *not* be included in GitHub language statistics: -Makefile linguist-vendored -*.mk linguist-vendored -*.jl linguist-vendored -*.py linguist-vendored -*.R linguist-vendored - -# Configure files which should be included in GitHub language statistics: -docs/types/*.d.ts -linguist-documentation - -.github/workflows/*.lock.yml linguist-generated=true merge=ours diff --git a/.github/.keepalive b/.github/.keepalive deleted file mode 100644 index 3c82c02..0000000 --- a/.github/.keepalive +++ /dev/null @@ -1 +0,0 @@ -2026-08-18T03:04:35.443Z diff --git a/.github/PULL_REQUEST_TEMPLATE.md b/.github/PULL_REQUEST_TEMPLATE.md deleted file mode 100644 index 2a9404d..0000000 --- a/.github/PULL_REQUEST_TEMPLATE.md +++ /dev/null @@ -1,7 +0,0 @@ - - -We are excited about your pull request, but unfortunately we are not accepting pull requests against this repository, as all development happens on the [main project repository](https://github.com/stdlib-js/stdlib). We kindly request that you submit this pull request against the [respective directory](https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/ndarray/base/binary) of the main repository where we’ll review and provide feedback. - -If this is your first stdlib contribution, be sure to read the [contributing guide](https://github.com/stdlib-js/stdlib/blob/develop/CONTRIBUTING.md) which provides guidelines and instructions for submitting contributions. You may also consult the [development guide](https://github.com/stdlib-js/stdlib/blob/develop/docs/contributing/development.md) for help on developing stdlib. - -We look forward to receiving your contribution! :smiley: \ No newline at end of file diff --git a/.github/workflows/benchmark.yml b/.github/workflows/benchmark.yml deleted file mode 100644 index e4f10fe..0000000 --- a/.github/workflows/benchmark.yml +++ /dev/null @@ -1,64 +0,0 @@ -#/ -# @license Apache-2.0 -# -# Copyright (c) 2021 The Stdlib Authors. -# -# Licensed under the Apache License, Version 2.0 (the "License"); -# you may not use this file except in compliance with the License. -# You may obtain a copy of the License at -# -# http://www.apache.org/licenses/LICENSE-2.0 -# -# Unless required by applicable law or agreed to in writing, software -# distributed under the License is distributed on an "AS IS" BASIS, -# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -# See the License for the specific language governing permissions and -# limitations under the License. -#/ - -# Workflow name: -name: benchmark - -# Workflow triggers: -on: - # Allow the workflow to be manually run: - workflow_dispatch: - -# Workflow jobs: -jobs: - - # Define a job to run benchmarks: - benchmark: - - # Define a display name: - name: 'Run benchmarks' - - # Define the type of virtual host machine: - runs-on: 'ubuntu-latest' - - # Define the sequence of job steps... - steps: - - # Checkout the repository: - - name: 'Checkout repository' - # Pin action to full length commit SHA - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608 # v4.1.0 - - # Install Node.js: - - name: 'Install Node.js' - # Pin action to full length commit SHA - uses: actions/setup-node@b39b52d1213e96004bfcb1c61a8a6fa8ab84f3e8 # v4.0.1 - with: - node-version: 20 - timeout-minutes: 5 - - # Install dependencies: - - name: 'Install production and development dependencies' - run: | - npm install || npm install || npm install - timeout-minutes: 15 - - # Run benchmarks: - - name: 'Run benchmarks' - run: | - npm run benchmark diff --git a/.github/workflows/cancel.yml b/.github/workflows/cancel.yml deleted file mode 100644 index b5291db..0000000 --- a/.github/workflows/cancel.yml +++ /dev/null @@ -1,57 +0,0 @@ -#/ -# @license Apache-2.0 -# -# Copyright (c) 2021 The Stdlib Authors. -# -# Licensed under the Apache License, Version 2.0 (the "License"); -# you may not use this file except in compliance with the License. -# You may obtain a copy of the License at -# -# http://www.apache.org/licenses/LICENSE-2.0 -# -# Unless required by applicable law or agreed to in writing, software -# distributed under the License is distributed on an "AS IS" BASIS, -# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -# See the License for the specific language governing permissions and -# limitations under the License. -#/ - -# Workflow name: -name: cancel - -# Workflow triggers: -on: - # Allow the workflow to be manually run: - workflow_dispatch: - -# Workflow jobs: -jobs: - - # Define a job to cancel existing workflow runs: - cancel: - - # Define a display name: - name: 'Cancel workflow runs' - - # Define the type of virtual host machine: - runs-on: 'ubuntu-latest' - - # Time limit: - timeout-minutes: 3 - - # Define the sequence of job steps... - steps: - - # Cancel existing workflow runs: - - name: 'Cancel existing workflow runs' - # Pin action to full length commit SHA - uses: styfle/cancel-workflow-action@85880fa0301c86cca9da44039ee3bb12d3bedbfa # v0.12.1 - with: - workflow_id: >- - benchmark.yml, - examples.yml, - test.yml, - test_coverage.yml, - test_install.yml, - publish.yml - access_token: ${{ github.token }} diff --git a/.github/workflows/close_pull_requests.yml b/.github/workflows/close_pull_requests.yml deleted file mode 100644 index d62c746..0000000 --- a/.github/workflows/close_pull_requests.yml +++ /dev/null @@ -1,54 +0,0 @@ -#/ -# @license Apache-2.0 -# -# Copyright (c) 2021 The Stdlib Authors. -# -# Licensed under the Apache License, Version 2.0 (the "License"); -# you may not use this file except in compliance with the License. -# You may obtain a copy of the License at -# -# http://www.apache.org/licenses/LICENSE-2.0 -# -# Unless required by applicable law or agreed to in writing, software -# distributed under the License is distributed on an "AS IS" BASIS, -# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -# See the License for the specific language governing permissions and -# limitations under the License. -#/ - -# Workflow name: -name: close_pull_requests - -# Workflow triggers: -on: - pull_request_target: - types: [opened] - -# Workflow jobs: -jobs: - - # Define job to close all pull requests: - run: - - # Define the type of virtual host machine on which to run the job: - runs-on: ubuntu-latest - - # Define the sequence of job steps... - steps: - - # Close pull request - - name: 'Close pull request' - # Pin action to full length commit SHA corresponding to v3.1.2 - uses: superbrothers/close-pull-request@9c18513d320d7b2c7185fb93396d0c664d5d8448 - with: - comment: | - Thank you for submitting a pull request. :raised_hands: - - We greatly appreciate your willingness to submit a contribution. However, we are not accepting pull requests against this repository, as all development happens on the [main project repository](https://github.com/stdlib-js/stdlib). - - We kindly request that you submit this pull request against the [respective directory](https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/ndarray/base/binary) of the main repository where we’ll review and provide feedback. If this is your first stdlib contribution, be sure to read the [contributing guide](https://github.com/stdlib-js/stdlib/blob/develop/CONTRIBUTING.md) which provides guidelines and instructions for submitting contributions. - - Thank you again, and we look forward to receiving your contribution! :smiley: - - Best, - The stdlib team \ No newline at end of file diff --git a/.github/workflows/examples.yml b/.github/workflows/examples.yml deleted file mode 100644 index 2984901..0000000 --- a/.github/workflows/examples.yml +++ /dev/null @@ -1,64 +0,0 @@ -#/ -# @license Apache-2.0 -# -# Copyright (c) 2021 The Stdlib Authors. -# -# Licensed under the Apache License, Version 2.0 (the "License"); -# you may not use this file except in compliance with the License. -# You may obtain a copy of the License at -# -# http://www.apache.org/licenses/LICENSE-2.0 -# -# Unless required by applicable law or agreed to in writing, software -# distributed under the License is distributed on an "AS IS" BASIS, -# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -# See the License for the specific language governing permissions and -# limitations under the License. -#/ - -# Workflow name: -name: examples - -# Workflow triggers: -on: - # Allow the workflow to be manually run: - workflow_dispatch: - -# Workflow jobs: -jobs: - - # Define a job to run the package examples... - examples: - - # Define display name: - name: 'Run examples' - - # Define the type of virtual host machine on which to run the job: - runs-on: ubuntu-latest - - # Define the sequence of job steps... - steps: - - # Checkout repository: - - name: 'Checkout repository' - # Pin action to full length commit SHA - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608 # v4.1.0 - - # Install Node.js: - - name: 'Install Node.js' - # Pin action to full length commit SHA - uses: actions/setup-node@b39b52d1213e96004bfcb1c61a8a6fa8ab84f3e8 # v4.0.1 - with: - node-version: 20 - timeout-minutes: 5 - - # Install dependencies: - - name: 'Install production and development dependencies' - run: | - npm install || npm install || npm install - timeout-minutes: 15 - - # Run examples: - - name: 'Run examples' - run: | - npm run examples diff --git a/.github/workflows/npm_downloads.yml b/.github/workflows/npm_downloads.yml deleted file mode 100644 index 393a16e..0000000 --- a/.github/workflows/npm_downloads.yml +++ /dev/null @@ -1,112 +0,0 @@ -#/ -# @license Apache-2.0 -# -# Copyright (c) 2022 The Stdlib Authors. -# -# Licensed under the Apache License, Version 2.0 (the "License"); -# you may not use this file except in compliance with the License. -# You may obtain a copy of the License at -# -# http://www.apache.org/licenses/LICENSE-2.0 -# -# Unless required by applicable law or agreed to in writing, software -# distributed under the License is distributed on an "AS IS" BASIS, -# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -# See the License for the specific language governing permissions and -# limitations under the License. -#/ - -# Workflow name: -name: npm_downloads - -# Workflow triggers: -on: - # Run this workflow weekly: - schedule: - # cron: ' ' - - cron: '59 23 * * 0' - - # Allow the workflow to be manually run: - workflow_dispatch: - -# Workflow jobs: -jobs: - - # Define a job for retrieving npm download counts... - npm_downloads: - - # Define display name: - name: 'Retrieve npm download counts' - - # Define the type of virtual host machine on which to run the job: - runs-on: ubuntu-latest - - # Define the sequence of job steps... - steps: - # Checkout the repository: - - name: 'Checkout repository' - # Pin action to full length commit SHA - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608 # v4.1.0 - timeout-minutes: 10 - - # Install Node.js: - - name: 'Install Node.js' - # Pin action to full length commit SHA - uses: actions/setup-node@b39b52d1213e96004bfcb1c61a8a6fa8ab84f3e8 # v4.0.1 - with: - node-version: 20 - timeout-minutes: 5 - - # Resolve package name: - - name: 'Resolve package name' - id: package_name - run: | - name=`node -e 'console.log(require("./package.json").name)' | tr -d '\n'` - echo "package_name=$name" >> $GITHUB_OUTPUT - timeout-minutes: 5 - - # Fetch download data: - - name: 'Fetch data' - id: download_data - run: | - url="https://api.npmjs.org/downloads/range/$(date --date='1 year ago' '+%Y-%m-%d'):$(date '+%Y-%m-%d')/${{ steps.package_name.outputs.package_name }}" - echo "$url" - data=$(curl "$url") - mkdir ./tmp - echo "$data" > ./tmp/npm_downloads.json - echo "data=$data" >> $GITHUB_OUTPUT - timeout-minutes: 5 - - # Print summary of download data: - - name: 'Print summary' - run: | - echo "| Date | Downloads |" >> $GITHUB_STEP_SUMMARY - echo "|------|------------|" >> $GITHUB_STEP_SUMMARY - cat ./tmp/npm_downloads.json | jq -r ".downloads | .[-14:] | to_entries | map(\"| \(.value.day) | \(.value.downloads) |\") |.[]" >> $GITHUB_STEP_SUMMARY - - # Upload the download data: - - name: 'Upload data' - # Pin action to full length commit SHA - uses: actions/upload-artifact@5d5d22a31266ced268874388b861e4b58bb5c2f3 # v4.3.1 - with: - # Define a name for the uploaded artifact (ensuring a unique name for each job): - name: npm_downloads - - # Specify the path to the file to upload: - path: ./tmp/npm_downloads.json - - # Specify the number of days to retain the artifact (default is 90 days): - retention-days: 90 - timeout-minutes: 10 - if: success() - - # Send data to events server: - - name: 'Post data' - # Pin action to full length commit SHA - uses: distributhor/workflow-webhook@48a40b380ce4593b6a6676528cd005986ae56629 # v3.0.3 - env: - webhook_url: ${{ secrets.STDLIB_NPM_DOWNLOADS_URL }} - webhook_secret: ${{ secrets.STDLIB_WEBHOOK_SECRET }} - data: '{ "downloads": ${{ steps.download_data.outputs.data }} }' - timeout-minutes: 5 - if: success() diff --git a/.github/workflows/productionize.yml b/.github/workflows/productionize.yml deleted file mode 100644 index 83d50c4..0000000 --- a/.github/workflows/productionize.yml +++ /dev/null @@ -1,821 +0,0 @@ -#/ -# @license Apache-2.0 -# -# Copyright (c) 2022 The Stdlib Authors. -# -# Licensed under the Apache License, Version 2.0 (the "License"); -# you may not use this file except in compliance with the License. -# You may obtain a copy of the License at -# -# http://www.apache.org/licenses/LICENSE-2.0 -# -# Unless required by applicable law or agreed to in writing, software -# distributed under the License is distributed on an "AS IS" BASIS, -# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -# See the License for the specific language governing permissions and -# limitations under the License. -#/ - -# Workflow name: -name: productionize - -# Workflow triggers: -on: - # Run workflow when a new commit is pushed to the main branch: - push: - branches: - - main - - # Allow the workflow to be manually run: - workflow_dispatch: - inputs: - require-passing-tests: - description: 'Require passing tests for creating bundles' - type: boolean - default: true - - # Run workflow upon completion of `publish` workflow run: - workflow_run: - workflows: ["publish"] - types: [completed] - - -# Concurrency group to prevent multiple concurrent executions: -concurrency: - group: productionize - cancel-in-progress: true - -# Workflow jobs: -jobs: - - # Define a job to create a production build... - productionize: - - # Define display name: - name: 'Productionize' - - # Define the type of virtual host machine: - runs-on: 'ubuntu-latest' - - # Define the sequence of job steps... - steps: - # Checkout main branch of repository: - - name: 'Checkout main branch' - # Pin action to full length commit SHA - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608 # v4.1.0 - with: - ref: main - - # Install Node.js: - - name: 'Install Node.js' - # Pin action to full length commit SHA - uses: actions/setup-node@b39b52d1213e96004bfcb1c61a8a6fa8ab84f3e8 # v4.0.1 - with: - node-version: 20 - timeout-minutes: 5 - - # Create production branch: - - name: 'Create production branch' - run: | - git checkout -b production - - # Transform error messages: - - name: 'Transform error messages' - id: transform-error-messages - uses: stdlib-js/transform-errors-action@main - - # Change `@stdlib/string-format` to `@stdlib/error-tools-fmtprodmsg` in package.json if the former is a dependency, otherwise insert it as a dependency: - - name: 'Update dependencies in package.json' - run: | - PKG_VERSION=$(npm view @stdlib/error-tools-fmtprodmsg version) - if grep -q '"@stdlib/string-format"' package.json; then - sed -i "s/\"@stdlib\/string-format\": \"^.*\"/\"@stdlib\/error-tools-fmtprodmsg\": \"^$PKG_VERSION\"/g" package.json - else - node -e "var pkg = require( './package.json' ); pkg.dependencies[ '@stdlib/error-tools-fmtprodmsg' ] = '^$PKG_VERSION'; require( 'fs' ).writeFileSync( 'package.json', JSON.stringify( pkg, null, 2 ) );" - fi - - # Configure Git: - - name: 'Configure Git' - run: | - git config --local user.email "noreply@stdlib.io" - git config --local user.name "stdlib-bot" - - # Commit changes: - - name: 'Commit changes' - run: | - git add -A - git commit -m "Transform error messages" - - # Push changes: - - name: 'Push changes' - run: | - SLUG=${{ github.repository }} - echo "Pushing changes to $SLUG..." - git push "https://$GITHUB_ACTOR:$GITHUB_TOKEN@github.com/$SLUG.git" production --force - - # Define a job for running tests of the productionized code... - test: - - # Define a display name: - name: 'Run Tests' - - # Define the type of virtual host machine: - runs-on: 'ubuntu-latest' - - # Indicate that this job depends on the prior job finishing: - needs: productionize - - # Run this job regardless of the outcome of the prior job: - if: always() - - # Define the sequence of job steps... - steps: - - # Checkout the repository: - - name: 'Checkout repository' - if: ${{ github.event.inputs.require-passing-tests == 'true' }} - # Pin action to full length commit SHA - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608 # v4.1.0 - with: - # Use the `production` branch: - ref: production - - # Install Node.js: - - name: 'Install Node.js' - if: ${{ github.event.inputs.require-passing-tests == 'true' }} - # Pin action to full length commit SHA - uses: actions/setup-node@b39b52d1213e96004bfcb1c61a8a6fa8ab84f3e8 # v4.0.1 - with: - node-version: 20 - timeout-minutes: 5 - - # Install dependencies: - - name: 'Install production and development dependencies' - if: ${{ github.event.inputs.require-passing-tests == 'true' }} - id: install - run: | - npm install || npm install || npm install - timeout-minutes: 15 - - # Build native add-on if present: - - name: 'Build native add-on (if present)' - if: ${{ github.event.inputs.require-passing-tests == 'true' }} - run: | - if [ -f "binding.gyp" ]; then - npm install node-gyp --no-save && ./node_modules/.bin/node-gyp rebuild - fi - - # Run tests: - - name: 'Run tests' - if: ${{ github.event.inputs.require-passing-tests == 'true' }} - id: tests - run: | - npm test || npm test || npm test - - # Define job to create a bundle for use in Deno... - deno: - - # Define display name: - name: 'Create Deno bundle' - - # Define the type of virtual host machine on which to run the job: - runs-on: ubuntu-latest - - # Indicate that this job depends on the test job finishing: - needs: test - - # Define the sequence of job steps... - steps: - # Checkout the repository: - - name: 'Checkout repository' - # Pin action to full length commit SHA - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608 # v4.1.0 - - # Configure Git: - - name: 'Configure Git' - run: | - git config --local user.email "noreply@stdlib.io" - git config --local user.name "stdlib-bot" - - # Check if remote `deno` branch exists: - - name: 'Check if remote `deno` branch exists' - id: deno-branch-exists - continue-on-error: true - run: | - git fetch --all - git ls-remote --exit-code --heads origin deno - if [ $? -eq 0 ]; then - echo "remote-exists=true" >> $GITHUB_OUTPUT - else - echo "remote-exists=false" >> $GITHUB_OUTPUT - fi - - # If `deno` exists, delete everything in branch and merge `production` into it - - name: 'If `deno` exists, delete everything in branch and merge `production` into it' - if: steps.deno-branch-exists.outputs.remote-exists - run: | - git checkout -b deno origin/deno - - find . -type 'f' | grep -v -e ".git/" -e "package.json" -e "README.md" -e "LICENSE" -e "CONTRIBUTORS" -e "NOTICE" | xargs -r rm - find . -mindepth 1 -type 'd' | grep -v -e ".git" | xargs -r rm -rf - - git add -A - git commit -m "Remove files" --allow-empty - - git config merge.theirs.name 'simulate `-s theirs`' - git config merge.theirs.driver 'cat %B > %A' - GIT_CONFIG_PARAMETERS="'merge.default=theirs'" git merge origin/production --allow-unrelated-histories - - # Copy files from `production` branch if necessary: - git checkout origin/production -- . - if [ -n "$(git status --porcelain)" ]; then - git add -A - git commit -m "Auto-generated commit" - fi - - # If `deno` does not exist, create `deno` branch: - - name: 'If `deno` does not exist, create `deno` branch' - if: ${{ steps.deno-branch-exists.outputs.remote-exists == false }} - run: | - git checkout production - git checkout -b deno - - # Copy files to deno directory: - - name: 'Copy files to deno directory' - run: | - mkdir -p deno - cp README.md LICENSE CONTRIBUTORS NOTICE ./deno - - # Copy TypeScript definitions to deno directory: - if [ -d index.d.ts ]; then - cp index.d.ts ./deno/index.d.ts - fi - if [ -e ./docs/types/index.d.ts ]; then - cp ./docs/types/index.d.ts ./deno/mod.d.ts - fi - - # Install Node.js: - - name: 'Install Node.js' - # Pin action to full length commit SHA - uses: actions/setup-node@b39b52d1213e96004bfcb1c61a8a6fa8ab84f3e8 # v4.0.1 - with: - node-version: 20 - timeout-minutes: 5 - - # Install dependencies: - - name: Install production and development dependencies - id: install - run: | - npm install || npm install || npm install - timeout-minutes: 15 - - # Bundle package for use in Deno: - - name: 'Bundle package for Deno' - id: deno-bundle - uses: stdlib-js/bundle-action@main - with: - target: 'deno' - - # Rewrite file contents: - - name: 'Rewrite file contents' - run: | - # Replace links to other packages with links to the deno branch: - find ./deno -type f -name '*.md' -print0 | xargs -0 sed -Ei "/\/tree\/main/b; /^\[@stdlib[^:]+: https:\/\/github.com\/stdlib-js\// s/(.*)/\\1\/tree\/deno/"; - - # Replace reference to `@stdlib/types` with CDN link: - find ./deno -type f -name '*.ts' -print0 | xargs -0 -r sed -Ei "s/\/\/\/ /\/\/\/ /g" - - # Change wording of project description to avoid reference to JavaScript and Node.js: - find ./deno -type f -name '*.md' -print0 | xargs -0 sed -Ei "s/a standard library for JavaScript and Node.js, /a standard library /g" - - # Rewrite all `require()`s to use jsDelivr links: - find ./deno -type f -name '*.md' -print0 | xargs -0 sed -Ei "/require\( '@stdlib\// { - s/(var|let|const)\s+([a-z0-9_]+)\s+=\s*require\( '([^']+)' \);/import \2 from \'\3\';/i - s/@stdlib/https:\/\/cdn.jsdelivr.net\/gh\/stdlib-js/ - s/';/@deno\/mod.js';/ - }" - - # Rewrite first `import` to show importing of named exports if available: - exports=$(cat lib/index.js | \ - grep -E 'setReadOnly\(.*,.*,.*\)' | \ - sed -E 's/setReadOnly\((.*),(.*),(.*)\);/\2/' | \ - sed -E "s/'//g" | \ - sort) - if [ -n "$exports" ]; then - find ./deno -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/\`\`\`javascript\nimport\s+([a-zA-Z0-9_]+)\s+from\s*'([^']+)';\n\`\`\`/\`\`\`javascript\nimport \1 from '\2';\n\`\`\`\n\nYou can also import the following named exports from the package:\n\n\`\`\`javascript\nimport { $(echo $exports | sed -E 's/ /, /g') } from '\2';\n\`\`\`/" - fi - - # Remove `installation`, `cli`, and `c` sections: - find ./deno -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/
[^<]+<\/section>//g;" - find ./deno -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/(\* \* \*\n+)?
[\s\S]+<\!\-\- \/.cli \-\->//g" - find ./deno -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/(\* \* \*\n+)?
[\s\S]+<\!\-\- \/.c \-\->//g" - - # Create package.json file for deno branch: - jq --indent 2 '{"name": .name, "version": .version, "description": .description, "license": .license, "type": "module", "main": "./mod.js", "homepage": .homepage, "repository": .repository, "bugs": .bugs, "keywords": .keywords, "funding": .funding}' package.json > ./deno/package.json - - # Delete everything in current directory aside from deno folder: - - name: 'Delete everything in current directory aside from deno folder' - run: | - find . -type 'f' | grep -v -e "deno" -e ".git/" | xargs -r rm - find . -mindepth 1 -type 'd' | grep -v -e "deno" -e ".git" | xargs -r rm -rf - - # Move deno directory to root: - - name: 'Move deno directory to root' - run: | - mv ./deno/* . - rmdir ./deno - - # Commit changes: - - name: 'Commit changes' - run: | - git add -A - git commit -m "Auto-generated commit" - - # Push changes to `deno` branch: - - name: 'Push changes to `deno` branch' - run: | - SLUG=${{ github.repository }} - echo "Pushing changes to $SLUG..." - git push "https://$GITHUB_ACTOR:$GITHUB_TOKEN@github.com/$SLUG.git" deno - - # Send notification to Zulip if job fails: - - name: 'Send notification to Zulip in case of failure' - # Pin action to full length commit SHA - uses: zulip/github-actions-zulip/send-message@e4c8f27c732ba9bd98ac6be0583096dea82feea5 # v1.0.2 - if: failure() - with: - api-key: ${{ secrets.ZULIP_API_KEY }} - email: 'github-actions-bot@stdlib.zulipchat.com' - organization-url: 'https://stdlib.zulipchat.com' - to: 'workflows-standalone' - type: 'stream' - topic: ${{ github.event.repository.name }} - content: | - :cross_mark: **${{ github.workflow }}** workflow failed - - **Repository:** [${{ github.repository }}](${{ github.server_url }}/${{ github.repository }}) - **Run:** [View workflow run](${{ github.server_url }}/${{ github.repository }}/actions/runs/${{ github.run_id }}) - - # Define job to create a UMD bundle... - umd: - - # Define display name: - name: 'Create UMD bundle' - - # Define the type of virtual host machine on which to run the job: - runs-on: ubuntu-latest - - # Indicate that this job depends on the test job finishing: - needs: test - - # Define the sequence of job steps... - steps: - # Checkout the repository: - - name: 'Checkout repository' - # Pin action to full length commit SHA - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608 # v4.1.0 - - # Configure Git: - - name: 'Configure Git' - run: | - git config --local user.email "noreply@stdlib.io" - git config --local user.name "stdlib-bot" - - # Check if remote `umd` branch exists: - - name: 'Check if remote `umd` branch exists' - id: umd-branch-exists - continue-on-error: true - run: | - git fetch --all - git ls-remote --exit-code --heads origin umd - if [ $? -eq 0 ]; then - echo "remote-exists=true" >> $GITHUB_OUTPUT - else - echo "remote-exists=false" >> $GITHUB_OUTPUT - fi - - # If `umd` exists, delete everything in branch and merge `production` into it - - name: 'If `umd` exists, delete everything in branch and merge `production` into it' - if: steps.umd-branch-exists.outputs.remote-exists - run: | - git checkout -b umd origin/umd - - find . -type 'f' | grep -v -e ".git/" -e "package.json" -e "README.md" -e "LICENSE" -e "CONTRIBUTORS" -e "NOTICE" | xargs -r rm - find . -mindepth 1 -type 'd' | grep -v -e ".git" | xargs -r rm -rf - - git add -A - git commit -m "Remove files" --allow-empty - - git config merge.theirs.name 'simulate `-s theirs`' - git config merge.theirs.driver 'cat %B > %A' - GIT_CONFIG_PARAMETERS="'merge.default=theirs'" git merge origin/production --allow-unrelated-histories - - # Copy files from `production` branch if necessary: - git checkout origin/production -- . - if [ -n "$(git status --porcelain)" ]; then - git add -A - git commit -m "Auto-generated commit" - fi - - # If `umd` does not exist, create `umd` branch: - - name: 'If `umd` does not exist, create `umd` branch' - if: ${{ steps.umd-branch-exists.outputs.remote-exists == false }} - run: | - git checkout production - git checkout -b umd - - # Copy files to umd directory: - - name: 'Copy files to umd directory' - run: | - mkdir -p umd - cp README.md LICENSE CONTRIBUTORS NOTICE ./umd - - # Install Node.js - - name: 'Install Node.js' - # Pin action to full length commit SHA - uses: actions/setup-node@b39b52d1213e96004bfcb1c61a8a6fa8ab84f3e8 # v4.0.1 - with: - node-version: 20 - timeout-minutes: 5 - - # Install dependencies: - - name: 'Install production and development dependencies' - id: install - run: | - npm install || npm install || npm install - timeout-minutes: 15 - - # Extract alias: - - name: 'Extract alias' - id: extract-alias - run: | - alias=$(grep -E 'require\(' README.md | head -n 1 | sed -E 's/^var ([a-zA-Z0-9_]+) = .+/\1/') - echo "alias=${alias}" >> $GITHUB_OUTPUT - - # Create Universal Module Definition (UMD) Node.js bundle: - - name: 'Create Universal Module Definition (UMD) Node.js bundle' - id: umd-bundle-node - uses: stdlib-js/bundle-action@main - with: - target: 'umd-node' - alias: ${{ steps.extract-alias.outputs.alias }} - - # Create Universal Module Definition (UMD) browser bundle: - - name: 'Create Universal Module Definition (UMD) browser bundle' - id: umd-bundle-browser - uses: stdlib-js/bundle-action@main - with: - target: 'umd-browser' - alias: ${{ steps.extract-alias.outputs.alias }} - - # Rewrite file contents: - - name: 'Rewrite file contents' - run: | - - # Replace links to other packages with links to the umd branch: - find ./umd -type f -name '*.md' -print0 | xargs -0 sed -Ei "/\/tree\/main/b; /^\[@stdlib[^:]+: https:\/\/github.com\/stdlib-js\// s/(.*)/\\1\/tree\/umd/"; - - # Remove `installation`, `cli`, and `c` sections: - find ./umd -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/
[^<]+<\/section>//g;" - find ./umd -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/(\* \* \*\n+)?
[\s\S]+<\!\-\- \/.cli \-\->//g" - find ./umd -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/(\* \* \*\n+)?
[\s\S]+<\!\-\- \/.c \-\->//g" - - # Rewrite first `require()` to show consumption of the UMD bundle in Observable and via a `script` tag: - find ./umd -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/\`\`\`javascript\n(var|let|const)\s+([a-zA-Z0-9_]+)\s+=\s*require\( '\@stdlib\/([^']+)' \);\n\`\`\`/To use in Observable,\n\n\`\`\`javascript\n\2 = require\( 'https:\/\/cdn.jsdelivr.net\/gh\/stdlib-js\/\3\@umd\/browser.js' \)\n\`\`\`\n\nTo vendor stdlib functionality and avoid installing dependency trees for Node.js, you can use the UMD server build:\n\n\`\`\`javascript\nvar \2 = require\( 'path\/to\/vendor\/umd\/\3\/index.js' \)\n\`\`\`\n\nTo include the bundle in a webpage,\n\n\`\`\`html\n +``` -```javascript -var binary = require( '@stdlib/ndarray-base-binary' ); +If no recognized module system is present, access bundle contents via the global scope: + +```html + ``` #### binary( arrays, fcn ) @@ -170,8 +176,13 @@ The function accepts the following arguments: -```javascript -var discreteUniform = require( '@stdlib/random-base-discrete-uniform' ).factory; +```html + + + + + + + ```
diff --git a/SECURITY.md b/SECURITY.md deleted file mode 100644 index 9702d4c..0000000 --- a/SECURITY.md +++ /dev/null @@ -1,5 +0,0 @@ -# Security - -> Policy for reporting security vulnerabilities. - -See the security policy [in the main project repository](https://github.com/stdlib-js/stdlib/security). diff --git a/benchmark/benchmark.1d.js b/benchmark/benchmark.1d.js deleted file mode 100644 index 9562b21..0000000 --- a/benchmark/benchmark.1d.js +++ /dev/null @@ -1,149 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MODULES // - -var bench = require( '@stdlib/bench-harness' ); -var discreteUniform = require( '@stdlib/random-array-discrete-uniform' ); -var isnan = require( '@stdlib/math-base-assert-is-nan' ); -var pow = require( '@stdlib/math-base-special-pow' ); -var add = require( '@stdlib/number-float64-base-add' ); -var filledarray = require( '@stdlib/array-filled' ); -var shape2strides = require( '@stdlib/ndarray-base-shape2strides' ); -var orders = require( '@stdlib/ndarray-orders' ); -var format = require( '@stdlib/string-format' ); -var pkg = require( './../package.json' ).name; -var binary = require( './../lib' ); - - -// VARIABLES // - -var TYPES = [ - 'float64' -]; -var ORDERS = orders(); - - -// FUNCTIONS // - -/** -* Creates a benchmark function. -* -* @private -* @param {PositiveInteger} len - ndarray length -* @param {NonNegativeIntegerArray} shape - ndarray shape -* @param {string} xtype - input ndarray data type -* @param {string} ytype - output ndarray data type -* @param {string} order - memory layout -* @returns {Function} benchmark function -*/ -function createBenchmark( len, shape, xtype, ytype, order ) { - var x; - var y; - - x = discreteUniform( len, -100, 100, { - 'dtype': xtype - }); - y = filledarray( 0.0, len, ytype ); - - x = { - 'dtype': xtype, - 'data': x, - 'shape': shape, - 'strides': shape2strides( shape, order ), - 'offset': 0, - 'order': order - }; - y = { - 'dtype': ytype, - 'data': y, - 'shape': shape, - 'strides': shape2strides( shape, order ), - 'offset': 0, - 'order': order - }; - return benchmark; - - /** - * Benchmark function. - * - * @private - * @param {Benchmark} b - benchmark instance - */ - function benchmark( b ) { - var i; - - b.tic(); - for ( i = 0; i < b.iterations; i++ ) { - binary( [ x, x, y ], add ); - if ( isnan( y.data[ i%len ] ) ) { - b.fail( 'should not return NaN' ); - } - } - b.toc(); - if ( isnan( y.data[ i%len ] ) ) { - b.fail( 'should not return NaN' ); - } - b.pass( 'benchmark finished' ); - b.end(); - } -} - - -// MAIN // - -/** -* Main execution sequence. -* -* @private -*/ -function main() { - var len; - var min; - var max; - var ord; - var sh; - var t1; - var t2; - var f; - var i; - var j; - var k; - - min = 1; // 10^min - max = 6; // 10^max - - for ( k = 0; k < ORDERS.length; k++ ) { - ord = ORDERS[ k ]; - for ( j = 0; j < TYPES.length; j++ ) { - t1 = TYPES[ j ]; - t2 = TYPES[ j ]; - for ( i = min; i <= max; i++ ) { - len = pow( 10, i ); - - sh = [ len ]; - f = createBenchmark( len, sh, t1, t2, ord ); - bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,yorder=%s,xtype=%s,ytype=%s', pkg, sh.length, len, sh.join( ',' ), ord, ord, t1, t2 ), f ); - } - } - } -} - -main(); diff --git a/benchmark/benchmark.2d.js b/benchmark/benchmark.2d.js deleted file mode 100644 index 22b5c96..0000000 --- a/benchmark/benchmark.2d.js +++ /dev/null @@ -1,165 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MODULES // - -var bench = require( '@stdlib/bench-harness' ); -var isRowMajor = require( '@stdlib/ndarray-base-assert-is-row-major-string' ); -var isnan = require( '@stdlib/math-base-assert-is-nan' ); -var discreteUniform = require( '@stdlib/random-array-discrete-uniform' ); -var pow = require( '@stdlib/math-base-special-pow' ); -var sqrt = require( '@stdlib/math-base-special-sqrt' ); -var floor = require( '@stdlib/math-base-special-floor' ); -var add = require( '@stdlib/number-float64-base-add' ); -var filledarray = require( '@stdlib/array-filled' ); -var shape2strides = require( '@stdlib/ndarray-base-shape2strides' ); -var orders = require( '@stdlib/ndarray-orders' ); -var format = require( '@stdlib/string-format' ); -var pkg = require( './../package.json' ).name; -var binary = require( './../lib/2d.js' ); - - -// VARIABLES // - -var TYPES = [ - 'float64' -]; -var ORDERS = orders(); - - -// FUNCTIONS // - -/** -* Creates a benchmark function. -* -* @private -* @param {PositiveInteger} len - ndarray length -* @param {NonNegativeIntegerArray} shape - ndarray shape -* @param {string} xtype - input ndarray data type -* @param {string} ytype - output ndarray data type -* @param {string} order - memory layout -* @returns {Function} benchmark function -*/ -function createBenchmark( len, shape, xtype, ytype, order ) { - var isrm; - var x; - var y; - - isrm = isRowMajor( order ); - - x = discreteUniform( len, -100, 100, { - 'dtype': xtype - }); - y = filledarray( 0.0, len, ytype ); - - x = { - 'dtype': xtype, - 'data': x, - 'shape': shape, - 'strides': shape2strides( shape, order ), - 'offset': 0, - 'order': order - }; - y = { - 'dtype': ytype, - 'data': y, - 'shape': shape, - 'strides': shape2strides( shape, order ), - 'offset': 0, - 'order': order - }; - return benchmark; - - /** - * Benchmark function. - * - * @private - * @param {Benchmark} b - benchmark instance - */ - function benchmark( b ) { - var i; - - b.tic(); - for ( i = 0; i < b.iterations; i++ ) { - binary( x, x, y, isrm, add ); - if ( isnan( y.data[ i%len ] ) ) { - b.fail( 'should not return NaN' ); - } - } - b.toc(); - if ( isnan( y.data[ i%len ] ) ) { - b.fail( 'should not return NaN' ); - } - b.pass( 'benchmark finished' ); - b.end(); - } -} - - -// MAIN // - -/** -* Main execution sequence. -* -* @private -*/ -function main() { - var len; - var min; - var max; - var ord; - var sh; - var t1; - var t2; - var f; - var i; - var j; - var k; - - min = 1; // 10^min - max = 6; // 10^max - - for ( k = 0; k < ORDERS.length; k++ ) { - ord = ORDERS[ k ]; - for ( j = 0; j < TYPES.length; j++ ) { - t1 = TYPES[ j ]; - t2 = TYPES[ j ]; - for ( i = min; i <= max; i++ ) { - len = pow( 10, i ); - - sh = [ len/2, 2 ]; - f = createBenchmark( len, sh, t1, t2, ord ); - bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,yorder=%s,xtype=%s,ytype=%s', pkg, sh.length, len, sh.join( ',' ), ord, ord, t1, t2 ), f ); - - sh = [ 2, len/2 ]; - f = createBenchmark( len, sh, t1, t2, ord ); - bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,yorder=%s,xtype=%s,ytype=%s', pkg, sh.length, len, sh.join( ',' ), ord, ord, t1, t2 ), f ); - - len = floor( sqrt( len ) ); - sh = [ len, len ]; - len *= len; - f = createBenchmark( len, sh, t1, t2, ord ); - bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,yorder=%s,xtype=%s,ytype=%s', pkg, sh.length, len, sh.join( ',' ), ord, ord, t1, t2 ), f ); - } - } - } -} - -main(); diff --git a/branches.md b/branches.md deleted file mode 100644 index 5d90f94..0000000 --- a/branches.md +++ /dev/null @@ -1,56 +0,0 @@ - - -# Branches - -This repository has the following branches: - -- **main**: default branch generated from the [stdlib project][stdlib-url], where all development takes place. -- **production**: [production build][production-url] of the package (e.g., reformatted error messages to reduce bundle sizes and thus the number of bytes transmitted over a network). -- **esm**: [ES Module][esm-url] branch for use via a `script` tag without the need for installation and bundlers (see [README][esm-readme]). -- **deno**: [Deno][deno-url] branch for use in Deno (see [README][deno-readme]). -- **umd**: [UMD][umd-url] branch for use in Observable, or in dual browser/Node.js environments (see [README][umd-readme]). - -The following diagram illustrates the relationships among the above branches: - -```mermaid -graph TD; -A[stdlib]-->|generate standalone package|B; -B[main] -->|productionize| C[production]; -C -->|bundle| D[esm]; -C -->|bundle| E[deno]; -C -->|bundle| F[umd]; - -%% click A href "https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/ndarray/base/binary" -%% click B href "https://github.com/stdlib-js/ndarray-base-binary/tree/main" -%% click C href "https://github.com/stdlib-js/ndarray-base-binary/tree/production" -%% click D href "https://github.com/stdlib-js/ndarray-base-binary/tree/esm" -%% click E href "https://github.com/stdlib-js/ndarray-base-binary/tree/deno" -%% click F href "https://github.com/stdlib-js/ndarray-base-binary/tree/umd" -``` - -[stdlib-url]: https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/ndarray/base/binary -[production-url]: https://github.com/stdlib-js/ndarray-base-binary/tree/production -[deno-url]: https://github.com/stdlib-js/ndarray-base-binary/tree/deno -[deno-readme]: https://github.com/stdlib-js/ndarray-base-binary/blob/deno/README.md -[umd-url]: https://github.com/stdlib-js/ndarray-base-binary/tree/umd -[umd-readme]: https://github.com/stdlib-js/ndarray-base-binary/blob/umd/README.md -[esm-url]: https://github.com/stdlib-js/ndarray-base-binary/tree/esm -[esm-readme]: https://github.com/stdlib-js/ndarray-base-binary/blob/esm/README.md \ No newline at end of file diff --git a/browser.js b/browser.js new file mode 100644 index 0000000..6dac5d1 --- /dev/null +++ b/browser.js @@ -0,0 +1,3 @@ +// Copyright (c) 2026 The Stdlib Authors. License is Apache-2.0: http://www.apache.org/licenses/LICENSE-2.0 +var r,t;r=this,t=function(){"use strict";function r(r){var t,e;for(t=0,e=0;e0&&(e-=1),n=r.toExponential(e)):n=r.toPrecision(t.precision),t.alternate||(n=c.call(n,w,"$1e"),n=c.call(n,v,"e"),n=c.call(n,m,""));break;default:throw new Error("invalid double notation. Value: "+t.specifier)}return n=c.call(n,p,"e+0$1"),n=c.call(n,y,"e-0$1"),t.alternate&&(n=c.call(n,d,"$1."),n=c.call(n,g,"$1.e")),r>=0&&t.sign&&(n=t.sign+n),n=t.specifier===h.call(t.specifier)?h.call(n):l.call(n)}function E(r){var t,e="";for(t=0;t127)throw new Error("invalid character code. Value: "+o.arg);o.arg=x(f)?String(o.arg):_(f)}break;case"e":case"E":case"f":case"F":case"g":case"G":if(t||(o.precision=6),h=parseFloat(o.arg),!isFinite(h)){if(!n(o.arg))throw new Error("invalid floating-point number. Value: "+u);h=o.arg,o.padZeros=!1}o.arg=b(h,o);break;default:throw new Error("invalid specifier: "+o.specifier)}o.maxWidth>=0&&o.arg.length>o.maxWidth&&(o.arg=o.arg.substring(0,o.maxWidth)),o.padZeros?o.arg=i(o.arg,o.width||o.precision,o.padRight):o.width&&(o.arg=(y=o.arg,d=o.width,g=o.padRight,m=void 0,(m=d-y.length)<0?y:y=g?y+E(m):E(m)+y)),u+=o.arg||"",l+=1}return u}var j=/%(?:([1-9]\d*)\$)?([0 +\-#]*)(\*|\d+)?(?:(\.)(\*|\d+)?)?[hlL]?([%A-Za-z])/g;function S(r){var t={mapping:r[1]?parseInt(r[1],10):void 0,flags:r[2],width:r[3],precision:r[5],specifier:r[6]};return"."===r[4]&&void 0===r[5]&&(t.precision="1"),t}function F(r){var t,e,n,o;for(e=[],o=0,n=j.exec(r);n;)(t=r.slice(o,j.lastIndex-n[0].length)).length&&e.push(t),"%"===n[6]?e.push("%"):e.push(S(n)),o=j.lastIndex,n=j.exec(r);return(t=r.slice(o)).length&&e.push(t),e}function O(r){var t,e;if("string"!=typeof r)throw new TypeError(O("invalid argument. First argument must be a string. Value: `%s`.",r));for(t=[F(r)],e=1;e0?i+=a*(r[f]-1):a<0&&(o+=a*(r[f]-1))}return[o,i]}N(U,"assign",(function(r,t,e,n){var o,i,a,f,s;for(o=r.length,i=e,a=e,s=0;s0?a+=f*(r[s]-1):f<0&&(i+=f*(r[s]-1))}return n[0]=i,n[1]=a,n}));var Y="function";function z(r){return typeof r.get===Y&&typeof r.set===Y}var W={complex128:function(r,t){return r.get(t)},complex64:function(r,t){return r.get(t)},default:function(r,t){return r.get(t)}};function Z(r){var t=W[r];return"function"==typeof t?t:W.default}var $={complex128:function(r,t,e){r.set(e,t)},complex64:function(r,t,e){r.set(e,t)},default:function(r,t,e){r.set(e,t)}};function G(r){var t=$[r];return"function"==typeof t?t:$.default}var K={float64:function(r,t){return r[t]},float32:function(r,t){return r[t]},int32:function(r,t){return r[t]},int16:function(r,t){return r[t]},int8:function(r,t){return r[t]},uint32:function(r,t){return r[t]},uint16:function(r,t){return r[t]},uint8:function(r,t){return r[t]},uint8c:function(r,t){return r[t]},generic:function(r,t){return r[t]},default:function(r,t){return r[t]}};function X(r){var t=K[r];return"function"==typeof t?t:K.default}var H={float64:function(r,t,e){r[t]=e},float32:function(r,t,e){r[t]=e},int32:function(r,t,e){r[t]=e},int16:function(r,t,e){r[t]=e},int8:function(r,t,e){r[t]=e},uint32:function(r,t,e){r[t]=e},uint16:function(r,t,e){r[t]=e},uint8:function(r,t,e){r[t]=e},uint8c:function(r,t,e){r[t]=e},generic:function(r,t,e){r[t]=e},default:function(r,t,e){r[t]=e}};function J(r){var t=H[r];return"function"==typeof t?t:H.default}function D(r){var t,e,n;if(0===(t=r.length))return 0;for(e=1,n=0;n=0;o--)e[o]=n,n*=r[o];return e}(r)}N(hr,"isPrimitive",Q),N(hr,"isObject",lr),N(pr,"assign",(function(r,t,e){return cr(t)?function(r,t){var e,n;for(e=1,n=0;n=0;n--)t[n]=e,e*=r[n];return t}(r,e)}));var yr="row-major";function dr(r,t){var e,n,o;return"object"!=typeof(o=r.strides)||null===o?0===(n=r.shape).length?[0]:(Q(e=r.order)||(e=yr),pr(n,e)):t?q(o):o}function gr(r){return"number"==typeof r}var mr=Number,vr=mr.prototype.toString,wr=tr();function br(r){return"object"==typeof r&&(r instanceof mr||(wr?function(r){try{return vr.call(r),!0}catch(r){return!1}}(r):"[object Number]"===fr(r)))}function Er(r){return gr(r)||br(r)}function _r(r){var t,e,n;return gr(n=r.offset)?n:0===(e=r.shape).length||"object"!=typeof(t=r.strides)||null===t?0:function(r,t){var e,n,o;for(n=r.length,e=0,o=0;oo&&(n=!1),!n&&!t)return 0;o=i}return n&&t?3:n?1:2}N(Er,"isPrimitive",gr),N(Er,"isObject",br);var Vr="row-major",Ar="column-major";function jr(r){var t,e;return Q(e=r.order)?e:"object"!=typeof(t=r.strides)||null===t||1===(e=xr(t))||3===e?Vr:2===e?Ar:0===r.shape.length?Vr:null}function Sr(r){var t,e,n,o;return t=function(r){return r.data}(r),n=function(r,t){var e=r.shape;return t?q(e):e}(r,!0),o=function(r){return r.dtype}(r),e=z(t),{ref:r,dtype:o,data:t,length:D(n),shape:n,strides:dr(r,!0),offset:_r(r),order:jr(r),accessorProtocol:e,accessors:e?[Z(o),G(o)]:[X(o),J(o)]}}var Fr=Array.isArray?Array.isArray:function(r){return"[object Array]"===fr(r)};function Or(r){if("function"!=typeof r)throw new TypeError(O("invalid argument. Must provide a function. Value: `%s`.",r));return function(t){var e,n;if(!Fr(t))return!1;if(0===(e=t.length))return!1;for(n=0;nOt&&It(r)}function Bt(r){return gr(r)&&kt(r)}function Rt(r){return br(r)&&kt(r.valueOf())}function Mt(r){return Bt(r)||Rt(r)}function Ct(r){return Bt(r)&&r>=0}function Pt(r){return Rt(r)&&r.valueOf()>=0}function Nt(r){return Ct(r)||Pt(r)}N(Mt,"isPrimitive",Bt),N(Mt,"isObject",Rt),N(Nt,"isPrimitive",Ct),N(Nt,"isObject",Pt);var Ut=4294967295;function Yt(r){return"object"==typeof r&&null!==r&&"number"==typeof r.length&&It(r.length)&&r.length>=0&&r.length<=Ut}var zt=9007199254740991;function Wt(r){return"object"==typeof r&&null!==r&&"number"==typeof r.length&&It(r.length)&&r.length>=0&&r.length<=zt}var Zt="function"==typeof ArrayBuffer;function $t(r){return Zt&&r instanceof ArrayBuffer||"[object ArrayBuffer]"===fr(r)}function Gt(r){return"object"==typeof r&&null!==r&&!Fr(r)}var Kt=Or(hr.isPrimitive),Xt=Or(hr.isObject),Ht=Or(hr);N(Ht,"primitives",Kt),N(Ht,"objects",Xt);var Jt=/./;function Dt(r){return"boolean"==typeof r}var qt=Boolean,Qt=Boolean.prototype.toString,re=tr();function te(r){return"object"==typeof r&&(r instanceof qt||(re?function(r){try{return Qt.call(r),!0}catch(r){return!1}}(r):"[object Boolean]"===fr(r)))}function ee(r){return Dt(r)||te(r)}N(ee,"isPrimitive",Dt),N(ee,"isObject",te);var ne="object"==typeof self?self:null,oe="object"==typeof window?window:null,ie="object"==typeof globalThis?globalThis:null,ae=function(r){if(arguments.length){if(!Dt(r))throw new TypeError(O("invalid argument. Must provide a boolean. Value: `%s`.",r));if(r)return new Function("return this;")()}if(ie)return ie;if(ne)return ne;if(oe)return oe;throw new Error("unexpected error. Unable to resolve global object.")}(),fe=ae.document&&ae.document.childNodes,se=Int8Array,ue="function"==typeof Jt||"object"==typeof se||"function"==typeof fe?function(r){return Rr(r).toLowerCase()}:function(r){var t;return null===r?"null":"object"==(t=typeof r)?Rr(r).toLowerCase():t};function le(r){return"function"===ue(r)}function he(r,t,e){P(r,t,{configurable:!1,enumerable:!0,writable:!1,value:e})}function ce(r,t){if(!(this instanceof ce))throw new TypeError("invalid invocation. Constructor must be called with the `new` keyword.");if(!gr(r))throw new TypeError(O("invalid argument. Real component must be a number. Value: `%s`.",r));if(!gr(t))throw new TypeError(O("invalid argument. Imaginary component must be a number. Value: `%s`.",t));return he(this,"re",r),he(this,"im",t),this}N(ce,"name","Complex128"),N(ce,"BYTES_PER_ELEMENT",8),N(ce.prototype,"BYTES_PER_ELEMENT",8),N(ce.prototype,"byteLength",16),N(ce.prototype,"toString",(function(){var r=""+this.re;return this.im<0?r+=" - "+-this.im:r+=" + "+this.im,r+="i"})),N(ce.prototype,"toJSON",(function(){var r={type:"Complex128"};return r.re=this.re,r.im=this.im,r}));var pe="function"==typeof Math.fround?Math.fround:null,ye=new Xr(1),de="function"==typeof pe?pe:function(r){return ye[0]=r,ye[0]};function ge(r,t){if(!(this instanceof ge))throw new TypeError("invalid invocation. Constructor must be called with the `new` keyword.");if(!gr(r))throw new TypeError(O("invalid argument. Real component must be a number. Value: `%s`.",r));if(!gr(t))throw new TypeError(O("invalid argument. Imaginary component must be a number. Value: `%s`.",t));return he(this,"re",de(r)),he(this,"im",de(t)),this}function me(r){return r instanceof ce||r instanceof ge||"object"==typeof r&&null!==r&&"number"==typeof r.re&&"number"==typeof r.im}function ve(r){return It(r/2)}N(ge,"name","Complex64"),N(ge,"BYTES_PER_ELEMENT",4),N(ge.prototype,"BYTES_PER_ELEMENT",4),N(ge.prototype,"byteLength",8),N(ge.prototype,"toString",(function(){var r=""+this.re;return this.im<0?r+=" - "+-this.im:r+=" + "+this.im,r+="i"})),N(ge.prototype,"toJSON",(function(){var r={type:"Complex64"};return r.re=this.re,r.im=this.im,r}));var we=8;function be(r){return"object"==typeof r&&null!==r&&"Complex64Array"===r.constructor.name&&r.BYTES_PER_ELEMENT===we}var Ee=16;function _e(r){return"object"==typeof r&&null!==r&&"Complex128Array"===r.constructor.name&&r.BYTES_PER_ELEMENT===Ee}function Te(){return"function"==typeof ir&&"symbol"==typeof ir("foo")&&or(ir,"iterator")&&"symbol"==typeof ir.iterator}var xe=Te()?Symbol.iterator:null;function Ve(r,t,e){P(r,t,{configurable:!1,enumerable:!1,get:e})}function Ae(r){return r.re}function je(r){return r.im}function Se(r,t){return new Xr(r.buffer,r.byteOffset+r.BYTES_PER_ELEMENT*t,2*(r.length-t))}function Fe(r,t){return new zr(r.buffer,r.byteOffset+r.BYTES_PER_ELEMENT*t,2*(r.length-t))}function Oe(r){var t,e,n;for(t=[];!(e=r.next()).done;)if(Yt(n=e.value)&&n.length>=2)t.push(n[0],n[1]);else{if(!me(n))return new TypeError(O("invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",n));t.push(Ae(n),je(n))}return t}var Le=2*Xr.BYTES_PER_ELEMENT,Ie=Te();function ke(r){return r instanceof Me||"object"==typeof r&&null!==r&&("Complex64Array"===r.constructor.name||"Complex128Array"===r.constructor.name)&&"number"==typeof r._length&&"object"==typeof r._buffer}function Be(r){return r===Me||"Complex128Array"===r.name}function Re(r,t){return new ge(r[t*=2],r[t+1])}function Me(){var r,t,e,n;if(t=arguments.length,!(this instanceof Me))return 0===t?new Me:1===t?new Me(arguments[0]):2===t?new Me(arguments[0],arguments[1]):new Me(arguments[0],arguments[1],arguments[2]);if(0===t)e=new Xr(0);else if(1===t)if(Ct(arguments[0]))e=new Xr(2*arguments[0]);else if(Wt(arguments[0]))if((n=(e=arguments[0]).length)&&Fr(e)&&me(e[0])){if(e=function(r,t){var e,n,o,i;for(e=t.length,i=0,o=0;oe.byteLength-r)throw new RangeError(O("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",n*Le));e=new Xr(e,r,2*n)}}return N(this,"_buffer",e),N(this,"_length",e.length/2),this}function Ce(r){return r.re}function Pe(r){return r.im}function Ne(r){var t,e,n;for(t=[];!(e=r.next()).done;)if(Yt(n=e.value)&&n.length>=2)t.push(n[0],n[1]);else{if(!me(n))return new TypeError(O("invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",n));t.push(Ce(n),Pe(n))}return t}N(Me,"BYTES_PER_ELEMENT",Le),N(Me,"name","Complex64Array"),N(Me,"from",(function(r){var t,e,n,o,i,a,f,s,u,l,h,c;if(!le(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Be(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if((e=arguments.length)>1){if(!le(n=arguments[1]))throw new TypeError(O("invalid argument. Second argument must be a function. Value: `%s`.",n));e>2&&(t=arguments[2])}if(ke(r)){if(s=r.length,n){for(i=(o=new this(s))._buffer,c=0,h=0;h=2))throw new TypeError(O("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));i[c]=l[0],i[c+1]=l[1]}c+=2}return o}return new this(r)}if(Wt(r)){if(n){for(s=r.length,f=r.get&&r.set?Z("default"):X("default"),h=0;h=2))throw new TypeError(O("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));i[c]=l[0],i[c+1]=l[1]}c+=2}return o}return new this(r)}if(Gt(r)&&Ie&&le(r[xe])){if(!le((i=r[xe]()).next))throw new TypeError(O("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",r));if(a=n?function(r,t,e){var n,o,i,a;for(n=[],a=-1;!(o=r.next()).done;)if(a+=1,Yt(i=t.call(e,o.value,a))&&i.length>=2)n.push(i[0],i[1]);else{if(!me(i))return new TypeError(O("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",i));n.push(Ae(i),je(i))}return n}(i,n,t):Oe(i),a instanceof Error)throw a;for(i=(o=new this(s=a.length/2))._buffer,h=0;h=this._length))return Re(this._buffer,r)})),Ve(Me.prototype,"buffer",(function(){return this._buffer.buffer})),Ve(Me.prototype,"byteLength",(function(){return this._buffer.byteLength})),Ve(Me.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),N(Me.prototype,"BYTES_PER_ELEMENT",Me.BYTES_PER_ELEMENT),N(Me.prototype,"copyWithin",(function(r,t){if(!ke(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return 2===arguments.length?this._buffer.copyWithin(2*r,2*t):this._buffer.copyWithin(2*r,2*t,2*arguments[2]),this})),N(Me.prototype,"entries",(function(){var r,t,e,n,o,i;if(!ke(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return r=this,n=this._buffer,e=this._length,i=-1,N(t={},"next",(function(){return i+=1,o||i>=e?{done:!0}:{value:[i,Re(n,i)],done:!1}})),N(t,"return",(function(r){return o=!0,arguments.length?{value:r,done:!0}:{done:!0}})),xe&&N(t,xe,(function(){return r.entries()})),t})),N(Me.prototype,"every",(function(r,t){var e,n;if(!ke(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!le(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n1){if(!It(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));if(t<0&&(t+=o)<0&&(t=0),arguments.length>2){if(!It(e))throw new TypeError(O("invalid argument. Third argument must be an integer. Value: `%s`.",e));e<0&&(e+=o)<0&&(e=0),e>o&&(e=o)}else e=o}else t=0,e=o;for(a=Ae(r),f=je(r),s=t;s=0;n--)if(o=Re(e,n),r.call(t,o,n,this))return o})),N(Me.prototype,"findLastIndex",(function(r,t){var e,n,o;if(!ke(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!le(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length-1;n>=0;n--)if(o=Re(e,n),r.call(t,o,n,this))return n;return-1})),N(Me.prototype,"forEach",(function(r,t){var e,n,o;if(!ke(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!le(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n=this._length))return Re(this._buffer,r)})),N(Me.prototype,"includes",(function(r,t){var e,n,o,i,a;if(!ke(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!me(r))throw new TypeError(O("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!It(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(o=Ae(r),i=je(r),e=this._buffer,a=t;a1){if(!It(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(o=Ae(r),i=je(r),e=this._buffer,a=t;a=e?{done:!0}:{value:o,done:!1}})),N(t,"return",(function(r){return n=!0,arguments.length?{value:r,done:!0}:{done:!0}})),xe&&N(t,xe,(function(){return r.keys()})),t})),N(Me.prototype,"lastIndexOf",(function(r,t){var e,n,o,i,a;if(!ke(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!me(r))throw new TypeError(O("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!It(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t>=this._length?t=this._length-1:t<0&&(t+=this._length)}else t=this._length-1;for(o=Ae(r),i=je(r),e=this._buffer,a=t;a>=0;a--)if(o===e[n=2*a]&&i===e[n+1])return a;return-1})),Ve(Me.prototype,"length",(function(){return this._length})),N(Me.prototype,"map",(function(r,t){var e,n,o,i,a;if(!ke(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!le(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(n=this._buffer,e=(o=new this.constructor(this._length))._buffer,i=0;i1)n=t,i=0;else{if(0===o)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");n=Re(e,0),i=1}for(;i1)n=t,i=o-1;else{if(0===o)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");n=Re(e,o-1),i=o-2}for(;i>=0;i--)n=r(n,Re(e,i),i,this);return n})),N(Me.prototype,"reverse",(function(){var r,t,e,n,o,i;if(!ke(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(e=this._length,r=this._buffer,n=Lt(e/2),o=0;o1){if(!Ct(e=arguments[1]))throw new TypeError(O("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",e))}else e=0;if(me(r)){if(e>=this._length)throw new RangeError(O("invalid argument. Index argument is out-of-bounds. Value: `%u`.",e));return n[e*=2]=Ae(r),void(n[e+1]=je(r))}if(ke(r)){if(e+(a=r._length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=r._buffer,u=n.byteOffset+e*Le,t.buffer===n.buffer&&t.byteOffsetu){for(o=new Xr(t.length),s=0;sthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=r,u=n.byteOffset+e*Le,t.buffer===n.buffer&&t.byteOffsetu){for(o=new Xr(a),s=0;sthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");for(e*=2,s=0;sf&&(t=f)}}for(e=ro&&(t=o)}}return r>=o?(o=0,e=n.byteLength):r>=t?(o=0,e=n.byteOffset+r*Le):(o=t-r,e=n.byteOffset+r*Le),new this.constructor(n.buffer,e,o<0?0:o)})),N(Me.prototype,"toLocaleString",(function(r,t){var e,n,o,i,a;if(!ke(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(0===arguments.length)n=[];else{if(!Q(r)&&!Kt(r))throw new TypeError(O("invalid argument. First argument must be a string or an array of strings. Value: `%s`.",r));n=r}if(arguments.length<2)e={};else{if(!Gt(t))throw new TypeError(O("invalid argument. Options argument must be an object. Value: `%s`.",t));e=t}for(i=this._buffer,o=[],a=0;a=e?{done:!0}:{value:Re(o,i),done:!1}})),N(r,"return",(function(r){return n=!0,arguments.length?{value:r,done:!0}:{done:!0}})),xe&&N(r,xe,(function(){return t.values()})),r})),N(Me.prototype,"with",(function(r,t){var e,n,o;if(!ke(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!It(r))throw new TypeError(O("invalid argument. First argument must be an integer. Value: `%s`.",r));if(o=this._length,r<0&&(r+=o),r<0||r>=o)throw new RangeError(O("invalid argument. Index argument is out-of-bounds. Value: `%s`.",r));if(!me(t))throw new TypeError(O("invalid argument. Second argument must be a complex number. Value: `%s`.",t));return(e=(n=new this.constructor(this._buffer))._buffer)[2*r]=Ae(t),e[2*r+1]=je(t),n}));var Ue=2*zr.BYTES_PER_ELEMENT,Ye=Te();function ze(r){return r instanceof $e||"object"==typeof r&&null!==r&&("Complex64Array"===r.constructor.name||"Complex128Array"===r.constructor.name)&&"number"==typeof r._length&&"object"==typeof r._buffer}function We(r){return r===$e||"Complex64Array"===r.name}function Ze(r,t){return new ce(r[t*=2],r[t+1])}function $e(){var r,t,e,n;if(t=arguments.length,!(this instanceof $e))return 0===t?new $e:1===t?new $e(arguments[0]):2===t?new $e(arguments[0],arguments[1]):new $e(arguments[0],arguments[1],arguments[2]);if(0===t)e=new zr(0);else if(1===t)if(Ct(arguments[0]))e=new zr(2*arguments[0]);else if(Wt(arguments[0]))if((n=(e=arguments[0]).length)&&Fr(e)&&me(e[0])){if(e=function(r,t){var e,n,o,i;for(e=t.length,i=0,o=0;oe.byteLength-r)throw new RangeError(O("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",n*Ue));e=new zr(e,r,2*n)}}return N(this,"_buffer",e),N(this,"_length",e.length/2),this}function Ge(r){var t,e;for(t=[];!(e=r.next()).done;)t.push(qt(e.value));return t}N($e,"BYTES_PER_ELEMENT",Ue),N($e,"name","Complex128Array"),N($e,"from",(function(r){var t,e,n,o,i,a,f,s,u,l,h,c;if(!le(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!We(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if((e=arguments.length)>1){if(!le(n=arguments[1]))throw new TypeError(O("invalid argument. Second argument must be a function. Value: `%s`.",n));e>2&&(t=arguments[2])}if(ze(r)){if(s=r.length,n){for(i=(o=new this(s))._buffer,c=0,h=0;h=2))throw new TypeError(O("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));i[c]=l[0],i[c+1]=l[1]}c+=2}return o}return new this(r)}if(Wt(r)){if(n){for(s=r.length,f=r.get&&r.set?Z("default"):X("default"),h=0;h=2))throw new TypeError(O("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));i[c]=l[0],i[c+1]=l[1]}c+=2}return o}return new this(r)}if(Gt(r)&&Ye&&le(r[xe])){if(!le((i=r[xe]()).next))throw new TypeError(O("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",r));if(a=n?function(r,t,e){var n,o,i,a;for(n=[],a=-1;!(o=r.next()).done;)if(a+=1,Yt(i=t.call(e,o.value,a))&&i.length>=2)n.push(i[0],i[1]);else{if(!me(i))return new TypeError(O("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",i));n.push(Ce(i),Pe(i))}return n}(i,n,t):Ne(i),a instanceof Error)throw a;for(i=(o=new this(s=a.length/2))._buffer,h=0;h=this._length))return Ze(this._buffer,r)})),Ve($e.prototype,"buffer",(function(){return this._buffer.buffer})),Ve($e.prototype,"byteLength",(function(){return this._buffer.byteLength})),Ve($e.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),N($e.prototype,"BYTES_PER_ELEMENT",$e.BYTES_PER_ELEMENT),N($e.prototype,"copyWithin",(function(r,t){if(!ze(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return 2===arguments.length?this._buffer.copyWithin(2*r,2*t):this._buffer.copyWithin(2*r,2*t,2*arguments[2]),this})),N($e.prototype,"entries",(function(){var r,t,e,n,o,i,a;if(!ze(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return t=this,r=this._buffer,n=this._length,i=-1,a=-2,N(e={},"next",(function(){var t;return i+=1,o||i>=n?{done:!0}:(t=new ce(r[a+=2],r[a+1]),{value:[i,t],done:!1})})),N(e,"return",(function(r){return o=!0,arguments.length?{value:r,done:!0}:{done:!0}})),xe&&N(e,xe,(function(){return t.entries()})),e})),N($e.prototype,"every",(function(r,t){var e,n;if(!ze(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!le(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n1){if(!It(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));if(t<0&&(t+=o)<0&&(t=0),arguments.length>2){if(!It(e))throw new TypeError(O("invalid argument. Third argument must be an integer. Value: `%s`.",e));e<0&&(e+=o)<0&&(e=0),e>o&&(e=o)}else e=o}else t=0,e=o;for(a=Ce(r),f=Pe(r),s=t;s=0;n--)if(o=Ze(e,n),r.call(t,o,n,this))return o})),N($e.prototype,"findLastIndex",(function(r,t){var e,n,o;if(!ze(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!le(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length-1;n>=0;n--)if(o=Ze(e,n),r.call(t,o,n,this))return n;return-1})),N($e.prototype,"forEach",(function(r,t){var e,n,o;if(!ze(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!le(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n=this._length))return Ze(this._buffer,r)})),Ve($e.prototype,"length",(function(){return this._length})),N($e.prototype,"includes",(function(r,t){var e,n,o,i,a;if(!ze(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!me(r))throw new TypeError(O("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!It(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(o=Ce(r),i=Pe(r),e=this._buffer,a=t;a1){if(!It(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(o=Ce(r),i=Pe(r),e=this._buffer,a=t;a=e?{done:!0}:{value:o,done:!1}})),N(t,"return",(function(r){return n=!0,arguments.length?{value:r,done:!0}:{done:!0}})),xe&&N(t,xe,(function(){return r.keys()})),t})),N($e.prototype,"lastIndexOf",(function(r,t){var e,n,o,i,a;if(!ze(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!me(r))throw new TypeError(O("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!It(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t>=this._length?t=this._length-1:t<0&&(t+=this._length)}else t=this._length-1;for(o=Ce(r),i=Pe(r),e=this._buffer,a=t;a>=0;a--)if(o===e[n=2*a]&&i===e[n+1])return a;return-1})),N($e.prototype,"map",(function(r,t){var e,n,o,i,a;if(!ze(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!le(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(n=this._buffer,e=(o=new this.constructor(this._length))._buffer,i=0;i1)n=t,i=0;else{if(0===o)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");n=Ze(e,0),i=1}for(;i1)n=t,i=o-1;else{if(0===o)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");n=Ze(e,o-1),i=o-2}for(;i>=0;i--)n=r(n,Ze(e,i),i,this);return n})),N($e.prototype,"reverse",(function(){var r,t,e,n,o,i;if(!ze(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(e=this._length,r=this._buffer,n=Lt(e/2),o=0;o1){if(!Ct(e=arguments[1]))throw new TypeError(O("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",e))}else e=0;if(me(r)){if(e>=this._length)throw new RangeError(O("invalid argument. Index argument is out-of-bounds. Value: `%u`.",e));return n[e*=2]=Ce(r),void(n[e+1]=Pe(r))}if(ze(r)){if(e+(a=r._length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=r._buffer,u=n.byteOffset+e*Ue,t.buffer===n.buffer&&t.byteOffsetu){for(o=new zr(t.length),s=0;sthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=r,u=n.byteOffset+e*Ue,t.buffer===n.buffer&&t.byteOffsetu){for(o=new zr(a),s=0;sthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");for(e*=2,s=0;sf&&(t=f)}}for(e=ro&&(t=o)}}return r>=o?(o=0,e=n.byteLength):r>=t?(o=0,e=n.byteOffset+r*Ue):(o=t-r,e=n.byteOffset+r*Ue),new this.constructor(n.buffer,e,o<0?0:o)})),N($e.prototype,"toLocaleString",(function(r,t){var e,n,o,i,a;if(!ze(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(0===arguments.length)n=[];else{if(!hr(r)&&!Kt(r))throw new TypeError(O("invalid argument. First argument must be a string or an array of strings. Value: `%s`.",r));n=r}if(arguments.length<2)e={};else{if(!Gt(t))throw new TypeError(O("invalid argument. Options argument must be an object. Value: `%s`.",t));e=t}for(i=this._buffer,o=[],a=0;a=e?{done:!0}:{value:Ze(o,i),done:!1}})),N(r,"return",(function(r){return n=!0,arguments.length?{value:r,done:!0}:{done:!0}})),xe&&N(r,xe,(function(){return t.values()})),r})),N($e.prototype,"with",(function(r,t){var e,n,o;if(!ze(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!It(r))throw new TypeError(O("invalid argument. First argument must be an integer. Value: `%s`.",r));if(o=this._length,r<0&&(r+=o),r<0||r>=o)throw new RangeError(O("invalid argument. Index argument is out-of-bounds. Value: `%s`.",r));if(!me(t))throw new TypeError(O("invalid argument. Second argument must be a complex number. Value: `%s`.",t));return(e=(n=new this.constructor(this._buffer))._buffer)[2*r]=Ce(t),e[2*r+1]=Pe(t),n}));var Ke=bt.BYTES_PER_ELEMENT,Xe=Te();function He(r){return"object"==typeof r&&null!==r&&"BooleanArray"===r.constructor.name&&r.BYTES_PER_ELEMENT===Ke}function Je(r){return r===De}function De(){var r,t,e,n,o;if(t=arguments.length,!(this instanceof De))return 0===t?new De:1===t?new De(arguments[0]):2===t?new De(arguments[0],arguments[1]):new De(arguments[0],arguments[1],arguments[2]);if(0===t)e=new bt(0);else if(1===t)if(Ct(o=arguments[0]))e=new bt(o);else if(Wt(o))e=function(r,t){var e,n;for(e=t.length,n=0;ne.byteLength-r)throw new RangeError(O("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",n*Ke));e=new bt(e,r,n)}}return N(this,"_buffer",e),N(this,"_length",e.length),this}N(De,"BYTES_PER_ELEMENT",Ke),N(De,"name","BooleanArray"),N(De,"from",(function(r){var t,e,n,o,i,a,f,s,u;if(!le(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Je(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if((e=arguments.length)>1){if(!le(n=arguments[1]))throw new TypeError(O("invalid argument. Second argument must be a function. Value: `%s`.",n));e>2&&(t=arguments[2])}if(Wt(r)){if(n){for(s=r.length,f=r.get&&r.set?Z("default"):X("default"),i=(o=new this(s))._buffer,u=0;u=e))return qt(t[r])})),Ve(De.prototype,"buffer",(function(){return this._buffer.buffer})),Ve(De.prototype,"byteLength",(function(){return this._buffer.byteLength})),Ve(De.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),N(De.prototype,"BYTES_PER_ELEMENT",De.BYTES_PER_ELEMENT),N(De.prototype,"copyWithin",(function(r,t){if(!He(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");return 2===arguments.length?this._buffer.copyWithin(r,t):this._buffer.copyWithin(r,t,arguments[2]),this})),N(De.prototype,"entries",(function(){var r,t,e,n,o,i;if(!He(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");return r=this,n=this._buffer,e=this._length,i=-1,N(t={},"next",(function(){return i+=1,o||i>=e?{done:!0}:{value:[i,qt(n[i])],done:!1}})),N(t,"return",(function(r){return o=!0,arguments.length?{value:r,done:!0}:{done:!0}})),xe&&N(t,xe,(function(){return r.entries()})),t})),N(De.prototype,"every",(function(r,t){var e,n;if(!He(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!le(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n1){if(!Bt(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));if(t<0&&(t+=o)<0&&(t=0),arguments.length>2){if(!Bt(e))throw new TypeError(O("invalid argument. Third argument must be an integer. Value: `%s`.",e));e<0&&(e+=o)<0&&(e=0),e>o&&(e=o)}else e=o}else t=0,e=o;for(i=r?1:0,a=t;a=0;o--)if(n=qt(e[o]),r.call(t,n,o,this))return n})),N(De.prototype,"findLastIndex",(function(r,t){var e,n,o;if(!He(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!le(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,o=this._length-1;o>=0;o--)if(n=qt(e[o]),r.call(t,n,o,this))return o;return-1})),N(De.prototype,"forEach",(function(r,t){var e,n;if(!He(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!le(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n=this._length))return qt(this._buffer[r])})),N(De.prototype,"includes",(function(r,t){var e,n;if(!He(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!Dt(r))throw new TypeError(O("invalid argument. First argument must be a boolean. Value: `%s`.",r));if(arguments.length>1){if(!Bt(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(e=this._buffer,n=t;n1){if(!Bt(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(e=this._buffer,n=t;n0){if(!Q(r))throw new TypeError(O("invalid argument. First argument must be a string. Value: `%s`.",r))}else r=",";for(t=this._buffer,e=[],n=0;n=e?{done:!0}:{value:o,done:!1}})),N(t,"return",(function(r){return n=!0,arguments.length?{value:r,done:!0}:{done:!0}})),xe&&N(t,xe,(function(){return r.keys()})),t})),N(De.prototype,"lastIndexOf",(function(r,t){var e,n;if(!He(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!Dt(r))throw new TypeError(O("invalid argument. First argument must be a boolean. Value: `%s`.",r));if(arguments.length>1){if(!Bt(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t>=this._length?t=this._length-1:t<0&&(t+=this._length)}else t=this._length-1;for(e=this._buffer,n=t;n>=0;n--)if(r===qt(e[n]))return n;return-1})),Ve(De.prototype,"length",(function(){return this._length})),N(De.prototype,"map",(function(r,t){var e,n,o,i;if(!He(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!le(r))throw new TypeError("invalid argument. First argument must be a function. Value: `%s`.",r);for(o=this._buffer,e=(n=new this.constructor(this._length))._buffer,i=0;i1)o=t,i=0;else{if(0===n)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");o=qt(e[0]),i=1}for(;i1)o=t,i=n-1;else{if(0===n)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");o=qt(e[n-1]),i=n-2}for(;i>=0;i--)o=r(o,qt(e[i]),i,this);return o})),N(De.prototype,"reverse",(function(){var r,t,e,n,o,i;if(!He(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");for(r=this._buffer,e=this._length,n=Lt(e/2),o=0;o1){if(!Ct(e=arguments[1]))throw new TypeError(O("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",e))}else e=0;if(Wt(r)){if(e+(i=r.length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=He(r)?r._buffer:r,f=n.byteOffset+e*Ke,t.buffer===n.buffer&&t.byteOffsetf){for(o=new bt(t.length),a=0;a=this._length)throw new RangeError(O("invalid argument. Index argument is out-of-bounds. Value: `%u`.",e));n[e]=r?1:0}})),N(De.prototype,"slice",(function(r,t){var e,n,o,i,a,f;if(!He(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(i=this._buffer,a=this._length,0===arguments.length)r=0,t=a;else{if(!Bt(r))throw new TypeError(O("invalid argument. First argument must be an integer. Value: `%s`.",r));if(r<0&&(r+=a)<0&&(r=0),1===arguments.length)t=a;else{if(!Bt(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0?(t+=a)<0&&(t=0):t>a&&(t=a)}}for(e=ro&&(t=o)}}return r>=o?(o=0,e=n.byteLength):r>=t?(o=0,e=n.byteOffset+r*Ke):(o=t-r,e=n.byteOffset+r*Ke),new this.constructor(n.buffer,e,o<0?0:o)})),N(De.prototype,"toLocaleString",(function(r,t){var e,n,o,i,a;if(!He(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(0===arguments.length)n=[];else{if(!Q(r)&&!Kt(r))throw new TypeError(O("invalid argument. First argument must be a string or an array of strings. Value: `%s`.",r));n=r}if(arguments.length<2)e={};else{if(!Gt(t))throw new TypeError(O("invalid argument. Options argument must be an object. Value: `%s`.",t));e=t}for(i=this._buffer,o=[],a=0;a=e?{done:!0}:{value:qt(o[i]),done:!1}})),N(r,"return",(function(r){return n=!0,arguments.length?{value:r,done:!0}:{done:!0}})),xe&&N(r,xe,(function(){return t.values()})),r})),N(De.prototype,"with",(function(r,t){var e,n;if(!He(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!Bt(r))throw new TypeError(O("invalid argument. First argument must be an integer. Value: `%s`.",r));if(n=this._length,r<0&&(r+=n),r<0||r>=n)throw new RangeError(O("invalid argument. Index argument is out-of-bounds. Value: `%s`.",r));if(!Dt(t))throw new TypeError(O("invalid argument. Second argument must be a boolean. Value: `%s`.",t));return(e=new this.constructor(this._buffer))._buffer[r]=t?1:0,e}));var qe=[zr,Xr,it,rt,dt,lt,Ft,bt,Vt,Me,$e,De],Qe=["float64","float32","int32","uint32","int16","uint16","int8","uint8","uint8c","complex64","complex128","bool"],rn=Qe.length;function tn(r){var t;if(Fr(r))return"generic";if(Ir(r))return null;for(t=0;t=0&&a=o&&(o=i,h=l);f=n[h][0]}for(e=fn(r.length),function(r,t){var e,n,o,i,a,f,s,u,l;for(n=1,o=1,l=1;l=0&&!(((u=r[i])<0?-u:u)<=e);)r[i+1]=u,t[a+1]=t[a],i-=1,a-=1;r[i+1]=f,t[a+1]=s,n+=1,o+=1}}(q(f),e),a=[un(r,e)],l=0;l0}function cn(r){return Rt(r)&&r.valueOf()>0}function pn(r){return hn(r)||cn(r)}function yn(r){return Object.keys(Object(r))}N(fn,"assign",(function(r,t,e){var n,o,i=(o=tn(n=r),z(n)?{data:n,dtype:o,accessorProtocol:!0,accessors:[Z(o),G(o)]}:{data:n,dtype:o,accessorProtocol:!1,accessors:[X(o),J(o)]});return i.accessorProtocol?"complex128"===i.dtype?sn(r,Fe(r,0),t,e):"complex64"===i.dtype?sn(r,Se(r,0),t,e):function(r,t,e){var n,o,i,a;for(n=r.data,o=r.accessors[1],a=e,i=0;a>=0&&a=0&&o=0&&t=0&&r.length<=Jr&&or(r,"callee")&&!Vn(r,"callee")},jn=Array.prototype.slice,Sn=Vn((function(){}),"prototype"),Fn=!Vn({toString:null},"toString");function On(r,t,e){var n,o;if(!Wt(r)&&!Q(r))throw new TypeError(O("invalid argument. First argument must be an array-like object. Value: `%s`.",r));if(0===(n=r.length))return-1;if(3===arguments.length){if(!Bt(e))throw new TypeError(O("invalid argument. Third argument must be an integer. Value: `%s`.",e));if(e>=0){if(e>=n)return-1;o=e}else(o=n+e)<0&&(o=0)}else o=0;if(_n(t)){for(;o0&&!or(r,"0"))for(f=0;f1){if(!Zn(t))throw new TypeError(O("invalid argument. Options argument must be an object. Value: `%s`.",t));if(or(t,"duplicates")&&!Dt(u=t.duplicates))throw new TypeError(O("invalid option. `%s` option must be a boolean. Option: `%s`.","duplicates",u))}if(n=(e=Nn(r)).length,a={},u)for(s=0;st&&(t=n)}return(n=Xn.BLOCK_SIZE_IN_BYTES/t|0)>0?n:1}([r,t,e])}function Jn(r,t,e,n,o,i){var a,f,s,u,l;for(a=r.length,f=1,l=0;l=f&&(o=f-1);else if("wrap"===i)o<0?(o+=f)<0&&0!=(o%=f)&&(o+=f):o>=f&&(o-=f)>=f&&(o%=f);else if("normalize"===i&&o<0&&(o+=f),o<0||o>=f)throw new RangeError(O("invalid argument. Linear index must not exceed array dimensions. Number of array elements: `%u`. Value: `%d`.",f,o));if(s=e,cr(n)){for(l=0;l=0;l--)o-=u=o%r[l],o/=r[l],s+=u*t[l];return s}var Dn="throw",qn="throw",Qn=[function(r,t,e,n){e.data[e.offset]=n(r.data[r.offset],t.data[t.offset])},function(r,t,e,n){var o,i,a,f,s,u,l,h,c,p,y;for(l=r.shape[0],f=r.strides[0],s=t.strides[0],u=e.strides[0],h=r.offset,c=t.offset,p=e.offset,o=r.data,i=t.data,a=e.data,y=0;y0;)for(I0;)for(L0;)for(Y0;)for(U0;)for(N0;)for(J0;)for(H0;)for(X0;)for(K0;)for(ir0;)for(or0;)for(nr0;)for(er0;)for(tr0;)for(yr0;)for(pr0;)for(cr0;)for(hr0;)for(lr0;)for(ur0;)for(Tr0;)for(_r0;)for(Er0;)for(br0;)for(wr0;)for(vr0;)for(mr0;)for(Ir0;)for(Lr0;)for(Or0;)for(Fr0;)for(Sr0;)for(jr0;)for(Ar0;)for(Vr0;)for(Yr0;)for(Ur0;)for(Nr0;)for(Pr0;)for(Cr0;)for(Mr0;)for(Rr0;)for(Br0;)for(kr0;)for(Jr0;)for(Hr0;)for(Xr0;)for(Kr0;)for(Gr0;)for($r0;)for(Zr0;)for(Wr0;)for(zr0;)for(Yr0;)for(R0;)for(B0;)for(Z0;)for(W0;)for(z0;)for(Q0;)for(q0;)for(D0;)for(J0;)for(sr0;)for(fr0;)for(ar0;)for(ir0;)for(or0;)for(mr0;)for(gr0;)for(dr0;)for(yr0;)for(pr0;)for(cr0;)for(Ar0;)for(Vr0;)for(xr0;)for(Tr0;)for(_r0;)for(Er0;)for(br0;)for(Rr0;)for(Br0;)for(kr0;)for(Ir0;)for(Lr0;)for(Or0;)for(Fr0;)for(Sr0;)for(Zr0;)for(Wr0;)for(zr0;)for(Yr0;)for(Ur0;)for(Nr0;)for(Pr0;)for(Cr0;)for(Mr0;)for(Qr0;)for(qr0;)for(Dr0;)for(Jr0;)for(Hr0;)for(Xr0;)for(Kr0;)for(Gr0;)for($r0;)for(Zr 0 ) {\n\t\t\t\tdigits -= 1;\n\t\t\t}\n\t\t\tout = f.toExponential( digits );\n\t\t} else {\n\t\t\tout = f.toPrecision( token.precision );\n\t\t}\n\t\tif ( !token.alternate ) {\n\t\t\tout = replace.call( out, RE_ZERO_BEFORE_EXP, '$1e' );\n\t\t\tout = replace.call( out, RE_PERIOD_ZERO_EXP, 'e' );\n\t\t\tout = replace.call( out, RE_TRAILING_PERIOD_ZERO, '' );\n\t\t}\n\t\tbreak;\n\tdefault:\n\t\tthrow new Error( 'invalid double notation. Value: ' + token.specifier );\n\t}\n\tout = replace.call( out, RE_EXP_POS_DIGITS, 'e+0$1' );\n\tout = replace.call( out, RE_EXP_NEG_DIGITS, 'e-0$1' );\n\tif ( token.alternate ) {\n\t\tout = replace.call( out, RE_ONLY_DIGITS, '$1.' );\n\t\tout = replace.call( out, RE_DIGITS_BEFORE_EXP, '$1.e' );\n\t}\n\tif ( f >= 0 && token.sign ) {\n\t\tout = token.sign + out;\n\t}\n\tout = ( token.specifier === uppercase.call( token.specifier ) ) ?\n\t\tuppercase.call( out ) :\n\t\tlowercase.call( out );\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default formatDouble;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// FUNCTIONS //\n\n/**\n* Returns `n` spaces.\n*\n* @private\n* @param {number} n - number of spaces\n* @returns {string} string of spaces\n*/\nfunction spaces( n ) {\n\tvar out = '';\n\tvar i;\n\tfor ( i = 0; i < n; i++ ) {\n\t\tout += ' ';\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Pads a token with spaces to the specified width.\n*\n* @private\n* @param {string} str - token argument\n* @param {number} width - token width\n* @param {boolean} [right=false] - boolean indicating whether to pad to the right\n* @returns {string} padded token argument\n*/\nfunction spacePad( str, width, right ) {\n\tvar pad = width - str.length;\n\tif ( pad < 0 ) {\n\t\treturn str;\n\t}\n\tstr = ( right ) ?\n\t\tstr + spaces( pad ) :\n\t\tspaces( pad ) + str;\n\treturn str;\n}\n\n\n// EXPORTS //\n\nexport default spacePad;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport formatInteger from './format_integer.js';\nimport isString from './is_string.js';\nimport isNumber from './is_number.js';\nimport formatDouble from './format_double.js';\nimport spacePad from './space_pad.js';\nimport zeroPad from './zero_pad.js';\n\n\n// VARIABLES //\n\nvar fromCharCode = String.fromCharCode;\nvar isArray = Array.isArray; // NOTE: We use the global `Array.isArray` function here instead of `@stdlib/assert/is-array` to avoid circular dependencies.\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating whether a value is `NaN`.\n*\n* @private\n* @param {*} value - input value\n* @returns {boolean} boolean indicating whether a value is `NaN`\n*\n* @example\n* var bool = isnan( NaN );\n* // returns true\n*\n* @example\n* var bool = isnan( 4 );\n* // returns false\n*/\nfunction isnan( value ) { // explicitly define a function here instead of `@stdlib/math/base/assert/is-nan` in order to avoid circular dependencies\n\treturn ( value !== value );\n}\n\n/**\n* Initializes token object with properties of supplied format identifier object or default values if not present.\n*\n* @private\n* @param {Object} token - format identifier object\n* @returns {Object} token object\n*/\nfunction initialize( token ) {\n\tvar out = {};\n\tout.specifier = token.specifier;\n\tout.precision = ( token.precision === void 0 ) ? 1 : token.precision;\n\tout.width = token.width;\n\tout.flags = token.flags || '';\n\tout.mapping = token.mapping;\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Generates string from a token array by interpolating values.\n*\n* @param {Array} tokens - string parts and format identifier objects\n* @param {Array} ...args - variable values\n* @throws {TypeError} first argument must be an array\n* @throws {Error} invalid flags\n* @returns {string} formatted string\n*\n* @example\n* var tokens = [ 'beep ', { 'specifier': 's' } ];\n* var out = formatInterpolate( tokens, 'boop' );\n* // returns 'beep boop'\n*/\nfunction formatInterpolate( tokens ) {\n\tvar hasPeriod;\n\tvar flags;\n\tvar token;\n\tvar flag;\n\tvar num;\n\tvar out;\n\tvar pos;\n\tvar f;\n\tvar i;\n\tvar j;\n\n\tif ( !isArray( tokens ) ) {\n\t\tthrow new TypeError( 'invalid argument. First argument must be an array. Value: `' + tokens + '`.' );\n\t}\n\tout = '';\n\tpos = 1;\n\tfor ( i = 0; i < tokens.length; i++ ) {\n\t\ttoken = tokens[ i ];\n\t\tif ( isString( token ) ) {\n\t\t\tout += token;\n\t\t} else {\n\t\t\thasPeriod = token.precision !== void 0;\n\t\t\ttoken = initialize( token );\n\t\t\tif ( !token.specifier ) {\n\t\t\t\tthrow new TypeError( 'invalid argument. Token is missing `specifier` property. Index: `'+ i +'`. Value: `' + token + '`.' );\n\t\t\t}\n\t\t\tif ( token.mapping ) {\n\t\t\t\tpos = token.mapping;\n\t\t\t}\n\t\t\tflags = token.flags;\n\t\t\tfor ( j = 0; j < flags.length; j++ ) {\n\t\t\t\tflag = flags.charAt( j );\n\t\t\t\tswitch ( flag ) {\n\t\t\t\tcase ' ':\n\t\t\t\t\ttoken.sign = ' ';\n\t\t\t\t\tbreak;\n\t\t\t\tcase '+':\n\t\t\t\t\ttoken.sign = '+';\n\t\t\t\t\tbreak;\n\t\t\t\tcase '-':\n\t\t\t\t\ttoken.padRight = true;\n\t\t\t\t\ttoken.padZeros = false;\n\t\t\t\t\tbreak;\n\t\t\t\tcase '0':\n\t\t\t\t\ttoken.padZeros = flags.indexOf( '-' ) < 0; // NOTE: We use built-in `Array.prototype.indexOf` here instead of `@stdlib/assert/contains` in order to avoid circular dependencies.\n\t\t\t\t\tbreak;\n\t\t\t\tcase '#':\n\t\t\t\t\ttoken.alternate = true;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tthrow new Error( 'invalid flag: ' + flag );\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( token.width === '*' ) {\n\t\t\t\ttoken.width = parseInt( arguments[ pos ], 10 );\n\t\t\t\tpos += 1;\n\t\t\t\tif ( isnan( token.width ) ) {\n\t\t\t\t\tthrow new TypeError( 'the argument for * width at position ' + pos + ' is not a number. Value: `' + token.width + '`.' );\n\t\t\t\t}\n\t\t\t\tif ( token.width < 0 ) {\n\t\t\t\t\ttoken.padRight = true;\n\t\t\t\t\ttoken.width = -token.width;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( hasPeriod ) {\n\t\t\t\tif ( token.precision === '*' ) {\n\t\t\t\t\ttoken.precision = parseInt( arguments[ pos ], 10 );\n\t\t\t\t\tpos += 1;\n\t\t\t\t\tif ( isnan( token.precision ) ) {\n\t\t\t\t\t\tthrow new TypeError( 'the argument for * precision at position ' + pos + ' is not a number. Value: `' + token.precision + '`.' );\n\t\t\t\t\t}\n\t\t\t\t\tif ( token.precision < 0 ) {\n\t\t\t\t\t\ttoken.precision = 1;\n\t\t\t\t\t\thasPeriod = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\ttoken.arg = arguments[ pos ];\n\t\t\tswitch ( token.specifier ) {\n\t\t\tcase 'b':\n\t\t\tcase 'o':\n\t\t\tcase 'x':\n\t\t\tcase 'X':\n\t\t\tcase 'd':\n\t\t\tcase 'i':\n\t\t\tcase 'u':\n\t\t\t\t// Case: %b (binary), %o (octal), %x, %X (hexadecimal), %d, %i (decimal), %u (unsigned decimal)\n\t\t\t\tif ( hasPeriod ) {\n\t\t\t\t\ttoken.padZeros = false;\n\t\t\t\t}\n\t\t\t\ttoken.arg = formatInteger( token );\n\t\t\t\tbreak;\n\t\t\tcase 's':\n\t\t\t\t// Case: %s (string)\n\t\t\t\ttoken.maxWidth = ( hasPeriod ) ? token.precision : -1;\n\t\t\t\ttoken.arg = String( token.arg );\n\t\t\t\tbreak;\n\t\t\tcase 'c':\n\t\t\t\t// Case: %c (character)\n\t\t\t\tif ( !isnan( token.arg ) ) {\n\t\t\t\t\tnum = parseInt( token.arg, 10 );\n\t\t\t\t\tif ( num < 0 || num > 127 ) {\n\t\t\t\t\t\tthrow new Error( 'invalid character code. Value: ' + token.arg );\n\t\t\t\t\t}\n\t\t\t\t\ttoken.arg = ( isnan( num ) ) ? String( token.arg ) : fromCharCode( num ); // eslint-disable-line max-len\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 'e':\n\t\t\tcase 'E':\n\t\t\tcase 'f':\n\t\t\tcase 'F':\n\t\t\tcase 'g':\n\t\t\tcase 'G':\n\t\t\t\t// Case: %e, %E (scientific notation), %f, %F (decimal floating point), %g, %G (uses the shorter of %e/E or %f/F)\n\t\t\t\tif ( !hasPeriod ) {\n\t\t\t\t\ttoken.precision = 6;\n\t\t\t\t}\n\t\t\t\tf = parseFloat( token.arg );\n\t\t\t\tif ( !isFinite( f ) ) { // NOTE: We use the global `isFinite` function here instead of `@stdlib/math/base/assert/is-finite` in order to avoid circular dependencies.\n\t\t\t\t\tif ( !isNumber( token.arg ) ) {\n\t\t\t\t\t\tthrow new Error( 'invalid floating-point number. Value: ' + out );\n\t\t\t\t\t}\n\t\t\t\t\t// Case: NaN, Infinity, or -Infinity\n\t\t\t\t\tf = token.arg;\n\t\t\t\t\ttoken.padZeros = false;\n\t\t\t\t}\n\t\t\t\ttoken.arg = formatDouble( f, token );\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tthrow new Error( 'invalid specifier: ' + token.specifier );\n\t\t\t}\n\t\t\t// Fit argument into field width...\n\t\t\tif ( token.maxWidth >= 0 && token.arg.length > token.maxWidth ) {\n\t\t\t\ttoken.arg = token.arg.substring( 0, token.maxWidth );\n\t\t\t}\n\t\t\tif ( token.padZeros ) {\n\t\t\t\ttoken.arg = zeroPad( token.arg, token.width || token.precision, token.padRight ); // eslint-disable-line max-len\n\t\t\t} else if ( token.width ) {\n\t\t\t\ttoken.arg = spacePad( token.arg, token.width, token.padRight );\n\t\t\t}\n\t\t\tout += token.arg || '';\n\t\t\tpos += 1;\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default formatInterpolate;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a string primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a string primitive\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns true\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns false\n*/\nfunction isString( value ) {\n\treturn ( typeof value === 'string' ); // NOTE: we inline the `isString.isPrimitive` function from `@stdlib/assert/is-string` in order to avoid circular dependencies.\n}\n\n\n// EXPORTS //\n\nexport default isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar RE = /%(?:([1-9]\\d*)\\$)?([0 +\\-#]*)(\\*|\\d+)?(?:(\\.)(\\*|\\d+)?)?[hlL]?([%A-Za-z])/g;\n\n\n// FUNCTIONS //\n\n/**\n* Parses a delimiter.\n*\n* @private\n* @param {Array} match - regular expression match\n* @returns {Object} delimiter token object\n*/\nfunction parse( match ) {\n\tvar token = {\n\t\t'mapping': ( match[ 1 ] ) ? parseInt( match[ 1 ], 10 ) : void 0,\n\t\t'flags': match[ 2 ],\n\t\t'width': match[ 3 ],\n\t\t'precision': match[ 5 ],\n\t\t'specifier': match[ 6 ]\n\t};\n\tif ( match[ 4 ] === '.' && match[ 5 ] === void 0 ) {\n\t\ttoken.precision = '1';\n\t}\n\treturn token;\n}\n\n\n// MAIN //\n\n/**\n* Tokenizes a string into an array of string parts and format identifier objects.\n*\n* @param {string} str - input string\n* @returns {Array} tokens\n*\n* @example\n* var tokens = formatTokenize( 'Hello %s!' );\n* // returns [ 'Hello ', {...}, '!' ]\n*/\nfunction formatTokenize( str ) {\n\tvar content;\n\tvar tokens;\n\tvar match;\n\tvar prev;\n\n\ttokens = [];\n\tprev = 0;\n\tmatch = RE.exec( str );\n\twhile ( match ) {\n\t\tcontent = str.slice( prev, RE.lastIndex - match[ 0 ].length );\n\t\tif ( content.length ) {\n\t\t\ttokens.push( content );\n\t\t}\n\t\t// Check for an escaped percent sign `%%`...\n\t\tif ( match[ 6 ] === '%' ) {\n\t\t\ttokens.push( '%' );\n\t\t} else {\n\t\t\ttokens.push( parse( match ) );\n\t\t}\n\t\tprev = RE.lastIndex;\n\t\tmatch = RE.exec( str );\n\t}\n\tcontent = str.slice( prev );\n\tif ( content.length ) {\n\t\ttokens.push( content );\n\t}\n\treturn tokens;\n}\n\n\n// EXPORTS //\n\nexport default formatTokenize;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport interpolate from '@stdlib/string-base-format-interpolate';\nimport tokenize from '@stdlib/string-base-format-tokenize';\nimport isString from './is_string.js';\n\n\n// MAIN //\n\n/**\n* Inserts supplied variable values into a format string.\n*\n* @param {string} str - input string\n* @param {Array} ...args - variable values\n* @throws {TypeError} first argument must be a string\n* @throws {Error} invalid flags\n* @returns {string} formatted string\n*\n* @example\n* var str = format( 'Hello %s!', 'world' );\n* // returns 'Hello world!'\n*\n* @example\n* var str = format( 'Pi: ~%.2f', 3.141592653589793 );\n* // returns 'Pi: ~3.14'\n*/\nfunction format( str ) {\n\tvar args;\n\tvar i;\n\n\tif ( !isString( str ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string. Value: `%s`.', str ) );\n\t}\n\targs = [ tokenize( str ) ];\n\tfor ( i = 1; i < arguments.length; i++ ) {\n\t\targs.push( arguments[ i ] );\n\t}\n\treturn interpolate.apply( null, args );\n}\n\n\n// EXPORTS //\n\nexport default format;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a string primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a string primitive\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns true\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns false\n*/\nfunction isString( value ) {\n\treturn ( typeof value === 'string' ); // NOTE: we inline the `isString.isPrimitive` function from `@stdlib/assert/is-string` in order to avoid circular dependencies.\n}\n\n\n// EXPORTS //\n\nexport default isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable no-underscore-dangle, no-proto */\n\n'use strict';\n\n// MODULES //\n\nimport format from '@stdlib/string-format';\n\n\n// VARIABLES //\n\nvar objectProtoype = Object.prototype;\nvar toStr = objectProtoype.toString;\nvar defineGetter = objectProtoype.__defineGetter__;\nvar defineSetter = objectProtoype.__defineSetter__;\nvar lookupGetter = objectProtoype.__lookupGetter__;\nvar lookupSetter = objectProtoype.__lookupSetter__;\n\n\n// MAIN //\n\n/**\n* Defines (or modifies) an object property.\n*\n* ## Notes\n*\n* - Property descriptors come in two flavors: **data descriptors** and **accessor descriptors**. A data descriptor is a property that has a value, which may or may not be writable. An accessor descriptor is a property described by a getter-setter function pair. A descriptor must be one of these two flavors and cannot be both.\n*\n* @param {Object} obj - object on which to define the property\n* @param {string} prop - property name\n* @param {Object} descriptor - property descriptor\n* @param {boolean} [descriptor.configurable=false] - boolean indicating if property descriptor can be changed and if the property can be deleted from the provided object\n* @param {boolean} [descriptor.enumerable=false] - boolean indicating if the property shows up when enumerating object properties\n* @param {boolean} [descriptor.writable=false] - boolean indicating if the value associated with the property can be changed with an assignment operator\n* @param {*} [descriptor.value] - property value\n* @param {(Function|void)} [descriptor.get=undefined] - function which serves as a getter for the property, or, if no getter, undefined. When the property is accessed, a getter function is called without arguments and with the `this` context set to the object through which the property is accessed (which may not be the object on which the property is defined due to inheritance). The return value will be used as the property value.\n* @param {(Function|void)} [descriptor.set=undefined] - function which serves as a setter for the property, or, if no setter, undefined. When assigning a property value, a setter function is called with one argument (the value being assigned to the property) and with the `this` context set to the object through which the property is assigned.\n* @throws {TypeError} first argument must be an object\n* @throws {TypeError} third argument must be an object\n* @throws {Error} property descriptor cannot have both a value and a setter and/or getter\n* @returns {Object} object with added property\n*\n* @example\n* var obj = {};\n*\n* defineProperty( obj, 'foo', {\n* 'value': 'bar'\n* });\n*\n* var str = obj.foo;\n* // returns 'bar'\n*/\nfunction defineProperty( obj, prop, descriptor ) {\n\tvar prototype;\n\tvar hasValue;\n\tvar hasGet;\n\tvar hasSet;\n\n\tif ( typeof obj !== 'object' || obj === null || toStr.call( obj ) === '[object Array]' ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an object. Value: `%s`.', obj ) );\n\t}\n\tif ( typeof descriptor !== 'object' || descriptor === null || toStr.call( descriptor ) === '[object Array]' ) {\n\t\tthrow new TypeError( format( 'invalid argument. Property descriptor must be an object. Value: `%s`.', descriptor ) );\n\t}\n\thasValue = ( 'value' in descriptor );\n\tif ( hasValue ) {\n\t\tif (\n\t\t\tlookupGetter.call( obj, prop ) ||\n\t\t\tlookupSetter.call( obj, prop )\n\t\t) {\n\t\t\t// Override `__proto__` to avoid touching inherited accessors:\n\t\t\tprototype = obj.__proto__;\n\t\t\tobj.__proto__ = objectProtoype;\n\n\t\t\t// Delete property as existing getters/setters prevent assigning value to specified property:\n\t\t\tdelete obj[ prop ];\n\t\t\tobj[ prop ] = descriptor.value;\n\n\t\t\t// Restore original prototype:\n\t\t\tobj.__proto__ = prototype;\n\t\t} else {\n\t\t\tobj[ prop ] = descriptor.value;\n\t\t}\n\t}\n\thasGet = ( 'get' in descriptor );\n\thasSet = ( 'set' in descriptor );\n\n\tif ( hasValue && ( hasGet || hasSet ) ) {\n\t\tthrow new Error( 'invalid argument. Cannot specify one or more accessors and a value or writable attribute in the property descriptor.' );\n\t}\n\n\tif ( hasGet && defineGetter ) {\n\t\tdefineGetter.call( obj, prop, descriptor.get );\n\t}\n\tif ( hasSet && defineSetter ) {\n\t\tdefineSetter.call( obj, prop, descriptor.set );\n\t}\n\treturn obj;\n}\n\n\n// EXPORTS //\n\nexport default defineProperty;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Define (or modify) an object property.\n*\n* @module @stdlib/utils-define-property\n*\n* @example\n* import defineProperty from '@stdlib/utils-define-property';\n*\n* var obj = {};\n* defineProperty( obj, 'foo', {\n* 'value': 'bar',\n* 'writable': false,\n* 'configurable': false,\n* 'enumerable': false\n* });\n* obj.foo = 'boop'; // => throws\n*/\n\n// MODULES //\n\nimport hasDefinePropertySupport from './has_define_property_support.js';\nimport builtin from './builtin.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar defineProperty;\nif ( hasDefinePropertySupport() ) {\n\tdefineProperty = builtin;\n} else {\n\tdefineProperty = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default defineProperty;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport defineProperty from './define_property.js';\n\n\n// MAIN //\n\n/**\n* Tests for `Object.defineProperty` support.\n*\n* @private\n* @returns {boolean} boolean indicating if an environment has `Object.defineProperty` support\n*\n* @example\n* var bool = hasDefinePropertySupport();\n* // returns \n*/\nfunction hasDefinePropertySupport() {\n\t// Test basic support...\n\ttry {\n\t\tdefineProperty( {}, 'x', {} );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default hasDefinePropertySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport defineProperty from '@stdlib/utils-define-property';\n\n\n// MAIN //\n\n/**\n* Defines a non-enumerable read-only property.\n*\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {*} value - value to set\n*\n* @example\n* var obj = {};\n*\n* setNonEnumerableReadOnly( obj, 'foo', 'bar' );\n*\n* try {\n* obj.foo = 'boop';\n* } catch ( err ) {\n* console.error( err.message );\n* }\n*/\nfunction setNonEnumerableReadOnly( obj, prop, value ) {\n\tdefineProperty( obj, prop, {\n\t\t'configurable': false,\n\t\t'enumerable': false,\n\t\t'writable': false,\n\t\t'value': value\n\t});\n}\n\n\n// EXPORTS //\n\nexport default setNonEnumerableReadOnly;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Computes the minimum and maximum linear indices in an underlying data buffer which are accessible to an array view.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @param {NonNegativeInteger} offset - index offset\n* @returns {Array} linear indices\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ 10, 1 ];\n* var offset = 10;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 10, 109 ]\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ -10, -1 ];\n* var offset = 99;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 0, 99 ]\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ 1, 10 ];\n* var offset = 10;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 10, 109 ]\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ -1, -10 ];\n* var offset = 99;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 0, 99 ]\n*/\nfunction minmaxViewBufferIndex( shape, strides, offset ) {\n\tvar ndims;\n\tvar min;\n\tvar max;\n\tvar s;\n\tvar i;\n\n\tndims = shape.length;\n\tmin = offset;\n\tmax = offset;\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tif ( shape[ i ] === 0 ) {\n\t\t\treturn [ offset, offset ];\n\t\t}\n\t\ts = strides[ i ];\n\t\tif ( s > 0 ) {\n\t\t\tmax += s * ( shape[i]-1 );\n\t\t} else if ( s < 0 ) {\n\t\t\tmin += s * ( shape[i]-1 ); // decrements min\n\t\t}\n\t}\n\treturn [ min, max ];\n}\n\n\n// EXPORTS //\n\nexport default minmaxViewBufferIndex;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Compute the minimum and maximum linear indices in an underlying data buffer which are accessible to an array view.\n*\n* @module @stdlib/ndarray-base-minmax-view-buffer-index\n*\n* @example\n* import minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\n*\n* var shape = [ 10, 10 ];\n* var strides = [ 10, 1 ];\n* var offset = 10;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 10, 109 ]\n*\n* @example\n* import minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\n*\n* var shape = [ 10, 10 ];\n* var strides = [ -10, -1 ];\n* var offset = 99;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 0, 99 ]\n*\n* @example\n* import minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\n*\n* var shape = [ 10, 10 ];\n* var strides = [ 1, 10 ];\n* var offset = 10;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 10, 109 ]\n*\n* @example\n* import minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\n*\n* var shape = [ 10, 10 ];\n* var strides = [ -1, -10 ];\n* var offset = 99;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 0, 99 ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport assign from './assign.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Computes the minimum and maximum linear indices in an underlying data buffer which are accessible to an array view and assigns results to a provided output array.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @param {NonNegativeInteger} offset - index offset\n* @param {(Array|TypedArray|Object)} out - output object\n* @returns {(Array|TypedArray|Object)} linear indices\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ 10, 1 ];\n* var offset = 10;\n*\n* var out = [ 0, 0 ];\n* var idx = minmaxViewBufferIndex( shape, strides, offset, out );\n* // returns [ 10, 109 ]\n*\n* var bool = ( idx === out );\n* // returns true\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ -10, -1 ];\n* var offset = 99;\n*\n* var out = [ 0, 0 ];\n* var idx = minmaxViewBufferIndex( shape, strides, offset, out );\n* // returns [ 0, 99 ]\n*\n* var bool = ( idx === out );\n* // returns true\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ 1, 10 ];\n* var offset = 10;\n*\n* var out = [ 0, 0 ];\n* var idx = minmaxViewBufferIndex( shape, strides, offset, out );\n* // returns [ 10, 109 ]\n*\n* var bool = ( idx === out );\n* // returns true\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ -1, -10 ];\n* var offset = 99;\n*\n* var out = [ 0, 0 ];\n* var idx = minmaxViewBufferIndex( shape, strides, offset, out );\n* // returns [ 0, 99 ]\n*\n* var bool = ( idx === out );\n* // returns true\n*/\nfunction minmaxViewBufferIndex( shape, strides, offset, out ) {\n\tvar ndims;\n\tvar min;\n\tvar max;\n\tvar s;\n\tvar i;\n\n\tndims = shape.length;\n\tmin = offset;\n\tmax = offset;\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tif ( shape[ i ] === 0 ) {\n\t\t\tout[ 0 ] = offset;\n\t\t\tout[ 1 ] = offset;\n\t\t\treturn out;\n\t\t}\n\t\ts = strides[ i ];\n\t\tif ( s > 0 ) {\n\t\t\tmax += s * ( shape[i]-1 );\n\t\t} else if ( s < 0 ) {\n\t\t\tmin += s * ( shape[i]-1 ); // decrements min\n\t\t}\n\t}\n\tout[ 0 ] = min;\n\tout[ 1 ] = max;\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default minmaxViewBufferIndex;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar TYPE = 'function';\n\n\n// MAIN //\n\n/**\n* Tests if an array-like object supports the accessor (get/set) protocol.\n*\n* @param {Object} value - value to test\n* @returns {boolean} boolean indicating whether a value is an accessor array\n*\n* @example\n* import Complex128Array from '@stdlib/array-complex128';\n*\n* var bool = isAccessorArray( new Complex128Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isAccessorArray( [] );\n* // returns false\n*/\nfunction isAccessorArray( value ) {\n\treturn ( typeof value.get === TYPE && typeof value.set === TYPE ); // eslint-disable-line valid-typeof\n}\n\n\n// EXPORTS //\n\nexport default isAccessorArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar GETTERS = {\n\t'complex128': getComplex128,\n\t'complex64': getComplex64,\n\t'default': getArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Returns an element from a `Complex128Array`.\n*\n* @private\n* @param {Complex128Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Complex128Array from '@stdlib/array-complex128';\n*\n* var arr = new Complex128Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getComplex128( arr, 1 );\n* // returns [ 3.0, 4.0 ]\n*/\nfunction getComplex128( arr, idx ) {\n\treturn arr.get( idx );\n}\n\n/**\n* Returns an element from a `Complex64Array`.\n*\n* @private\n* @param {Complex64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Complex64Array from '@stdlib/array-complex64';\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getComplex64( arr, 1 );\n* // returns [ 3.0, 4.0 ]\n*/\nfunction getComplex64( arr, idx ) {\n\treturn arr.get( idx );\n}\n\n/**\n* Returns an element from an array-like object supporting the get/set protocol.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {*} element value\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* function get( idx ) {\n* return arr[ idx ];\n* }\n*\n* function set( value, idx ) {\n* arr[ idx ] = value;\n* }\n*\n* arr.get = get;\n* arr.set = set;\n*\n* var v = getArrayLike( arr, 2 );\n* // returns 3\n*/\nfunction getArrayLike( arr, idx ) {\n\treturn arr.get( idx );\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for retrieving an element from an array-like object supporting the get/set protocol.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* import Complex64Array from '@stdlib/array-complex64';\n* import dtype from '@stdlib/array-dtype';\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* var get = getter( dtype( arr ) );\n* var v = get( arr, 1 );\n* // returns [ 3.0, 4.0 ]\n*/\nfunction getter( dtype ) {\n\tvar f = GETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn GETTERS.default;\n}\n\n\n// EXPORTS //\n\nexport default getter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar SETTERS = {\n\t'complex128': setComplex128,\n\t'complex64': setComplex64,\n\t'default': setArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Sets an element in a `Complex128Array`.\n*\n* @private\n* @param {Complex128Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n*\n* @example\n* import Complex128Array from '@stdlib/array-complex128';\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var arr = new Complex128Array( [ 1, 2, 3, 4 ] );\n*\n* setComplex128( arr, 1, new Complex128( 10.0, 11.0 ) );\n* var v = arr.get( 1 );\n* // returns [ 10.0, 11.0 ]\n*/\nfunction setComplex128( arr, idx, value ) {\n\tarr.set( value, idx );\n}\n\n/**\n* Sets an element in a `Complex64Array`.\n*\n* @private\n* @param {Complex64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n*\n* @example\n* import Complex64Array from '@stdlib/array-complex64';\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* setComplex64( arr, 1, new Complex64( 10.0, 11.0 ) );\n* var v = arr.get( 1 );\n* // returns [ 10.0, 11.0 ]\n*/\nfunction setComplex64( arr, idx, value ) {\n\tarr.set( value, idx );\n}\n\n/**\n* Sets an element in an array-like object supporting the get/set protocol.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* function get( idx ) {\n* return arr[ idx ];\n* }\n*\n* function set( value, idx ) {\n* arr[ idx ] = value;\n* }\n*\n* arr.get = get;\n* arr.set = set;\n*\n* setArrayLike( arr, 2, 10 );\n*\n* var v = arr[ 2 ];\n* // returns 10\n*/\nfunction setArrayLike( arr, idx, value ) {\n\tarr.set( value, idx );\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for setting an element in an array-like object supporting the get/set protocol.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* import Complex64Array from '@stdlib/array-complex64';\n* import Complex64 from '@stdlib/complex-float32-ctor';\n* import dtype from '@stdlib/array-dtype';\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* var set = setter( dtype( arr ) );\n* set( arr, 1, new Complex64( 10.0, 11.0 ) );\n*\n* var v = arr.get( 1 );\n* // returns [ 10.0, 11.0 ]\n*/\nfunction setter( dtype ) {\n\tvar f = SETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn SETTERS.default;\n}\n\n\n// EXPORTS //\n\nexport default setter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar GETTERS = {\n\t'float64': getFloat64,\n\t'float32': getFloat32,\n\t'int32': getInt32,\n\t'int16': getInt16,\n\t'int8': getInt8,\n\t'uint32': getUint32,\n\t'uint16': getUint16,\n\t'uint8': getUint8,\n\t'uint8c': getUint8c,\n\t'generic': getGeneric,\n\t'default': getArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Returns an element from a `Float64Array`.\n*\n* @private\n* @param {Float64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var arr = new Float64Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getFloat64( arr, 2 );\n* // returns 3.0\n*/\nfunction getFloat64( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Float32Array`.\n*\n* @private\n* @param {Float32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Float32Array from '@stdlib/array-float32';\n*\n* var arr = new Float32Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getFloat32( arr, 2 );\n* // returns 3.0\n*/\nfunction getFloat32( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an `Int32Array`.\n*\n* @private\n* @param {Int32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Int32Array from '@stdlib/array-int32';\n*\n* var arr = new Int32Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getInt32( arr, 2 );\n* // returns 3\n*/\nfunction getInt32( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an `Int16Array`.\n*\n* @private\n* @param {Int16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Int16Array from '@stdlib/array-int16';\n*\n* var arr = new Int16Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getInt16( arr, 2 );\n* // returns 3\n*/\nfunction getInt16( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an `Int8Array`.\n*\n* @private\n* @param {Int8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Int8Array from '@stdlib/array-int8';\n*\n* var arr = new Int8Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getInt8( arr, 2 );\n* // returns 3\n*/\nfunction getInt8( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint32Array`.\n*\n* @private\n* @param {Uint32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Uint32Array from '@stdlib/array-uint32';\n*\n* var arr = new Uint32Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint32( arr, 2 );\n* // returns 3\n*/\nfunction getUint32( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint16Array`.\n*\n* @private\n* @param {Uint16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Uint16Array from '@stdlib/array-uint16';\n*\n* var arr = new Uint16Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint16( arr, 2 );\n* // returns 3\n*/\nfunction getUint16( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint8Array`.\n*\n* @private\n* @param {Uint8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Uint8Array from '@stdlib/array-uint8';\n*\n* var arr = new Uint8Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint8( arr, 2 );\n* // returns 3\n*/\nfunction getUint8( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint8ClampedArray`.\n*\n* @private\n* @param {Uint8ClampedArray} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Uint8ClampedArray from '@stdlib/array-uint8c';\n*\n* var arr = new Uint8ClampedArray( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint8c( arr, 2 );\n* // returns 3\n*/\nfunction getUint8c( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a generic `Array`.\n*\n* @private\n* @param {Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {*} element value\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var v = getGeneric( arr, 2 );\n* // returns 3\n*/\nfunction getGeneric( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an indexed array-like object.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {*} element value\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var v = getArrayLike( arr, 2 );\n* // returns 3\n*/\nfunction getArrayLike( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for retrieving an element from an indexed array-like object.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* import dtype from '@stdlib/array-dtype';\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var get = getter( dtype( arr ) );\n* var v = get( arr, 2 );\n* // returns 3\n*/\nfunction getter( dtype ) {\n\tvar f = GETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn GETTERS.default;\n}\n\n\n// EXPORTS //\n\nexport default getter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar SETTERS = {\n\t'float64': setFloat64,\n\t'float32': setFloat32,\n\t'int32': setInt32,\n\t'int16': setInt16,\n\t'int8': setInt8,\n\t'uint32': setUint32,\n\t'uint16': setUint16,\n\t'uint8': setUint8,\n\t'uint8c': setUint8c,\n\t'generic': setGeneric,\n\t'default': setArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Sets an element in a `Float64Array`.\n*\n* @private\n* @param {Float64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var arr = new Float64Array( 4 );\n*\n* setFloat64( arr, 2, 3.0 );\n*\n* var v = arr[ 2 ];\n* // returns 3.0\n*/\nfunction setFloat64( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Float32Array`.\n*\n* @private\n* @param {Float32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Float32Array from '@stdlib/array-float32';\n*\n* var arr = new Float32Array( 4 );\n*\n* setFloat32( arr, 2, 3.0 );\n*\n* var v = arr[ 2 ];\n* // returns 3.0\n*/\nfunction setFloat32( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an `Int32Array`.\n*\n* @private\n* @param {Int32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Int32Array from '@stdlib/array-int32';\n*\n* var arr = new Int32Array( 4 );\n*\n* setInt32( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setInt32( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an `Int16Array`.\n*\n* @private\n* @param {Int16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Int16Array from '@stdlib/array-int16';\n*\n* var arr = new Int16Array( 4 );\n*\n* setInt16( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setInt16( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an `Int8Array`.\n*\n* @private\n* @param {Int8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Int8Array from '@stdlib/array-int8';\n*\n* var arr = new Int8Array( 4 );\n*\n* setInt8( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setInt8( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint32Array`.\n*\n* @private\n* @param {Uint32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Uint32Array from '@stdlib/array-uint32';\n*\n* var arr = new Uint32Array( 4 );\n*\n* setUint32( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint32( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint16Array`.\n*\n* @private\n* @param {Uint16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Uint16Array from '@stdlib/array-uint16';\n*\n* var arr = new Uint16Array( 4 );\n*\n* setUint16( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint16( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint8Array`.\n*\n* @private\n* @param {Uint8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Uint8Array from '@stdlib/array-uint8';\n*\n* var arr = new Uint8Array( 4 );\n*\n* setUint8( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint8( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint8ClampedArray`.\n*\n* @private\n* @param {Uint8ClampedArray} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Uint8ClampedArray from '@stdlib/array-uint8c';\n*\n* var arr = new Uint8ClampedArray( 4 );\n*\n* setUint8c( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint8c( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a generic `Array`.\n*\n* @private\n* @param {Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {*} value - value to set\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* setGeneric( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setGeneric( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an indexed array-like object.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {*} value - value to set\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* setArrayLike( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setArrayLike( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for setting an element in an indexed array-like object.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* import dtype from '@stdlib/array-dtype';\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var set = setter( dtype( arr ) );\n* set( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setter( dtype ) {\n\tvar f = SETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn SETTERS.default;\n}\n\n\n// EXPORTS //\n\nexport default setter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the number of elements in an array.\n*\n* @param {(NonNegativeIntegerArray|EmptyArray)} shape - array shape\n* @returns {NonNegativeInteger} number of elements\n*\n* @example\n* var n = numel( [ 3, 3, 3 ] );\n* // returns 27\n*/\nfunction numel( shape ) {\n\tvar ndims;\n\tvar n;\n\tvar i;\n\n\tndims = shape.length;\n\tif ( ndims === 0 ) {\n\t\treturn 0;\n\t}\n\tn = 1;\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tn *= shape[ i ];\n\t}\n\treturn n;\n}\n\n\n// EXPORTS //\n\nexport default numel;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Copies the elements of an indexed array-like object to a new \"generic\" array.\n*\n* @param {Collection} x - input array\n* @returns {Array} output array\n*\n* @example\n* var out = copy( [ 1, 2, 3 ] );\n* // returns [ 1, 2, 3 ]\n*/\nfunction copy( x ) {\n\tvar out;\n\tvar len;\n\tvar i;\n\n\tlen = x.length;\n\tout = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tout.push( x[ i ] ); // use `Array#push` to ensure \"fast\" elements\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default copy;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a string primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a string primitive\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns true\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns false\n*/\nfunction isString( value ) {\n\treturn ( typeof value === 'string' );\n}\n\n\n// EXPORTS //\n\nexport default isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasSymbols from '@stdlib/assert-has-symbol-support';\n\n\n// VARIABLES //\n\nvar FLG = hasSymbols();\n\n\n// MAIN //\n\n/**\n* Tests for native `Symbol.toStringTag` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Symbol.toStringTag` support\n*\n* @example\n* var bool = hasToStringTagSupport();\n* // returns \n*/\nfunction hasToStringTagSupport() {\n\treturn ( FLG && typeof Symbol.toStringTag === 'symbol' );\n}\n\n\n// EXPORTS //\n\nexport default hasToStringTagSupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests for native `Symbol` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Symbol` support\n*\n* @example\n* var bool = hasSymbolSupport();\n* // returns \n*/\nfunction hasSymbolSupport() {\n\treturn (\n\t\ttypeof Symbol === 'function' &&\n\t\ttypeof Symbol( 'foo' ) === 'symbol'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default hasSymbolSupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar toStr = Object.prototype.toString;\n\n\n// EXPORTS //\n\nexport default toStr;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// FUNCTIONS //\n\nvar has = Object.prototype.hasOwnProperty;\n\n\n// MAIN //\n\n/**\n* Tests if an object has a specified property.\n*\n* @param {*} value - value to test\n* @param {*} property - property to test\n* @returns {boolean} boolean indicating if an object has a specified property\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = hasOwnProp( beep, 'boop' );\n* // returns true\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = hasOwnProp( beep, 'bap' );\n* // returns false\n*/\nfunction hasOwnProp( value, property ) {\n\tif (\n\t\tvalue === void 0 ||\n\t\tvalue === null\n\t) {\n\t\treturn false;\n\t}\n\treturn has.call( value, property );\n}\n\n\n// EXPORTS //\n\nexport default hasOwnProp;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar Sym = ( typeof Symbol === 'function' ) ? Symbol : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default Sym;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Symbol from '@stdlib/symbol-ctor';\n\n\n// MAIN //\n\nvar toStrTag = ( typeof Symbol === 'function' ) ? Symbol.toStringTag : '';\n\n\n// EXPORTS //\n\nexport default toStrTag;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a string value indicating a specification defined classification of an object.\n*\n* @module @stdlib/utils-native-class\n*\n* @example\n* import nativeClass from '@stdlib/utils-native-class';\n*\n* var str = nativeClass( 'a' );\n* // returns '[object String]'\n*\n* str = nativeClass( 5 );\n* // returns '[object Number]'\n*\n* function Beep() {\n* return this;\n* }\n* str = nativeClass( new Beep() );\n* // returns '[object Object]'\n*/\n\n// MODULES //\n\nimport hasToStringTag from '@stdlib/assert-has-tostringtag-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar main;\nif ( hasToStringTag() ) {\n\tmain = polyfill;\n} else {\n\tmain = builtin;\n}\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport toStringTag from './tostringtag.js';\nimport toStr from './tostring.js';\n\n\n// MAIN //\n\n/**\n* Returns a string value indicating a specification defined classification of an object in environments supporting `Symbol.toStringTag`.\n*\n* @param {*} v - input value\n* @returns {string} string value indicating a specification defined classification of the input value\n*\n* @example\n* var str = nativeClass( 'a' );\n* // returns '[object String]'\n*\n* @example\n* var str = nativeClass( 5 );\n* // returns '[object Number]'\n*\n* @example\n* function Beep() {\n* return this;\n* }\n* var str = nativeClass( new Beep() );\n* // returns '[object Object]'\n*/\nfunction nativeClass( v ) {\n\tvar isOwn;\n\tvar tag;\n\tvar out;\n\n\tif ( v === null || v === void 0 ) {\n\t\treturn toStr.call( v );\n\t}\n\ttag = v[ toStringTag ];\n\tisOwn = hasOwnProp( v, toStringTag );\n\n\t// Attempt to override the `toStringTag` property. For built-ins having a `Symbol.toStringTag` property (e.g., `JSON`, `Math`, etc), the `Symbol.toStringTag` property is read-only (e.g., , so we need to wrap in a `try/catch`.\n\ttry {\n\t\tv[ toStringTag ] = void 0;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn toStr.call( v );\n\t}\n\tout = toStr.call( v );\n\n\tif ( isOwn ) {\n\t\tv[ toStringTag ] = tag;\n\t} else {\n\t\tdelete v[ toStringTag ];\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default nativeClass;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport toStr from './tostring.js';\n\n\n// MAIN //\n\n/**\n* Returns a string value indicating a specification defined classification (via the internal property `[[Class]]`) of an object.\n*\n* @param {*} v - input value\n* @returns {string} string value indicating a specification defined classification of the input value\n*\n* @example\n* var str = nativeClass( 'a' );\n* // returns '[object String]'\n*\n* @example\n* var str = nativeClass( 5 );\n* // returns '[object Number]'\n*\n* @example\n* function Beep() {\n* return this;\n* }\n* var str = nativeClass( new Beep() );\n* // returns '[object Object]'\n*/\nfunction nativeClass( v ) {\n\treturn toStr.call( v );\n}\n\n\n// EXPORTS //\n\nexport default nativeClass;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// eslint-disable-next-line stdlib/no-redeclare\nvar valueOf = String.prototype.valueOf; // non-generic\n\n\n// EXPORTS //\n\nexport default valueOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasToStringTag from '@stdlib/assert-has-tostringtag-support';\nimport nativeClass from '@stdlib/utils-native-class';\nimport test from './try2valueof.js';\n\n\n// VARIABLES //\n\nvar FLG = hasToStringTag();\n\n\n// MAIN //\n\n/**\n* Tests if a value is a string object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a string object\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns false\n*/\nfunction isString( value ) {\n\tif ( typeof value === 'object' ) {\n\t\tif ( value instanceof String ) {\n\t\t\treturn true;\n\t\t}\n\t\tif ( FLG ) {\n\t\t\treturn test( value );\n\t\t}\n\t\treturn ( nativeClass( value ) === '[object String]' );\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport valueOf from './valueof.js'; // eslint-disable-line stdlib/no-redeclare\n\n\n// MAIN //\n\n/**\n* Attempts to extract a string value.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a string can be extracted\n*/\nfunction test( value ) {\n\ttry {\n\t\tvalueOf.call( value );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default test;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a string.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a string\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns true\n*/\nfunction isString( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests whether an input value is the string representing column-major order.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean result\n*\n* @example\n* var bool = isColumnMajorString( 'column-major' );\n* // returns true\n*\n* bool = isColumnMajorString( 'row-major' );\n* // returns false\n*\n* bool = isColumnMajorString( 'foo' );\n* // returns false\n*/\nfunction isColumnMajorString( v ) {\n\treturn ( v === 'column-major' );\n}\n\n\n// EXPORTS //\n\nexport default isColumnMajorString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isColumnMajor from '@stdlib/ndarray-base-assert-is-column-major-string';\n\n\n// FUNCTIONS //\n\n/**\n* Generates a stride array from an array shape (row-major).\n*\n* @private\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} array strides\n*/\nfunction rowmajor( shape ) {\n\tvar ndims;\n\tvar out;\n\tvar s;\n\tvar i;\n\n\tndims = shape.length;\n\tout = [];\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tout.push( 0 );\n\t}\n\ts = 1;\n\tfor ( i = ndims-1; i >= 0; i-- ) {\n\t\tout[ i ] = s;\n\t\ts *= shape[ i ];\n\t}\n\treturn out;\n}\n\n/**\n* Generates a stride array from an array shape (column-major).\n*\n* @private\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} array strides\n*/\nfunction columnmajor( shape ) {\n\tvar out;\n\tvar s;\n\tvar i;\n\n\tout = [];\n\ts = 1;\n\tfor ( i = 0; i < shape.length; i++ ) {\n\t\tout.push( s );\n\t\ts *= shape[ i ];\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Generates a stride array from an array shape.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {string} order - specifies whether an array is row-major (C-style) or column-major (Fortran-style)\n* @returns {Array} array strides\n*\n* @example\n* var s = shape2strides( [ 3, 2 ], 'row-major' );\n* // returns [ 2, 1 ]\n*\n* s = shape2strides( [ 3, 2 ], 'column-major' );\n* // returns [ 1, 3 ]\n*/\nfunction shape2strides( shape, order ) {\n\tif ( isColumnMajor( order ) ) {\n\t\treturn columnmajor( shape );\n\t}\n\treturn rowmajor( shape );\n}\n\n\n// EXPORTS //\n\nexport default shape2strides;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a string.\n*\n* @module @stdlib/assert-is-string\n*\n* @example\n* import isString from '@stdlib/assert-is-string';\n*\n* var bool = isString( 'beep' );\n* // returns true\n*\n* bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* bool = isString( 5 );\n* // returns false\n*\n* @example\n* import { isObject as isString } from '@stdlib/assert-is-string';\n*\n* var bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* bool = isString( 'beep' );\n* // returns false\n*\n* @example\n* import { isPrimitive as isString } from '@stdlib/assert-is-string';\n*\n* var bool = isString( 'beep' );\n* // returns true\n*\n* bool = isString( new String( 'beep' ) );\n* // returns false\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate a stride array from an array shape.\n*\n* @module @stdlib/ndarray-base-shape2strides\n*\n* @example\n* import shape2strides from '@stdlib/ndarray-base-shape2strides';\n*\n* var strides = shape2strides( [ 3, 2 ], 'row-major' );\n* // returns [ 2, 1 ]\n*\n* strides = shape2strides( [ 3, 2 ], 'column-major' );\n* // returns [ 1, 3 ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport assign from './assign.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isColumnMajor from '@stdlib/ndarray-base-assert-is-column-major-string';\n\n\n// FUNCTIONS //\n\n/**\n* Generates a stride array from an array shape (row-major).\n*\n* @private\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {(Array|TypedArray|Object)} out - output object\n* @returns {(Array|TypedArray|Object)} array strides\n*/\nfunction rowmajor( shape, out ) {\n\tvar ndims;\n\tvar s;\n\tvar i;\n\n\tndims = shape.length;\n\ts = 1;\n\tfor ( i = ndims-1; i >= 0; i-- ) {\n\t\tout[ i ] = s;\n\t\ts *= shape[ i ];\n\t}\n\treturn out;\n}\n\n/**\n* Generates a stride array from an array shape (column-major).\n*\n* @private\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {(Array|TypedArray|Object)} out - output object\n* @returns {(Array|TypedArray|Object)} array strides\n*/\nfunction columnmajor( shape, out ) {\n\tvar s;\n\tvar i;\n\n\ts = 1;\n\tfor ( i = 0; i < shape.length; i++ ) {\n\t\tout[ i ] = s;\n\t\ts *= shape[ i ];\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Generates a stride array from an array shape.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {string} order - specifies whether an array is row-major (C-style) or column-major (Fortran-style)\n* @param {(Array|TypedArray|Object)} out - output object\n* @returns {(Array|TypedArray|Object)} array strides\n*\n* @example\n* var strides = [ 0, 0 ];\n*\n* var out = shape2strides( [ 3, 2 ], 'row-major', strides );\n* // returns [ 2, 1 ]\n*\n* var bool = ( out === strides );\n* // returns true\n*\n* out = shape2strides( [ 3, 2 ], 'column-major', strides );\n* // returns [ 1, 3 ]\n*/\nfunction shape2strides( shape, order, out ) {\n\tif ( isColumnMajor( order ) ) {\n\t\treturn columnmajor( shape, out );\n\t}\n\treturn rowmajor( shape, out );\n}\n\n\n// EXPORTS //\n\nexport default shape2strides;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport shape2strides from '@stdlib/ndarray-base-shape2strides';\nimport copyIndexed from '@stdlib/array-base-copy-indexed';\n\n\n// VARIABLES //\n\nvar ROW_MAJOR = 'row-major';\n\n\n// MAIN //\n\n/**\n* Returns the strides of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @param {boolean} copy - boolean indicating whether to explicitly copy the value assigned to the input ndarray's `strides` property\n* @returns {IntegerArray} strides\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var out = strides( zeros( [ 3, 3, 3 ] ), false );\n* // returns [ 9, 3, 1 ]\n*/\nfunction strides( x, copy ) {\n\tvar ord;\n\tvar sh;\n\tvar st;\n\n\tst = x.strides;\n\tif ( typeof st !== 'object' || st === null ) {\n\t\tsh = x.shape;\n\t\tif ( sh.length === 0 ) {\n\t\t\treturn [ 0 ];\n\t\t}\n\t\tord = x.order;\n\t\tif ( !isString( ord ) ) {\n\t\t\tord = ROW_MAJOR;\n\t\t}\n\t\treturn shape2strides( sh, ord );\n\t}\n\tif ( copy ) {\n\t\treturn copyIndexed( st );\n\t}\n\treturn st;\n}\n\n\n// EXPORTS //\n\nexport default strides;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a number primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive\n*\n* @example\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* @example\n* var bool = isNumber( NaN );\n* // returns true\n*\n* @example\n* var bool = isNumber( new Number( 3.14 ) );\n* // returns false\n*/\nfunction isNumber( value ) {\n\treturn ( typeof value === 'number' );\n}\n\n\n// EXPORTS //\n\nexport default isNumber;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// EXPORTS //\n\nexport default Number; // eslint-disable-line stdlib/require-globals\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Number from '@stdlib/number-ctor';\n\n\n// MAIN //\n\n// eslint-disable-next-line stdlib/no-redeclare\nvar toString = Number.prototype.toString; // non-generic\n\n\n// EXPORTS //\n\nexport default toString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasToStringTag from '@stdlib/assert-has-tostringtag-support';\nimport nativeClass from '@stdlib/utils-native-class';\nimport Number from '@stdlib/number-ctor';\nimport test from './try2serialize.js';\n\n\n// VARIABLES //\n\nvar FLG = hasToStringTag();\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object\n*\n* @example\n* var bool = isNumber( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*/\nfunction isNumber( value ) {\n\tif ( typeof value === 'object' ) {\n\t\tif ( value instanceof Number ) {\n\t\t\treturn true;\n\t\t}\n\t\tif ( FLG ) {\n\t\t\treturn test( value );\n\t\t}\n\t\treturn ( nativeClass( value ) === '[object Number]' );\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isNumber;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport toString from './tostring.js'; // eslint-disable-line stdlib/no-redeclare\n\n\n// MAIN //\n\n/**\n* Attempts to serialize a value to a string.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value can be serialized\n*/\nfunction test( value ) {\n\ttry {\n\t\ttoString.call( value );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default test;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a number\n*\n* @example\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* @example\n* var bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*\n* @example\n* var bool = isNumber( NaN );\n* // returns true\n*\n* @example\n* var bool = isNumber( null );\n* // returns false\n*/\nfunction isNumber( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isNumber;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport strides2offset from '@stdlib/ndarray-base-strides2offset';\n\n\n// MAIN //\n\n/**\n* Returns the index offset specifying the underlying buffer index of the first iterated ndarray element.\n*\n* @param {ndarrayLike} x - input ndarray\n* @returns {NonNegativeInteger} index offset\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var n = offset( zeros( [ 3, 3, 3 ] ) );\n* // returns 0\n*/\nfunction offset( x ) {\n\tvar st;\n\tvar sh;\n\tvar o;\n\n\to = x.offset;\n\tif ( isNumber( o ) ) {\n\t\treturn o;\n\t}\n\tsh = x.shape;\n\tif ( sh.length === 0 ) {\n\t\treturn 0;\n\t}\n\tst = x.strides;\n\tif ( typeof st !== 'object' || st === null ) {\n\t\treturn 0;\n\t}\n\treturn strides2offset( sh, st );\n}\n\n\n// EXPORTS //\n\nexport default offset;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the index offset which specifies the location of the first indexed value in a multidimensional array based on a stride array.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @returns {NonNegativeInteger} offset - offset\n*\n* @example\n* var shape = [ 2, 3, 10 ];\n* var strides = [ 30, -10, 1 ];\n*\n* var offset = strides2offset( shape, strides );\n* // returns 20\n*/\nfunction strides2offset( shape, strides ) {\n\tvar offset;\n\tvar ndims;\n\tvar i;\n\n\tndims = shape.length;\n\toffset = 0;\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tif ( strides[ i ] < 0 ) {\n\t\t\t// Note that, since the stride is negative, this operation increments, not decrements, the offset...\n\t\t\toffset -= strides[ i ] * ( shape[ i ]-1 );\n\t\t}\n\t}\n\treturn offset;\n}\n\n\n// EXPORTS //\n\nexport default strides2offset;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Computes the absolute value of a double-precision floating-point number `x`.\n*\n* @param {number} x - input value\n* @returns {number} absolute value\n*\n* @example\n* var v = abs( -1.0 );\n* // returns 1.0\n*\n* @example\n* var v = abs( 2.0 );\n* // returns 2.0\n*\n* @example\n* var v = abs( 0.0 );\n* // returns 0.0\n*\n* @example\n* var v = abs( -0.0 );\n* // returns 0.0\n*\n* @example\n* var v = abs( NaN );\n* // returns NaN\n*/\nfunction abs( x ) {\n\treturn Math.abs( x ); // eslint-disable-line stdlib/no-builtin-math\n}\n\n\n// EXPORTS //\n\nexport default abs;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport abs from '@stdlib/math-base-special-abs';\n\n\n// MAIN //\n\n/**\n* Determines the order of a multidimensional array based on a provided stride array.\n*\n* @param {IntegerArray} strides - stride array\n* @returns {integer} order\n*\n* @example\n* var order = strides2order( [ 2, 1 ] );\n* // returns 1\n*\n* order = strides2order( [ 1, 2 ] );\n* // returns 2\n*\n* order = strides2order( [ 1, 1, 1 ] );\n* // returns 3\n*\n* order = strides2order( [ 2, 3, 1 ] );\n* // returns 0\n*/\nfunction strides2order( strides ) {\n\tvar column;\n\tvar ndims;\n\tvar row;\n\tvar s1;\n\tvar s2;\n\tvar i;\n\n\tndims = strides.length;\n\tif ( ndims === 0 ) {\n\t\treturn 0|0; // 'none'\n\t}\n\tcolumn = true;\n\trow = true;\n\n\ts1 = abs( strides[ 0 ] );\n\tfor ( i = 1; i < ndims; i++ ) {\n\t\ts2 = abs( strides[ i ] );\n\t\tif ( column && s2 < s1 ) {\n\t\t\tcolumn = false;\n\t\t} else if ( row && s2 > s1 ) {\n\t\t\trow = false;\n\t\t}\n\t\tif ( row || column ) {\n\t\t\ts1 = s2;\n\t\t} else {\n\t\t\treturn 0|0; // 'none'\n\t\t}\n\t}\n\tif ( row && column ) {\n\t\treturn 3|0; // 'both'\n\t}\n\tif ( row ) {\n\t\treturn 1|0; // 'row-major'\n\t}\n\treturn 2|0; // 'column-major'\n}\n\n\n// EXPORTS //\n\nexport default strides2order;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a number.\n*\n* @module @stdlib/assert-is-number\n*\n* @example\n* import isNumber from '@stdlib/assert-is-number';\n*\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*\n* bool = isNumber( NaN );\n* // returns true\n*\n* bool = isNumber( null );\n* // returns false\n*\n* @example\n* import { isPrimitive as isNumber } from '@stdlib/assert-is-number';\n*\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* bool = isNumber( NaN );\n* // returns true\n*\n* bool = isNumber( new Number( 3.14 ) );\n* // returns false\n*\n* @example\n* import { isObject as isNumber } from '@stdlib/assert-is-number';\n*\n* var bool = isNumber( 3.14 );\n* // returns false\n*\n* bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// VARIABLES //\n\nvar ROW_MAJOR = 'row-major';\nvar COLUMN_MAJOR = 'column-major';\n\n\n// MAIN //\n\n/**\n* Returns the layout order of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @returns {(string|null)} layout order\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var x = zeros( [ 3, 3, 3 ], {\n* 'order': 'row-major'\n* });\n*\n* var out = order( x );\n* // returns 'row-major'\n*/\nfunction order( x ) {\n\tvar st;\n\tvar o;\n\n\to = x.order;\n\tif ( isString( o ) ) {\n\t\treturn o;\n\t}\n\t// Try to infer the layout order from the strides array...\n\tst = x.strides;\n\tif ( typeof st !== 'object' || st === null ) {\n\t\treturn ROW_MAJOR; // WARNING: default to row-major for ndarray-like objects lacking strides. This may or may not be accurate, and we're defaulting to row-major here based on the belief that row-major is more likely given that, e.g., JavaScript arrays are similar to C arrays (i.e., stored in row-major order).\n\t}\n\to = strides2order( st );\n\tif ( o === 1 || o === 3 ) {\n\t\treturn ROW_MAJOR; // for o == 3 (both row- and column-major; e.g., one-dimensional ndarrays), default to row-major\n\t}\n\tif ( o === 2 ) {\n\t\treturn COLUMN_MAJOR;\n\t}\n\t// o === 0\n\tif ( x.shape.length === 0 ) {\n\t\treturn ROW_MAJOR; // default to row-major for zero-dimensional ndarrays\n\t}\n\t// Case: mixed strides (e.g., [ 2, 3, 1 ] )\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default order;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isAccessorArray from '@stdlib/array-base-assert-is-accessor-array';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport accessorSetter from '@stdlib/array-base-accessor-setter';\nimport getter from '@stdlib/array-base-getter';\nimport setter from '@stdlib/array-base-setter';\nimport numel from '@stdlib/ndarray-base-numel';\nimport getDType from '@stdlib/ndarray-base-dtype';\nimport getShape from '@stdlib/ndarray-base-shape';\nimport getStrides from '@stdlib/ndarray-base-strides';\nimport getOffset from '@stdlib/ndarray-base-offset';\nimport getOrder from '@stdlib/ndarray-base-order';\nimport getData from '@stdlib/ndarray-base-data-buffer';\n\n\n// MAIN //\n\n/**\n* Converts an ndarray-like object to an object likely to have the same \"shape\".\n*\n* ## Notes\n*\n* - This function is intended as a potential performance optimization. In V8, for example, even if two objects share common properties, if those properties were added in different orders or if one object has additional properties not shared by the other object, then those objects will have different \"hidden\" classes. If a function is provided many objects having different \"shapes\", some JavaScript VMs (e.g., V8) will consider the function \"megamorphic\" and fail to perform various runtime optimizations. Accordingly, the intent of this function is to standardize the \"shape\" of the object holding ndarray meta data to ensure that internal functions operating on ndarrays are provided consistent argument \"shapes\".\n*\n* - The returned object has the following properties:\n*\n* - **ref**: reference to the original ndarray-like object.\n* - **dtype**: underlying data type.\n* - **data**: data buffer.\n* - **length**: number of elements.\n* - **shape**: array dimensions.\n* - **strides**: array strides.\n* - **offset**: index offset.\n* - **order**: order.\n* - **accessorProtocol**: `boolean` indicating whether the data buffer supports the get/set protocol (i.e., uses accessors for getting and setting elements).\n* - **accessors**: a two-element array whose first element is an accessor for retrieving an ndarray element and whose second element is an accessor for setting an ndarray element.\n*\n* @param {ndarrayLike} x - ndarray-like object\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @returns {Object} object containing ndarray meta data\n*\n* @example\n* import array from '@stdlib/ndarray-array';\n*\n* var x = array( [ [ 1, 2, 3 ], [ 4, 5, 6 ] ] );\n*\n* var obj = ndarraylike2object( x );\n* // returns {...}\n*/\nfunction ndarraylike2object( x ) {\n\tvar xbuf;\n\tvar bool;\n\tvar sh;\n\tvar dt;\n\n\txbuf = getData( x );\n\tsh = getShape( x, true );\n\tdt = getDType( x );\n\n\tbool = isAccessorArray( xbuf );\n\n\treturn {\n\t\t'ref': x,\n\t\t'dtype': dt,\n\t\t'data': xbuf,\n\t\t'length': numel( sh ),\n\t\t'shape': sh,\n\t\t'strides': getStrides( x, true ),\n\t\t'offset': getOffset( x ),\n\t\t'order': getOrder( x ),\n\t\t'accessorProtocol': bool,\n\t\t'accessors': ( bool ) ?\n\t\t\t[ accessorGetter( dt ), accessorSetter( dt ) ] :\n\t\t\t[ getter( dt ), setter( dt ) ]\n\t};\n}\n\n\n// EXPORTS //\n\nexport default ndarraylike2object;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the underlying data buffer of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @returns {Collection} underlying data buffer\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var x = zeros( [ 3, 3, 3 ], {\n* 'dtype': 'float64'\n* });\n*\n* var out = data( x );\n* // returns \n*/\nfunction data( x ) {\n\treturn x.data;\n}\n\n\n// EXPORTS //\n\nexport default data;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport copyIndexed from '@stdlib/array-base-copy-indexed';\n\n\n// MAIN //\n\n/**\n* Returns the shape of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @param {boolean} copy - boolean indicating whether to explicitly copy the value assigned to the input ndarray's `shape` property\n* @returns {NonNegativeIntegerArray} shape\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var out = shape( zeros( [ 3, 3, 3 ] ), false );\n* // returns [ 3, 3, 3 ]\n*/\nfunction shape( x, copy ) {\n\tvar sh = x.shape;\n\tif ( copy ) {\n\t\treturn copyIndexed( sh );\n\t}\n\treturn sh;\n}\n\n\n// EXPORTS //\n\nexport default shape;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the data type of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @returns {string} data type\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var x = zeros( [ 3, 3, 3 ], {\n* 'dtype': 'float64'\n* });\n*\n* var dt = dtype( x );\n* // returns 'float64'\n*/\nfunction dtype( x ) {\n\treturn x.dtype;\n}\n\n\n// EXPORTS //\n\nexport default dtype;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar f;\n\n\n// FUNCTIONS //\n\n/**\n* Tests if a value is an array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an array\n*\n* @example\n* var bool = isArray( [] );\n* // returns true\n*\n* @example\n* var bool = isArray( {} );\n* // returns false\n*/\nfunction isArray( value ) {\n\treturn ( nativeClass( value ) === '[object Array]' );\n}\n\n\n// MAIN //\n\nif ( Array.isArray ) {\n\tf = Array.isArray;\n} else {\n\tf = isArray;\n}\n\n\n// EXPORTS //\n\nexport default f;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArray from '@stdlib/assert-is-array';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns a function which tests if every element in an array passes a test condition.\n*\n* @param {Function} predicate - function to apply\n* @throws {TypeError} must provide a function\n* @returns {Function} an array function\n*\n* @example\n* import isOdd from '@stdlib/assert-is-odd';\n*\n* var arr1 = [ 1, 3, 5, 7 ];\n* var arr2 = [ 3, 5, 8 ];\n*\n* var validate = arrayfcn( isOdd );\n*\n* var bool = validate( arr1 );\n* // returns true\n*\n* bool = validate( arr2 );\n* // returns false\n*/\nfunction arrayfcn( predicate ) {\n\tif ( typeof predicate !== 'function' ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a function. Value: `%s`.', predicate ) );\n\t}\n\treturn every;\n\n\t/**\n\t* Tests if every element in an array passes a test condition.\n\t*\n\t* @private\n\t* @param {*} value - value to test\n\t* @returns {boolean} boolean indicating whether a value is an array for which all elements pass a test condition\n\t*/\n\tfunction every( value ) {\n\t\tvar len;\n\t\tvar i;\n\t\tif ( !isArray( value ) ) {\n\t\t\treturn false;\n\t\t}\n\t\tlen = value.length;\n\t\tif ( len === 0 ) {\n\t\t\treturn false;\n\t\t}\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tif ( predicate( value[ i ] ) === false ) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default arrayfcn;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is object-like.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is object-like\n*\n* @example\n* var bool = isObjectLike( {} );\n* // returns true\n*\n* @example\n* var bool = isObjectLike( [] );\n* // returns true\n*\n* @example\n* var bool = isObjectLike( null );\n* // returns false\n*/\nfunction isObjectLike( value ) {\n\treturn (\n\t\tvalue !== null &&\n\t\ttypeof value === 'object'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isObjectLike;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isObjectLike from '@stdlib/assert-is-object-like';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Buffer instance.\n*\n* @param {*} value - value to validate\n* @returns {boolean} boolean indicating if a value is a Buffer instance\n*\n* @example\n* var v = isBuffer( new Buffer( 'beep' ) );\n* // returns true\n*\n* @example\n* var v = isBuffer( new Buffer( [1,2,3,4] ) );\n* // returns true\n*\n* @example\n* var v = isBuffer( {} );\n* // returns false\n*\n* @example\n* var v = isBuffer( [] );\n* // returns false\n*/\nfunction isBuffer( value ) {\n\treturn (\n\t\tisObjectLike( value ) &&\n\t\t(\n\t\t\t// eslint-disable-next-line no-underscore-dangle\n\t\t\tvalue._isBuffer || // for envs missing Object.prototype.constructor (e.g., Safari 5-7)\n\t\t\t(\n\t\t\t\tvalue.constructor &&\n\n\t\t\t\t// WARNING: `typeof` is not a foolproof check, as certain envs consider RegExp and NodeList instances to be functions\n\t\t\t\ttypeof value.constructor.isBuffer === 'function' &&\n\t\t\t\tvalue.constructor.isBuffer( value )\n\t\t\t)\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isBuffer;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns a regular expression to capture everything that is not a space immediately after the `function` keyword and before the first left parenthesis.\n*\n* @returns {RegExp} regular expression\n*\n* @example\n* var RE_FUNCTION_NAME = reFunctionName();\n*\n* function fname( fcn ) {\n* return RE_FUNCTION_NAME.exec( fcn.toString() )[ 1 ];\n* }\n*\n* var fn = fname( Math.sqrt );\n* // returns 'sqrt'\n*\n* fn = fname( Int8Array );\n* // returns 'Int8Array'\n*\n* fn = fname( Object.prototype.toString );\n* // returns 'toString'\n*\n* fn = fname( function(){} );\n* // returns ''\n*/\nfunction reFunctionName() {\n\treturn /^\\s*function\\s*([^(]*)/i;\n}\n\n\n// EXPORTS //\n\nexport default reFunctionName;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is object-like.\n*\n* @module @stdlib/assert-is-object-like\n*\n* @example\n* import isObjectLike from '@stdlib/assert-is-object-like';\n*\n* var bool = isObjectLike( {} );\n* // returns true\n*\n* bool = isObjectLike( [] );\n* // returns true\n*\n* bool = isObjectLike( null );\n* // returns false\n*\n* @example\n* import { isObjectLikeArray as isObjectLike } from '@stdlib/assert-is-object-like';\n*\n* var bool = isObjectLike( [ {}, [] ] );\n* // returns true\n*\n* bool = isObjectLike( [ {}, '3.0' ] );\n* // returns false\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport arrayfun from '@stdlib/assert-tools-array-function';\nimport main from './main.js';\n\n\n// VARIABLES //\n\nvar isObjectLikeArray = arrayfun( main );\n\n\n// MAIN //\n\nsetReadOnly( main, 'isObjectLikeArray', isObjectLikeArray );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport reFunctionName from './main.js';\n\n\n// MAIN //\n\n/**\n* Captures everything that is not a space immediately after the `function` keyword and before the first left parenthesis.\n*\n* Regular expression: `/^\\s*function\\s*([^(]*)/i`\n*\n* - `/^\\s*`\n* - Match zero or more spaces at beginning\n*\n* - `function`\n* - Match the word `function`\n*\n* - `\\s*`\n* - Match zero or more spaces after the word `function`\n*\n* - `()`\n* - Capture\n*\n* - `[^(]*`\n* - Match anything except a left parenthesis `(` zero or more times\n*\n* - `/i`\n* - ignore case\n*\n* @constant\n* @type {RegExp}\n* @default /^\\s*function\\s*([^(]*)/i\n*/\nvar RE_FUNCTION_NAME = reFunctionName();\n\n\n// EXPORTS //\n\nexport default RE_FUNCTION_NAME;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\nimport { REGEXP as RE } from '@stdlib/regexp-function-name';\nimport isBuffer from '@stdlib/assert-is-buffer';\n\n\n// MAIN //\n\n/**\n* Determines the name of a value's constructor.\n*\n* @param {*} v - input value\n* @returns {string} name of a value's constructor\n*\n* @example\n* var v = constructorName( 'a' );\n* // returns 'String'\n*\n* @example\n* var v = constructorName( 5 );\n* // returns 'Number'\n*\n* @example\n* var v = constructorName( null );\n* // returns 'Null'\n*\n* @example\n* var v = constructorName( undefined );\n* // returns 'Undefined'\n*\n* @example\n* var v = constructorName( function noop() {} );\n* // returns 'Function'\n*/\nfunction constructorName( v ) {\n\tvar match;\n\tvar name;\n\tvar ctor;\n\tname = nativeClass( v ).slice( 8, -1 );\n\tif ( (name === 'Object' || name === 'Error') && v.constructor ) {\n\t\tctor = v.constructor;\n\t\tif ( typeof ctor.name === 'string' ) {\n\t\t\treturn ctor.name;\n\t\t}\n\t\tmatch = RE.exec( ctor.toString() );\n\t\tif ( match ) {\n\t\t\treturn match[ 1 ];\n\t\t}\n\t}\n\tif ( isBuffer( v ) ) {\n\t\treturn 'Buffer';\n\t}\n\treturn name;\n}\n\n\n// EXPORTS //\n\nexport default constructorName;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Regular expression to capture everything that is not a space immediately after the `function` keyword and before the first left parenthesis.\n*\n* @module @stdlib/regexp-function-name\n*\n* @example\n* import reFunctionName from '@stdlib/regexp-function-name';\n* var RE_FUNCTION_NAME = reFunctionName();\n*\n* function fname( fcn ) {\n* return RE_FUNCTION_NAME.exec( fcn.toString() )[ 1 ];\n* }\n*\n* var fn = fname( Math.sqrt );\n* // returns 'sqrt'\n*\n* fn = fname( Int8Array );\n* // returns 'Int8Array'\n*\n* fn = fname( Object.prototype.toString );\n* // returns 'toString'\n*\n* fn = fname( function(){} );\n* // returns ''\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport REGEXP from './regexp.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'REGEXP', REGEXP );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n// Mapping from array constructors to data types...\nvar ctor2dtypes = {\n\t'Float32Array': 'float32',\n\t'Float64Array': 'float64',\n\t'Array': 'generic',\n\t'Int16Array': 'int16',\n\t'Int32Array': 'int32',\n\t'Int8Array': 'int8',\n\t'Uint16Array': 'uint16',\n\t'Uint32Array': 'uint32',\n\t'Uint8Array': 'uint8',\n\t'Uint8ClampedArray': 'uint8c',\n\t'Complex64Array': 'complex64',\n\t'Complex128Array': 'complex128',\n\t'BooleanArray': 'bool'\n};\n\n\n// EXPORTS //\n\nexport default ctor2dtypes;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of double-precision floating-point numbers in the platform byte order.\n*\n* @module @stdlib/array-float64\n*\n* @example\n* import ctor from '@stdlib/array-float64';\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasFloat64ArraySupport from '@stdlib/assert-has-float64array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasFloat64ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasFloat64Array = ( typeof Float64Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Float64Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Float64Array\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var bool = isFloat64Array( new Float64Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isFloat64Array( [] );\n* // returns false\n*/\nfunction isFloat64Array( value ) {\n\treturn (\n\t\t( hasFloat64Array && value instanceof Float64Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Float64Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isFloat64Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Float64Array === 'function' ) ? Float64Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Float64Array === 'function' ) ? Float64Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isFloat64Array from '@stdlib/assert-is-float64array';\nimport GlobalFloat64Array from './float64array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Float64Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Float64Array` support\n*\n* @example\n* var bool = hasFloat64ArraySupport();\n* // returns \n*/\nfunction hasFloat64ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalFloat64Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalFloat64Array( [ 1.0, 3.14, -3.14, NaN ] );\n\t\tbool = (\n\t\t\tisFloat64Array( arr ) &&\n\t\t\tarr[ 0 ] === 1.0 &&\n\t\t\tarr[ 1 ] === 3.14 &&\n\t\t\tarr[ 2 ] === -3.14 &&\n\t\t\tarr[ 3 ] !== arr[ 3 ]\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasFloat64ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of double-precision floating-point numbers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of single-precision floating-point numbers in the platform byte order.\n*\n* @module @stdlib/array-float32\n*\n* @example\n* import ctor from '@stdlib/array-float32';\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasFloat32ArraySupport from '@stdlib/assert-has-float32array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasFloat32ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasFloat32Array = ( typeof Float32Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Float32Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Float32Array\n*\n* @example\n* import Float32Array from '@stdlib/array-float32';\n*\n* var bool = isFloat32Array( new Float32Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isFloat32Array( [] );\n* // returns false\n*/\nfunction isFloat32Array( value ) {\n\treturn (\n\t\t( hasFloat32Array && value instanceof Float32Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Float32Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isFloat32Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Double-precision floating-point positive infinity.\n*\n* @module @stdlib/constants-float64-pinf\n* @type {number}\n*\n* @example\n* import FLOAT64_PINF from '@stdlib/constants-float64-pinf';\n* // returns Infinity\n*/\n\n\n// MAIN //\n\n/**\n* Double-precision floating-point positive infinity.\n*\n* ## Notes\n*\n* Double-precision floating-point positive infinity has the bit sequence\n*\n* ```binarystring\n* 0 11111111111 00000000000000000000 00000000000000000000000000000000\n* ```\n*\n* @constant\n* @type {number}\n* @default Number.POSITIVE_INFINITY\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_PINF = Number.POSITIVE_INFINITY; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default FLOAT64_PINF;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Float32Array === 'function' ) ? Float32Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Float32Array === 'function' ) ? Float32Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isFloat32Array from '@stdlib/assert-is-float32array';\nimport PINF from '@stdlib/constants-float64-pinf';\nimport GlobalFloat32Array from './float32array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Float32Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Float32Array` support\n*\n* @example\n* var bool = hasFloat32ArraySupport();\n* // returns \n*/\nfunction hasFloat32ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalFloat32Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalFloat32Array( [ 1.0, 3.14, -3.14, 5.0e40 ] );\n\t\tbool = (\n\t\t\tisFloat32Array( arr ) &&\n\t\t\tarr[ 0 ] === 1.0 &&\n\t\t\tarr[ 1 ] === 3.140000104904175 &&\n\t\t\tarr[ 2 ] === -3.140000104904175 &&\n\t\t\tarr[ 3 ] === PINF\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasFloat32ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of single-precision floating-point numbers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 32-bit unsigned integers in the platform byte order.\n*\n* @module @stdlib/array-uint32\n*\n* @example\n* import ctor from '@stdlib/array-uint32';\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasUint32ArraySupport from '@stdlib/assert-has-uint32array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasUint32ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasUint32Array = ( typeof Uint32Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Uint32Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Uint32Array\n*\n* @example\n* import Uint32Array from '@stdlib/array-uint32';\n*\n* var bool = isUint32Array( new Uint32Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isUint32Array( [] );\n* // returns false\n*/\nfunction isUint32Array( value ) {\n\treturn (\n\t\t( hasUint32Array && value instanceof Uint32Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Uint32Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isUint32Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum unsigned 32-bit integer.\n*\n* @module @stdlib/constants-uint32-max\n* @type {uinteger32}\n*\n* @example\n* import UINT32_MAX from '@stdlib/constants-uint32-max';\n* // returns 4294967295\n*/\n\n\n// MAIN //\n\n/**\n* Maximum unsigned 32-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* 2^{32} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 11111111111111111111111111111111\n* ```\n*\n* @constant\n* @type {uinteger32}\n* @default 4294967295\n*/\nvar UINT32_MAX = 4294967295;\n\n\n// EXPORTS //\n\nexport default UINT32_MAX;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Uint32Array === 'function' ) ? Uint32Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint32Array === 'function' ) ? Uint32Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isUint32Array from '@stdlib/assert-is-uint32array';\nimport UINT32_MAX from '@stdlib/constants-uint32-max';\nimport GlobalUint32Array from './uint32array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Uint32Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Uint32Array` support\n*\n* @example\n* var bool = hasUint32ArraySupport();\n* // returns \n*/\nfunction hasUint32ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalUint32Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = [ 1, 3.14, -3.14, UINT32_MAX+1, UINT32_MAX+2 ];\n\t\tarr = new GlobalUint32Array( arr );\n\t\tbool = (\n\t\t\tisUint32Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 && // truncation\n\t\t\tarr[ 2 ] === UINT32_MAX-2 && // truncation and wrap around\n\t\t\tarr[ 3 ] === 0 && // wrap around\n\t\t\tarr[ 4 ] === 1 // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasUint32ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 32-bit unsigned integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of twos-complement 32-bit signed integers in the platform byte order.\n*\n* @module @stdlib/array-int32\n*\n* @example\n* import ctor from '@stdlib/array-int32';\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasInt32ArraySupport from '@stdlib/assert-has-int32array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasInt32ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasInt32Array = ( typeof Int32Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an Int32Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an Int32Array\n*\n* @example\n* import Int32Array from '@stdlib/array-int32';\n*\n* var bool = isInt32Array( new Int32Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isInt32Array( [] );\n* // returns false\n*/\nfunction isInt32Array( value ) {\n\treturn (\n\t\t( hasInt32Array && value instanceof Int32Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Int32Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInt32Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Int32Array === 'function' ) ? Int32Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Int32Array === 'function' ) ? Int32Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isInt32Array from '@stdlib/assert-is-int32array';\nimport INT32_MAX from '@stdlib/constants-int32-max';\nimport INT32_MIN from '@stdlib/constants-int32-min';\nimport GlobalInt32Array from './int32array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Int32Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Int32Array` support\n*\n* @example\n* var bool = hasInt32ArraySupport();\n* // returns \n*/\nfunction hasInt32ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalInt32Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalInt32Array( [ 1, 3.14, -3.14, INT32_MAX+1 ] );\n\t\tbool = (\n\t\t\tisInt32Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 && // truncation\n\t\t\tarr[ 2 ] === -3 && // truncation\n\t\t\tarr[ 3 ] === INT32_MIN // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasInt32ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Minimum signed 32-bit integer.\n*\n* @module @stdlib/constants-int32-min\n* @type {integer32}\n*\n* @example\n* import INT32_MIN from '@stdlib/constants-int32-min';\n* // returns -2147483648\n*/\n\n\n// MAIN //\n\n/**\n* Minimum signed 32-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* -(2^{31})\n* ```\n*\n* which corresponds to the two's complement bit sequence\n*\n* ```binarystring\n* 10000000000000000000000000000000\n* ```\n*\n* @constant\n* @type {integer32}\n* @default -2147483648\n*/\nvar INT32_MIN = -2147483648|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default INT32_MIN;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of twos-complement 32-bit signed integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 16-bit unsigned integers in the platform byte order.\n*\n* @module @stdlib/array-uint16\n*\n* @example\n* import ctor from '@stdlib/array-uint16';\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasUint16ArraySupport from '@stdlib/assert-has-uint16array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasUint16ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasUint16Array = ( typeof Uint16Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Uint16Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Uint16Array\n*\n* @example\n* import Uint16Array from '@stdlib/array-uint16';\n*\n* var bool = isUint16Array( new Uint16Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isUint16Array( [] );\n* // returns false\n*/\nfunction isUint16Array( value ) {\n\treturn (\n\t\t( hasUint16Array && value instanceof Uint16Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Uint16Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isUint16Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Uint16Array === 'function' ) ? Uint16Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint16Array === 'function' ) ? Uint16Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isUint16Array from '@stdlib/assert-is-uint16array';\nimport UINT16_MAX from '@stdlib/constants-uint16-max';\nimport GlobalUint16Array from './uint16array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Uint16Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Uint16Array` support\n*\n* @example\n* var bool = hasUint16ArraySupport();\n* // returns \n*/\nfunction hasUint16ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalUint16Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = [ 1, 3.14, -3.14, UINT16_MAX+1, UINT16_MAX+2 ];\n\t\tarr = new GlobalUint16Array( arr );\n\t\tbool = (\n\t\t\tisUint16Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 && // truncation\n\t\t\tarr[ 2 ] === UINT16_MAX-2 && // truncation and wrap around\n\t\t\tarr[ 3 ] === 0 && // wrap around\n\t\t\tarr[ 4 ] === 1 // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasUint16ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 16-bit unsigned integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of twos-complement 16-bit signed integers in the platform byte order.\n*\n* @module @stdlib/array-int16\n*\n* @example\n* import ctor from '@stdlib/array-int16';\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasInt16ArraySupport from '@stdlib/assert-has-int16array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasInt16ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasInt16Array = ( typeof Int16Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an Int16Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an Int16Array\n*\n* @example\n* import Int16Array from '@stdlib/array-int16';\n*\n* var bool = isInt16Array( new Int16Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isInt16Array( [] );\n* // returns false\n*/\nfunction isInt16Array( value ) {\n\treturn (\n\t\t( hasInt16Array && value instanceof Int16Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Int16Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInt16Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Int16Array === 'function' ) ? Int16Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Int16Array === 'function' ) ? Int16Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isInt16Array from '@stdlib/assert-is-int16array';\nimport INT16_MAX from '@stdlib/constants-int16-max';\nimport INT16_MIN from '@stdlib/constants-int16-min';\nimport GlobalInt16Array from './int16array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Int16Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Int16Array` support\n*\n* @example\n* var bool = hasInt16ArraySupport();\n* // returns \n*/\nfunction hasInt16ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalInt16Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalInt16Array( [ 1, 3.14, -3.14, INT16_MAX+1 ] );\n\t\tbool = (\n\t\t\tisInt16Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 && // truncation\n\t\t\tarr[ 2 ] === -3 && // truncation\n\t\t\tarr[ 3 ] === INT16_MIN // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasInt16ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Minimum signed 16-bit integer.\n*\n* @module @stdlib/constants-int16-min\n* @type {integer32}\n*\n* @example\n* import INT16_MIN from '@stdlib/constants-int16-min';\n* // returns -32768\n*/\n\n\n// MAIN //\n\n/**\n* Minimum signed 16-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* -(2^{15})\n* ```\n*\n* which corresponds to the two's complement bit sequence\n*\n* ```binarystring\n* 1000000000000000\n* ```\n*\n* @constant\n* @type {integer32}\n* @default -32768\n*/\nvar INT16_MIN = -32768|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default INT16_MIN;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of twos-complement 16-bit signed integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 8-bit unsigned integers in the platform byte order.\n*\n* @module @stdlib/array-uint8\n*\n* @example\n* import ctor from '@stdlib/array-uint8';\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasUint8ArraySupport from '@stdlib/assert-has-uint8array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasUint8ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasUint8Array = ( typeof Uint8Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Uint8Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Uint8Array\n*\n* @example\n* import Uint8Array from '@stdlib/array-uint8';\n*\n* var bool = isUint8Array( new Uint8Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isUint8Array( [] );\n* // returns false\n*/\nfunction isUint8Array( value ) {\n\treturn (\n\t\t( hasUint8Array && value instanceof Uint8Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Uint8Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isUint8Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Uint8Array === 'function' ) ? Uint8Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint8Array === 'function' ) ? Uint8Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isUint8Array from '@stdlib/assert-is-uint8array';\nimport UINT8_MAX from '@stdlib/constants-uint8-max';\nimport GlobalUint8Array from './uint8array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Uint8Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Uint8Array` support\n*\n* @example\n* var bool = hasUint8ArraySupport();\n* // returns \n*/\nfunction hasUint8ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalUint8Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = [ 1, 3.14, -3.14, UINT8_MAX+1, UINT8_MAX+2 ];\n\t\tarr = new GlobalUint8Array( arr );\n\t\tbool = (\n\t\t\tisUint8Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 && // truncation\n\t\t\tarr[ 2 ] === UINT8_MAX-2 && // truncation and wrap around\n\t\t\tarr[ 3 ] === 0 && // wrap around\n\t\t\tarr[ 4 ] === 1 // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasUint8ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 8-bit unsigned integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 8-bit unsigned integers in the platform byte order clamped to 0-255.\n*\n* @module @stdlib/array-uint8c\n*\n* @example\n* import ctor from '@stdlib/array-uint8c';\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasUint8ClampedArraySupport from '@stdlib/assert-has-uint8clampedarray-support'; // eslint-disable-line id-length\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasUint8ClampedArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasUint8ClampedArray = ( typeof Uint8ClampedArray === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Uint8ClampedArray.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Uint8ClampedArray\n*\n* @example\n* import Uint8ClampedArray from '@stdlib/array-uint8c';\n*\n* var bool = isUint8ClampedArray( new Uint8ClampedArray( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isUint8ClampedArray( [] );\n* // returns false\n*/\nfunction isUint8ClampedArray( value ) {\n\treturn (\n\t\t( hasUint8ClampedArray && value instanceof Uint8ClampedArray ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Uint8ClampedArray]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isUint8ClampedArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Uint8ClampedArray === 'function' ) ? Uint8ClampedArray : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint8ClampedArray === 'function' ) ? Uint8ClampedArray : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isUint8ClampedArray from '@stdlib/assert-is-uint8clampedarray';\nimport GlobalUint8ClampedArray from './uint8clampedarray.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Uint8ClampedArray` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Uint8ClampedArray` support\n*\n* @example\n* var bool = hasUint8ClampedArraySupport();\n* // returns \n*/\nfunction hasUint8ClampedArraySupport() { // eslint-disable-line id-length\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalUint8ClampedArray !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalUint8ClampedArray( [ -1, 0, 1, 3.14, 4.99, 255, 256 ] );\n\t\tbool = (\n\t\t\tisUint8ClampedArray( arr ) &&\n\t\t\tarr[ 0 ] === 0 && // clamped\n\t\t\tarr[ 1 ] === 0 &&\n\t\t\tarr[ 2 ] === 1 &&\n\t\t\tarr[ 3 ] === 3 && // round to nearest\n\t\t\tarr[ 4 ] === 5 && // round to nearest\n\t\t\tarr[ 5 ] === 255 &&\n\t\t\tarr[ 6 ] === 255 // clamped\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasUint8ClampedArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 8-bit unsigned integers in the platform byte order clamped to 0-255.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of twos-complement 8-bit signed integers in the platform byte order.\n*\n* @module @stdlib/array-int8\n*\n* @example\n* import ctor from '@stdlib/array-int8';\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasInt8ArraySupport from '@stdlib/assert-has-int8array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasInt8ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasInt8Array = ( typeof Int8Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an Int8Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an Int8Array\n*\n* @example\n* import Int8Array from '@stdlib/array-int8';\n*\n* var bool = isInt8Array( new Int8Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isInt8Array( [] );\n* // returns false\n*/\nfunction isInt8Array( value ) {\n\treturn (\n\t\t( hasInt8Array && value instanceof Int8Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Int8Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInt8Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Int8Array === 'function' ) ? Int8Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Int8Array === 'function' ) ? Int8Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isInt8Array from '@stdlib/assert-is-int8array';\nimport INT8_MAX from '@stdlib/constants-int8-max';\nimport INT8_MIN from '@stdlib/constants-int8-min';\nimport GlobalInt8Array from './int8array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Int8Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Int8Array` support\n*\n* @example\n* var bool = hasInt8ArraySupport();\n* // returns \n*/\nfunction hasInt8ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalInt8Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalInt8Array( [ 1, 3.14, -3.14, INT8_MAX+1 ] );\n\t\tbool = (\n\t\t\tisInt8Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 && // truncation\n\t\t\tarr[ 2 ] === -3 && // truncation\n\t\t\tarr[ 3 ] === INT8_MIN // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasInt8ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Minimum signed 8-bit integer.\n*\n* @module @stdlib/constants-int8-min\n* @type {integer32}\n*\n* @example\n* import INT8_MIN from '@stdlib/constants-int8-min';\n* // returns -128\n*/\n\n\n// MAIN //\n\n/**\n* Minimum signed 8-bit integer.\n*\n* ## Notes\n*\n* The number is given by\n*\n* ```tex\n* -(2^{7})\n* ```\n*\n* which corresponds to the two's complement bit sequence\n*\n* ```binarystring\n* 10000000\n* ```\n*\n* @constant\n* @type {integer32}\n* @default -128\n*/\nvar INT8_MIN = -128|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default INT8_MIN;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of twos-complement 8-bit signed integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Double-precision floating-point negative infinity.\n*\n* @module @stdlib/constants-float64-ninf\n* @type {number}\n*\n* @example\n* import FLOAT64_NINF from '@stdlib/constants-float64-ninf';\n* // returns -Infinity\n*/\n\n// MODULES //\n\nimport Number from '@stdlib/number-ctor';\n\n\n// MAIN //\n\n/**\n* Double-precision floating-point negative infinity.\n*\n* ## Notes\n*\n* Double-precision floating-point negative infinity has the bit sequence\n*\n* ```binarystring\n* 1 11111111111 00000000000000000000 00000000000000000000000000000000\n* ```\n*\n* @constant\n* @type {number}\n* @default Number.NEGATIVE_INFINITY\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_NINF = Number.NEGATIVE_INFINITY;\n\n\n// EXPORTS //\n\nexport default FLOAT64_NINF;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: implementation (?)\n\n/**\n* Rounds a double-precision floating-point number toward negative infinity.\n*\n* @param {number} x - input value\n* @returns {number} rounded value\n*\n* @example\n* var v = floor( -4.2 );\n* // returns -5.0\n*\n* @example\n* var v = floor( 9.99999 );\n* // returns 9.0\n*\n* @example\n* var v = floor( 0.0 );\n* // returns 0.0\n*\n* @example\n* var v = floor( NaN );\n* // returns NaN\n*/\nvar floor = Math.floor; // eslint-disable-line stdlib/no-builtin-math\n\n\n// EXPORTS //\n\nexport default floor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport floor from '@stdlib/math-base-special-floor';\n\n\n// MAIN //\n\n/**\n* Tests if a finite double-precision floating-point number is an integer.\n*\n* @param {number} x - value to test\n* @returns {boolean} boolean indicating whether the value is an integer\n*\n* @example\n* var bool = isInteger( 1.0 );\n* // returns true\n*\n* @example\n* var bool = isInteger( 3.14 );\n* // returns false\n*/\nfunction isInteger( x ) {\n\treturn (floor(x) === x);\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport PINF from '@stdlib/constants-float64-pinf';\nimport NINF from '@stdlib/constants-float64-ninf';\nimport isInt from '@stdlib/math-base-assert-is-integer';\n\n\n// MAIN //\n\n/**\n* Tests if a number primitive is an integer value.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a number primitive is an integer value\n*/\nfunction isInteger( value ) {\n\treturn (\n\t\tvalue < PINF &&\n\t\tvalue > NINF &&\n\t\tisInt( value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport isInt from './integer.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number primitive having an integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive having an integer value\n*\n* @example\n* var bool = isInteger( -3.0 );\n* // returns true\n*\n* @example\n* var bool = isInteger( new Number( -3.0 ) );\n* // returns false\n*/\nfunction isInteger( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisInt( value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isObject as isNumber } from '@stdlib/assert-is-number';\nimport isInt from './integer.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object having an integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object having an integer value\n*\n* @example\n* var bool = isInteger( 3.0 );\n* // returns false\n*\n* @example\n* var bool = isInteger( new Number( 3.0 ) );\n* // returns true\n*/\nfunction isInteger( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisInt( value.valueOf() )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is an integer.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an integer\n*\n* @example\n* var bool = isInteger( 5.0 );\n* // returns true\n*\n* @example\n* var bool = isInteger( new Number( 5.0 ) );\n* // returns true\n*\n* @example\n* var bool = isInteger( -3.14 );\n* // returns false\n*\n* @example\n* var bool = isInteger( null );\n* // returns false\n*/\nfunction isInteger( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number primitive having a nonnegative integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive having a nonnegative integer value\n*\n* @example\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns true\n*\n* @example\n* var bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns false\n*/\nfunction isNonNegativeInteger( value ) {\n\treturn (\n\t\tisInteger( value ) &&\n\t\tvalue >= 0\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isNonNegativeInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isObject as isInteger } from '@stdlib/assert-is-integer';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object having a nonnegative integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object having a nonnegative integer value\n*\n* @example\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns false\n*\n* @example\n* var bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns true\n*/\nfunction isNonNegativeInteger( value ) {\n\treturn (\n\t\tisInteger( value ) &&\n\t\tvalue.valueOf() >= 0\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isNonNegativeInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a nonnegative integer.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a nonnegative integer\n*\n* @example\n* var bool = isNonNegativeInteger( 5.0 );\n* // returns true\n*\n* @example\n* var bool = isNonNegativeInteger( new Number( 5.0 ) );\n* // returns true\n*\n* @example\n* var bool = isNonNegativeInteger( -5.0 );\n* // returns false\n*\n* @example\n* var bool = isNonNegativeInteger( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isNonNegativeInteger( null );\n* // returns false\n*/\nfunction isNonNegativeInteger( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isNonNegativeInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an integer.\n*\n* @module @stdlib/assert-is-integer\n*\n* @example\n* import isInteger from '@stdlib/assert-is-integer';\n*\n* var bool = isInteger( 5.0 );\n* // returns true\n*\n* bool = isInteger( new Number( 5.0 ) );\n* // returns true\n*\n* bool = isInteger( -3.14 );\n* // returns false\n*\n* bool = isInteger( null );\n* // returns false\n*\n* @example\n* // Use interface to check for integer primitives...\n* import { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\n*\n* var bool = isInteger( -3.0 );\n* // returns true\n*\n* bool = isInteger( new Number( -3.0 ) );\n* // returns false\n*\n* @example\n* // Use interface to check for integer objects...\n* import { isObject as isInteger } from '@stdlib/assert-is-integer';\n*\n* var bool = isInteger( 3.0 );\n* // returns false\n*\n* bool = isInteger( new Number( 3.0 ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a nonnegative integer.\n*\n* @module @stdlib/assert-is-nonnegative-integer\n*\n* @example\n* import isNonNegativeInteger from '@stdlib/assert-is-nonnegative-integer';\n*\n* var bool = isNonNegativeInteger( 5.0 );\n* // returns true\n*\n* bool = isNonNegativeInteger( new Number( 5.0 ) );\n* // returns true\n*\n* bool = isNonNegativeInteger( -5.0 );\n* // returns false\n*\n* bool = isNonNegativeInteger( 3.14 );\n* // returns false\n*\n* bool = isNonNegativeInteger( null );\n* // returns false\n*\n* @example\n* import { isPrimitive as isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\n*\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns true\n*\n* bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns false\n*\n* @example\n* import { isObject as isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\n*\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns false\n*\n* bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum length of a generic array.\n*\n* @module @stdlib/constants-array-max-array-length\n*\n* @example\n* import MAX_ARRAY_LENGTH from '@stdlib/constants-array-max-array-length';\n* // returns 4294967295\n*/\n\n// MAIN //\n\n/**\n* Maximum length of a generic array.\n*\n* ```tex\n* 2^{32} - 1\n* ```\n*\n* @constant\n* @type {uinteger32}\n* @default 4294967295\n*/\nvar MAX_ARRAY_LENGTH = 4294967295>>>0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default MAX_ARRAY_LENGTH;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isInteger from '@stdlib/math-base-assert-is-integer';\nimport MAX_LENGTH from '@stdlib/constants-array-max-array-length';\n\n\n// MAIN //\n\n/**\n* Tests if a value is an array-like object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is an array-like object\n*\n* @example\n* var bool = isArrayLikeObject( [] );\n* // returns true\n*\n* @example\n* var bool = isArrayLikeObject( { 'length': 10 } );\n* // returns true\n*\n* @example\n* var bool = isArrayLikeObject( 'beep' );\n* // returns false\n*/\nfunction isArrayLikeObject( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\ttypeof value.length === 'number' &&\n\t\tisInteger( value.length ) &&\n\t\tvalue.length >= 0 &&\n\t\tvalue.length <= MAX_LENGTH\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isArrayLikeObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum length of a typed array.\n*\n* @module @stdlib/constants-array-max-typed-array-length\n*\n* @example\n* import MAX_TYPED_ARRAY_LENGTH from '@stdlib/constants-array-max-typed-array-length';\n* // returns 9007199254740991\n*/\n\n// MAIN //\n\n/**\n* Maximum length of a typed array.\n*\n* ```tex\n* 2^{53} - 1\n* ```\n*\n* @constant\n* @type {number}\n* @default 9007199254740991\n*/\nvar MAX_TYPED_ARRAY_LENGTH = 9007199254740991;\n\n\n// EXPORTS //\n\nexport default MAX_TYPED_ARRAY_LENGTH;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isInteger from '@stdlib/math-base-assert-is-integer';\nimport MAX_LENGTH from '@stdlib/constants-array-max-typed-array-length';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a collection.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is a collection\n*\n* @example\n* var bool = isCollection( [] );\n* // returns true\n*\n* @example\n* var bool = isCollection( {} );\n* // returns false\n*/\nfunction isCollection( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\ttypeof value.length === 'number' &&\n\t\tisInteger( value.length ) &&\n\t\tvalue.length >= 0 &&\n\t\tvalue.length <= MAX_LENGTH\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isCollection;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasArrayBuffer = ( typeof ArrayBuffer === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an ArrayBuffer.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an ArrayBuffer\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var bool = isArrayBuffer( new ArrayBuffer( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isArrayBuffer( [] );\n* // returns false\n*/\nfunction isArrayBuffer( value ) {\n\treturn (\n\t\t( hasArrayBuffer && value instanceof ArrayBuffer ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object ArrayBuffer]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isArrayBuffer;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArray from '@stdlib/assert-is-array';\n\n\n// MAIN //\n\n/**\n* Tests if a value is an object; e.g., `{}`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an object\n*\n* @example\n* var bool = isObject( {} );\n* // returns true\n*\n* @example\n* var bool = isObject( null );\n* // returns false\n*/\nfunction isObject( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\t!isArray( value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an array of strings.\n*\n* @module @stdlib/assert-is-string-array\n*\n* @example\n* import isStringArray from '@stdlib/assert-is-string-array';\n*\n* var bool = isStringArray( [ 'abc', 'def' ] );\n* // returns true\n*\n* bool = isStringArray( [ 'abc', 123 ] );\n* // returns false\n*\n* @example\n* import { primitives as isStringArray } from '@stdlib/assert-is-string-array';\n*\n* var bool = isStringArray( [ 'abc', 'def' ] );\n* // returns true\n*\n* bool = isStringArray( [ 'abc', new String( 'def' ) ] );\n* // returns false\n*\n* @example\n* import { objects as isStringArray } from '@stdlib/assert-is-string-array';\n*\n* var bool = isStringArray( [ new String( 'abc' ), new String( 'def' ) ] );\n* // returns true\n*\n* bool = isStringArray( [ new String( 'abc' ), 'def' ] );\n* // returns false\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport arrayfun from '@stdlib/assert-tools-array-function';\nimport isString from '@stdlib/assert-is-string';\n\n\n// VARIABLES //\n\nvar isPrimitiveArray = arrayfun( isString.isPrimitive );\nvar isObjectArray = arrayfun( isString.isObject );\n\n\n// MAIN //\n\nvar isStringArray = arrayfun( isString );\nsetReadOnly( isStringArray, 'primitives', isPrimitiveArray );\nsetReadOnly( isStringArray, 'objects', isObjectArray );\n\n\n// EXPORTS //\n\nexport default isStringArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\nvar RE = /./;\n\n\n// EXPORTS //\n\nexport default RE;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a boolean primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a boolean primitive\n*\n* @example\n* var bool = isBoolean( true );\n* // returns true\n*\n* @example\n* var bool = isBoolean( false );\n* // returns true\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n*\n* var bool = isBoolean( new Boolean( true ) );\n* // returns false\n*/\nfunction isBoolean( value ) {\n\treturn ( typeof value === 'boolean' );\n}\n\n\n// EXPORTS //\n\nexport default isBoolean;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns a boolean.\n*\n* @name Boolean\n* @constructor\n* @type {Function}\n* @param {*} value - input value\n* @returns {(boolean|Boolean)} boolean\n*\n* @example\n* var b = Boolean( null );\n* // returns false\n*\n* b = Boolean( [] );\n* // returns true\n*\n* b = Boolean( {} );\n* // returns true\n*\n* @example\n* var b = new Boolean( false );\n* // returns \n*/\nvar Bool = Boolean; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default Bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// eslint-disable-next-line stdlib/no-redeclare\nvar toString = Boolean.prototype.toString; // non-generic\n\n\n// EXPORTS //\n\nexport default toString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasToStringTag from '@stdlib/assert-has-tostringtag-support';\nimport nativeClass from '@stdlib/utils-native-class';\nimport Boolean from '@stdlib/boolean-ctor';\nimport test from './try2serialize.js';\n\n\n// VARIABLES //\n\nvar FLG = hasToStringTag();\n\n\n// MAIN //\n\n/**\n* Tests if a value is a boolean object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a boolean object\n*\n* @example\n* var bool = isBoolean( true );\n* // returns false\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n*\n* var bool = isBoolean( new Boolean( false ) );\n* // returns true\n*/\nfunction isBoolean( value ) {\n\tif ( typeof value === 'object' ) {\n\t\tif ( value instanceof Boolean ) {\n\t\t\treturn true;\n\t\t}\n\t\tif ( FLG ) {\n\t\t\treturn test( value );\n\t\t}\n\t\treturn ( nativeClass( value ) === '[object Boolean]' );\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isBoolean;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport toString from './tostring.js'; // eslint-disable-line stdlib/no-redeclare\n\n\n// MAIN //\n\n/**\n* Attempts to serialize a value to a string.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value can be serialized\n*/\nfunction test( value ) {\n\ttry {\n\t\ttoString.call( value );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default test;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a boolean.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a boolean\n*\n* @example\n* var bool = isBoolean( false );\n* // returns true\n*\n* @example\n* var bool = isBoolean( true );\n* // returns true\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n*\n* var bool = isBoolean( new Boolean( false ) );\n* // returns true\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n*\n* var bool = isBoolean( new Boolean( true ) );\n* // returns true\n*/\nfunction isBoolean( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isBoolean;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a boolean.\n*\n* @module @stdlib/assert-is-boolean\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n* import isBoolean from '@stdlib/assert-is-boolean';\n*\n* var bool = isBoolean( false );\n* // returns true\n*\n* bool = isBoolean( new Boolean( false ) );\n* // returns true\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n* import { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\n*\n* var bool = isBoolean( false );\n* // returns true\n*\n* bool = isBoolean( new Boolean( true ) );\n* // returns false\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n* import { isObject as isBoolean } from '@stdlib/assert-is-boolean';\n*\n* var bool = isBoolean( true );\n* // returns false\n*\n* bool = isBoolean( new Boolean( false ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar obj = ( typeof self === 'object' ) ? self : null;\n\n\n// EXPORTS //\n\nexport default obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar obj = ( typeof window === 'object' ) ? window : null;\n\n\n// EXPORTS //\n\nexport default obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar obj = ( typeof globalThis === 'object' ) ? globalThis : null; // eslint-disable-line no-undef\n\n\n// EXPORTS //\n\nexport default obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport getGlobal from '@stdlib/utils-global';\n\n\n// MAIN //\n\nvar root = getGlobal();\nvar nodeList = root.document && root.document.childNodes;\n\n\n// EXPORTS //\n\nexport default nodeList;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport format from '@stdlib/string-format';\nimport getThis from './codegen.js';\nimport Self from './self.js';\nimport Win from './window.js';\nimport GlobalThis from './global_this.js';\n\n\n// MAIN //\n\n/**\n* Returns the global object.\n*\n* ## Notes\n*\n* - Using code generation is the **most** reliable way to resolve the global object; however, doing so is likely to violate content security policies (CSPs) in, e.g., Chrome Apps and elsewhere.\n*\n* @private\n* @param {boolean} [codegen=false] - boolean indicating whether to use code generation to resolve the global object\n* @throws {TypeError} must provide a boolean\n* @throws {Error} unable to resolve global object\n* @returns {Object} global object\n*\n* @example\n* var g = getGlobal();\n* // returns {...}\n*/\nfunction getGlobal( codegen ) {\n\tif ( arguments.length ) {\n\t\tif ( !isBoolean( codegen ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a boolean. Value: `%s`.', codegen ) );\n\t\t}\n\t\tif ( codegen ) {\n\t\t\treturn getThis();\n\t\t}\n\t\t// Fall through...\n\t}\n\t// Case: 2020 revision of ECMAScript standard\n\tif ( GlobalThis ) {\n\t\treturn GlobalThis;\n\t}\n\t// Case: browsers and web workers\n\tif ( Self ) {\n\t\treturn Self;\n\t}\n\t// Case: browsers\n\tif ( Win ) {\n\t\treturn Win;\n\t}\n\t// Case: unknown\n\tthrow new Error( 'unexpected error. Unable to resolve global object.' );\n}\n\n\n// EXPORTS //\n\nexport default getGlobal;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the global object using code generation.\n*\n* @private\n* @returns {Object} global object\n*/\nfunction getGlobal() {\n\treturn new Function( 'return this;' )(); // eslint-disable-line no-new-func, stdlib/require-globals\n}\n\n\n// EXPORTS //\n\nexport default getGlobal;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\nvar typedarray = Int8Array; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default typedarray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Determine a value's type.\n*\n* @module @stdlib/utils-type-of\n*\n* @example\n* import typeOf from '@stdlib/utils-type-of';\n*\n* var str = typeOf( 'a' );\n* // returns 'string'\n*\n* str = typeOf( 5 );\n* // returns 'number'\n*/\n\n// MODULES //\n\nimport usePolyfill from './check.js';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar main = ( usePolyfill() ) ? polyfill : builtin;\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport RE from './fixtures/re.js';\nimport nodeList from './fixtures/nodelist.js';\nimport typedarray from './fixtures/typedarray.js';\n\n\n// MAIN //\n\n/**\n* Checks whether a polyfill is needed when using the `typeof` operator.\n*\n* @private\n* @returns {boolean} boolean indicating whether a polyfill is needed\n*/\nfunction check() {\n\tif (\n\t\t// Chrome 1-12 returns 'function' for regular expression instances (see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/typeof):\n\t\ttypeof RE === 'function' ||\n\n\t\t// Safari 8 returns 'object' for typed array and weak map constructors (underscore #1929):\n\t\ttypeof typedarray === 'object' ||\n\n\t\t// PhantomJS 1.9 returns 'function' for `NodeList` instances (underscore #2236):\n\t\ttypeof nodeList === 'function'\n\t) {\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default check;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport ctorName from '@stdlib/utils-constructor-name';\n\n\n// MAIN //\n\n/**\n* Determines a value's type.\n*\n* @param {*} v - input value\n* @returns {string} string indicating the value's type\n*/\nfunction typeOf( v ) {\n\treturn ctorName( v ).toLowerCase();\n}\n\n\n// EXPORTS //\n\nexport default typeOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport ctorName from '@stdlib/utils-constructor-name';\n\n\n// NOTES //\n\n/*\n* Built-in `typeof` operator behavior:\n*\n* ```text\n* typeof null => 'object'\n* typeof undefined => 'undefined'\n* typeof 'a' => 'string'\n* typeof 5 => 'number'\n* typeof NaN => 'number'\n* typeof true => 'boolean'\n* typeof false => 'boolean'\n* typeof {} => 'object'\n* typeof [] => 'object'\n* typeof function foo(){} => 'function'\n* typeof function* foo(){} => 'object'\n* typeof Symbol() => 'symbol'\n* ```\n*\n*/\n\n\n// MAIN //\n\n/**\n* Determines a value's type.\n*\n* @param {*} v - input value\n* @returns {string} string indicating the value's type\n*/\nfunction typeOf( v ) {\n\tvar type;\n\n\t// Address `typeof null` => `object` (see http://wiki.ecmascript.org/doku.php?id=harmony:typeof_null):\n\tif ( v === null ) {\n\t\treturn 'null';\n\t}\n\ttype = typeof v;\n\n\t// If the `typeof` operator returned something other than `object`, we are done. Otherwise, we need to check for an internal class name or search for a constructor.\n\tif ( type === 'object' ) {\n\t\treturn ctorName( v ).toLowerCase();\n\t}\n\treturn type;\n}\n\n\n// EXPORTS //\n\nexport default typeOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport typeOf from '@stdlib/utils-type-of';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a function.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a function\n*\n* @example\n* function beep() {\n* return 'beep';\n* }\n*\n* var bool = isFunction( beep );\n* // returns true\n*/\nfunction isFunction( value ) {\n\t// Note: cannot use `typeof` directly, as various browser engines incorrectly return `'function'` when operating on non-function objects, such as regular expressions and NodeLists.\n\treturn ( typeOf( value ) === 'function' );\n}\n\n\n// EXPORTS //\n\nexport default isFunction;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport defineProperty from '@stdlib/utils-define-property';\n\n\n// MAIN //\n\n/**\n* Defines a read-only property.\n*\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {*} value - value to set\n*\n* @example\n* var obj = {};\n*\n* setReadOnly( obj, 'foo', 'bar' );\n*\n* try {\n* obj.foo = 'boop';\n* } catch ( err ) {\n* console.error( err.message );\n* }\n*/\nfunction setReadOnly( obj, prop, value ) {\n\tdefineProperty( obj, prop, {\n\t\t'configurable': false,\n\t\t'enumerable': true,\n\t\t'writable': false,\n\t\t'value': value\n\t});\n}\n\n\n// EXPORTS //\n\nexport default setReadOnly;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport setEnumerableReadOnly from '@stdlib/utils-define-read-only-property';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport format from '@stdlib/string-format';\nimport toStr from './tostring.js';\nimport toJSON from './tojson.js';\n\n\n// MAIN //\n\n/**\n* 128-bit complex number constructor.\n*\n* @constructor\n* @param {number} real - real component\n* @param {number} imag - imaginary component\n* @throws {TypeError} must invoke using the `new` keyword\n* @throws {TypeError} real component must be a number\n* @throws {TypeError} imaginary component must be a number\n* @returns {Complex128} 128-bit complex number\n*\n* @example\n* var z = new Complex128( 5.0, 3.0 );\n* // returns \n*/\nfunction Complex128( real, imag ) {\n\tif ( !( this instanceof Complex128 ) ) {\n\t\tthrow new TypeError( 'invalid invocation. Constructor must be called with the `new` keyword.' );\n\t}\n\tif ( !isNumber( real ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Real component must be a number. Value: `%s`.', real ) );\n\t}\n\tif ( !isNumber( imag ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Imaginary component must be a number. Value: `%s`.', imag ) );\n\t}\n\tsetEnumerableReadOnly( this, 're', real );\n\tsetEnumerableReadOnly( this, 'im', imag );\n\treturn this;\n}\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof Complex128\n* @readonly\n* @type {string}\n* @default 'Complex128'\n*\n* @example\n* var name = Complex128.name;\n* // returns 'Complex128'\n*/\nsetReadOnly( Complex128, 'name', 'Complex128' );\n\n/**\n* Size (in bytes) of each component.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex128\n* @type {integer}\n* @returns {integer} size of each component\n*\n* @example\n* var nbytes = Complex128.BYTES_PER_ELEMENT;\n* // returns 8\n*/\nsetReadOnly( Complex128, 'BYTES_PER_ELEMENT', 8 );\n\n/**\n* Size (in bytes) of each component.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex128.prototype\n* @type {integer}\n* @returns {integer} size of each component\n*\n* @example\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var nbytes = z.BYTES_PER_ELEMENT;\n* // returns 8\n*/\nsetReadOnly( Complex128.prototype, 'BYTES_PER_ELEMENT', 8 );\n\n/**\n* Length (in bytes) of a complex number.\n*\n* @name byteLength\n* @memberof Complex128.prototype\n* @type {integer}\n* @returns {integer} byte length\n*\n* @example\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var nbytes = z.byteLength;\n* // returns 16\n*/\nsetReadOnly( Complex128.prototype, 'byteLength', 16 );\n\n/**\n* Serializes a complex number as a string.\n*\n* @name toString\n* @memberof Complex128.prototype\n* @type {Function}\n* @returns {string} serialized complex number\n*\n* @example\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var str = z.toString();\n* // returns '5 + 3i'\n*/\nsetReadOnly( Complex128.prototype, 'toString', toStr );\n\n/**\n* Serializes a complex number as a JSON object.\n*\n* ## Notes\n*\n* - `JSON.stringify()` implicitly calls this method when stringifying a `Complex128` instance.\n*\n* @name toJSON\n* @memberof Complex128.prototype\n* @type {Function}\n* @returns {Object} serialized complex number\n*\n* @example\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var obj = z.toJSON();\n* // returns { 'type': 'Complex128', 're': 5.0, 'im': 3.0 }\n*/\nsetReadOnly( Complex128.prototype, 'toJSON', toJSON );\n\n\n// EXPORTS //\n\nexport default Complex128;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Serializes a complex number as a string.\n*\n* @private\n* @returns {string} serialized complex number\n*/\nfunction toString() { // eslint-disable-line stdlib/no-redeclare\n\t/* eslint-disable no-invalid-this */\n\tvar str = '' + this.re;\n\tif ( this.im < 0 ) {\n\t\tstr += ' - ' + (-this.im);\n\t} else {\n\t\tstr += ' + ' + this.im;\n\t}\n\tstr += 'i';\n\treturn str;\n}\n\n\n// EXPORTS //\n\nexport default toString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Serializes a complex number as a JSON object.\n*\n* @private\n* @returns {Object} JSON representation\n*/\nfunction toJSON() {\n\t/* eslint-disable no-invalid-this */\n\tvar out = {};\n\tout.type = 'Complex128';\n\tout.re = this.re;\n\tout.im = this.im;\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default toJSON;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar fround = ( typeof Math.fround === 'function' ) ? Math.fround : null; // eslint-disable-line stdlib/no-builtin-math\n\n\n// EXPORTS //\n\nexport default fround;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Float32Array from '@stdlib/array-float32';\n\n\n// VARIABLES //\n\nvar FLOAT32_VIEW = new Float32Array( 1 );\n\n\n// MAIN //\n\n/**\n* Converts a double-precision floating-point number to the nearest single-precision floating-point number.\n*\n* @param {number} x - double-precision floating-point number\n* @returns {number} nearest single-precision floating-point number\n*\n* @example\n* var y = float64ToFloat32( 1.337 );\n* // returns 1.3370000123977661\n*/\nfunction float64ToFloat32( x ) {\n\tFLOAT32_VIEW[ 0 ] = x;\n\treturn FLOAT32_VIEW[ 0 ];\n}\n\n\n// EXPORTS //\n\nexport default float64ToFloat32;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Convert a double-precision floating-point number to the nearest single-precision floating-point number.\n*\n* @module @stdlib/number-float64-base-to-float32\n*\n* @example\n* import float64ToFloat32 from '@stdlib/number-float64-base-to-float32';\n*\n* var y = float64ToFloat32( 1.337 );\n* // returns 1.3370000123977661\n*/\n\n// MODULES //\n\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar float64ToFloat32;\nif ( typeof builtin === 'function' ) {\n\tfloat64ToFloat32 = builtin;\n} else {\n\tfloat64ToFloat32 = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default float64ToFloat32;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport setEnumerableReadOnly from '@stdlib/utils-define-read-only-property';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport float64ToFloat32 from '@stdlib/number-float64-base-to-float32';\nimport format from '@stdlib/string-format';\nimport toStr from './tostring.js';\nimport toJSON from './tojson.js';\n\n\n// MAIN //\n\n/**\n* 64-bit complex number constructor.\n*\n* @constructor\n* @param {number} real - real component\n* @param {number} imag - imaginary component\n* @throws {TypeError} must invoke using the `new` keyword\n* @throws {TypeError} real component must be a number\n* @throws {TypeError} imaginary component must be a number\n* @returns {Complex64} 64-bit complex number\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n* // returns \n*/\nfunction Complex64( real, imag ) {\n\tif ( !( this instanceof Complex64 ) ) {\n\t\tthrow new TypeError( 'invalid invocation. Constructor must be called with the `new` keyword.' );\n\t}\n\tif ( !isNumber( real ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Real component must be a number. Value: `%s`.', real ) );\n\t}\n\tif ( !isNumber( imag ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Imaginary component must be a number. Value: `%s`.', imag ) );\n\t}\n\tsetEnumerableReadOnly( this, 're', float64ToFloat32( real ) );\n\tsetEnumerableReadOnly( this, 'im', float64ToFloat32( imag ) );\n\treturn this;\n}\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof Complex64\n* @readonly\n* @type {string}\n* @default 'Complex64'\n*\n* @example\n* var name = Complex64.name;\n* // returns 'Complex64'\n*/\nsetReadOnly( Complex64, 'name', 'Complex64' );\n\n/**\n* Size (in bytes) of each component.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex64\n* @type {integer}\n* @returns {integer} size of each component\n*\n* @example\n* var nbytes = Complex64.BYTES_PER_ELEMENT;\n* // returns 4\n*/\nsetReadOnly( Complex64, 'BYTES_PER_ELEMENT', 4 );\n\n/**\n* Size (in bytes) of each component.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex64.prototype\n* @type {integer}\n* @returns {integer} size of each component\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var nbytes = z.BYTES_PER_ELEMENT;\n* // returns 4\n*/\nsetReadOnly( Complex64.prototype, 'BYTES_PER_ELEMENT', 4 );\n\n/**\n* Length (in bytes) of a complex number.\n*\n* @name byteLength\n* @memberof Complex64.prototype\n* @type {integer}\n* @returns {integer} byte length\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var nbytes = z.byteLength;\n* // returns 8\n*/\nsetReadOnly( Complex64.prototype, 'byteLength', 8 );\n\n/**\n* Serializes a complex number as a string.\n*\n* @name toString\n* @memberof Complex64.prototype\n* @type {Function}\n* @returns {string} serialized complex number\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var str = z.toString();\n* // returns '5 + 3i'\n*/\nsetReadOnly( Complex64.prototype, 'toString', toStr );\n\n/**\n* Serializes a complex number as a JSON object.\n*\n* ## Notes\n*\n* - `JSON.stringify()` implicitly calls this method when stringifying a `Complex64` instance.\n*\n* @name toJSON\n* @memberof Complex64.prototype\n* @type {Function}\n* @returns {Object} serialized complex number\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var obj = z.toJSON();\n* // returns { 'type': 'Complex64', 're': 5.0, 'im': 3.0 }\n*/\nsetReadOnly( Complex64.prototype, 'toJSON', toJSON );\n\n\n// EXPORTS //\n\nexport default Complex64;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Complex128 from '@stdlib/complex-float64-ctor';\nimport Complex64 from '@stdlib/complex-float32-ctor';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a complex number-like object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex number-like object.\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var x = new Complex128( 4.0, 2.0 );\n* var bool = isComplexLike( x );\n* // returns true\n*\n* x = new Complex64( 4.0, 2.0 );\n* bool = isComplexLike( x );\n* // returns true\n*/\nfunction isComplexLike( value ) {\n\tif ( value instanceof Complex128 || value instanceof Complex64 ) {\n\t\treturn true;\n\t}\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\ttypeof value.re === 'number' &&\n\t\ttypeof value.im === 'number'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isComplexLike;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isInteger from '@stdlib/math-base-assert-is-integer';\n\n\n// MAIN //\n\n/**\n* Tests if a finite numeric value is an even number.\n*\n* @param {number} x - value to test\n* @returns {boolean} boolean indicating whether the value is an even number\n*\n* @example\n* var bool = isEven( 5.0 );\n* // returns false\n*\n* @example\n* var bool = isEven( -2.0 );\n* // returns true\n*\n* @example\n* var bool = isEven( 0.0 );\n* // returns true\n*\n* @example\n* var bool = isEven( NaN );\n* // returns false\n*/\nfunction isEven( x ) {\n\treturn isInteger( x/2.0 );\n}\n\n\n// EXPORTS //\n\nexport default isEven;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Serializes a complex number as a string.\n*\n* @private\n* @returns {string} serialized complex number\n*/\nfunction toString() { // eslint-disable-line stdlib/no-redeclare\n\t/* eslint-disable no-invalid-this */\n\tvar str = '' + this.re;\n\tif ( this.im < 0 ) {\n\t\tstr += ' - ' + (-this.im);\n\t} else {\n\t\tstr += ' + ' + this.im;\n\t}\n\tstr += 'i';\n\treturn str;\n}\n\n\n// EXPORTS //\n\nexport default toString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Serializes a complex number as a JSON object.\n*\n* @private\n* @returns {Object} JSON representation\n*/\nfunction toJSON() {\n\t/* eslint-disable no-invalid-this */\n\tvar out = {};\n\tout.type = 'Complex64';\n\tout.re = this.re;\n\tout.im = this.im;\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default toJSON;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar BYTES_PER_ELEMENT = 8; // 4 bytes per float32 x (1 real + 1 imag component)\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a value is a `Complex64Array`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a `Complex64Array`\n*\n* @example\n* import Complex64Array from '@stdlib/array-complex64';\n*\n* var bool = isComplex64Array( new Complex64Array( 10 ) );\n* // returns true\n*\n* bool = isComplex64Array( [] );\n* // returns false\n*/\nfunction isComplex64Array( value ) {\n\t// Note: the following is not robust and that is intentional. In this case, we are seeking a lower cost way to reasonably determine whether an input value is a `Complex64Array` in order to avoid walking the prototype chain and resolving constructors, which is necessary for robust identification of cross-realm instances. For more robust validation, see `@stdlib/assert/is-complex64array`.\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\tvalue.constructor.name === 'Complex64Array' &&\n\t\tvalue.BYTES_PER_ELEMENT === BYTES_PER_ELEMENT\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isComplex64Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar BYTES_PER_ELEMENT = 16; // 8 bytes per float64 x (1 real + 1 imag component)\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a value is a `Complex128Array`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a `Complex128Array`\n*\n* @example\n* import Complex128Array from '@stdlib/array-complex128';\n*\n* var bool = isComplex128Array( new Complex128Array( 10 ) );\n* // returns true\n*\n* bool = isComplex128Array( [] );\n* // returns false\n*/\nfunction isComplex128Array( value ) {\n\t// Note: the following is not robust and that is intentional. In this case, we are seeking a lower cost way to reasonably determine whether an input value is a `Complex128Array` in order to avoid walking the prototype chain and resolving constructors, which is necessary for robust identification of cross-realm instances. For more robust validation, see `@stdlib/assert/is-complex128array`.\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\tvalue.constructor.name === 'Complex128Array' &&\n\t\tvalue.BYTES_PER_ELEMENT === BYTES_PER_ELEMENT\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isComplex128Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport Symbol from '@stdlib/symbol-ctor';\n\n\n// MAIN //\n\n/**\n* Tests for native `Symbol.iterator` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Symbol.iterator` support\n*\n* @example\n* var bool = hasIteratorSymbolSupport();\n* // returns \n*/\nfunction hasIteratorSymbolSupport() {\n\treturn (\n\t\ttypeof Symbol === 'function' &&\n\t\ttypeof Symbol( 'foo' ) === 'symbol' &&\n\t\thasOwnProp( Symbol, 'iterator' ) &&\n\t\ttypeof Symbol.iterator === 'symbol'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default hasIteratorSymbolSupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasIteratorSymbolSupport from '@stdlib/assert-has-iterator-symbol-support';\n\n\n// MAIN //\n\n/**\n* Iterator symbol.\n*\n* @name IteratorSymbol\n* @constant\n* @type {(symbol|null)}\n*\n* @example\n* function iterator() {\n* var it;\n* var i;\n*\n* i = -1;\n*\n* it = {};\n* it.next = next;\n* it.return = done;\n*\n* if ( IteratorSymbol ) {\n* it[ IteratorSymbol ] = iterator;\n* }\n* return it;\n*\n* function next() {\n* i += 1;\n* return {\n* 'value': i,\n* 'done': false\n* };\n* }\n*\n* function done( value ) {\n* if ( arguments.length === 0 ) {\n* return {\n* 'done': true\n* };\n* }\n* return {\n* 'value': value,\n* 'done': true\n* };\n* }\n* }\n*\n* var obj = iterator();\n*/\nvar IteratorSymbol = ( hasIteratorSymbolSupport() ) ? Symbol.iterator : null;\n\n\n// EXPORTS //\n\nexport default IteratorSymbol;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport defineProperty from '@stdlib/utils-define-property';\n\n\n// MAIN //\n\n/**\n* Defines a non-enumerable read-only accessor.\n*\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {Function} getter - accessor\n*\n* @example\n* function getter() {\n* return 'bar';\n* }\n*\n* var obj = {};\n*\n* setNonEnumerableReadOnlyAccessor( obj, 'foo', getter );\n*\n* try {\n* obj.foo = 'boop';\n* } catch ( err ) {\n* console.error( err.message );\n* }\n*/\nfunction setNonEnumerableReadOnlyAccessor( obj, prop, getter ) { // eslint-disable-line id-length\n\tdefineProperty( obj, prop, {\n\t\t'configurable': false,\n\t\t'enumerable': false,\n\t\t'get': getter\n\t});\n}\n\n\n// EXPORTS //\n\nexport default setNonEnumerableReadOnlyAccessor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the real component of a single-precision complex floating-point number.\n*\n* @param {Complex} z - complex number\n* @returns {number} real component\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var re = real( z );\n* // returns 5.0\n*/\nfunction real( z ) {\n\treturn z.re;\n}\n\n\n// EXPORTS //\n\nexport default real;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the imaginary component of a single-precision complex floating-point number.\n*\n* @param {Complex} z - complex number\n* @returns {number} imaginary component\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var im = imag( z );\n* // returns 3.0\n*/\nfunction imag( z ) {\n\treturn z.im;\n}\n\n\n// EXPORTS //\n\nexport default imag;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Float32Array from '@stdlib/array-float32';\n\n\n// MAIN //\n\n/**\n* Reinterprets a `Complex64Array` as a `Float32Array`.\n*\n* @param {Complex64Array} x - input array\n* @param {NonNegativeInteger} offset - starting index\n* @returns {Float32Array} `Float32Array` view\n*\n* @example\n* import Complex64Array from '@stdlib/array-complex64';\n*\n* var x = new Complex64Array( 10 );\n*\n* var out = reinterpret( x, 0 );\n* // returns \n*\n* var bool = ( out.buffer === x.buffer );\n* // returns true\n*/\nfunction reinterpret( x, offset ) {\n\treturn new Float32Array( x.buffer, x.byteOffset+(x.BYTES_PER_ELEMENT*offset), 2*(x.length-offset) ); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nexport default reinterpret;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Float64Array from '@stdlib/array-float64';\n\n\n// MAIN //\n\n/**\n* Reinterprets a `Complex128Array` as a `Float64Array`.\n*\n* @param {Complex128Array} x - input array\n* @param {NonNegativeInteger} offset - starting index\n* @returns {Float64Array} `Float64Array` view\n*\n* @example\n* import Complex128Array from '@stdlib/array-complex128';\n*\n* var x = new Complex128Array( 10 );\n*\n* var out = reinterpret( x, 0 );\n* // returns \n*\n* var bool = ( out.buffer === x.buffer );\n* // returns true\n*/\nfunction reinterpret( x, offset ) {\n\treturn new Float64Array( x.buffer, x.byteOffset+(x.BYTES_PER_ELEMENT*offset), 2*(x.length-offset) ); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nexport default reinterpret;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArrayLikeObject from '@stdlib/assert-is-array-like-object';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport realf from '@stdlib/complex-float32-real';\nimport imagf from '@stdlib/complex-float32-imag';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @returns {(Array|TypeError)} array or an error\n*/\nfunction fromIterator( it ) {\n\tvar out;\n\tvar v;\n\tvar z;\n\n\tout = [];\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\tz = v.value;\n\t\tif ( isArrayLikeObject( z ) && z.length >= 2 ) {\n\t\t\tout.push( z[ 0 ], z[ 1 ] );\n\t\t} else if ( isComplexLike( z ) ) {\n\t\t\tout.push( realf( z ), imagf( z ) );\n\t\t} else {\n\t\t\treturn new TypeError( format( 'invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', z ) );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default fromIterator;\n","/* eslint-disable no-restricted-syntax, max-lines, no-invalid-this */\n\n/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\nimport isArrayLikeObject from '@stdlib/assert-is-array-like-object';\nimport isCollection from '@stdlib/assert-is-collection';\nimport isArrayBuffer from '@stdlib/assert-is-arraybuffer';\nimport isObject from '@stdlib/assert-is-object';\nimport isArray from '@stdlib/assert-is-array';\nimport { primitives as isStringArray } from '@stdlib/assert-is-string-array';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport isFunction from '@stdlib/assert-is-function';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport isEven from '@stdlib/math-base-assert-is-even';\nimport isInteger from '@stdlib/math-base-assert-is-integer';\nimport isComplex64Array from '@stdlib/array-base-assert-is-complex64array';\nimport isComplex128Array from '@stdlib/array-base-assert-is-complex128array';\nimport hasIteratorSymbolSupport from '@stdlib/assert-has-iterator-symbol-support';\nimport ITERATOR_SYMBOL from '@stdlib/symbol-iterator';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport setReadOnlyAccessor from '@stdlib/utils-define-nonenumerable-read-only-accessor';\nimport Float32Array from '@stdlib/array-float32';\nimport Complex64 from '@stdlib/complex-float32-ctor';\nimport format from '@stdlib/string-format';\nimport realf from '@stdlib/complex-float32-real';\nimport imagf from '@stdlib/complex-float32-imag';\nimport floor from '@stdlib/math-base-special-floor';\nimport reinterpret64 from '@stdlib/strided-base-reinterpret-complex64';\nimport reinterpret128 from '@stdlib/strided-base-reinterpret-complex128';\nimport getter from '@stdlib/array-base-getter';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport fromIterator from './from_iterator.js';\nimport fromIteratorMap from './from_iterator_map.js';\nimport fromArray from './from_array.js';\n\n\n// VARIABLES //\n\nvar BYTES_PER_ELEMENT = Float32Array.BYTES_PER_ELEMENT * 2;\nvar HAS_ITERATOR_SYMBOL = hasIteratorSymbolSupport();\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating if a value is a complex typed array.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex typed array\n*/\nfunction isComplexArray( value ) {\n\treturn (\n\t\tvalue instanceof Complex64Array ||\n\t\t(\n\t\t\ttypeof value === 'object' &&\n\t\t\tvalue !== null &&\n\t\t\t(\n\t\t\t\tvalue.constructor.name === 'Complex64Array' ||\n\t\t\t\tvalue.constructor.name === 'Complex128Array'\n\t\t\t) &&\n\t\t\ttypeof value._length === 'number' && // eslint-disable-line no-underscore-dangle\n\n\t\t\t// NOTE: we don't perform a more rigorous test here for a typed array for performance reasons, as robustly checking for a typed array instance could require walking the prototype tree and performing relatively expensive constructor checks...\n\t\t\ttypeof value._buffer === 'object' // eslint-disable-line no-underscore-dangle\n\t\t)\n\t);\n}\n\n/**\n* Returns a boolean indicating if a value is a complex typed array constructor.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex typed array constructor\n*/\nfunction isComplexArrayConstructor( value ) {\n\treturn (\n\t\tvalue === Complex64Array ||\n\n\t\t// NOTE: weaker test in order to avoid a circular dependency with Complex128Array...\n\t\tvalue.name === 'Complex128Array'\n\t);\n}\n\n/**\n* Retrieves a complex number from a complex number array buffer.\n*\n* @private\n* @param {Float32Array} buf - array buffer\n* @param {NonNegativeInteger} idx - element index\n* @returns {Complex64} complex number\n*/\nfunction getComplex64( buf, idx ) {\n\tidx *= 2;\n\treturn new Complex64( buf[ idx ], buf[ idx+1 ] );\n}\n\n\n// MAIN //\n\n/**\n* 64-bit complex number array constructor.\n*\n* @constructor\n* @param {(NonNegativeInteger|Collection|ArrayBuffer|Iterable)} [arg] - length, typed array, array-like object, buffer, or an iterable\n* @param {NonNegativeInteger} [byteOffset=0] - byte offset\n* @param {NonNegativeInteger} [length] - view length\n* @throws {RangeError} ArrayBuffer byte length must be a multiple of `8`\n* @throws {RangeError} array-like object and typed array input arguments must have a length which is a multiple of two\n* @throws {TypeError} if provided only a single argument, must provide a valid argument\n* @throws {TypeError} byte offset must be a nonnegative integer\n* @throws {RangeError} byte offset must be a multiple of `8`\n* @throws {TypeError} view length must be a positive multiple of `8`\n* @throws {RangeError} must provide sufficient memory to accommodate byte offset and view length requirements\n* @throws {TypeError} an iterator must return either a two element array containing real and imaginary components or a complex number\n* @returns {Complex64Array} complex number array\n*\n* @example\n* var arr = new Complex64Array();\n* // returns \n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var arr = new Complex64Array( 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var arr = new Complex64Array( [ 1.0, -1.0 ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = new Complex64Array( buf );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = new Complex64Array( buf, 8 );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new Complex64Array( buf, 8, 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*/\nfunction Complex64Array() {\n\tvar byteOffset;\n\tvar nargs;\n\tvar buf;\n\tvar len;\n\n\tnargs = arguments.length;\n\tif ( !(this instanceof Complex64Array) ) {\n\t\tif ( nargs === 0 ) {\n\t\t\treturn new Complex64Array();\n\t\t}\n\t\tif ( nargs === 1 ) {\n\t\t\treturn new Complex64Array( arguments[0] );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\treturn new Complex64Array( arguments[0], arguments[1] );\n\t\t}\n\t\treturn new Complex64Array( arguments[0], arguments[1], arguments[2] );\n\t}\n\t// Create the underlying data buffer...\n\tif ( nargs === 0 ) {\n\t\tbuf = new Float32Array( 0 ); // backward-compatibility\n\t} else if ( nargs === 1 ) {\n\t\tif ( isNonNegativeInteger( arguments[0] ) ) {\n\t\t\tbuf = new Float32Array( arguments[0]*2 );\n\t\t} else if ( isCollection( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tlen = buf.length;\n\n\t\t\t// If provided a \"generic\" array, peak at the first value, and, if the value is a complex number, try to process as an array of complex numbers, falling back to \"normal\" typed array initialization if we fail and ensuring consistency if the first value had not been a complex number...\n\t\t\tif ( len && isArray( buf ) && isComplexLike( buf[0] ) ) {\n\t\t\t\tbuf = fromArray( new Float32Array( len*2 ), buf );\n\t\t\t\tif ( buf === null ) {\n\t\t\t\t\t// We failed and we are now forced to allocate a new array :-(\n\t\t\t\t\tif ( !isEven( len ) ) {\n\t\t\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t\t}\n\t\t\t\t\t// We failed, so fall back to directly setting values...\n\t\t\t\t\tbuf = new Float32Array( arguments[0] );\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif ( isComplex64Array( buf ) ) {\n\t\t\t\t\tbuf = reinterpret64( buf, 0 );\n\t\t\t\t} else if ( isComplex128Array( buf ) ) {\n\t\t\t\t\tbuf = reinterpret128( buf, 0 );\n\t\t\t\t} else if ( !isEven( len ) ) {\n\t\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object and typed array arguments must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t}\n\t\t\t\tbuf = new Float32Array( buf );\n\t\t\t}\n\t\t} else if ( isArrayBuffer( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tif ( !isInteger( buf.byteLength/BYTES_PER_ELEMENT ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. ArrayBuffer byte length must be a multiple of %u. Byte length: `%u`.', BYTES_PER_ELEMENT, buf.byteLength ) );\n\t\t\t}\n\t\t\tbuf = new Float32Array( buf );\n\t\t} else if ( isObject( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tif ( HAS_ITERATOR_SYMBOL === false ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tif ( !isFunction( buf[ ITERATOR_SYMBOL ] ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tbuf = buf[ ITERATOR_SYMBOL ]();\n\t\t\tif ( !isFunction( buf.next ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', buf ) ); // FIXME: `buf` is what is returned from above, NOT the original value\n\t\t\t}\n\t\t\tbuf = fromIterator( buf );\n\t\t\tif ( buf instanceof Error ) {\n\t\t\t\tthrow buf;\n\t\t\t}\n\t\t\tbuf = new Float32Array( buf );\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arguments[0] ) );\n\t\t}\n\t} else {\n\t\tbuf = arguments[ 0 ];\n\t\tif ( !isArrayBuffer( buf ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an ArrayBuffer. Value: `%s`.', buf ) );\n\t\t}\n\t\tbyteOffset = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( byteOffset ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.', byteOffset ) );\n\t\t}\n\t\tif ( !isInteger( byteOffset/BYTES_PER_ELEMENT ) ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Byte offset must be a multiple of %u. Value: `%u`.', BYTES_PER_ELEMENT, byteOffset ) );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\tlen = buf.byteLength - byteOffset;\n\t\t\tif ( !isInteger( len/BYTES_PER_ELEMENT ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid arguments. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.', BYTES_PER_ELEMENT, len ) );\n\t\t\t}\n\t\t\tbuf = new Float32Array( buf, byteOffset );\n\t\t} else {\n\t\t\tlen = arguments[ 2 ];\n\t\t\tif ( !isNonNegativeInteger( len ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Length must be a nonnegative integer. Value: `%s`.', len ) );\n\t\t\t}\n\t\t\tif ( (len*BYTES_PER_ELEMENT) > (buf.byteLength-byteOffset) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.', len*BYTES_PER_ELEMENT ) );\n\t\t\t}\n\t\t\tbuf = new Float32Array( buf, byteOffset, len*2 );\n\t\t}\n\t}\n\tsetReadOnly( this, '_buffer', buf );\n\tsetReadOnly( this, '_length', buf.length/2 );\n\n\treturn this;\n}\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex64Array\n* @readonly\n* @type {PositiveInteger}\n* @default 8\n*\n* @example\n* var nbytes = Complex64Array.BYTES_PER_ELEMENT;\n* // returns 8\n*/\nsetReadOnly( Complex64Array, 'BYTES_PER_ELEMENT', BYTES_PER_ELEMENT );\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof Complex64Array\n* @readonly\n* @type {string}\n* @default 'Complex64Array'\n*\n* @example\n* var str = Complex64Array.name;\n* // returns 'Complex64Array'\n*/\nsetReadOnly( Complex64Array, 'name', 'Complex64Array' );\n\n/**\n* Creates a new 64-bit complex number array from an array-like object or an iterable.\n*\n* @name from\n* @memberof Complex64Array\n* @type {Function}\n* @param {(Collection|Iterable)} src - array-like object or iterable\n* @param {Function} [clbk] - callback to invoke for each source element\n* @param {*} [thisArg] - context\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an array-like object or an iterable\n* @throws {TypeError} second argument must be a function\n* @throws {RangeError} array-like objects must have a length which is a multiple of two\n* @throws {TypeError} an iterator must return either a two element array containing real and imaginary components or a complex number\n* @throws {TypeError} when provided an iterator, a callback must return either a two element array containing real and imaginary components or a complex number\n* @returns {Complex64Array} 64-bit complex number array\n*\n* @example\n* var arr = Complex64Array.from( [ 1.0, -1.0 ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var arr = Complex64Array.from( [ new Complex64( 1.0, 1.0 ) ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* function clbk( v ) {\n* return new Complex64( realf(v)*2.0, imagf(v)*2.0 );\n* }\n*\n* var arr = Complex64Array.from( [ new Complex64( 1.0, 1.0 ) ], clbk );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*/\nsetReadOnly( Complex64Array, 'from', function from( src ) {\n\tvar thisArg;\n\tvar nargs;\n\tvar clbk;\n\tvar out;\n\tvar buf;\n\tvar tmp;\n\tvar get;\n\tvar len;\n\tvar flg;\n\tvar v;\n\tvar i;\n\tvar j;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isComplexArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tnargs = arguments.length;\n\tif ( nargs > 1 ) {\n\t\tclbk = arguments[ 1 ];\n\t\tif ( !isFunction( clbk ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a function. Value: `%s`.', clbk ) );\n\t\t}\n\t\tif ( nargs > 2 ) {\n\t\t\tthisArg = arguments[ 2 ];\n\t\t}\n\t}\n\tif ( isComplexArray( src ) ) {\n\t\tlen = src.length;\n\t\tif ( clbk ) {\n\t\t\tout = new this( len );\n\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tv = clbk.call( thisArg, src.get( i ), i );\n\t\t\t\tif ( isComplexLike( v ) ) {\n\t\t\t\t\tbuf[ j ] = realf( v );\n\t\t\t\t\tbuf[ j+1 ] = imagf( v );\n\t\t\t\t} else if ( isArrayLikeObject( v ) && v.length >= 2 ) {\n\t\t\t\t\tbuf[ j ] = v[ 0 ];\n\t\t\t\t\tbuf[ j+1 ] = v[ 1 ];\n\t\t\t\t} else {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t\t\t}\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\treturn new this( src );\n\t}\n\tif ( isCollection( src ) ) {\n\t\tif ( clbk ) {\n\t\t\t// Note: array contents affect how we iterate over a provided data source. If only complex number objects, we can extract real and imaginary components. Otherwise, for non-complex number arrays (e.g., `Float64Array`, etc), we assume a strided array where real and imaginary components are interleaved. In the former case, we expect a callback to return real and imaginary components (possibly as a complex number). In the latter case, we expect a callback to return *either* a real or imaginary component.\n\n\t\t\tlen = src.length;\n\t\t\tif ( src.get && src.set ) {\n\t\t\t\tget = accessorGetter( 'default' );\n\t\t\t} else {\n\t\t\t\tget = getter( 'default' );\n\t\t\t}\n\t\t\t// Detect whether we've been provided an array which returns complex number objects...\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tif ( !isComplexLike( get( src, i ) ) ) {\n\t\t\t\t\tflg = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// If an array does not contain only complex number objects, then we assume interleaved real and imaginary components...\n\t\t\tif ( flg ) {\n\t\t\t\tif ( !isEven( len ) ) {\n\t\t\t\t\tthrow new RangeError( format( 'invalid argument. First argument must have a length which is a multiple of %u. Length: `%u`.', 2, len ) );\n\t\t\t\t}\n\t\t\t\tout = new this( len/2 );\n\t\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\t\tbuf[ i ] = clbk.call( thisArg, get( src, i ), i );\n\t\t\t\t}\n\t\t\t\treturn out;\n\t\t\t}\n\t\t\t// If an array contains only complex number objects, then we need to extract real and imaginary components...\n\t\t\tout = new this( len );\n\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tv = clbk.call( thisArg, get( src, i ), i );\n\t\t\t\tif ( isComplexLike( v ) ) {\n\t\t\t\t\tbuf[ j ] = realf( v );\n\t\t\t\t\tbuf[ j+1 ] = imagf( v );\n\t\t\t\t} else if ( isArrayLikeObject( v ) && v.length >= 2 ) {\n\t\t\t\t\tbuf[ j ] = v[ 0 ];\n\t\t\t\t\tbuf[ j+1 ] = v[ 1 ];\n\t\t\t\t} else {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t\t\t}\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\treturn new this( src );\n\t}\n\tif ( isObject( src ) && HAS_ITERATOR_SYMBOL && isFunction( src[ ITERATOR_SYMBOL ] ) ) { // eslint-disable-line max-len\n\t\tbuf = src[ ITERATOR_SYMBOL ]();\n\t\tif ( !isFunction( buf.next ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n\t\t}\n\t\tif ( clbk ) {\n\t\t\ttmp = fromIteratorMap( buf, clbk, thisArg );\n\t\t} else {\n\t\t\ttmp = fromIterator( buf );\n\t\t}\n\t\tif ( tmp instanceof Error ) {\n\t\t\tthrow tmp;\n\t\t}\n\t\tlen = tmp.length / 2;\n\t\tout = new this( len );\n\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tbuf[ i ] = tmp[ i ];\n\t\t}\n\t\treturn out;\n\t}\n\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n});\n\n/**\n* Creates a new 64-bit complex number array from a variable number of arguments.\n*\n* @name of\n* @memberof Complex64Array\n* @type {Function}\n* @param {...*} element - array elements\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex64Array} 64-bit complex number array\n*\n* @example\n* var arr = Complex64Array.of( 1.0, 1.0, 1.0, 1.0 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*/\nsetReadOnly( Complex64Array, 'of', function of() {\n\tvar args;\n\tvar i;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isComplexArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\targs = [];\n\tfor ( i = 0; i < arguments.length; i++ ) {\n\t\targs.push( arguments[ i ] );\n\t}\n\treturn new this( args );\n});\n\n/**\n* Returns an array element with support for both nonnegative and negative integer indices.\n*\n* @name at\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} idx - element index\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} must provide an integer\n* @returns {(Complex64|void)} array element\n*\n* @example\n* var arr = new Complex64Array( 10 );\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* var z = arr.at( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 0.0\n*\n* var im = imagf( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 9.0, -9.0 ], 9 );\n*\n* z = arr.at( 0 );\n* // returns \n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns -1.0\n*\n* z = arr.at( -1 );\n* // returns \n*\n* re = realf( z );\n* // returns 9.0\n*\n* im = imagf( z );\n* // returns -9.0\n*\n* z = arr.at( 100 );\n* // returns undefined\n*\n* z = arr.at( -100 );\n* // returns undefined\n*/\nsetReadOnly( Complex64Array.prototype, 'at', function at( idx ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an integer. Value: `%s`.', idx ) );\n\t}\n\tif ( idx < 0 ) {\n\t\tidx += this._length;\n\t}\n\tif ( idx < 0 || idx >= this._length ) {\n\t\treturn;\n\t}\n\treturn getComplex64( this._buffer, idx );\n});\n\n/**\n* Pointer to the underlying data buffer.\n*\n* @name buffer\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {ArrayBuffer}\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var buf = arr.buffer;\n* // returns \n*/\nsetReadOnlyAccessor( Complex64Array.prototype, 'buffer', function get() {\n\treturn this._buffer.buffer;\n});\n\n/**\n* Size (in bytes) of the array.\n*\n* @name byteLength\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var byteLength = arr.byteLength;\n* // returns 80\n*/\nsetReadOnlyAccessor( Complex64Array.prototype, 'byteLength', function get() {\n\treturn this._buffer.byteLength;\n});\n\n/**\n* Offset (in bytes) of the array from the start of its underlying `ArrayBuffer`.\n*\n* @name byteOffset\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var byteOffset = arr.byteOffset;\n* // returns 0\n*/\nsetReadOnlyAccessor( Complex64Array.prototype, 'byteOffset', function get() {\n\treturn this._buffer.byteOffset;\n});\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {PositiveInteger}\n* @default 8\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var nbytes = arr.BYTES_PER_ELEMENT;\n* // returns 8\n*/\nsetReadOnly( Complex64Array.prototype, 'BYTES_PER_ELEMENT', Complex64Array.BYTES_PER_ELEMENT );\n\n/**\n* Copies a sequence of elements within the array to the position starting at `target`.\n*\n* @name copyWithin\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} target - index at which to start copying elements\n* @param {integer} start - source index at which to copy elements from\n* @param {integer} [end] - source index at which to stop copying elements from\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex64Array} modified array\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* var arr = new Complex64Array( 4 );\n*\n* // Set the array elements:\n* arr.set( new Complex64( 1.0, 1.0 ), 0 );\n* arr.set( new Complex64( 2.0, 2.0 ), 1 );\n* arr.set( new Complex64( 3.0, 3.0 ), 2 );\n* arr.set( new Complex64( 4.0, 4.0 ), 3 );\n*\n* // Copy the first two elements to the last two elements:\n* arr.copyWithin( 2, 0, 2 );\n*\n* // Get the last array element:\n* var z = arr.get( 3 );\n*\n* var re = realf( z );\n* // returns 2.0\n*\n* var im = imagf( z );\n* // returns 2.0\n*/\nsetReadOnly( Complex64Array.prototype, 'copyWithin', function copyWithin( target, start ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\t// FIXME: prefer a functional `copyWithin` implementation which addresses lack of universal browser support (e.g., IE11 and Safari) or ensure that typed arrays are polyfilled\n\tif ( arguments.length === 2 ) {\n\t\tthis._buffer.copyWithin( target*2, start*2 );\n\t} else {\n\t\tthis._buffer.copyWithin( target*2, start*2, arguments[2]*2 );\n\t}\n\treturn this;\n});\n\n/**\n* Returns an iterator for iterating over array key-value pairs.\n*\n* @name entries\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Iterator} iterator\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var arr = [\n* new Complex64( 1.0, 1.0 ),\n* new Complex64( 2.0, 2.0 ),\n* new Complex64( 3.0, 3.0 )\n* ];\n* arr = new Complex64Array( arr );\n*\n* // Create an iterator:\n* var it = arr.entries();\n*\n* // Iterate over the key-value pairs...\n* var v = it.next().value;\n* // returns [ 0, ]\n*\n* v = it.next().value;\n* // returns [ 1, ]\n*\n* v = it.next().value;\n* // returns [ 2, ]\n*\n* var bool = it.next().done;\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'entries', function entries() {\n\tvar self;\n\tvar iter;\n\tvar len;\n\tvar buf;\n\tvar FLG;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tself = this;\n\tbuf = this._buffer;\n\tlen = this._length;\n\n\t// Initialize an iteration index:\n\ti = -1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': [ i, getComplex64( buf, i ) ],\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.entries();\n\t}\n});\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @name every\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var bool = arr.every( predicate );\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'every', function every( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( !predicate.call( thisArg, getComplex64( buf, i ), i, this ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n});\n\n/**\n* Returns a modified typed array filled with a fill value.\n*\n* @name fill\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {ComplexLike} value - fill value\n* @param {integer} [start=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @throws {TypeError} third argument must be an integer\n* @returns {Complex64Array} modified array\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.fill( new Complex64( 1.0, 1.0 ), 1 );\n*\n* var z = arr.get( 1 );\n* // returns \n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns 1.0\n*\n* z = arr.get( 2 );\n* // returns \n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'fill', function fill( value, start, end ) {\n\tvar buf;\n\tvar len;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', value ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( start ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', start ) );\n\t\t}\n\t\tif ( start < 0 ) {\n\t\t\tstart += len;\n\t\t\tif ( start < 0 ) {\n\t\t\t\tstart = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length > 2 ) {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t} else {\n\t\t\tend = len;\n\t\t}\n\t} else {\n\t\tstart = 0;\n\t\tend = len;\n\t}\n\tre = realf( value );\n\tim = imagf( value );\n\tfor ( i = start; i < end; i++ ) {\n\t\tidx = 2*i;\n\t\tbuf[ idx ] = re;\n\t\tbuf[ idx+1 ] = im;\n\t}\n\treturn this;\n});\n\n/**\n* Returns a new array containing the elements of an array which pass a test implemented by a predicate function.\n*\n* @name filter\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex64Array} complex number array\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var out = arr.filter( predicate );\n* // returns \n*\n* var len = out.length;\n* // returns 1\n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 2.0\n*\n* var im = imagf( z );\n* // returns 2.0\n*/\nsetReadOnly( Complex64Array.prototype, 'filter', function filter( predicate, thisArg ) {\n\tvar buf;\n\tvar out;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tout = [];\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\tout.push( z );\n\t\t}\n\t}\n\treturn new this.constructor( out );\n});\n\n/**\n* Returns the first element in an array for which a predicate function returns a truthy value.\n*\n* @name find\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {(Complex64|void)} array element or undefined\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.find( predicate );\n* // returns \n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'find', function find( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn z;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the first element in an array for which a predicate function returns a truthy value.\n*\n* @name findIndex\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var idx = arr.findIndex( predicate );\n* // returns 2\n*/\nsetReadOnly( Complex64Array.prototype, 'findIndex', function findIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLast\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {(Complex64|void)} array element or undefined\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.findLast( predicate );\n* // returns \n*\n* var re = realf( z );\n* // returns 3.0\n*\n* var im = imagf( z );\n* // returns 3.0\n*/\nsetReadOnly( Complex64Array.prototype, 'findLast', function findLast( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn z;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLastIndex\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var idx = arr.findLastIndex( predicate );\n* // returns 1\n*/\nsetReadOnly( Complex64Array.prototype, 'findLastIndex', function findLastIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Invokes a function once for each array element.\n*\n* @name forEach\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} fcn - function to invoke\n* @param {*} [thisArg] - function invocation context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* function log( v, i ) {\n* console.log( '%s: %s', i, v.toString() );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* arr.forEach( log );\n*/\nsetReadOnly( Complex64Array.prototype, 'forEach', function forEach( fcn, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex64( buf, i );\n\t\tfcn.call( thisArg, z, i, this );\n\t}\n});\n\n/**\n* Returns an array element.\n*\n* @name get\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {NonNegativeInteger} idx - element index\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} must provide a nonnegative integer\n* @returns {(Complex64|void)} array element\n*\n* @example\n* var arr = new Complex64Array( 10 );\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* var z = arr.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 0.0\n*\n* var im = imagf( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n*\n* z = arr.get( 0 );\n* // returns \n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns -1.0\n*\n* z = arr.get( 100 );\n* // returns undefined\n*/\nsetReadOnly( Complex64Array.prototype, 'get', function get( idx ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isNonNegativeInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a nonnegative integer. Value: `%s`.', idx ) );\n\t}\n\tif ( idx >= this._length ) {\n\t\treturn;\n\t}\n\treturn getComplex64( this._buffer, idx );\n});\n\n/**\n* Returns a boolean indicating whether an array includes a provided value.\n*\n* @name includes\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - search element\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {boolean} boolean indicating whether an array includes a provided value\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var arr = new Complex64Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var bool = arr.includes( new Complex64( 3.0, -3.0 ) );\n* // returns true\n*\n* bool = arr.includes( new Complex64( 3.0, -3.0 ), 3 );\n* // returns false\n*\n* bool = arr.includes( new Complex64( 4.0, -4.0 ), -3 );\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'includes', function includes( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tre = realf( searchElement );\n\tim = imagf( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Returns the first index at which a given element can be found.\n*\n* @name indexOf\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - element to find\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var arr = new Complex64Array( 10 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var idx = arr.indexOf( new Complex64( 3.0, -3.0 ) );\n* // returns 2\n*\n* idx = arr.indexOf( new Complex64( 3.0, -3.0 ), 3 );\n* // returns -1\n*\n* idx = arr.indexOf( new Complex64( 4.0, -4.0 ), -3 );\n* // returns -1\n*/\nsetReadOnly( Complex64Array.prototype, 'indexOf', function indexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tre = realf( searchElement );\n\tim = imagf( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns a new string by concatenating all array elements.\n*\n* @name join\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {string} [separator=','] - element separator\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a string\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex64Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.join();\n* // returns '1 + 1i,2 + 2i'\n*\n* str = arr.join( '/' );\n* // returns '1 + 1i/2 + 2i'\n*/\nsetReadOnly( Complex64Array.prototype, 'join', function join( separator ) {\n\tvar out;\n\tvar buf;\n\tvar sep;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( arguments.length === 0 ) {\n\t\tsep = ',';\n\t} else if ( isString( separator ) ) {\n\t\tsep = separator;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string. Value: `%s`.', separator ) );\n\t}\n\tout = [];\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex64( buf, i ).toString() );\n\t}\n\treturn out.join( sep );\n});\n\n/**\n* Returns an iterator for iterating over each index key in a typed array.\n*\n* @name keys\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Iterator} iterator\n*\n* @example\n* var arr = new Complex64Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var iter = arr.keys();\n*\n* var v = iter.next().value;\n* // returns 0\n*\n* v = iter.next().value;\n* // returns 1\n*\n* var bool = iter.next().done;\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'keys', function keys() {\n\tvar self;\n\tvar iter;\n\tvar len;\n\tvar FLG;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tself = this;\n\tlen = this._length;\n\n\t// Initialize an iteration index:\n\ti = -1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': i,\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.keys();\n\t}\n});\n\n/**\n* Returns the last index at which a given element can be found.\n*\n* @name lastIndexOf\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - element to find\n* @param {integer} [fromIndex] - index at which to start searching backward (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var arr = new Complex64Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 3.0, -3.0 ], 4 );\n*\n* var idx = arr.lastIndexOf( new Complex64( 3.0, -3.0 ) );\n* // returns 4\n*\n* idx = arr.lastIndexOf( new Complex64( 3.0, -3.0 ), 3 );\n* // returns 2\n*\n* idx = arr.lastIndexOf( new Complex64( 5.0, -5.0 ), 3 );\n* // returns -1\n*\n* idx = arr.lastIndexOf( new Complex64( 2.0, -2.0 ), -3 );\n* // returns 1\n*/\nsetReadOnly( Complex64Array.prototype, 'lastIndexOf', function lastIndexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex >= this._length ) {\n\t\t\tfromIndex = this._length - 1;\n\t\t} else if ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t}\n\t} else {\n\t\tfromIndex = this._length - 1;\n\t}\n\tre = realf( searchElement );\n\tim = imagf( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i >= 0; i-- ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Number of array elements.\n*\n* @name length\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var len = arr.length;\n* // returns 10\n*/\nsetReadOnlyAccessor( Complex64Array.prototype, 'length', function get() {\n\treturn this._length;\n});\n\n/**\n* Returns a new array with each element being the result of a provided callback function.\n*\n* @name map\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} fcn - callback function\n* @param {*} [thisArg] - callback function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex64Array} complex number array\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* function scale( v, i ) {\n* return new Complex64( 2.0*realf( v ), 2.0*imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var out = arr.map( scale );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 2\n*\n* var im = imagf( z );\n* // returns -2\n*/\nsetReadOnly( Complex64Array.prototype, 'map', function map( fcn, thisArg ) {\n\tvar outbuf;\n\tvar buf;\n\tvar out;\n\tvar i;\n\tvar v;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\tbuf = this._buffer;\n\tout = new this.constructor( this._length );\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tv = fcn.call( thisArg, getComplex64( buf, i ), i, this );\n\t\tif ( isComplexLike( v ) ) {\n\t\t\toutbuf[ 2*i ] = realf( v );\n\t\t\toutbuf[ (2*i)+1 ] = imagf( v );\n\t\t} else if ( isArrayLikeObject( v ) && v.length === 2 ) {\n\t\t\toutbuf[ 2*i ] = v[ 0 ];\n\t\t\toutbuf[ (2*i)+1 ] = v[ 1 ];\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t}\n\t}\n\treturn out;\n});\n\n/**\n* Applies a provided callback function to each element of the array, in order, passing in the return value from the calculation on the preceding element and returning the accumulated result upon completion.\n*\n* @name reduce\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} reducer - callback function\n* @param {*} [initialValue] - initial value\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @throws {Error} if not provided an initial value, the array must have at least one element\n* @returns {*} accumulated result\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n* import caddf from '@stdlib/complex-float32-base-add';\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.reduce( caddf );\n* // returns \n*\n* var re = realf( z );\n* // returns 6.0\n*\n* var im = imagf( z );\n* // returns 6.0\n*/\nsetReadOnly( Complex64Array.prototype, 'reduce', function reduce( reducer, initialValue ) {\n\tvar buf;\n\tvar acc;\n\tvar len;\n\tvar v;\n\tvar i;\n\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( reducer ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', reducer ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tacc = initialValue;\n\t\ti = 0;\n\t} else {\n\t\tif ( len === 0 ) {\n\t\t\tthrow new Error( 'invalid operation. If not provided an initial value, an array must contain at least one element.' );\n\t\t}\n\t\tacc = getComplex64( buf, 0 );\n\t\ti = 1;\n\t}\n\tfor ( ; i < len; i++ ) {\n\t\tv = getComplex64( buf, i );\n\t\tacc = reducer( acc, v, i, this );\n\t}\n\treturn acc;\n});\n\n/**\n* Applies a provided callback function to each element of the array, in reverse order, passing in the return value from the calculation on the preceding element and returning the accumulated result upon completion.\n*\n* @name reduceRight\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} reducer - callback function\n* @param {*} [initialValue] - initial value\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @throws {Error} if not provided an initial value, the array must have at least one element\n* @returns {*} accumulated result\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n* import caddf from '@stdlib/complex-float32-base-add';\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.reduceRight( caddf );\n* // returns \n*\n* var re = realf( z );\n* // returns 6.0\n*\n* var im = imagf( z );\n* // returns 6.0\n*/\nsetReadOnly( Complex64Array.prototype, 'reduceRight', function reduceRight( reducer, initialValue ) {\n\tvar buf;\n\tvar acc;\n\tvar len;\n\tvar v;\n\tvar i;\n\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( reducer ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', reducer ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tacc = initialValue;\n\t\ti = len-1;\n\t} else {\n\t\tif ( len === 0 ) {\n\t\t\tthrow new Error( 'invalid operation. If not provided an initial value, an array must contain at least one element.' );\n\t\t}\n\t\tacc = getComplex64( buf, len-1 );\n\t\ti = len-2;\n\t}\n\tfor ( ; i >= 0; i-- ) {\n\t\tv = getComplex64( buf, i );\n\t\tacc = reducer( acc, v, i, this );\n\t}\n\treturn acc;\n});\n\n/**\n* Reverses an array in-place.\n*\n* @name reverse\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex64Array} reversed array\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.reverse();\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 3.0\n*\n* var im = imagf( z );\n* // returns 3.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns 2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'reverse', function reverse() {\n\tvar buf;\n\tvar tmp;\n\tvar len;\n\tvar N;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tlen = this._length;\n\tbuf = this._buffer;\n\tN = floor( len / 2 );\n\tfor ( i = 0; i < N; i++ ) {\n\t\tj = len - i - 1;\n\t\ttmp = buf[ (2*i) ];\n\t\tbuf[ (2*i) ] = buf[ (2*j) ];\n\t\tbuf[ (2*j) ] = tmp;\n\t\ttmp = buf[ (2*i)+1 ];\n\t\tbuf[ (2*i)+1 ] = buf[ (2*j)+1 ];\n\t\tbuf[ (2*j)+1 ] = tmp;\n\t}\n\treturn this;\n});\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* - When provided a typed array, real or complex, we must check whether the source array shares the same buffer as the target array and whether the underlying memory overlaps. In particular, we are concerned with the following scenario:\n*\n* ```text\n* buf: ---------------------\n* src: ---------------------\n* ```\n*\n* In the above, as we copy values from `src`, we will overwrite values in the `src` view, resulting in duplicated values copied into the end of `buf`, which is not intended. Hence, to avoid overwriting source values, we must **copy** source values to a temporary array.\n*\n* In the other overlapping scenario,\n*\n* ```text\n* buf: ---------------------\n* src: ---------------------\n* ```\n*\n* by the time we begin copying into the overlapping region, we are copying from the end of `src`, a non-overlapping region, which means we don't run the risk of copying copied values, rather than the original `src` values, as intended.\n*\n* @name set\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n* @param {NonNegativeInteger} [i=0] - element index at which to start writing values\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be either a complex number, an array-like object, or a complex number array\n* @throws {TypeError} index argument must be a nonnegative integer\n* @throws {RangeError} array-like objects must have a length which is a multiple of two\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {RangeError} target array lacks sufficient storage to accommodate source values\n* @returns {void}\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* var arr = new Complex64Array( 10 );\n*\n* var z = arr.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 0.0\n*\n* var im = imagf( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n*\n* z = arr.get( 0 );\n* // returns \n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns -1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'set', function set( value ) {\n\t/* eslint-disable no-underscore-dangle */\n\tvar sbuf;\n\tvar idx;\n\tvar buf;\n\tvar tmp;\n\tvar flg;\n\tvar N;\n\tvar v;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tif ( arguments.length > 1 ) {\n\t\tidx = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( idx ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Index argument must be a nonnegative integer. Value: `%s`.', idx ) );\n\t\t}\n\t} else {\n\t\tidx = 0;\n\t}\n\tif ( isComplexLike( value ) ) {\n\t\tif ( idx >= this._length ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%u`.', idx ) );\n\t\t}\n\t\tidx *= 2;\n\t\tbuf[ idx ] = realf( value );\n\t\tbuf[ idx+1 ] = imagf( value );\n\t\treturn;\n\t}\n\tif ( isComplexArray( value ) ) {\n\t\tN = value._length;\n\t\tif ( idx+N > this._length ) {\n\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t}\n\t\tsbuf = value._buffer;\n\n\t\t// Check for overlapping memory...\n\t\tj = buf.byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\tif (\n\t\t\tsbuf.buffer === buf.buffer &&\n\t\t\t(\n\t\t\t\tsbuf.byteOffset < j &&\n\t\t\t\tsbuf.byteOffset+sbuf.byteLength > j\n\t\t\t)\n\t\t) {\n\t\t\t// We need to copy source values...\n\t\t\ttmp = new Float32Array( sbuf.length );\n\t\t\tfor ( i = 0; i < sbuf.length; i++ ) {\n\t\t\t\ttmp[ i ] = sbuf[ i ];\n\t\t\t}\n\t\t\tsbuf = tmp;\n\t\t}\n\t\tidx *= 2;\n\t\tj = 0;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tbuf[ idx ] = sbuf[ j ];\n\t\t\tbuf[ idx+1 ] = sbuf[ j+1 ];\n\t\t\tidx += 2; // stride\n\t\t\tj += 2; // stride\n\t\t}\n\t\treturn;\n\t}\n\tif ( isCollection( value ) ) {\n\t\t// Detect whether we've been provided an array of complex numbers...\n\t\tN = value.length;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tif ( !isComplexLike( value[ i ] ) ) {\n\t\t\t\tflg = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t// If an array does not contain only complex numbers, then we assume interleaved real and imaginary components...\n\t\tif ( flg ) {\n\t\t\tif ( !isEven( N ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.', N ) );\n\t\t\t}\n\t\t\tif ( idx+(N/2) > this._length ) {\n\t\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t\t}\n\t\t\tsbuf = value;\n\n\t\t\t// Check for overlapping memory...\n\t\t\tj = buf.byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\t\tif (\n\t\t\t\tsbuf.buffer === buf.buffer &&\n\t\t\t\t(\n\t\t\t\t\tsbuf.byteOffset < j &&\n\t\t\t\t\tsbuf.byteOffset+sbuf.byteLength > j\n\t\t\t\t)\n\t\t\t) {\n\t\t\t\t// We need to copy source values...\n\t\t\t\ttmp = new Float32Array( N );\n\t\t\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t\t\ttmp[ i ] = sbuf[ i ]; // TODO: handle accessor arrays\n\t\t\t\t}\n\t\t\t\tsbuf = tmp;\n\t\t\t}\n\t\t\tidx *= 2;\n\t\t\tN /= 2;\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t\tbuf[ idx ] = sbuf[ j ];\n\t\t\t\tbuf[ idx+1 ] = sbuf[ j+1 ];\n\t\t\t\tidx += 2; // stride\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\t// If an array contains only complex numbers, then we need to extract real and imaginary components...\n\t\tif ( idx+N > this._length ) {\n\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t}\n\t\tidx *= 2;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tv = value[ i ];\n\t\t\tbuf[ idx ] = realf( v );\n\t\t\tbuf[ idx+1 ] = imagf( v );\n\t\t\tidx += 2; // stride\n\t\t}\n\t\treturn;\n\t}\n\tthrow new TypeError( format( 'invalid argument. First argument must be either a complex number, an array-like object, or a complex number array. Value: `%s`.', value ) );\n\n\t/* eslint-enable no-underscore-dangle */\n});\n\n/**\n* Copies a portion of a typed array to a new typed array.\n*\n* @name slice\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} [start=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {TypeError} second argument must be an integer\n* @returns {Complex64Array} complex number array\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* var arr = new Complex64Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var out = arr.slice();\n* // returns \n*\n* var len = out.length;\n* // returns 5\n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns -1.0\n*\n* z = out.get( len-1 );\n* // returns \n*\n* re = realf( z );\n* // returns 5.0\n*\n* im = imagf( z );\n* // returns -5.0\n*\n* out = arr.slice( 1, -2 );\n* // returns \n*\n* len = out.length;\n* // returns 2\n*\n* z = out.get( 0 );\n* // returns \n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns -2.0\n*\n* z = out.get( len-1 );\n* // returns \n*\n* re = realf( z );\n* // returns 3.0\n*\n* im = imagf( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex64Array.prototype, 'slice', function slice( start, end ) {\n\tvar outlen;\n\tvar outbuf;\n\tvar out;\n\tvar idx;\n\tvar buf;\n\tvar len;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length === 0 ) {\n\t\tstart = 0;\n\t\tend = len;\n\t} else {\n\t\tif ( !isInteger( start ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', start ) );\n\t\t}\n\t\tif ( start < 0 ) {\n\t\t\tstart += len;\n\t\t\tif ( start < 0 ) {\n\t\t\t\tstart = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length === 1 ) {\n\t\t\tend = len;\n\t\t} else {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t} else if ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t}\n\t}\n\tif ( start < end ) {\n\t\toutlen = end - start;\n\t} else {\n\t\toutlen = 0;\n\t}\n\tout = new this.constructor( outlen );\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < outlen; i++ ) {\n\t\tidx = 2*(i+start);\n\t\toutbuf[ 2*i ] = buf[ idx ];\n\t\toutbuf[ (2*i)+1 ] = buf[ idx+1 ];\n\t}\n\treturn out;\n});\n\n/**\n* Tests whether at least one element in an array passes a test implemented by a predicate function.\n*\n* @name some\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether at least one element passes a test\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var bool = arr.some( predicate );\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'some', function some( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( predicate.call( thisArg, getComplex64( buf, i ), i, this ) ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Sorts an array in-place.\n*\n* @name sort\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} compareFcn - comparison function\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex64Array} sorted array\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* function compare( a, b ) {\n* var re1;\n* var re2;\n* var im1;\n* var im2;\n* re1 = realf( a );\n* re2 = realf( b );\n* if ( re1 < re2 ) {\n* return -1;\n* }\n* if ( re1 > re2 ) {\n* return 1;\n* }\n* im1 = imagf( a );\n* im2 = imagf( b );\n* if ( im1 < im2 ) {\n* return -1;\n* }\n* if ( im1 > im2 ) {\n* return 1;\n* }\n* return 0;\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 3.0, -3.0 ], 0 );\n* arr.set( [ 1.0, -1.0 ], 1 );\n* arr.set( [ 2.0, -2.0 ], 2 );\n*\n* var out = arr.sort( compare );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns -1.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns -2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = realf( z );\n* // returns 3.0\n*\n* im = imagf( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex64Array.prototype, 'sort', function sort( compareFcn ) {\n\tvar tmp;\n\tvar buf;\n\tvar len;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( compareFcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', compareFcn ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\ttmp = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\ttmp.push( getComplex64( buf, i ) );\n\t}\n\ttmp.sort( compareFcn );\n\tfor ( i = 0; i < len; i++ ) {\n\t\tj = 2 * i;\n\t\tbuf[ j ] = realf( tmp[i] );\n\t\tbuf[ j+1 ] = imagf( tmp[i] );\n\t}\n\treturn this;\n});\n\n/**\n* Creates a new typed array view over the same underlying `ArrayBuffer` and with the same underlying data type as the host array.\n*\n* @name subarray\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} [begin=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {TypeError} second argument must be an integer\n* @returns {Complex64Array} subarray\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* var arr = new Complex64Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var subarr = arr.subarray();\n* // returns \n*\n* var len = subarr.length;\n* // returns 5\n*\n* var z = subarr.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns -1.0\n*\n* z = subarr.get( len-1 );\n* // returns \n*\n* re = realf( z );\n* // returns 5.0\n*\n* im = imagf( z );\n* // returns -5.0\n*\n* subarr = arr.subarray( 1, -2 );\n* // returns \n*\n* len = subarr.length;\n* // returns 2\n*\n* z = subarr.get( 0 );\n* // returns \n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns -2.0\n*\n* z = subarr.get( len-1 );\n* // returns \n*\n* re = realf( z );\n* // returns 3.0\n*\n* im = imagf( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex64Array.prototype, 'subarray', function subarray( begin, end ) {\n\tvar offset;\n\tvar buf;\n\tvar len;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length === 0 ) {\n\t\tbegin = 0;\n\t\tend = len;\n\t} else {\n\t\tif ( !isInteger( begin ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', begin ) );\n\t\t}\n\t\tif ( begin < 0 ) {\n\t\t\tbegin += len;\n\t\t\tif ( begin < 0 ) {\n\t\t\t\tbegin = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length === 1 ) {\n\t\t\tend = len;\n\t\t} else {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t} else if ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t}\n\t}\n\tif ( begin >= len ) {\n\t\tlen = 0;\n\t\toffset = buf.byteLength;\n\t} else if ( begin >= end ) {\n\t\tlen = 0;\n\t\toffset = buf.byteOffset + (begin*BYTES_PER_ELEMENT);\n\t} else {\n\t\tlen = end - begin;\n\t\toffset = buf.byteOffset + ( begin*BYTES_PER_ELEMENT );\n\t}\n\treturn new this.constructor( buf.buffer, offset, ( len < 0 ) ? 0 : len );\n});\n\n/**\n* Serializes an array as a locale-specific string.\n*\n* @name toLocaleString\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {(string|Array)} [locales] - locale identifier(s)\n* @param {Object} [options] - configuration options\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a string or an array of strings\n* @throws {TypeError} options argument must be an object\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex64Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.toLocaleString();\n* // returns '1 + 1i,2 + 2i'\n*/\nsetReadOnly( Complex64Array.prototype, 'toLocaleString', function toLocaleString( locales, options ) {\n\tvar opts;\n\tvar loc;\n\tvar out;\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( arguments.length === 0 ) {\n\t\tloc = [];\n\t} else if ( isString( locales ) || isStringArray( locales ) ) {\n\t\tloc = locales;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string or an array of strings. Value: `%s`.', locales ) );\n\t}\n\tif ( arguments.length < 2 ) {\n\t\topts = {};\n\t} else if ( isObject( options ) ) {\n\t\topts = options;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );\n\t}\n\tbuf = this._buffer;\n\tout = [];\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex64( buf, i ).toLocaleString( loc, opts ) );\n\t}\n\treturn out.join( ',' );\n});\n\n/**\n* Returns a new typed array containing the elements in reversed order.\n*\n* @name toReversed\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex64Array} reversed array\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.toReversed();\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 3.0\n*\n* var im = imagf( z );\n* // returns 3.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns 2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'toReversed', function toReversed() {\n\tvar outbuf;\n\tvar out;\n\tvar len;\n\tvar buf;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tlen = this._length;\n\tout = new this.constructor( len );\n\tbuf = this._buffer;\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < len; i++ ) {\n\t\tj = len - i - 1;\n\t\toutbuf[ (2*i) ] = buf[ (2*j) ];\n\t\toutbuf[ (2*i)+1 ] = buf[ (2*j)+1 ];\n\t}\n\treturn out;\n});\n\n/**\n* Returns a new typed array containing the elements in sorted order.\n*\n* @name toSorted\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} compareFcn - comparison function\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex64Array} sorted array\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* function compare( a, b ) {\n* var re1;\n* var re2;\n* var im1;\n* var im2;\n* re1 = realf( a );\n* re2 = realf( b );\n* if ( re1 < re2 ) {\n* return -1;\n* }\n* if ( re1 > re2 ) {\n* return 1;\n* }\n* im1 = imagf( a );\n* im2 = imagf( b );\n* if ( im1 < im2 ) {\n* return -1;\n* }\n* if ( im1 > im2 ) {\n* return 1;\n* }\n* return 0;\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 3.0, -3.0 ], 0 );\n* arr.set( [ 1.0, -1.0 ], 1 );\n* arr.set( [ 2.0, -2.0 ], 2 );\n*\n* var out = arr.sort( compare );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns -1.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns -2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = realf( z );\n* // returns 3.0\n*\n* im = imagf( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex64Array.prototype, 'toSorted', function toSorted( compareFcn ) {\n\tvar tmp;\n\tvar buf;\n\tvar len;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( compareFcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', compareFcn ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\ttmp = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\ttmp.push( getComplex64( buf, i ) );\n\t}\n\ttmp.sort( compareFcn );\n\treturn new Complex64Array( tmp );\n});\n\n/**\n* Serializes an array as a string.\n*\n* @name toString\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex64Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.toString();\n* // returns '1 + 1i,2 + 2i'\n*/\nsetReadOnly( Complex64Array.prototype, 'toString', function toString() {\n\tvar out;\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tout = [];\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex64( buf, i ).toString() );\n\t}\n\treturn out.join( ',' );\n});\n\n/**\n* Returns an iterator for iterating over each value in a typed array.\n*\n* @name values\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Iterator} iterator\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n* var arr = new Complex64Array( 2 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n*\n* var iter = arr.values();\n*\n* var v = iter.next().value;\n* // returns \n*\n* var re = realf( v );\n* // returns 1.0\n*\n* var im = imagf( v );\n* // returns -1.0\n*\n* v = iter.next().value;\n* // returns \n*\n* re = realf( v );\n* // returns 2.0\n*\n* im = imagf( v );\n* // returns -2.0\n*\n* var bool = iter.next().done;\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'values', function values() {\n\tvar iter;\n\tvar self;\n\tvar len;\n\tvar FLG;\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tself = this;\n\tbuf = this._buffer;\n\tlen = this._length;\n\n\t// Initialize an iteration index:\n\ti = -1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': getComplex64( buf, i ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.values();\n\t}\n});\n\n/**\n* Returns a new typed array with the element at a provided index replaced with a provided value.\n*\n* @name with\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} index - element index\n* @param {ComplexLike} value - new value\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {TypeError} second argument must be a complex number\n* @returns {Complex64Array} new typed array\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.with( 0, new Complex64( 4.0, 4.0 ) );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 4.0\n*\n* var im = imagf( z );\n* // returns 4.0\n*/\nsetReadOnly( Complex64Array.prototype, 'with', function copyWith( index, value ) {\n\tvar buf;\n\tvar out;\n\tvar len;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isInteger( index ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', index ) );\n\t}\n\tlen = this._length;\n\tif ( index < 0 ) {\n\t\tindex += len;\n\t}\n\tif ( index < 0 || index >= len ) {\n\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%s`.', index ) );\n\t}\n\tif ( !isComplexLike( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a complex number. Value: `%s`.', value ) );\n\t}\n\tout = new this.constructor( this._buffer );\n\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tbuf[ 2*index ] = realf( value );\n\tbuf[ (2*index)+1 ] = imagf( value );\n\treturn out;\n});\n\n\n// EXPORTS //\n\nexport default Complex64Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport realf from '@stdlib/complex-float32-real';\nimport imagf from '@stdlib/complex-float32-imag';\n\n\n// MAIN //\n\n/**\n* Returns a strided array of real and imaginary components.\n*\n* @private\n* @param {Float32Array} buf - output array\n* @param {Array} arr - array containing complex numbers\n* @returns {(Float32Array|null)} output array or null\n*/\nfunction fromArray( buf, arr ) {\n\tvar len;\n\tvar v;\n\tvar i;\n\tvar j;\n\n\tlen = arr.length;\n\tj = 0;\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = arr[ i ];\n\t\tif ( !isComplexLike( v ) ) {\n\t\t\treturn null;\n\t\t}\n\t\tbuf[ j ] = realf( v );\n\t\tbuf[ j+1 ] = imagf( v );\n\t\tj += 2; // stride\n\t}\n\treturn buf;\n}\n\n\n// EXPORTS //\n\nexport default fromArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the real component of a double-precision complex floating-point number.\n*\n* @param {Complex} z - complex number\n* @returns {number} real component\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var re = real( z );\n* // returns 5.0\n*/\nfunction real( z ) {\n\treturn z.re;\n}\n\n\n// EXPORTS //\n\nexport default real;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the imaginary component of a double-precision complex floating-point number.\n*\n* @param {Complex} z - complex number\n* @returns {number} imaginary component\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var im = imag( z );\n* // returns 3.0\n*/\nfunction imag( z ) {\n\treturn z.im;\n}\n\n\n// EXPORTS //\n\nexport default imag;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArrayLikeObject from '@stdlib/assert-is-array-like-object';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport format from '@stdlib/string-format';\nimport real from '@stdlib/complex-float64-real';\nimport imag from '@stdlib/complex-float64-imag';\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @returns {(Array|TypeError)} array or an error\n*/\nfunction fromIterator( it ) {\n\tvar out;\n\tvar v;\n\tvar z;\n\n\tout = [];\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\tz = v.value;\n\t\tif ( isArrayLikeObject( z ) && z.length >= 2 ) {\n\t\t\tout.push( z[ 0 ], z[ 1 ] );\n\t\t} else if ( isComplexLike( z ) ) {\n\t\t\tout.push( real( z ), imag( z ) );\n\t\t} else {\n\t\t\treturn new TypeError( format( 'invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', z ) );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default fromIterator;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArrayLikeObject from '@stdlib/assert-is-array-like-object';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport realf from '@stdlib/complex-float32-real';\nimport imagf from '@stdlib/complex-float32-imag';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @param {Function} clbk - callback to invoke for each iterated value\n* @param {*} thisArg - invocation context\n* @returns {(Array|TypeError)} array or an error\n*/\nfunction fromIteratorMap( it, clbk, thisArg ) {\n\tvar out;\n\tvar v;\n\tvar z;\n\tvar i;\n\n\tout = [];\n\ti = -1;\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\ti += 1;\n\t\tz = clbk.call( thisArg, v.value, i );\n\t\tif ( isArrayLikeObject( z ) && z.length >= 2 ) {\n\t\t\tout.push( z[ 0 ], z[ 1 ] );\n\t\t} else if ( isComplexLike( z ) ) {\n\t\t\tout.push( realf( z ), imagf( z ) );\n\t\t} else {\n\t\t\treturn new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', z ) );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default fromIteratorMap;\n","/* eslint-disable no-restricted-syntax, max-lines, no-invalid-this */\n\n/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\nimport isArrayLikeObject from '@stdlib/assert-is-array-like-object';\nimport isCollection from '@stdlib/assert-is-collection';\nimport isArrayBuffer from '@stdlib/assert-is-arraybuffer';\nimport isObject from '@stdlib/assert-is-object';\nimport isArray from '@stdlib/assert-is-array';\nimport { primitives as isStringArray } from '@stdlib/assert-is-string-array';\nimport isString from '@stdlib/assert-is-string';\nimport isFunction from '@stdlib/assert-is-function';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport isEven from '@stdlib/math-base-assert-is-even';\nimport isInteger from '@stdlib/math-base-assert-is-integer';\nimport isComplex64Array from '@stdlib/array-base-assert-is-complex64array';\nimport isComplex128Array from '@stdlib/array-base-assert-is-complex128array';\nimport hasIteratorSymbolSupport from '@stdlib/assert-has-iterator-symbol-support';\nimport ITERATOR_SYMBOL from '@stdlib/symbol-iterator';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport setReadOnlyAccessor from '@stdlib/utils-define-nonenumerable-read-only-accessor';\nimport Float64Array from '@stdlib/array-float64';\nimport Complex128 from '@stdlib/complex-float64-ctor';\nimport real from '@stdlib/complex-float64-real';\nimport imag from '@stdlib/complex-float64-imag';\nimport floor from '@stdlib/math-base-special-floor';\nimport reinterpret64 from '@stdlib/strided-base-reinterpret-complex64';\nimport reinterpret128 from '@stdlib/strided-base-reinterpret-complex128';\nimport getter from '@stdlib/array-base-getter';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport format from '@stdlib/string-format';\nimport fromIterator from './from_iterator.js';\nimport fromIteratorMap from './from_iterator_map.js';\nimport fromArray from './from_array.js';\n\n\n// VARIABLES //\n\nvar BYTES_PER_ELEMENT = Float64Array.BYTES_PER_ELEMENT * 2;\nvar HAS_ITERATOR_SYMBOL = hasIteratorSymbolSupport();\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating if a value is a complex typed array.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex typed array\n*/\nfunction isComplexArray( value ) {\n\treturn (\n\t\tvalue instanceof Complex128Array ||\n\t\t(\n\t\t\ttypeof value === 'object' &&\n\t\t\tvalue !== null &&\n\t\t\t(\n\t\t\t\tvalue.constructor.name === 'Complex64Array' ||\n\t\t\t\tvalue.constructor.name === 'Complex128Array'\n\t\t\t) &&\n\t\t\ttypeof value._length === 'number' && // eslint-disable-line no-underscore-dangle\n\n\t\t\t// NOTE: we don't perform a more rigorous test here for a typed array for performance reasons, as robustly checking for a typed array instance could require walking the prototype tree and performing relatively expensive constructor checks...\n\t\t\ttypeof value._buffer === 'object' // eslint-disable-line no-underscore-dangle\n\t\t)\n\t);\n}\n\n/**\n* Returns a boolean indicating if a value is a complex typed array constructor.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex typed array constructor\n*/\nfunction isComplexArrayConstructor( value ) {\n\treturn (\n\t\tvalue === Complex128Array ||\n\n\t\t// NOTE: weaker test in order to avoid a circular dependency with Complex64Array...\n\t\tvalue.name === 'Complex64Array'\n\t);\n}\n\n/**\n* Retrieves a complex number from a complex number array buffer.\n*\n* @private\n* @param {Float64Array} buf - array buffer\n* @param {NonNegativeInteger} idx - element index\n* @returns {Complex128} complex number\n*/\nfunction getComplex128( buf, idx ) {\n\tidx *= 2;\n\treturn new Complex128( buf[ idx ], buf[ idx+1 ] );\n}\n\n\n// MAIN //\n\n/**\n* 128-bit complex number array constructor.\n*\n* @constructor\n* @param {(NonNegativeInteger|Collection|ArrayBuffer|Iterable)} [arg] - length, typed array, array-like object, buffer, or iterable\n* @param {NonNegativeInteger} [byteOffset=0] - byte offset\n* @param {NonNegativeInteger} [length] - view length\n* @throws {RangeError} ArrayBuffer byte length must be a multiple of `16`\n* @throws {RangeError} array-like object and typed array input arguments must have a length which is a multiple of two\n* @throws {TypeError} if provided only a single argument, must provide a valid argument\n* @throws {TypeError} byte offset must be a nonnegative integer\n* @throws {RangeError} byte offset must be a multiple of `16`\n* @throws {TypeError} view length must be a positive multiple of `16`\n* @throws {RangeError} must provide sufficient memory to accommodate byte offset and view length requirements\n* @throws {TypeError} an iterator must return either a two element array containing real and imaginary components or a complex number\n* @returns {Complex128Array} complex number array\n*\n* @example\n* var arr = new Complex128Array();\n* // returns \n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var arr = new Complex128Array( 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var arr = new Complex128Array( [ 1.0, -1.0 ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new Complex128Array( buf );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new Complex128Array( buf, 16 );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 64 );\n* var arr = new Complex128Array( buf, 16, 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*/\nfunction Complex128Array() {\n\tvar byteOffset;\n\tvar nargs;\n\tvar buf;\n\tvar len;\n\n\tnargs = arguments.length;\n\tif ( !(this instanceof Complex128Array) ) {\n\t\tif ( nargs === 0 ) {\n\t\t\treturn new Complex128Array();\n\t\t}\n\t\tif ( nargs === 1 ) {\n\t\t\treturn new Complex128Array( arguments[0] );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\treturn new Complex128Array( arguments[0], arguments[1] );\n\t\t}\n\t\treturn new Complex128Array( arguments[0], arguments[1], arguments[2] );\n\t}\n\t// Create the underlying data buffer...\n\tif ( nargs === 0 ) {\n\t\tbuf = new Float64Array( 0 ); // backward-compatibility\n\t} else if ( nargs === 1 ) {\n\t\tif ( isNonNegativeInteger( arguments[0] ) ) {\n\t\t\tbuf = new Float64Array( arguments[0]*2 );\n\t\t} else if ( isCollection( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tlen = buf.length;\n\n\t\t\t// If provided a \"generic\" array, peak at the first value, and, if the value is a complex number, try to process as an array of complex numbers, falling back to \"normal\" typed array initialization if we fail and ensuring consistency if the first value had not been a complex number...\n\t\t\tif ( len && isArray( buf ) && isComplexLike( buf[0] ) ) {\n\t\t\t\tbuf = fromArray( new Float64Array( len*2 ), buf );\n\t\t\t\tif ( buf === null ) {\n\t\t\t\t\t// We failed and we are now forced to allocate a new array :-(\n\t\t\t\t\tif ( !isEven( len ) ) {\n\t\t\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t\t}\n\t\t\t\t\t// We failed, so fall back to directly setting values...\n\t\t\t\t\tbuf = new Float64Array( arguments[0] );\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif ( isComplex64Array( buf ) ) {\n\t\t\t\t\tbuf = reinterpret64( buf, 0 );\n\t\t\t\t} else if ( isComplex128Array( buf ) ) {\n\t\t\t\t\tbuf = reinterpret128( buf, 0 );\n\t\t\t\t} else if ( !isEven( len ) ) {\n\t\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object and typed array arguments must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t}\n\t\t\t\tbuf = new Float64Array( buf );\n\t\t\t}\n\t\t} else if ( isArrayBuffer( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tif ( !isInteger( buf.byteLength/BYTES_PER_ELEMENT ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. ArrayBuffer byte length must be a multiple of %u. Byte length: `%u`.', BYTES_PER_ELEMENT, buf.byteLength ) );\n\t\t\t}\n\t\t\tbuf = new Float64Array( buf );\n\t\t} else if ( isObject( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tif ( HAS_ITERATOR_SYMBOL === false ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tif ( !isFunction( buf[ ITERATOR_SYMBOL ] ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tbuf = buf[ ITERATOR_SYMBOL ]();\n\t\t\tif ( !isFunction( buf.next ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tbuf = fromIterator( buf );\n\t\t\tif ( buf instanceof Error ) {\n\t\t\t\tthrow buf;\n\t\t\t}\n\t\t\tbuf = new Float64Array( buf );\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arguments[0] ) );\n\t\t}\n\t} else {\n\t\tbuf = arguments[ 0 ];\n\t\tif ( !isArrayBuffer( buf ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an ArrayBuffer. Value: `%s`.', buf ) );\n\t\t}\n\t\tbyteOffset = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( byteOffset ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.', byteOffset ) );\n\t\t}\n\t\tif ( !isInteger( byteOffset/BYTES_PER_ELEMENT ) ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Byte offset must be a multiple of %u. Value: `%u`.', BYTES_PER_ELEMENT, byteOffset ) );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\tlen = buf.byteLength - byteOffset;\n\t\t\tif ( !isInteger( len/BYTES_PER_ELEMENT ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid arguments. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.', BYTES_PER_ELEMENT, len ) );\n\t\t\t}\n\t\t\tbuf = new Float64Array( buf, byteOffset );\n\t\t} else {\n\t\t\tlen = arguments[ 2 ];\n\t\t\tif ( !isNonNegativeInteger( len ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Length must be a nonnegative integer. Value: `%s`.', len ) );\n\t\t\t}\n\t\t\tif ( (len*BYTES_PER_ELEMENT) > (buf.byteLength-byteOffset) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.', len*BYTES_PER_ELEMENT ) );\n\t\t\t}\n\t\t\tbuf = new Float64Array( buf, byteOffset, len*2 );\n\t\t}\n\t}\n\tsetReadOnly( this, '_buffer', buf );\n\tsetReadOnly( this, '_length', buf.length/2 );\n\n\treturn this;\n}\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex128Array\n* @readonly\n* @type {PositiveInteger}\n* @default 16\n*\n* @example\n* var nbytes = Complex128Array.BYTES_PER_ELEMENT;\n* // returns 16\n*/\nsetReadOnly( Complex128Array, 'BYTES_PER_ELEMENT', BYTES_PER_ELEMENT );\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof Complex128Array\n* @readonly\n* @type {string}\n* @default 'Complex128Array'\n*\n* @example\n* var name = Complex128Array.name;\n* // returns 'Complex128Array'\n*/\nsetReadOnly( Complex128Array, 'name', 'Complex128Array' );\n\n/**\n* Creates a new 128-bit complex number array from an array-like object or an iterable.\n*\n* @name from\n* @memberof Complex128Array\n* @type {Function}\n* @param {(Collection|Object)} src - array-like object or iterable\n* @param {Function} [clbk] - callback to invoke for each source element\n* @param {*} [thisArg] - context\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an array-like object or an iterable\n* @throws {TypeError} second argument must be a function\n* @throws {RangeError} array-like objects must have a length which is a multiple of two\n* @throws {TypeError} an iterator must return either a two element array containing real and imaginary components or a complex number\n* @throws {TypeError} when provided an iterator, a callback must return either a two element array containing real and imaginary components or a complex number\n* @returns {Complex128Array} 128-bit complex number array\n*\n* @example\n* var arr = Complex128Array.from( [ 1.0, -1.0 ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var arr = Complex128Array.from( [ new Complex128( 1.0, 1.0 ) ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function clbk( v ) {\n* return new Complex128( real(v)*2.0, imag(v)*2.0 );\n* }\n*\n* var arr = Complex128Array.from( [ new Complex128( 1.0, 1.0 ) ], clbk );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*/\nsetReadOnly( Complex128Array, 'from', function from( src ) {\n\tvar thisArg;\n\tvar nargs;\n\tvar clbk;\n\tvar out;\n\tvar buf;\n\tvar tmp;\n\tvar get;\n\tvar len;\n\tvar flg;\n\tvar v;\n\tvar i;\n\tvar j;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isComplexArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tnargs = arguments.length;\n\tif ( nargs > 1 ) {\n\t\tclbk = arguments[ 1 ];\n\t\tif ( !isFunction( clbk ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a function. Value: `%s`.', clbk ) );\n\t\t}\n\t\tif ( nargs > 2 ) {\n\t\t\tthisArg = arguments[ 2 ];\n\t\t}\n\t}\n\tif ( isComplexArray( src ) ) {\n\t\tlen = src.length;\n\t\tif ( clbk ) {\n\t\t\tout = new this( len );\n\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tv = clbk.call( thisArg, src.get( i ), i );\n\t\t\t\tif ( isComplexLike( v ) ) {\n\t\t\t\t\tbuf[ j ] = real( v );\n\t\t\t\t\tbuf[ j+1 ] = imag( v );\n\t\t\t\t} else if ( isArrayLikeObject( v ) && v.length >= 2 ) {\n\t\t\t\t\tbuf[ j ] = v[ 0 ];\n\t\t\t\t\tbuf[ j+1 ] = v[ 1 ];\n\t\t\t\t} else {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t\t\t}\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\treturn new this( src );\n\t}\n\tif ( isCollection( src ) ) {\n\t\tif ( clbk ) {\n\t\t\t// Note: array contents affect how we iterate over a provided data source. If only complex number objects, we can extract real and imaginary components. Otherwise, for non-complex number arrays (e.g., `Float64Array`, etc), we assume a strided array where real and imaginary components are interleaved. In the former case, we expect a callback to return real and imaginary components (possibly as a complex number). In the latter case, we expect a callback to return *either* a real or imaginary component.\n\n\t\t\tlen = src.length;\n\t\t\tif ( src.get && src.set ) {\n\t\t\t\tget = accessorGetter( 'default' );\n\t\t\t} else {\n\t\t\t\tget = getter( 'default' );\n\t\t\t}\n\t\t\t// Detect whether we've been provided an array which returns complex number objects...\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tif ( !isComplexLike( get( src, i ) ) ) {\n\t\t\t\t\tflg = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// If an array does not contain only complex number objects, then we assume interleaved real and imaginary components...\n\t\t\tif ( flg ) {\n\t\t\t\tif ( !isEven( len ) ) {\n\t\t\t\t\tthrow new RangeError( format( 'invalid argument. First argument must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t}\n\t\t\t\tout = new this( len/2 );\n\t\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\t\tbuf[ i ] = clbk.call( thisArg, get( src, i ), i );\n\t\t\t\t}\n\t\t\t\treturn out;\n\t\t\t}\n\t\t\t// If an array contains only complex number objects, then we need to extract real and imaginary components...\n\t\t\tout = new this( len );\n\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tv = clbk.call( thisArg, get( src, i ), i );\n\t\t\t\tif ( isComplexLike( v ) ) {\n\t\t\t\t\tbuf[ j ] = real( v );\n\t\t\t\t\tbuf[ j+1 ] = imag( v );\n\t\t\t\t} else if ( isArrayLikeObject( v ) && v.length >= 2 ) {\n\t\t\t\t\tbuf[ j ] = v[ 0 ];\n\t\t\t\t\tbuf[ j+1 ] = v[ 1 ];\n\t\t\t\t} else {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t\t\t}\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\treturn new this( src );\n\t}\n\tif ( isObject( src ) && HAS_ITERATOR_SYMBOL && isFunction( src[ ITERATOR_SYMBOL ] ) ) { // eslint-disable-line max-len\n\t\tbuf = src[ ITERATOR_SYMBOL ]();\n\t\tif ( !isFunction( buf.next ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n\t\t}\n\t\tif ( clbk ) {\n\t\t\ttmp = fromIteratorMap( buf, clbk, thisArg );\n\t\t} else {\n\t\t\ttmp = fromIterator( buf );\n\t\t}\n\t\tif ( tmp instanceof Error ) {\n\t\t\tthrow tmp;\n\t\t}\n\t\tlen = tmp.length / 2;\n\t\tout = new this( len );\n\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tbuf[ i ] = tmp[ i ];\n\t\t}\n\t\treturn out;\n\t}\n\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n});\n\n/**\n* Creates a new 128-bit complex number array from a variable number of arguments.\n*\n* @name of\n* @memberof Complex128Array\n* @type {Function}\n* @param {...*} element - array elements\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex128Array} 128-bit complex number array\n*\n* @example\n* var arr = Complex128Array.of( 1.0, 1.0, 1.0, 1.0 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*/\nsetReadOnly( Complex128Array, 'of', function of() {\n\tvar args;\n\tvar i;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isComplexArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\targs = [];\n\tfor ( i = 0; i < arguments.length; i++ ) {\n\t\targs.push( arguments[ i ] );\n\t}\n\treturn new this( args );\n});\n\n/**\n* Returns an array element with support for both nonnegative and negative integer indices.\n*\n* @name at\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {integer} idx - element index\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} must provide an integer\n* @returns {(Complex128|void)} array element\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var arr = new Complex128Array( 10 );\n*\n* var z = arr.at( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 0.0\n*\n* var im = imag( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 9.0, -9.0 ], 9 );\n*\n* z = arr.at( 0 );\n* // returns \n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns -1.0\n*\n* z = arr.at( -1 );\n* // returns \n*\n* re = real( z );\n* // returns 9.0\n*\n* im = imag( z );\n* // returns -9.0\n*\n* z = arr.at( 100 );\n* // returns undefined\n*\n* z = arr.at( -100 );\n* // returns undefined\n*/\nsetReadOnly( Complex128Array.prototype, 'at', function at( idx ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an integer. Value: `%s`.', idx ) );\n\t}\n\tif ( idx < 0 ) {\n\t\tidx += this._length;\n\t}\n\tif ( idx < 0 || idx >= this._length ) {\n\t\treturn;\n\t}\n\treturn getComplex128( this._buffer, idx );\n});\n\n/**\n* Pointer to the underlying data buffer.\n*\n* @name buffer\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {ArrayBuffer}\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var buf = arr.buffer;\n* // returns \n*/\nsetReadOnlyAccessor( Complex128Array.prototype, 'buffer', function get() {\n\treturn this._buffer.buffer;\n});\n\n/**\n* Size (in bytes) of the array.\n*\n* @name byteLength\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var byteLength = arr.byteLength;\n* // returns 160\n*/\nsetReadOnlyAccessor( Complex128Array.prototype, 'byteLength', function get() {\n\treturn this._buffer.byteLength;\n});\n\n/**\n* Offset (in bytes) of the array from the start of its underlying `ArrayBuffer`.\n*\n* @name byteOffset\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var byteOffset = arr.byteOffset;\n* // returns 0\n*/\nsetReadOnlyAccessor( Complex128Array.prototype, 'byteOffset', function get() {\n\treturn this._buffer.byteOffset;\n});\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {PositiveInteger}\n* @default 16\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var nbytes = arr.BYTES_PER_ELEMENT;\n* // returns 16\n*/\nsetReadOnly( Complex128Array.prototype, 'BYTES_PER_ELEMENT', Complex128Array.BYTES_PER_ELEMENT );\n\n/**\n* Copies a sequence of elements within the array to the position starting at `target`.\n*\n* @name copyWithin\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {integer} target - index at which to start copying elements\n* @param {integer} start - source index at which to copy elements from\n* @param {integer} [end] - source index at which to stop copying elements from\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex128Array} modified array\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var arr = new Complex128Array( 4 );\n*\n* // Set the array elements:\n* arr.set( new Complex128( 1.0, 1.0 ), 0 );\n* arr.set( new Complex128( 2.0, 2.0 ), 1 );\n* arr.set( new Complex128( 3.0, 3.0 ), 2 );\n* arr.set( new Complex128( 4.0, 4.0 ), 3 );\n*\n* // Copy the first two elements to the last two elements:\n* arr.copyWithin( 2, 0, 2 );\n*\n* // Get the last array element:\n* var z = arr.get( 3 );\n*\n* var re = real( z );\n* // returns 2.0\n*\n* var im = imag( z );\n* // returns 2.0\n*/\nsetReadOnly( Complex128Array.prototype, 'copyWithin', function copyWithin( target, start ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\t// FIXME: prefer a functional `copyWithin` implementation which addresses lack of universal browser support (e.g., IE11 and Safari) or ensure that typed arrays are polyfilled\n\tif ( arguments.length === 2 ) {\n\t\tthis._buffer.copyWithin( target*2, start*2 );\n\t} else {\n\t\tthis._buffer.copyWithin( target*2, start*2, arguments[2]*2 );\n\t}\n\treturn this;\n});\n\n/**\n* Returns an iterator for iterating over array key-value pairs.\n*\n* @name entries\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Iterator} iterator\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var arr = [\n* new Complex128( 1.0, 1.0 ),\n* new Complex128( 2.0, 2.0 ),\n* new Complex128( 3.0, 3.0 )\n* ];\n* arr = new Complex128Array( arr );\n*\n* // Create an iterator:\n* var it = arr.entries();\n*\n* // Iterate over the key-value pairs...\n* var v = it.next().value;\n* // returns [ 0, ]\n*\n* v = it.next().value;\n* // returns [ 1, ]\n*\n* v = it.next().value;\n* // returns [ 2, ]\n*\n* var bool = it.next().done;\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'entries', function entries() {\n\tvar buffer;\n\tvar self;\n\tvar iter;\n\tvar len;\n\tvar FLG;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tself = this;\n\tbuffer = this._buffer;\n\tlen = this._length;\n\n\t// Initialize the iteration indices:\n\ti = -1;\n\tj = -2;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\tvar z;\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\tj += 2;\n\t\tz = new Complex128( buffer[ j ], buffer[ j+1 ] );\n\t\treturn {\n\t\t\t'value': [ i, z ],\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.entries();\n\t}\n});\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @name every\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var bool = arr.every( predicate );\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'every', function every( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( !predicate.call( thisArg, getComplex128( buf, i ), i, this ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n});\n\n/**\n* Returns a modified typed array filled with a fill value.\n*\n* @name fill\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {ComplexLike} value - fill value\n* @param {integer} [start=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @throws {TypeError} third argument must be an integer\n* @returns {Complex128Array} modified array\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.fill( new Complex128( 1.0, 1.0 ), 1 );\n*\n* var z = arr.get( 1 );\n* // returns \n*\n* var re = real( z );\n* // returns 1.0\n*\n* var im = imag( z );\n* // returns 1.0\n*\n* z = arr.get( 2 );\n* // returns \n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'fill', function fill( value, start, end ) {\n\tvar buf;\n\tvar len;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', value ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( start ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', start ) );\n\t\t}\n\t\tif ( start < 0 ) {\n\t\t\tstart += len;\n\t\t\tif ( start < 0 ) {\n\t\t\t\tstart = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length > 2 ) {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t} else {\n\t\t\tend = len;\n\t\t}\n\t} else {\n\t\tstart = 0;\n\t\tend = len;\n\t}\n\tre = real( value );\n\tim = imag( value );\n\tfor ( i = start; i < end; i++ ) {\n\t\tidx = 2*i;\n\t\tbuf[ idx ] = re;\n\t\tbuf[ idx+1 ] = im;\n\t}\n\treturn this;\n});\n\n/**\n* Returns a new array containing the elements of an array which pass a test implemented by a predicate function.\n*\n* @name filter\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex128Array} complex number array\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var out = arr.filter( predicate );\n* // returns \n*\n* var len = out.length;\n* // returns 1\n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 2.0\n*\n* var im = imag( z );\n* // returns 2.0\n*/\nsetReadOnly( Complex128Array.prototype, 'filter', function filter( predicate, thisArg ) {\n\tvar buf;\n\tvar out;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tout = [];\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\tout.push( z );\n\t\t}\n\t}\n\treturn new this.constructor( out );\n});\n\n/**\n* Returns the first element in an array for which a predicate function returns a truthy value.\n*\n* @name find\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {(Complex128|void)} array element or undefined\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.find( predicate );\n* // returns \n*\n* var re = real( z );\n* // returns 1.0\n*\n* var im = imag( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'find', function find( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn z;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the first element in an array for which a predicate function returns a truthy value.\n*\n* @name findIndex\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var idx = arr.findIndex( predicate );\n* // returns 2\n*/\nsetReadOnly( Complex128Array.prototype, 'findIndex', function findIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLast\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {(Complex128|void)} array element or undefined\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.findLast( predicate );\n* // returns \n*\n* var re = real( z );\n* // returns 3.0\n*\n* var im = imag( z );\n* // returns 3.0\n*/\nsetReadOnly( Complex128Array.prototype, 'findLast', function findLast( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn z;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLastIndex\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var idx = arr.findLastIndex( predicate );\n* // returns 1\n*/\nsetReadOnly( Complex128Array.prototype, 'findLastIndex', function findLastIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Invokes a function once for each array element.\n*\n* @name forEach\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} fcn - function to invoke\n* @param {*} [thisArg] - function invocation context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* function log( v, i ) {\n* console.log( '%s: %s', i, v.toString() );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* arr.forEach( log );\n*/\nsetReadOnly( Complex128Array.prototype, 'forEach', function forEach( fcn, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex128( buf, i );\n\t\tfcn.call( thisArg, z, i, this );\n\t}\n});\n\n/**\n* Returns an array element.\n*\n* @name get\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {NonNegativeInteger} idx - element index\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} must provide a nonnegative integer\n* @returns {(Complex128|void)} array element\n*\n* @example\n* var arr = new Complex128Array( 10 );\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var z = arr.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 0.0\n*\n* var im = imag( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n*\n* z = arr.get( 0 );\n* // returns \n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns -1.0\n*\n* z = arr.get( 100 );\n* // returns undefined\n*/\nsetReadOnly( Complex128Array.prototype, 'get', function get( idx ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isNonNegativeInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a nonnegative integer. Value: `%s`.', idx ) );\n\t}\n\tif ( idx >= this._length ) {\n\t\treturn;\n\t}\n\treturn getComplex128( this._buffer, idx );\n});\n\n/**\n* Number of array elements.\n*\n* @name length\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var len = arr.length;\n* // returns 10\n*/\nsetReadOnlyAccessor( Complex128Array.prototype, 'length', function get() {\n\treturn this._length;\n});\n\n/**\n* Returns a boolean indicating whether an array includes a provided value.\n*\n* @name includes\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - search element\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {boolean} boolean indicating whether an array includes a provided value\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var arr = new Complex128Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var bool = arr.includes( new Complex128( 3.0, -3.0 ) );\n* // returns true\n*\n* bool = arr.includes( new Complex128( 3.0, -3.0 ), 3 );\n* // returns false\n*\n* bool = arr.includes( new Complex128( 4.0, -4.0 ), -3 );\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'includes', function includes( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tre = real( searchElement );\n\tim = imag( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Returns the first index at which a given element can be found.\n*\n* @name indexOf\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - element to find\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var arr = new Complex128Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var idx = arr.indexOf( new Complex128( 3.0, -3.0 ) );\n* // returns 2\n*\n* idx = arr.indexOf( new Complex128( 3.0, -3.0 ), 3 );\n* // returns -1\n*\n* idx = arr.indexOf( new Complex128( 4.0, -4.0 ), -3 );\n* // returns 3\n*/\nsetReadOnly( Complex128Array.prototype, 'indexOf', function indexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tre = real( searchElement );\n\tim = imag( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns a new string by concatenating all array elements.\n*\n* @name join\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {string} [separator=','] - element separator\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a string\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex128Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.join();\n* // returns '1 + 1i,2 + 2i'\n*\n* str = arr.join( '/' );\n* // returns '1 + 1i/2 + 2i'\n*/\nsetReadOnly( Complex128Array.prototype, 'join', function join( separator ) {\n\tvar out;\n\tvar buf;\n\tvar sep;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( arguments.length === 0 ) {\n\t\tsep = ',';\n\t} else if ( isString( separator ) ) {\n\t\tsep = separator;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string. Value: `%s`.', separator ) );\n\t}\n\tout = [];\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex128( buf, i ).toString() );\n\t}\n\treturn out.join( sep );\n});\n\n/**\n* Returns an iterator for iterating over each index key in a typed array.\n*\n* @name keys\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Iterator} iterator\n*\n* @example\n* var arr = new Complex128Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var iter = arr.keys();\n*\n* var v = iter.next().value;\n* // returns 0\n*\n* v = iter.next().value;\n* // returns 1\n*\n* var bool = iter.next().done;\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'keys', function keys() {\n\tvar self;\n\tvar iter;\n\tvar len;\n\tvar FLG;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tself = this;\n\tlen = this._length;\n\n\t// Initialize an iteration index:\n\ti = -1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': i,\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.keys();\n\t}\n});\n\n/**\n* Returns the last index at which a given element can be found.\n*\n* @name lastIndexOf\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - element to find\n* @param {integer} [fromIndex] - index at which to start searching backward (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var arr = new Complex128Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 3.0, -3.0 ], 4 );\n*\n* var idx = arr.lastIndexOf( new Complex128( 3.0, -3.0 ) );\n* // returns 4\n*\n* idx = arr.lastIndexOf( new Complex128( 3.0, -3.0 ), 3 );\n* // returns 2\n*\n* idx = arr.lastIndexOf( new Complex128( 5.0, -5.0 ), 3 );\n* // returns -1\n*\n* idx = arr.lastIndexOf( new Complex128( 2.0, -2.0 ), -3 );\n* // returns 1\n*/\nsetReadOnly( Complex128Array.prototype, 'lastIndexOf', function lastIndexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex >= this._length ) {\n\t\t\tfromIndex = this._length - 1;\n\t\t} else if ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t}\n\t} else {\n\t\tfromIndex = this._length - 1;\n\t}\n\tre = real( searchElement );\n\tim = imag( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i >= 0; i-- ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns a new array with each element being the result of a provided callback function.\n*\n* @name map\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} fcn - callback function\n* @param {*} [thisArg] - callback function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex128Array} complex number array\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function scale( v, i ) {\n* return new Complex128( 2.0*real( v ), 2.0*imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var out = arr.map( scale );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 2.0\n*\n* var im = imag( z );\n* // returns -2.0\n*/\nsetReadOnly( Complex128Array.prototype, 'map', function map( fcn, thisArg ) {\n\tvar outbuf;\n\tvar buf;\n\tvar out;\n\tvar i;\n\tvar v;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\tbuf = this._buffer;\n\tout = new this.constructor( this._length );\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tv = fcn.call( thisArg, getComplex128( buf, i ), i, this );\n\t\tif ( isComplexLike( v ) ) {\n\t\t\toutbuf[ 2*i ] = real( v );\n\t\t\toutbuf[ (2*i)+1 ] = imag( v );\n\t\t} else if ( isArrayLikeObject( v ) && v.length === 2 ) {\n\t\t\toutbuf[ 2*i ] = v[ 0 ];\n\t\t\toutbuf[ (2*i)+1 ] = v[ 1 ];\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t}\n\t}\n\treturn out;\n});\n\n/**\n* Applies a provided callback function to each element of the array, in order, passing in the return value from the calculation on the preceding element and returning the accumulated result upon completion.\n*\n* @name reduce\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} reducer - callback function\n* @param {*} [initialValue] - initial value\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @throws {Error} if not provided an initial value, the array must have at least one element\n* @returns {*} accumulated result\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n* import cadd from '@stdlib/complex-float64-base-add';\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.reduce( cadd );\n* // returns \n*\n* var re = real( z );\n* // returns 6.0\n*\n* var im = imag( z );\n* // returns 6.0\n*/\nsetReadOnly( Complex128Array.prototype, 'reduce', function reduce( reducer, initialValue ) {\n\tvar buf;\n\tvar acc;\n\tvar len;\n\tvar v;\n\tvar i;\n\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( reducer ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', reducer ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tacc = initialValue;\n\t\ti = 0;\n\t} else {\n\t\tif ( len === 0 ) {\n\t\t\tthrow new Error( 'invalid operation. If not provided an initial value, an array must contain at least one element.' );\n\t\t}\n\t\tacc = getComplex128( buf, 0 );\n\t\ti = 1;\n\t}\n\tfor ( ; i < len; i++ ) {\n\t\tv = getComplex128( buf, i );\n\t\tacc = reducer( acc, v, i, this );\n\t}\n\treturn acc;\n});\n\n/**\n* Applies a provided callback function to each element of the array, in reverse order, passing in the return value from the calculation on the preceding element and returning the accumulated result upon completion.\n*\n* @name reduceRight\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} reducer - callback function\n* @param {*} [initialValue] - initial value\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @throws {Error} if not provided an initial value, the array must have at least one element\n* @returns {*} accumulated result\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n* import cadd from '@stdlib/complex-float64-base-add';\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.reduceRight( cadd );\n* // returns \n*\n* var re = real( z );\n* // returns 6.0\n*\n* var im = imag( z );\n* // returns 6.0\n*/\nsetReadOnly( Complex128Array.prototype, 'reduceRight', function reduceRight( reducer, initialValue ) {\n\tvar buf;\n\tvar acc;\n\tvar len;\n\tvar v;\n\tvar i;\n\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( reducer ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', reducer ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tacc = initialValue;\n\t\ti = len-1;\n\t} else {\n\t\tif ( len === 0 ) {\n\t\t\tthrow new Error( 'invalid operation. If not provided an initial value, an array must contain at least one element.' );\n\t\t}\n\t\tacc = getComplex128( buf, len-1 );\n\t\ti = len-2;\n\t}\n\tfor ( ; i >= 0; i-- ) {\n\t\tv = getComplex128( buf, i );\n\t\tacc = reducer( acc, v, i, this );\n\t}\n\treturn acc;\n});\n\n/**\n* Reverses an array in-place.\n*\n* @name reverse\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex128Array} reversed array\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.reverse();\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 3.0\n*\n* var im = imag( z );\n* // returns 3.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = real( z );\n* // returns 2.0\n*\n* im = imag( z );\n* // returns 2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'reverse', function reverse() {\n\tvar buf;\n\tvar tmp;\n\tvar len;\n\tvar N;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tlen = this._length;\n\tbuf = this._buffer;\n\tN = floor( len / 2 );\n\tfor ( i = 0; i < N; i++ ) {\n\t\tj = len - i - 1;\n\t\ttmp = buf[ (2*i) ];\n\t\tbuf[ (2*i) ] = buf[ (2*j) ];\n\t\tbuf[ (2*j) ] = tmp;\n\t\ttmp = buf[ (2*i)+1 ];\n\t\tbuf[ (2*i)+1 ] = buf[ (2*j)+1 ];\n\t\tbuf[ (2*j)+1 ] = tmp;\n\t}\n\treturn this;\n});\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* - When provided a typed array, real or complex, we must check whether the source array shares the same buffer as the target array and whether the underlying memory overlaps. In particular, we are concerned with the following scenario:\n*\n* ```text\n* buf: ---------------------\n* src: ---------------------\n* ```\n*\n* In the above, as we copy values from `src`, we will overwrite values in the `src` view, resulting in duplicated values copied into the end of `buf`, which is not intended. Hence, to avoid overwriting source values, we must **copy** source values to a temporary array.\n*\n* In the other overlapping scenario,\n*\n* ```text\n* buf: ---------------------\n* src: ---------------------\n* ```\n*\n* by the time we begin copying into the overlapping region, we are copying from the end of `src`, a non-overlapping region, which means we don't run the risk of copying copied values, rather than the original `src` values as intended.\n*\n* @name set\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n* @param {NonNegativeInteger} [i=0] - element index at which to start writing values\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be either a complex number, an array-like object, or a complex number array\n* @throws {TypeError} index argument must be a nonnegative integer\n* @throws {RangeError} array-like objects must have a length which is a multiple of two\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {RangeError} target array lacks sufficient storage to accommodate source values\n* @returns {void}\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var arr = new Complex128Array( 10 );\n*\n* var z = arr.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 0.0\n*\n* var im = imag( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n*\n* z = arr.get( 0 );\n* // returns \n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns -1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'set', function set( value ) {\n\t/* eslint-disable no-underscore-dangle */\n\tvar sbuf;\n\tvar idx;\n\tvar buf;\n\tvar tmp;\n\tvar flg;\n\tvar N;\n\tvar v;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tif ( arguments.length > 1 ) {\n\t\tidx = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( idx ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Index argument must be a nonnegative integer. Value: `%s`.', idx ) );\n\t\t}\n\t} else {\n\t\tidx = 0;\n\t}\n\tif ( isComplexLike( value ) ) {\n\t\tif ( idx >= this._length ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%u`.', idx ) );\n\t\t}\n\t\tidx *= 2;\n\t\tbuf[ idx ] = real( value );\n\t\tbuf[ idx+1 ] = imag( value );\n\t\treturn;\n\t}\n\tif ( isComplexArray( value ) ) {\n\t\tN = value._length;\n\t\tif ( idx+N > this._length ) {\n\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t}\n\t\tsbuf = value._buffer;\n\n\t\t// Check for overlapping memory...\n\t\tj = buf.byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\tif (\n\t\t\tsbuf.buffer === buf.buffer &&\n\t\t\t(\n\t\t\t\tsbuf.byteOffset < j &&\n\t\t\t\tsbuf.byteOffset+sbuf.byteLength > j\n\t\t\t)\n\t\t) {\n\t\t\t// We need to copy source values...\n\t\t\ttmp = new Float64Array( sbuf.length );\n\t\t\tfor ( i = 0; i < sbuf.length; i++ ) {\n\t\t\t\ttmp[ i ] = sbuf[ i ];\n\t\t\t}\n\t\t\tsbuf = tmp;\n\t\t}\n\t\tidx *= 2;\n\t\tj = 0;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tbuf[ idx ] = sbuf[ j ];\n\t\t\tbuf[ idx+1 ] = sbuf[ j+1 ];\n\t\t\tidx += 2; // stride\n\t\t\tj += 2; // stride\n\t\t}\n\t\treturn;\n\t}\n\tif ( isCollection( value ) ) {\n\t\t// Detect whether we've been provided an array of complex numbers...\n\t\tN = value.length;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tif ( !isComplexLike( value[ i ] ) ) {\n\t\t\t\tflg = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t// If an array does not contain only complex numbers, then we assume interleaved real and imaginary components...\n\t\tif ( flg ) {\n\t\t\tif ( !isEven( N ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.', N ) );\n\t\t\t}\n\t\t\tif ( idx+(N/2) > this._length ) {\n\t\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t\t}\n\t\t\tsbuf = value;\n\n\t\t\t// Check for overlapping memory...\n\t\t\tj = buf.byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\t\tif (\n\t\t\t\tsbuf.buffer === buf.buffer &&\n\t\t\t\t(\n\t\t\t\t\tsbuf.byteOffset < j &&\n\t\t\t\t\tsbuf.byteOffset+sbuf.byteLength > j\n\t\t\t\t)\n\t\t\t) {\n\t\t\t\t// We need to copy source values...\n\t\t\t\ttmp = new Float64Array( N );\n\t\t\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t\t\ttmp[ i ] = sbuf[ i ];\n\t\t\t\t}\n\t\t\t\tsbuf = tmp;\n\t\t\t}\n\t\t\tidx *= 2;\n\t\t\tN /= 2;\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t\tbuf[ idx ] = sbuf[ j ];\n\t\t\t\tbuf[ idx+1 ] = sbuf[ j+1 ];\n\t\t\t\tidx += 2; // stride\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\t// If an array contains only complex numbers, then we need to extract real and imaginary components...\n\t\tif ( idx+N > this._length ) {\n\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t}\n\t\tidx *= 2;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tv = value[ i ];\n\t\t\tbuf[ idx ] = real( v );\n\t\t\tbuf[ idx+1 ] = imag( v );\n\t\t\tidx += 2; // stride\n\t\t}\n\t\treturn;\n\t}\n\tthrow new TypeError( format( 'invalid argument. First argument must be either a complex number, an array-like object, or a complex number array. Value: `%s`.', value ) );\n\n\t/* eslint-enable no-underscore-dangle */\n});\n\n/**\n* Copies a portion of a typed array to a new typed array.\n*\n* @name slice\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {integer} [start=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {TypeError} second argument must be an integer\n* @returns {Complex128Array} complex number array\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var arr = new Complex128Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var out = arr.slice();\n* // returns \n*\n* var len = out.length;\n* // returns 5\n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 1.0\n*\n* var im = imag( z );\n* // returns -1.0\n*\n* z = out.get( len-1 );\n* // returns \n*\n* re = real( z );\n* // returns 5.0\n*\n* im = imag( z );\n* // returns -5.0\n*\n* out = arr.slice( 1, -2 );\n* // returns \n*\n* len = out.length;\n* // returns 2\n*\n* z = out.get( 0 );\n* // returns \n*\n* re = real( z );\n* // returns 2.0\n*\n* im = imag( z );\n* // returns -2.0\n*\n* z = out.get( len-1 );\n* // returns \n*\n* re = real( z );\n* // returns 3.0\n*\n* im = imag( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex128Array.prototype, 'slice', function slice( start, end ) {\n\tvar outlen;\n\tvar outbuf;\n\tvar out;\n\tvar idx;\n\tvar buf;\n\tvar len;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length === 0 ) {\n\t\tstart = 0;\n\t\tend = len;\n\t} else {\n\t\tif ( !isInteger( start ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', start ) );\n\t\t}\n\t\tif ( start < 0 ) {\n\t\t\tstart += len;\n\t\t\tif ( start < 0 ) {\n\t\t\t\tstart = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length === 1 ) {\n\t\t\tend = len;\n\t\t} else {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t} else if ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t}\n\t}\n\tif ( start < end ) {\n\t\toutlen = end - start;\n\t} else {\n\t\toutlen = 0;\n\t}\n\tout = new this.constructor( outlen );\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < outlen; i++ ) {\n\t\tidx = 2*(i+start);\n\t\toutbuf[ 2*i ] = buf[ idx ];\n\t\toutbuf[ (2*i)+1 ] = buf[ idx+1 ];\n\t}\n\treturn out;\n});\n\n/**\n* Tests whether at least one element in an array passes a test implemented by a predicate function.\n*\n* @name some\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether at least one element passes a test\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var bool = arr.some( predicate );\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'some', function some( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( predicate.call( thisArg, getComplex128( buf, i ), i, this ) ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Sorts an array in-place.\n*\n* @name sort\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} compareFcn - comparison function\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex128Array} sorted array\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function compare( a, b ) {\n* var re1;\n* var re2;\n* var im1;\n* var im2;\n* re1 = real( a );\n* re2 = real( b );\n* if ( re1 < re2 ) {\n* return -1;\n* }\n* if ( re1 > re2 ) {\n* return 1;\n* }\n* im1 = imag( a );\n* im2 = imag( b );\n* if ( im1 < im2 ) {\n* return -1;\n* }\n* if ( im1 > im2 ) {\n* return 1;\n* }\n* return 0;\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 3.0, -3.0 ], 0 );\n* arr.set( [ 1.0, -1.0 ], 1 );\n* arr.set( [ 2.0, -2.0 ], 2 );\n*\n* var out = arr.sort( compare );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 1.0\n*\n* var im = imag( z );\n* // returns -1.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = real( z );\n* // returns 2.0\n*\n* im = imag( z );\n* // returns -2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = real( z );\n* // returns 3.0\n*\n* im = imag( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex128Array.prototype, 'sort', function sort( compareFcn ) {\n\tvar tmp;\n\tvar buf;\n\tvar len;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( compareFcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', compareFcn ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\ttmp = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\ttmp.push( getComplex128( buf, i ) );\n\t}\n\ttmp.sort( compareFcn );\n\tfor ( i = 0; i < len; i++ ) {\n\t\tj = 2 * i;\n\t\tbuf[ j ] = real( tmp[i] );\n\t\tbuf[ j+1 ] = imag( tmp[i] );\n\t}\n\treturn this;\n});\n\n/**\n* Creates a new typed array view over the same underlying `ArrayBuffer` and with the same underlying data type as the host array.\n*\n* @name subarray\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {integer} [begin=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {TypeError} second argument must be an integer\n* @returns {Complex64Array} subarray\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var arr = new Complex128Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var subarr = arr.subarray();\n* // returns \n*\n* var len = subarr.length;\n* // returns 5\n*\n* var z = subarr.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 1.0\n*\n* var im = imag( z );\n* // returns -1.0\n*\n* z = subarr.get( len-1 );\n* // returns \n*\n* re = real( z );\n* // returns 5.0\n*\n* im = imag( z );\n* // returns -5.0\n*\n* subarr = arr.subarray( 1, -2 );\n* // returns \n*\n* len = subarr.length;\n* // returns 2\n*\n* z = subarr.get( 0 );\n* // returns \n*\n* re = real( z );\n* // returns 2.0\n*\n* im = imag( z );\n* // returns -2.0\n*\n* z = subarr.get( len-1 );\n* // returns \n*\n* re = real( z );\n* // returns 3.0\n*\n* im = imag( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex128Array.prototype, 'subarray', function subarray( begin, end ) {\n\tvar offset;\n\tvar buf;\n\tvar len;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length === 0 ) {\n\t\tbegin = 0;\n\t\tend = len;\n\t} else {\n\t\tif ( !isInteger( begin ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', begin ) );\n\t\t}\n\t\tif ( begin < 0 ) {\n\t\t\tbegin += len;\n\t\t\tif ( begin < 0 ) {\n\t\t\t\tbegin = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length === 1 ) {\n\t\t\tend = len;\n\t\t} else {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t} else if ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t}\n\t}\n\tif ( begin >= len ) {\n\t\tlen = 0;\n\t\toffset = buf.byteLength;\n\t} else if ( begin >= end ) {\n\t\tlen = 0;\n\t\toffset = buf.byteOffset + ( begin*BYTES_PER_ELEMENT );\n\t} else {\n\t\tlen = end - begin;\n\t\toffset = buf.byteOffset + ( begin*BYTES_PER_ELEMENT );\n\t}\n\treturn new this.constructor( buf.buffer, offset, ( len < 0 ) ? 0 : len );\n});\n\n/**\n* Serializes an array as a locale-specific string.\n*\n* @name toLocaleString\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {(string|Array)} [locales] - locale identifier(s)\n* @param {Object} [options] - configuration options\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a string or an array of strings\n* @throws {TypeError} options argument must be an object\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex128Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.toLocaleString();\n* // returns '1 + 1i,2 + 2i'\n*/\nsetReadOnly( Complex128Array.prototype, 'toLocaleString', function toLocaleString( locales, options ) {\n\tvar opts;\n\tvar loc;\n\tvar out;\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( arguments.length === 0 ) {\n\t\tloc = [];\n\t} else if ( isString( locales ) || isStringArray( locales ) ) {\n\t\tloc = locales;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string or an array of strings. Value: `%s`.', locales ) );\n\t}\n\tif ( arguments.length < 2 ) {\n\t\topts = {};\n\t} else if ( isObject( options ) ) {\n\t\topts = options;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );\n\t}\n\tbuf = this._buffer;\n\tout = [];\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex128( buf, i ).toLocaleString( loc, opts ) );\n\t}\n\treturn out.join( ',' );\n});\n\n/**\n* Returns a new typed array containing the elements in reversed order.\n*\n* @name toReversed\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex128Array} reversed array\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.toReversed();\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 3.0\n*\n* var im = imag( z );\n* // returns 3.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = real( z );\n* // returns 2.0\n*\n* im = imag( z );\n* // returns 2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'toReversed', function toReversed() {\n\tvar outbuf;\n\tvar out;\n\tvar len;\n\tvar buf;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tlen = this._length;\n\tout = new this.constructor( len );\n\tbuf = this._buffer;\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < len; i++ ) {\n\t\tj = len - i - 1;\n\t\toutbuf[ (2*i) ] = buf[ (2*j) ];\n\t\toutbuf[ (2*i)+1 ] = buf[ (2*j)+1 ];\n\t}\n\treturn out;\n});\n\n/**\n* Returns a new typed array containing the elements in sorted order.\n*\n* @name toSorted\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} compareFcn - comparison function\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex128Array} sorted array\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function compare( a, b ) {\n* var re1;\n* var re2;\n* var im1;\n* var im2;\n* re1 = real( a );\n* re2 = real( b );\n* if ( re1 < re2 ) {\n* return -1;\n* }\n* if ( re1 > re2 ) {\n* return 1;\n* }\n* im1 = imag( a );\n* im2 = imag( b );\n* if ( im1 < im2 ) {\n* return -1;\n* }\n* if ( im1 > im2 ) {\n* return 1;\n* }\n* return 0;\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 3.0, -3.0 ], 0 );\n* arr.set( [ 1.0, -1.0 ], 1 );\n* arr.set( [ 2.0, -2.0 ], 2 );\n*\n* var out = arr.sort( compare );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 1.0\n*\n* var im = imag( z );\n* // returns -1.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = real( z );\n* // returns 2.0\n*\n* im = imag( z );\n* // returns -2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = real( z );\n* // returns 3.0\n*\n* im = imag( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex128Array.prototype, 'toSorted', function toSorted( compareFcn ) {\n\tvar tmp;\n\tvar buf;\n\tvar len;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( compareFcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', compareFcn ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\ttmp = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\ttmp.push( getComplex128( buf, i ) );\n\t}\n\ttmp.sort( compareFcn );\n\treturn new Complex128Array( tmp );\n});\n\n/**\n* Serializes an array as a string.\n*\n* @name toString\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex128Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.toString();\n* // returns '1 + 1i,2 + 2i'\n*/\nsetReadOnly( Complex128Array.prototype, 'toString', function toString() {\n\tvar out;\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tout = [];\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex128( buf, i ).toString() );\n\t}\n\treturn out.join( ',' );\n});\n\n/**\n* Returns an iterator for iterating over each value in a typed array.\n*\n* @name values\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Iterator} iterator\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var arr = new Complex128Array( 2 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n*\n* var iter = arr.values();\n*\n* var v = iter.next().value;\n* // returns \n*\n* var re = real( v );\n* // returns 1.0\n*\n* var im = imag( v );\n* // returns -1.0\n*\n* v = iter.next().value;\n* // returns \n*\n* re = real( v );\n* // returns 2.0\n*\n* im = imag( v );\n* // returns -2.0\n*\n* var bool = iter.next().done;\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'values', function values() {\n\tvar iter;\n\tvar self;\n\tvar len;\n\tvar FLG;\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tself = this;\n\tbuf = this._buffer;\n\tlen = this._length;\n\n\t// Initialize an iteration index:\n\ti = -1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': getComplex128( buf, i ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.values();\n\t}\n});\n\n/**\n* Returns a new typed array with the element at a provided index replaced with a provided value.\n*\n* @name with\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {integer} index - element index\n* @param {ComplexLike} value - new value\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {TypeError} second argument must be a complex number\n* @returns {Complex128Array} new typed array\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.with( 0, new Complex128( 4.0, 4.0 ) );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 4.0\n*\n* var im = imag( z );\n* // returns 4.0\n*/\nsetReadOnly( Complex128Array.prototype, 'with', function copyWith( index, value ) {\n\tvar buf;\n\tvar out;\n\tvar len;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isInteger( index ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', index ) );\n\t}\n\tlen = this._length;\n\tif ( index < 0 ) {\n\t\tindex += len;\n\t}\n\tif ( index < 0 || index >= len ) {\n\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%s`.', index ) );\n\t}\n\tif ( !isComplexLike( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a complex number. Value: `%s`.', value ) );\n\t}\n\tout = new this.constructor( this._buffer );\n\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tbuf[ 2*index ] = real( value );\n\tbuf[ (2*index)+1 ] = imag( value );\n\treturn out;\n});\n\n\n// EXPORTS //\n\nexport default Complex128Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport real from '@stdlib/complex-float64-real';\nimport imag from '@stdlib/complex-float64-imag';\n\n\n// MAIN //\n\n/**\n* Returns a strided array of real and imaginary components.\n*\n* @private\n* @param {Float64Array} buf - output array\n* @param {Array} arr - array containing complex numbers\n* @returns {(Float64Array|null)} output array or null\n*/\nfunction fromArray( buf, arr ) {\n\tvar len;\n\tvar v;\n\tvar i;\n\tvar j;\n\n\tlen = arr.length;\n\tj = 0;\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = arr[ i ];\n\t\tif ( !isComplexLike( v ) ) {\n\t\t\treturn null;\n\t\t}\n\t\tbuf[ j ] = real( v );\n\t\tbuf[ j+1 ] = imag( v );\n\t\tj += 2; // stride\n\t}\n\treturn buf;\n}\n\n\n// EXPORTS //\n\nexport default fromArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Boolean from '@stdlib/boolean-ctor';\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @returns {Array} output array\n*/\nfunction fromIterator( it ) {\n\tvar out;\n\tvar v;\n\n\tout = [];\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\tout.push( Boolean( v.value ) );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default fromIterator;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArrayLikeObject from '@stdlib/assert-is-array-like-object';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport format from '@stdlib/string-format';\nimport real from '@stdlib/complex-float64-real';\nimport imag from '@stdlib/complex-float64-imag';\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @param {Function} clbk - callback to invoke for each iterated value\n* @param {*} thisArg - invocation context\n* @returns {(Array|TypeError)} array or an error\n*/\nfunction fromIteratorMap( it, clbk, thisArg ) {\n\tvar out;\n\tvar v;\n\tvar z;\n\tvar i;\n\n\tout = [];\n\ti = -1;\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\ti += 1;\n\t\tz = clbk.call( thisArg, v.value, i );\n\t\tif ( isArrayLikeObject( z ) && z.length >= 2 ) {\n\t\t\tout.push( z[ 0 ], z[ 1 ] );\n\t\t} else if ( isComplexLike( z ) ) {\n\t\t\tout.push( real( z ), imag( z ) );\n\t\t} else {\n\t\t\treturn new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', z ) );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default fromIteratorMap;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable no-restricted-syntax, no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\nimport isCollection from '@stdlib/assert-is-collection';\nimport isArrayBuffer from '@stdlib/assert-is-arraybuffer';\nimport isObject from '@stdlib/assert-is-object';\nimport isFunction from '@stdlib/assert-is-function';\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport { primitives as isStringArray } from '@stdlib/assert-is-string-array';\nimport hasIteratorSymbolSupport from '@stdlib/assert-has-iterator-symbol-support';\nimport ITERATOR_SYMBOL from '@stdlib/symbol-iterator';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport setReadOnlyAccessor from '@stdlib/utils-define-nonenumerable-read-only-accessor';\nimport Uint8Array from '@stdlib/array-uint8';\nimport Boolean from '@stdlib/boolean-ctor';\nimport getter from '@stdlib/array-base-getter';\nimport floor from '@stdlib/math-base-special-floor';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport format from '@stdlib/string-format';\nimport fromIterator from './from_iterator.js';\nimport fromIteratorMap from './from_iterator_map.js';\nimport fromArray from './from_array.js';\n\n\n// VARIABLES //\n\nvar BYTES_PER_ELEMENT = Uint8Array.BYTES_PER_ELEMENT;\nvar HAS_ITERATOR_SYMBOL = hasIteratorSymbolSupport();\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating if a value is a `BooleanArray`.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a `BooleanArray`\n*/\nfunction isBooleanArray( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\tvalue.constructor.name === 'BooleanArray' &&\n\t\tvalue.BYTES_PER_ELEMENT === BYTES_PER_ELEMENT\n\t);\n}\n\n/**\n* Returns a boolean indicating if a value is a boolean typed array constructor.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a boolean typed array constructor\n*/\nfunction isBooleanArrayConstructor( value ) {\n\treturn ( value === BooleanArray );\n}\n\n\n// MAIN //\n\n/**\n* Boolean array constructor.\n*\n* @constructor\n* @param {(NonNegativeInteger|Collection|ArrayBuffer|Iterable)} [arg] - length, typed array, array-like object, buffer, or an iterable\n* @param {NonNegativeInteger} [byteOffset=0] - byte offset\n* @param {NonNegativeInteger} [length] - view length\n* @throws {TypeError} if provided only a single argument, must provide a valid argument\n* @throws {TypeError} byte offset must be a nonnegative integer\n* @throws {RangeError} must provide sufficient memory to accommodate byte offset and view length requirements\n* @returns {BooleanArray} boolean array\n*\n* @example\n* var arr = new BooleanArray();\n* // returns \n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var arr = new BooleanArray( 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var arr = new BooleanArray( [ true, false ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = new BooleanArray( buf );\n* // returns \n*\n* var len = arr.length;\n* // returns 16\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = new BooleanArray( buf, 8 );\n* // returns \n*\n* var len = arr.length;\n* // returns 8\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new BooleanArray( buf, 8, 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*/\nfunction BooleanArray() {\n\tvar byteOffset;\n\tvar nargs;\n\tvar buf;\n\tvar len;\n\tvar arg;\n\n\tnargs = arguments.length;\n\tif ( !(this instanceof BooleanArray) ) {\n\t\tif ( nargs === 0 ) {\n\t\t\treturn new BooleanArray();\n\t\t}\n\t\tif ( nargs === 1 ) {\n\t\t\treturn new BooleanArray( arguments[0] );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\treturn new BooleanArray( arguments[0], arguments[1] );\n\t\t}\n\t\treturn new BooleanArray( arguments[0], arguments[1], arguments[2] );\n\t}\n\t// Create the underlying data buffer...\n\tif ( nargs === 0 ) {\n\t\tbuf = new Uint8Array( 0 ); // backward-compatibility\n\t} else if ( nargs === 1 ) {\n\t\targ = arguments[ 0 ];\n\t\tif ( isNonNegativeInteger( arg ) ) {\n\t\t\tbuf = new Uint8Array( arg );\n\t\t} else if ( isCollection( arg ) ) {\n\t\t\tbuf = fromArray( new Uint8Array( arg.length ), arg );\n\t\t} else if ( isArrayBuffer( arg ) ) {\n\t\t\tbuf = new Uint8Array( arg );\n\t\t} else if ( isObject( arg ) ) {\n\t\t\tif ( HAS_ITERATOR_SYMBOL === false ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.', arg ) );\n\t\t\t}\n\t\t\tif ( !isFunction( arg[ ITERATOR_SYMBOL ] ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t\t}\n\t\t\tbuf = arg[ ITERATOR_SYMBOL ]();\n\t\t\tif ( !isFunction( buf.next ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t\t}\n\t\t\tbuf = new Uint8Array( fromIterator( buf ) );\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t}\n\t} else {\n\t\tbuf = arguments[ 0 ];\n\t\tif ( !isArrayBuffer( buf ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an ArrayBuffer. Value: `%s`.', buf ) );\n\t\t}\n\t\tbyteOffset = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( byteOffset ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.', byteOffset ) );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\tbuf = new Uint8Array( buf, byteOffset );\n\t\t} else {\n\t\t\tlen = arguments[ 2 ];\n\t\t\tif ( !isNonNegativeInteger( len ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Length must be a nonnegative integer. Value: `%s`.', len ) );\n\t\t\t}\n\t\t\tif ( (len*BYTES_PER_ELEMENT) > (buf.byteLength-byteOffset) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.', len*BYTES_PER_ELEMENT ) );\n\t\t\t}\n\t\t\tbuf = new Uint8Array( buf, byteOffset, len );\n\t\t}\n\t}\n\tsetReadOnly( this, '_buffer', buf );\n\tsetReadOnly( this, '_length', buf.length );\n\n\treturn this;\n}\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof BooleanArray\n* @readonly\n* @type {PositiveInteger}\n* @default 1\n*\n* @example\n* var nbytes = BooleanArray.BYTES_PER_ELEMENT;\n* // returns 1\n*/\nsetReadOnly( BooleanArray, 'BYTES_PER_ELEMENT', BYTES_PER_ELEMENT );\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof BooleanArray\n* @readonly\n* @type {string}\n* @default 'BooleanArray'\n*\n* @example\n* var str = BooleanArray.name;\n* // returns 'BooleanArray'\n*/\nsetReadOnly( BooleanArray, 'name', 'BooleanArray' );\n\n/**\n* Creates a new boolean array from an array-like object or an iterable.\n*\n* @name from\n* @memberof BooleanArray\n* @type {Function}\n* @param {(Collection|Iterable)} src - array-like object or iterable\n* @param {Function} [clbk] - callback to invoke for each source element\n* @param {*} [thisArg] - context\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be an array-like object or an iterable\n* @throws {TypeError} second argument must be a function\n* @returns {BooleanArray} boolean array\n*\n* @example\n* var arr = BooleanArray.from( [ true, false ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* function clbk( v ) {\n* return !v;\n* }\n*\n* var arr = BooleanArray.from( [ true, false ], clbk );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*/\nsetReadOnly( BooleanArray, 'from', function from( src ) {\n\tvar thisArg;\n\tvar nargs;\n\tvar clbk;\n\tvar out;\n\tvar buf;\n\tvar tmp;\n\tvar get;\n\tvar len;\n\tvar i;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isBooleanArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tnargs = arguments.length;\n\tif ( nargs > 1 ) {\n\t\tclbk = arguments[ 1 ];\n\t\tif ( !isFunction( clbk ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a function. Value: `%s`.', clbk ) );\n\t\t}\n\t\tif ( nargs > 2 ) {\n\t\t\tthisArg = arguments[ 2 ];\n\t\t}\n\t}\n\tif ( isCollection( src ) ) {\n\t\tif ( clbk ) {\n\t\t\tlen = src.length;\n\t\t\tif ( src.get && src.set ) {\n\t\t\t\tget = accessorGetter( 'default' );\n\t\t\t} else {\n\t\t\t\tget = getter( 'default' );\n\t\t\t}\n\t\t\tout = new this( len );\n\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tbuf[ i ] = Boolean( clbk.call( thisArg, get( src, i ), i ) );\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\treturn new this( src );\n\t}\n\tif ( isObject( src ) && HAS_ITERATOR_SYMBOL && isFunction( src[ ITERATOR_SYMBOL ] ) ) { // eslint-disable-line max-len\n\t\tbuf = src[ ITERATOR_SYMBOL ]();\n\t\tif ( !isFunction( buf.next ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n\t\t}\n\t\tif ( clbk ) {\n\t\t\ttmp = fromIteratorMap( buf, clbk, thisArg );\n\t\t} else {\n\t\t\ttmp = fromIterator( buf );\n\t\t}\n\t\tlen = tmp.length;\n\t\tout = new this( len );\n\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tbuf[ i ] = tmp[ i ];\n\t\t}\n\t\treturn out;\n\t}\n\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n});\n\n/**\n* Creates a new boolean array from a variable number of arguments.\n*\n* @name of\n* @memberof BooleanArray\n* @type {Function}\n* @param {...*} element - array elements\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a boolean array\n* @returns {BooleanArray} boolean array\n*\n* @example\n* var arr = BooleanArray.of( true, true, true, true );\n* // returns \n*\n* var len = arr.length;\n* // returns 4\n*/\nsetReadOnly( BooleanArray, 'of', function of() {\n\tvar args;\n\tvar i;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isBooleanArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\targs = [];\n\tfor ( i = 0; i < arguments.length; i++ ) {\n\t\targs.push( arguments[ i ] );\n\t}\n\treturn new this( args );\n});\n\n/**\n* Returns an array element located at integer position (index) `i`, with support for both nonnegative and negative integer indices.\n*\n* @name at\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {integer} idx - element index\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} must provide an integer\n* @returns {(boolean|void)} array element\n*\n* @example\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var v = arr.at( 0 );\n* // returns true\n*\n* v = arr.at( -1 );\n* // returns true\n*\n* v = arr.at( 100 );\n* // returns undefined\n*/\nsetReadOnly( BooleanArray.prototype, 'at', function at( idx ) {\n\tvar buf;\n\tvar len;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an integer. Value: `%s`.', idx ) );\n\t}\n\tlen = this._length;\n\tbuf = this._buffer;\n\tif ( idx < 0 ) {\n\t\tidx += len;\n\t}\n\tif ( idx < 0 || idx >= len ) {\n\t\treturn;\n\t}\n\treturn Boolean( buf[ idx ] );\n});\n\n/**\n* Pointer to the underlying data buffer.\n*\n* @name buffer\n* @memberof BooleanArray.prototype\n* @readonly\n* @type {ArrayBuffer}\n*\n* @example\n* var arr = new BooleanArray( 10 );\n*\n* var buf = arr.buffer;\n* // returns \n*/\nsetReadOnlyAccessor( BooleanArray.prototype, 'buffer', function get() {\n\treturn this._buffer.buffer;\n});\n\n/**\n* Size (in bytes) of the array.\n*\n* @name byteLength\n* @memberof BooleanArray.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new BooleanArray( 10 );\n*\n* var byteLength = arr.byteLength;\n* // returns 10\n*/\nsetReadOnlyAccessor( BooleanArray.prototype, 'byteLength', function get() {\n\treturn this._buffer.byteLength;\n});\n\n/**\n* Offset (in bytes) of the array from the start of its underlying `ArrayBuffer`.\n*\n* @name byteOffset\n* @memberof BooleanArray.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new BooleanArray( 10 );\n*\n* var byteOffset = arr.byteOffset;\n* // returns 0\n*/\nsetReadOnlyAccessor( BooleanArray.prototype, 'byteOffset', function get() {\n\treturn this._buffer.byteOffset;\n});\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof BooleanArray.prototype\n* @readonly\n* @type {PositiveInteger}\n* @default 1\n*\n* @example\n* var arr = new BooleanArray( 10 );\n*\n* var nbytes = arr.BYTES_PER_ELEMENT;\n* // returns 1\n*/\nsetReadOnly( BooleanArray.prototype, 'BYTES_PER_ELEMENT', BooleanArray.BYTES_PER_ELEMENT );\n\n/**\n* Copies a sequence of elements within the array to the position starting at `target`.\n*\n* @name copyWithin\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {integer} target - index at which to start copying elements\n* @param {integer} start - source index at which to copy elements from\n* @param {integer} [end] - source index at which to stop copying elements from\n* @throws {TypeError} `this` must be a boolean array\n* @returns {BooleanArray} modified array\n*\n* @example\n* var arr = new BooleanArray( 4 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( false, 2 );\n* arr.set( true, 3 );\n*\n* // Copy the first two elements to the last two elements:\n* arr.copyWithin( 2, 0, 2 );\n*\n* var v = arr.get( 2 );\n* // returns true\n*\n* v = arr.get( 3 );\n* // returns false\n*/\nsetReadOnly( BooleanArray.prototype, 'copyWithin', function copyWithin( target, start ) {\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\t// FIXME: prefer a functional `copyWithin` implementation which addresses lack of universal browser support (e.g., IE11 and Safari) or ensure that typed arrays are polyfilled\n\tif ( arguments.length === 2 ) {\n\t\tthis._buffer.copyWithin( target, start );\n\t} else {\n\t\tthis._buffer.copyWithin( target, start, arguments[2] );\n\t}\n\treturn this;\n});\n\n/**\n* Returns an iterator for iterating over array key-value pairs.\n*\n* @name entries\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a boolean array\n* @returns {Iterator} iterator\n*\n* @example\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var it = arr.entries();\n*\n* var v = it.next().value;\n* // returns [ 0, true ]\n*\n* v = it.next().value;\n* // returns [ 1, false ]\n*\n* v = it.next().value;\n* // returns [ 2, true ]\n*\n* var bool = it.next().done;\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'entries', function entries() {\n\tvar self;\n\tvar iter;\n\tvar len;\n\tvar buf;\n\tvar FLG;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tself = this;\n\tbuf = this._buffer;\n\tlen = this._length;\n\n\t// Initialize an iteration index:\n\ti = -1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': [ i, Boolean( buf[ i ] ) ],\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.entries();\n\t}\n});\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @name every\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} predicate - predicate function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* function predicate( v ) {\n* return v === true;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( true, 1 );\n* arr.set( true, 2 );\n*\n* var bool = arr.every( predicate );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'every', function every( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( !predicate.call( thisArg, Boolean( buf[ i ] ), i, this ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n});\n\n/**\n* Returns a modified typed array filled with a fill value.\n*\n* @name fill\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {boolean} value - fill value\n* @param {integer} [start=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a boolean\n* @throws {TypeError} second argument must be an integer\n* @throws {TypeError} third argument must be an integer\n* @returns {BooleanArray} modified array\n*\n* @example\n* var arr = new BooleanArray( 3 );\n*\n* arr.fill( true, 1 );\n*\n* var v = arr.get( 0 );\n* // returns false\n*\n* v = arr.get( 1 );\n* // returns true\n*\n* v = arr.get( 2 );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'fill', function fill( value, start, end ) {\n\tvar buf;\n\tvar len;\n\tvar val;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isBoolean( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a boolean. Value: `%s`.', value ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( start ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', start ) );\n\t\t}\n\t\tif ( start < 0 ) {\n\t\t\tstart += len;\n\t\t\tif ( start < 0 ) {\n\t\t\t\tstart = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length > 2 ) {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t} else {\n\t\t\tend = len;\n\t\t}\n\t} else {\n\t\tstart = 0;\n\t\tend = len;\n\t}\n\tif ( value ) {\n\t\tval = 1;\n\t} else {\n\t\tval = 0;\n\t}\n\tfor ( i = start; i < end; i++ ) {\n\t\tbuf[ i ] = val;\n\t}\n\treturn this;\n});\n\n/**\n* Returns a new array containing the elements of an array which pass a test implemented by a predicate function.\n*\n* @name filter\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {BooleanArray} boolean array\n*\n* @example\n* function predicate( v ) {\n* return ( v === true );\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var out = arr.filter( predicate );\n* // returns \n*\n* var len = out.length;\n* // returns 2\n*\n* var v = out.get( 0 );\n* // returns true\n*\n* v = out.get( 1 );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'filter', function filter( predicate, thisArg ) {\n\tvar buf;\n\tvar out;\n\tvar i;\n\tvar v;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tout = [];\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tv = Boolean( buf[ i ] );\n\t\tif ( predicate.call( thisArg, v, i, this ) ) {\n\t\t\tout.push( v );\n\t\t}\n\t}\n\treturn new this.constructor( out );\n});\n\n/**\n* Returns the first element in an array for which a predicate function returns a truthy value.\n*\n* @name find\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} predicate - predicate function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {(boolean|void)} array element or undefined\n*\n* @example\n* function predicate( v ) {\n* return v === true;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var v = arr.find( predicate );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'find', function find( predicate, thisArg ) {\n\tvar buf;\n\tvar v;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tv = Boolean( buf[ i ] );\n\t\tif ( predicate.call( thisArg, v, i, this ) ) {\n\t\t\treturn v;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the first element in an array for which a predicate function returns a truthy value.\n*\n* @name findIndex\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} predicate - predicate function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* function predicate( v ) {\n* return v === true;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var v = arr.findIndex( predicate );\n* // returns 0\n*/\nsetReadOnly( BooleanArray.prototype, 'findIndex', function findIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar v;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tv = Boolean( buf[ i ] );\n\t\tif ( predicate.call( thisArg, v, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLast\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} predicate - predicate function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {(boolean|void)} array element or undefined\n*\n* @example\n* function predicate( v ) {\n* return v === true;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var v = arr.findLast( predicate );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'findLast', function findLast( predicate, thisArg ) {\n\tvar buf;\n\tvar v;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tv = Boolean( buf[ i ] );\n\t\tif ( predicate.call( thisArg, v, i, this ) ) {\n\t\t\treturn v;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLastIndex\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} predicate - predicate function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* function predicate( v ) {\n* return v === true;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var v = arr.findLastIndex( predicate );\n* // returns 2\n*/\nsetReadOnly( BooleanArray.prototype, 'findLastIndex', function findLastIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar v;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tv = Boolean( buf[ i ] );\n\t\tif ( predicate.call( thisArg, v, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Invokes a function once for each array element.\n*\n* @name forEach\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} fcn - function to invoke\n* @param {*} [thisArg] - function invocation context\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n*\n* @example\n* function log( v, i ) {\n* console.log( '%s: %s', i, v.toString() );\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* arr.forEach( log );\n*/\nsetReadOnly( BooleanArray.prototype, 'forEach', function forEach( fcn, thisArg ) {\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tfcn.call( thisArg, Boolean( buf[ i ] ), i, this );\n\t}\n});\n\n/**\n* Returns an array element.\n*\n* @name get\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {NonNegativeInteger} idx - element index\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} must provide a nonnegative integer\n* @returns {(boolean|void)} array element\n*\n* @example\n* var arr = new BooleanArray( 10 );\n*\n* var v = arr.get( 0 );\n* // returns false\n*\n* arr.set( [ true, false ], 0 );\n*\n* v = arr.get( 0 );\n* // returns true\n*\n* v = arr.get( 100 );\n* // returns undefined\n*/\nsetReadOnly( BooleanArray.prototype, 'get', function get( idx ) {\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isNonNegativeInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a nonnegative integer. Value: `%s`.', idx ) );\n\t}\n\tif ( idx >= this._length ) {\n\t\treturn;\n\t}\n\treturn Boolean( this._buffer[ idx ] );\n});\n\n/**\n* Returns a boolean indicating whether an array includes a provided value.\n*\n* @name includes\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {boolean} searchElement - search element\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a boolean value\n* @throws {TypeError} second argument must be an integer\n* @returns {boolean} boolean indicating whether an array includes a value\n*\n* @example\n* var arr = new BooleanArray( 5 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n* arr.set( true, 3 );\n* arr.set( true, 4 );\n*\n* var bool = arr.includes( true );\n* // returns true\n*\n* bool = arr.includes( false, 2 );\n* // returns false\n*/\nsetReadOnly( BooleanArray.prototype, 'includes', function includes( searchElement, fromIndex ) {\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isBoolean( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a boolean. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tif ( searchElement === Boolean( buf[ i ] ) ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Returns the first index at which a given element can be found.\n*\n* @name indexOf\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {boolean} searchElement - element to find\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a boolean value\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* var arr = new BooleanArray( 5 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n* arr.set( true, 3 );\n* arr.set( true, 4 );\n*\n* var idx = arr.indexOf( true );\n* // returns 0\n*\n* idx = arr.indexOf( false, 2 );\n* // returns -1\n*\n* idx = arr.indexOf( false, -3 );\n* // returns -1\n*/\nsetReadOnly( BooleanArray.prototype, 'indexOf', function indexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isBoolean( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a boolean. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tif ( searchElement === Boolean( buf[ i ] ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns a new string by concatenating all array elements.\n*\n* @name join\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {string} [separator=','] - element separator\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a string\n* @returns {string} string representation\n*\n* @example\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var str = arr.join();\n* // returns 'true,false,true'\n*\n* str = arr.join( '|' );\n* // returns 'true|false|true'\n*/\nsetReadOnly( BooleanArray.prototype, 'join', function join( separator ) {\n\tvar buf;\n\tvar out;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( arguments.length > 0 ) {\n\t\tif ( !isString( separator ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string. Value: `%s`.', separator ) );\n\t\t}\n\t} else {\n\t\tseparator = ',';\n\t}\n\tbuf = this._buffer;\n\tout = [];\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( buf[i] ) {\n\t\t\tout.push( 'true' );\n\t\t} else {\n\t\t\tout.push( 'false' );\n\t\t}\n\t}\n\treturn out.join( separator );\n});\n\n/**\n* Returns an iterator for iterating over each index key in a typed array.\n*\n* @name keys\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a boolean array\n* @returns {Iterator} iterator\n*\n* @example\n* var arr = new BooleanArray( 2 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n*\n* var iter = arr.keys();\n*\n* var v = iter.next().value;\n* // returns 0\n*\n* v = iter.next().value;\n* // returns 1\n*\n* var bool = iter.next().done;\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'keys', function keys() {\n\tvar self;\n\tvar iter;\n\tvar len;\n\tvar FLG;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tself = this;\n\tlen = this._length;\n\n\t// Initialize an iteration index:\n\ti = -1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': i,\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.keys();\n\t}\n});\n\n/**\n* Returns the last index at which a given element can be found.\n*\n* @name lastIndexOf\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {boolean} searchElement - element to find\n* @param {integer} [fromIndex] - starting index (inclusive)\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a boolean value\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* var arr = new BooleanArray( 5 );\n*\n* arr.set( true, 0 );\n* arr.set( true, 1 );\n* arr.set( true, 2 );\n* arr.set( false, 3 );\n* arr.set( true, 4 );\n*\n* var idx = arr.lastIndexOf( true );\n* // returns 4\n*\n* idx = arr.lastIndexOf( false, 2 );\n* // returns -1\n*\n* idx = arr.lastIndexOf( false, -3 );\n* // returns -1\n*/\nsetReadOnly( BooleanArray.prototype, 'lastIndexOf', function lastIndexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isBoolean( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a boolean. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex >= this._length ) {\n\t\t\tfromIndex = this._length - 1;\n\t\t} else if ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t}\n\t} else {\n\t\tfromIndex = this._length - 1;\n\t}\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i >= 0; i-- ) {\n\t\tif ( searchElement === Boolean( buf[ i ] ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Number of array elements.\n*\n* @name length\n* @memberof BooleanArray.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new BooleanArray( 10 );\n*\n* var len = arr.length;\n* // returns 10\n*/\nsetReadOnlyAccessor( BooleanArray.prototype, 'length', function get() {\n\treturn this._length;\n});\n\n/**\n* Returns a new array with each element being the result of a provided callback function.\n*\n* @name map\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} fcn - callback function\n* @param {*} [thisArg] - callback function execution context\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {BooleanArray} new boolean array\n*\n* @example\n* function invert( v ) {\n* return !v;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var out = arr.map( invert );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns false\n*\n* z = out.get( 1 );\n* // returns true\n*\n* z = out.get( 2 );\n* // returns false\n*/\nsetReadOnly( BooleanArray.prototype, 'map', function map( fcn, thisArg ) {\n\tvar outbuf;\n\tvar out;\n\tvar buf;\n\tvar i;\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( 'invalid argument. First argument must be a function. Value: `%s`.', fcn );\n\t}\n\tbuf = this._buffer;\n\tout = new this.constructor( this._length );\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\toutbuf[ i ] = Boolean( fcn.call( thisArg, Boolean( buf[ i ] ), i, this ) );\n\t}\n\treturn out;\n});\n\n/**\n* Applies a provided callback function to each element of the array, in order, passing in the return value from the calculation on the preceding element and returning the accumulated result upon completion.\n*\n* @name reduce\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} reducer - callback function\n* @param {*} [initialValue] - initial value\n* @throws {TypeError} `this` must be a boolean array\n* @throws {Error} if not provided an initial value, the array must have at least one element\n* @returns {*} accumulated result\n*\n* @example\n* function reducer( acc, v ) {\n* if ( v ) {\n* return acc + 1;\n* }\n* return acc;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var out = arr.reduce( reducer, 0 );\n* // returns 2\n*/\nsetReadOnly( BooleanArray.prototype, 'reduce', function reduce( reducer, initialValue ) {\n\tvar buf;\n\tvar len;\n\tvar acc;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( reducer ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', reducer ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tacc = initialValue;\n\t\ti = 0;\n\t} else {\n\t\tif ( len === 0 ) {\n\t\t\tthrow new Error( 'invalid operation. If not provided an initial value, an array must contain at least one element.' );\n\t\t}\n\t\tacc = Boolean( buf[ 0 ] );\n\t\ti = 1;\n\t}\n\tfor ( ; i < len; i++ ) {\n\t\tacc = reducer( acc, Boolean( buf[ i ] ), i, this );\n\t}\n\treturn acc;\n});\n\n/**\n* Applies a provided callback function to each element of the array, in reverse order, passing in the return value from the calculation on the preceding element and returning the accumulated result upon completion.\n*\n* @name reduceRight\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} reducer - callback function\n* @param {*} [initialValue] - initial value\n* @throws {TypeError} `this` must be a boolean array\n* @throws {Error} if not provided an initial value, the array must have at least one element\n* @returns {*} accumulated result\n*\n* @example\n* function reducer( acc, v ) {\n* if ( v ) {\n* return acc + 1;\n* }\n* return acc;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var out = arr.reduceRight( reducer, 0 );\n* // returns 2\n*/\nsetReadOnly( BooleanArray.prototype, 'reduceRight', function reduceRight( reducer, initialValue ) {\n\tvar buf;\n\tvar len;\n\tvar acc;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( reducer ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', reducer ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tacc = initialValue;\n\t\ti = len - 1;\n\t} else {\n\t\tif ( len === 0 ) {\n\t\t\tthrow new Error( 'invalid operation. If not provided an initial value, an array must contain at least one element.' );\n\t\t}\n\t\tacc = Boolean( buf[ len-1 ] );\n\t\ti = len - 2;\n\t}\n\tfor ( ; i >= 0; i-- ) {\n\t\tacc = reducer( acc, Boolean( buf[ i ] ), i, this );\n\t}\n\treturn acc;\n});\n\n/**\n* Reverses an array in-place.\n*\n* @name reverse\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a boolean array\n* @returns {BooleanArray} reversed array\n*\n* @example\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( false, 2 );\n*\n* var out = arr.reverse();\n* // returns \n*\n* var v = out.get( 0 );\n* // returns false\n*\n* v = out.get( 1 );\n* // returns false\n*\n* v = out.get( 2 );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'reverse', function reverse() {\n\tvar buf;\n\tvar tmp;\n\tvar len;\n\tvar N;\n\tvar i;\n\tvar j;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tN = floor( len / 2 );\n\tfor ( i = 0; i < N; i++ ) {\n\t\tj = len - i - 1;\n\t\ttmp = buf[ i ];\n\t\tbuf[ i ] = buf[ j ];\n\t\tbuf[ j ] = tmp;\n\t}\n\treturn this;\n});\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* - When provided a typed array, we must check whether the source array shares the same buffer as the target array and whether the underlying memory overlaps. In particular, we are concerned with the following scenario:\n*\n* ```text\n* buf: ---------------------\n* src: ---------------------\n* ```\n*\n* In the above, as we copy values from `src`, we will overwrite values in the `src` view, resulting in duplicated values copied into the end of `buf`, which is not intended. Hence, to avoid overwriting source values, we must **copy** source values to a temporary array.\n*\n* In the other overlapping scenario,\n*\n* ```text\n* buf: ---------------------\n* src: ---------------------\n* ```\n*\n* by the time we begin copying into the overlapping region, we are copying from the end of `src`, a non-overlapping region, which means we don't run the risk of copying copied values, rather than the original `src` values, as intended.\n*\n* @name set\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {(Collection|BooleanArray|*)} value - value(s)\n* @param {NonNegativeInteger} [i=0] - element index at which to start writing values\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} index argument must be a nonnegative integer\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {RangeError} target array lacks sufficient storage to accommodate source values\n* @returns {void}\n*\n* @example\n* var arr = new BooleanArray( 10 );\n*\n* var v = arr.get( 0 );\n* // returns false\n*\n* arr.set( [ true, false ], 0 );\n*\n* v = arr.get( 0 );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'set', function set( value ) {\n\tvar sbuf;\n\tvar idx;\n\tvar buf;\n\tvar tmp;\n\tvar N;\n\tvar i;\n\tvar j;\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tbuf = this._buffer;\n\tif ( arguments.length > 1 ) {\n\t\tidx = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( idx ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Index argument must be a nonnegative integer. Value: `%s`.', idx ) );\n\t\t}\n\t} else {\n\t\tidx = 0;\n\t}\n\tif ( isCollection( value ) ) {\n\t\tN = value.length;\n\t\tif ( idx+N > this._length ) {\n\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t}\n\t\tif ( isBooleanArray( value ) ) {\n\t\t\tsbuf = value._buffer; // eslint-disable-line no-underscore-dangle\n\t\t} else {\n\t\t\tsbuf = value;\n\t\t}\n\t\t// Check for overlapping memory...\n\t\tj = buf.byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\tif (\n\t\t\tsbuf.buffer === buf.buffer &&\n\t\t\t(\n\t\t\t\tsbuf.byteOffset < j &&\n\t\t\t\tsbuf.byteOffset+sbuf.byteLength > j\n\t\t\t)\n\t\t) {\n\t\t\t// We need to copy source values...\n\t\t\ttmp = new Uint8Array( sbuf.length );\n\t\t\tfor ( i = 0; i < sbuf.length; i++ ) {\n\t\t\t\ttmp[ i ] = sbuf[ i ]; // TODO: handle accessor arrays\n\t\t\t}\n\t\t\tsbuf = tmp;\n\t\t}\n\t\tfor ( i = 0; i < N; idx++, i++ ) {\n\t\t\tbuf[ idx ] = ( sbuf[ i ] ) ? 1 : 0;\n\t\t}\n\t\treturn;\n\t}\n\tif ( idx >= this._length ) {\n\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%u`.', idx ) );\n\t}\n\tbuf[ idx ] = ( value ) ? 1 : 0;\n});\n\n/**\n* Copies a portion of a typed array to a new typed array.\n*\n* @name slice\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {integer} [begin] - start index (inclusive)\n* @param {integer} [end] - end index (exclusive)\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be integer\n* @throws {TypeError} second argument must be integer\n* @returns {BooleanArray} boolean array\n*\n* @example\n* var arr = new BooleanArray( 5 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n* arr.set( false, 3 );\n* arr.set( true, 4 );\n*\n* var out = arr.slice();\n* // returns \n*\n* var len = out.length;\n* // returns 5\n*\n* var bool = out.get( 0 );\n* // returns true\n*\n* bool = out.get( len-1 );\n* // returns true\n*\n* out = arr.slice( 1, -2 );\n* // returns \n*\n* len = out.length;\n* // returns 2\n*\n* bool = out.get( 0 );\n* // returns false\n*\n* bool = out.get( len-1 );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'slice', function slice( begin, end ) {\n\tvar outlen;\n\tvar outbuf;\n\tvar out;\n\tvar buf;\n\tvar len;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length === 0 ) {\n\t\tbegin = 0;\n\t\tend = len;\n\t} else {\n\t\tif ( !isInteger( begin ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', begin ) );\n\t\t}\n\t\tif ( begin < 0 ) {\n\t\t\tbegin += len;\n\t\t\tif ( begin < 0 ) {\n\t\t\t\tbegin = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length === 1 ) {\n\t\t\tend = len;\n\t\t} else {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t} else if ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t}\n\t}\n\tif ( begin < end ) {\n\t\toutlen = end - begin;\n\t} else {\n\t\toutlen = 0;\n\t}\n\tout = new this.constructor( outlen );\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < outlen; i++ ) {\n\t\toutbuf[ i ] = buf[ i+begin ];\n\t}\n\treturn out;\n});\n\n/**\n* Tests whether at least one element in an array passes a test implemented by a predicate function.\n*\n* @name some\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} predicate - predicate function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether at least one element passes a test\n*\n* @example\n* function predicate( v ) {\n* return v === true;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( false, 0 );\n* arr.set( true, 1 );\n* arr.set( false, 2 );\n*\n* var bool = arr.some( predicate );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'some', function some( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( predicate.call( thisArg, Boolean( buf[ i ] ), i, this ) ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Sorts an array in-place.\n*\n* @name sort\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} [compareFcn] - comparison function\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {BooleanArray} sorted array\n*\n* @example\n* function compare( a, b ) {\n* if ( a === false ) {\n* if ( b === false ) {\n* return 0;\n* }\n* return 1;\n* }\n* if ( b === true ) {\n* return 0;\n* }\n* return -1;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* arr.sort( compare );\n*\n* var v = arr.get( 0 );\n* // returns true\n*\n* v = arr.get( 1 );\n* // returns true\n*\n* v = arr.get( 2 );\n* // returns false\n*/\nsetReadOnly( BooleanArray.prototype, 'sort', function sort( compareFcn ) {\n\tvar buf;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tbuf = this._buffer;\n\tif ( arguments.length === 0 ) {\n\t\tbuf.sort();\n\t\treturn this;\n\t}\n\tif ( !isFunction( compareFcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', compareFcn ) );\n\t}\n\tbuf.sort( compare );\n\treturn this;\n\n\t/**\n\t* Comparison function for sorting.\n\t*\n\t* @private\n\t* @param {boolean} a - first boolean value for comparison\n\t* @param {boolean} b - second boolean value for comparison\n\t* @returns {number} comparison result\n\t*/\n\tfunction compare( a, b ) {\n\t\treturn compareFcn( Boolean( a ), Boolean( b ) );\n\t}\n});\n\n/**\n* Creates a new typed array view over the same underlying `ArrayBuffer` and with the same underlying data type as the host array.\n*\n* @name subarray\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {integer} [begin] - start index (inclusive)\n* @param {integer} [end] - end index (exclusive)\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be an integer\n* @throws {TypeError} second argument must be an integer\n* @returns {BooleanArray} subarray\n*\n* @example\n* var arr = new BooleanArray( 5 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n* arr.set( false, 3 );\n* arr.set( true, 4 );\n*\n* var subarr = arr.subarray();\n* // returns \n*\n* var len = subarr.length;\n* // returns 5\n*\n* var bool = subarr.get( 0 );\n* // returns true\n*\n* bool = subarr.get( len-1 );\n* // returns true\n*\n* subarr = arr.subarray( 1, -2 );\n* // returns \n*\n* len = subarr.length;\n* // returns 2\n*\n* bool = subarr.get( 0 );\n* // returns false\n*\n* bool = subarr.get( len-1 );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'subarray', function subarray( begin, end ) {\n\tvar offset;\n\tvar buf;\n\tvar len;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length === 0 ) {\n\t\tbegin = 0;\n\t\tend = len;\n\t} else {\n\t\tif ( !isInteger( begin ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', begin ) );\n\t\t}\n\t\tif ( begin < 0 ) {\n\t\t\tbegin += len;\n\t\t\tif ( begin < 0 ) {\n\t\t\t\tbegin = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length === 1 ) {\n\t\t\tend = len;\n\t\t} else {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t} else if ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t}\n\t}\n\tif ( begin >= len ) {\n\t\tlen = 0;\n\t\toffset = buf.byteLength;\n\t} else if ( begin >= end ) {\n\t\tlen = 0;\n\t\toffset = buf.byteOffset + ( begin*BYTES_PER_ELEMENT );\n\t} else {\n\t\tlen = end - begin;\n\t\toffset = buf.byteOffset + ( begin*BYTES_PER_ELEMENT );\n\t}\n\treturn new this.constructor( buf.buffer, offset, ( len < 0 ) ? 0 : len );\n});\n\n/**\n* Serializes an array as a locale-specific string.\n*\n* @name toLocaleString\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {(string|Array)} [locales] - locale identifier(s)\n* @param {Object} [options] - configuration options\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a string or an array of strings\n* @throws {TypeError} options argument must be an object\n* @returns {string} string representation\n*\n* @example\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var str = arr.toLocaleString();\n* // returns 'true,false,true'\n*/\nsetReadOnly( BooleanArray.prototype, 'toLocaleString', function toLocaleString( locales, options ) {\n\tvar opts;\n\tvar loc;\n\tvar out;\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( arguments.length === 0 ) {\n\t\tloc = [];\n\t} else if ( isString( locales ) || isStringArray( locales ) ) {\n\t\tloc = locales;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string or an array of strings. Value: `%s`.', locales ) );\n\t}\n\tif ( arguments.length < 2 ) {\n\t\topts = {};\n\t} else if ( isObject( options ) ) {\n\t\topts = options;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );\n\t}\n\tbuf = this._buffer;\n\tout = [];\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( Boolean( buf[ i ] ).toLocaleString( loc, opts ) );\n\t}\n\treturn out.join( ',' );\n});\n\n/**\n* Returns a new typed array containing the elements in reversed order.\n*\n* @name toReversed\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a boolean array\n* @returns {BooleanArray} reversed array\n*\n* @example\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( false, 2 );\n*\n* var out = arr.toReversed();\n* // returns \n*\n* var v = out.get( 0 );\n* // returns false\n*\n* v = out.get( 1 );\n* // returns false\n*\n* v = out.get( 2 );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'toReversed', function toReversed() {\n\tvar outbuf;\n\tvar out;\n\tvar len;\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tlen = this._length;\n\tout = new this.constructor( len );\n\tbuf = this._buffer;\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < len; i++ ) {\n\t\toutbuf[ i ] = buf[ len - i - 1 ];\n\t}\n\treturn out;\n});\n\n/**\n* Returns a new typed array containing the elements in sorted order.\n*\n* @name toSorted\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} [compareFcn] - comparison function\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {BooleanArray} sorted array\n*\n* @example\n* function compare( a, b ) {\n* if ( a === false ) {\n* if ( b === false ) {\n* return 0;\n* }\n* return 1;\n* }\n* if ( b === true ) {\n* return 0;\n* }\n* return -1;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var out = arr.sort( compare );\n* // returns \n*\n* var v = out.get( 0 );\n* // returns true\n*\n* v = out.get( 1 );\n* // returns true\n*\n* v = out.get( 2 );\n* // returns false\n*/\nsetReadOnly( BooleanArray.prototype, 'toSorted', function toSorted( compareFcn ) {\n\tvar outbuf;\n\tvar out;\n\tvar len;\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tlen = this._length;\n\tout = new this.constructor( len );\n\tbuf = this._buffer;\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < len; i++ ) {\n\t\toutbuf[ i ] = buf[ i ];\n\t}\n\tif ( arguments.length === 0 ) {\n\t\toutbuf.sort();\n\t\treturn out;\n\t}\n\tif ( !isFunction( compareFcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', compareFcn ) );\n\t}\n\toutbuf.sort( compare );\n\treturn out;\n\n\t/**\n\t* Comparison function for sorting.\n\t*\n\t* @private\n\t* @param {boolean} a - first boolean value for comparison\n\t* @param {boolean} b - second boolean value for comparison\n\t* @returns {number} comparison result\n\t*/\n\tfunction compare( a, b ) {\n\t\treturn compareFcn( Boolean( a ), Boolean( b ) );\n\t}\n});\n\n/**\n* Serializes an array as a string.\n*\n* @name toString\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a boolean array\n* @returns {string} string representation\n*\n* @example\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var str = arr.toString();\n* // returns 'true,false,true'\n*/\nsetReadOnly( BooleanArray.prototype, 'toString', function toString() {\n\tvar out;\n\tvar buf;\n\tvar i;\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tout = [];\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( buf[i] ) {\n\t\t\tout.push( 'true' );\n\t\t} else {\n\t\t\tout.push( 'false' );\n\t\t}\n\t}\n\treturn out.join( ',' );\n});\n\n/**\n* Returns an iterator for iterating over each value in a typed array.\n*\n* @name values\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a boolean array\n* @returns {Iterator} iterator\n*\n* @example\n* var arr = new BooleanArray( 2 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n*\n* var iter = arr.values();\n*\n* var v = iter.next().value;\n* // returns true\n*\n* v = iter.next().value;\n* // returns false\n*\n* var bool = iter.next().done;\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'values', function values() {\n\tvar iter;\n\tvar self;\n\tvar len;\n\tvar FLG;\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tself = this;\n\tbuf = this._buffer;\n\tlen = this._length;\n\n\t// Initialize an iteration index:\n\ti = -1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': Boolean( buf[ i ] ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.values();\n\t}\n});\n\n/**\n* Returns a new typed array with the element at a provided index replaced with a provided value.\n*\n* @name with\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {integer} index - element index\n* @param {boolean} value - new value\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be an integer\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {TypeError} second argument must be a boolean\n* @returns {BooleanArray} new typed array\n*\n* @example\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var out = arr.with( 0, false );\n* // returns \n*\n* var v = out.get( 0 );\n* // returns false\n*/\nsetReadOnly( BooleanArray.prototype, 'with', function copyWith( index, value ) {\n\tvar buf;\n\tvar out;\n\tvar len;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isInteger( index ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', index ) );\n\t}\n\tlen = this._length;\n\tif ( index < 0 ) {\n\t\tindex += len;\n\t}\n\tif ( index < 0 || index >= len ) {\n\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%s`.', index ) );\n\t}\n\tif ( !isBoolean( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a boolean. Value: `%s`.', value ) );\n\t}\n\tout = new this.constructor( this._buffer );\n\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tif ( value ) {\n\t\tbuf[ index ] = 1;\n\t} else {\n\t\tbuf[ index ] = 0;\n\t}\n\treturn out;\n});\n\n\n// EXPORTS //\n\nexport default BooleanArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Boolean from '@stdlib/boolean-ctor';\n\n\n// MAIN //\n\n/**\n* Fills an output array with \"boolean\" values.\n*\n* @private\n* @param {Uint8Array} buf - output array\n* @param {Array} arr - input array\n* @returns {Uint8Array} output array\n*/\nfunction fromArray( buf, arr ) {\n\tvar len;\n\tvar i;\n\n\tlen = arr.length;\n\tfor ( i = 0; i < len; i++ ) {\n\t\tbuf[ i ] = Boolean( arr[ i ] );\n\t}\n\treturn buf;\n}\n\n\n// EXPORTS //\n\nexport default fromArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Boolean from '@stdlib/boolean-ctor';\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @param {Function} clbk - callback to invoke for each iterated value\n* @param {*} thisArg - invocation context\n* @returns {Array} output array\n*/\nfunction fromIteratorMap( it, clbk, thisArg ) {\n\tvar out;\n\tvar v;\n\tvar i;\n\n\tout = [];\n\ti = -1;\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\ti += 1;\n\t\tout.push( Boolean( clbk.call( thisArg, v.value, i ) ) );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default fromIteratorMap;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Float64Array from '@stdlib/array-float64';\nimport Float32Array from '@stdlib/array-float32';\nimport Uint32Array from '@stdlib/array-uint32';\nimport Int32Array from '@stdlib/array-int32';\nimport Uint16Array from '@stdlib/array-uint16';\nimport Int16Array from '@stdlib/array-int16';\nimport Uint8Array from '@stdlib/array-uint8';\nimport Uint8ClampedArray from '@stdlib/array-uint8c';\nimport Int8Array from '@stdlib/array-int8';\nimport Complex64Array from '@stdlib/array-complex64';\nimport Complex128Array from '@stdlib/array-complex128';\nimport BooleanArray from '@stdlib/array-bool';\n\n\n// MAIN //\n\n// Note: order should match `dtypes` order\nvar CTORS = [\n\tFloat64Array,\n\tFloat32Array,\n\tInt32Array,\n\tUint32Array,\n\tInt16Array,\n\tUint16Array,\n\tInt8Array,\n\tUint8Array,\n\tUint8ClampedArray,\n\tComplex64Array,\n\tComplex128Array,\n\tBooleanArray\n];\n\n\n// EXPORTS //\n\nexport default CTORS;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n// Note: order should match `ctors` order\nvar DTYPES = [\n\t'float64',\n\t'float32',\n\t'int32',\n\t'uint32',\n\t'int16',\n\t'uint16',\n\t'int8',\n\t'uint8',\n\t'uint8c',\n\t'complex64',\n\t'complex128',\n\t'bool'\n];\n\n\n// EXPORTS //\n\nexport default DTYPES;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isBuffer from '@stdlib/assert-is-buffer';\nimport isArray from '@stdlib/assert-is-array';\nimport constructorName from '@stdlib/utils-constructor-name';\nimport ctor2dtype from './ctor2dtype.js';\nimport CTORS from './ctors.js';\nimport DTYPES from './dtypes.js';\n\n\n// VARIABLES //\n\nvar NTYPES = DTYPES.length;\n\n\n// MAIN //\n\n/**\n* Returns the data type of an array.\n*\n* @param {*} value - input value\n* @returns {(string|null)} data type\n*\n* @example\n* var dt = dtype( [ 1, 2, 3 ] );\n* // returns 'generic'\n*\n* var dt = dtype( 'beep' );\n* // returns null\n*/\nfunction dtype( value ) {\n\tvar i;\n\tif ( isArray( value ) ) {\n\t\treturn 'generic';\n\t}\n\tif ( isBuffer( value ) ) {\n\t\treturn null;\n\t}\n\tfor ( i = 0; i < NTYPES; i++ ) {\n\t\tif ( value instanceof CTORS[ i ] ) {\n\t\t\treturn DTYPES[ i ];\n\t\t}\n\t}\n\t// If the above failed, fall back to a more robust (and significantly slower) means for resolving underlying data types:\n\treturn ctor2dtype[ constructorName( value ) ] || null;\n}\n\n\n// EXPORTS //\n\nexport default dtype;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests if an object has a specified property, either own or inherited.\n*\n* @param {*} value - value to test\n* @param {*} property - property to test\n* @returns {boolean} boolean indicating if an object has a specified property\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = hasProp( beep, 'boop' );\n* // returns true\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = hasProp( beep, 'bap' );\n* // returns false\n*/\nfunction hasProp( value, property ) {\n\tif ( value === void 0 || value === null ) {\n\t\treturn false;\n\t}\n\tif ( typeof property === 'symbol' ) {\n\t\treturn property in Object( value );\n\t}\n\treturn ( String( property ) in Object( value ) );\n}\n\n\n// EXPORTS //\n\nexport default hasProp;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isAccessorArray from '@stdlib/array-base-assert-is-accessor-array';\nimport resolveGetter from '@stdlib/array-base-resolve-getter';\nimport hasProp from '@stdlib/assert-has-property';\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether at least one element in a provided indexed array has a specified property key-value pair, either own or inherited.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {(string|symbol|number)} prop - property\n* @param {*} value - property value\n* @returns {boolean} result\n*\n* @example\n* var o1 = {\n* 'a': 1\n* };\n* var o2 = {\n* 'b': 2\n* };\n* var o3 = {\n* 'c': 3\n* };\n*\n* var bool = indexed( [ o1, o2, o3 ], 'b', 2 );\n* // returns true\n*\n* bool = indexed( [ o1, o2, o3 ], 'b', 3 );\n* // returns false\n*\n* bool = indexed( [ o1, o2, o3 ], 'd', 0 );\n* // returns false\n*/\nfunction indexed( arr, prop, value ) {\n\tvar v;\n\tvar i;\n\tif ( value === void 0 ) {\n\t\tfor ( i = 0; i < arr.length; i++ ) {\n\t\t\tv = arr[ i ];\n\t\t\tif ( hasProp( v, prop ) && v[ prop ] === value ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\tfor ( i = 0; i < arr.length; i++ ) {\n\t\tif ( arr[ i ][ prop ] === value ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n/**\n* Tests whether at least one element in a provided accessor array has a specified property key-value pair, either own or inherited.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {(string|symbol|number)} prop - property\n* @param {*} value - property value\n* @returns {boolean} result\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n*\n* var o1 = {\n* 'a': 1\n* };\n* var o2 = {\n* 'b': 2\n* };\n* var o3 = {\n* 'c': 3\n* };\n*\n* var bool = accessors( toAccessorArray( [ o1, o2, o3 ] ), 'b', 2 );\n* // returns true\n*\n* bool = accessors( toAccessorArray( [ o1, o2, o3 ] ), 'b', 3 );\n* // returns false\n*\n* bool = accessors( toAccessorArray( [ o1, o2, o3 ] ), 'd', 0 );\n* // returns false\n*/\nfunction accessors( arr, prop, value ) {\n\tvar get;\n\tvar v;\n\tvar i;\n\n\tget = resolveGetter( arr );\n\tif ( value === void 0 ) {\n\t\tfor ( i = 0; i < arr.length; i++ ) {\n\t\t\tv = get( arr, i );\n\t\t\tif ( hasProp( v, prop ) && v[ prop ] === value ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\tfor ( i = 0; i < arr.length; i++ ) {\n\t\tif ( get( arr, i )[ prop ] === value ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// MAIN //\n\n/**\n* Tests whether at least one element in a provided array has a specified property key-value pair, either own or inherited.\n*\n* @param {Collection} arr - input array\n* @param {(string|symbol|number)} prop - property\n* @param {*} value - property value\n* @returns {boolean} result\n*\n* @example\n* var o1 = {\n* 'a': 1\n* };\n* var o2 = {\n* 'b': 2\n* };\n* var o3 = {\n* 'c': 3\n* };\n*\n* var bool = anyIsEntryIn( [ o1, o2, o3 ], 'b', 2 );\n* // returns true\n*\n* bool = anyIsEntryIn( [ o1, o2, o3 ], 'b', 3 );\n* // returns false\n*\n* bool = anyIsEntryIn( [ o1, o2, o3 ], 'd', 0 );\n* // returns false\n*/\nfunction anyIsEntryIn( arr, prop, value ) {\n\tif ( isAccessorArray( arr ) ) {\n\t\treturn accessors( arr, prop, value );\n\t}\n\treturn indexed( arr, prop, value );\n}\n\n\n// EXPORTS //\n\nexport default anyIsEntryIn;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isAccessorArray from '@stdlib/array-base-assert-is-accessor-array';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport getter from '@stdlib/array-base-getter';\nimport dtype from '@stdlib/array-dtype';\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for retrieving an element from an array-like object.\n*\n* @param {Collection} x - input array\n* @returns {Function} accessor\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var get = resolveGetter( arr );\n* var v = get( arr, 2 );\n* // returns 3\n*/\nfunction resolveGetter( x ) {\n\tvar dt = dtype( x );\n\tif ( isAccessorArray( x ) ) {\n\t\treturn accessorGetter( dt );\n\t}\n\treturn getter( dt );\n}\n\n\n// EXPORTS //\n\nexport default resolveGetter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Formats an error message for production.\n*\n* @param {string} code - error code\n* @param {*} ...args - error message arguments\n* @returns {string} formatted error message\n*\n* @example\n* var msg = fmtprodmsg( '3', 'wrong_type' );\n* // returns 'https://stdlib.io/e/3?&arg[]=wrong_type'\n*/\nfunction fmtprodmsg() {\n\tvar a = arguments;\n\tvar c = a[ 0 ];\n\tvar u = 'https://stdlib.io/e/'+c+'?';\n\tvar i;\n\tfor ( i = 1; i < a.length; i++ ) {\n\t\tu += '&arg[]=' + encodeURIComponent( a[ i ] );\n\t}\n\treturn u;\n}\n\n\n// EXPORTS //\n\nexport default fmtprodmsg;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Generates a linearly spaced numeric array whose elements increment by 1 starting from zero.\n*\n* @param {number} n - number of elements\n* @returns {Array} linearly spaced numeric array\n*\n* @example\n* var arr = zeroTo( 6 );\n* // returns [ 0, 1, 2, 3, 4, 5 ]\n*/\nfunction zeroTo( n ) {\n\tvar arr;\n\tvar i;\n\n\tarr = [];\n\tif ( n <= 0 ) {\n\t\treturn arr;\n\t}\n\tfor ( i = 0; i < n; i++ ) {\n\t\tarr.push( i );\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nexport default zeroTo;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport arraylike2object from '@stdlib/array-base-arraylike2object';\nimport reinterpret128 from '@stdlib/strided-base-reinterpret-complex128';\nimport reinterpret64 from '@stdlib/strided-base-reinterpret-complex64';\n\n\n// FUNCTIONS //\n\n/**\n* Fills an indexed array with linearly spaced numeric elements which increment by 1 starting from zero.\n*\n* @private\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {Collection} output array\n*\n* @example\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n*\n* var arr = indexed( out, 1, 0 );\n* // returns [ 0, 1, 2, 3, 4, 5 ]\n*\n* @example\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n*\n* var arr = indexed( out, -1, out.length-1 );\n* // returns [ 5, 4, 3, 2, 1, 0 ]\n*/\nfunction indexed( out, stride, offset ) {\n\tvar v;\n\tvar i;\n\n\ti = offset;\n\tv = 0;\n\twhile ( i >= 0 && i < out.length ) {\n\t\tout[ i ] = v;\n\t\ti += stride;\n\t\tv += 1;\n\t}\n\treturn out;\n}\n\n/**\n* Fills a complex number array with linearly spaced numeric elements which increment by 1 starting from zero.\n*\n* @private\n* @param {(Complex128Array|Complex64Array)} out - output complex number array\n* @param {(Float64Array|Float32Array)} data - output array data\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {(Complex128Array|Complex64Array)} output array\n*\n* @example\n* import Complex128Array from '@stdlib/array-complex128';\n* import reinterpret128 from '@stdlib/strided-base-reinterpret-complex128';\n*\n* var out = new Complex128Array( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n* // returns \n*\n* var data = reinterpret128( out, 0 );\n* // returns [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ]\n*\n* var arr = complex( out, data, 1, 0 );\n* // returns \n*\n* var bool = ( arr === out );\n* // returns true\n*\n* data = reinterpret128( out, 0 );\n* returns [ 0.0, 0.0, 1.0, 0.0, 2.0, 0.0 ]\n*/\nfunction complex( out, data, stride, offset ) {\n\tvar v;\n\tvar s;\n\tvar i;\n\n\ts = stride * 2;\n\ti = offset * 2;\n\tv = 0.0;\n\twhile ( i >= 0 && i < data.length ) {\n\t\tdata[ i ] = v; // real component\n\t\tdata[ i+1 ] = 0.0; // imaginary component\n\t\ti += s;\n\t\tv += 1.0;\n\t}\n\treturn out;\n}\n\n/**\n* Fills an accessor array with linearly spaced numeric elements which increment by 1 starting from zero.\n*\n* @private\n* @param {Object} out - output array object\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {Collection} output array\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import arraylike2object from '@stdlib/array-base-arraylike2object';\n\n* var out = toAccessorArray( [ 0, 0, 0, 0, 0, 0 ] );\n* var arr = accessors( arraylike2object( out ), 1, 0 );\n*\n* var bool = ( arr === out );\n* // returns true\n*\n* var v = out.get( 0 );\n* // returns 0\n*\n* v = out.get( out.length-1 );\n* // returns 5\n*/\nfunction accessors( out, stride, offset ) {\n\tvar data;\n\tvar set;\n\tvar v;\n\tvar i;\n\n\tdata = out.data;\n\tset = out.accessors[ 1 ];\n\n\ti = offset;\n\tv = 0;\n\twhile ( i >= 0 && i < data.length ) {\n\t\tset( data, i, v );\n\t\ti += stride;\n\t\tv += 1;\n\t}\n\treturn data;\n}\n\n\n// MAIN //\n\n/**\n* Fills an array with linearly spaced numeric elements which increment by 1 starting from zero.\n*\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {Collection} output array\n*\n* @example\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n*\n* var arr = assign( out, 1, 0 );\n* // returns [ 0, 1, 2, 3, 4, 5 ]\n*\n* @example\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n*\n* var arr = assign( out, -1, out.length-1 );\n* // returns [ 5, 4, 3, 2, 1, 0 ]\n*/\nfunction assign( out, stride, offset ) {\n\tvar obj = arraylike2object( out );\n\tif ( obj.accessorProtocol ) {\n\t\t// If provided a complex number array, reinterpret as a real typed array and only set the real components...\n\t\tif ( obj.dtype === 'complex128' ) {\n\t\t\treturn complex( out, reinterpret128( out, 0 ), stride, offset );\n\t\t}\n\t\tif ( obj.dtype === 'complex64' ) {\n\t\t\treturn complex( out, reinterpret64( out, 0 ), stride, offset );\n\t\t}\n\t\treturn accessors( obj, stride, offset );\n\t}\n\treturn indexed( out, stride, offset );\n}\n\n\n// EXPORTS //\n\nexport default assign;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Takes elements from an indexed array.\n*\n* @param {Collection} x - input array\n* @param {NonNegativeIntegerArray} indices - list of indices\n* @returns {Array} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n* var indices = [ 3, 1, 2, 0 ];\n*\n* var y = take( x, indices );\n* // returns [ 4, 2, 3, 1 ]\n*/\nfunction take( x, indices ) {\n\tvar out;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < indices.length; i++ ) {\n\t\tout.push( x[ indices[ i ] ] ); // use `Array#push` to ensure \"fast\" elements\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default take;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-loop-interchange-order';\n\n\n// MAIN //\n\n/**\n* Reorders ndarray dimensions and associated strides for loop interchange.\n*\n* ## Notes\n*\n* - The returned object has the following properties:\n*\n* - **sh**: dimensions sorted in loop order.\n* - **sx**: first input ndarray strides sorted in loop order.\n* - **sy**: second input ndarray strides sorted in loop order.\n* - **sz**: output ndarray strides sorted in loop order.\n*\n* @param {NonNegativeIntegerArray} sh - array dimensions\n* @param {IntegerArray} sx - first input array stride lengths\n* @param {IntegerArray} sy - second input array stride lengths\n* @param {IntegerArray} sz - output array stride lengths\n* @returns {Object} loop interchange data\n*\n* @example\n* var sh = [ 2, 3, 4 ];\n*\n* var sx = [ 12, 4, 1 ]; // row-major\n* var sy = [ 24, 8, 1 ]; // row-major\n* var sz = [ 1, -2, 6 ]; // column-major\n*\n* var o = binaryLoopOrder( sh, sx, sy, sz );\n* // returns {...}\n*\n* var ssh = o.sh;\n* // returns [ 4, 3, 2 ]\n*\n* var ssx = o.sx;\n* // returns [ 1, 4, 12 ]\n*\n* var ssy = o.sy;\n* // returns [ 1, 8, 24 ]\n*\n* var ssz = o.sz;\n* // returns [ 6, -2, 1 ]\n*/\nfunction binaryLoopOrder( sh, sx, sy, sz ) {\n\tvar tmp = loopOrder( sh, [ sx, sy, sz ] );\n\treturn {\n\t\t'sh': tmp[ 0 ],\n\t\t'sx': tmp[ 1 ],\n\t\t'sy': tmp[ 2 ],\n\t\t'sz': tmp[ 3 ]\n\t};\n}\n\n\n// EXPORTS //\n\nexport default binaryLoopOrder;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport zeroTo from '@stdlib/array-base-zero-to';\nimport copy from '@stdlib/array-base-copy-indexed';\nimport take from '@stdlib/array-base-take-indexed';\nimport strides2order from '@stdlib/ndarray-base-strides2order';\nimport sort2ins from './sort2ins.js';\n\n\n// MAIN //\n\n/**\n* Reorders ndarray dimensions and associated strides for loop interchange.\n*\n* ## Notes\n*\n* - The returned array has the following elements:\n*\n* ```text\n* [ , ... ]\n* ```\n*\n* where\n*\n* - **shape**: dimensions sorted in loop order.\n* - **...strides**: strides for each respective ndarray sorted in loop order.\n*\n* @param {NonNegativeIntegerArray} shape - array dimensions\n* @param {ArrayLikeObject>} strides - list of stride arrays containing the stride lengths for each input and output ndarray\n* @returns {Array} loop interchange data\n*\n* @example\n* var sh = [ 2, 3, 4 ];\n*\n* var sx = [ 12, 4, 1 ]; // row-major\n* var sy = [ 24, 8, 1 ]; // row-major\n* var sz = [ 1, -2, 6 ]; // column-major\n*\n* var o = loopOrder( sh, [ sx, sy, sz ] );\n* // returns [...]\n*\n* var ssh = o[ 0 ];\n* // returns [ 4, 3, 2 ]\n*\n* var ssx = o[ 1 ];\n* // returns [ 1, 4, 12 ]\n*\n* var ssy = o[ 2 ];\n* // returns [ 1, 8, 24 ]\n*\n* var ssz = o[ 3 ];\n* // returns [ 6, -2, 1 ]\n*/\nfunction loopOrder( shape, strides ) {\n\tvar idx;\n\tvar tmp;\n\tvar max;\n\tvar len;\n\tvar out;\n\tvar st;\n\tvar N;\n\tvar M;\n\tvar i;\n\tvar j;\n\n\tN = strides.length;\n\n\t// Initialize an array for grouping stride arrays according to memory layout:\n\ttmp = [];\n\tfor ( i = 0; i < 4; i++ ) { // note: `4` corresponds to the number of possible return values from `strides2order`\n\t\ttmp.push( [] );\n\t}\n\tM = tmp.length;\n\n\t// Group stride arrays according to memory layout:\n\tfor ( i = 0; i < N; i++ ) {\n\t\ttmp[ strides2order( strides[ i ] ) ].push( strides[ i ] );\n\t}\n\t// Determine which array should be used to generate the loop order:\n\tmax = tmp[ 0 ].length;\n\tif ( max === N ) {\n\t\t// If all arrays are \"disorganized\", then just use the first array, as, generally, each array is likely to be as un-ideal as every other:\n\t\tst = strides[ 0 ];\n\t} else if ( max === N-1 ) {\n\t\t// If all but one array is \"disorganized\", find the \"organized\" array...\n\t\tfor ( i = 1; i < M; i++ ) {\n\t\t\tif ( tmp[ i ].length ) {\n\t\t\t\tst = tmp[ i ][ 0 ];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t} else {\n\t\t// Find the layout which is most common...\n\t\tj = 0;\n\t\tfor ( i = 1; i < M; i++ ) {\n\t\t\tlen = tmp[ i ].length;\n\t\t\tif ( len >= max ) {\n\t\t\t\tmax = len;\n\t\t\t\tj = i;\n\t\t\t}\n\t\t}\n\t\t// Use the strides of the first array having the most common layout:\n\t\tst = tmp[ j ][ 0 ];\n\t}\n\t// Initialize a loop interchange index array for generating a loop order permutation:\n\tidx = zeroTo( shape.length );\n\n\t// Sort strides in increasing order of magnitude:\n\tsort2ins( copy( st ), idx );\n\n\t// Permute the shape based on the sorted strides:\n\tout = [ take( shape, idx ) ];\n\n\t// Permute each stride array based on the sorted strides:\n\tfor ( i = 0; i < N; i++ ) {\n\t\tout.push( take( strides[ i ], idx ) );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default loopOrder;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Simultaneously sorts two arrays based on the sort order of the first array using insertion sort.\n*\n* ## Notes\n*\n* - The first array is sorted in increasing order according to absolute value.\n* - The algorithm has space complexity `O(1)` and worst case time complexity `O(N^2)`.\n* - The algorithm is efficient for small arrays (typically `N <= 20`) and is particularly efficient for sorting arrays which are already substantially sorted.\n* - The algorithm is **stable**, meaning that the algorithm does **not** change the order of array elements which are equal or equivalent.\n* - The input arrays are sorted in-place (i.e., the input arrays are mutated).\n*\n* @private\n* @param {Array} x - first array\n* @param {Array} y - second array\n* @returns {void}\n*\n* @example\n* var x = [ -4, -2, 3, 1 ];\n* var y = [ 0, 1, 2, 3 ];\n*\n* sort2ins( x, y );\n*\n* console.log( x );\n* // => [ 1, -2, 3, -4 ]\n*\n* console.log( y );\n* // => [ 3, 1, 2, 0 ]\n*/\nfunction sort2ins( x, y ) {\n\tvar avx;\n\tvar aux;\n\tvar ix;\n\tvar iy;\n\tvar jx;\n\tvar jy;\n\tvar vx;\n\tvar vy;\n\tvar ux;\n\tvar i;\n\n\tix = 1;\n\tiy = 1;\n\n\t// Sort in increasing order...\n\tfor ( i = 1; i < x.length; i++ ) {\n\t\tvx = x[ ix ];\n\t\tavx = ( vx < 0 ) ? -vx : vx;\n\n\t\tvy = y[ iy ];\n\n\t\tjx = ix - 1;\n\t\tjy = iy - 1;\n\n\t\t// Shift all larger values to the left of the current element to the right...\n\t\twhile ( jx >= 0 ) {\n\t\t\tux = x[ jx ];\n\t\t\taux = ( ux < 0 ) ? -ux : ux;\n\t\t\tif ( aux <= avx ) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tx[ jx+1 ] = ux;\n\t\t\ty[ jy+1 ] = y[ jy ];\n\t\t\tjx -= 1;\n\t\t\tjy -= 1;\n\t\t}\n\t\tx[ jx+1 ] = vx;\n\t\ty[ jy+1 ] = vy;\n\t\tix += 1;\n\t\tiy += 1;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default sort2ins;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number primitive having a positive integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive having a positive integer value\n*\n* @example\n* var bool = isPositiveInteger( 3.0 );\n* // returns true\n*\n* @example\n* var bool = isPositiveInteger( new Number( 3.0 ) );\n* // returns false\n*/\nfunction isPositiveInteger( value ) {\n\treturn (\n\t\tisInteger( value ) &&\n\t\tvalue > 0.0\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isPositiveInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isObject as isInteger } from '@stdlib/assert-is-integer';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object having a positive integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object having a positive integer value\n*\n* @example\n* var bool = isPositiveInteger( 3.0 );\n* // returns false\n*\n* @example\n* var bool = isPositiveInteger( new Number( 3.0 ) );\n* // returns true\n*/\nfunction isPositiveInteger( value ) {\n\treturn (\n\t\tisInteger( value ) &&\n\t\tvalue.valueOf() > 0.0\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isPositiveInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a positive integer.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a positive integer\n*\n* @example\n* var bool = isPositiveInteger( 5.0 );\n* // returns true\n*\n* @example\n* var bool = isPositiveInteger( new Number( 5.0 ) );\n* // returns true\n*\n* @example\n* var bool = isPositiveInteger( 0.0 );\n* // returns false\n*\n* @example\n* var bool = isPositiveInteger( -5.0 );\n* // returns false\n*\n* @example\n* var bool = isPositiveInteger( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isPositiveInteger( null );\n* // returns false\n*/\nfunction isPositiveInteger( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isPositiveInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names.\n*\n* ## Notes\n*\n* - In contrast to the built-in `Object.keys()`, this function returns an empty array if provided `undefined` or `null`, rather than throwing an error.\n*\n* @private\n* @param {*} value - input object\n* @returns {Array} a list of own enumerable property names\n*\n* @example\n* var obj = {\n* 'beep': 'boop',\n* 'foo': 3.14\n* };\n*\n* var k = keys( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nfunction keys( value ) {\n\treturn Object.keys( Object( value ) );\n}\n\n\n// EXPORTS //\n\nexport default keys;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate a linearly spaced numeric array whose elements increment by 1 starting from zero.\n*\n* @module @stdlib/array-base-zero-to\n*\n* @example\n* import zeroTo from '@stdlib/array-base-zero-to';\n*\n* var arr = zeroTo( 6 );\n* // returns [ 0, 1, 2, 3, 4, 5 ]\n*\n* @example\n* import zeroTo from '@stdlib/array-base-zero-to';\n*\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n* var arr = zeroTo.assign( out, 1, 0 );\n* // returns [ 0, 1, 2, 3, 4, 5 ]\n*\n* var bool = ( out === arr );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport assign from './assign.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isAccessorArray from '@stdlib/array-base-assert-is-accessor-array';\nimport getter from '@stdlib/array-base-getter';\nimport setter from '@stdlib/array-base-setter';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport accessorSetter from '@stdlib/array-base-accessor-setter';\nimport dtype from '@stdlib/array-dtype';\n\n\n// MAIN //\n\n/**\n* Converts an array-like to an object likely to have the same \"shape\".\n*\n* ## Notes\n*\n* - This function is intended as a potential performance optimization. In V8, for example, even if two objects share common properties, if those properties were added in different orders or if one object has additional properties not shared by the other object, then those objects will have different \"hidden\" classes. If a function is provided many objects having different \"shapes\", some JavaScript VMs (e.g., V8) will consider the function \"megamorphic\" and fail to perform various runtime optimizations. Accordingly, the intent of this function is to standardize the \"shape\" of the object holding array meta data to ensure that internal functions operating on arrays are provided consistent argument \"shapes\".\n*\n* - The returned object has the following properties:\n*\n* - **data**: reference to the input array.\n* - **dtype**: array data type.\n* - **accessorProtocol**: `boolean` indicating whether the input array uses accessors for getting and setting elements.\n* - **accessors**: a two-element array whose first element is an accessor for retrieving an array element and whose second element is an accessor for setting an array element.\n*\n* @param {Collection} x - array-like object\n* @returns {Object} object containing array meta data\n*\n* @example\n* var obj = arraylike2object( [ 1, 2, 3, 4 ] );\n* // returns {...}\n*/\nfunction arraylike2object( x ) {\n\tvar dt = dtype( x );\n\tif ( isAccessorArray( x ) ) {\n\t\treturn {\n\t\t\t'data': x,\n\t\t\t'dtype': dt,\n\t\t\t'accessorProtocol': true,\n\t\t\t'accessors': [\n\t\t\t\taccessorGetter( dt ),\n\t\t\t\taccessorSetter( dt )\n\t\t\t]\n\t\t};\n\t}\n\treturn {\n\t\t'data': x,\n\t\t'dtype': dt,\n\t\t'accessorProtocol': false,\n\t\t'accessors': [\n\t\t\tgetter( dt ),\n\t\t\tsetter( dt )\n\t\t]\n\t};\n}\n\n\n// EXPORTS //\n\nexport default arraylike2object;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a positive integer.\n*\n* @module @stdlib/assert-is-positive-integer\n*\n* @example\n* import isPositiveInteger from '@stdlib/assert-is-positive-integer';\n*\n* var bool = isPositiveInteger( 5.0 );\n* // returns true\n*\n* bool = isPositiveInteger( new Number( 5.0 ) );\n* // returns true\n*\n* bool = isPositiveInteger( -5.0 );\n* // returns false\n*\n* bool = isPositiveInteger( 3.14 );\n* // returns false\n*\n* bool = isPositiveInteger( null );\n* // returns false\n*\n* @example\n* import { isPrimitive as isPositiveInteger } from '@stdlib/assert-is-positive-integer';\n*\n* var bool = isPositiveInteger( 3.0 );\n* // returns true\n*\n* bool = isPositiveInteger( new Number( 3.0 ) );\n* // returns false\n*\n* @example\n* import { isObject as isPositiveInteger } from '@stdlib/assert-is-positive-integer';\n*\n* var bool = isPositiveInteger( 3.0 );\n* // returns false\n*\n* bool = isPositiveInteger( new Number( 3.0 ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar bool = ( typeof Object.keys !== 'undefined' );\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArguments from './main.js';\n\n\n// VARIABLES //\n\nvar bool;\n\n\n// FUNCTIONS //\n\n/**\n* Detects whether an environment returns the expected internal class of the `arguments` object.\n*\n* @private\n* @returns {boolean} boolean indicating whether an environment behaves as expected\n*\n* @example\n* var bool = detect();\n* // returns \n*/\nfunction detect() {\n\treturn isArguments( arguments );\n}\n\n\n// MAIN //\n\nbool = detect();\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// MAIN //\n\n/**\n* Tests whether a value is an `arguments` object.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is an `arguments` object\n*\n* @example\n* function foo() {\n* return arguments;\n* }\n*\n* var bool = isArguments( foo() );\n* // returns true\n*\n* @example\n* var bool = isArguments( [] );\n* // returns false\n*/\nfunction isArguments( value ) {\n\treturn ( nativeClass( value ) === '[object Arguments]' );\n}\n\n\n// EXPORTS //\n\nexport default isArguments;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests if a double-precision floating-point numeric value is `NaN`.\n*\n* @param {number} x - value to test\n* @returns {boolean} boolean indicating whether the value is `NaN`\n*\n* @example\n* var bool = isnan( NaN );\n* // returns true\n*\n* @example\n* var bool = isnan( 7.0 );\n* // returns false\n*/\nfunction isnan( x ) {\n\treturn ( x !== x );\n}\n\n\n// EXPORTS //\n\nexport default isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport isNan from '@stdlib/math-base-assert-is-nan';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a `NaN` number primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a `NaN` number primitive\n*\n* @example\n* var bool = isnan( NaN );\n* // returns true\n*\n* @example\n* var bool = isnan( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isnan( new Number( NaN ) );\n* // returns false\n*/\nfunction isnan( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisNan( value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isObject as isNumber } from '@stdlib/assert-is-number';\nimport isNan from '@stdlib/math-base-assert-is-nan';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object having a value of `NaN`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object having a value of `NaN`\n*\n* @example\n* var bool = isnan( NaN );\n* // returns false\n*\n* @example\n* var bool = isnan( new Number( NaN ) );\n* // returns true\n*/\nfunction isnan( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisNan( value.valueOf() )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is `NaN`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is `NaN`\n*\n* @example\n* var bool = isnan( NaN );\n* // returns true\n*\n* @example\n* var bool = isnan( new Number( NaN ) );\n* // returns true\n*\n* @example\n* var bool = isnan( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isnan( null );\n* // returns false\n*/\nfunction isnan( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is `NaN`.\n*\n* @module @stdlib/assert-is-nan\n*\n* @example\n* import isnan from '@stdlib/assert-is-nan';\n*\n* var bool = isnan( NaN );\n* // returns true\n*\n* bool = isnan( new Number( NaN ) );\n* // returns true\n*\n* bool = isnan( 3.14 );\n* // returns false\n*\n* bool = isnan( null );\n* // returns false\n*\n* @example\n* import { isPrimitive as isnan } from '@stdlib/assert-is-nan';\n*\n* var bool = isnan( NaN );\n* // returns true\n*\n* bool = isnan( 3.14 );\n* // returns false\n*\n* bool = isnan( new Number( NaN ) );\n* // returns false\n*\n* @example\n* import { isObject as isnan } from '@stdlib/assert-is-nan';\n*\n* var bool = isnan( NaN );\n* // returns false\n*\n* bool = isnan( new Number( NaN ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests if an object's own property is enumerable.\n*\n* @private\n* @name isEnumerableProperty\n* @type {Function}\n* @param {*} value - value to test\n* @param {*} property - property to test\n* @returns {boolean} boolean indicating if an object property is enumerable\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = isEnumerableProperty.call( beep, 'boop' );\n* // returns true\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = isEnumerableProperty.call( beep, 'hasOwnProperty' );\n* // returns false\n*/\nvar isEnumerableProperty = Object.prototype.propertyIsEnumerable;\n\n\n// EXPORTS //\n\nexport default isEnumerableProperty;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isEnum from './native.js';\n\n\n// VARIABLES //\n\nvar bool;\n\n\n// FUNCTIONS //\n\n/**\n* Detects whether an environment has a bug where String indices are not detected as \"enumerable\" properties. Observed in Node v0.10.\n*\n* @private\n* @returns {boolean} boolean indicating whether an environment has the bug\n*/\nfunction detect() {\n\treturn !isEnum.call( 'beep', '0' );\n}\n\n\n// MAIN //\n\nbool = detect();\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isString from '@stdlib/assert-is-string';\nimport { isPrimitive as isnan } from '@stdlib/assert-is-nan';\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport isEnum from './native.js';\nimport hasStringEnumBug from './has_string_enumerability_bug.js';\n\n\n// MAIN //\n\n/**\n* Tests if an object's own property is enumerable.\n*\n* @param {*} value - value to test\n* @param {*} property - property to test\n* @returns {boolean} boolean indicating if an object property is enumerable\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = isEnumerableProperty( beep, 'boop' );\n* // returns true\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = isEnumerableProperty( beep, 'hasOwnProperty' );\n* // returns false\n*/\nfunction isEnumerableProperty( value, property ) {\n\tvar bool;\n\tif (\n\t\tvalue === void 0 ||\n\t\tvalue === null\n\t) {\n\t\treturn false;\n\t}\n\tbool = isEnum.call( value, property );\n\tif ( !bool && hasStringEnumBug && isString( value ) ) {\n\t\t// Note: we only check for indices, as properties attached to a `String` object are properly detected as enumerable above.\n\t\tproperty = +property;\n\t\treturn (\n\t\t\t!isnan( property ) &&\n\t\t\tisInteger( property ) &&\n\t\t\tproperty >= 0 &&\n\t\t\tproperty < value.length\n\t\t);\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default isEnumerableProperty;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an `arguments` object.\n*\n* @module @stdlib/assert-is-arguments\n*\n* @example\n* import isArguments from '@stdlib/assert-is-arguments';\n*\n* function foo() {\n* return arguments;\n* }\n*\n* var bool = isArguments( foo() );\n* // returns true\n*\n* bool = isArguments( [] );\n* // returns false\n*/\n\n// MODULES //\n\nimport hasArgumentsClass from './detect.js';\nimport main from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar isArguments;\nif ( hasArgumentsClass ) {\n\tisArguments = main;\n} else {\n\tisArguments = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default isArguments;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport isEnumerableProperty from '@stdlib/assert-is-enumerable-property';\nimport isArray from '@stdlib/assert-is-array';\nimport isInteger from '@stdlib/math-base-assert-is-integer';\nimport MAX_LENGTH from '@stdlib/constants-uint32-max';\n\n\n// MAIN //\n\n/**\n* Tests whether a value is an `arguments` object.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is an `arguments` object\n*\n* @example\n* function foo() {\n* return arguments;\n* }\n*\n* var bool = isArguments( foo() );\n* // returns true\n*\n* @example\n* var bool = isArguments( [] );\n* // returns false\n*/\nfunction isArguments( value ) {\n\treturn (\n\t\tvalue !== null &&\n\t\ttypeof value === 'object' &&\n\t\t!isArray( value ) &&\n\t\ttypeof value.length === 'number' &&\n\t\tisInteger( value.length ) &&\n\t\tvalue.length >= 0 &&\n\t\tvalue.length <= MAX_LENGTH &&\n\t\thasOwnProp( value, 'callee' ) &&\n\t\t!isEnumerableProperty( value, 'callee' )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isArguments;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArguments from '@stdlib/assert-is-arguments';\nimport builtin from './builtin.js';\n\n\n// VARIABLES //\n\nvar slice = Array.prototype.slice;\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names.\n*\n* @private\n* @param {*} value - input object\n* @returns {Array} a list of own enumerable property names\n*\n* @example\n* var obj = {\n* 'beep': 'boop',\n* 'foo': 3.14\n* };\n*\n* var k = keys( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nfunction keys( value ) {\n\tif ( isArguments( value ) ) {\n\t\treturn builtin( slice.call( value ) );\n\t}\n\treturn builtin( value );\n}\n\n\n// EXPORTS //\n\nexport default keys;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isEnumerableProperty from '@stdlib/assert-is-enumerable-property';\nimport noop from '@stdlib/utils-noop';\n\n\n// MAIN //\n\n// Note: certain environments treat an object's prototype as enumerable, which, as a matter of convention, it shouldn't be...\nvar bool = isEnumerableProperty( noop, 'prototype' );\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* No operation.\n*\n* @example\n* noop();\n* // ...does nothing.\n*/\nfunction noop() {\n\t// Empty function...\n}\n\n\n// EXPORTS //\n\nexport default noop;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isEnumerableProperty from '@stdlib/assert-is-enumerable-property';\n\n\n// VARIABLES //\n\nvar obj = {\n\t'toString': null\n};\n\n\n// MAIN //\n\n// Note: certain environments don't allow enumeration of overwritten properties which are considered non-enumerable...\nvar bool = !isEnumerableProperty( obj, 'toString' );\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isnan from '@stdlib/assert-is-nan';\nimport isCollection from '@stdlib/assert-is-collection';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns the first index at which a given element can be found.\n*\n* @param {ArrayLike} arr - array-like object\n* @param {*} searchElement - element to find\n* @param {integer} [fromIndex] - starting index (if negative, the start index is determined relative to last element)\n* @throws {TypeError} must provide an array-like object\n* @throws {TypeError} third argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* var arr = [ 4, 3, 2, 1 ];\n* var idx = indexOf( arr, 3 );\n* // returns 1\n*\n* @example\n* var arr = [ 4, 3, 2, 1 ];\n* var idx = indexOf( arr, 5 );\n* // returns -1\n*\n* @example\n* // Using a `fromIndex`:\n* var arr = [ 1, 2, 3, 4, 5, 2, 6 ];\n* var idx = indexOf( arr, 2, 3 );\n* // returns 5\n*\n* @example\n* // `fromIndex` which exceeds `array` length:\n* var arr = [ 1, 2, 3, 4, 2, 5 ];\n* var idx = indexOf( arr, 2, 10 );\n* // returns -1\n*\n* @example\n* // Negative `fromIndex`:\n* var arr = [ 1, 2, 3, 4, 5, 2, 6, 2 ];\n* var idx = indexOf( arr, 2, -4 );\n* // returns 5\n*\n* idx = indexOf( arr, 2, -1 );\n* // returns 7\n*\n* @example\n* // Negative `fromIndex` exceeding input `array` length:\n* var arr = [ 1, 2, 3, 4, 5, 2, 6 ];\n* var idx = indexOf( arr, 2, -10 );\n* // returns 1\n*\n* @example\n* // Array-like objects:\n* var str = 'bebop';\n* var idx = indexOf( str, 'o' );\n* // returns 3\n*/\nfunction indexOf( arr, searchElement, fromIndex ) {\n\tvar len;\n\tvar i;\n\tif ( !isCollection( arr ) && !isString( arr ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object. Value: `%s`.', arr ) );\n\t}\n\tlen = arr.length;\n\tif ( len === 0 ) {\n\t\treturn -1;\n\t}\n\tif ( arguments.length === 3 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex >= 0 ) {\n\t\t\tif ( fromIndex >= len ) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\ti = fromIndex;\n\t\t} else {\n\t\t\ti = len + fromIndex;\n\t\t\tif ( i < 0 ) {\n\t\t\t\ti = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\ti = 0;\n\t}\n\t// Check for `NaN`...\n\tif ( isnan( searchElement ) ) {\n\t\tfor ( ; i < len; i++ ) {\n\t\t\tif ( isnan( arr[i] ) ) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfor ( ; i < len; i++ ) {\n\t\t\tif ( arr[ i ] === searchElement ) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\n\n\n// EXPORTS //\n\nexport default indexOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests whether a value equals the prototype of its constructor.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value equals the prototype of its constructor\n*/\nfunction isConstructorPrototype( value ) {\n\treturn ( value.constructor && value.constructor.prototype === value );\n}\n\n\n// EXPORTS //\n\nexport default isConstructorPrototype;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasArgumentsBug from './has_arguments_bug.js';\nimport HAS_BUILTIN from './has_builtin.js';\nimport builtin from './builtin.js';\nimport wrapper from './builtin_wrapper.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names.\n*\n* @name keys\n* @type {Function}\n* @param {*} value - input object\n* @returns {Array} a list of own enumerable property names\n*\n* @example\n* var obj = {\n* 'beep': 'boop',\n* 'foo': 3.14\n* };\n*\n* var k = keys( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nvar keys;\nif ( HAS_BUILTIN ) {\n\tif ( hasArgumentsBug() ) {\n\t\tkeys = wrapper;\n\t} else {\n\t\tkeys = builtin;\n\t}\n} else {\n\tkeys = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default keys;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar w = ( typeof window === 'undefined' ) ? void 0 : window;\n\n\n// EXPORTS //\n\nexport default w;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport indexOf from '@stdlib/utils-index-of';\nimport typeOf from '@stdlib/utils-type-of';\nimport isConstructorPrototype from './is_constructor_prototype.js';\nimport EXCLUDED_KEYS from './excluded_keys.json';\nimport win from './window.js';\n\n\n// VARIABLES //\n\nvar bool;\n\n\n// FUNCTIONS //\n\n/**\n* Determines whether an environment throws when comparing to the prototype of a value's constructor (e.g., [IE9][1]).\n*\n* [1]: https://stackoverflow.com/questions/7688070/why-is-comparing-the-constructor-property-of-two-windows-unreliable\n*\n* @private\n* @returns {boolean} boolean indicating whether an environment is buggy\n*/\nfunction check() {\n\tvar k;\n\tif ( typeOf( win ) === 'undefined' ) {\n\t\treturn false;\n\t}\n\tfor ( k in win ) { // eslint-disable-line guard-for-in\n\t\ttry {\n\t\t\tif (\n\t\t\t\tindexOf( EXCLUDED_KEYS, k ) === -1 &&\n\t\t\t\thasOwnProp( win, k ) &&\n\t\t\t\twin[ k ] !== null &&\n\t\t\t\ttypeOf( win[ k ] ) === 'object'\n\t\t\t) {\n\t\t\t\tisConstructorPrototype( win[ k ] );\n\t\t\t}\n\t\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// MAIN //\n\nbool = check();\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar bool = ( typeof window !== 'undefined' );\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport keys from './builtin.js';\n\n\n// FUNCTIONS //\n\n/**\n* Tests the built-in `Object.keys()` implementation when provided `arguments`.\n*\n* @private\n* @returns {boolean} boolean indicating whether the built-in implementation returns the expected number of keys\n*/\nfunction test() {\n\treturn ( keys( arguments ) || '' ).length !== 2;\n}\n\n\n// MAIN //\n\n/**\n* Tests whether the built-in `Object.keys()` implementation supports providing `arguments` as an input value.\n*\n* ## Notes\n*\n* - Safari 5.0 does **not** support `arguments` as an input value.\n*\n* @private\n* @returns {boolean} boolean indicating whether a built-in implementation supports `arguments`\n*/\nfunction check() {\n\treturn test( 1, 2 );\n}\n\n\n// EXPORTS //\n\nexport default check;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isObjectLike from '@stdlib/assert-is-object-like';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport isArguments from '@stdlib/assert-is-arguments';\nimport HAS_ENUM_PROTO_BUG from './has_enumerable_prototype_bug.js';\nimport HAS_NON_ENUM_PROPS_BUG from './has_non_enumerable_properties_bug.js';\nimport isConstructorPrototype from './is_constructor_prototype_wrapper.js';\nimport NON_ENUMERABLE from './non_enumerable.json';\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names.\n*\n* @private\n* @param {*} value - input object\n* @returns {Array} a list of own enumerable property names\n*\n* @example\n* var obj = {\n* 'beep': 'boop',\n* 'foo': 3.14\n* };\n*\n* var k = keys( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nfunction keys( value ) {\n\tvar skipConstructor;\n\tvar skipPrototype;\n\tvar isFcn;\n\tvar out;\n\tvar k;\n\tvar p;\n\tvar i;\n\n\tout = [];\n\tif ( isArguments( value ) ) {\n\t\t// Account for environments which treat `arguments` differently...\n\t\tfor ( i = 0; i < value.length; i++ ) {\n\t\t\tout.push( i.toString() );\n\t\t}\n\t\t// Note: yes, we are precluding the `arguments` array-like object from having other enumerable properties; however, this should (1) be very rare and (2) not be encouraged (e.g., doing something like `arguments.a = 'b'`; in certain engines directly manipulating the `arguments` value results in automatic de-optimization).\n\t\treturn out;\n\t}\n\tif ( typeof value === 'string' ) {\n\t\t// Account for environments which do not treat string character indices as \"own\" properties...\n\t\tif ( value.length > 0 && !hasOwnProp( value, '0' ) ) {\n\t\t\tfor ( i = 0; i < value.length; i++ ) {\n\t\t\t\tout.push( i.toString() );\n\t\t\t}\n\t\t}\n\t} else {\n\t\tisFcn = ( typeof value === 'function' );\n\t\tif ( isFcn === false && !isObjectLike( value ) ) {\n\t\t\treturn out;\n\t\t}\n\t\tskipPrototype = ( HAS_ENUM_PROTO_BUG && isFcn );\n\t}\n\tfor ( k in value ) {\n\t\tif ( !( skipPrototype && k === 'prototype' ) && hasOwnProp( value, k ) ) {\n\t\t\tout.push( String( k ) );\n\t\t}\n\t}\n\tif ( HAS_NON_ENUM_PROPS_BUG ) {\n\t\tskipConstructor = isConstructorPrototype( value );\n\t\tfor ( i = 0; i < NON_ENUMERABLE.length; i++ ) {\n\t\t\tp = NON_ENUMERABLE[ i ];\n\t\t\tif ( !( skipConstructor && p === 'constructor' ) && hasOwnProp( value, p ) ) {\n\t\t\t\tout.push( String( p ) );\n\t\t\t}\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default keys;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasAutomationEqualityBug from './has_automation_equality_bug.js';\nimport isConstructorPrototype from './is_constructor_prototype.js';\nimport HAS_WINDOW from './has_window.js';\n\n\n// MAIN //\n\n/**\n* Wraps the test for constructor prototype equality to accommodate buggy environments (e.g., environments which throw when testing equality).\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value equals the prototype of its constructor\n*/\nfunction wrapper( value ) {\n\tif ( HAS_WINDOW === false && !hasAutomationEqualityBug ) {\n\t\treturn isConstructorPrototype( value );\n\t}\n\ttry {\n\t\treturn isConstructorPrototype( value );\n\t} catch ( error ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default wrapper;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isFunction from '@stdlib/assert-is-function';\nimport builtin from './native.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar getProto;\nif ( isFunction( Object.getPrototypeOf ) ) {\n\tgetProto = builtin;\n} else {\n\tgetProto = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default getProto;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an object.\n*\n* @name Object\n* @constructor\n* @type {Function}\n* @param {*} value - input value\n* @returns {Object} object\n*\n* @example\n* var o = new Object( null );\n* // returns {}\n*\n* @example\n* var o = new Object( 5.0 );\n* // returns \n*\n* @example\n* var o = new Object( 'beep' );\n* // returns \n*\n* @example\n* var o1 = {};\n*\n* var o2 = new Object( o1 );\n* // returns {}\n*\n* var bool = ( o1 === o2 );\n* // returns true\n*/\nvar Obj = Object; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default Obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar getProto = Object.getPrototypeOf;\n\n\n// EXPORTS //\n\nexport default getProto;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\nimport Object from '@stdlib/object-ctor';\nimport getProto from './proto.js';\n\n\n// MAIN //\n\n/**\n* Returns the prototype of a provided object.\n*\n* @private\n* @param {Object} obj - input object\n* @returns {(Object|null)} prototype\n*/\nfunction getPrototypeOf( obj ) {\n\tvar proto = getProto( obj );\n\tif ( proto || proto === null ) {\n\t\treturn proto;\n\t}\n\tif ( nativeClass( obj.constructor ) === '[object Function]' ) {\n\t\t// May break if the constructor has been tampered with...\n\t\treturn obj.constructor.prototype;\n\t}\n\tif ( obj instanceof Object ) {\n\t\treturn Object.prototype;\n\t}\n\t// Return `null` for objects created via `Object.create( null )`. Also return `null` for cross-realm objects on browsers that lack `__proto__` support, such as IE < 11.\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default getPrototypeOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the value of the `__proto__` property.\n*\n* @private\n* @param {Object} obj - input object\n* @returns {*} value of `__proto__` property\n*/\nfunction getProto( obj ) {\n\t// eslint-disable-next-line no-proto\n\treturn obj.__proto__;\n}\n\n\n// EXPORTS //\n\nexport default getProto;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isObject from '@stdlib/assert-is-object';\nimport isFunction from '@stdlib/assert-is-function';\nimport getPrototypeOf from '@stdlib/utils-get-prototype-of';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar objectPrototype = Object.prototype;\n\n\n// FUNCTIONS //\n\n/**\n* Tests that an object only has own properties.\n*\n* @private\n* @param {Object} obj - value to test\n* @returns {boolean} boolean indicating if an object only has own properties\n*/\nfunction ownProps( obj ) {\n\tvar key;\n\n\t// NOTE: possibility of perf boost if key enumeration order is known (see http://stackoverflow.com/questions/18531624/isplainobject-thing).\n\tfor ( key in obj ) {\n\t\tif ( !hasOwnProp( obj, key ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n\n// MAIN //\n\n/**\n* Tests if a value is a plain object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a plain object\n*\n* @example\n* var bool = isPlainObject( {} );\n* // returns true\n*\n* @example\n* var bool = isPlainObject( null );\n* // returns false\n*/\nfunction isPlainObject( value ) {\n\tvar proto;\n\n\t// Screen for obvious non-objects...\n\tif ( !isObject( value ) ) {\n\t\treturn false;\n\t}\n\t// Objects with no prototype (e.g., `Object.create( null )`) are plain...\n\tproto = getPrototypeOf( value );\n\tif ( !proto ) {\n\t\treturn true;\n\t}\n\t// Objects having a prototype are plain if and only if they are constructed with a global `Object` function and the prototype points to the prototype of a plain object...\n\treturn (\n\t\t// Cannot have own `constructor` property:\n\t\t!hasOwnProp( value, 'constructor' ) &&\n\n\t\t// Prototype `constructor` property must be a function (see also https://bugs.jquery.com/ticket/9897 and http://stackoverflow.com/questions/18531624/isplainobject-thing):\n\t\thasOwnProp( proto, 'constructor' ) &&\n\t\tisFunction( proto.constructor ) &&\n\t\tnativeClass( proto.constructor ) === '[object Function]' &&\n\n\t\t// Test for object-specific method:\n\t\thasOwnProp( proto, 'isPrototypeOf' ) &&\n\t\tisFunction( proto.isPrototypeOf ) &&\n\n\t\t(\n\t\t\t// Test if the prototype matches the global `Object` prototype (same realm):\n\t\t\tproto === objectPrototype ||\n\n\t\t\t// Test that all properties are own properties (cross-realm; *most* likely a plain object):\n\t\t\townProps( value )\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isPlainObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Object from '@stdlib/object-ctor';\nimport getProto from './detect.js';\n\n\n// MAIN //\n\n/**\n* Returns the prototype of a provided object.\n*\n* @param {*} value - input value\n* @returns {(Object|null)} prototype\n*\n* @example\n* var proto = getPrototypeOf( {} );\n* // returns {}\n*/\nfunction getPrototypeOf( value ) {\n\tif (\n\t\tvalue === null ||\n\t\tvalue === void 0\n\t) {\n\t\treturn null;\n\t}\n\t// In order to ensure consistent ES5/ES6 behavior, cast input value to an object (strings, numbers, booleans); ES5 `Object.getPrototypeOf` throws when provided primitives and ES6 `Object.getPrototypeOf` casts:\n\tvalue = Object( value );\n\n\treturn getProto( value );\n}\n\n\n// EXPORTS //\n\nexport default getPrototypeOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport objectInverse from '@stdlib/object-inverse';\nimport dtypeEnums from '@stdlib/ndarray-base-dtype-enums';\n\n\n// VARIABLES //\n\nvar hash = objectInverse( dtypeEnums(), {\n\t'duplicates': false\n});\n\n\n// MAIN //\n\n/**\n* Returns the data type string associated with an ndarray data type enumeration constant.\n*\n* @param {integer} dtype - data type enumeration constant\n* @returns {(string|null)} data type string or null\n*\n* @example\n* import str2enum from '@stdlib/ndarray-base-dtype-str2enum';\n*\n* var v = str2enum( 'float64' );\n* // returns \n*\n* var dt = enum2str( v );\n* // returns 'float64'\n*/\nfunction enum2str( dtype ) {\n\tvar v = hash[ dtype ];\n\treturn ( isString( v ) ) ? v : null; // note: we include this guard to prevent walking the prototype chain\n}\n\n\n// EXPORTS //\n\nexport default enum2str;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport objectKeys from '@stdlib/utils-keys';\nimport isArray from '@stdlib/assert-is-array';\nimport isObject from '@stdlib/assert-is-plain-object';\nimport isObjectLike from '@stdlib/assert-is-object-like';\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Inverts an object, such that keys become values and values become keys.\n*\n* @param {ObjectLike} obj - input object\n* @param {Options} [opts] - function options\n* @param {boolean} [opts.duplicates=true] - boolean indicating whether to store duplicate keys\n* @throws {TypeError} first argument must be object-like\n* @throws {TypeError} second argument must be an object\n* @throws {TypeError} must provide valid options\n* @returns {Object} inverted object\n*\n* @example\n* var out = invert({\n* 'a': 'beep',\n* 'b': 'boop'\n* });\n* // returns { 'beep': 'a', 'boop': 'b' }\n*\n* @example\n* var out = invert({\n* 'a': 'beep',\n* 'b': 'beep'\n* });\n* // returns { 'beep': [ 'a', 'b' ] }\n*\n* @example\n* var obj = {};\n* obj.a = 'beep';\n* obj.b = 'boop';\n* obj.c = 'beep'; // inserted after `a`\n*\n* var out = invert( obj, {\n* 'duplicates': false\n* });\n* // returns { 'beep': 'c', 'boop': 'b' }\n*/\nfunction invert( obj, opts ) {\n\tvar allowDupes = true;\n\tvar keys;\n\tvar len;\n\tvar key;\n\tvar val;\n\tvar out;\n\tvar v;\n\tvar i;\n\tif ( !isObjectLike( obj ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an object (except null). Value: `%s`.', obj ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isObject( opts ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', opts ) );\n\t\t}\n\t\tif ( hasOwnProp( opts, 'duplicates' ) ) {\n\t\t\tallowDupes = opts.duplicates;\n\t\t\tif ( !isBoolean( allowDupes ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a boolean. Option: `%s`.', 'duplicates', allowDupes ) );\n\t\t\t}\n\t\t}\n\t}\n\tkeys = objectKeys( obj );\n\tlen = keys.length;\n\tout = {};\n\tif ( allowDupes ) {\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tkey = keys[ i ];\n\t\t\tval = obj[ key ];\n\t\t\tif ( !hasOwnProp( out, val ) ) {\n\t\t\t\tout[ val ] = key;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tv = out[ val ];\n\t\t\tif ( isArray( v ) ) {\n\t\t\t\tout[ val ].push( key );\n\t\t\t} else {\n\t\t\t\tout[ val ] = [ v, key ];\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tkey = keys[ i ];\n\t\t\tout[ obj[ key ] ] = key;\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default invert;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable stdlib/empty-line-before-comment */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an object mapping supported data type strings to enumeration constants.\n*\n* ## Notes\n*\n* - Downstream consumers of this mapping should **not** rely on specific integer values (e.g., `INT8 == 0`). Instead, the object should be used in an opaque manner.\n* - The main purpose of this function is JavaScript and C inter-operation of ndarray objects.\n*\n* @returns {Object} object mapping supported data type strings to enumeration constants\n*\n* @example\n* var table = dtypeEnums();\n* // returns {...}\n*/\nfunction dtypeEnums() {\n\t// NOTE: the following should match the C enumeration in `@stdlib/ndarray/dtypes`!!!!\n\treturn {\n\t\t// Boolean data types:\n\t\t'bool': 0,\n\n\t\t// Integer data types:\n\t\t'int8': 1,\n\t\t'uint8': 2,\n\t\t'uint8c': 3,\n\t\t'int16': 4,\n\t\t'uint16': 5,\n\t\t'int32': 6,\n\t\t'uint32': 7,\n\t\t'int64': 8,\n\t\t'uint64': 9,\n\t\t// 'int128': 10, // uncomment once supported\n\t\t// 'uint128': 11,\n\t\t// 'int256': 12,\n\t\t// 'uint256': 13,\n\n\t\t// Floating-point data types:\n\t\t'float16': 10,\n\t\t// 'bfloat16': 15,\n\t\t'float32': 11,\n\t\t'float64': 12,\n\t\t// 'float128': 18, // uncomment once supported\n\n\t\t// Complex floating-point number data types:\n\t\t'complex32': 13,\n\t\t'complex64': 14,\n\t\t'complex128': 15,\n\n\t\t// Data type for \"binary\" data (i.e., data stored in a Node.js `Buffer` object):\n\t\t'binary': 16,\n\n\t\t// Data type for \"generic\" JavaScript values (objects):\n\t\t'generic': 17,\n\n\t\t// Define a signaling value which is guaranteed not to be a valid type enumeration value:\n\t\t'notype': 18,\n\n\t\t// Indicate the start of user defined type numbers (leaving room for type growth above):\n\t\t'userdefined_type': 256\n\t};\n}\n\n\n// EXPORTS //\n\nexport default dtypeEnums;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport { isPrimitive as isPositiveInteger } from '@stdlib/assert-is-positive-integer';\nimport enum2str from '@stdlib/ndarray-base-dtype-enum2str';\nimport BYTES_PER_ELEMENT from './bytes_per_element.json';\n\n\n// MAIN //\n\n/**\n* Returns the number of bytes per element for a provided underlying ndarray data type.\n*\n* @param {*} dtype - data type\n* @returns {(PositiveInteger|null)} number of bytes per element\n*\n* @example\n* var nbytes = bytesPerElement( 'float64' );\n* // returns 8\n*\n* nbytes = bytesPerElement( 'generic' );\n* // returns null\n*\n* @example\n* import structFactory from '@stdlib/dstructs-struct';\n*\n* var schema = [\n* {\n* 'name': 'value',\n* 'type': 'float64'\n* }\n* ];\n* var Struct = structFactory( schema );\n* // returns \n*\n* var nbytes = bytesPerElement( Struct );\n* // returns 8\n*/\nfunction bytesPerElement( dtype ) {\n\tvar v;\n\tif ( isString( dtype ) ) {\n\t\treturn BYTES_PER_ELEMENT[ dtype ] || null;\n\t}\n\tif ( isNumber( dtype ) ) {\n\t\treturn BYTES_PER_ELEMENT[ enum2str( dtype ) ] || null;\n\t}\n\tif ( dtype ) {\n\t\tv = dtype.byteLength;\n\t\tif ( isPositiveInteger( v ) ) {\n\t\t\treturn v;\n\t\t}\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default bytesPerElement;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2026 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar defaults = {\n\t// Define a default block size (in bytes):\n\t'BLOCK_SIZE_IN_BYTES': 64|0, // 64b is a common cache line size. How applicable the common cache line size is here is debatable, given that, depending on the associated stride(s), the innermost loop may not iterate over adjacent elements. The primary goal is to have a block size in which all data within a block can always fit in (L1) cache, regardless of cache size (i.e., cache-oblivious). For reference, a common L1 cache size is 32kB per core. For best performance, block sizes should be tuned based on system hardware; however, such tuning is not readily available to us here. Without obvious better alternatives, 64b has some theoretical (and practical) underpinning, and it should be good enough for most inputs, especially for ndarrays with near contiguity.\n\n\t// Define a default block size (in elements):\n\t'BLOCK_SIZE_IN_ELEMENTS': 8|0 // 64 bytes / 8 bytes per element (i.e., default element size is same as a double)\n};\n\n\n// EXPORTS //\n\nexport default defaults;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport blockSize from '@stdlib/ndarray-base-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Returns a loop block size for multi-dimensional array tiled loops.\n*\n* @param {*} dtypeX - first input array data type\n* @param {*} dtypeY - second input array data type\n* @param {*} dtypeZ - output array data type\n* @returns {integer} block size (in units of elements)\n*\n* @example\n* var bsize = binaryBlockSize( 'float64', 'float64', 'float64' );\n* // returns \n*/\nfunction binaryBlockSize( dtypeX, dtypeY, dtypeZ ) {\n\treturn blockSize( [ dtypeX, dtypeY, dtypeZ ] );\n}\n\n\n// EXPORTS //\n\nexport default binaryBlockSize;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2026 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport bytesPerElement from '@stdlib/ndarray-base-bytes-per-element';\nimport defaults from './defaults.js';\n\n\n// MAIN //\n\n/**\n* Returns a loop block size for multi-dimensional array tiled loops.\n*\n* @param {ArrayLikeObject} dtypes - list of input and output ndarray data types\n* @returns {integer} block size (in units of elements)\n*\n* @example\n* var bsize = blockSize( [ 'float64', 'float64', 'float64', 'float64' ] );\n* // returns \n*/\nfunction blockSize( dtypes ) {\n\tvar max;\n\tvar len;\n\tvar nb;\n\tvar i;\n\n\tlen = dtypes.length;\n\tif ( len <= 0 ) {\n\t\treturn defaults.BLOCK_SIZE_IN_ELEMENTS;\n\t}\n\tmax = bytesPerElement( dtypes[ 0 ] );\n\tif ( max === null ) {\n\t\treturn defaults.BLOCK_SIZE_IN_ELEMENTS; // e.g., \"generic\" arrays\n\t}\n\t// Find the largest element size among all arrays...\n\tfor ( i = 1; i < len; i++ ) {\n\t\tnb = bytesPerElement( dtypes[ i ] );\n\t\tif ( nb === null ) {\n\t\t\treturn defaults.BLOCK_SIZE_IN_ELEMENTS; // e.g., \"generic\" arrays\n\t\t}\n\t\tif ( nb > max ) {\n\t\t\tmax = nb;\n\t\t}\n\t}\n\tnb = ( defaults.BLOCK_SIZE_IN_BYTES/max )|0; // asm type annotation\n\treturn ( nb > 0 ) ? nb : 1|0;\n}\n\n\n// EXPORTS //\n\nexport default blockSize;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isColumnMajor from '@stdlib/ndarray-base-assert-is-column-major-string';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Converts a linear index in an array view to a linear index in an underlying data buffer.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @param {NonNegativeInteger} offset - location of the first indexed value **based** on the stride array\n* @param {string} order - specifies whether an array is row-major (C-style) or column-major (Fortran-style)\n* @param {integer} idx - linear index in an array view\n* @param {string} mode - specifies how to handle a linear index which exceeds array dimensions\n* @throws {RangeError} linear index must not exceed array dimensions\n* @returns {NonNegativeInteger} linear index in an underlying data buffer\n*\n* @example\n* var shape = [ 3, 3 ];\n* var strides = [ -3, 1 ];\n* var offset = 6;\n* var order = 'row-major';\n* var mode = 'throw';\n*\n* var ind = vind2bind( shape, strides, offset, order, 1, mode );\n* // returns 7\n*/\nfunction vind2bind( shape, strides, offset, order, idx, mode ) {\n\tvar ndims;\n\tvar len;\n\tvar ind;\n\tvar s;\n\tvar i;\n\n\tndims = shape.length;\n\tlen = 1;\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tlen *= shape[ i ];\n\t}\n\tif ( mode === 'clamp' ) {\n\t\tif ( idx < 0 ) {\n\t\t\tidx = 0;\n\t\t} else if ( idx >= len ) {\n\t\t\tidx = len - 1;\n\t\t}\n\t} else if ( mode === 'wrap' ) {\n\t\tif ( idx < 0 ) {\n\t\t\tidx += len; // slight optimization to avoid modulo arithmetic when |idx| <= len\n\t\t\tif ( idx < 0 ) {\n\t\t\t\tidx %= len;\n\t\t\t\tif ( idx !== 0 ) {\n\t\t\t\t\tidx += len;\n\t\t\t\t}\n\t\t\t}\n\t\t} else if ( idx >= len ) {\n\t\t\tidx -= len; // slight optimization to avoid modulo arithmetic when len < idx <= 2*len\n\t\t\tif ( idx >= len ) {\n\t\t\t\tidx %= len;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tif ( mode === 'normalize' && idx < 0 ) {\n\t\t\tidx += len;\n\t\t}\n\t\tif ( idx < 0 || idx >= len ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Linear index must not exceed array dimensions. Number of array elements: `%u`. Value: `%d`.', len, idx ) );\n\t\t}\n\t}\n\t// The approach which follows is to resolve a view index to its subscripts and then plug the subscripts into the standard formula for computing the linear index in the underlying data buffer...\n\tind = offset;\n\tif ( isColumnMajor( order ) ) {\n\t\tfor ( i = 0; i < ndims; i++ ) {\n\t\t\ts = idx % shape[ i ];\n\t\t\tidx -= s;\n\t\t\tidx /= shape[ i ];\n\t\t\tind += s * strides[ i ];\n\t\t}\n\t\treturn ind;\n\t}\n\t// Case: row-major\n\tfor ( i = ndims-1; i >= 0; i-- ) {\n\t\ts = idx % shape[ i ];\n\t\tidx -= s;\n\t\tidx /= shape[ i ];\n\t\tind += s * strides[ i ];\n\t}\n\treturn ind;\n}\n\n\n// EXPORTS //\n\nexport default vind2bind;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport numel from '@stdlib/ndarray-base-numel';\nimport vind2bind from '@stdlib/ndarray-base-vind2bind';\n\n\n// VARIABLES //\n\nvar MODE = 'throw';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in n-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 6, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binarynd( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binarynd( x, y, z, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar ordx;\n\tvar ordy;\n\tvar ordz;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar len;\n\tvar sh;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i;\n\n\tsh = x.shape;\n\n\t// Compute the total number of elements over which to iterate:\n\tlen = numel( sh );\n\n\t// Cache references to the input and output ndarray data buffers:\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache references to the respective stride arrays:\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays:\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache the respective array orders:\n\tordx = x.order;\n\tordy = y.order;\n\tordz = z.order;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over each element based on the linear **view** index, regardless as to how the data is stored in memory...\n\tfor ( i = 0; i < len; i++ ) {\n\t\tix = vind2bind( sh, sx, ox, ordx, i, MODE );\n\t\tiy = vind2bind( sh, sy, oy, ordy, i, MODE );\n\t\tiz = vind2bind( sh, sz, oz, ordz, i, MODE );\n\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binarynd;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport numel from '@stdlib/ndarray-base-numel';\nimport vind2bind from '@stdlib/ndarray-base-vind2bind';\n\n\n// VARIABLES //\n\nvar MODE = 'throw';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in n-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 6, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binarynd( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binarynd( x, y, z, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar ordx;\n\tvar ordy;\n\tvar ordz;\n\tvar len;\n\tvar sh;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i;\n\n\tsh = x.shape;\n\n\t// Compute the total number of elements over which to iterate:\n\tlen = numel( sh );\n\n\t// Cache references to the input and output ndarray data buffers:\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache references to the respective stride arrays:\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays:\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache the respective array orders:\n\tordx = x.order;\n\tordy = y.order;\n\tordz = z.order;\n\n\t// Iterate over each element based on the linear **view** index, regardless as to how the data is stored in memory...\n\tfor ( i = 0; i < len; i++ ) {\n\t\tix = vind2bind( sh, sx, ox, ordx, i, MODE );\n\t\tiy = vind2bind( sh, sy, oy, ordy, i, MODE );\n\t\tiz = vind2bind( sh, sz, oz, ordz, i, MODE );\n\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binarynd;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport iterationOrder from '@stdlib/ndarray-base-iteration-order';\nimport minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\nimport ndarray2object from '@stdlib/ndarray-base-ndarraylike2object';\nimport strides2order from '@stdlib/ndarray-base-strides2order';\nimport anyIsEntryIn from '@stdlib/array-base-any-is-entry-in';\nimport format from '@stdlib/error-tools-fmtprodmsg';\nimport blockedaccessorbinary2d from './2d_blocked_accessors.js';\nimport blockedaccessorbinary3d from './3d_blocked_accessors.js';\nimport blockedaccessorbinary4d from './4d_blocked_accessors.js';\nimport blockedaccessorbinary5d from './5d_blocked_accessors.js';\nimport blockedaccessorbinary6d from './6d_blocked_accessors.js';\nimport blockedaccessorbinary7d from './7d_blocked_accessors.js';\nimport blockedaccessorbinary8d from './8d_blocked_accessors.js';\nimport blockedaccessorbinary9d from './9d_blocked_accessors.js';\nimport blockedaccessorbinary10d from './10d_blocked_accessors.js';\nimport blockedbinary2d from './2d_blocked.js';\nimport blockedbinary3d from './3d_blocked.js';\nimport blockedbinary4d from './4d_blocked.js';\nimport blockedbinary5d from './5d_blocked.js';\nimport blockedbinary6d from './6d_blocked.js';\nimport blockedbinary7d from './7d_blocked.js';\nimport blockedbinary8d from './8d_blocked.js';\nimport blockedbinary9d from './9d_blocked.js';\nimport blockedbinary10d from './10d_blocked.js';\nimport accessorbinary0d from './0d_accessors.js';\nimport accessorbinary1d from './1d_accessors.js';\nimport accessorbinary2d from './2d_accessors.js';\nimport accessorbinary3d from './3d_accessors.js';\nimport accessorbinary4d from './4d_accessors.js';\nimport accessorbinary5d from './5d_accessors.js';\nimport accessorbinary6d from './6d_accessors.js';\nimport accessorbinary7d from './7d_accessors.js';\nimport accessorbinary8d from './8d_accessors.js';\nimport accessorbinary9d from './9d_accessors.js';\nimport accessorbinary10d from './10d_accessors.js';\nimport accessorbinarynd from './nd_accessors.js';\nimport binary0d from './0d.js';\nimport binary1d from './1d.js';\nimport binary2d from './2d.js';\nimport binary3d from './3d.js';\nimport binary4d from './4d.js';\nimport binary5d from './5d.js';\nimport binary6d from './6d.js';\nimport binary7d from './7d.js';\nimport binary8d from './8d.js';\nimport binary9d from './9d.js';\nimport binary10d from './10d.js';\nimport binarynd from './nd.js';\n\n\n// VARIABLES //\n\nvar BINARY = [\n\tbinary0d,\n\tbinary1d,\n\tbinary2d,\n\tbinary3d,\n\tbinary4d,\n\tbinary5d,\n\tbinary6d,\n\tbinary7d,\n\tbinary8d,\n\tbinary9d,\n\tbinary10d\n];\nvar ACCESSOR_BINARY = [\n\taccessorbinary0d,\n\taccessorbinary1d,\n\taccessorbinary2d,\n\taccessorbinary3d,\n\taccessorbinary4d,\n\taccessorbinary5d,\n\taccessorbinary6d,\n\taccessorbinary7d,\n\taccessorbinary8d,\n\taccessorbinary9d,\n\taccessorbinary10d\n];\nvar BLOCKED_BINARY = [\n\tblockedbinary2d, // 0\n\tblockedbinary3d,\n\tblockedbinary4d,\n\tblockedbinary5d,\n\tblockedbinary6d,\n\tblockedbinary7d,\n\tblockedbinary8d,\n\tblockedbinary9d,\n\tblockedbinary10d // 8\n];\nvar BLOCKED_ACCESSOR_BINARY = [\n\tblockedaccessorbinary2d, // 0\n\tblockedaccessorbinary3d,\n\tblockedaccessorbinary4d,\n\tblockedaccessorbinary5d,\n\tblockedaccessorbinary6d,\n\tblockedaccessorbinary7d,\n\tblockedaccessorbinary8d,\n\tblockedaccessorbinary9d,\n\tblockedaccessorbinary10d // 8\n];\nvar MAX_DIMS = BINARY.length - 1;\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating if at least one ndarray data buffer implements the accessor protocol.\n*\n* @private\n* @param {ndarrayLike} x - first ndarray\n* @param {ndarrayLike} y - second ndarray\n* @param {ndarrayLike} z - third ndarray\n* @returns {boolean} boolean indicating whether an ndarray data buffer implements the accessor protocol\n*/\nfunction hasAccessors( x, y, z ) {\n\treturn anyIsEntryIn( [ x, y, z ], 'accessorProtocol', true );\n}\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in input ndarrays and assigns results to elements in an output ndarray.\n*\n* ## Notes\n*\n* - Each provided ndarray should be an object with the following properties:\n*\n* - **dtype**: data type.\n* - **data**: data buffer.\n* - **shape**: dimensions.\n* - **strides**: stride lengths.\n* - **offset**: index offset.\n* - **order**: specifies whether an ndarray is row-major (C-style) or column major (Fortran-style).\n*\n* @param {ArrayLikeObject} arrays - array-like object containing two input arrays and one output array\n* @param {Callback} fcn - binary callback\n* @throws {Error} arrays must have the same number of dimensions\n* @throws {Error} arrays must have the same shape\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n* import ndarray from '@stdlib/ndarray-ctor';\n* import getData from '@stdlib/ndarray-data-buffer';\n*\n* function add( a, b ) {\n* return a + b;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] );\n* var zbuf = new Float64Array( 6 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 2, 1 ];\n* var sy = [ 2, 2, 1 ];\n* var sz = [ 2, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarrays:\n* var x = new ndarray( 'float64', xbuf, shape, sx, ox, 'row-major' );\n* var y = new ndarray( 'float64', ybuf, shape, sy, oy, 'row-major' );\n* var z = new ndarray( 'float64', zbuf, shape, sz, oz, 'row-major' );\n*\n* // Apply the binary function:\n* binary( [ x, y, z ], add );\n*\n* console.log( getData( z ) );\n* // => [ 2.0, 4.0, 6.0, 8.0, 10.0, 12.0 ]\n*/\nfunction binary( arrays, fcn ) { // eslint-disable-line max-statements\n\tvar ndims;\n\tvar xmmv;\n\tvar ymmv;\n\tvar zmmv;\n\tvar shx;\n\tvar shy;\n\tvar shz;\n\tvar iox;\n\tvar ioy;\n\tvar ioz;\n\tvar len;\n\tvar ord;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ns;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar d;\n\tvar i;\n\n\t// Unpack the ndarrays and standardize ndarray meta data:\n\tx = ndarray2object( arrays[ 0 ] );\n\ty = ndarray2object( arrays[ 1 ] );\n\tz = ndarray2object( arrays[ 2 ] );\n\n\t// Verify that the input and output arrays have the same number of dimensions...\n\tshx = x.shape;\n\tshy = y.shape;\n\tshz = z.shape;\n\tndims = shx.length;\n\tif ( ndims !== shy.length || ndims !== shz.length ) {\n\t\tthrow new Error( format( 'invalid arguments. Arrays must have the same number of dimensions (i.e., same rank). ndims(x) == %d. ndims(y) == %d. ndims(z) == %d.', ndims, shy.length, shz.length ) );\n\t}\n\t// Determine whether we can avoid iteration altogether...\n\tif ( ndims === 0 ) {\n\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\treturn ACCESSOR_BINARY[ ndims ]( x, y, z, fcn );\n\t\t}\n\t\treturn BINARY[ ndims ]( x, y, z, fcn );\n\t}\n\t// Verify that the input and output arrays have the same dimensions...\n\tlen = 1; // number of elements\n\tns = 0; // number of singleton dimensions\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\td = shx[ i ];\n\t\tif ( d !== shy[ i ] || d !== shz[ i ] ) {\n\t\t\tthrow new Error( format('null0d') );\n\t\t}\n\t\t// Note that, if one of the dimensions is `0`, the length will be `0`...\n\t\tlen *= d;\n\n\t\t// Check whether the current dimension is a singleton dimension...\n\t\tif ( d === 1 ) {\n\t\t\tns += 1;\n\t\t}\n\t}\n\t// Check whether we were provided empty ndarrays...\n\tif ( len === 0 ) {\n\t\treturn;\n\t}\n\t// Determine whether the ndarrays are one-dimensional and thus readily translate to one-dimensional strided arrays...\n\tif ( ndims === 1 ) {\n\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\treturn ACCESSOR_BINARY[ ndims ]( x, y, z, fcn );\n\t\t}\n\t\treturn BINARY[ ndims ]( x, y, z, fcn );\n\t}\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\n\t// Determine whether the ndarrays have only **one** non-singleton dimension (e.g., ndims=4, shape=[10,1,1,1]) so that we can treat the ndarrays as being equivalent to one-dimensional strided arrays...\n\tif ( ns === ndims-1 ) {\n\t\t// Get the index of the non-singleton dimension...\n\t\tfor ( i = 0; i < ndims; i++ ) {\n\t\t\tif ( shx[ i ] !== 1 ) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tx.shape = [ shx[i] ];\n\t\ty.shape = x.shape;\n\t\tz.shape = x.shape;\n\t\tx.strides = [ sx[i] ];\n\t\ty.strides = [ sy[i] ];\n\t\tz.strides = [ sz[i] ];\n\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\treturn ACCESSOR_BINARY[ 1 ]( x, y, z, fcn );\n\t\t}\n\t\treturn BINARY[ 1 ]( x, y, z, fcn );\n\t}\n\tiox = iterationOrder( sx ); // +/-1\n\tioy = iterationOrder( sy ); // +/-1\n\tioz = iterationOrder( sz ); // +/-1\n\n\t// Determine whether we can avoid blocked iteration...\n\tord = strides2order( sx );\n\tif ( iox !== 0 && ioy !== 0 && ioz !== 0 && ord === strides2order( sy ) && ord === strides2order( sz ) ) { // eslint-disable-line max-len\n\t\t// Determine the minimum and maximum linear indices which are accessible by the array views:\n\t\txmmv = minmaxViewBufferIndex( shx, sx, x.offset );\n\t\tymmv = minmaxViewBufferIndex( shy, sy, y.offset );\n\t\tzmmv = minmaxViewBufferIndex( shz, sz, z.offset );\n\n\t\t// Determine whether we can ignore shape (and strides) and treat the ndarrays as linear one-dimensional strided arrays...\n\t\tif (\n\t\t\tlen === ( xmmv[1]-xmmv[0]+1 ) &&\n\t\t\tlen === ( ymmv[1]-ymmv[0]+1 ) &&\n\t\t\tlen === ( zmmv[1]-zmmv[0]+1 )\n\t\t) {\n\t\t\t// Note: the above is equivalent to @stdlib/ndarray/base/assert/is-contiguous, but in-lined so we can retain computed values...\n\t\t\tif ( iox === 1 ) {\n\t\t\t\tox = xmmv[ 0 ];\n\t\t\t} else {\n\t\t\t\tox = xmmv[ 1 ];\n\t\t\t}\n\t\t\tif ( ioy === 1 ) {\n\t\t\t\toy = ymmv[ 0 ];\n\t\t\t} else {\n\t\t\t\toy = ymmv[ 1 ];\n\t\t\t}\n\t\t\tif ( ioz === 1 ) {\n\t\t\t\toz = zmmv[ 0 ];\n\t\t\t} else {\n\t\t\t\toz = zmmv[ 1 ];\n\t\t\t}\n\t\t\tx.shape = [ len ];\n\t\t\ty.shape = x.shape;\n\t\t\tz.shape = x.shape;\n\t\t\tx.strides = [ iox ];\n\t\t\ty.strides = [ ioy ];\n\t\t\tz.strides = [ ioz ];\n\t\t\tx.offset = ox;\n\t\t\ty.offset = oy;\n\t\t\tz.offset = oz;\n\t\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\t\treturn ACCESSOR_BINARY[ 1 ]( x, y, z, fcn );\n\t\t\t}\n\t\t\treturn BINARY[ 1 ]( x, y, z, fcn );\n\t\t}\n\t\t// At least one ndarray is non-contiguous, so we cannot directly use one-dimensional array functionality...\n\n\t\t// Determine whether we can use simple nested loops...\n\t\tif ( ndims <= MAX_DIMS ) {\n\t\t\t// So long as iteration for each respective array always moves in the same direction (i.e., no mixed sign strides), we can leverage cache-optimal (i.e., normal) nested loops without resorting to blocked iteration...\n\t\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\t\treturn ACCESSOR_BINARY[ ndims ]( x, y, z, ord === 1, fcn );\n\t\t\t}\n\t\t\treturn BINARY[ ndims ]( x, y, z, ord === 1, fcn );\n\t\t}\n\t\t// Fall-through to blocked iteration...\n\t}\n\t// At this point, we're either dealing with non-contiguous n-dimensional arrays, high dimensional n-dimensional arrays, and/or arrays having differing memory layouts, so our only hope is that we can still perform blocked iteration...\n\n\t// Determine whether we can perform blocked iteration...\n\tif ( ndims <= MAX_DIMS ) {\n\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\treturn BLOCKED_ACCESSOR_BINARY[ ndims-2 ]( x, y, z, fcn );\n\t\t}\n\t\treturn BLOCKED_BINARY[ ndims-2 ]( x, y, z, fcn );\n\t}\n\t// Fall-through to linear view iteration without regard for how data is stored in memory (i.e., take the slow path)...\n\tif ( hasAccessors( x, y, z ) ) {\n\t\treturn accessorbinarynd( x, y, z, fcn );\n\t}\n\tbinarynd( x, y, z, fcn );\n}\n\n\n// EXPORTS //\n\nexport default binary;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in zero-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0 ] );\n* var ybuf = new Float64Array( [ 2.0 ] );\n* var zbuf = new Float64Array( [ 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [];\n*\n* // Define the array strides:\n* var sx = [ 0 ];\n* var sy = [ 0 ];\n* var sz = [ 0 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary0d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 3.0 ]\n*/\nfunction binary0d( x, y, z, fcn ) {\n\tz.data[ z.offset ] = fcn( x.data[ x.offset ], y.data[ y.offset ] );\n}\n\n\n// EXPORTS //\n\nexport default binary0d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in one-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 12 ];\n*\n* // Define the array strides:\n* var sx = [ 1 ];\n* var sy = [ 1 ];\n* var sz = [ 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary1d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary1d( x, y, z, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dy0;\n\tvar dz0;\n\tvar S0;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables: dimensions and loop offset (pointer) increments...\n\tS0 = x.shape[ 0 ];\n\tdx0 = x.strides[ 0 ];\n\tdy0 = y.strides[ 0 ];\n\tdz0 = z.strides[ 0 ];\n\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\tix += dx0;\n\t\tiy += dy0;\n\t\tiz += dz0;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary1d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 6, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary2d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary2d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dy0;\n\tvar dy1;\n\tvar dz0;\n\tvar dz1;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 1 ];\n\t\tS1 = sh[ 0 ];\n\t\tdx0 = sx[ 1 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 0 ] - ( S0*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 1 ];\n\t\tdy1 = sy[ 0 ] - ( S0*sy[1] );\n\t\tdz0 = sz[ 1 ];\n\t\tdz1 = sz[ 0 ] - ( S0*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\tix += dx0;\n\t\t\tiy += dy0;\n\t\t\tiz += dz0;\n\t\t}\n\t\tix += dx1;\n\t\tiy += dy1;\n\t\tiz += dz1;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in three-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n* var sy = [ 4, 2, 1 ];\n* var sz = [ 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary3d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary3d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 2 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 0 ];\n\t\tdx0 = sx[ 2 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[2] );\n\t\tdx2 = sx[ 0 ] - ( S1*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 2 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[2] );\n\t\tdy2 = sy[ 0 ] - ( S1*sy[1] );\n\t\tdz0 = sz[ 2 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[2] );\n\t\tdz2 = sz[ 0 ] - ( S1*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\tix += dx0;\n\t\t\t\tiy += dy0;\n\t\t\t\tiz += dz0;\n\t\t\t}\n\t\t\tix += dx1;\n\t\t\tiy += dy1;\n\t\t\tiz += dz1;\n\t\t}\n\t\tix += dx2;\n\t\tiy += dy2;\n\t\tiz += dz2;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in four-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary4d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary4d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 3 ];\n\t\tS1 = sh[ 2 ];\n\t\tS2 = sh[ 1 ];\n\t\tS3 = sh[ 0 ];\n\t\tdx0 = sx[ 3 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 2 ] - ( S0*sx[3] );\n\t\tdx2 = sx[ 1 ] - ( S1*sx[2] );\n\t\tdx3 = sx[ 0 ] - ( S2*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 3 ];\n\t\tdy1 = sy[ 2 ] - ( S0*sy[3] );\n\t\tdy2 = sy[ 1 ] - ( S1*sy[2] );\n\t\tdy3 = sy[ 0 ] - ( S2*sy[1] );\n\t\tdz0 = sz[ 3 ];\n\t\tdz1 = sz[ 2 ] - ( S0*sz[3] );\n\t\tdz2 = sz[ 1 ] - ( S1*sz[2] );\n\t\tdz3 = sz[ 0 ] - ( S2*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\tix += dx0;\n\t\t\t\t\tiy += dy0;\n\t\t\t\t\tiz += dz0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t\tiy += dy1;\n\t\t\t\tiz += dz1;\n\t\t\t}\n\t\t\tix += dx2;\n\t\t\tiy += dy2;\n\t\t\tiz += dz2;\n\t\t}\n\t\tix += dx3;\n\t\tiy += dy3;\n\t\tiz += dz3;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in five-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary5d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary5d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 4 ];\n\t\tS1 = sh[ 3 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 1 ];\n\t\tS4 = sh[ 0 ];\n\t\tdx0 = sx[ 4 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 3 ] - ( S0*sx[4] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[3] );\n\t\tdx3 = sx[ 1 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 0 ] - ( S3*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 4 ];\n\t\tdy1 = sy[ 3 ] - ( S0*sy[4] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[3] );\n\t\tdy3 = sy[ 1 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 0 ] - ( S3*sy[1] );\n\t\tdz0 = sz[ 4 ];\n\t\tdz1 = sz[ 3 ] - ( S0*sz[4] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[3] );\n\t\tdz3 = sz[ 1 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 0 ] - ( S3*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx1;\n\t\t\t\t\tiy += dy1;\n\t\t\t\t\tiz += dz1;\n\t\t\t\t}\n\t\t\t\tix += dx2;\n\t\t\t\tiy += dy2;\n\t\t\t\tiz += dz2;\n\t\t\t}\n\t\t\tix += dx3;\n\t\t\tiy += dy3;\n\t\t\tiz += dz3;\n\t\t}\n\t\tix += dx4;\n\t\tiy += dy4;\n\t\tiz += dz4;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in six-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary6d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary6d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 5 ];\n\t\tS1 = sh[ 4 ];\n\t\tS2 = sh[ 3 ];\n\t\tS3 = sh[ 2 ];\n\t\tS4 = sh[ 1 ];\n\t\tS5 = sh[ 0 ];\n\t\tdx0 = sx[ 5 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 4 ] - ( S0*sx[5] );\n\t\tdx2 = sx[ 3 ] - ( S1*sx[4] );\n\t\tdx3 = sx[ 2 ] - ( S2*sx[3] );\n\t\tdx4 = sx[ 1 ] - ( S3*sx[2] );\n\t\tdx5 = sx[ 0 ] - ( S4*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 5 ];\n\t\tdy1 = sy[ 4 ] - ( S0*sy[5] );\n\t\tdy2 = sy[ 3 ] - ( S1*sy[4] );\n\t\tdy3 = sy[ 2 ] - ( S2*sy[3] );\n\t\tdy4 = sy[ 1 ] - ( S3*sy[2] );\n\t\tdy5 = sy[ 0 ] - ( S4*sy[1] );\n\t\tdz0 = sz[ 5 ];\n\t\tdz1 = sz[ 4 ] - ( S0*sz[5] );\n\t\tdz2 = sz[ 3 ] - ( S1*sz[4] );\n\t\tdz3 = sz[ 2 ] - ( S2*sz[3] );\n\t\tdz4 = sz[ 1 ] - ( S3*sz[2] );\n\t\tdz5 = sz[ 0 ] - ( S4*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t\tiy += dy2;\n\t\t\t\t\tiz += dz2;\n\t\t\t\t}\n\t\t\t\tix += dx3;\n\t\t\t\tiy += dy3;\n\t\t\t\tiz += dz3;\n\t\t\t}\n\t\t\tix += dx4;\n\t\t\tiy += dy4;\n\t\t\tiz += dz4;\n\t\t}\n\t\tix += dx5;\n\t\tiy += dy5;\n\t\tiz += dz5;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in seven-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary7d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary7d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 6 ];\n\t\tS1 = sh[ 5 ];\n\t\tS2 = sh[ 4 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 2 ];\n\t\tS5 = sh[ 1 ];\n\t\tS6 = sh[ 0 ];\n\t\tdx0 = sx[ 6 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 5 ] - ( S0*sx[6] );\n\t\tdx2 = sx[ 4 ] - ( S1*sx[5] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[4] );\n\t\tdx4 = sx[ 2 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 1 ] - ( S4*sx[2] );\n\t\tdx6 = sx[ 0 ] - ( S5*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 6 ];\n\t\tdy1 = sy[ 5 ] - ( S0*sy[6] );\n\t\tdy2 = sy[ 4 ] - ( S1*sy[5] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[4] );\n\t\tdy4 = sy[ 2 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 1 ] - ( S4*sy[2] );\n\t\tdy6 = sy[ 0 ] - ( S5*sy[1] );\n\t\tdz0 = sz[ 6 ];\n\t\tdz1 = sz[ 5 ] - ( S0*sz[6] );\n\t\tdz2 = sz[ 4 ] - ( S1*sz[5] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[4] );\n\t\tdz4 = sz[ 2 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 1 ] - ( S4*sz[2] );\n\t\tdz6 = sz[ 0 ] - ( S5*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx3;\n\t\t\t\t\tiy += dy3;\n\t\t\t\t\tiz += dz3;\n\t\t\t\t}\n\t\t\t\tix += dx4;\n\t\t\t\tiy += dy4;\n\t\t\t\tiz += dz4;\n\t\t\t}\n\t\t\tix += dx5;\n\t\t\tiy += dy5;\n\t\t\tiz += dz5;\n\t\t}\n\t\tix += dx6;\n\t\tiy += dy6;\n\t\tiz += dz6;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in eight-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary8d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary8d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 7 ];\n\t\tS1 = sh[ 6 ];\n\t\tS2 = sh[ 5 ];\n\t\tS3 = sh[ 4 ];\n\t\tS4 = sh[ 3 ];\n\t\tS5 = sh[ 2 ];\n\t\tS6 = sh[ 1 ];\n\t\tS7 = sh[ 0 ];\n\t\tdx0 = sx[ 7 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 6 ] - ( S0*sx[7] );\n\t\tdx2 = sx[ 5 ] - ( S1*sx[6] );\n\t\tdx3 = sx[ 4 ] - ( S2*sx[5] );\n\t\tdx4 = sx[ 3 ] - ( S3*sx[4] );\n\t\tdx5 = sx[ 2 ] - ( S4*sx[3] );\n\t\tdx6 = sx[ 1 ] - ( S5*sx[2] );\n\t\tdx7 = sx[ 0 ] - ( S6*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 7 ];\n\t\tdy1 = sy[ 6 ] - ( S0*sy[7] );\n\t\tdy2 = sy[ 5 ] - ( S1*sy[6] );\n\t\tdy3 = sy[ 4 ] - ( S2*sy[5] );\n\t\tdy4 = sy[ 3 ] - ( S3*sy[4] );\n\t\tdy5 = sy[ 2 ] - ( S4*sy[3] );\n\t\tdy6 = sy[ 1 ] - ( S5*sy[2] );\n\t\tdy7 = sy[ 0 ] - ( S6*sy[1] );\n\t\tdz0 = sz[ 7 ];\n\t\tdz1 = sz[ 6 ] - ( S0*sz[7] );\n\t\tdz2 = sz[ 5 ] - ( S1*sz[6] );\n\t\tdz3 = sz[ 4 ] - ( S2*sz[5] );\n\t\tdz4 = sz[ 3 ] - ( S3*sz[4] );\n\t\tdz5 = sz[ 2 ] - ( S4*sz[3] );\n\t\tdz6 = sz[ 1 ] - ( S5*sz[2] );\n\t\tdz7 = sz[ 0 ] - ( S6*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] );\n\t\tdx7 = sx[ 7 ] - ( S6*sx[6] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdy7 = sy[ 7 ] - ( S6*sy[6] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t\tdz7 = sz[ 7 ] - ( S6*sz[6] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx4;\n\t\t\t\t\tiy += dy4;\n\t\t\t\t\tiz += dz4;\n\t\t\t\t}\n\t\t\t\tix += dx5;\n\t\t\t\tiy += dy5;\n\t\t\t\tiz += dz5;\n\t\t\t}\n\t\t\tix += dx6;\n\t\t\tiy += dy6;\n\t\t\tiz += dz6;\n\t\t}\n\t\tix += dx7;\n\t\tiy += dy7;\n\t\tiz += dz7;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements, max-len */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in nine-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary9d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary9d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar S8;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 8 ];\n\t\tS1 = sh[ 7 ];\n\t\tS2 = sh[ 6 ];\n\t\tS3 = sh[ 5 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 3 ];\n\t\tS6 = sh[ 2 ];\n\t\tS7 = sh[ 1 ];\n\t\tS8 = sh[ 0 ];\n\t\tdx0 = sx[ 8 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 7 ] - ( S0*sx[8] );\n\t\tdx2 = sx[ 6 ] - ( S1*sx[7] );\n\t\tdx3 = sx[ 5 ] - ( S2*sx[6] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[5] );\n\t\tdx5 = sx[ 3 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 2 ] - ( S5*sx[3] );\n\t\tdx7 = sx[ 1 ] - ( S6*sx[2] );\n\t\tdx8 = sx[ 0 ] - ( S7*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 8 ];\n\t\tdy1 = sy[ 7 ] - ( S0*sy[8] );\n\t\tdy2 = sy[ 6 ] - ( S1*sy[7] );\n\t\tdy3 = sy[ 5 ] - ( S2*sy[6] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[5] );\n\t\tdy5 = sy[ 3 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 2 ] - ( S5*sy[3] );\n\t\tdy7 = sy[ 1 ] - ( S6*sy[2] );\n\t\tdy8 = sy[ 0 ] - ( S7*sy[1] );\n\t\tdz0 = sz[ 8 ];\n\t\tdz1 = sz[ 7 ] - ( S0*sz[8] );\n\t\tdz2 = sz[ 6 ] - ( S1*sz[7] );\n\t\tdz3 = sz[ 5 ] - ( S2*sz[6] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[5] );\n\t\tdz5 = sz[ 3 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 2 ] - ( S5*sz[3] );\n\t\tdz7 = sz[ 1 ] - ( S6*sz[2] );\n\t\tdz8 = sz[ 0 ] - ( S7*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tS8 = sh[ 8 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] );\n\t\tdx7 = sx[ 7 ] - ( S6*sx[6] );\n\t\tdx8 = sx[ 8 ] - ( S7*sx[7] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdy7 = sy[ 7 ] - ( S6*sy[6] );\n\t\tdy8 = sy[ 8 ] - ( S7*sy[7] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t\tdz7 = sz[ 7 ] - ( S6*sz[6] );\n\t\tdz8 = sz[ 8 ] - ( S7*sz[7] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i8 = 0; i8 < S8; i8++ ) {\n\t\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx5;\n\t\t\t\t\tiy += dy5;\n\t\t\t\t\tiz += dz5;\n\t\t\t\t}\n\t\t\t\tix += dx6;\n\t\t\t\tiy += dy6;\n\t\t\t\tiz += dz6;\n\t\t\t}\n\t\t\tix += dx7;\n\t\t\tiy += dy7;\n\t\t\tiz += dz7;\n\t\t}\n\t\tix += dx8;\n\t\tiy += dy8;\n\t\tiz += dz8;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements, max-len, max-lines-per-function */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in ten-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary10d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary10d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dx9;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dy9;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar dz9;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar S8;\n\tvar S9;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar i9;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 9 ];\n\t\tS1 = sh[ 8 ];\n\t\tS2 = sh[ 7 ];\n\t\tS3 = sh[ 6 ];\n\t\tS4 = sh[ 5 ];\n\t\tS5 = sh[ 4 ];\n\t\tS6 = sh[ 3 ];\n\t\tS7 = sh[ 2 ];\n\t\tS8 = sh[ 1 ];\n\t\tS9 = sh[ 0 ];\n\t\tdx0 = sx[ 9 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 8 ] - ( S0*sx[9] );\n\t\tdx2 = sx[ 7 ] - ( S1*sx[8] );\n\t\tdx3 = sx[ 6 ] - ( S2*sx[7] );\n\t\tdx4 = sx[ 5 ] - ( S3*sx[6] );\n\t\tdx5 = sx[ 4 ] - ( S4*sx[5] );\n\t\tdx6 = sx[ 3 ] - ( S5*sx[4] );\n\t\tdx7 = sx[ 2 ] - ( S6*sx[3] );\n\t\tdx8 = sx[ 1 ] - ( S7*sx[2] );\n\t\tdx9 = sx[ 0 ] - ( S8*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 9 ];\n\t\tdy1 = sy[ 8 ] - ( S0*sy[9] );\n\t\tdy2 = sy[ 7 ] - ( S1*sy[8] );\n\t\tdy3 = sy[ 6 ] - ( S2*sy[7] );\n\t\tdy4 = sy[ 5 ] - ( S3*sy[6] );\n\t\tdy5 = sy[ 4 ] - ( S4*sy[5] );\n\t\tdy6 = sy[ 3 ] - ( S5*sy[4] );\n\t\tdy7 = sy[ 2 ] - ( S6*sy[3] );\n\t\tdy8 = sy[ 1 ] - ( S7*sy[2] );\n\t\tdy9 = sy[ 0 ] - ( S8*sy[1] );\n\t\tdz0 = sz[ 9 ];\n\t\tdz1 = sz[ 8 ] - ( S0*sz[9] );\n\t\tdz2 = sz[ 7 ] - ( S1*sz[8] );\n\t\tdz3 = sz[ 6 ] - ( S2*sz[7] );\n\t\tdz4 = sz[ 5 ] - ( S3*sz[6] );\n\t\tdz5 = sz[ 4 ] - ( S4*sz[5] );\n\t\tdz6 = sz[ 3 ] - ( S5*sz[4] );\n\t\tdz7 = sz[ 2 ] - ( S6*sz[3] );\n\t\tdz8 = sz[ 1 ] - ( S7*sz[2] );\n\t\tdz9 = sz[ 0 ] - ( S8*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tS8 = sh[ 8 ];\n\t\tS9 = sh[ 9 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] );\n\t\tdx7 = sx[ 7 ] - ( S6*sx[6] );\n\t\tdx8 = sx[ 8 ] - ( S7*sx[7] );\n\t\tdx9 = sx[ 9 ] - ( S8*sx[8] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdy7 = sy[ 7 ] - ( S6*sy[6] );\n\t\tdy8 = sy[ 8 ] - ( S7*sy[7] );\n\t\tdy9 = sy[ 9 ] - ( S8*sy[8] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t\tdz7 = sz[ 7 ] - ( S6*sz[6] );\n\t\tdz8 = sz[ 8 ] - ( S7*sz[7] );\n\t\tdz9 = sz[ 9 ] - ( S8*sz[8] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i9 = 0; i9 < S9; i9++ ) {\n\t\tfor ( i8 = 0; i8 < S8; i8++ ) {\n\t\t\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\t\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx6;\n\t\t\t\t\tiy += dy6;\n\t\t\t\t\tiz += dz6;\n\t\t\t\t}\n\t\t\t\tix += dx7;\n\t\t\t\tiy += dy7;\n\t\t\t\tiz += dz7;\n\t\t\t}\n\t\t\tix += dx8;\n\t\t\tiy += dy8;\n\t\t\tiz += dz8;\n\t\t}\n\t\tix += dx9;\n\t\tiy += dy9;\n\t\tiz += dz9;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary10d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in zero-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0 ] );\n* var ybuf = toAccessorArray( [ 2.0 ] );\n* var zbuf = toAccessorArray( [ 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [];\n*\n* // Define the array strides:\n* var sx = [ 0 ];\n* var sy = [ 0 ];\n* var sz = [ 0 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary0d( x, y, z, fcn );\n*\n* var v = z.data.get( 0 );\n* // returns 3.0\n*/\nfunction binary0d( x, y, z, fcn ) {\n\tz.accessors[ 1 ]( z.data, z.offset, fcn( x.accessors[ 0 ]( x.data, x.offset ), y.accessors[ 0 ]( y.data, y.offset ) ) ); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nexport default binary0d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in one-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 12 ];\n*\n* // Define the array strides:\n* var sx = [ 1 ];\n* var sy = [ 1 ];\n* var sz = [ 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary1d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary1d( x, y, z, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dy0;\n\tvar dz0;\n\tvar S0;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables: dimensions and loop offset (pointer) increments...\n\tS0 = x.shape[ 0 ];\n\tdx0 = x.strides[ 0 ];\n\tdy0 = y.strides[ 0 ];\n\tdz0 = z.strides[ 0 ];\n\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\tix += dx0;\n\t\tiy += dy0;\n\t\tiz += dz0;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary1d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 6, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary2d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary2d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dy0;\n\tvar dy1;\n\tvar dz0;\n\tvar dz1;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 1 ];\n\t\tS1 = sh[ 0 ];\n\t\tdx0 = sx[ 1 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 0 ] - ( S0*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 1 ];\n\t\tdy1 = sy[ 0 ] - ( S0*sy[1] );\n\t\tdz0 = sz[ 1 ];\n\t\tdz1 = sz[ 0 ] - ( S0*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\tix += dx0;\n\t\t\tiy += dy0;\n\t\t\tiz += dz0;\n\t\t}\n\t\tix += dx1;\n\t\tiy += dy1;\n\t\tiz += dz1;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in three-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n* var sy = [ 4, 2, 1 ];\n* var sz = [ 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary3d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary3d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 2 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 0 ];\n\t\tdx0 = sx[ 2 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[2] );\n\t\tdx2 = sx[ 0 ] - ( S1*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 2 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[2] );\n\t\tdy2 = sy[ 0 ] - ( S1*sy[1] );\n\t\tdz0 = sz[ 2 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[2] );\n\t\tdz2 = sz[ 0 ] - ( S1*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\tix += dx0;\n\t\t\t\tiy += dy0;\n\t\t\t\tiz += dz0;\n\t\t\t}\n\t\t\tix += dx1;\n\t\t\tiy += dy1;\n\t\t\tiz += dz1;\n\t\t}\n\t\tix += dx2;\n\t\tiy += dy2;\n\t\tiz += dz2;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in four-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary4d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary4d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 3 ];\n\t\tS1 = sh[ 2 ];\n\t\tS2 = sh[ 1 ];\n\t\tS3 = sh[ 0 ];\n\t\tdx0 = sx[ 3 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 2 ] - ( S0*sx[3] );\n\t\tdx2 = sx[ 1 ] - ( S1*sx[2] );\n\t\tdx3 = sx[ 0 ] - ( S2*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 3 ];\n\t\tdy1 = sy[ 2 ] - ( S0*sy[3] );\n\t\tdy2 = sy[ 1 ] - ( S1*sy[2] );\n\t\tdy3 = sy[ 0 ] - ( S2*sy[1] );\n\t\tdz0 = sz[ 3 ];\n\t\tdz1 = sz[ 2 ] - ( S0*sz[3] );\n\t\tdz2 = sz[ 1 ] - ( S1*sz[2] );\n\t\tdz3 = sz[ 0 ] - ( S2*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\tix += dx0;\n\t\t\t\t\tiy += dy0;\n\t\t\t\t\tiz += dz0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t\tiy += dy1;\n\t\t\t\tiz += dz1;\n\t\t\t}\n\t\t\tix += dx2;\n\t\t\tiy += dy2;\n\t\t\tiz += dz2;\n\t\t}\n\t\tix += dx3;\n\t\tiy += dy3;\n\t\tiz += dz3;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-len, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in five-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary5d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary5d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 4 ];\n\t\tS1 = sh[ 3 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 1 ];\n\t\tS4 = sh[ 0 ];\n\t\tdx0 = sx[ 4 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 3 ] - ( S0*sx[4] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[3] );\n\t\tdx3 = sx[ 1 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 0 ] - ( S3*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 4 ];\n\t\tdy1 = sy[ 3 ] - ( S0*sy[4] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[3] );\n\t\tdy3 = sy[ 1 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 0 ] - ( S3*sy[1] );\n\t\tdz0 = sz[ 4 ];\n\t\tdz1 = sz[ 3 ] - ( S0*sz[4] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[3] );\n\t\tdz3 = sz[ 1 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 0 ] - ( S3*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx1;\n\t\t\t\t\tiy += dy1;\n\t\t\t\t\tiz += dz1;\n\t\t\t\t}\n\t\t\t\tix += dx2;\n\t\t\t\tiy += dy2;\n\t\t\t\tiz += dz2;\n\t\t\t}\n\t\t\tix += dx3;\n\t\t\tiy += dy3;\n\t\t\tiz += dz3;\n\t\t}\n\t\tix += dx4;\n\t\tiy += dy4;\n\t\tiz += dz4;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in six-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary6d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary6d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 5 ];\n\t\tS1 = sh[ 4 ];\n\t\tS2 = sh[ 3 ];\n\t\tS3 = sh[ 2 ];\n\t\tS4 = sh[ 1 ];\n\t\tS5 = sh[ 0 ];\n\t\tdx0 = sx[ 5 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 4 ] - ( S0*sx[5] );\n\t\tdx2 = sx[ 3 ] - ( S1*sx[4] );\n\t\tdx3 = sx[ 2 ] - ( S2*sx[3] );\n\t\tdx4 = sx[ 1 ] - ( S3*sx[2] );\n\t\tdx5 = sx[ 0 ] - ( S4*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 5 ];\n\t\tdy1 = sy[ 4 ] - ( S0*sy[5] );\n\t\tdy2 = sy[ 3 ] - ( S1*sy[4] );\n\t\tdy3 = sy[ 2 ] - ( S2*sy[3] );\n\t\tdy4 = sy[ 1 ] - ( S3*sy[2] );\n\t\tdy5 = sy[ 0 ] - ( S4*sy[1] );\n\t\tdz0 = sz[ 5 ];\n\t\tdz1 = sz[ 4 ] - ( S0*sz[5] );\n\t\tdz2 = sz[ 3 ] - ( S1*sz[4] );\n\t\tdz3 = sz[ 2 ] - ( S2*sz[3] );\n\t\tdz4 = sz[ 1 ] - ( S3*sz[2] );\n\t\tdz5 = sz[ 0 ] - ( S4*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t\tiy += dy2;\n\t\t\t\t\tiz += dz2;\n\t\t\t\t}\n\t\t\t\tix += dx3;\n\t\t\t\tiy += dy3;\n\t\t\t\tiz += dz3;\n\t\t\t}\n\t\t\tix += dx4;\n\t\t\tiy += dy4;\n\t\t\tiz += dz4;\n\t\t}\n\t\tix += dx5;\n\t\tiy += dy5;\n\t\tiz += dz5;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in seven-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary7d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary7d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 6 ];\n\t\tS1 = sh[ 5 ];\n\t\tS2 = sh[ 4 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 2 ];\n\t\tS5 = sh[ 1 ];\n\t\tS6 = sh[ 0 ];\n\t\tdx0 = sx[ 6 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 5 ] - ( S0*sx[6] );\n\t\tdx2 = sx[ 4 ] - ( S1*sx[5] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[4] );\n\t\tdx4 = sx[ 2 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 1 ] - ( S4*sx[2] );\n\t\tdx6 = sx[ 0 ] - ( S5*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 6 ];\n\t\tdy1 = sy[ 5 ] - ( S0*sy[6] );\n\t\tdy2 = sy[ 4 ] - ( S1*sy[5] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[4] );\n\t\tdy4 = sy[ 2 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 1 ] - ( S4*sy[2] );\n\t\tdy6 = sy[ 0 ] - ( S5*sy[1] );\n\t\tdz0 = sz[ 6 ];\n\t\tdz1 = sz[ 5 ] - ( S0*sz[6] );\n\t\tdz2 = sz[ 4 ] - ( S1*sz[5] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[4] );\n\t\tdz4 = sz[ 2 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 1 ] - ( S4*sz[2] );\n\t\tdz6 = sz[ 0 ] - ( S5*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx3;\n\t\t\t\t\tiy += dy3;\n\t\t\t\t\tiz += dz3;\n\t\t\t\t}\n\t\t\t\tix += dx4;\n\t\t\t\tiy += dy4;\n\t\t\t\tiz += dz4;\n\t\t\t}\n\t\t\tix += dx5;\n\t\t\tiy += dy5;\n\t\t\tiz += dz5;\n\t\t}\n\t\tix += dx6;\n\t\tiy += dy6;\n\t\tiz += dz6;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in eight-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary8d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary8d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 7 ];\n\t\tS1 = sh[ 6 ];\n\t\tS2 = sh[ 5 ];\n\t\tS3 = sh[ 4 ];\n\t\tS4 = sh[ 3 ];\n\t\tS5 = sh[ 2 ];\n\t\tS6 = sh[ 1 ];\n\t\tS7 = sh[ 0 ];\n\t\tdx0 = sx[ 7 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 6 ] - ( S0*sx[7] );\n\t\tdx2 = sx[ 5 ] - ( S1*sx[6] );\n\t\tdx3 = sx[ 4 ] - ( S2*sx[5] );\n\t\tdx4 = sx[ 3 ] - ( S3*sx[4] );\n\t\tdx5 = sx[ 2 ] - ( S4*sx[3] );\n\t\tdx6 = sx[ 1 ] - ( S5*sx[2] );\n\t\tdx7 = sx[ 0 ] - ( S6*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 7 ];\n\t\tdy1 = sy[ 6 ] - ( S0*sy[7] );\n\t\tdy2 = sy[ 5 ] - ( S1*sy[6] );\n\t\tdy3 = sy[ 4 ] - ( S2*sy[5] );\n\t\tdy4 = sy[ 3 ] - ( S3*sy[4] );\n\t\tdy5 = sy[ 2 ] - ( S4*sy[3] );\n\t\tdy6 = sy[ 1 ] - ( S5*sy[2] );\n\t\tdy7 = sy[ 0 ] - ( S6*sy[1] );\n\t\tdz0 = sz[ 7 ];\n\t\tdz1 = sz[ 6 ] - ( S0*sz[7] );\n\t\tdz2 = sz[ 5 ] - ( S1*sz[6] );\n\t\tdz3 = sz[ 4 ] - ( S2*sz[5] );\n\t\tdz4 = sz[ 3 ] - ( S3*sz[4] );\n\t\tdz5 = sz[ 2 ] - ( S4*sz[3] );\n\t\tdz6 = sz[ 1 ] - ( S5*sz[2] );\n\t\tdz7 = sz[ 0 ] - ( S6*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] );\n\t\tdx7 = sx[ 7 ] - ( S6*sx[6] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdy7 = sy[ 7 ] - ( S6*sy[6] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t\tdz7 = sz[ 7 ] - ( S6*sz[6] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx4;\n\t\t\t\t\tiy += dy4;\n\t\t\t\t\tiz += dz4;\n\t\t\t\t}\n\t\t\t\tix += dx5;\n\t\t\t\tiy += dy5;\n\t\t\t\tiz += dz5;\n\t\t\t}\n\t\t\tix += dx6;\n\t\t\tiy += dy6;\n\t\t\tiz += dz6;\n\t\t}\n\t\tix += dx7;\n\t\tiy += dy7;\n\t\tiz += dz7;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in nine-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary9d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary9d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar S8;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 8 ];\n\t\tS1 = sh[ 7 ];\n\t\tS2 = sh[ 6 ];\n\t\tS3 = sh[ 5 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 3 ];\n\t\tS6 = sh[ 2 ];\n\t\tS7 = sh[ 1 ];\n\t\tS8 = sh[ 0 ];\n\t\tdx0 = sx[ 8 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 7 ] - ( S0*sx[8] );\n\t\tdx2 = sx[ 6 ] - ( S1*sx[7] );\n\t\tdx3 = sx[ 5 ] - ( S2*sx[6] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[5] );\n\t\tdx5 = sx[ 3 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 2 ] - ( S5*sx[3] );\n\t\tdx7 = sx[ 1 ] - ( S6*sx[2] );\n\t\tdx8 = sx[ 0 ] - ( S7*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 8 ];\n\t\tdy1 = sy[ 7 ] - ( S0*sy[8] );\n\t\tdy2 = sy[ 6 ] - ( S1*sy[7] );\n\t\tdy3 = sy[ 5 ] - ( S2*sy[6] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[5] );\n\t\tdy5 = sy[ 3 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 2 ] - ( S5*sy[3] );\n\t\tdy7 = sy[ 1 ] - ( S6*sy[2] );\n\t\tdy8 = sy[ 0 ] - ( S7*sy[1] );\n\t\tdz0 = sz[ 8 ];\n\t\tdz1 = sz[ 7 ] - ( S0*sz[8] );\n\t\tdz2 = sz[ 6 ] - ( S1*sz[7] );\n\t\tdz3 = sz[ 5 ] - ( S2*sz[6] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[5] );\n\t\tdz5 = sz[ 3 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 2 ] - ( S5*sz[3] );\n\t\tdz7 = sz[ 1 ] - ( S6*sz[2] );\n\t\tdz8 = sz[ 0 ] - ( S7*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tS8 = sh[ 8 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] );\n\t\tdx7 = sx[ 7 ] - ( S6*sx[6] );\n\t\tdx8 = sx[ 8 ] - ( S7*sx[7] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdy7 = sy[ 7 ] - ( S6*sy[6] );\n\t\tdy8 = sy[ 8 ] - ( S7*sy[7] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t\tdz7 = sz[ 7 ] - ( S6*sz[6] );\n\t\tdz8 = sz[ 8 ] - ( S7*sz[7] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i8 = 0; i8 < S8; i8++ ) {\n\t\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx5;\n\t\t\t\t\tiy += dy5;\n\t\t\t\t\tiz += dz5;\n\t\t\t\t}\n\t\t\t\tix += dx6;\n\t\t\t\tiy += dy6;\n\t\t\t\tiz += dz6;\n\t\t\t}\n\t\t\tix += dx7;\n\t\t\tiy += dy7;\n\t\t\tiz += dz7;\n\t\t}\n\t\tix += dx8;\n\t\tiy += dy8;\n\t\tiz += dz8;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in ten-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary10d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary10d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dx9;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dy9;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar dz9;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar S8;\n\tvar S9;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar i9;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 9 ];\n\t\tS1 = sh[ 8 ];\n\t\tS2 = sh[ 7 ];\n\t\tS3 = sh[ 6 ];\n\t\tS4 = sh[ 5 ];\n\t\tS5 = sh[ 4 ];\n\t\tS6 = sh[ 3 ];\n\t\tS7 = sh[ 2 ];\n\t\tS8 = sh[ 1 ];\n\t\tS9 = sh[ 0 ];\n\t\tdx0 = sx[ 9 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 8 ] - ( S0*sx[9] );\n\t\tdx2 = sx[ 7 ] - ( S1*sx[8] );\n\t\tdx3 = sx[ 6 ] - ( S2*sx[7] );\n\t\tdx4 = sx[ 5 ] - ( S3*sx[6] );\n\t\tdx5 = sx[ 4 ] - ( S4*sx[5] );\n\t\tdx6 = sx[ 3 ] - ( S5*sx[4] );\n\t\tdx7 = sx[ 2 ] - ( S6*sx[3] );\n\t\tdx8 = sx[ 1 ] - ( S7*sx[2] );\n\t\tdx9 = sx[ 0 ] - ( S8*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 9 ];\n\t\tdy1 = sy[ 8 ] - ( S0*sy[9] );\n\t\tdy2 = sy[ 7 ] - ( S1*sy[8] );\n\t\tdy3 = sy[ 6 ] - ( S2*sy[7] );\n\t\tdy4 = sy[ 5 ] - ( S3*sy[6] );\n\t\tdy5 = sy[ 4 ] - ( S4*sy[5] );\n\t\tdy6 = sy[ 3 ] - ( S5*sy[4] );\n\t\tdy7 = sy[ 2 ] - ( S6*sy[3] );\n\t\tdy8 = sy[ 1 ] - ( S7*sy[2] );\n\t\tdy9 = sy[ 0 ] - ( S8*sy[1] );\n\t\tdz0 = sz[ 9 ];\n\t\tdz1 = sz[ 8 ] - ( S0*sz[9] );\n\t\tdz2 = sz[ 7 ] - ( S1*sz[8] );\n\t\tdz3 = sz[ 6 ] - ( S2*sz[7] );\n\t\tdz4 = sz[ 5 ] - ( S3*sz[6] );\n\t\tdz5 = sz[ 4 ] - ( S4*sz[5] );\n\t\tdz6 = sz[ 3 ] - ( S5*sz[4] );\n\t\tdz7 = sz[ 2 ] - ( S6*sz[3] );\n\t\tdz8 = sz[ 1 ] - ( S7*sz[2] );\n\t\tdz9 = sz[ 0 ] - ( S8*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tS8 = sh[ 8 ];\n\t\tS9 = sh[ 9 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] );\n\t\tdx7 = sx[ 7 ] - ( S6*sx[6] );\n\t\tdx8 = sx[ 8 ] - ( S7*sx[7] );\n\t\tdx9 = sx[ 9 ] - ( S8*sx[8] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdy7 = sy[ 7 ] - ( S6*sy[6] );\n\t\tdy8 = sy[ 8 ] - ( S7*sy[7] );\n\t\tdy9 = sy[ 9 ] - ( S8*sy[8] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t\tdz7 = sz[ 7 ] - ( S6*sz[6] );\n\t\tdz8 = sz[ 8 ] - ( S7*sz[7] );\n\t\tdz9 = sz[ 9 ] - ( S8*sz[8] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i9 = 0; i9 < S9; i9++ ) {\n\t\tfor ( i8 = 0; i8 < S8; i8++ ) {\n\t\t\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\t\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx6;\n\t\t\t\t\tiy += dy6;\n\t\t\t\t\tiz += dz6;\n\t\t\t\t}\n\t\t\t\tix += dx7;\n\t\t\t\tiy += dy7;\n\t\t\t\tiz += dz7;\n\t\t\t}\n\t\t\tix += dx8;\n\t\t\tiy += dy8;\n\t\t\tiz += dz8;\n\t\t}\n\t\tix += dx9;\n\t\tiy += dy9;\n\t\tiz += dz9;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary10d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 6, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary2d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary2d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dy0;\n\tvar dy1;\n\tvar dz0;\n\tvar dz1;\n\tvar ox1;\n\tvar oy1;\n\tvar oz1;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar j0;\n\tvar j1;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\tif ( j1 < bsize ) {\n\t\t\ts1 = j1;\n\t\t\tj1 = 0;\n\t\t} else {\n\t\t\ts1 = bsize;\n\t\t\tj1 -= bsize;\n\t\t}\n\t\tox1 = ox + ( j1*sx[1] );\n\t\toy1 = oy + ( j1*sy[1] );\n\t\toz1 = oz + ( j1*sz[1] );\n\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\tif ( j0 < bsize ) {\n\t\t\t\ts0 = j0;\n\t\t\t\tj0 = 0;\n\t\t\t} else {\n\t\t\t\ts0 = bsize;\n\t\t\t\tj0 -= bsize;\n\t\t\t}\n\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t// Compute loop offset increments...\n\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t// Iterate over the ndarray dimensions...\n\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\tix += dx0;\n\t\t\t\t\tiy += dy0;\n\t\t\t\t\tiz += dz0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t\tiy += dy1;\n\t\t\t\tiz += dz1;\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in three-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n* var sy = [ 4, 2, 1 ];\n* var sz = [ 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary3d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary3d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar ox1;\n\tvar ox2;\n\tvar oy1;\n\tvar oy2;\n\tvar oz1;\n\tvar oz2;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\tif ( j2 < bsize ) {\n\t\t\ts2 = j2;\n\t\t\tj2 = 0;\n\t\t} else {\n\t\t\ts2 = bsize;\n\t\t\tj2 -= bsize;\n\t\t}\n\t\tox2 = ox + ( j2*sx[2] );\n\t\toy2 = oy + ( j2*sy[2] );\n\t\toz2 = oz + ( j2*sz[2] );\n\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\tif ( j1 < bsize ) {\n\t\t\t\ts1 = j1;\n\t\t\t\tj1 = 0;\n\t\t\t} else {\n\t\t\t\ts1 = bsize;\n\t\t\t\tj1 -= bsize;\n\t\t\t}\n\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\ts0 = j0;\n\t\t\t\t\tj0 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts0 = bsize;\n\t\t\t\t\tj0 -= bsize;\n\t\t\t\t}\n\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t// Compute loop offset increments...\n\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t\tiy += dy2;\n\t\t\t\t\tiz += dz2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in four-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary4d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary4d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\tif ( j3 < bsize ) {\n\t\t\ts3 = j3;\n\t\t\tj3 = 0;\n\t\t} else {\n\t\t\ts3 = bsize;\n\t\t\tj3 -= bsize;\n\t\t}\n\t\tox3 = ox + ( j3*sx[3] );\n\t\toy3 = oy + ( j3*sy[3] );\n\t\toz3 = oz + ( j3*sz[3] );\n\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\tif ( j2 < bsize ) {\n\t\t\t\ts2 = j2;\n\t\t\t\tj2 = 0;\n\t\t\t} else {\n\t\t\t\ts2 = bsize;\n\t\t\t\tj2 -= bsize;\n\t\t\t}\n\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\ts1 = j1;\n\t\t\t\t\tj1 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts1 = bsize;\n\t\t\t\t\tj1 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements, max-len */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in five-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary5d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary5d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\tif ( j4 < bsize ) {\n\t\t\ts4 = j4;\n\t\t\tj4 = 0;\n\t\t} else {\n\t\t\ts4 = bsize;\n\t\t\tj4 -= bsize;\n\t\t}\n\t\tox4 = ox + ( j4*sx[4] );\n\t\toy4 = oy + ( j4*sy[4] );\n\t\toz4 = oz + ( j4*sz[4] );\n\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\tif ( j3 < bsize ) {\n\t\t\t\ts3 = j3;\n\t\t\t\tj3 = 0;\n\t\t\t} else {\n\t\t\t\ts3 = bsize;\n\t\t\t\tj3 -= bsize;\n\t\t\t}\n\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\ts2 = j2;\n\t\t\t\t\tj2 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts2 = bsize;\n\t\t\t\t\tj2 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in six-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary6d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary6d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\tif ( j5 < bsize ) {\n\t\t\ts5 = j5;\n\t\t\tj5 = 0;\n\t\t} else {\n\t\t\ts5 = bsize;\n\t\t\tj5 -= bsize;\n\t\t}\n\t\tox5 = ox + ( j5*sx[5] );\n\t\toy5 = oy + ( j5*sy[5] );\n\t\toz5 = oz + ( j5*sz[5] );\n\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\tif ( j4 < bsize ) {\n\t\t\t\ts4 = j4;\n\t\t\t\tj4 = 0;\n\t\t\t} else {\n\t\t\t\ts4 = bsize;\n\t\t\t\tj4 -= bsize;\n\t\t\t}\n\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\ts3 = j3;\n\t\t\t\t\tj3 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts3 = bsize;\n\t\t\t\t\tj3 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in seven-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary7d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary7d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\tif ( j6 < bsize ) {\n\t\t\ts6 = j6;\n\t\t\tj6 = 0;\n\t\t} else {\n\t\t\ts6 = bsize;\n\t\t\tj6 -= bsize;\n\t\t}\n\t\tox6 = ox + ( j6*sx[6] );\n\t\toy6 = oy + ( j6*sy[6] );\n\t\toz6 = oz + ( j6*sz[6] );\n\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\tif ( j5 < bsize ) {\n\t\t\t\ts5 = j5;\n\t\t\t\tj5 = 0;\n\t\t\t} else {\n\t\t\t\ts5 = bsize;\n\t\t\t\tj5 -= bsize;\n\t\t\t}\n\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\ts4 = j4;\n\t\t\t\t\tj4 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts4 = bsize;\n\t\t\t\t\tj4 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in eight-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary8d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary8d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oy7;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar oz7;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\tif ( j7 < bsize ) {\n\t\t\ts7 = j7;\n\t\t\tj7 = 0;\n\t\t} else {\n\t\t\ts7 = bsize;\n\t\t\tj7 -= bsize;\n\t\t}\n\t\tox7 = ox + ( j7*sx[7] );\n\t\toy7 = oy + ( j7*sy[7] );\n\t\toz7 = oz + ( j7*sz[7] );\n\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\tif ( j6 < bsize ) {\n\t\t\t\ts6 = j6;\n\t\t\t\tj6 = 0;\n\t\t\t} else {\n\t\t\t\ts6 = bsize;\n\t\t\t\tj6 -= bsize;\n\t\t\t}\n\t\t\tdx7 = sx[7] - ( s6*sx[6] );\n\t\t\tdy7 = sy[7] - ( s6*sy[6] );\n\t\t\tdz7 = sz[7] - ( s6*sz[6] );\n\t\t\tox6 = ox7 + ( j6*sx[6] );\n\t\t\toy6 = oy7 + ( j6*sy[6] );\n\t\t\toz6 = oz7 + ( j6*sz[6] );\n\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\ts5 = j5;\n\t\t\t\t\tj5 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts5 = bsize;\n\t\t\t\t\tj5 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx7;\n\t\t\t\t\t\t\t\t\t\tiy += dy7;\n\t\t\t\t\t\t\t\t\t\tiz += dz7;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in nine-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary9d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary9d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oy7;\n\tvar oy8;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar oz7;\n\tvar oz8;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar s8;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar j8;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j8 = sh[8]; j8 > 0; ) {\n\t\tif ( j8 < bsize ) {\n\t\t\ts8 = j8;\n\t\t\tj8 = 0;\n\t\t} else {\n\t\t\ts8 = bsize;\n\t\t\tj8 -= bsize;\n\t\t}\n\t\tox8 = ox + ( j8*sx[8] );\n\t\toy8 = oy + ( j8*sy[8] );\n\t\toz8 = oz + ( j8*sz[8] );\n\t\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\t\tif ( j7 < bsize ) {\n\t\t\t\ts7 = j7;\n\t\t\t\tj7 = 0;\n\t\t\t} else {\n\t\t\t\ts7 = bsize;\n\t\t\t\tj7 -= bsize;\n\t\t\t}\n\t\t\tdx8 = sx[8] - ( s7*sx[7] );\n\t\t\tdy8 = sy[8] - ( s7*sy[7] );\n\t\t\tdz8 = sz[8] - ( s7*sz[7] );\n\t\t\tox7 = ox8 + ( j7*sx[7] );\n\t\t\toy7 = oy8 + ( j7*sy[7] );\n\t\t\toz7 = oz8 + ( j7*sz[7] );\n\t\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\t\tif ( j6 < bsize ) {\n\t\t\t\t\ts6 = j6;\n\t\t\t\t\tj6 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts6 = bsize;\n\t\t\t\t\tj6 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx7 = sx[7] - ( s6*sx[6] );\n\t\t\t\tdy7 = sy[7] - ( s6*sy[6] );\n\t\t\t\tdz7 = sz[7] - ( s6*sz[6] );\n\t\t\t\tox6 = ox7 + ( j6*sx[6] );\n\t\t\t\toy6 = oy7 + ( j6*sy[6] );\n\t\t\t\toz6 = oz7 + ( j6*sz[6] );\n\t\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\t\ts5 = j5;\n\t\t\t\t\t\tj5 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts5 = bsize;\n\t\t\t\t\t\tj5 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\t\t\tfor ( i8 = 0; i8 < s8; i8++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx7;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy7;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz7;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx8;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy8;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz8;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function, max-lines */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in ten-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary10d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary10d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dx9;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dy9;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar dz9;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\n\tvar ox9;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oy7;\n\tvar oy8;\n\tvar oy9;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar oz7;\n\tvar oz8;\n\tvar oz9;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar s8;\n\tvar s9;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar i9;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar j8;\n\tvar j9;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j9 = sh[9]; j9 > 0; ) {\n\t\tif ( j9 < bsize ) {\n\t\t\ts9 = j9;\n\t\t\tj9 = 0;\n\t\t} else {\n\t\t\ts9 = bsize;\n\t\t\tj9 -= bsize;\n\t\t}\n\t\tox9 = ox + ( j9*sx[9] );\n\t\toy9 = oy + ( j9*sy[9] );\n\t\toz9 = oz + ( j9*sz[9] );\n\t\tfor ( j8 = sh[8]; j8 > 0; ) {\n\t\t\tif ( j8 < bsize ) {\n\t\t\t\ts8 = j8;\n\t\t\t\tj8 = 0;\n\t\t\t} else {\n\t\t\t\ts8 = bsize;\n\t\t\t\tj8 -= bsize;\n\t\t\t}\n\t\t\tdx9 = sx[9] - ( s8*sx[8] );\n\t\t\tdy9 = sy[9] - ( s8*sy[8] );\n\t\t\tdz9 = sz[9] - ( s8*sz[8] );\n\t\t\tox8 = ox9 + ( j8*sx[8] );\n\t\t\toy8 = oy9 + ( j8*sy[8] );\n\t\t\toz8 = oz9 + ( j8*sz[8] );\n\t\t\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\t\t\tif ( j7 < bsize ) {\n\t\t\t\t\ts7 = j7;\n\t\t\t\t\tj7 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts7 = bsize;\n\t\t\t\t\tj7 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx8 = sx[8] - ( s7*sx[7] );\n\t\t\t\tdy8 = sy[8] - ( s7*sy[7] );\n\t\t\t\tdz8 = sz[8] - ( s7*sz[7] );\n\t\t\t\tox7 = ox8 + ( j7*sx[7] );\n\t\t\t\toy7 = oy8 + ( j7*sy[7] );\n\t\t\t\toz7 = oz8 + ( j7*sz[7] );\n\t\t\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\t\t\tif ( j6 < bsize ) {\n\t\t\t\t\t\ts6 = j6;\n\t\t\t\t\t\tj6 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts6 = bsize;\n\t\t\t\t\t\tj6 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx7 = sx[7] - ( s6*sx[6] );\n\t\t\t\t\tdy7 = sy[7] - ( s6*sy[6] );\n\t\t\t\t\tdz7 = sz[7] - ( s6*sz[6] );\n\t\t\t\t\tox6 = ox7 + ( j6*sx[6] );\n\t\t\t\t\toy6 = oy7 + ( j6*sy[6] );\n\t\t\t\t\toz6 = oz7 + ( j6*sz[6] );\n\t\t\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\t\t\ts5 = j5;\n\t\t\t\t\t\t\tj5 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts5 = bsize;\n\t\t\t\t\t\t\tj5 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\t\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\t\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\t\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\t\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\t\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\t\t\t\tfor ( i9 = 0; i9 < s9; i9++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i8 = 0; i8 < s8; i8++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx7;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy7;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz7;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx8;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy8;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz8;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx9;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy9;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz9;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary10d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 6, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary2d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary2d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dy0;\n\tvar dy1;\n\tvar dz0;\n\tvar dz1;\n\tvar ox1;\n\tvar oy1;\n\tvar oz1;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar j0;\n\tvar j1;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\tif ( j1 < bsize ) {\n\t\t\ts1 = j1;\n\t\t\tj1 = 0;\n\t\t} else {\n\t\t\ts1 = bsize;\n\t\t\tj1 -= bsize;\n\t\t}\n\t\tox1 = ox + ( j1*sx[1] );\n\t\toy1 = oy + ( j1*sy[1] );\n\t\toz1 = oz + ( j1*sz[1] );\n\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\tif ( j0 < bsize ) {\n\t\t\t\ts0 = j0;\n\t\t\t\tj0 = 0;\n\t\t\t} else {\n\t\t\t\ts0 = bsize;\n\t\t\t\tj0 -= bsize;\n\t\t\t}\n\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t// Compute loop offset increments...\n\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t// Iterate over the ndarray dimensions...\n\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\tix += dx0;\n\t\t\t\t\tiy += dy0;\n\t\t\t\t\tiz += dz0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t\tiy += dy1;\n\t\t\t\tiz += dz1;\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in three-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n* var sy = [ 4, 2, 1 ];\n* var sz = [ 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary3d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary3d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar ox1;\n\tvar ox2;\n\tvar oy1;\n\tvar oy2;\n\tvar oz1;\n\tvar oz2;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\tif ( j2 < bsize ) {\n\t\t\ts2 = j2;\n\t\t\tj2 = 0;\n\t\t} else {\n\t\t\ts2 = bsize;\n\t\t\tj2 -= bsize;\n\t\t}\n\t\tox2 = ox + ( j2*sx[2] );\n\t\toy2 = oy + ( j2*sy[2] );\n\t\toz2 = oz + ( j2*sz[2] );\n\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\tif ( j1 < bsize ) {\n\t\t\t\ts1 = j1;\n\t\t\t\tj1 = 0;\n\t\t\t} else {\n\t\t\t\ts1 = bsize;\n\t\t\t\tj1 -= bsize;\n\t\t\t}\n\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\ts0 = j0;\n\t\t\t\t\tj0 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts0 = bsize;\n\t\t\t\t\tj0 -= bsize;\n\t\t\t\t}\n\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t// Compute loop offset increments...\n\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t\tiy += dy2;\n\t\t\t\t\tiz += dz2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in four-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary4d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary4d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\tif ( j3 < bsize ) {\n\t\t\ts3 = j3;\n\t\t\tj3 = 0;\n\t\t} else {\n\t\t\ts3 = bsize;\n\t\t\tj3 -= bsize;\n\t\t}\n\t\tox3 = ox + ( j3*sx[3] );\n\t\toy3 = oy + ( j3*sy[3] );\n\t\toz3 = oz + ( j3*sz[3] );\n\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\tif ( j2 < bsize ) {\n\t\t\t\ts2 = j2;\n\t\t\t\tj2 = 0;\n\t\t\t} else {\n\t\t\t\ts2 = bsize;\n\t\t\t\tj2 -= bsize;\n\t\t\t}\n\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\ts1 = j1;\n\t\t\t\t\tj1 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts1 = bsize;\n\t\t\t\t\tj1 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in five-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary5d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary5d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\tif ( j4 < bsize ) {\n\t\t\ts4 = j4;\n\t\t\tj4 = 0;\n\t\t} else {\n\t\t\ts4 = bsize;\n\t\t\tj4 -= bsize;\n\t\t}\n\t\tox4 = ox + ( j4*sx[4] );\n\t\toy4 = oy + ( j4*sy[4] );\n\t\toz4 = oz + ( j4*sz[4] );\n\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\tif ( j3 < bsize ) {\n\t\t\t\ts3 = j3;\n\t\t\t\tj3 = 0;\n\t\t\t} else {\n\t\t\t\ts3 = bsize;\n\t\t\t\tj3 -= bsize;\n\t\t\t}\n\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\ts2 = j2;\n\t\t\t\t\tj2 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts2 = bsize;\n\t\t\t\t\tj2 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in six-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary6d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary6d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\tif ( j5 < bsize ) {\n\t\t\ts5 = j5;\n\t\t\tj5 = 0;\n\t\t} else {\n\t\t\ts5 = bsize;\n\t\t\tj5 -= bsize;\n\t\t}\n\t\tox5 = ox + ( j5*sx[5] );\n\t\toy5 = oy + ( j5*sy[5] );\n\t\toz5 = oz + ( j5*sz[5] );\n\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\tif ( j4 < bsize ) {\n\t\t\t\ts4 = j4;\n\t\t\t\tj4 = 0;\n\t\t\t} else {\n\t\t\t\ts4 = bsize;\n\t\t\t\tj4 -= bsize;\n\t\t\t}\n\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\ts3 = j3;\n\t\t\t\t\tj3 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts3 = bsize;\n\t\t\t\t\tj3 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in seven-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary7d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary7d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\tif ( j6 < bsize ) {\n\t\t\ts6 = j6;\n\t\t\tj6 = 0;\n\t\t} else {\n\t\t\ts6 = bsize;\n\t\t\tj6 -= bsize;\n\t\t}\n\t\tox6 = ox + ( j6*sx[6] );\n\t\toy6 = oy + ( j6*sy[6] );\n\t\toz6 = oz + ( j6*sz[6] );\n\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\tif ( j5 < bsize ) {\n\t\t\t\ts5 = j5;\n\t\t\t\tj5 = 0;\n\t\t\t} else {\n\t\t\t\ts5 = bsize;\n\t\t\t\tj5 -= bsize;\n\t\t\t}\n\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\ts4 = j4;\n\t\t\t\t\tj4 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts4 = bsize;\n\t\t\t\t\tj4 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in eight-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary8d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary8d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oy7;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar oz7;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\tif ( j7 < bsize ) {\n\t\t\ts7 = j7;\n\t\t\tj7 = 0;\n\t\t} else {\n\t\t\ts7 = bsize;\n\t\t\tj7 -= bsize;\n\t\t}\n\t\tox7 = ox + ( j7*sx[7] );\n\t\toy7 = oy + ( j7*sy[7] );\n\t\toz7 = oz + ( j7*sz[7] );\n\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\tif ( j6 < bsize ) {\n\t\t\t\ts6 = j6;\n\t\t\t\tj6 = 0;\n\t\t\t} else {\n\t\t\t\ts6 = bsize;\n\t\t\t\tj6 -= bsize;\n\t\t\t}\n\t\t\tdx7 = sx[7] - ( s6*sx[6] );\n\t\t\tdy7 = sy[7] - ( s6*sy[6] );\n\t\t\tdz7 = sz[7] - ( s6*sz[6] );\n\t\t\tox6 = ox7 + ( j6*sx[6] );\n\t\t\toy6 = oy7 + ( j6*sy[6] );\n\t\t\toz6 = oz7 + ( j6*sz[6] );\n\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\ts5 = j5;\n\t\t\t\t\tj5 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts5 = bsize;\n\t\t\t\t\tj5 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx7;\n\t\t\t\t\t\t\t\t\t\tiy += dy7;\n\t\t\t\t\t\t\t\t\t\tiz += dz7;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in nine-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary9d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary9d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oy7;\n\tvar oy8;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar oz7;\n\tvar oz8;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar s8;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar j8;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j8 = sh[8]; j8 > 0; ) {\n\t\tif ( j8 < bsize ) {\n\t\t\ts8 = j8;\n\t\t\tj8 = 0;\n\t\t} else {\n\t\t\ts8 = bsize;\n\t\t\tj8 -= bsize;\n\t\t}\n\t\tox8 = ox + ( j8*sx[8] );\n\t\toy8 = oy + ( j8*sy[8] );\n\t\toz8 = oz + ( j8*sz[8] );\n\t\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\t\tif ( j7 < bsize ) {\n\t\t\t\ts7 = j7;\n\t\t\t\tj7 = 0;\n\t\t\t} else {\n\t\t\t\ts7 = bsize;\n\t\t\t\tj7 -= bsize;\n\t\t\t}\n\t\t\tdx8 = sx[8] - ( s7*sx[7] );\n\t\t\tdy8 = sy[8] - ( s7*sy[7] );\n\t\t\tdz8 = sz[8] - ( s7*sz[7] );\n\t\t\tox7 = ox8 + ( j7*sx[7] );\n\t\t\toy7 = oy8 + ( j7*sy[7] );\n\t\t\toz7 = oz8 + ( j7*sz[7] );\n\t\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\t\tif ( j6 < bsize ) {\n\t\t\t\t\ts6 = j6;\n\t\t\t\t\tj6 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts6 = bsize;\n\t\t\t\t\tj6 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx7 = sx[7] - ( s6*sx[6] );\n\t\t\t\tdy7 = sy[7] - ( s6*sy[6] );\n\t\t\t\tdz7 = sz[7] - ( s6*sz[6] );\n\t\t\t\tox6 = ox7 + ( j6*sx[6] );\n\t\t\t\toy6 = oy7 + ( j6*sy[6] );\n\t\t\t\toz6 = oz7 + ( j6*sz[6] );\n\t\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\t\ts5 = j5;\n\t\t\t\t\t\tj5 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts5 = bsize;\n\t\t\t\t\t\tj5 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\t\t\tfor ( i8 = 0; i8 < s8; i8++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx7;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy7;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz7;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx8;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy8;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz8;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function, max-lines */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in ten-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary10d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary10d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dx9;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dy9;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar dz9;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\n\tvar ox9;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oy7;\n\tvar oy8;\n\tvar oy9;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar oz7;\n\tvar oz8;\n\tvar oz9;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar s8;\n\tvar s9;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar i9;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar j8;\n\tvar j9;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j9 = sh[9]; j9 > 0; ) {\n\t\tif ( j9 < bsize ) {\n\t\t\ts9 = j9;\n\t\t\tj9 = 0;\n\t\t} else {\n\t\t\ts9 = bsize;\n\t\t\tj9 -= bsize;\n\t\t}\n\t\tox9 = ox + ( j9*sx[9] );\n\t\toy9 = oy + ( j9*sy[9] );\n\t\toz9 = oz + ( j9*sz[9] );\n\t\tfor ( j8 = sh[8]; j8 > 0; ) {\n\t\t\tif ( j8 < bsize ) {\n\t\t\t\ts8 = j8;\n\t\t\t\tj8 = 0;\n\t\t\t} else {\n\t\t\t\ts8 = bsize;\n\t\t\t\tj8 -= bsize;\n\t\t\t}\n\t\t\tdx9 = sx[9] - ( s8*sx[8] );\n\t\t\tdy9 = sy[9] - ( s8*sy[8] );\n\t\t\tdz9 = sz[9] - ( s8*sz[8] );\n\t\t\tox8 = ox9 + ( j8*sx[8] );\n\t\t\toy8 = oy9 + ( j8*sy[8] );\n\t\t\toz8 = oz9 + ( j8*sz[8] );\n\t\t\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\t\t\tif ( j7 < bsize ) {\n\t\t\t\t\ts7 = j7;\n\t\t\t\t\tj7 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts7 = bsize;\n\t\t\t\t\tj7 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx8 = sx[8] - ( s7*sx[7] );\n\t\t\t\tdy8 = sy[8] - ( s7*sy[7] );\n\t\t\t\tdz8 = sz[8] - ( s7*sz[7] );\n\t\t\t\tox7 = ox8 + ( j7*sx[7] );\n\t\t\t\toy7 = oy8 + ( j7*sy[7] );\n\t\t\t\toz7 = oz8 + ( j7*sz[7] );\n\t\t\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\t\t\tif ( j6 < bsize ) {\n\t\t\t\t\t\ts6 = j6;\n\t\t\t\t\t\tj6 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts6 = bsize;\n\t\t\t\t\t\tj6 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx7 = sx[7] - ( s6*sx[6] );\n\t\t\t\t\tdy7 = sy[7] - ( s6*sy[6] );\n\t\t\t\t\tdz7 = sz[7] - ( s6*sz[6] );\n\t\t\t\t\tox6 = ox7 + ( j6*sx[6] );\n\t\t\t\t\toy6 = oy7 + ( j6*sy[6] );\n\t\t\t\t\toz6 = oz7 + ( j6*sz[6] );\n\t\t\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\t\t\ts5 = j5;\n\t\t\t\t\t\t\tj5 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts5 = bsize;\n\t\t\t\t\t\t\tj5 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\t\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\t\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\t\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\t\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\t\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\t\t\t\tfor ( i9 = 0; i9 < s9; i9++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i8 = 0; i8 < s8; i8++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx7;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy7;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz7;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx8;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy8;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz8;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx9;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy9;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz9;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary10d;\n"],"names":["iterationOrder","strides","cnt","i","length","main","Object","defineProperty","isNumber","value","zeros","n","out","zeroPad","str","width","right","negative","pad","startsWithMinus","substr","lowercase","String","prototype","toLowerCase","uppercase","toUpperCase","formatInteger","token","base","specifier","arg","parseInt","isFinite","Error","toString","precision","padRight","sign","alternate","call","charAt","abs","Math","replace","RE_EXP_POS_DIGITS","RE_EXP_NEG_DIGITS","RE_ONLY_DIGITS","RE_DIGITS_BEFORE_EXP","RE_TRAILING_PERIOD_ZERO","RE_PERIOD_ZERO_EXP","RE_ZERO_BEFORE_EXP","formatDouble","f","digits","toExponential","toFixed","toPrecision","spaces","fromCharCode","isArray","Array","isnan","initialize","flags","mapping","formatInterpolate","tokens","hasPeriod","flag","num","pos","j","TypeError","padZeros","indexOf","arguments","maxWidth","parseFloat","substring","RE","parse","match","formatTokenize","content","prev","exec","slice","lastIndex","push","format","args","tokenize","interpolate","apply","objectProtoype","toStr","defineGetter","__defineGetter__","defineSetter","__defineSetter__","lookupGetter","__lookupGetter__","lookupSetter","__lookupSetter__","err","hasDefinePropertySupport","builtin","obj","prop","descriptor","hasValue","hasGet","hasSet","__proto__","get","set","defineProperty$1","setNonEnumerableReadOnly","configurable","enumerable","writable","minmaxViewBufferIndex","shape","offset","ndims","min","max","s","setReadOnly","TYPE","isAccessorArray","GETTERS","complex128","arr","idx","complex64","default","getter","dtype","SETTERS","setter","float64","float32","int32","int16","int8","uint32","uint16","uint8","uint8c","generic","numel","copy","x","len","isString","FLG","Symbol","hasToStringTagSupport","toStringTag","has","hasOwnProperty","hasOwnProp","property","Sym","toStrTag","nativeClass","hasToStringTag","v","isOwn","tag","valueOf","test","isPrimitive","isObject","isColumnMajorString","shape2strides","order","isColumnMajor","columnmajor","rowmajor","ROW_MAJOR","ord","sh","st","copyIndexed","main$c","Number","o","strides2offset","strides2order","column","row","s1","s2","COLUMN_MAJOR","ndarraylike2object","xbuf","bool","dt","data","getData","getShape","getDType","ref","getStrides","getOffset","getOrder","accessorProtocol","accessors","accessorGetter","accessorSetter","main$b","arrayfcn","predicate","isObjectLike","isBuffer","_isBuffer","constructor","reFunctionName","arrayfun","RE_FUNCTION_NAME","constructorName","name","ctor","REGEXP","ctor2dtypes","Float32Array","Float64Array","Int16Array","Int32Array","Int8Array","Uint16Array","Uint32Array","Uint8Array","Uint8ClampedArray","Complex64Array","Complex128Array","BooleanArray","hasFloat64Array","GlobalFloat64Array","NaN","hasFloat64ArraySupport","Float64Array$1","hasFloat32Array","FLOAT64_PINF","POSITIVE_INFINITY","GlobalFloat32Array","PINF","hasFloat32ArraySupport","Float32Array$1","hasUint32Array","UINT32_MAX","GlobalUint32Array","hasUint32ArraySupport","Uint32Array$1","hasInt32Array","GlobalInt32Array","INT32_MAX","hasInt32ArraySupport","Int32Array$1","hasUint16Array","GlobalUint16Array","UINT16_MAX","hasUint16ArraySupport","Uint16Array$1","hasInt16Array","GlobalInt16Array","INT16_MAX","hasInt16ArraySupport","Int16Array$1","hasUint8Array","GlobalUint8Array","UINT8_MAX","hasUint8ArraySupport","Uint8Array$1","hasUint8ClampedArray","GlobalUint8ClampedArray","hasUint8ClampedArraySupport","Uint8ClampedArray$1","hasInt8Array","GlobalInt8Array","INT8_MAX","hasInt8ArraySupport","Int8Array$1","FLOAT64_NINF","NEGATIVE_INFINITY","floor","isInteger","NINF","isInt","isNonNegativeInteger","MAX_ARRAY_LENGTH","isArrayLikeObject","MAX_LENGTH","MAX_TYPED_ARRAY_LENGTH","isCollection","hasArrayBuffer","ArrayBuffer","isArrayBuffer","isPrimitiveArray","isObjectArray","isStringArray","isBoolean","Bool","Boolean","self","window","globalThis","root","codegen","Function","GlobalThis","Self","Win","getGlobal","nodeList","document","childNodes","typedarray","ctorName","type","isFunction","typeOf","Complex128","real","imag","this","setEnumerableReadOnly","re","im","fround","FLOAT32_VIEW","float64ToFloat32$1","Complex64","float64ToFloat32","isComplexLike","isEven","BYTES_PER_ELEMENT","isComplex64Array","isComplex128Array","hasIteratorSymbolSupport","iterator","IteratorSymbol","setNonEnumerableReadOnlyAccessor","z","reinterpret","buffer","byteOffset","fromIterator","it","next","done","realf","imagf","HAS_ITERATOR_SYMBOL","isComplexArray","_length","_buffer","isComplexArrayConstructor","getComplex64","buf","nargs","fromArray","RangeError","reinterpret64","reinterpret128","byteLength","ITERATOR_SYMBOL","src","thisArg","clbk","tmp","flg","fromIteratorMap","target","start","copyWithin","iter","entries","end","fcn","searchElement","fromIndex","separator","sep","join","keys","outbuf","reducer","initialValue","acc","N","sbuf","outlen","compareFcn","sort","begin","locales","options","opts","loc","toLocaleString","values","index","getComplex128","isBooleanArray","isBooleanArrayConstructor","val","a","b","CTORS","DTYPES","NTYPES","ctor2dtype","hasProp","anyIsEntryIn","indexed","fmtprodmsg","u","encodeURIComponent","zeroTo","complex","stride","take","indices","binaryLoopOrder","sx","sy","sz","M","y","avx","ix","iy","jx","jy","vx","vy","ux","sort2ins","loopOrder","isPositiveInteger","isArguments","bool$6","detect","hasArgumentsClass","isNan","isEnumerableProperty","propertyIsEnumerable","hasStringEnumBug","isEnum","isArguments$1","isConstructorPrototype","w","hasAutomationEqualityBug","k","win","EXCLUDED_KEYS","check","HAS_BUILTIN","skipConstructor","skipPrototype","isFcn","p","HAS_ENUM_PROTO_BUG","HAS_NON_ENUM_PROPS_BUG","HAS_WINDOW","error","NON_ENUMERABLE","getProto","Obj","getPrototypeOf","proto","getProto$1","objectPrototype","isPlainObject","isPrototypeOf","key","ownProps","hash","allowDupes","duplicates","objectKeys","objectInverse","int64","uint64","float16","complex32","binary","notype","userdefined_type","bytesPerElement","enum2str","defaults","BLOCK_SIZE_IN_BYTES","BLOCK_SIZE_IN_ELEMENTS","binaryBlockSize","dtypeX","dtypeY","dtypeZ","dtypes","nb","blockSize","vind2bind","mode","ind","MODE","BINARY","ybuf","zbuf","dx0","dy0","dz0","S0","iz","i0","isRowMajor","dx1","dy1","dz1","S1","i1","dx2","dy2","dz2","S2","i2","dx3","dy3","dz3","S3","i3","dx4","dy4","dz4","S4","i4","dx5","dy5","dz5","S5","i5","dx6","dy6","dz6","S6","i6","dx7","dy7","dz7","S7","i7","dx8","dy8","dz8","S8","i8","dx9","dy9","dz9","S9","i9","ACCESSOR_BINARY","xget","yget","zset","BLOCKED_BINARY","bsize","ox1","oy1","oz1","s0","ox","oy","oz","j0","j1","ox2","oy2","oz2","j2","ox3","oy3","oz3","s3","j3","ox4","oy4","oz4","s4","j4","ox5","oy5","oz5","s5","j5","ox6","oy6","oz6","s6","j6","ox7","oy7","oz7","s7","j7","ox8","oy8","oz8","s8","j8","ox9","oy9","oz9","s9","j9","BLOCKED_ACCESSOR_BINARY","MAX_DIMS","hasAccessors","arrays","xmmv","ymmv","zmmv","shx","shy","shz","iox","ioy","ioz","ns","d","ndarray2object","ordx","ordy","ordz","accessorbinarynd","binarynd"],"mappings":";yCA8CA,SAASA,EAAgBC,GACxB,IAAIC,EACAC,EAGJ,IADAD,EAAM,EACAC,EAAI,EAAGA,EAAIF,EAAQG,OAAQD,IAC3BF,EAASE,GAAM,IACnBD,GAAO,GAGT,OAAa,IAARA,EAEG,EAEHA,IAAQD,EAAQG,QAEb,EAGD,CACR,CC5CA,IAAIC,EAA0C,mBAA1BC,OAAOC,eAAkCD,OAAOC,eAAiB,KCiCjFA,EAAiBD,OAAOC,eCjB5B,SAASC,EAAUC,GAClB,MAA0B,iBAAVA,CACjB,CCAA,SAASC,EAAOC,GACf,IACIR,EADAS,EAAM,GAEV,IAAMT,EAAI,EAAGA,EAAIQ,EAAGR,IACnBS,GAAO,IAER,OAAOA,CACR,CAcA,SAASC,EAASC,EAAKC,EAAOC,GAC7B,IAAIC,GAAW,EACXC,EAAMH,EAAQD,EAAIV,OACtB,OAAKc,EAAM,IAnCZ,SAA0BJ,GACzB,MAAoB,MAAbA,EAAK,EACb,CAoCMK,CAAiBL,KACrBG,GAAW,EACXH,EAAMA,EAAIM,OAAQ,IAEnBN,EAAM,EACLA,EAAMJ,EAAOQ,GACbR,EAAOQ,GAAQJ,EACXG,IACJH,EAAM,IAAMA,IAVLA,CAaT,CCpDA,IAAIO,EAAYC,OAAOC,UAAUC,YAC7BC,EAAYH,OAAOC,UAAUG,YAajC,SAASC,EAAeC,GACvB,IAAIC,EACAjB,EACAT,EAEJ,OAASyB,EAAME,WACf,IAAK,IAEJD,EAAO,EACP,MACD,IAAK,IAEJA,EAAO,EACP,MACD,IAAK,IACL,IAAK,IAEJA,EAAO,GACP,MAID,QAECA,EAAO,GAKR,GAFAjB,EAAMgB,EAAMG,IACZ5B,EAAI6B,SAAUpB,EAAK,KACbqB,SAAU9B,GAAM,CACrB,IAAMK,EAAUI,GACf,MAAM,IAAIsB,MAAO,2BAA6BtB,GAE/CT,EAAI,CACJ,CAkCD,OAjCKA,EAAI,IAA2B,MAApByB,EAAME,WAA8B,KAATD,KAC1C1B,EAAI,WAAaA,EAAI,GAEjBA,EAAI,GACRS,IAAST,GAAIgC,SAAUN,GAClBD,EAAMQ,YACVxB,EAAMC,EAASD,EAAKgB,EAAMQ,UAAWR,EAAMS,WAE5CzB,EAAM,IAAMA,IAEZA,EAAMT,EAAEgC,SAAUN,GACZ1B,GAAMyB,EAAMQ,UAENR,EAAMQ,YACjBxB,EAAMC,EAASD,EAAKgB,EAAMQ,UAAWR,EAAMS,WAF3CzB,EAAM,GAIFgB,EAAMU,OACV1B,EAAMgB,EAAMU,KAAO1B,IAGP,KAATiB,IACCD,EAAMW,YACV3B,EAAM,KAAOA,GAEdA,EAAQgB,EAAME,YAAcL,EAAUe,KAAMZ,EAAME,WACjDL,EAAUe,KAAM5B,GAChBS,EAAUmB,KAAM5B,IAEJ,IAATiB,GACCD,EAAMW,WAAiC,MAApB3B,EAAI6B,OAAQ,KACnC7B,EAAM,IAAMA,GAGPA,CACR,CCtFA,IAAI8B,EAAMC,KAAKD,IACXrB,EAAYC,OAAOC,UAAUC,YAC7BC,EAAYH,OAAOC,UAAUG,YAC7BkB,EAAUtB,OAAOC,UAAUqB,QAK3BC,EAAoB,WACpBC,EAAoB,UACpBC,EAAiB,UACjBC,EAAuB,UACvBC,EAA0B,OAC1BC,EAAqB,QACrBC,EAAqB,gBAczB,SAASC,EAAcC,EAAGzB,GACzB,IAAI0B,EACA1C,EAEJ,OAASgB,EAAME,WACf,IAAK,IACL,IAAK,IACJlB,EAAMyC,EAAEE,cAAe3B,EAAMQ,WAC7B,MACD,IAAK,IACL,IAAK,IACJxB,EAAMyC,EAAEG,QAAS5B,EAAMQ,WACvB,MACD,IAAK,IACL,IAAK,IACCM,EAAKW,GAAM,OACfC,EAAS1B,EAAMQ,WACD,IACbkB,GAAU,GAEX1C,EAAMyC,EAAEE,cAAeD,IAEvB1C,EAAMyC,EAAEI,YAAa7B,EAAMQ,WAEtBR,EAAMW,YACX3B,EAAMgC,EAAQJ,KAAM5B,EAAKuC,EAAoB,OAC7CvC,EAAMgC,EAAQJ,KAAM5B,EAAKsC,EAAoB,KAC7CtC,EAAMgC,EAAQJ,KAAM5B,EAAKqC,EAAyB,KAEnD,MACD,QACC,MAAM,IAAIf,MAAO,mCAAqCN,EAAME,WAc7D,OAZAlB,EAAMgC,EAAQJ,KAAM5B,EAAKiC,EAAmB,SAC5CjC,EAAMgC,EAAQJ,KAAM5B,EAAKkC,EAAmB,SACvClB,EAAMW,YACV3B,EAAMgC,EAAQJ,KAAM5B,EAAKmC,EAAgB,OACzCnC,EAAMgC,EAAQJ,KAAM5B,EAAKoC,EAAsB,SAE3CK,GAAK,GAAKzB,EAAMU,OACpB1B,EAAMgB,EAAMU,KAAO1B,GAEpBA,EAAQgB,EAAME,YAAcL,EAAUe,KAAMZ,EAAME,WACjDL,EAAUe,KAAM5B,GAChBS,EAAUmB,KAAM5B,EAElB,CCpEA,SAAS8C,EAAQ/C,GAChB,IACIR,EADAS,EAAM,GAEV,IAAMT,EAAI,EAAGA,EAAIQ,EAAGR,IACnBS,GAAO,IAER,OAAOA,CACR,CCJA,IAAI+C,EAAerC,OAAOqC,aACtBC,EAAUC,MAAMD,QAoBpB,SAASE,EAAOrD,GACf,OAASA,GAAUA,CACpB,CASA,SAASsD,EAAYnC,GACpB,IAAIhB,EAAM,CAAA,EAMV,OALAA,EAAIkB,UAAYF,EAAME,UACtBlB,EAAIwB,eAAkC,IAApBR,EAAMQ,UAAyB,EAAIR,EAAMQ,UAC3DxB,EAAIG,MAAQa,EAAMb,MAClBH,EAAIoD,MAAQpC,EAAMoC,OAAS,GAC3BpD,EAAIqD,QAAUrC,EAAMqC,QACbrD,CACR,CAmBA,SAASsD,EAAmBC,GAC3B,IAAIC,EACAJ,EACApC,EACAyC,EACAC,EACA1D,EACA2D,EACAlB,EACAlD,EACAqE,EDnDc1D,EAAKC,EAAOC,EAC1BE,ECoDJ,IAAM0C,EAASO,GACd,MAAM,IAAIM,UAAW,8DAAgEN,EAAS,MAI/F,IAFAvD,EAAM,GACN2D,EAAM,EACApE,EAAI,EAAGA,EAAIgE,EAAO/D,OAAQD,IAE/B,GC3EyB,iBD0EzByB,EAAQuC,EAAQhE,IAEfS,GAAOgB,MACD,CAGN,GAFAwC,OAAgC,IAApBxC,EAAMQ,YAClBR,EAAQmC,EAAYnC,IACRE,UACX,MAAM,IAAI2C,UAAW,oEAAqEtE,EAAG,cAAgByB,EAAQ,MAMtH,IAJKA,EAAMqC,UACVM,EAAM3C,EAAMqC,SAEbD,EAAQpC,EAAMoC,MACRQ,EAAI,EAAGA,EAAIR,EAAM5D,OAAQoE,IAE9B,OADAH,EAAOL,EAAMvB,OAAQ+B,IAErB,IAAK,IACJ5C,EAAMU,KAAO,IACb,MACD,IAAK,IACJV,EAAMU,KAAO,IACb,MACD,IAAK,IACJV,EAAMS,UAAW,EACjBT,EAAM8C,UAAW,EACjB,MACD,IAAK,IACJ9C,EAAM8C,SAAWV,EAAMW,QAAS,KAAQ,EACxC,MACD,IAAK,IACJ/C,EAAMW,WAAY,EAClB,MACD,QACC,MAAM,IAAIL,MAAO,iBAAmBmC,GAGtC,GAAqB,MAAhBzC,EAAMb,MAAgB,CAG1B,GAFAa,EAAMb,MAAQiB,SAAU4C,UAAWL,GAAO,IAC1CA,GAAO,EACFT,EAAOlC,EAAMb,OACjB,MAAM,IAAI0D,UAAW,wCAA0CF,EAAM,6BAA+B3C,EAAMb,MAAQ,MAE9Ga,EAAMb,MAAQ,IAClBa,EAAMS,UAAW,EACjBT,EAAMb,OAASa,EAAMb,MAEtB,CACD,GAAKqD,GACqB,MAApBxC,EAAMQ,UAAoB,CAG9B,GAFAR,EAAMQ,UAAYJ,SAAU4C,UAAWL,GAAO,IAC9CA,GAAO,EACFT,EAAOlC,EAAMQ,WACjB,MAAM,IAAIqC,UAAW,4CAA8CF,EAAM,6BAA+B3C,EAAMQ,UAAY,MAEtHR,EAAMQ,UAAY,IACtBR,EAAMQ,UAAY,EAClBgC,GAAY,EAEb,CAGF,OADAxC,EAAMG,IAAM6C,UAAWL,GACd3C,EAAME,WACf,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IAECsC,IACJxC,EAAM8C,UAAW,GAElB9C,EAAMG,IAAMJ,EAAeC,GAC3B,MACD,IAAK,IAEJA,EAAMiD,SAAW,EAAgBjD,EAAMQ,WAAa,EACpDR,EAAMG,IAAMT,OAAQM,EAAMG,KAC1B,MACD,IAAK,IAEJ,IAAM+B,EAAOlC,EAAMG,KAAQ,CAE1B,IADAuC,EAAMtC,SAAUJ,EAAMG,IAAK,KAChB,GAAKuC,EAAM,IACrB,MAAM,IAAIpC,MAAO,kCAAoCN,EAAMG,KAE5DH,EAAMG,IAAQ+B,EAAOQ,GAAUhD,OAAQM,EAAMG,KAAQ4B,EAAcW,EACnE,CACD,MACD,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IAMJ,GAJMF,IACLxC,EAAMQ,UAAY,GAEnBiB,EAAIyB,WAAYlD,EAAMG,MAChBE,SAAUoB,GAAM,CACrB,IAAM7C,EAAUoB,EAAMG,KACrB,MAAM,IAAIG,MAAO,yCAA2CtB,GAG7DyC,EAAIzB,EAAMG,IACVH,EAAM8C,UAAW,CACjB,CACD9C,EAAMG,IAAMqB,EAAcC,EAAGzB,GAC7B,MACD,QACC,MAAM,IAAIM,MAAO,sBAAwBN,EAAME,WAG3CF,EAAMiD,UAAY,GAAKjD,EAAMG,IAAI3B,OAASwB,EAAMiD,WACpDjD,EAAMG,IAAMH,EAAMG,IAAIgD,UAAW,EAAGnD,EAAMiD,WAEtCjD,EAAM8C,SACV9C,EAAMG,IAAMlB,EAASe,EAAMG,IAAKH,EAAMb,OAASa,EAAMQ,UAAWR,EAAMS,UAC3DT,EAAMb,QACjBa,EAAMG,KDpLSjB,ECoLOc,EAAMG,IDpLRhB,ECoLaa,EAAMb,MDpLZC,ECoLmBY,EAAMS,SDnLnDnB,YAAMH,EAAQD,EAAIV,QACX,EACHU,EAERA,EAAM,EACLA,EAAM4C,EAAQxC,GACdwC,EAAQxC,GAAQJ,IC+KfF,GAAOgB,EAAMG,KAAO,GACpBwC,GAAO,CACP,CAEF,OAAO3D,CACR,CEvNA,IAAIoE,EAAK,6EAYT,SAASC,EAAOC,GACf,IAAItD,EAAQ,CACXqC,QAAaiB,EAAO,GAAQlD,SAAUkD,EAAO,GAAK,SAAO,EACzDlB,MAASkB,EAAO,GAChBnE,MAASmE,EAAO,GAChB9C,UAAa8C,EAAO,GACpBpD,UAAaoD,EAAO,IAKrB,MAHoB,MAAfA,EAAO,SAA8B,IAAfA,EAAO,KACjCtD,EAAMQ,UAAY,KAEZR,CACR,CAeA,SAASuD,EAAgBrE,GACxB,IAAIsE,EACAjB,EACAe,EACAG,EAKJ,IAHAlB,EAAS,GACTkB,EAAO,EACPH,EAAQF,EAAGM,KAAMxE,GACToE,IACPE,EAAUtE,EAAIyE,MAAOF,EAAML,EAAGQ,UAAYN,EAAO,GAAI9E,SACxCA,QACZ+D,EAAOsB,KAAML,GAGM,MAAfF,EAAO,GACXf,EAAOsB,KAAM,KAEbtB,EAAOsB,KAAMR,EAAOC,IAErBG,EAAOL,EAAGQ,UACVN,EAAQF,EAAGM,KAAMxE,GAMlB,OAJAsE,EAAUtE,EAAIyE,MAAOF,IACRjF,QACZ+D,EAAOsB,KAAML,GAEPjB,CACR,CC3CA,SAASuB,EAAQ5E,GAChB,IAAI6E,EACAxF,EAEJ,GCf0B,iBDeVW,EACf,MAAM,IAAI2D,UAAWiB,EAAQ,kEAAmE5E,IAGjG,IADA6E,EAAO,CAAEC,EAAU9E,IACbX,EAAI,EAAGA,EAAIyE,UAAUxE,OAAQD,IAClCwF,EAAKF,KAAMb,UAAWzE,IAEvB,OAAO0F,EAAYC,MAAO,KAAMH,EACjC,CE7BA,ICkBIpF,EDlBAwF,EAAiBzF,OAAOiB,UACxByE,EAAQD,EAAe5D,SACvB8D,EAAeF,EAAeG,iBAC9BC,EAAeJ,EAAeK,iBAC9BC,EAAeN,EAAeO,iBAC9BC,EAAeR,EAAeS,iBCiBjCjG,ECdD,WAEC,IAEC,OADAA,EAAgB,CAAE,EAAE,IAAK,CAAA,IAClB,CACP,CAAC,MAAQkG,GACT,OAAO,CACP,CACF,CDGKC,GACaC,EDqBlB,SAAyBC,EAAKC,EAAMC,GACnC,IAAIvF,EACAwF,EACAC,EACAC,EAEJ,GAAoB,iBAARL,GAA4B,OAARA,GAAsC,mBAAtBZ,EAAMxD,KAAMoE,GAC3D,MAAM,IAAInC,UAAWiB,EAAQ,mEAAoEkB,IAElG,GAA2B,iBAAfE,GAA0C,OAAfA,GAAoD,mBAA7Bd,EAAMxD,KAAMsE,GACzE,MAAM,IAAIrC,UAAWiB,EAAQ,wEAAyEoB,IAyBvG,IAvBAC,EAAa,UAAWD,KAGtBT,EAAa7D,KAAMoE,EAAKC,IACxBN,EAAa/D,KAAMoE,EAAKC,IAGxBtF,EAAYqF,EAAIM,UAChBN,EAAIM,UAAYnB,SAGTa,EAAKC,GACZD,EAAKC,GAASC,EAAWrG,MAGzBmG,EAAIM,UAAY3F,GAEhBqF,EAAKC,GAASC,EAAWrG,OAG3BuG,EAAW,QAASF,EACpBG,EAAW,QAASH,EAEfC,IAAcC,GAAUC,GAC5B,MAAM,IAAI/E,MAAO,wHASlB,OANK8E,GAAUf,GACdA,EAAazD,KAAMoE,EAAKC,EAAMC,EAAWK,KAErCF,GAAUd,GACdA,EAAa3D,KAAMoE,EAAKC,EAAMC,EAAWM,KAEnCR,CACR,EC3DA,IAAAS,EAAe9G,EEZf,SAAS+G,EAA0BV,EAAKC,EAAMpG,GAC7CF,EAAgBqG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdC,UAAY,EACZhH,MAASA,GAEX,CCUA,SAASiH,EAAuBC,EAAO1H,EAAS2H,GAC/C,IAAIC,EACAC,EACAC,EACAC,EACA7H,EAKJ,IAHA0H,EAAQF,EAAMvH,OACd0H,EAAMF,EACNG,EAAMH,EACAzH,EAAI,EAAGA,EAAI0H,EAAO1H,IAAM,CAC7B,GAAoB,IAAfwH,EAAOxH,GACX,MAAO,CAAEyH,EAAQA,IAElBI,EAAI/H,EAASE,IACJ,EACR4H,GAAOC,GAAML,EAAMxH,GAAG,GACX6H,EAAI,IACfF,GAAOE,GAAML,EAAMxH,GAAG,GAEvB,CACD,MAAO,CAAE2H,EAAKC,EACf,CCTAE,EAAA5H,EAAA,UCIA,SAAgCsH,EAAO1H,EAAS2H,EAAQhH,GACvD,IAAIiH,EACAC,EACAC,EACAC,EACA7H,EAKJ,IAHA0H,EAAQF,EAAMvH,OACd0H,EAAMF,EACNG,EAAMH,EACAzH,EAAI,EAAGA,EAAI0H,EAAO1H,IAAM,CAC7B,GAAoB,IAAfwH,EAAOxH,GAGX,OAFAS,EAAK,GAAMgH,EACXhH,EAAK,GAAMgH,EACJhH,GAERoH,EAAI/H,EAASE,IACJ,EACR4H,GAAOC,GAAML,EAAMxH,GAAG,GACX6H,EAAI,IACfF,GAAOE,GAAML,EAAMxH,GAAG,GAEvB,CAGD,OAFAS,EAAK,GAAMkH,EACXlH,EAAK,GAAMmH,EACJnH,CACR,ICnFA,IAAIsH,EAAO,WAqBX,SAASC,EAAiB1H,GACzB,cAAgBA,EAAM0G,MAAQe,UAAezH,EAAM2G,MAAQc,CAC5D,CCvBA,IAAIE,EAAU,CACbC,WAwBD,SAAwBC,EAAKC,GAC5B,OAAOD,EAAInB,IAAKoB,EACjB,EAzBCC,UA2CD,SAAuBF,EAAKC,GAC3B,OAAOD,EAAInB,IAAKoB,EACjB,EA5CCE,QAuED,SAAuBH,EAAKC,GAC3B,OAAOD,EAAInB,IAAKoB,EACjB,GAqBA,SAASG,EAAQC,GAChB,IAAItF,EAAI+E,EAASO,GACjB,MAAkB,mBAANtF,EACJA,EAED+E,EAAQK,OAChB,CCvGA,IAAIG,EAAU,CACbP,WA0BD,SAAwBC,EAAKC,EAAK9H,GACjC6H,EAAIlB,IAAK3G,EAAO8H,EACjB,EA3BCC,UA+CD,SAAuBF,EAAKC,EAAK9H,GAChC6H,EAAIlB,IAAK3G,EAAO8H,EACjB,EAhDCE,QA6ED,SAAuBH,EAAKC,EAAK9H,GAChC6H,EAAIlB,IAAK3G,EAAO8H,EACjB,GAwBA,SAASM,EAAQF,GAChB,IAAItF,EAAIuF,EAASD,GACjB,MAAkB,mBAANtF,EACJA,EAEDuF,EAAQH,OAChB,CChHA,IAAIL,EAAU,CACbU,QAgCD,SAAqBR,EAAKC,GACzB,OAAOD,EAAKC,EACb,EAjCCQ,QAmDD,SAAqBT,EAAKC,GACzB,OAAOD,EAAKC,EACb,EApDCS,MAsED,SAAmBV,EAAKC,GACvB,OAAOD,EAAKC,EACb,EAvECU,MAyFD,SAAmBX,EAAKC,GACvB,OAAOD,EAAKC,EACb,EA1FCW,KA4GD,SAAkBZ,EAAKC,GACtB,OAAOD,EAAKC,EACb,EA7GCY,OA+HD,SAAoBb,EAAKC,GACxB,OAAOD,EAAKC,EACb,EAhICa,OAkJD,SAAoBd,EAAKC,GACxB,OAAOD,EAAKC,EACb,EAnJCc,MAqKD,SAAmBf,EAAKC,GACvB,OAAOD,EAAKC,EACb,EAtKCe,OAwLD,SAAoBhB,EAAKC,GACxB,OAAOD,EAAKC,EACb,EAzLCgB,QAyMD,SAAqBjB,EAAKC,GACzB,OAAOD,EAAKC,EACb,EA1MCE,QA0ND,SAAuBH,EAAKC,GAC3B,OAAOD,EAAKC,EACb,GAoBA,SAASG,EAAQC,GAChB,IAAItF,EAAI+E,EAASO,GACjB,MAAkB,mBAANtF,EACJA,EAED+E,EAAQK,OAChB,CCjQA,IAAIG,EAAU,CACbE,QAkCD,SAAqBR,EAAKC,EAAK9H,GAC9B6H,EAAKC,GAAQ9H,CACd,EAnCCsI,QAuDD,SAAqBT,EAAKC,EAAK9H,GAC9B6H,EAAKC,GAAQ9H,CACd,EAxDCuI,MA4ED,SAAmBV,EAAKC,EAAK9H,GAC5B6H,EAAKC,GAAQ9H,CACd,EA7ECwI,MAiGD,SAAmBX,EAAKC,EAAK9H,GAC5B6H,EAAKC,GAAQ9H,CACd,EAlGCyI,KAsHD,SAAkBZ,EAAKC,EAAK9H,GAC3B6H,EAAKC,GAAQ9H,CACd,EAvHC0I,OA2ID,SAAoBb,EAAKC,EAAK9H,GAC7B6H,EAAKC,GAAQ9H,CACd,EA5IC2I,OAgKD,SAAoBd,EAAKC,EAAK9H,GAC7B6H,EAAKC,GAAQ9H,CACd,EAjKC4I,MAqLD,SAAmBf,EAAKC,EAAK9H,GAC5B6H,EAAKC,GAAQ9H,CACd,EAtLC6I,OA0MD,SAAoBhB,EAAKC,EAAK9H,GAC7B6H,EAAKC,GAAQ9H,CACd,EA3MC8I,QA6ND,SAAqBjB,EAAKC,EAAK9H,GAC9B6H,EAAKC,GAAQ9H,CACd,EA9NCgI,QAgPD,SAAuBH,EAAKC,EAAK9H,GAChC6H,EAAKC,GAAQ9H,CACd,GAsBA,SAASoI,EAAQF,GAChB,IAAItF,EAAIuF,EAASD,GACjB,MAAkB,mBAANtF,EACJA,EAEDuF,EAAQH,OAChB,CC/QA,SAASe,EAAO7B,GACf,IAAIE,EACAlH,EACAR,EAGJ,GAAe,KADf0H,EAAQF,EAAMvH,QAEb,OAAO,EAGR,IADAO,EAAI,EACER,EAAI,EAAGA,EAAI0H,EAAO1H,IACvBQ,GAAKgH,EAAOxH,GAEb,OAAOQ,CACR,CCdA,SAAS8I,EAAMC,GACd,IAAI9I,EACA+I,EACAxJ,EAIJ,IAFAwJ,EAAMD,EAAEtJ,OACRQ,EAAM,GACAT,EAAI,EAAGA,EAAIwJ,EAAKxJ,IACrBS,EAAI6E,KAAMiE,EAAGvJ,IAEd,OAAOS,CACR,CCTA,SAASgJ,EAAUnJ,GAClB,MAA0B,iBAAVA,CACjB,CCTA,IAAIoJ,GCMgB,mBAAXC,QACoB,iBAApBA,OAAQ,ODOjB,SAASC,KACR,OAASF,IAAqC,iBAAvBC,OAAOE,WAC/B,CErBA,IAAIhE,GAAQ1F,OAAOiB,UAAUY,SCAzB8H,GAAM3J,OAAOiB,UAAU2I,eA4B3B,SAASC,GAAY1J,EAAO2J,GAC3B,OACC3J,SAKMwJ,GAAIzH,KAAM/B,EAAO2J,EACzB,CCpCA,IAAIC,GAA0B,mBAAXP,OAA0BA,YAAS,ECKlDQ,GAA+B,mBAAXR,GAA0BA,GAAOE,YAAc,GCiCvEO,GATKC,KCDL,SAAsBC,GACrB,IAAIC,EACAC,EACA/J,EAEJ,GAAK6J,QACJ,OAAOzE,GAAMxD,KAAMiI,GAEpBE,EAAMF,EAAGT,IACTU,EAAQP,GAAYM,EAAGT,IAGvB,IACCS,EAAGT,SAAgB,CACnB,CAAC,MAAQvD,GACT,OAAOT,GAAMxD,KAAMiI,EACnB,CAQD,OAPA7J,EAAMoF,GAAMxD,KAAMiI,GAEbC,EACJD,EAAGT,IAAgBW,SAEZF,EAAGT,IAEJpJ,CACR,EC3BA,SAAsB6J,GACrB,OAAOzE,GAAMxD,KAAMiI,EACpB,EC7BIG,GAAUtJ,OAAOC,UAAUqJ,QCQ3Bf,GAAMW,KAmBV,SAASZ,GAAUnJ,GAClB,MAAsB,iBAAVA,IACNA,aAAiBa,SAGjBuI,GCnBP,SAAepJ,GACd,IAEC,OADAmK,GAAQpI,KAAM/B,IACP,CACP,CAAC,MAAQgG,GACT,OAAO,CACP,CACF,CDaUoE,CAAMpK,GAEoB,oBAAzB8J,GAAa9J,IAGxB,CEjBA,SAASmJ,GAAUnJ,GAClB,OAASqK,EAAarK,IAAWsK,GAAUtK,EAC5C,CCNA,SAASuK,GAAqBP,GAC7B,MAAe,iBAANA,CACV,CCmDA,SAASQ,GAAetD,EAAOuD,GAC9B,OAAKC,GAAeD,GAhCrB,SAAsBvD,GACrB,IAAI/G,EACAoH,EACA7H,EAIJ,IAFAS,EAAM,GACNoH,EAAI,EACE7H,EAAI,EAAGA,EAAIwH,EAAMvH,OAAQD,IAC9BS,EAAI6E,KAAMuC,GACVA,GAAKL,EAAOxH,GAEb,OAAOS,CACR,CAqBSwK,CAAazD,GA3DtB,SAAmBA,GAClB,IAAIE,EACAjH,EACAoH,EACA7H,EAIJ,IAFA0H,EAAQF,EAAMvH,OACdQ,EAAM,GACAT,EAAI,EAAGA,EAAI0H,EAAO1H,IACvBS,EAAI6E,KAAM,GAGX,IADAuC,EAAI,EACE7H,EAAI0H,EAAM,EAAG1H,GAAK,EAAGA,IAC1BS,EAAKT,GAAM6H,EACXA,GAAKL,EAAOxH,GAEb,OAAOS,CACR,CA4CQyK,CAAU1D,EAClB,CC9BAM,EAAA5H,GAAA,cAAAyK,GACA7C,EAAA5H,GAAA,WAAA0K,ICvBA9C,EAAA5H,GAAA,UCgDA,SAAwBsH,EAAOuD,EAAOtK,GACrC,OAAKuK,GAAeD,GApCrB,SAAsBvD,EAAO/G,GAC5B,IAAIoH,EACA7H,EAGJ,IADA6H,EAAI,EACE7H,EAAI,EAAGA,EAAIwH,EAAMvH,OAAQD,IAC9BS,EAAKT,GAAM6H,EACXA,GAAKL,EAAOxH,GAEb,OAAOS,CACR,CA2BSwK,CAAazD,EAAO/G,GA3D7B,SAAmB+G,EAAO/G,GACzB,IACIoH,EACA7H,EAIJ,IADA6H,EAAI,EACE7H,EAFEwH,EAAMvH,OAEE,EAAGD,GAAK,EAAGA,IAC1BS,EAAKT,GAAM6H,EACXA,GAAKL,EAAOxH,GAEb,OAAOS,CACR,CAiDQyK,CAAU1D,EAAO/G,EACzB,ICpEA,IAAI0K,GAAY,YAkBhB,SAASrL,GAASyJ,EAAGD,GACpB,IAAI8B,EACAC,EACAC,EAGJ,MAAmB,iBADnBA,EAAK/B,EAAEzJ,UAC+B,OAAPwL,EAEX,KADnBD,EAAK9B,EAAE/B,OACCvH,OACA,CAAE,IAGJwJ,EADN2B,EAAM7B,EAAEwB,SAEPK,EAAMD,IAEAL,GAAeO,EAAID,IAEtB9B,EACGiC,EAAaD,GAEdA,CACR,CC9BA,SAASjL,GAAUC,GAClB,MAA0B,iBAAVA,CACjB,CClBA,IAAAkL,GAAeC,OCMXzJ,GAAWyJ,GAAOrK,UAAUY,SCE5B0H,GAAMW,KAmBV,SAAShK,GAAUC,GAClB,MAAsB,iBAAVA,IACNA,aAAiBmL,KAGjB/B,GCpBP,SAAepJ,GACd,IAEC,OADA0B,GAASK,KAAM/B,IACR,CACP,CAAC,MAAQgG,GACT,OAAO,CACP,CACF,CDcUoE,CAAMpK,GAEoB,oBAAzB8J,GAAa9J,IAGxB,CEVA,SAASD,GAAUC,GAClB,OAASqK,GAAarK,IAAWsK,GAAUtK,EAC5C,CCZA,SAASmH,GAAQ8B,GAChB,IAAI+B,EACAD,EACAK,EAGJ,OAAKrL,GADLqL,EAAInC,EAAE9B,QAEEiE,EAGW,KADnBL,EAAK9B,EAAE/B,OACCvH,QAIW,iBADnBqL,EAAK/B,EAAEzJ,UAC+B,OAAPwL,EAHvB,ECfT,SAAyB9D,EAAO1H,GAC/B,IAAI2H,EACAC,EACA1H,EAIJ,IAFA0H,EAAQF,EAAMvH,OACdwH,EAAS,EACHzH,EAAI,EAAGA,EAAI0H,EAAO1H,IAClBF,EAASE,GAAM,IAEnByH,GAAU3H,EAASE,IAAQwH,EAAOxH,GAAI,IAGxC,OAAOyH,CACR,CDOQkE,CAAgBN,EAAIC,EAC5B,CEVA,SAAS/I,GAAKgH,GACb,OAAO/G,KAAKD,IAAKgH,EAClB,CCJA,SAASqC,GAAe9L,GACvB,IAAI+L,EACAnE,EACAoE,EACAC,EACAC,EACAhM,EAGJ,GAAe,KADf0H,EAAQ5H,EAAQG,QAEf,OAAO,EAMR,IAJA4L,GAAS,EACTC,GAAM,EAENC,EAAKxJ,GAAKzC,EAAS,IACbE,EAAI,EAAGA,EAAI0H,EAAO1H,IAAM,CAO7B,GANAgM,EAAKzJ,GAAKzC,EAASE,IACd6L,GAAUG,EAAKD,EACnBF,GAAS,EACEC,GAAOE,EAAKD,IACvBD,GAAM,IAEFA,IAAOD,EAGX,OAAO,EAFPE,EAAKC,CAIN,CACD,OAAKF,GAAOD,EACJ,EAEHC,EACG,EAED,CACR,CCVAhE,EAAA5H,GAAA,cAAAyK,IACA7C,EAAA5H,GAAA,WAAA0K,IC7CA,IAAIO,GAAY,YACZc,GAAe,eAqBnB,SAASlB,GAAOxB,GACf,IAAI+B,EACAI,EAGJ,OAAKjC,EADLiC,EAAInC,EAAEwB,OAEEW,EAIW,iBADnBJ,EAAK/B,EAAEzJ,UAC+B,OAAPwL,GAIpB,KADXI,EAAIE,GAAeN,KACG,IAANI,EAHRP,GAMG,IAANO,EACGO,GAGgB,IAAnB1C,EAAE/B,MAAMvH,OACLkL,GAGD,IACR,CCDA,SAASe,GAAoB3C,GAC5B,IAAI4C,EACAC,EACAf,EACAgB,EAQJ,OANAF,EC3CD,SAAe5C,GACd,OAAOA,EAAE+C,IACV,CDyCQC,CAAShD,GAChB8B,EE1CD,SAAgB9B,EAAGD,GAClB,IAAI+B,EAAK9B,EAAE/B,MACX,OAAK8B,EACGiC,EAAaF,GAEdA,CACR,CFoCMmB,CAAUjD,GAAG,GAClB8C,EG7CD,SAAgB9C,GACf,OAAOA,EAAEf,KACV,CH2CMiE,CAAUlD,GAEf6C,EAAOpE,EAAiBmE,GAEjB,CACNO,IAAOnD,EACPf,MAAS6D,EACTC,KAAQH,EACRlM,OAAUoJ,EAAOgC,GACjB7D,MAAS6D,EACTvL,QAAW6M,GAAYpD,GAAG,GAC1B9B,OAAUmF,GAAWrD,GACrBwB,MAAS8B,GAAUtD,GACnBuD,iBAAoBV,EACpBW,UAAa,EACZ,CAAEC,EAAgBX,GAAMY,EAAgBZ,IACxC,CAAE9D,EAAQ8D,GAAM3D,EAAQ2D,IAE3B,CIvCA,IAAAa,GATKxJ,MAAMD,QACNC,MAAMD,QARX,SAAkBnD,GACjB,MAAkC,mBAAzB8J,GAAa9J,EACvB,ECCA,SAAS6M,GAAUC,GAClB,GAA0B,mBAAdA,EACX,MAAM,IAAI9I,UAAWiB,EAAQ,0DAA2D6H,IAEzF,OASA,SAAgB9M,GACf,IAAIkJ,EACAxJ,EACJ,IAAMyD,GAASnD,GACd,OAAO,EAGR,GAAa,KADbkJ,EAAMlJ,EAAML,QAEX,OAAO,EAER,IAAMD,EAAI,EAAGA,EAAIwJ,EAAKxJ,IACrB,IAAiC,IAA5BoN,EAAW9M,EAAON,IACtB,OAAO,EAGT,OAAO,CACP,CACF,CCzCA,SAASqN,GAAc/M,GACtB,OACW,OAAVA,GACiB,iBAAVA,CAET,CCMA,SAASgN,GAAUhN,GAClB,OACC+M,GAAc/M,KAGbA,EAAMiN,WAELjN,EAAMkN,aAGgC,mBAA/BlN,EAAMkN,YAAYF,UACzBhN,EAAMkN,YAAYF,SAAUhN,GAIhC,CClBA,SAASmN,KACR,MAAO,yBACR,CCaA3F,EAAA5H,GAAA,oBALAwN,GAAAxN,KCFA,IAAIyN,GFPI,0BGQR,SAASC,GAAiBtD,GACzB,IAAIvF,EACA8I,EACAC,EAEJ,IAAe,YADfD,EAAOzD,GAAaE,GAAIlF,MAAO,GAAI,KACC,UAATyI,IAAqBvD,EAAEkD,YAAc,CAE/D,GAA0B,iBAD1BM,EAAOxD,EAAEkD,aACQK,KAChB,OAAOC,EAAKD,KAGb,GADA9I,EAAQF,GAAGM,KAAM2I,EAAK9L,YAErB,OAAO+C,EAAO,EAEf,CACD,OAAKuI,GAAUhD,GACP,SAEDuD,CACR,CCnBA/F,EAAA5H,GAAA,SAAA6N,IChCA,ICkBID,GDlBAE,GAAc,CACjBC,aAAgB,UAChBC,aAAgB,UAChBxK,MAAS,UACTyK,WAAc,QACdC,WAAc,QACdC,UAAa,OACbC,YAAe,SACfC,YAAe,SACfC,WAAc,QACdC,kBAAqB,SACrBC,eAAkB,YAClBC,gBAAmB,aACnBC,aAAgB,QETbC,GAA4C,mBAAjBX,aCL3BhO,GAAiC,mBAAjBgO,aAAgCA,aAAe,KCA/DJ,GAAiC,mBAAjBI,aAAgCA,kBAAe,EHuBlEJ,GIRD,WACC,IAAI1B,EACAjE,EHSoB7H,EGPxB,GAAmC,mBAAvBwO,GACX,OAAO,EAGR,IACC3G,EAAM,IAAI2G,GAAoB,CAAE,EAAK,MAAO,KAAMC,MHE3BzO,EGAN6H,EADjBiE,GHGEyC,IAAmBvO,aAAiB4N,cACb,0BAAzB9D,GAAa9J,KGFC,IAAb6H,EAAK,IACQ,OAAbA,EAAK,KACS,OAAdA,EAAK,IACLA,EAAK,IAAQA,EAAK,EAEnB,CAAC,MAAQ7B,GACT8F,GAAO,CACP,CACD,OAAOA,CACR,CJhBK4C,GACGxI,GKdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,ELoBA,IMVI+L,GNUJmB,GAAenB,GOxBXoB,GAA4C,mBAAjBjB,aCuB3BkB,GAAe1D,OAAO2D,kBC5BtBlP,GAAiC,mBAAjB+N,aAAgCA,aAAe,KCA/DH,GAAiC,mBAAjBG,aAAgCA,kBAAe,EJuBlEH,GKPD,WACC,IAAI1B,EACAjE,EJQoB7H,EINxB,GAAmC,mBAAvB+O,GACX,OAAO,EAGR,IACClH,EAAM,IAAIkH,GAAoB,CAAE,EAAK,MAAO,KAAM,OJC3B/O,EICN6H,EADjBiE,GJEE8C,IAAmB5O,aAAiB2N,cACb,0BAAzB7D,GAAa9J,KIDC,IAAb6H,EAAK,IACQ,oBAAbA,EAAK,KACS,oBAAdA,EAAK,IACLA,EAAK,KAAQmH,EAEd,CAAC,MAAQhJ,GACT8F,GAAO,CACP,CACD,OAAOA,CACR,CLjBKmD,GACG/I,GMdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,ENoBA,IOVI+L,GPUJ0B,GAAe1B,GQxBX2B,GAA0C,mBAAhBlB,YC4B1BmB,GAAa,WCjCbxP,GAAgC,mBAAhBqO,YAA+BA,YAAc,KCA7DT,GAAgC,mBAAhBS,YAA+BA,iBAAc,EJuBhET,GKPD,WACC,IAAI1B,EACAjE,EJQmB7H,EINvB,GAAkC,mBAAtBqP,GACX,OAAO,EAGR,IAECxH,EAAM,IAAIwH,GADVxH,EAAM,CAAE,EAAG,MAAO,KAAMuH,WAAcA,aJChBpP,EIEN6H,EADhBiE,GJCEqD,IAAkBnP,aAAiBiO,aACZ,yBAAzBnE,GAAa9J,KIAC,IAAb6H,EAAK,IACQ,IAAbA,EAAK,IACQuH,aAAbvH,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,EAEN,CAAC,MAAQ7B,GACT8F,GAAO,CACP,CACD,OAAOA,CACR,CLnBKwD,GACGpJ,GMdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,ENoBA,IOVI+L,GPUJ+B,GAAe/B,GQxBXgC,GAAwC,mBAAf1B,WCLzBlO,GAA+B,mBAAfkO,WAA8BA,WAAa,KCA3DN,GAA+B,mBAAfM,WAA8BA,gBAAa,EHuB9DN,GIND,WACC,IAAI1B,EACAjE,EHOkB7H,EGLtB,GAAiC,mBAArByP,GACX,OAAO,EAGR,IACC5H,EAAM,IAAI4H,GAAkB,CAAE,EAAG,MAAO,KAAMC,aHAzB1P,EGEN6H,EADfiE,GHCE0D,IAAiBxP,aAAiB8N,YACX,wBAAzBhE,GAAa9J,KGAC,IAAb6H,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,KCEQ,aDDbA,EAAK,EAEN,CAAC,MAAQ7B,GACT8F,GAAO,CACP,CACD,OAAOA,CACR,CJlBK6D,GACGzJ,GMdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,ENoBA,IOVI+L,GPUJoC,GAAepC,GQxBXqC,GAA0C,mBAAhB7B,YCL1BpO,GAAgC,mBAAhBoO,YAA+BA,YAAc,KCA7DR,GAAgC,mBAAhBQ,YAA+BA,iBAAc,EHuBhER,GIPD,WACC,IAAI1B,EACAjE,EHQmB7H,EGNvB,GAAkC,mBAAtB8P,GACX,OAAO,EAGR,IAECjI,EAAM,IAAIiI,GADVjI,EAAM,CAAE,EAAG,MAAO,KAAMkI,MAAcA,QHChB/P,EGEN6H,EADhBiE,GHCE+D,IAAkB7P,aAAiBgO,aACZ,yBAAzBlE,GAAa9J,KGAC,IAAb6H,EAAK,IACQ,IAAbA,EAAK,IACQkI,QAAblI,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,EAEN,CAAC,MAAQ7B,GACT8F,GAAO,CACP,CACD,OAAOA,CACR,CJnBKkE,GACG9J,GKdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,ELoBA,IMVI+L,GNUJyC,GAAezC,GOxBX0C,GAAwC,mBAAfrC,WCLzBjO,GAA+B,mBAAfiO,WAA8BA,WAAa,KCA3DL,GAA+B,mBAAfK,WAA8BA,gBAAa,EHuB9DL,GIND,WACC,IAAI1B,EACAjE,EHOkB7H,EGLtB,GAAiC,mBAArBmQ,GACX,OAAO,EAGR,IACCtI,EAAM,IAAIsI,GAAkB,CAAE,EAAG,MAAO,KAAMC,QHAzBpQ,EGEN6H,EADfiE,GHCEoE,IAAiBlQ,aAAiB6N,YACX,wBAAzB/D,GAAa9J,KGAC,IAAb6H,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,KCEQ,QDDbA,EAAK,EAEN,CAAC,MAAQ7B,GACT8F,GAAO,CACP,CACD,OAAOA,CACR,CJlBKuE,GACGnK,GMdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,ENoBA,IOVI+L,GPUJ8C,GAAe9C,GQxBX+C,GAAwC,mBAAfrC,WCLzBtO,GAA+B,mBAAfsO,WAA8BA,WAAa,KCA3DV,GAA+B,mBAAfU,WAA8BA,gBAAa,EHuB9DV,GIPD,WACC,IAAI1B,EACAjE,EHQkB7H,EGNtB,GAAiC,mBAArBwQ,GACX,OAAO,EAGR,IAEC3I,EAAM,IAAI2I,GADV3I,EAAM,CAAE,EAAG,MAAO,KAAM4I,IAAaA,MHChBzQ,EGEN6H,EADfiE,GHCEyE,IAAiBvQ,aAAiBkO,YACX,wBAAzBpE,GAAa9J,KGAC,IAAb6H,EAAK,IACQ,IAAbA,EAAK,IACQ4I,MAAb5I,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,EAEN,CAAC,MAAQ7B,GACT8F,GAAO,CACP,CACD,OAAOA,CACR,CJnBK4E,GACGxK,GKdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,ELoBA,IMVI+L,GNUJmD,GAAenD,GOxBXoD,GAAsD,mBAAtBzC,kBCLhCvO,GAAsC,mBAAtBuO,kBAAqCA,kBAAoB,KCAzEX,GAAsC,mBAAtBW,kBAAqCA,uBAAoB,EHuB5EX,GIRD,WACC,IAAI1B,EACAjE,EHSyB7H,EGP7B,GAAwC,mBAA5B6Q,GACX,OAAO,EAGR,IACChJ,EAAM,IAAIgJ,GAAyB,EAAG,EAAG,EAAG,EAAG,KAAM,KAAM,IAAK,MHEpC7Q,EGAN6H,EADtBiE,GHGE8E,IAAwB5Q,aAAiBmO,mBAClB,+BAAzBrE,GAAa9J,KGFC,IAAb6H,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,MAAbA,EAAK,IACQ,MAAbA,EAAK,EAEN,CAAC,MAAQ7B,GACT8F,GAAO,CACP,CACD,OAAOA,CACR,CJnBKgF,GACG5K,GKdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,ELoBA,IMVI+L,GNUJuD,GAAevD,GOxBXwD,GAAsC,mBAAdjD,UCLxBnO,GAA8B,mBAAdmO,UAA6BA,UAAY,KCAzDP,GAA8B,mBAAdO,UAA6BA,eAAY,EHuB5DP,GIND,WACC,IAAI1B,EACAjE,EHOiB7H,EGLrB,GAAgC,mBAApBiR,GACX,OAAO,EAGR,IACCpJ,EAAM,IAAIoJ,GAAiB,CAAE,EAAG,MAAO,KAAMC,MHAzBlR,EGEN6H,EADdiE,GHCEkF,IAAgBhR,aAAiB+N,WACV,uBAAzBjE,GAAa9J,KGAC,IAAb6H,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,KCEO,MDDZA,EAAK,EAEN,CAAC,MAAQ7B,GACT8F,GAAO,CACP,CACD,OAAOA,CACR,CJlBKqF,GACGjL,GMdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,ENoBA,IAAA2P,GAAe5D,GOGX6D,GAAelG,GAAOmG,kBCVtBC,GAAQrP,KAAKqP,MCHjB,SAASC,GAAWvI,GACnB,OAAQsI,GAAMtI,KAAOA,CACtB,CCPA,SAASuI,GAAWxR,GACnB,OACCA,EAAQgP,IACRhP,EAAQyR,IACRC,GAAO1R,EAET,CCAA,SAASwR,GAAWxR,GACnB,OACCD,GAAUC,IACV0R,GAAO1R,EAET,CCLA,SAASwR,GAAWxR,GACnB,OACCD,GAAUC,IACV0R,GAAO1R,EAAMmK,UAEf,CCGA,SAASqH,GAAWxR,GACnB,OAASqK,GAAarK,IAAWsK,GAAUtK,EAC5C,CCXA,SAAS2R,GAAsB3R,GAC9B,OACCwR,GAAWxR,IACXA,GAAS,CAEX,CCLA,SAAS2R,GAAsB3R,GAC9B,OACCwR,GAAWxR,IACXA,EAAMmK,WAAa,CAErB,CCQA,SAASwH,GAAsB3R,GAC9B,OAASqK,GAAarK,IAAWsK,GAAUtK,EAC5C,CCeAwH,EAAA5H,GAAA,cAAAyK,IACA7C,EAAA5H,GAAA,WAAA0K,ICAA9C,EAAA5H,GAAA,cAAAyK,IACA7C,EAAA5H,GAAA,WAAA0K,IC9BA,IAAIsH,GAAmB,WCGvB,SAASC,GAAmB7R,GAC3B,MACkB,iBAAVA,GACG,OAAVA,GACwB,iBAAjBA,EAAML,QACb6R,GAAWxR,EAAML,SACjBK,EAAML,QAAU,GAChBK,EAAML,QAAUmS,EAElB,CCZA,IAAIC,GAAyB,iBCD7B,SAASC,GAAchS,GACtB,MACkB,iBAAVA,GACG,OAAVA,GACwB,iBAAjBA,EAAML,QACb6R,GAAWxR,EAAML,SACjBK,EAAML,QAAU,GAChBK,EAAML,QAAUmS,EAElB,CCxBA,IAAIG,GAA0C,mBAAhBC,YAqB9B,SAASC,GAAenS,GACvB,OACGiS,IAAkBjS,aAAiBkS,aACZ,yBAAzBpI,GAAa9J,EAEf,CCZA,SAASsK,GAAUtK,GAClB,MACkB,iBAAVA,GACG,OAAVA,IACCmD,GAASnD,EAEZ,CCeA,IAAAoS,GAAAhF,GAAAjE,GAAAkB,aACAgI,GAAAjF,GAAAjE,GAAAmB,UAKAgI,GAAAlF,GAAAjE,IACA3B,EAAA8K,GAAA,aAAAF,IACA5K,EAAA8K,GAAA,UAAAD,IClDA,IAAI9N,GAAK,ICoBT,SAASgO,GAAWvS,GACnB,MAA0B,kBAAVA,CACjB,CCGA,IAAIwS,GAAOC,QCxBP/Q,GAAW+Q,QAAQ3R,UAAUY,SCS7B0H,GAAMW,KAqBV,SAASwI,GAAWvS,GACnB,MAAsB,iBAAVA,IACNA,aAAiByS,KAGjBrJ,GCtBP,SAAepJ,GACd,IAEC,OADA0B,GAASK,KAAM/B,IACR,CACP,CAAC,MAAQgG,GACT,OAAO,CACP,CACF,CDgBUoE,CAAMpK,GAEoB,qBAAzB8J,GAAa9J,IAGxB,CERA,SAASuS,GAAWvS,GACnB,OAASqK,GAAarK,IAAWsK,GAAUtK,EAC5C,CCUAwH,EAAA5H,GAAA,cAAAyK,IACA7C,EAAA5H,GAAA,WAAA0K,IC7CA,IAAInE,GAAwB,iBAATuM,KAAsBA,KAAO,KCA5CvM,GAA0B,iBAAXwM,OAAwBA,OAAS,KCAhDxM,GAA8B,iBAAfyM,WAA4BA,WAAa,KCKxDC,GCsBJ,SAAoBC,GACnB,GAAK3O,UAAUxE,OAAS,CACvB,IAAM4S,GAAWO,GAChB,MAAM,IAAI9O,UAAWiB,EAAQ,yDAA0D6N,IAExF,GAAKA,EACJ,OC1BK,IAAIC,SAAU,eAAd,ED6BN,CAED,GAAKC,GACJ,OAAOA,GAGR,GAAKC,GACJ,OAAOA,GAGR,GAAKC,GACJ,OAAOA,GAGR,MAAM,IAAIzR,MAAO,qDAClB,CD9CW0R,GACPC,GAAWP,GAAKQ,UAAYR,GAAKQ,SAASC,WGR1CC,GAAaxF,UCwBbnO,GCNY,mBAAP2E,IAGe,iBAAfgP,IAGa,mBAAbH,GCXT,SAAiBpJ,GAChB,OAAOwJ,GAAUxJ,GAAIjJ,aACtB,ECqBA,SAAiBiJ,GAChB,IAAIyJ,EAGJ,OAAW,OAANzJ,EACG,OAKM,WAHdyJ,SAAczJ,GAINwJ,GAAUxJ,GAAIjJ,cAEf0S,CACR,EC7BA,SAASC,GAAY1T,GAEpB,MAA6B,aAApB2T,GAAQ3T,EAClB,CCCA,SAASwH,GAAarB,EAAKC,EAAMpG,GAChCF,EAAgBqG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdC,UAAY,EACZhH,MAASA,GAEX,CCLA,SAAS4T,GAAYC,EAAMC,GAC1B,KAAQC,gBAAgBH,IACvB,MAAM,IAAI5P,UAAW,0EAEtB,IAAMjE,GAAU8T,GACf,MAAM,IAAI7P,UAAWiB,EAAQ,kEAAmE4O,IAEjG,IAAM9T,GAAU+T,GACf,MAAM,IAAI9P,UAAWiB,EAAQ,uEAAwE6O,IAItG,OAFAE,GAAuBD,KAAM,KAAMF,GACnCG,GAAuBD,KAAM,KAAMD,GAC5BC,IACR,CAeAvM,EAAaoM,GAAY,OAAQ,cAcjCpM,EAAaoM,GAAY,oBAAqB,GAgBnC/M,EAAE+M,GAAW9S,UAAW,oBAAqB,GAgB7C+F,EAAE+M,GAAW9S,UAAW,aAAc,IAgBtC+F,EAAE+M,GAAW9S,UAAW,YC/GnC,WAEC,IAAIT,EAAM,GAAK0T,KAAKE,GAOpB,OANKF,KAAKG,GAAK,EACd7T,GAAO,OAAU0T,KAAKG,GAEtB7T,GAAO,MAAQ0T,KAAKG,GAErB7T,GAAO,GAER,IDyHWwG,EAAE+M,GAAW9S,UAAW,UEnInC,WAEC,IAAIX,EAAM,CACVA,KAAW,cAGX,OAFAA,EAAI8T,GAAKF,KAAKE,GACd9T,EAAI+T,GAAKH,KAAKG,GACP/T,CACR,ICXA,IAAIgU,GAAkC,mBAAhBjS,KAAKiS,OAA0BjS,KAAKiS,OAAS,KCK/DC,GAAe,IAAIzG,GAAc,GCuBrC0G,GATwB,mBAAZnO,GACQA,GDApB,SAA2B+C,GAE1B,OADAmL,GAAc,GAAMnL,EACbmL,GAAc,EACtB,EEGA,SAASE,GAAWT,EAAMC,GACzB,KAAQC,gBAAgBO,IACvB,MAAM,IAAItQ,UAAW,0EAEtB,IAAMjE,GAAU8T,GACf,MAAM,IAAI7P,UAAWiB,EAAQ,kEAAmE4O,IAEjG,IAAM9T,GAAU+T,GACf,MAAM,IAAI9P,UAAWiB,EAAQ,uEAAwE6O,IAItG,OAFAE,GAAuBD,KAAM,KAAMQ,GAAkBV,IACrDG,GAAuBD,KAAM,KAAMQ,GAAkBT,IAC9CC,IACR,CCfA,SAASS,GAAexU,GACvB,OAAKA,aAAiB4T,IAAc5T,aAAiBsU,IAInC,iBAAVtU,GACG,OAAVA,GACoB,iBAAbA,EAAMiU,IACO,iBAAbjU,EAAMkU,EAEf,CCPA,SAASO,GAAQxL,GAChB,OAAOuI,GAAWvI,EAAE,EACrB,CFyBAzB,EAAa8M,GAAW,OAAQ,aAchC9M,EAAa8M,GAAW,oBAAqB,GAgBlCzN,EAAEyN,GAAUxT,UAAW,oBAAqB,GAgB5C+F,EAAEyN,GAAUxT,UAAW,aAAc,GAgBrC+F,EAAEyN,GAAUxT,UAAW,YGhHlC,WAEC,IAAIT,EAAM,GAAK0T,KAAKE,GAOpB,OANKF,KAAKG,GAAK,EACd7T,GAAO,OAAU0T,KAAKG,GAEtB7T,GAAO,MAAQ0T,KAAKG,GAErB7T,GAAO,GAER,IH0HWwG,EAAEyN,GAAUxT,UAAW,UIpIlC,WAEC,IAAIX,EAAM,CACVA,KAAW,aAGX,OAFAA,EAAI8T,GAAKF,KAAKE,GACd9T,EAAI+T,GAAKH,KAAKG,GACP/T,CACR,ICXA,IAAIuU,GAAoB,EAoBxB,SAASC,GAAkB3U,GAE1B,MACkB,iBAAVA,GACG,OAAVA,GAC2B,mBAA3BA,EAAMkN,YAAYK,MAClBvN,EAAM0U,oBAAsBA,EAE9B,CC5BA,IAAIA,GAAoB,GAoBxB,SAASE,GAAmB5U,GAE3B,MACkB,iBAAVA,GACG,OAAVA,GAC2B,oBAA3BA,EAAMkN,YAAYK,MAClBvN,EAAM0U,oBAAsBA,EAE9B,CCbA,SAASG,KACR,MACmB,mBAAXxL,IACoB,iBAApBA,GAAQ,QACfK,GAAYL,GAAQ,aACO,iBAApBA,GAAOyL,QAEhB,CC6BA,IAAIC,GAAmBF,KAA+BxL,OAAOyL,SAAW,KCxBxE,SAASE,GAAkC7O,EAAKC,EAAM6B,GACrDnI,EAAgBqG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdL,IAAOuB,GAET,CCrBA,SAAS4L,GAAMoB,GACd,OAAOA,EAAEhB,EACV,CCFA,SAASH,GAAMmB,GACd,OAAOA,EAAEf,EACV,CCSA,SAASgB,GAAajM,EAAG9B,GACxB,OAAO,IAAIwG,GAAc1E,EAAEkM,OAAQlM,EAAEmM,WAAYnM,EAAEyL,kBAAkBvN,EAAS,GAAG8B,EAAEtJ,OAAOwH,GAC3F,CCFA,SAAS+N,GAAajM,EAAG9B,GACxB,OAAO,IAAIyG,GAAc3E,EAAEkM,OAAQlM,EAAEmM,WAAYnM,EAAEyL,kBAAkBvN,EAAS,GAAG8B,EAAEtJ,OAAOwH,GAC3F,CCTA,SAASkO,GAAcC,GACtB,IAAInV,EACA6J,EACAiL,EAGJ,IADA9U,EAAM,KAEL6J,EAAIsL,EAAGC,QACAC,MAIP,GAAK3D,GADLoD,EAAIjL,EAAEhK,QACyBiV,EAAEtV,QAAU,EAC1CQ,EAAI6E,KAAMiQ,EAAG,GAAKA,EAAG,QACf,KAAKT,GAAeS,GAG1B,OAAO,IAAIjR,UAAWiB,EAAQ,kJAAmJgQ,IAFjL9U,EAAI6E,KAAMyQ,GAAOR,GAAKS,GAAOT,GAG7B,CAEF,OAAO9U,CACR,CCAA,IAAAuU,GAAA,EAAA/G,GAAA+G,kBACAiB,GAAAd,KAYA,SAAAe,GAAA5V,GACA,OACAA,aAAAoO,IAEA,iBAAApO,GACA,OAAAA,IAEA,mBAAAA,EAAAkN,YAAAK,MACA,oBAAAvN,EAAAkN,YAAAK,OAEA,iBAAAvN,EAAA6V,SAGA,iBAAA7V,EAAA8V,OAGA,CASA,SAAAC,GAAA/V,GACA,OACAA,IAAAoO,IAGA,oBAAApO,EAAAuN,IAEA,CAUA,SAAAyI,GAAAC,EAAAnO,GAEA,OAAA,IAAAwM,GAAA2B,EADAnO,GAAA,GACAmO,EAAAnO,EAAA,GACA,CAyEA,SAAAsG,KACA,IAAAgH,EACAc,EACAD,EACA/M,EAGA,GADAgN,EAAA/R,UAAAxE,SACAoU,gBAAA3F,IACA,OAAA,IAAA8H,EACA,IAAA9H,GAEA,IAAA8H,EACA,IAAA9H,GAAAjK,UAAA,IAEA,IAAA+R,EACA,IAAA9H,GAAAjK,UAAA,GAAAA,UAAA,IAEA,IAAAiK,GAAAjK,UAAA,GAAAA,UAAA,GAAAA,UAAA,IAGA,GAAA,IAAA+R,EACAD,EAAA,IAAAtI,GAAA,QACA,GAAA,IAAAuI,EACA,GAAAvE,GAAAxN,UAAA,IACA8R,EAAA,IAAAtI,GAAA,EAAAxJ,UAAA,SACA,GAAA6N,GAAA7N,UAAA,IAKA,IAHA+E,GADA+M,EAAA9R,UAAA,IACAxE,SAGAwD,GAAA8S,IAAAzB,GAAAyB,EAAA,KAEA,GADAA,ECxLA,SAAoBA,EAAKpO,GACxB,IAAIqB,EACAc,EACAtK,EACAqE,EAIJ,IAFAmF,EAAMrB,EAAIlI,OACVoE,EAAI,EACErE,EAAI,EAAGA,EAAIwJ,EAAKxJ,IAAM,CAE3B,IAAM8U,GADNxK,EAAInC,EAAKnI,IAER,OAAO,KAERuW,EAAKlS,GAAM0R,GAAOzL,GAClBiM,EAAKlS,EAAE,GAAM2R,GAAO1L,GACpBjG,GAAK,CACL,CACD,OAAOkS,CACR,CDsKAE,CAAA,IAAAxI,GAAA,EAAAzE,GAAA+M,GACA,OAAAA,EAAA,CAEA,IAAAxB,GAAAvL,GACA,MAAA,IAAAkN,WAAAnR,EAAA,6GAAAiE,IAGA+M,EAAA,IAAAtI,GAAAxJ,UAAA,GACA,MACA,CACA,GAAAwQ,GAAAsB,GACAA,EAAAI,GAAAJ,EAAA,QACA,GAAArB,GAAAqB,GACAA,EAAAK,GAAAL,EAAA,QACA,IAAAxB,GAAAvL,GACA,MAAA,IAAAkN,WAAAnR,EAAA,6HAAAiE,IAEA+M,EAAA,IAAAtI,GAAAsI,EACA,MACA,GAAA9D,GAAAhO,UAAA,IAAA,CAEA,IAAAqN,IADAyE,EAAA9R,UAAA,IACAoS,WAAA7B,IACA,MAAA,IAAA0B,WAAAnR,EAAA,yFAAAyP,GAAAuB,EAAAM,aAEAN,EAAA,IAAAtI,GAAAsI,EACA,KAAA,KAAA3L,GAAAnG,UAAA,IAkBA,MAAA,IAAAH,UAAAiB,EAAA,qHAAAd,UAAA,KAhBA,GADA8R,EAAA9R,UAAA,IACA,IAAAwR,GACA,MAAA,IAAA3R,UAAAiB,EAAA,mJAAAgR,IAEA,IAAAvC,GAAAuC,EAAAO,KACA,MAAA,IAAAxS,UAAAiB,EAAA,qHAAAgR,IAGA,IAAAvC,IADAuC,EAAAA,EAAAO,OACAjB,MACA,MAAA,IAAAvR,UAAAiB,EAAA,qHAAAgR,IAGA,IADAA,EAAAZ,GAAAY,cACAxU,MACA,MAAAwU,EAEAA,EAAA,IAAAtI,GAAAsI,EAGA,KACA,CAEA,IAAA9D,GADA8D,EAAA9R,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,wEAAAgR,IAGA,IAAAtE,GADAyD,EAAAjR,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,4EAAAmQ,IAEA,IAAA5D,GAAA4D,EAAAV,IACA,MAAA,IAAA0B,WAAAnR,EAAA,uEAAAyP,GAAAU,IAEA,GAAA,IAAAc,EAAA,CAEA,IAAA1E,IADAtI,EAAA+M,EAAAM,WAAAnB,GACAV,IACA,MAAA,IAAA0B,WAAAnR,EAAA,oGAAAyP,GAAAxL,IAEA+M,EAAA,IAAAtI,GAAAsI,EAAAb,EACA,KAAA,CAEA,IAAAzD,GADAzI,EAAA/E,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,uEAAAiE,IAEA,GAAAA,EAAAwL,GAAAuB,EAAAM,WAAAnB,EACA,MAAA,IAAAgB,WAAAnR,EAAA,iJAAAiE,EAAAwL,KAEAuB,EAAA,IAAAtI,GAAAsI,EAAAb,EAAA,EAAAlM,EACA,CACA,CAIA,OAHA1B,EAAAuM,KAAA,UAAAkC,GACAzO,EAAAuM,KAAA,UAAAkC,EAAAtW,OAAA,GAEAoU,IACA,CEzQA,SAASF,GAAMoB,GACd,OAAOA,EAAEhB,EACV,CCFA,SAASH,GAAMmB,GACd,OAAOA,EAAEf,EACV,CCEA,SAASmB,GAAcC,GACtB,IAAInV,EACA6J,EACAiL,EAGJ,IADA9U,EAAM,KAEL6J,EAAIsL,EAAGC,QACAC,MAIP,GAAK3D,GADLoD,EAAIjL,EAAEhK,QACyBiV,EAAEtV,QAAU,EAC1CQ,EAAI6E,KAAMiQ,EAAG,GAAKA,EAAG,QACf,KAAKT,GAAeS,GAG1B,OAAO,IAAIjR,UAAWiB,EAAQ,kJAAmJgQ,IAFjL9U,EAAI6E,KAAM6O,GAAMoB,GAAKnB,GAAMmB,GAG3B,CAEF,OAAO9U,CACR,CJ+PAqH,EAAA4G,GAAA,oBAAAsG,IAeAlN,EAAA4G,GAAA,OAAA,kBAmDAvH,EAAAuH,GAAA,QAAA,SAAAqI,GACA,IAAAC,EACAR,EACAS,EACAxW,EACA8V,EACAW,EACAlQ,EACAwC,EACA2N,EACA7M,EACAtK,EACAqE,EACA,IAAA2P,GAAAK,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA+R,GAAAhC,MACA,MAAA,IAAA/P,UAAA,6DAGA,IADAkS,EAAA/R,UAAAxE,QACA,EAAA,CAEA,IAAA+T,GADAiD,EAAAxS,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,qEAAA0R,IAEAT,EAAA,IACAQ,EAAAvS,UAAA,GAEA,CACA,GAAAyR,GAAAa,GAAA,CAEA,GADAvN,EAAAuN,EAAA9W,OACAgX,EAAA,CAIA,IAFAV,GADA9V,EAAA,IAAA4T,KAAA7K,IACA4M,QACA/R,EAAA,EACArE,EAAA,EAAAA,EAAAwJ,EAAAxJ,IAAA,CAEA,GAAA8U,GADAxK,EAAA2M,EAAA5U,KAAA2U,EAAAD,EAAA/P,IAAAhH,GAAAA,IAEAuW,EAAAlS,GAAA0R,GAAAzL,GACAiM,EAAAlS,EAAA,GAAA2R,GAAA1L,OACA,MAAA6H,GAAA7H,IAAAA,EAAArK,QAAA,GAIA,MAAA,IAAAqE,UAAAiB,EAAA,+IAAA+E,IAHAiM,EAAAlS,GAAAiG,EAAA,GACAiM,EAAAlS,EAAA,GAAAiG,EAAA,EAGA,CACAjG,GAAA,CACA,CACA,OAAA5D,CACA,CACA,OAAA,IAAA4T,KAAA0C,EACA,CACA,GAAAzE,GAAAyE,GAAA,CACA,GAAAE,EAAA,CAUA,IAPAzN,EAAAuN,EAAA9W,OAEA+G,EADA+P,EAAA/P,KAAA+P,EAAA9P,IACA+F,EAAA,WAEAzE,EAAA,WAGAvI,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACA,IAAA8U,GAAA9N,EAAA+P,EAAA/W,IAAA,CACAmX,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAApC,GAAAvL,GACA,MAAA,IAAAkN,WAAAnR,EAAA,+FAAA,EAAAiE,IAIA,IADA+M,GADA9V,EAAA,IAAA4T,KAAA7K,EAAA,IACA4M,QACApW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAuW,EAAAvW,GAAAiX,EAAA5U,KAAA2U,EAAAhQ,EAAA+P,EAAA/W,GAAAA,GAEA,OAAAS,CACA,CAKA,IAFA8V,GADA9V,EAAA,IAAA4T,KAAA7K,IACA4M,QACA/R,EAAA,EACArE,EAAA,EAAAA,EAAAwJ,EAAAxJ,IAAA,CAEA,GAAA8U,GADAxK,EAAA2M,EAAA5U,KAAA2U,EAAAhQ,EAAA+P,EAAA/W,GAAAA,IAEAuW,EAAAlS,GAAA0R,GAAAzL,GACAiM,EAAAlS,EAAA,GAAA2R,GAAA1L,OACA,MAAA6H,GAAA7H,IAAAA,EAAArK,QAAA,GAIA,MAAA,IAAAqE,UAAAiB,EAAA,+IAAA+E,IAHAiM,EAAAlS,GAAAiG,EAAA,GACAiM,EAAAlS,EAAA,GAAAiG,EAAA,EAGA,CACAjG,GAAA,CACA,CACA,OAAA5D,CACA,CACA,OAAA,IAAA4T,KAAA0C,EACA,CACA,GAAAnM,GAAAmM,IAAAd,IAAAjC,GAAA+C,EAAAD,KAAA,CAEA,IAAA9C,IADAuC,EAAAQ,EAAAD,OACAjB,MACA,MAAA,IAAAvR,UAAAiB,EAAA,6FAAAwR,IAOA,GAJAG,EADAD,EK/bA,SAA0BrB,EAAIqB,EAAMD,GACnC,IAAIvW,EACA6J,EACAiL,EACAvV,EAIJ,IAFAS,EAAM,GACNT,GAAK,IAEJsK,EAAIsL,EAAGC,QACAC,MAKP,GAFA9V,GAAK,EAEAmS,GADLoD,EAAI0B,EAAK5U,KAAM2U,EAAS1M,EAAEhK,MAAON,KACFuV,EAAEtV,QAAU,EAC1CQ,EAAI6E,KAAMiQ,EAAG,GAAKA,EAAG,QACf,KAAKT,GAAeS,GAG1B,OAAO,IAAIjR,UAAWiB,EAAQ,+IAAgJgQ,IAF9K9U,EAAI6E,KAAMyQ,GAAOR,GAAKS,GAAOT,GAG7B,CAEF,OAAO9U,CACR,CLwaA2W,CAAAb,EAAAU,EAAAD,GAEArB,GAAAY,GAEAW,aAAAnV,MACA,MAAAmV,EAKA,IADAX,GADA9V,EAAA,IAAA4T,KADA7K,EAAA0N,EAAAjX,OAAA,IAEAmW,QACApW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAuW,EAAAvW,GAAAkX,EAAAlX,GAEA,OAAAS,CACA,CACA,MAAA,IAAA6D,UAAAiB,EAAA,6FAAAwR,GACA,IAoBAjP,EAAA4G,GAAA,MAAA,WACA,IAAAlJ,EACAxF,EACA,IAAAgU,GAAAK,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA+R,GAAAhC,MACA,MAAA,IAAA/P,UAAA,6DAGA,IADAkB,EAAA,GACAxF,EAAA,EAAAA,EAAAyE,UAAAxE,OAAAD,IACAwF,EAAAF,KAAAb,UAAAzE,IAEA,OAAA,IAAAqU,KAAA7O,EACA,IAuDA2B,EAAAuH,GAAAtN,UAAA,MAAA,SAAAgH,GACA,IAAA8N,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAAwN,GAAA1J,GACA,MAAA,IAAA9D,UAAAiB,EAAA,0DAAA6C,IAKA,GAHAA,EAAA,IACAA,GAAAiM,KAAA8B,WAEA/N,EAAA,GAAAA,GAAAiM,KAAA8B,SAGA,OAAAG,GAAAjC,KAAA+B,QAAAhO,EACA,IAgBAkN,GAAA5G,GAAAtN,UAAA,UAAA,WACA,OAAAiT,KAAA+B,QAAAX,MACA,IAgBAH,GAAA5G,GAAAtN,UAAA,cAAA,WACA,OAAAiT,KAAA+B,QAAAS,UACA,IAgBAvB,GAAA5G,GAAAtN,UAAA,cAAA,WACA,OAAAiT,KAAA+B,QAAAV,UACA,IAiBAvO,EAAAuH,GAAAtN,UAAA,oBAAAsN,GAAAsG,mBAuCAlN,EAAA4G,GAAAtN,UAAA,cAAA,SAAAiW,EAAAC,GACA,IAAApB,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAQA,OALA,IAAAG,UAAAxE,OACAoU,KAAA+B,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,GAEAjD,KAAA+B,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,EAAA,EAAA7S,UAAA,IAEA4P,IACA,IAqCAlN,EAAAuH,GAAAtN,UAAA,WAAA,WACA,IAAA4R,EACAwE,EACAhO,EACA+M,EACA7M,EACA1J,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAiBA,OAfA0O,EAAAqB,KACAkC,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QAGAnW,GAAA,EAIA8H,EADA0P,EAAA,CAAA,EACA,QAcA,WAEA,OADAxX,GAAA,EACA0J,GAAA1J,GAAAwJ,EACA,CACAsM,MAAA,GAGA,CACAxV,MAAA,CAAAN,EAAAsW,GAAAC,EAAAvW,IACA8V,MAAA,EAEA,IAxBAhO,EAAA0P,EAAA,UAiCA,SAAAlX,GAEA,OADAoJ,GAAA,EACAjF,UAAAxE,OACA,CACAK,MAAAA,EACAwV,MAAA,GAGA,CACAA,MAAA,EAEA,IA1CAgB,IACAhP,EAAA0P,EAAAV,IAiDA,WACA,OAAA9D,EAAAyE,SACA,IAjDAD,CAkDA,IA+BA1P,EAAA4G,GAAAtN,UAAA,SAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACAvW,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAmJ,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACA,IAAAoN,EAAA/K,KAAA2U,EAAAV,GAAAC,EAAAvW,GAAAA,EAAAqU,MACA,OAAA,EAGA,OAAA,CACA,IA2CAvM,EAAA4G,GAAAtN,UAAA,QAAA,SAAAd,EAAAgX,EAAAI,GACA,IAAAnB,EACA/M,EACApB,EACAmM,EACAC,EACAxU,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAAwQ,GAAAxU,GACA,MAAA,IAAAgE,UAAAiB,EAAA,0EAAAjF,IAIA,GAFAiW,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACA1R,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAAwF,GACA,MAAA,IAAAhT,UAAAiB,EAAA,qEAAA+R,IAQA,GANAA,EAAA,IACAA,GAAA9N,GACA,IACA8N,EAAA,GAGA7S,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAA4F,GACA,MAAA,IAAApT,UAAAiB,EAAA,oEAAAmS,IAEAA,EAAA,IACAA,GAAAlO,GACA,IACAkO,EAAA,GAGAA,EAAAlO,IACAkO,EAAAlO,EAEA,MACAkO,EAAAlO,CAEA,MACA8N,EAAA,EACAI,EAAAlO,EAIA,IAFA+K,EAAAwB,GAAAzV,GACAkU,EAAAwB,GAAA1V,GACAN,EAAAsX,EAAAtX,EAAA0X,EAAA1X,IAEAuW,EADAnO,EAAA,EAAApI,GACAuU,EACAgC,EAAAnO,EAAA,GAAAoM,EAEA,OAAAH,IACA,IA2CAvM,EAAA4G,GAAAtN,UAAA,UAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACA9V,EACAT,EACAuV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAIA,IAFAmJ,EAAAlC,KAAA+B,QACA3V,EAAA,GACAT,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACAuV,EAAAe,GAAAC,EAAAvW,GACAoN,EAAA/K,KAAA2U,EAAAzB,EAAAvV,EAAAqU,OACA5T,EAAA6E,KAAAiQ,GAGA,OAAA,IAAAlB,KAAA7G,YAAA/M,EACA,IAsCAqH,EAAA4G,GAAAtN,UAAA,QAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACAvW,EACAuV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAmJ,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IAEA,GADAuV,EAAAe,GAAAC,EAAAvW,GACAoN,EAAA/K,KAAA2U,EAAAzB,EAAAvV,EAAAqU,MACA,OAAAkB,CAGA,IAgCAzN,EAAA4G,GAAAtN,UAAA,aAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACAvW,EACAuV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAmJ,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IAEA,GADAuV,EAAAe,GAAAC,EAAAvW,GACAoN,EAAA/K,KAAA2U,EAAAzB,EAAAvV,EAAAqU,MACA,OAAArU,EAGA,OAAA,CACA,IAsCA8H,EAAA4G,GAAAtN,UAAA,YAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACAvW,EACAuV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAmJ,EAAAlC,KAAA+B,QACApW,EAAAqU,KAAA8B,QAAA,EAAAnW,GAAA,EAAAA,IAEA,GADAuV,EAAAe,GAAAC,EAAAvW,GACAoN,EAAA/K,KAAA2U,EAAAzB,EAAAvV,EAAAqU,MACA,OAAAkB,CAGA,IAgCAzN,EAAA4G,GAAAtN,UAAA,iBAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACAvW,EACAuV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAmJ,EAAAlC,KAAA+B,QACApW,EAAAqU,KAAA8B,QAAA,EAAAnW,GAAA,EAAAA,IAEA,GADAuV,EAAAe,GAAAC,EAAAvW,GACAoN,EAAA/K,KAAA2U,EAAAzB,EAAAvV,EAAAqU,MACA,OAAArU,EAGA,OAAA,CACA,IA4BA8H,EAAA4G,GAAAtN,UAAA,WAAA,SAAAuW,EAAAX,GACA,IAAAT,EACAvW,EACAuV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAA2D,GACA,MAAA,IAAArT,UAAAiB,EAAA,oEAAAoS,IAGA,IADApB,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACAuV,EAAAe,GAAAC,EAAAvW,GACA2X,EAAAtV,KAAA2U,EAAAzB,EAAAvV,EAAAqU,KAEA,IAyCAlN,EAAAuH,GAAAtN,UAAA,OAAA,SAAAgH,GACA,IAAA8N,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA2N,GAAA7J,GACA,MAAA,IAAA9D,UAAAiB,EAAA,qEAAA6C,IAEA,KAAAA,GAAAiM,KAAA8B,SAGA,OAAAG,GAAAjC,KAAA+B,QAAAhO,EACA,IAmCAN,EAAA4G,GAAAtN,UAAA,YAAA,SAAAwW,EAAAC,GACA,IAAAtB,EACAnO,EACAmM,EACAC,EACAxU,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAAwQ,GAAA8C,GACA,MAAA,IAAAtT,UAAAiB,EAAA,0EAAAqS,IAEA,GAAAnT,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAA+F,GACA,MAAA,IAAAvT,UAAAiB,EAAA,qEAAAsS,IAEAA,EAAA,IACAA,GAAAxD,KAAA8B,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAtD,EAAAwB,GAAA6B,GACApD,EAAAwB,GAAA4B,GACArB,EAAAlC,KAAA+B,QACApW,EAAA6X,EAAA7X,EAAAqU,KAAA8B,QAAAnW,IAEA,GAAAuU,IAAAgC,EADAnO,EAAA,EAAApI,IACAwU,IAAA+B,EAAAnO,EAAA,GACA,OAAA,EAGA,OAAA,CACA,IAmCAN,EAAA4G,GAAAtN,UAAA,WAAA,SAAAwW,EAAAC,GACA,IAAAtB,EACAnO,EACAmM,EACAC,EACAxU,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAAwQ,GAAA8C,GACA,MAAA,IAAAtT,UAAAiB,EAAA,0EAAAqS,IAEA,GAAAnT,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAA+F,GACA,MAAA,IAAAvT,UAAAiB,EAAA,qEAAAsS,IAEAA,EAAA,IACAA,GAAAxD,KAAA8B,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAtD,EAAAwB,GAAA6B,GACApD,EAAAwB,GAAA4B,GACArB,EAAAlC,KAAA+B,QACApW,EAAA6X,EAAA7X,EAAAqU,KAAA8B,QAAAnW,IAEA,GAAAuU,IAAAgC,EADAnO,EAAA,EAAApI,IACAwU,IAAA+B,EAAAnO,EAAA,GACA,OAAApI,EAGA,OAAA,CACA,IAyBAmH,EAAAuH,GAAAtN,UAAA,QAAA,SAAA0W,GACA,IAAArX,EACA8V,EACAwB,EACA/X,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,GAAA,IAAAG,UAAAxE,OACA8X,EAAA,QACA,KAAAtO,EAAAqO,GAGA,MAAA,IAAAxT,UAAAiB,EAAA,kEAAAuS,IAFAC,EAAAD,CAGA,CAGA,IAFArX,EAAA,GACA8V,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACAS,EAAA6E,KAAAgR,GAAAC,EAAAvW,GAAAgC,YAEA,OAAAvB,EAAAuX,KAAAD,EACA,IA4BA5Q,EAAAuH,GAAAtN,UAAA,QAAA,WACA,IAAA4R,EACAwE,EACAhO,EACAE,EACA1J,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAgBA,OAdA0O,EAAAqB,KACA7K,EAAA6K,KAAA8B,QAGAnW,GAAA,EAIA8H,EADA0P,EAAA,CAAA,EACA,QAcA,WAEA,OADAxX,GAAA,EACA0J,GAAA1J,GAAAwJ,EACA,CACAsM,MAAA,GAGA,CACAxV,MAAAN,EACA8V,MAAA,EAEA,IAxBAhO,EAAA0P,EAAA,UAiCA,SAAAlX,GAEA,OADAoJ,GAAA,EACAjF,UAAAxE,OACA,CACAK,MAAAA,EACAwV,MAAA,GAGA,CACAA,MAAA,EAEA,IA1CAgB,IACAhP,EAAA0P,EAAAV,IAiDA,WACA,OAAA9D,EAAAiF,MACA,IAjDAT,CAkDA,IAsCA1P,EAAA4G,GAAAtN,UAAA,eAAA,SAAAwW,EAAAC,GACA,IAAAtB,EACAnO,EACAmM,EACAC,EACAxU,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAAwQ,GAAA8C,GACA,MAAA,IAAAtT,UAAAiB,EAAA,0EAAAqS,IAEA,GAAAnT,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAA+F,GACA,MAAA,IAAAvT,UAAAiB,EAAA,qEAAAsS,IAEAA,GAAAxD,KAAA8B,QACA0B,EAAAxD,KAAA8B,QAAA,EACA0B,EAAA,IACAA,GAAAxD,KAAA8B,QAEA,MACA0B,EAAAxD,KAAA8B,QAAA,EAKA,IAHA5B,EAAAwB,GAAA6B,GACApD,EAAAwB,GAAA4B,GACArB,EAAAlC,KAAA+B,QACApW,EAAA6X,EAAA7X,GAAA,EAAAA,IAEA,GAAAuU,IAAAgC,EADAnO,EAAA,EAAApI,IACAwU,IAAA+B,EAAAnO,EAAA,GACA,OAAApI,EAGA,OAAA,CACA,IAgBAsV,GAAA5G,GAAAtN,UAAA,UAAA,WACA,OAAAiT,KAAA8B,OACA,IAyCArO,EAAA4G,GAAAtN,UAAA,OAAA,SAAAuW,EAAAX,GACA,IAAAkB,EACA3B,EACA9V,EACAT,EACAsK,EACA,IAAA4L,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAA2D,GACA,MAAA,IAAArT,UAAAiB,EAAA,oEAAAoS,IAKA,IAHApB,EAAAlC,KAAA+B,QAEA8B,GADAzX,EAAA,IAAA4T,KAAA7G,YAAA6G,KAAA8B,UACAC,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IAEA,GAAA8U,GADAxK,EAAAqN,EAAAtV,KAAA2U,EAAAV,GAAAC,EAAAvW,GAAAA,EAAAqU,OAEA6D,EAAA,EAAAlY,GAAA+V,GAAAzL,GACA4N,EAAA,EAAAlY,EAAA,GAAAgW,GAAA1L,OACA,KAAA6H,GAAA7H,IAAA,IAAAA,EAAArK,OAIA,MAAA,IAAAqE,UAAAiB,EAAA,+IAAA+E,IAHA4N,EAAA,EAAAlY,GAAAsK,EAAA,GACA4N,EAAA,EAAAlY,EAAA,GAAAsK,EAAA,EAGA,CAEA,OAAA7J,CACA,IAmCAqH,EAAA4G,GAAAtN,UAAA,UAAA,SAAA+W,EAAAC,GACA,IAAA7B,EACA8B,EACA7O,EAEAxJ,EAEA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAAmE,GACA,MAAA,IAAA7T,UAAAiB,EAAA,oEAAA4S,IAIA,GAFA5B,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACA1R,UAAAxE,OAAA,EACAoY,EAAAD,EACApY,EAAA,MACA,CACA,GAAA,IAAAwJ,EACA,MAAA,IAAAzH,MAAA,oGAEAsW,EAAA/B,GAAAC,EAAA,GACAvW,EAAA,CACA,CACA,KAAAA,EAAAwJ,EAAAxJ,IAEAqY,EAAAF,EAAAE,EADA/B,GAAAC,EAAAvW,GACAA,EAAAqU,MAEA,OAAAgE,CACA,IAmCAvQ,EAAA4G,GAAAtN,UAAA,eAAA,SAAA+W,EAAAC,GACA,IAAA7B,EACA8B,EACA7O,EAEAxJ,EAEA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAAmE,GACA,MAAA,IAAA7T,UAAAiB,EAAA,oEAAA4S,IAIA,GAFA5B,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACA1R,UAAAxE,OAAA,EACAoY,EAAAD,EACApY,EAAAwJ,EAAA,MACA,CACA,GAAA,IAAAA,EACA,MAAA,IAAAzH,MAAA,oGAEAsW,EAAA/B,GAAAC,EAAA/M,EAAA,GACAxJ,EAAAwJ,EAAA,CACA,CACA,KAAAxJ,GAAA,EAAAA,IAEAqY,EAAAF,EAAAE,EADA/B,GAAAC,EAAAvW,GACAA,EAAAqU,MAEA,OAAAgE,CACA,IAmDAlR,EAAAuH,GAAAtN,UAAA,WAAA,WACA,IAAAmV,EACAW,EACA1N,EACA8O,EACAtY,EACAqE,EACA,IAAA6R,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAKA,IAHAkF,EAAA6K,KAAA8B,QACAI,EAAAlC,KAAA+B,QACAkC,EAAAzG,GAAArI,EAAA,GACAxJ,EAAA,EAAAA,EAAAsY,EAAAtY,IACAqE,EAAAmF,EAAAxJ,EAAA,EACAkX,EAAAX,EAAA,EAAAvW,GACAuW,EAAA,EAAAvW,GAAAuW,EAAA,EAAAlS,GACAkS,EAAA,EAAAlS,GAAA6S,EACAA,EAAAX,EAAA,EAAAvW,EAAA,GACAuW,EAAA,EAAAvW,EAAA,GAAAuW,EAAA,EAAAlS,EAAA,GACAkS,EAAA,EAAAlS,EAAA,GAAA6S,EAEA,OAAA7C,IACA,IAgEAlN,EAAAuH,GAAAtN,UAAA,OAAA,SAAAd,GAEA,IAAAiY,EACAnQ,EACAmO,EACAW,EACAC,EACAmB,EACAhO,EACAtK,EACAqE,EACA,IAAA6R,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAGA,GADAiS,EAAAlC,KAAA+B,QACA3R,UAAAxE,OAAA,GAEA,IAAAgS,GADA7J,EAAA3D,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,+EAAA6C,SAGAA,EAAA,EAEA,GAAA0M,GAAAxU,GAAA,CACA,GAAA8H,GAAAiM,KAAA8B,QACA,MAAA,IAAAO,WAAAnR,EAAA,kEAAA6C,IAKA,OAFAmO,EADAnO,GAAA,GACA2N,GAAAzV,QACAiW,EAAAnO,EAAA,GAAA4N,GAAA1V,GAEA,CACA,GAAA4V,GAAA5V,GAAA,CAEA,GAAA8H,GADAkQ,EAAAhY,EAAA6V,SACA9B,KAAA8B,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA6B,EAAAjY,EAAA8V,QAGA/R,EAAAkS,EAAAb,WAAAtN,EAAA4M,GAEAuD,EAAA9C,SAAAc,EAAAd,QAEA8C,EAAA7C,WAAArR,GACAkU,EAAA7C,WAAA6C,EAAA1B,WAAAxS,EAEA,CAGA,IADA6S,EAAA,IAAAjJ,GAAAsK,EAAAtY,QACAD,EAAA,EAAAA,EAAAuY,EAAAtY,OAAAD,IACAkX,EAAAlX,GAAAuY,EAAAvY,GAEAuY,EAAArB,CACA,CAGA,IAFA9O,GAAA,EACA/D,EAAA,EACArE,EAAA,EAAAA,EAAAsY,EAAAtY,IACAuW,EAAAnO,GAAAmQ,EAAAlU,GACAkS,EAAAnO,EAAA,GAAAmQ,EAAAlU,EAAA,GACA+D,GAAA,EACA/D,GAAA,CAGA,KAhCA,CAiCA,IAAAiO,GAAAhS,GA2DA,MAAA,IAAAgE,UAAAiB,EAAA,kIAAAjF,IAxDA,IADAgY,EAAAhY,EAAAL,OACAD,EAAA,EAAAA,EAAAsY,EAAAtY,IACA,IAAA8U,GAAAxU,EAAAN,IAAA,CACAmX,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAApC,GAAAuD,GACA,MAAA,IAAA5B,WAAAnR,EAAA,6GAAA+S,IAEA,GAAAlQ,EAAAkQ,EAAA,EAAAjE,KAAA8B,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA6B,EAAAjY,EAGA+D,EAAAkS,EAAAb,WAAAtN,EAAA4M,GAEAuD,EAAA9C,SAAAc,EAAAd,QAEA8C,EAAA7C,WAAArR,GACAkU,EAAA7C,WAAA6C,EAAA1B,WAAAxS,EAEA,CAGA,IADA6S,EAAA,IAAAjJ,GAAAqK,GACAtY,EAAA,EAAAA,EAAAsY,EAAAtY,IACAkX,EAAAlX,GAAAuY,EAAAvY,GAEAuY,EAAArB,CACA,CAIA,IAHA9O,GAAA,EACAkQ,GAAA,EACAjU,EAAA,EACArE,EAAA,EAAAA,EAAAsY,EAAAtY,IACAuW,EAAAnO,GAAAmQ,EAAAlU,GACAkS,EAAAnO,EAAA,GAAAmQ,EAAAlU,EAAA,GACA+D,GAAA,EACA/D,GAAA,EAEA,MACA,CAEA,GAAA+D,EAAAkQ,EAAAjE,KAAA8B,QACA,MAAA,IAAAO,WAAA,0FAGA,IADAtO,GAAA,EACApI,EAAA,EAAAA,EAAAsY,EAAAtY,IACAsK,EAAAhK,EAAAN,GACAuW,EAAAnO,GAAA2N,GAAAzL,GACAiM,EAAAnO,EAAA,GAAA4N,GAAA1L,GACAlC,GAAA,CAxDA,CA+DA,IA2EAN,EAAA4G,GAAAtN,UAAA,SAAA,SAAAkW,EAAAI,GACA,IAAAc,EACAN,EACAzX,EACA2H,EACAmO,EACA/M,EACAxJ,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAIA,GAFAiS,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACA,IAAA1R,UAAAxE,OACAqX,EAAA,EACAI,EAAAlO,MACA,CACA,IAAAsI,GAAAwF,GACA,MAAA,IAAAhT,UAAAiB,EAAA,oEAAA+R,IAQA,GANAA,EAAA,IACAA,GAAA9N,GACA,IACA8N,EAAA,GAGA,IAAA7S,UAAAxE,OACAyX,EAAAlO,MACA,CACA,IAAAsI,GAAA4F,GACA,MAAA,IAAApT,UAAAiB,EAAA,qEAAAmS,IAEAA,EAAA,GACAA,GAAAlO,GACA,IACAkO,EAAA,GAEAA,EAAAlO,IACAkO,EAAAlO,EAEA,CACA,CAQA,IANAgP,EADAlB,EAAAI,EACAA,EAAAJ,EAEA,EAGAY,GADAzX,EAAA,IAAA4T,KAAA7G,YAAAgL,IACApC,QACApW,EAAA,EAAAA,EAAAwY,EAAAxY,IACAoI,EAAA,GAAApI,EAAAsX,GACAY,EAAA,EAAAlY,GAAAuW,EAAAnO,GACA8P,EAAA,EAAAlY,EAAA,GAAAuW,EAAAnO,EAAA,GAEA,OAAA3H,CACA,IA+BAqH,EAAA4G,GAAAtN,UAAA,QAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACAvW,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAmJ,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACA,GAAAoN,EAAA/K,KAAA2U,EAAAV,GAAAC,EAAAvW,GAAAA,EAAAqU,MACA,OAAA,EAGA,OAAA,CACA,IA6EAlN,EAAAuH,GAAAtN,UAAA,QAAA,SAAAqX,GACA,IAAAvB,EACAX,EACA/M,EACAxJ,EACAqE,EACA,IAAA6R,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAAyE,GACA,MAAA,IAAAnU,UAAAiB,EAAA,oEAAAkT,IAKA,IAHAlC,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACAe,EAAA,GACAlX,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAkX,EAAA5R,KAAAgR,GAAAC,EAAAvW,IAGA,IADAkX,EAAAwB,KAAAD,GACAzY,EAAA,EAAAA,EAAAwJ,EAAAxJ,IAEAuW,EADAlS,EAAA,EAAArE,GACA+V,GAAAmB,EAAAlX,IACAuW,EAAAlS,EAAA,GAAA2R,GAAAkB,EAAAlX,IAEA,OAAAqU,IACA,IA2EAvM,EAAA4G,GAAAtN,UAAA,YAAA,SAAAuX,EAAAjB,GACA,IAAAjQ,EACA8O,EACA/M,EACA,IAAA0M,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAIA,GAFAiS,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACA,IAAA1R,UAAAxE,OACA0Y,EAAA,EACAjB,EAAAlO,MACA,CACA,IAAAsI,GAAA6G,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAQA,GANAA,EAAA,IACAA,GAAAnP,GACA,IACAmP,EAAA,GAGA,IAAAlU,UAAAxE,OACAyX,EAAAlO,MACA,CACA,IAAAsI,GAAA4F,GACA,MAAA,IAAApT,UAAAiB,EAAA,qEAAAmS,IAEAA,EAAA,GACAA,GAAAlO,GACA,IACAkO,EAAA,GAEAA,EAAAlO,IACAkO,EAAAlO,EAEA,CACA,CAWA,OAVAmP,GAAAnP,GACAA,EAAA,EACA/B,EAAA8O,EAAAM,YACA8B,GAAAjB,GACAlO,EAAA,EACA/B,EAAA8O,EAAAb,WAAAiD,EAAA3D,KAEAxL,EAAAkO,EAAAiB,EACAlR,EAAA8O,EAAAb,WAAAiD,EAAA3D,IAEA,IAAAX,KAAA7G,YAAA+I,EAAAd,OAAAhO,EAAA+B,EAAA,EAAA,EAAAA,EACA,IAwBA1B,EAAA4G,GAAAtN,UAAA,kBAAA,SAAAwX,EAAAC,GACA,IAAAC,EACAC,EACAtY,EACA8V,EACAvW,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,GAAA,IAAAG,UAAAxE,OACA8Y,EAAA,OACA,KAAAtP,EAAAmP,KAAAhG,GAAAgG,GAGA,MAAA,IAAAtU,UAAAiB,EAAA,yFAAAqT,IAFAG,EAAAH,CAGA,CACA,GAAAnU,UAAAxE,OAAA,EACA6Y,EAAA,CAAA,MACA,KAAAlO,GAAAiO,GAGA,MAAA,IAAAvU,UAAAiB,EAAA,qEAAAsT,IAFAC,EAAAD,CAGA,CAGA,IAFAtC,EAAAlC,KAAA+B,QACA3V,EAAA,GACAT,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACAS,EAAA6E,KAAAgR,GAAAC,EAAAvW,GAAAgZ,eAAAD,EAAAD,IAEA,OAAArY,EAAAuX,KAAA,IACA,IAmDA7Q,EAAAuH,GAAAtN,UAAA,cAAA,WACA,IAAA8W,EACAzX,EACA+I,EACA+M,EACAvW,EACAqE,EACA,IAAA6R,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAMA,IAJAkF,EAAA6K,KAAA8B,QACA1V,EAAA,IAAA4T,KAAA7G,YAAAhE,GACA+M,EAAAlC,KAAA+B,QACA8B,EAAAzX,EAAA2V,QACApW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAqE,EAAAmF,EAAAxJ,EAAA,EACAkY,EAAA,EAAAlY,GAAAuW,EAAA,EAAAlS,GACA6T,EAAA,EAAAlY,EAAA,GAAAuW,EAAA,EAAAlS,EAAA,GAEA,OAAA5D,CACA,IA6EA0G,EAAAuH,GAAAtN,UAAA,YAAA,SAAAqX,GACA,IAAAvB,EACAX,EACA/M,EACAxJ,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAAyE,GACA,MAAA,IAAAnU,UAAAiB,EAAA,oEAAAkT,IAKA,IAHAlC,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACAe,EAAA,GACAlX,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAkX,EAAA5R,KAAAgR,GAAAC,EAAAvW,IAGA,OADAkX,EAAAwB,KAAAD,GACA,IAAA/J,GAAAwI,EACA,IAoBA/P,EAAAuH,GAAAtN,UAAA,YAAA,WACA,IAAAX,EACA8V,EACAvW,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAIA,IAFA7D,EAAA,GACA8V,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACAS,EAAA6E,KAAAgR,GAAAC,EAAAvW,GAAAgC,YAEA,OAAAvB,EAAAuX,KAAA,IACA,IA0CA7Q,EAAAuH,GAAAtN,UAAA,UAAA,WACA,IAAAoW,EACAxE,EACAxJ,EACAE,EACA6M,EACAvW,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAiBA,OAfA0O,EAAAqB,KACAkC,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QAGAnW,GAAA,EAIA8H,EADA0P,EAAA,CAAA,EACA,QAcA,WAEA,OADAxX,GAAA,EACA0J,GAAA1J,GAAAwJ,EACA,CACAsM,MAAA,GAGA,CACAxV,MAAAgW,GAAAC,EAAAvW,GACA8V,MAAA,EAEA,IAxBAhO,EAAA0P,EAAA,UAiCA,SAAAlX,GAEA,OADAoJ,GAAA,EACAjF,UAAAxE,OACA,CACAK,MAAAA,EACAwV,MAAA,GAGA,CACAA,MAAA,EAEA,IA1CAgB,IACAhP,EAAA0P,EAAAV,IAiDA,WACA,OAAA9D,EAAAiG,QACA,IAjDAzB,CAkDA,IAuCA1P,EAAA4G,GAAAtN,UAAA,QAAA,SAAA8X,EAAA5Y,GACA,IAAAiW,EACA9V,EACA+I,EACA,IAAA0M,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAAwN,GAAAoH,GACA,MAAA,IAAA5U,UAAAiB,EAAA,oEAAA2T,IAMA,GAJA1P,EAAA6K,KAAA8B,QACA+C,EAAA,IACAA,GAAA1P,GAEA0P,EAAA,GAAAA,GAAA1P,EACA,MAAA,IAAAkN,WAAAnR,EAAA,kEAAA2T,IAEA,IAAApE,GAAAxU,GACA,MAAA,IAAAgE,UAAAiB,EAAA,2EAAAjF,IAMA,OAHAiW,GADA9V,EAAA,IAAA4T,KAAA7G,YAAA6G,KAAA+B,UACAA,SACA,EAAA8C,GAAAnD,GAAAzV,GACAiW,EAAA,EAAA2C,EAAA,GAAAlD,GAAA1V,GACAG,CACA,IM15FA,IAAAuU,GAAA,EAAA9G,GAAA8G,kBACAiB,GAAAd,KAYA,SAAAe,GAAA5V,GACA,OACAA,aAAAqO,IAEA,iBAAArO,GACA,OAAAA,IAEA,mBAAAA,EAAAkN,YAAAK,MACA,oBAAAvN,EAAAkN,YAAAK,OAEA,iBAAAvN,EAAA6V,SAGA,iBAAA7V,EAAA8V,OAGA,CASA,SAAAC,GAAA/V,GACA,OACAA,IAAAqO,IAGA,mBAAArO,EAAAuN,IAEA,CAUA,SAAAsL,GAAA5C,EAAAnO,GAEA,OAAA,IAAA8L,GAAAqC,EADAnO,GAAA,GACAmO,EAAAnO,EAAA,GACA,CAyEA,SAAAuG,KACA,IAAA+G,EACAc,EACAD,EACA/M,EAGA,GADAgN,EAAA/R,UAAAxE,SACAoU,gBAAA1F,IACA,OAAA,IAAA6H,EACA,IAAA7H,GAEA,IAAA6H,EACA,IAAA7H,GAAAlK,UAAA,IAEA,IAAA+R,EACA,IAAA7H,GAAAlK,UAAA,GAAAA,UAAA,IAEA,IAAAkK,GAAAlK,UAAA,GAAAA,UAAA,GAAAA,UAAA,IAGA,GAAA,IAAA+R,EACAD,EAAA,IAAArI,GAAA,QACA,GAAA,IAAAsI,EACA,GAAAvE,GAAAxN,UAAA,IACA8R,EAAA,IAAArI,GAAA,EAAAzJ,UAAA,SACA,GAAA6N,GAAA7N,UAAA,IAKA,IAHA+E,GADA+M,EAAA9R,UAAA,IACAxE,SAGAwD,GAAA8S,IAAAzB,GAAAyB,EAAA,KAEA,GADAA,ECxLA,SAAoBA,EAAKpO,GACxB,IAAIqB,EACAc,EACAtK,EACAqE,EAIJ,IAFAmF,EAAMrB,EAAIlI,OACVoE,EAAI,EACErE,EAAI,EAAGA,EAAIwJ,EAAKxJ,IAAM,CAE3B,IAAM8U,GADNxK,EAAInC,EAAKnI,IAER,OAAO,KAERuW,EAAKlS,GAAM8P,GAAM7J,GACjBiM,EAAKlS,EAAE,GAAM+P,GAAM9J,GACnBjG,GAAK,CACL,CACD,OAAOkS,CACR,CDsKAE,CAAA,IAAAvI,GAAA,EAAA1E,GAAA+M,GACA,OAAAA,EAAA,CAEA,IAAAxB,GAAAvL,GACA,MAAA,IAAAkN,WAAAnR,EAAA,6GAAAiE,IAGA+M,EAAA,IAAArI,GAAAzJ,UAAA,GACA,MACA,CACA,GAAAwQ,GAAAsB,GACAA,EAAAI,GAAAJ,EAAA,QACA,GAAArB,GAAAqB,GACAA,EAAAK,GAAAL,EAAA,QACA,IAAAxB,GAAAvL,GACA,MAAA,IAAAkN,WAAAnR,EAAA,6HAAAiE,IAEA+M,EAAA,IAAArI,GAAAqI,EACA,MACA,GAAA9D,GAAAhO,UAAA,IAAA,CAEA,IAAAqN,IADAyE,EAAA9R,UAAA,IACAoS,WAAA7B,IACA,MAAA,IAAA0B,WAAAnR,EAAA,yFAAAyP,GAAAuB,EAAAM,aAEAN,EAAA,IAAArI,GAAAqI,EACA,KAAA,KAAA3L,GAAAnG,UAAA,IAkBA,MAAA,IAAAH,UAAAiB,EAAA,qHAAAd,UAAA,KAhBA,GADA8R,EAAA9R,UAAA,IACA,IAAAwR,GACA,MAAA,IAAA3R,UAAAiB,EAAA,mJAAAgR,IAEA,IAAAvC,GAAAuC,EAAAO,KACA,MAAA,IAAAxS,UAAAiB,EAAA,qHAAAgR,IAGA,IAAAvC,IADAuC,EAAAA,EAAAO,OACAjB,MACA,MAAA,IAAAvR,UAAAiB,EAAA,qHAAAgR,IAGA,IADAA,EAAAZ,GAAAY,cACAxU,MACA,MAAAwU,EAEAA,EAAA,IAAArI,GAAAqI,EAGA,KACA,CAEA,IAAA9D,GADA8D,EAAA9R,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,wEAAAgR,IAGA,IAAAtE,GADAyD,EAAAjR,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,4EAAAmQ,IAEA,IAAA5D,GAAA4D,EAAAV,IACA,MAAA,IAAA0B,WAAAnR,EAAA,uEAAAyP,GAAAU,IAEA,GAAA,IAAAc,EAAA,CAEA,IAAA1E,IADAtI,EAAA+M,EAAAM,WAAAnB,GACAV,IACA,MAAA,IAAA0B,WAAAnR,EAAA,oGAAAyP,GAAAxL,IAEA+M,EAAA,IAAArI,GAAAqI,EAAAb,EACA,KAAA,CAEA,IAAAzD,GADAzI,EAAA/E,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,uEAAAiE,IAEA,GAAAA,EAAAwL,GAAAuB,EAAAM,WAAAnB,EACA,MAAA,IAAAgB,WAAAnR,EAAA,iJAAAiE,EAAAwL,KAEAuB,EAAA,IAAArI,GAAAqI,EAAAb,EAAA,EAAAlM,EACA,CACA,CAIA,OAHA1B,EAAAuM,KAAA,UAAAkC,GACAzO,EAAAuM,KAAA,UAAAkC,EAAAtW,OAAA,GAEAoU,IACA,CEzQA,SAASsB,GAAcC,GACtB,IAAInV,EACA6J,EAGJ,IADA7J,EAAM,KAEL6J,EAAIsL,EAAGC,QACAC,MAGPrV,EAAI6E,KAAMyN,GAASzI,EAAEhK,QAEtB,OAAOG,CACR,CF2QAqH,EAAA6G,GAAA,oBAAAqG,IAeAlN,EAAA6G,GAAA,OAAA,mBAmDAxH,EAAAwH,GAAA,QAAA,SAAAoI,GACA,IAAAC,EACAR,EACAS,EACAxW,EACA8V,EACAW,EACAlQ,EACAwC,EACA2N,EACA7M,EACAtK,EACAqE,EACA,IAAA2P,GAAAK,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA+R,GAAAhC,MACA,MAAA,IAAA/P,UAAA,6DAGA,IADAkS,EAAA/R,UAAAxE,QACA,EAAA,CAEA,IAAA+T,GADAiD,EAAAxS,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,qEAAA0R,IAEAT,EAAA,IACAQ,EAAAvS,UAAA,GAEA,CACA,GAAAyR,GAAAa,GAAA,CAEA,GADAvN,EAAAuN,EAAA9W,OACAgX,EAAA,CAIA,IAFAV,GADA9V,EAAA,IAAA4T,KAAA7K,IACA4M,QACA/R,EAAA,EACArE,EAAA,EAAAA,EAAAwJ,EAAAxJ,IAAA,CAEA,GAAA8U,GADAxK,EAAA2M,EAAA5U,KAAA2U,EAAAD,EAAA/P,IAAAhH,GAAAA,IAEAuW,EAAAlS,GAAA8P,GAAA7J,GACAiM,EAAAlS,EAAA,GAAA+P,GAAA9J,OACA,MAAA6H,GAAA7H,IAAAA,EAAArK,QAAA,GAIA,MAAA,IAAAqE,UAAAiB,EAAA,+IAAA+E,IAHAiM,EAAAlS,GAAAiG,EAAA,GACAiM,EAAAlS,EAAA,GAAAiG,EAAA,EAGA,CACAjG,GAAA,CACA,CACA,OAAA5D,CACA,CACA,OAAA,IAAA4T,KAAA0C,EACA,CACA,GAAAzE,GAAAyE,GAAA,CACA,GAAAE,EAAA,CAUA,IAPAzN,EAAAuN,EAAA9W,OAEA+G,EADA+P,EAAA/P,KAAA+P,EAAA9P,IACA+F,EAAA,WAEAzE,EAAA,WAGAvI,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACA,IAAA8U,GAAA9N,EAAA+P,EAAA/W,IAAA,CACAmX,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAApC,GAAAvL,GACA,MAAA,IAAAkN,WAAAnR,EAAA,gGAAAiE,IAIA,IADA+M,GADA9V,EAAA,IAAA4T,KAAA7K,EAAA,IACA4M,QACApW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAuW,EAAAvW,GAAAiX,EAAA5U,KAAA2U,EAAAhQ,EAAA+P,EAAA/W,GAAAA,GAEA,OAAAS,CACA,CAKA,IAFA8V,GADA9V,EAAA,IAAA4T,KAAA7K,IACA4M,QACA/R,EAAA,EACArE,EAAA,EAAAA,EAAAwJ,EAAAxJ,IAAA,CAEA,GAAA8U,GADAxK,EAAA2M,EAAA5U,KAAA2U,EAAAhQ,EAAA+P,EAAA/W,GAAAA,IAEAuW,EAAAlS,GAAA8P,GAAA7J,GACAiM,EAAAlS,EAAA,GAAA+P,GAAA9J,OACA,MAAA6H,GAAA7H,IAAAA,EAAArK,QAAA,GAIA,MAAA,IAAAqE,UAAAiB,EAAA,+IAAA+E,IAHAiM,EAAAlS,GAAAiG,EAAA,GACAiM,EAAAlS,EAAA,GAAAiG,EAAA,EAGA,CACAjG,GAAA,CACA,CACA,OAAA5D,CACA,CACA,OAAA,IAAA4T,KAAA0C,EACA,CACA,GAAAnM,GAAAmM,IAAAd,IAAAjC,GAAA+C,EAAAD,KAAA,CAEA,IAAA9C,IADAuC,EAAAQ,EAAAD,OACAjB,MACA,MAAA,IAAAvR,UAAAiB,EAAA,6FAAAwR,IAOA,GAJAG,EADAD,EG/bA,SAA0BrB,EAAIqB,EAAMD,GACnC,IAAIvW,EACA6J,EACAiL,EACAvV,EAIJ,IAFAS,EAAM,GACNT,GAAK,IAEJsK,EAAIsL,EAAGC,QACAC,MAKP,GAFA9V,GAAK,EAEAmS,GADLoD,EAAI0B,EAAK5U,KAAM2U,EAAS1M,EAAEhK,MAAON,KACFuV,EAAEtV,QAAU,EAC1CQ,EAAI6E,KAAMiQ,EAAG,GAAKA,EAAG,QACf,KAAKT,GAAeS,GAG1B,OAAO,IAAIjR,UAAWiB,EAAQ,+IAAgJgQ,IAF9K9U,EAAI6E,KAAM6O,GAAMoB,GAAKnB,GAAMmB,GAG3B,CAEF,OAAO9U,CACR,CHwaA2W,CAAAb,EAAAU,EAAAD,GAEArB,GAAAY,GAEAW,aAAAnV,MACA,MAAAmV,EAKA,IADAX,GADA9V,EAAA,IAAA4T,KADA7K,EAAA0N,EAAAjX,OAAA,IAEAmW,QACApW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAuW,EAAAvW,GAAAkX,EAAAlX,GAEA,OAAAS,CACA,CACA,MAAA,IAAA6D,UAAAiB,EAAA,6FAAAwR,GACA,IAoBAjP,EAAA6G,GAAA,MAAA,WACA,IAAAnJ,EACAxF,EACA,IAAAgU,GAAAK,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA+R,GAAAhC,MACA,MAAA,IAAA/P,UAAA,6DAGA,IADAkB,EAAA,GACAxF,EAAA,EAAAA,EAAAyE,UAAAxE,OAAAD,IACAwF,EAAAF,KAAAb,UAAAzE,IAEA,OAAA,IAAAqU,KAAA7O,EACA,IAwDA2B,EAAAwH,GAAAvN,UAAA,MAAA,SAAAgH,GACA,IAAA8N,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAAwN,GAAA1J,GACA,MAAA,IAAA9D,UAAAiB,EAAA,0DAAA6C,IAKA,GAHAA,EAAA,IACAA,GAAAiM,KAAA8B,WAEA/N,EAAA,GAAAA,GAAAiM,KAAA8B,SAGA,OAAAgD,GAAA9E,KAAA+B,QAAAhO,EACA,IAgBAkN,GAAA3G,GAAAvN,UAAA,UAAA,WACA,OAAAiT,KAAA+B,QAAAX,MACA,IAgBAH,GAAA3G,GAAAvN,UAAA,cAAA,WACA,OAAAiT,KAAA+B,QAAAS,UACA,IAgBAvB,GAAA3G,GAAAvN,UAAA,cAAA,WACA,OAAAiT,KAAA+B,QAAAV,UACA,IAiBAvO,EAAAwH,GAAAvN,UAAA,oBAAAuN,GAAAqG,mBAuCAlN,EAAA6G,GAAAvN,UAAA,cAAA,SAAAiW,EAAAC,GACA,IAAApB,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAQA,OALA,IAAAG,UAAAxE,OACAoU,KAAA+B,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,GAEAjD,KAAA+B,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,EAAA,EAAA7S,UAAA,IAEA4P,IACA,IAqCAlN,EAAAwH,GAAAvN,UAAA,WAAA,WACA,IAAAqU,EACAzC,EACAwE,EACAhO,EACAE,EACA1J,EACAqE,EACA,IAAA6R,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAkBA,OAhBA0O,EAAAqB,KACAoB,EAAApB,KAAA+B,QACA5M,EAAA6K,KAAA8B,QAGAnW,GAAA,EACAqE,GAAA,EAIAyD,EADA0P,EAAA,CAAA,EACA,QAcA,WACA,IAAAjC,EAEA,OADAvV,GAAA,EACA0J,GAAA1J,GAAAwJ,EACA,CACAsM,MAAA,IAIAP,EAAA,IAAArB,GAAAuB,EADApR,GAAA,GACAoR,EAAApR,EAAA,IACA,CACA/D,MAAA,CAAAN,EAAAuV,GACAO,MAAA,GAEA,IA3BAhO,EAAA0P,EAAA,UAoCA,SAAAlX,GAEA,OADAoJ,GAAA,EACAjF,UAAAxE,OACA,CACAK,MAAAA,EACAwV,MAAA,GAGA,CACAA,MAAA,EAEA,IA7CAgB,IACAhP,EAAA0P,EAAAV,IAoDA,WACA,OAAA9D,EAAAyE,SACA,IApDAD,CAqDA,IA+BA1P,EAAA6G,GAAAvN,UAAA,SAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACAvW,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAmJ,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACA,IAAAoN,EAAA/K,KAAA2U,EAAAmC,GAAA5C,EAAAvW,GAAAA,EAAAqU,MACA,OAAA,EAGA,OAAA,CACA,IA2CAvM,EAAA6G,GAAAvN,UAAA,QAAA,SAAAd,EAAAgX,EAAAI,GACA,IAAAnB,EACA/M,EACApB,EACAmM,EACAC,EACAxU,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAAwQ,GAAAxU,GACA,MAAA,IAAAgE,UAAAiB,EAAA,0EAAAjF,IAIA,GAFAiW,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACA1R,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAAwF,GACA,MAAA,IAAAhT,UAAAiB,EAAA,qEAAA+R,IAQA,GANAA,EAAA,IACAA,GAAA9N,GACA,IACA8N,EAAA,GAGA7S,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAA4F,GACA,MAAA,IAAApT,UAAAiB,EAAA,oEAAAmS,IAEAA,EAAA,IACAA,GAAAlO,GACA,IACAkO,EAAA,GAGAA,EAAAlO,IACAkO,EAAAlO,EAEA,MACAkO,EAAAlO,CAEA,MACA8N,EAAA,EACAI,EAAAlO,EAIA,IAFA+K,EAAAJ,GAAA7T,GACAkU,EAAAJ,GAAA9T,GACAN,EAAAsX,EAAAtX,EAAA0X,EAAA1X,IAEAuW,EADAnO,EAAA,EAAApI,GACAuU,EACAgC,EAAAnO,EAAA,GAAAoM,EAEA,OAAAH,IACA,IA2CAvM,EAAA6G,GAAAvN,UAAA,UAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACA9V,EACAT,EACAuV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAIA,IAFAmJ,EAAAlC,KAAA+B,QACA3V,EAAA,GACAT,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACAuV,EAAA4D,GAAA5C,EAAAvW,GACAoN,EAAA/K,KAAA2U,EAAAzB,EAAAvV,EAAAqU,OACA5T,EAAA6E,KAAAiQ,GAGA,OAAA,IAAAlB,KAAA7G,YAAA/M,EACA,IAqCAqH,EAAA6G,GAAAvN,UAAA,QAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACAvW,EACAuV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAmJ,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IAEA,GADAuV,EAAA4D,GAAA5C,EAAAvW,GACAoN,EAAA/K,KAAA2U,EAAAzB,EAAAvV,EAAAqU,MACA,OAAAkB,CAGA,IA+BAzN,EAAA6G,GAAAvN,UAAA,aAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACAvW,EACAuV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAmJ,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IAEA,GADAuV,EAAA4D,GAAA5C,EAAAvW,GACAoN,EAAA/K,KAAA2U,EAAAzB,EAAAvV,EAAAqU,MACA,OAAArU,EAGA,OAAA,CACA,IAqCA8H,EAAA6G,GAAAvN,UAAA,YAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACAvW,EACAuV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAmJ,EAAAlC,KAAA+B,QACApW,EAAAqU,KAAA8B,QAAA,EAAAnW,GAAA,EAAAA,IAEA,GADAuV,EAAA4D,GAAA5C,EAAAvW,GACAoN,EAAA/K,KAAA2U,EAAAzB,EAAAvV,EAAAqU,MACA,OAAAkB,CAGA,IA+BAzN,EAAA6G,GAAAvN,UAAA,iBAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACAvW,EACAuV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAmJ,EAAAlC,KAAA+B,QACApW,EAAAqU,KAAA8B,QAAA,EAAAnW,GAAA,EAAAA,IAEA,GADAuV,EAAA4D,GAAA5C,EAAAvW,GACAoN,EAAA/K,KAAA2U,EAAAzB,EAAAvV,EAAAqU,MACA,OAAArU,EAGA,OAAA,CACA,IA4BA8H,EAAA6G,GAAAvN,UAAA,WAAA,SAAAuW,EAAAX,GACA,IAAAT,EACAvW,EACAuV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAA2D,GACA,MAAA,IAAArT,UAAAiB,EAAA,oEAAAoS,IAGA,IADApB,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACAuV,EAAA4D,GAAA5C,EAAAvW,GACA2X,EAAAtV,KAAA2U,EAAAzB,EAAAvV,EAAAqU,KAEA,IAyCAlN,EAAAwH,GAAAvN,UAAA,OAAA,SAAAgH,GACA,IAAA8N,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA2N,GAAA7J,GACA,MAAA,IAAA9D,UAAAiB,EAAA,qEAAA6C,IAEA,KAAAA,GAAAiM,KAAA8B,SAGA,OAAAgD,GAAA9E,KAAA+B,QAAAhO,EACA,IAgBAkN,GAAA3G,GAAAvN,UAAA,UAAA,WACA,OAAAiT,KAAA8B,OACA,IAmCArO,EAAA6G,GAAAvN,UAAA,YAAA,SAAAwW,EAAAC,GACA,IAAAtB,EACAnO,EACAmM,EACAC,EACAxU,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAAwQ,GAAA8C,GACA,MAAA,IAAAtT,UAAAiB,EAAA,0EAAAqS,IAEA,GAAAnT,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAA+F,GACA,MAAA,IAAAvT,UAAAiB,EAAA,qEAAAsS,IAEAA,EAAA,IACAA,GAAAxD,KAAA8B,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAtD,EAAAJ,GAAAyD,GACApD,EAAAJ,GAAAwD,GACArB,EAAAlC,KAAA+B,QACApW,EAAA6X,EAAA7X,EAAAqU,KAAA8B,QAAAnW,IAEA,GAAAuU,IAAAgC,EADAnO,EAAA,EAAApI,IACAwU,IAAA+B,EAAAnO,EAAA,GACA,OAAA,EAGA,OAAA,CACA,IAmCAN,EAAA6G,GAAAvN,UAAA,WAAA,SAAAwW,EAAAC,GACA,IAAAtB,EACAnO,EACAmM,EACAC,EACAxU,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAAwQ,GAAA8C,GACA,MAAA,IAAAtT,UAAAiB,EAAA,0EAAAqS,IAEA,GAAAnT,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAA+F,GACA,MAAA,IAAAvT,UAAAiB,EAAA,qEAAAsS,IAEAA,EAAA,IACAA,GAAAxD,KAAA8B,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAtD,EAAAJ,GAAAyD,GACApD,EAAAJ,GAAAwD,GACArB,EAAAlC,KAAA+B,QACApW,EAAA6X,EAAA7X,EAAAqU,KAAA8B,QAAAnW,IAEA,GAAAuU,IAAAgC,EADAnO,EAAA,EAAApI,IACAwU,IAAA+B,EAAAnO,EAAA,GACA,OAAApI,EAGA,OAAA,CACA,IAyBAmH,EAAAwH,GAAAvN,UAAA,QAAA,SAAA0W,GACA,IAAArX,EACA8V,EACAwB,EACA/X,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,GAAA,IAAAG,UAAAxE,OACA8X,EAAA,QACA,KAAAtO,GAAAqO,GAGA,MAAA,IAAAxT,UAAAiB,EAAA,kEAAAuS,IAFAC,EAAAD,CAGA,CAGA,IAFArX,EAAA,GACA8V,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACAS,EAAA6E,KAAA6T,GAAA5C,EAAAvW,GAAAgC,YAEA,OAAAvB,EAAAuX,KAAAD,EACA,IA4BA5Q,EAAAwH,GAAAvN,UAAA,QAAA,WACA,IAAA4R,EACAwE,EACAhO,EACAE,EACA1J,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAgBA,OAdA0O,EAAAqB,KACA7K,EAAA6K,KAAA8B,QAGAnW,GAAA,EAIA8H,EADA0P,EAAA,CAAA,EACA,QAcA,WAEA,OADAxX,GAAA,EACA0J,GAAA1J,GAAAwJ,EACA,CACAsM,MAAA,GAGA,CACAxV,MAAAN,EACA8V,MAAA,EAEA,IAxBAhO,EAAA0P,EAAA,UAiCA,SAAAlX,GAEA,OADAoJ,GAAA,EACAjF,UAAAxE,OACA,CACAK,MAAAA,EACAwV,MAAA,GAGA,CACAA,MAAA,EAEA,IA1CAgB,IACAhP,EAAA0P,EAAAV,IAiDA,WACA,OAAA9D,EAAAiF,MACA,IAjDAT,CAkDA,IAsCA1P,EAAA6G,GAAAvN,UAAA,eAAA,SAAAwW,EAAAC,GACA,IAAAtB,EACAnO,EACAmM,EACAC,EACAxU,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAAwQ,GAAA8C,GACA,MAAA,IAAAtT,UAAAiB,EAAA,0EAAAqS,IAEA,GAAAnT,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAA+F,GACA,MAAA,IAAAvT,UAAAiB,EAAA,qEAAAsS,IAEAA,GAAAxD,KAAA8B,QACA0B,EAAAxD,KAAA8B,QAAA,EACA0B,EAAA,IACAA,GAAAxD,KAAA8B,QAEA,MACA0B,EAAAxD,KAAA8B,QAAA,EAKA,IAHA5B,EAAAJ,GAAAyD,GACApD,EAAAJ,GAAAwD,GACArB,EAAAlC,KAAA+B,QACApW,EAAA6X,EAAA7X,GAAA,EAAAA,IAEA,GAAAuU,IAAAgC,EADAnO,EAAA,EAAApI,IACAwU,IAAA+B,EAAAnO,EAAA,GACA,OAAApI,EAGA,OAAA,CACA,IAyCA8H,EAAA6G,GAAAvN,UAAA,OAAA,SAAAuW,EAAAX,GACA,IAAAkB,EACA3B,EACA9V,EACAT,EACAsK,EACA,IAAA4L,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAA2D,GACA,MAAA,IAAArT,UAAAiB,EAAA,oEAAAoS,IAKA,IAHApB,EAAAlC,KAAA+B,QAEA8B,GADAzX,EAAA,IAAA4T,KAAA7G,YAAA6G,KAAA8B,UACAC,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IAEA,GAAA8U,GADAxK,EAAAqN,EAAAtV,KAAA2U,EAAAmC,GAAA5C,EAAAvW,GAAAA,EAAAqU,OAEA6D,EAAA,EAAAlY,GAAAmU,GAAA7J,GACA4N,EAAA,EAAAlY,EAAA,GAAAoU,GAAA9J,OACA,KAAA6H,GAAA7H,IAAA,IAAAA,EAAArK,OAIA,MAAA,IAAAqE,UAAAiB,EAAA,+IAAA+E,IAHA4N,EAAA,EAAAlY,GAAAsK,EAAA,GACA4N,EAAA,EAAAlY,EAAA,GAAAsK,EAAA,EAGA,CAEA,OAAA7J,CACA,IAmCAqH,EAAA6G,GAAAvN,UAAA,UAAA,SAAA+W,EAAAC,GACA,IAAA7B,EACA8B,EACA7O,EAEAxJ,EAEA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAAmE,GACA,MAAA,IAAA7T,UAAAiB,EAAA,oEAAA4S,IAIA,GAFA5B,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACA1R,UAAAxE,OAAA,EACAoY,EAAAD,EACApY,EAAA,MACA,CACA,GAAA,IAAAwJ,EACA,MAAA,IAAAzH,MAAA,oGAEAsW,EAAAc,GAAA5C,EAAA,GACAvW,EAAA,CACA,CACA,KAAAA,EAAAwJ,EAAAxJ,IAEAqY,EAAAF,EAAAE,EADAc,GAAA5C,EAAAvW,GACAA,EAAAqU,MAEA,OAAAgE,CACA,IAmCAvQ,EAAA6G,GAAAvN,UAAA,eAAA,SAAA+W,EAAAC,GACA,IAAA7B,EACA8B,EACA7O,EAEAxJ,EAEA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAAmE,GACA,MAAA,IAAA7T,UAAAiB,EAAA,oEAAA4S,IAIA,GAFA5B,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACA1R,UAAAxE,OAAA,EACAoY,EAAAD,EACApY,EAAAwJ,EAAA,MACA,CACA,GAAA,IAAAA,EACA,MAAA,IAAAzH,MAAA,oGAEAsW,EAAAc,GAAA5C,EAAA/M,EAAA,GACAxJ,EAAAwJ,EAAA,CACA,CACA,KAAAxJ,GAAA,EAAAA,IAEAqY,EAAAF,EAAAE,EADAc,GAAA5C,EAAAvW,GACAA,EAAAqU,MAEA,OAAAgE,CACA,IAmDAlR,EAAAwH,GAAAvN,UAAA,WAAA,WACA,IAAAmV,EACAW,EACA1N,EACA8O,EACAtY,EACAqE,EACA,IAAA6R,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAKA,IAHAkF,EAAA6K,KAAA8B,QACAI,EAAAlC,KAAA+B,QACAkC,EAAAzG,GAAArI,EAAA,GACAxJ,EAAA,EAAAA,EAAAsY,EAAAtY,IACAqE,EAAAmF,EAAAxJ,EAAA,EACAkX,EAAAX,EAAA,EAAAvW,GACAuW,EAAA,EAAAvW,GAAAuW,EAAA,EAAAlS,GACAkS,EAAA,EAAAlS,GAAA6S,EACAA,EAAAX,EAAA,EAAAvW,EAAA,GACAuW,EAAA,EAAAvW,EAAA,GAAAuW,EAAA,EAAAlS,EAAA,GACAkS,EAAA,EAAAlS,EAAA,GAAA6S,EAEA,OAAA7C,IACA,IAgEAlN,EAAAwH,GAAAvN,UAAA,OAAA,SAAAd,GAEA,IAAAiY,EACAnQ,EACAmO,EACAW,EACAC,EACAmB,EACAhO,EACAtK,EACAqE,EACA,IAAA6R,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAGA,GADAiS,EAAAlC,KAAA+B,QACA3R,UAAAxE,OAAA,GAEA,IAAAgS,GADA7J,EAAA3D,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,+EAAA6C,SAGAA,EAAA,EAEA,GAAA0M,GAAAxU,GAAA,CACA,GAAA8H,GAAAiM,KAAA8B,QACA,MAAA,IAAAO,WAAAnR,EAAA,kEAAA6C,IAKA,OAFAmO,EADAnO,GAAA,GACA+L,GAAA7T,QACAiW,EAAAnO,EAAA,GAAAgM,GAAA9T,GAEA,CACA,GAAA4V,GAAA5V,GAAA,CAEA,GAAA8H,GADAkQ,EAAAhY,EAAA6V,SACA9B,KAAA8B,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA6B,EAAAjY,EAAA8V,QAGA/R,EAAAkS,EAAAb,WAAAtN,EAAA4M,GAEAuD,EAAA9C,SAAAc,EAAAd,QAEA8C,EAAA7C,WAAArR,GACAkU,EAAA7C,WAAA6C,EAAA1B,WAAAxS,EAEA,CAGA,IADA6S,EAAA,IAAAhJ,GAAAqK,EAAAtY,QACAD,EAAA,EAAAA,EAAAuY,EAAAtY,OAAAD,IACAkX,EAAAlX,GAAAuY,EAAAvY,GAEAuY,EAAArB,CACA,CAGA,IAFA9O,GAAA,EACA/D,EAAA,EACArE,EAAA,EAAAA,EAAAsY,EAAAtY,IACAuW,EAAAnO,GAAAmQ,EAAAlU,GACAkS,EAAAnO,EAAA,GAAAmQ,EAAAlU,EAAA,GACA+D,GAAA,EACA/D,GAAA,CAGA,KAhCA,CAiCA,IAAAiO,GAAAhS,GA2DA,MAAA,IAAAgE,UAAAiB,EAAA,kIAAAjF,IAxDA,IADAgY,EAAAhY,EAAAL,OACAD,EAAA,EAAAA,EAAAsY,EAAAtY,IACA,IAAA8U,GAAAxU,EAAAN,IAAA,CACAmX,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAApC,GAAAuD,GACA,MAAA,IAAA5B,WAAAnR,EAAA,6GAAA+S,IAEA,GAAAlQ,EAAAkQ,EAAA,EAAAjE,KAAA8B,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA6B,EAAAjY,EAGA+D,EAAAkS,EAAAb,WAAAtN,EAAA4M,GAEAuD,EAAA9C,SAAAc,EAAAd,QAEA8C,EAAA7C,WAAArR,GACAkU,EAAA7C,WAAA6C,EAAA1B,WAAAxS,EAEA,CAGA,IADA6S,EAAA,IAAAhJ,GAAAoK,GACAtY,EAAA,EAAAA,EAAAsY,EAAAtY,IACAkX,EAAAlX,GAAAuY,EAAAvY,GAEAuY,EAAArB,CACA,CAIA,IAHA9O,GAAA,EACAkQ,GAAA,EACAjU,EAAA,EACArE,EAAA,EAAAA,EAAAsY,EAAAtY,IACAuW,EAAAnO,GAAAmQ,EAAAlU,GACAkS,EAAAnO,EAAA,GAAAmQ,EAAAlU,EAAA,GACA+D,GAAA,EACA/D,GAAA,EAEA,MACA,CAEA,GAAA+D,EAAAkQ,EAAAjE,KAAA8B,QACA,MAAA,IAAAO,WAAA,0FAGA,IADAtO,GAAA,EACApI,EAAA,EAAAA,EAAAsY,EAAAtY,IACAsK,EAAAhK,EAAAN,GACAuW,EAAAnO,GAAA+L,GAAA7J,GACAiM,EAAAnO,EAAA,GAAAgM,GAAA9J,GACAlC,GAAA,CAxDA,CA+DA,IA2EAN,EAAA6G,GAAAvN,UAAA,SAAA,SAAAkW,EAAAI,GACA,IAAAc,EACAN,EACAzX,EACA2H,EACAmO,EACA/M,EACAxJ,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAIA,GAFAiS,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACA,IAAA1R,UAAAxE,OACAqX,EAAA,EACAI,EAAAlO,MACA,CACA,IAAAsI,GAAAwF,GACA,MAAA,IAAAhT,UAAAiB,EAAA,oEAAA+R,IAQA,GANAA,EAAA,IACAA,GAAA9N,GACA,IACA8N,EAAA,GAGA,IAAA7S,UAAAxE,OACAyX,EAAAlO,MACA,CACA,IAAAsI,GAAA4F,GACA,MAAA,IAAApT,UAAAiB,EAAA,qEAAAmS,IAEAA,EAAA,GACAA,GAAAlO,GACA,IACAkO,EAAA,GAEAA,EAAAlO,IACAkO,EAAAlO,EAEA,CACA,CAQA,IANAgP,EADAlB,EAAAI,EACAA,EAAAJ,EAEA,EAGAY,GADAzX,EAAA,IAAA4T,KAAA7G,YAAAgL,IACApC,QACApW,EAAA,EAAAA,EAAAwY,EAAAxY,IACAoI,EAAA,GAAApI,EAAAsX,GACAY,EAAA,EAAAlY,GAAAuW,EAAAnO,GACA8P,EAAA,EAAAlY,EAAA,GAAAuW,EAAAnO,EAAA,GAEA,OAAA3H,CACA,IA+BAqH,EAAA6G,GAAAvN,UAAA,QAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACAvW,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAmJ,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACA,GAAAoN,EAAA/K,KAAA2U,EAAAmC,GAAA5C,EAAAvW,GAAAA,EAAAqU,MACA,OAAA,EAGA,OAAA,CACA,IA6EAlN,EAAAwH,GAAAvN,UAAA,QAAA,SAAAqX,GACA,IAAAvB,EACAX,EACA/M,EACAxJ,EACAqE,EACA,IAAA6R,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAAyE,GACA,MAAA,IAAAnU,UAAAiB,EAAA,oEAAAkT,IAKA,IAHAlC,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACAe,EAAA,GACAlX,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAkX,EAAA5R,KAAA6T,GAAA5C,EAAAvW,IAGA,IADAkX,EAAAwB,KAAAD,GACAzY,EAAA,EAAAA,EAAAwJ,EAAAxJ,IAEAuW,EADAlS,EAAA,EAAArE,GACAmU,GAAA+C,EAAAlX,IACAuW,EAAAlS,EAAA,GAAA+P,GAAA8C,EAAAlX,IAEA,OAAAqU,IACA,IA2EAvM,EAAA6G,GAAAvN,UAAA,YAAA,SAAAuX,EAAAjB,GACA,IAAAjQ,EACA8O,EACA/M,EACA,IAAA0M,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAIA,GAFAiS,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACA,IAAA1R,UAAAxE,OACA0Y,EAAA,EACAjB,EAAAlO,MACA,CACA,IAAAsI,GAAA6G,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAQA,GANAA,EAAA,IACAA,GAAAnP,GACA,IACAmP,EAAA,GAGA,IAAAlU,UAAAxE,OACAyX,EAAAlO,MACA,CACA,IAAAsI,GAAA4F,GACA,MAAA,IAAApT,UAAAiB,EAAA,qEAAAmS,IAEAA,EAAA,GACAA,GAAAlO,GACA,IACAkO,EAAA,GAEAA,EAAAlO,IACAkO,EAAAlO,EAEA,CACA,CAWA,OAVAmP,GAAAnP,GACAA,EAAA,EACA/B,EAAA8O,EAAAM,YACA8B,GAAAjB,GACAlO,EAAA,EACA/B,EAAA8O,EAAAb,WAAAiD,EAAA3D,KAEAxL,EAAAkO,EAAAiB,EACAlR,EAAA8O,EAAAb,WAAAiD,EAAA3D,IAEA,IAAAX,KAAA7G,YAAA+I,EAAAd,OAAAhO,EAAA+B,EAAA,EAAA,EAAAA,EACA,IAwBA1B,EAAA6G,GAAAvN,UAAA,kBAAA,SAAAwX,EAAAC,GACA,IAAAC,EACAC,EACAtY,EACA8V,EACAvW,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,GAAA,IAAAG,UAAAxE,OACA8Y,EAAA,OACA,KAAAtP,GAAAmP,KAAAhG,GAAAgG,GAGA,MAAA,IAAAtU,UAAAiB,EAAA,yFAAAqT,IAFAG,EAAAH,CAGA,CACA,GAAAnU,UAAAxE,OAAA,EACA6Y,EAAA,CAAA,MACA,KAAAlO,GAAAiO,GAGA,MAAA,IAAAvU,UAAAiB,EAAA,qEAAAsT,IAFAC,EAAAD,CAGA,CAGA,IAFAtC,EAAAlC,KAAA+B,QACA3V,EAAA,GACAT,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACAS,EAAA6E,KAAA6T,GAAA5C,EAAAvW,GAAAgZ,eAAAD,EAAAD,IAEA,OAAArY,EAAAuX,KAAA,IACA,IAmDA7Q,EAAAwH,GAAAvN,UAAA,cAAA,WACA,IAAA8W,EACAzX,EACA+I,EACA+M,EACAvW,EACAqE,EACA,IAAA6R,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAMA,IAJAkF,EAAA6K,KAAA8B,QACA1V,EAAA,IAAA4T,KAAA7G,YAAAhE,GACA+M,EAAAlC,KAAA+B,QACA8B,EAAAzX,EAAA2V,QACApW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAqE,EAAAmF,EAAAxJ,EAAA,EACAkY,EAAA,EAAAlY,GAAAuW,EAAA,EAAAlS,GACA6T,EAAA,EAAAlY,EAAA,GAAAuW,EAAA,EAAAlS,EAAA,GAEA,OAAA5D,CACA,IA6EA0G,EAAAwH,GAAAvN,UAAA,YAAA,SAAAqX,GACA,IAAAvB,EACAX,EACA/M,EACAxJ,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA0P,GAAAyE,GACA,MAAA,IAAAnU,UAAAiB,EAAA,oEAAAkT,IAKA,IAHAlC,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACAe,EAAA,GACAlX,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAkX,EAAA5R,KAAA6T,GAAA5C,EAAAvW,IAGA,OADAkX,EAAAwB,KAAAD,GACA,IAAA9J,GAAAuI,EACA,IAoBA/P,EAAAwH,GAAAvN,UAAA,YAAA,WACA,IAAAX,EACA8V,EACAvW,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAIA,IAFA7D,EAAA,GACA8V,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACAS,EAAA6E,KAAA6T,GAAA5C,EAAAvW,GAAAgC,YAEA,OAAAvB,EAAAuX,KAAA,IACA,IA2CA7Q,EAAAwH,GAAAvN,UAAA,UAAA,WACA,IAAAoW,EACAxE,EACAxJ,EACAE,EACA6M,EACAvW,EACA,IAAAkW,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAiBA,OAfA0O,EAAAqB,KACAkC,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QAGAnW,GAAA,EAIA8H,EADA0P,EAAA,CAAA,EACA,QAcA,WAEA,OADAxX,GAAA,EACA0J,GAAA1J,GAAAwJ,EACA,CACAsM,MAAA,GAGA,CACAxV,MAAA6Y,GAAA5C,EAAAvW,GACA8V,MAAA,EAEA,IAxBAhO,EAAA0P,EAAA,UAiCA,SAAAlX,GAEA,OADAoJ,GAAA,EACAjF,UAAAxE,OACA,CACAK,MAAAA,EACAwV,MAAA,GAGA,CACAA,MAAA,EAEA,IA1CAgB,IACAhP,EAAA0P,EAAAV,IAiDA,WACA,OAAA9D,EAAAiG,QACA,IAjDAzB,CAkDA,IAuCA1P,EAAA6G,GAAAvN,UAAA,QAAA,SAAA8X,EAAA5Y,GACA,IAAAiW,EACA9V,EACA+I,EACA,IAAA0M,GAAA7B,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAAwN,GAAAoH,GACA,MAAA,IAAA5U,UAAAiB,EAAA,oEAAA2T,IAMA,GAJA1P,EAAA6K,KAAA8B,QACA+C,EAAA,IACAA,GAAA1P,GAEA0P,EAAA,GAAAA,GAAA1P,EACA,MAAA,IAAAkN,WAAAnR,EAAA,kEAAA2T,IAEA,IAAApE,GAAAxU,GACA,MAAA,IAAAgE,UAAAiB,EAAA,2EAAAjF,IAMA,OAHAiW,GADA9V,EAAA,IAAA4T,KAAA7G,YAAA6G,KAAA+B,UACAA,SACA,EAAA8C,GAAA/E,GAAA7T,GACAiW,EAAA,EAAA2C,EAAA,GAAA9E,GAAA9T,GACAG,CACA,IIt6FA,IAAAuU,GAAAxG,GAAAwG,kBACAiB,GAAAd,KAYA,SAAAiE,GAAA9Y,GACA,MACA,iBAAAA,GACA,OAAAA,GACA,iBAAAA,EAAAkN,YAAAK,MACAvN,EAAA0U,oBAAAA,EAEA,CASA,SAAAqE,GAAA/Y,GACA,OAAAA,IAAAsO,EACA,CAoEA,SAAAA,KACA,IAAA8G,EACAc,EACAD,EACA/M,EACA5H,EAGA,GADA4U,EAAA/R,UAAAxE,SACAoU,gBAAAzF,IACA,OAAA,IAAA4H,EACA,IAAA5H,GAEA,IAAA4H,EACA,IAAA5H,GAAAnK,UAAA,IAEA,IAAA+R,EACA,IAAA5H,GAAAnK,UAAA,GAAAA,UAAA,IAEA,IAAAmK,GAAAnK,UAAA,GAAAA,UAAA,GAAAA,UAAA,IAGA,GAAA,IAAA+R,EACAD,EAAA,IAAA/H,GAAA,QACA,GAAA,IAAAgI,EAEA,GAAAvE,GADArQ,EAAA6C,UAAA,IAEA8R,EAAA,IAAA/H,GAAA5M,QACA,GAAA0Q,GAAA1Q,GACA2U,EC9IA,SAAoBA,EAAKpO,GACxB,IAAIqB,EACAxJ,EAGJ,IADAwJ,EAAMrB,EAAIlI,OACJD,EAAI,EAAGA,EAAIwJ,EAAKxJ,IACrBuW,EAAKvW,GAAM+S,GAAS5K,EAAKnI,IAE1B,OAAOuW,CACR,CDqIAE,CAAA,IAAAjI,GAAA5M,EAAA3B,QAAA2B,QACA,GAAA6Q,GAAA7Q,GACA2U,EAAA,IAAA/H,GAAA5M,OACA,KAAAgJ,GAAAhJ,GAaA,MAAA,IAAA0C,UAAAiB,EAAA,qHAAA3D,IAZA,IAAA,IAAAqU,GACA,MAAA,IAAA3R,UAAAiB,EAAA,mJAAA3D,IAEA,IAAAoS,GAAApS,EAAAkV,KACA,MAAA,IAAAxS,UAAAiB,EAAA,qHAAA3D,IAGA,IAAAoS,IADAuC,EAAA3U,EAAAkV,OACAjB,MACA,MAAA,IAAAvR,UAAAiB,EAAA,qHAAA3D,IAEA2U,EAAA,IAAA/H,GAAAmH,GAAAY,GAGA,KACA,CAEA,IAAA9D,GADA8D,EAAA9R,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,wEAAAgR,IAGA,IAAAtE,GADAyD,EAAAjR,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,4EAAAmQ,IAEA,GAAA,IAAAc,EACAD,EAAA,IAAA/H,GAAA+H,EAAAb,OACA,CAEA,IAAAzD,GADAzI,EAAA/E,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,uEAAAiE,IAEA,GAAAA,EAAAwL,GAAAuB,EAAAM,WAAAnB,EACA,MAAA,IAAAgB,WAAAnR,EAAA,iJAAAiE,EAAAwL,KAEAuB,EAAA,IAAA/H,GAAA+H,EAAAb,EAAAlM,EACA,CACA,CAIA,OAHA1B,EAAAuM,KAAA,UAAAkC,GACAzO,EAAAuM,KAAA,UAAAkC,EAAAtW,QAEAoU,IACA,CAeAvM,EAAA8G,GAAA,oBAAAoG,IAeAlN,EAAA8G,GAAA,OAAA,gBAmCAzH,EAAAyH,GAAA,QAAA,SAAAmI,GACA,IAAAC,EACAR,EACAS,EACAxW,EACA8V,EACAW,EACAlQ,EACAwC,EACAxJ,EACA,IAAAgU,GAAAK,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA+U,GAAAhF,MACA,MAAA,IAAA/P,UAAA,sDAGA,IADAkS,EAAA/R,UAAAxE,QACA,EAAA,CAEA,IAAA+T,GADAiD,EAAAxS,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,qEAAA0R,IAEAT,EAAA,IACAQ,EAAAvS,UAAA,GAEA,CACA,GAAA6N,GAAAyE,GAAA,CACA,GAAAE,EAAA,CASA,IARAzN,EAAAuN,EAAA9W,OAEA+G,EADA+P,EAAA/P,KAAA+P,EAAA9P,IACA+F,EAAA,WAEAzE,EAAA,WAGAgO,GADA9V,EAAA,IAAA4T,KAAA7K,IACA4M,QACApW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAuW,EAAAvW,GAAA+S,GAAAkE,EAAA5U,KAAA2U,EAAAhQ,EAAA+P,EAAA/W,GAAAA,IAEA,OAAAS,CACA,CACA,OAAA,IAAA4T,KAAA0C,EACA,CACA,GAAAnM,GAAAmM,IAAAd,IAAAjC,GAAA+C,EAAAD,KAAA,CAEA,IAAA9C,IADAuC,EAAAQ,EAAAD,OACAjB,MACA,MAAA,IAAAvR,UAAAiB,EAAA,6FAAAwR,IAUA,IAPAG,EADAD,EE1SA,SAA0BrB,EAAIqB,EAAMD,GACnC,IAAIvW,EACA6J,EACAtK,EAIJ,IAFAS,EAAM,GACNT,GAAK,IAEJsK,EAAIsL,EAAGC,QACAC,MAGP9V,GAAK,EACLS,EAAI6E,KAAMyN,GAASkE,EAAK5U,KAAM2U,EAAS1M,EAAEhK,MAAON,KAEjD,OAAOS,CACR,CF2RA2W,CAAAb,EAAAU,EAAAD,GAEArB,GAAAY,GAIAA,GADA9V,EAAA,IAAA4T,KADA7K,EAAA0N,EAAAjX,SAEAmW,QACApW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAuW,EAAAvW,GAAAkX,EAAAlX,GAEA,OAAAS,CACA,CACA,MAAA,IAAA6D,UAAAiB,EAAA,6FAAAwR,GACA,IAoBAjP,EAAA8G,GAAA,MAAA,WACA,IAAApJ,EACAxF,EACA,IAAAgU,GAAAK,MACA,MAAA,IAAA/P,UAAA,6DAEA,IAAA+U,GAAAhF,MACA,MAAA,IAAA/P,UAAA,sDAGA,IADAkB,EAAA,GACAxF,EAAA,EAAAA,EAAAyE,UAAAxE,OAAAD,IACAwF,EAAAF,KAAAb,UAAAzE,IAEA,OAAA,IAAAqU,KAAA7O,EACA,IA6BA2B,EAAAyH,GAAAxN,UAAA,MAAA,SAAAgH,GACA,IAAAmO,EACA/M,EAEA,IAAA4P,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,IAAAwN,GAAA1J,GACA,MAAA,IAAA9D,UAAAiB,EAAA,0DAAA6C,IAOA,GALAoB,EAAA6K,KAAA8B,QACAI,EAAAlC,KAAA+B,QACAhO,EAAA,IACAA,GAAAoB,KAEApB,EAAA,GAAAA,GAAAoB,GAGA,OAAAuJ,GAAAwD,EAAAnO,GACA,IAgBAkN,GAAA1G,GAAAxN,UAAA,UAAA,WACA,OAAAiT,KAAA+B,QAAAX,MACA,IAgBAH,GAAA1G,GAAAxN,UAAA,cAAA,WACA,OAAAiT,KAAA+B,QAAAS,UACA,IAgBAvB,GAAA1G,GAAAxN,UAAA,cAAA,WACA,OAAAiT,KAAA+B,QAAAV,UACA,IAiBAvO,EAAAyH,GAAAxN,UAAA,oBAAAwN,GAAAoG,mBA+BAlN,EAAA8G,GAAAxN,UAAA,cAAA,SAAAiW,EAAAC,GACA,IAAA8B,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAQA,OALA,IAAAG,UAAAxE,OACAoU,KAAA+B,QAAAmB,WAAAF,EAAAC,GAEAjD,KAAA+B,QAAAmB,WAAAF,EAAAC,EAAA7S,UAAA,IAEA4P,IACA,IAgCAlN,EAAAyH,GAAAxN,UAAA,WAAA,WACA,IAAA4R,EACAwE,EACAhO,EACA+M,EACA7M,EACA1J,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAiBA,OAfA0O,EAAAqB,KACAkC,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QAGAnW,GAAA,EAIA8H,EADA0P,EAAA,CAAA,EACA,QAcA,WAEA,OADAxX,GAAA,EACA0J,GAAA1J,GAAAwJ,EACA,CACAsM,MAAA,GAGA,CACAxV,MAAA,CAAAN,EAAA+S,GAAAwD,EAAAvW,KACA8V,MAAA,EAEA,IAxBAhO,EAAA0P,EAAA,UAiCA,SAAAlX,GAEA,OADAoJ,GAAA,EACAjF,UAAAxE,OACA,CACAK,MAAAA,EACAwV,MAAA,GAGA,CACAA,MAAA,EAEA,IA1CAgB,IACAhP,EAAA0P,EAAAV,IAiDA,WACA,OAAA9D,EAAAyE,SACA,IAjDAD,CAkDA,IA4BA1P,EAAA8G,GAAAxN,UAAA,SAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACAvW,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAmJ,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACA,IAAAoN,EAAA/K,KAAA2U,EAAAjE,GAAAwD,EAAAvW,IAAAA,EAAAqU,MACA,OAAA,EAGA,OAAA,CACA,IA+BAvM,EAAA8G,GAAAxN,UAAA,QAAA,SAAAd,EAAAgX,EAAAI,GACA,IAAAnB,EACA/M,EACA8P,EACAtZ,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,IAAAuO,GAAAvS,GACA,MAAA,IAAAgE,UAAAiB,EAAA,mEAAAjF,IAIA,GAFAiW,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACA1R,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAAwF,GACA,MAAA,IAAAhT,UAAAiB,EAAA,qEAAA+R,IAQA,GANAA,EAAA,IACAA,GAAA9N,GACA,IACA8N,EAAA,GAGA7S,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAA4F,GACA,MAAA,IAAApT,UAAAiB,EAAA,oEAAAmS,IAEAA,EAAA,IACAA,GAAAlO,GACA,IACAkO,EAAA,GAGAA,EAAAlO,IACAkO,EAAAlO,EAEA,MACAkO,EAAAlO,CAEA,MACA8N,EAAA,EACAI,EAAAlO,EAOA,IAJA8P,EADAhZ,EACA,EAEA,EAEAN,EAAAsX,EAAAtX,EAAA0X,EAAA1X,IACAuW,EAAAvW,GAAAsZ,EAEA,OAAAjF,IACA,IAqCAvM,EAAA8G,GAAAxN,UAAA,UAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACA9V,EACAT,EACAsK,EAEA,IAAA8O,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAIA,IAFAmJ,EAAAlC,KAAA+B,QACA3V,EAAA,GACAT,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACAsK,EAAAyI,GAAAwD,EAAAvW,IACAoN,EAAA/K,KAAA2U,EAAA1M,EAAAtK,EAAAqU,OACA5T,EAAA6E,KAAAgF,GAGA,OAAA,IAAA+J,KAAA7G,YAAA/M,EACA,IA4BAqH,EAAA8G,GAAAxN,UAAA,QAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACAjM,EACAtK,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAmJ,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IAEA,GADAsK,EAAAyI,GAAAwD,EAAAvW,IACAoN,EAAA/K,KAAA2U,EAAA1M,EAAAtK,EAAAqU,MACA,OAAA/J,CAGA,IA4BAxC,EAAA8G,GAAAxN,UAAA,aAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACAjM,EACAtK,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAmJ,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IAEA,GADAsK,EAAAyI,GAAAwD,EAAAvW,IACAoN,EAAA/K,KAAA2U,EAAA1M,EAAAtK,EAAAqU,MACA,OAAArU,EAGA,OAAA,CACA,IA4BA8H,EAAA8G,GAAAxN,UAAA,YAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACAjM,EACAtK,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAmJ,EAAAlC,KAAA+B,QACApW,EAAAqU,KAAA8B,QAAA,EAAAnW,GAAA,EAAAA,IAEA,GADAsK,EAAAyI,GAAAwD,EAAAvW,IACAoN,EAAA/K,KAAA2U,EAAA1M,EAAAtK,EAAAqU,MACA,OAAA/J,CAGA,IA4BAxC,EAAA8G,GAAAxN,UAAA,iBAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACAjM,EACAtK,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAmJ,EAAAlC,KAAA+B,QACApW,EAAAqU,KAAA8B,QAAA,EAAAnW,GAAA,EAAAA,IAEA,GADAsK,EAAAyI,GAAAwD,EAAAvW,IACAoN,EAAA/K,KAAA2U,EAAA1M,EAAAtK,EAAAqU,MACA,OAAArU,EAGA,OAAA,CACA,IA0BA8H,EAAA8G,GAAAxN,UAAA,WAAA,SAAAuW,EAAAX,GACA,IAAAT,EACAvW,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,IAAA0P,GAAA2D,GACA,MAAA,IAAArT,UAAAiB,EAAA,oEAAAoS,IAGA,IADApB,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACA2X,EAAAtV,KAAA2U,EAAAjE,GAAAwD,EAAAvW,IAAAA,EAAAqU,KAEA,IA2BAlN,EAAAyH,GAAAxN,UAAA,OAAA,SAAAgH,GACA,IAAAgR,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,IAAA2N,GAAA7J,GACA,MAAA,IAAA9D,UAAAiB,EAAA,qEAAA6C,IAEA,KAAAA,GAAAiM,KAAA8B,SAGA,OAAApD,GAAAsB,KAAA+B,QAAAhO,GACA,IA8BAN,EAAA8G,GAAAxN,UAAA,YAAA,SAAAwW,EAAAC,GACA,IAAAtB,EACAvW,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,IAAAuO,GAAA+E,GACA,MAAA,IAAAtT,UAAAiB,EAAA,mEAAAqS,IAEA,GAAAnT,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAA+F,GACA,MAAA,IAAAvT,UAAAiB,EAAA,qEAAAsS,IAEAA,EAAA,IACAA,GAAAxD,KAAA8B,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAGA,IADAtB,EAAAlC,KAAA+B,QACApW,EAAA6X,EAAA7X,EAAAqU,KAAA8B,QAAAnW,IACA,GAAA4X,IAAA7E,GAAAwD,EAAAvW,IACA,OAAA,EAGA,OAAA,CACA,IAiCA8H,EAAA8G,GAAAxN,UAAA,WAAA,SAAAwW,EAAAC,GACA,IAAAtB,EACAvW,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,IAAAuO,GAAA+E,GACA,MAAA,IAAAtT,UAAAiB,EAAA,mEAAAqS,IAEA,GAAAnT,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAA+F,GACA,MAAA,IAAAvT,UAAAiB,EAAA,qEAAAsS,IAEAA,EAAA,IACAA,GAAAxD,KAAA8B,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAGA,IADAtB,EAAAlC,KAAA+B,QACApW,EAAA6X,EAAA7X,EAAAqU,KAAA8B,QAAAnW,IACA,GAAA4X,IAAA7E,GAAAwD,EAAAvW,IACA,OAAAA,EAGA,OAAA,CACA,IA0BAmH,EAAAyH,GAAAxN,UAAA,QAAA,SAAA0W,GACA,IAAAvB,EACA9V,EACAT,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,GAAAG,UAAAxE,OAAA,GACA,IAAAwJ,EAAAqO,GACA,MAAA,IAAAxT,UAAAiB,EAAA,kEAAAuS,SAGAA,EAAA,IAIA,IAFAvB,EAAAlC,KAAA+B,QACA3V,EAAA,GACAT,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACAuW,EAAAvW,GACAS,EAAA6E,KAAA,QAEA7E,EAAA6E,KAAA,SAGA,OAAA7E,EAAAuX,KAAAF,EACA,IA4BA3Q,EAAAyH,GAAAxN,UAAA,QAAA,WACA,IAAA4R,EACAwE,EACAhO,EACAE,EACA1J,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAgBA,OAdA0O,EAAAqB,KACA7K,EAAA6K,KAAA8B,QAGAnW,GAAA,EAIA8H,EADA0P,EAAA,CAAA,EACA,QAcA,WAEA,OADAxX,GAAA,EACA0J,GAAA1J,GAAAwJ,EACA,CACAsM,MAAA,GAGA,CACAxV,MAAAN,EACA8V,MAAA,EAEA,IAxBAhO,EAAA0P,EAAA,UAiCA,SAAAlX,GAEA,OADAoJ,GAAA,EACAjF,UAAAxE,OACA,CACAK,MAAAA,EACAwV,MAAA,GAGA,CACAA,MAAA,EAEA,IA1CAgB,IACAhP,EAAA0P,EAAAV,IAiDA,WACA,OAAA9D,EAAAiF,MACA,IAjDAT,CAkDA,IAiCA1P,EAAA8G,GAAAxN,UAAA,eAAA,SAAAwW,EAAAC,GACA,IAAAtB,EACAvW,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,IAAAuO,GAAA+E,GACA,MAAA,IAAAtT,UAAAiB,EAAA,mEAAAqS,IAEA,GAAAnT,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAA+F,GACA,MAAA,IAAAvT,UAAAiB,EAAA,qEAAAsS,IAEAA,GAAAxD,KAAA8B,QACA0B,EAAAxD,KAAA8B,QAAA,EACA0B,EAAA,IACAA,GAAAxD,KAAA8B,QAEA,MACA0B,EAAAxD,KAAA8B,QAAA,EAGA,IADAI,EAAAlC,KAAA+B,QACApW,EAAA6X,EAAA7X,GAAA,EAAAA,IACA,GAAA4X,IAAA7E,GAAAwD,EAAAvW,IACA,OAAAA,EAGA,OAAA,CACA,IAgBAsV,GAAA1G,GAAAxN,UAAA,UAAA,WACA,OAAAiT,KAAA8B,OACA,IAqCArO,EAAA8G,GAAAxN,UAAA,OAAA,SAAAuW,EAAAX,GACA,IAAAkB,EACAzX,EACA8V,EACAvW,EACA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,IAAA0P,GAAA2D,GACA,MAAA,IAAArT,UAAA,oEAAAqT,GAKA,IAHApB,EAAAlC,KAAA+B,QAEA8B,GADAzX,EAAA,IAAA4T,KAAA7G,YAAA6G,KAAA8B,UACAC,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACAkY,EAAAlY,GAAA+S,GAAA4E,EAAAtV,KAAA2U,EAAAjE,GAAAwD,EAAAvW,IAAAA,EAAAqU,OAEA,OAAA5T,CACA,IA+BAqH,EAAA8G,GAAAxN,UAAA,UAAA,SAAA+W,EAAAC,GACA,IAAA7B,EACA/M,EACA6O,EACArY,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,IAAA0P,GAAAmE,GACA,MAAA,IAAA7T,UAAAiB,EAAA,oEAAA4S,IAIA,GAFA5B,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACA1R,UAAAxE,OAAA,EACAoY,EAAAD,EACApY,EAAA,MACA,CACA,GAAA,IAAAwJ,EACA,MAAA,IAAAzH,MAAA,oGAEAsW,EAAAtF,GAAAwD,EAAA,IACAvW,EAAA,CACA,CACA,KAAAA,EAAAwJ,EAAAxJ,IACAqY,EAAAF,EAAAE,EAAAtF,GAAAwD,EAAAvW,IAAAA,EAAAqU,MAEA,OAAAgE,CACA,IA+BAvQ,EAAA8G,GAAAxN,UAAA,eAAA,SAAA+W,EAAAC,GACA,IAAA7B,EACA/M,EACA6O,EACArY,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,IAAA0P,GAAAmE,GACA,MAAA,IAAA7T,UAAAiB,EAAA,oEAAA4S,IAIA,GAFA5B,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACA1R,UAAAxE,OAAA,EACAoY,EAAAD,EACApY,EAAAwJ,EAAA,MACA,CACA,GAAA,IAAAA,EACA,MAAA,IAAAzH,MAAA,oGAEAsW,EAAAtF,GAAAwD,EAAA/M,EAAA,IACAxJ,EAAAwJ,EAAA,CACA,CACA,KAAAxJ,GAAA,EAAAA,IACAqY,EAAAF,EAAAE,EAAAtF,GAAAwD,EAAAvW,IAAAA,EAAAqU,MAEA,OAAAgE,CACA,IA8BAlR,EAAAyH,GAAAxN,UAAA,WAAA,WACA,IAAAmV,EACAW,EACA1N,EACA8O,EACAtY,EACAqE,EAEA,IAAA+U,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAKA,IAHAiS,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACAmC,EAAAzG,GAAArI,EAAA,GACAxJ,EAAA,EAAAA,EAAAsY,EAAAtY,IACAqE,EAAAmF,EAAAxJ,EAAA,EACAkX,EAAAX,EAAAvW,GACAuW,EAAAvW,GAAAuW,EAAAlS,GACAkS,EAAAlS,GAAA6S,EAEA,OAAA7C,IACA,IA+CAlN,EAAAyH,GAAAxN,UAAA,OAAA,SAAAd,GACA,IAAAiY,EACAnQ,EACAmO,EACAW,EACAoB,EACAtY,EACAqE,EACA,IAAA+U,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAGA,GADAiS,EAAAlC,KAAA+B,QACA3R,UAAAxE,OAAA,GAEA,IAAAgS,GADA7J,EAAA3D,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,+EAAA6C,SAGAA,EAAA,EAEA,GAAAkK,GAAAhS,GAAA,CAEA,GAAA8H,GADAkQ,EAAAhY,EAAAL,QACAoU,KAAA8B,QACA,MAAA,IAAAO,WAAA,0FASA,GANA6B,EADAa,GAAA9Y,GACAA,EAAA8V,QAEA9V,EAGA+D,EAAAkS,EAAAb,WAAAtN,EAAA4M,GAEAuD,EAAA9C,SAAAc,EAAAd,QAEA8C,EAAA7C,WAAArR,GACAkU,EAAA7C,WAAA6C,EAAA1B,WAAAxS,EAEA,CAGA,IADA6S,EAAA,IAAA1I,GAAA+J,EAAAtY,QACAD,EAAA,EAAAA,EAAAuY,EAAAtY,OAAAD,IACAkX,EAAAlX,GAAAuY,EAAAvY,GAEAuY,EAAArB,CACA,CACA,IAAAlX,EAAA,EAAAA,EAAAsY,EAAAlQ,IAAApI,IACAuW,EAAAnO,GAAAmQ,EAAAvY,GAAA,EAAA,CAGA,KA9BA,CA+BA,GAAAoI,GAAAiM,KAAA8B,QACA,MAAA,IAAAO,WAAAnR,EAAA,kEAAA6C,IAEAmO,EAAAnO,GAAA,EAAA,EAAA,CAJA,CAKA,IAgDAN,EAAA8G,GAAAxN,UAAA,SAAA,SAAAuX,EAAAjB,GACA,IAAAc,EACAN,EACAzX,EACA8V,EACA/M,EACAxJ,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAIA,GAFAiS,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACA,IAAA1R,UAAAxE,OACA0Y,EAAA,EACAjB,EAAAlO,MACA,CACA,IAAAsI,GAAA6G,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAQA,GANAA,EAAA,IACAA,GAAAnP,GACA,IACAmP,EAAA,GAGA,IAAAlU,UAAAxE,OACAyX,EAAAlO,MACA,CACA,IAAAsI,GAAA4F,GACA,MAAA,IAAApT,UAAAiB,EAAA,qEAAAmS,IAEAA,EAAA,GACAA,GAAAlO,GACA,IACAkO,EAAA,GAEAA,EAAAlO,IACAkO,EAAAlO,EAEA,CACA,CAQA,IANAgP,EADAG,EAAAjB,EACAA,EAAAiB,EAEA,EAGAT,GADAzX,EAAA,IAAA4T,KAAA7G,YAAAgL,IACApC,QACApW,EAAA,EAAAA,EAAAwY,EAAAxY,IACAkY,EAAAlY,GAAAuW,EAAAvW,EAAA2Y,GAEA,OAAAlY,CACA,IA4BAqH,EAAA8G,GAAAxN,UAAA,QAAA,SAAAgM,EAAA4J,GACA,IAAAT,EACAvW,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,IAAA0P,GAAA5G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAmJ,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACA,GAAAoN,EAAA/K,KAAA2U,EAAAjE,GAAAwD,EAAAvW,IAAAA,EAAAqU,MACA,OAAA,EAGA,OAAA,CACA,IA4CAlN,EAAAyH,GAAAxN,UAAA,QAAA,SAAAqX,GACA,IAAAlC,EAEA,IAAA6C,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAGA,GADAiS,EAAAlC,KAAA+B,QACA,IAAA3R,UAAAxE,OAEA,OADAsW,EAAAmC,OACArE,KAEA,IAAAL,GAAAyE,GACA,MAAA,IAAAnU,UAAAiB,EAAA,oEAAAkT,IAGA,OADAlC,EAAAmC,MAWA,SAAAa,EAAAC,GACA,OAAAf,EAAA1F,GAAAwG,GAAAxG,GAAAyG,GACA,IAZAnF,IAaA,IAgDAvM,EAAA8G,GAAAxN,UAAA,YAAA,SAAAuX,EAAAjB,GACA,IAAAjQ,EACA8O,EACA/M,EAEA,IAAA4P,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAIA,GAFAiS,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QACA,IAAA1R,UAAAxE,OACA0Y,EAAA,EACAjB,EAAAlO,MACA,CACA,IAAAsI,GAAA6G,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAQA,GANAA,EAAA,IACAA,GAAAnP,GACA,IACAmP,EAAA,GAGA,IAAAlU,UAAAxE,OACAyX,EAAAlO,MACA,CACA,IAAAsI,GAAA4F,GACA,MAAA,IAAApT,UAAAiB,EAAA,qEAAAmS,IAEAA,EAAA,GACAA,GAAAlO,GACA,IACAkO,EAAA,GAEAA,EAAAlO,IACAkO,EAAAlO,EAEA,CACA,CAWA,OAVAmP,GAAAnP,GACAA,EAAA,EACA/B,EAAA8O,EAAAM,YACA8B,GAAAjB,GACAlO,EAAA,EACA/B,EAAA8O,EAAAb,WAAAiD,EAAA3D,KAEAxL,EAAAkO,EAAAiB,EACAlR,EAAA8O,EAAAb,WAAAiD,EAAA3D,IAEA,IAAAX,KAAA7G,YAAA+I,EAAAd,OAAAhO,EAAA+B,EAAA,EAAA,EAAAA,EACA,IAyBA1B,EAAA8G,GAAAxN,UAAA,kBAAA,SAAAwX,EAAAC,GACA,IAAAC,EACAC,EACAtY,EACA8V,EACAvW,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,GAAA,IAAAG,UAAAxE,OACA8Y,EAAA,OACA,KAAAtP,EAAAmP,KAAAhG,GAAAgG,GAGA,MAAA,IAAAtU,UAAAiB,EAAA,yFAAAqT,IAFAG,EAAAH,CAGA,CACA,GAAAnU,UAAAxE,OAAA,EACA6Y,EAAA,CAAA,MACA,KAAAlO,GAAAiO,GAGA,MAAA,IAAAvU,UAAAiB,EAAA,qEAAAsT,IAFAC,EAAAD,CAGA,CAGA,IAFAtC,EAAAlC,KAAA+B,QACA3V,EAAA,GACAT,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACAS,EAAA6E,KAAAyN,GAAAwD,EAAAvW,IAAAgZ,eAAAD,EAAAD,IAEA,OAAArY,EAAAuX,KAAA,IACA,IA8BA7Q,EAAAyH,GAAAxN,UAAA,cAAA,WACA,IAAA8W,EACAzX,EACA+I,EACA+M,EACAvW,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAMA,IAJAkF,EAAA6K,KAAA8B,QACA1V,EAAA,IAAA4T,KAAA7G,YAAAhE,GACA+M,EAAAlC,KAAA+B,QACA8B,EAAAzX,EAAA2V,QACApW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAkY,EAAAlY,GAAAuW,EAAA/M,EAAAxJ,EAAA,GAEA,OAAAS,CACA,IA6CA0G,EAAAyH,GAAAxN,UAAA,YAAA,SAAAqX,GACA,IAAAP,EACAzX,EACA+I,EACA+M,EACAvW,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAMA,IAJAkF,EAAA6K,KAAA8B,QACA1V,EAAA,IAAA4T,KAAA7G,YAAAhE,GACA+M,EAAAlC,KAAA+B,QACA8B,EAAAzX,EAAA2V,QACApW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAkY,EAAAlY,GAAAuW,EAAAvW,GAEA,GAAA,IAAAyE,UAAAxE,OAEA,OADAiY,EAAAQ,OACAjY,EAEA,IAAAuT,GAAAyE,GACA,MAAA,IAAAnU,UAAAiB,EAAA,oEAAAkT,IAGA,OADAP,EAAAQ,MAWA,SAAAa,EAAAC,GACA,OAAAf,EAAA1F,GAAAwG,GAAAxG,GAAAyG,GACA,IAZA/Y,CAaA,IAqBA0G,EAAAyH,GAAAxN,UAAA,YAAA,WACA,IAAAX,EACA8V,EACAvW,EACA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAIA,IAFA7D,EAAA,GACA8V,EAAAlC,KAAA+B,QACApW,EAAA,EAAAA,EAAAqU,KAAA8B,QAAAnW,IACAuW,EAAAvW,GACAS,EAAA6E,KAAA,QAEA7E,EAAA6E,KAAA,SAGA,OAAA7E,EAAAuX,KAAA,IACA,IA4BA7Q,EAAAyH,GAAAxN,UAAA,UAAA,WACA,IAAAoW,EACAxE,EACAxJ,EACAE,EACA6M,EACAvW,EAEA,IAAAoZ,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAiBA,OAfA0O,EAAAqB,KACAkC,EAAAlC,KAAA+B,QACA5M,EAAA6K,KAAA8B,QAGAnW,GAAA,EAIA8H,EADA0P,EAAA,CAAA,EACA,QAcA,WAEA,OADAxX,GAAA,EACA0J,GAAA1J,GAAAwJ,EACA,CACAsM,MAAA,GAGA,CACAxV,MAAAyS,GAAAwD,EAAAvW,IACA8V,MAAA,EAEA,IAxBAhO,EAAA0P,EAAA,UAiCA,SAAAlX,GAEA,OADAoJ,GAAA,EACAjF,UAAAxE,OACA,CACAK,MAAAA,EACAwV,MAAA,GAGA,CACAA,MAAA,EAEA,IA1CAgB,IACAhP,EAAA0P,EAAAV,IAiDA,WACA,OAAA9D,EAAAiG,QACA,IAjDAzB,CAkDA,IA6BA1P,EAAA8G,GAAAxN,UAAA,QAAA,SAAA8X,EAAA5Y,GACA,IACAG,EACA+I,EAEA,IAAA4P,GAAA/E,MACA,MAAA,IAAA/P,UAAA,sDAEA,IAAAwN,GAAAoH,GACA,MAAA,IAAA5U,UAAAiB,EAAA,oEAAA2T,IAMA,GAJA1P,EAAA6K,KAAA8B,QACA+C,EAAA,IACAA,GAAA1P,GAEA0P,EAAA,GAAAA,GAAA1P,EACA,MAAA,IAAAkN,WAAAnR,EAAA,kEAAA2T,IAEA,IAAArG,GAAAvS,GACA,MAAA,IAAAgE,UAAAiB,EAAA,oEAAAjF,IASA,OAPAG,EAAA,IAAA4T,KAAA7G,YAAA6G,KAAA+B,UACAA,QAEA8C,GADA5Y,EACA,EAEA,EAEAG,CACA,IG/4EA,IAAIgZ,GAAQ,CACXvL,GACAD,GACAG,GACAG,GACAJ,GACAG,GACAD,GACAG,GACAC,GACAC,GACAC,GACAC,IC5BG8K,GAAS,CACZ,UACA,UACA,QACA,SACA,QACA,SACA,OACA,QACA,SACA,YACA,aACA,QCHGC,GAASD,GAAOzZ,OAkBpB,SAASuI,GAAOlI,GACf,IAAIN,EACJ,GAAKyD,GAASnD,GACb,MAAO,UAER,GAAKgN,GAAUhN,GACd,OAAO,KAER,IAAMN,EAAI,EAAGA,EAAI2Z,GAAQ3Z,IACxB,GAAKM,aAAiBmZ,GAAOzZ,GAC5B,OAAO0Z,GAAQ1Z,GAIjB,OAAO4Z,GAAYhM,GAAiBtN,KAAa,IAClD,CCpBA,SAASuZ,GAASvZ,EAAO2J,GACxB,OAAK3J,UAGoB,iBAAb2J,EACJA,KAAY9J,OAAQG,GAEnBa,OAAQ8I,KAAc9J,OAAQG,GACxC,CCwDA,SAASyM,GAAW5E,EAAKzB,EAAMpG,GAC9B,IAAI0G,EACAsD,EACAtK,ECrEmBuJ,EACnB8C,EDuEJ,GCvEIA,EAAK7D,GADce,EDuEFpB,GAArBnB,ECrEKgB,EAAiBuB,GACdyD,EAAgBX,GAEjB9D,EAAQ8D,QDmEA,IAAV/L,EAAmB,CACvB,IAAMN,EAAI,EAAGA,EAAImI,EAAIlI,OAAQD,IAE5B,GAAK6Z,GADLvP,EAAItD,EAAKmB,EAAKnI,GACG0G,IAAU4D,EAAG5D,KAAWpG,EACxC,OAAO,EAGT,OAAO,CACP,CACD,IAAMN,EAAI,EAAGA,EAAImI,EAAIlI,OAAQD,IAC5B,GAAKgH,EAAKmB,EAAKnI,GAAK0G,KAAWpG,EAC9B,OAAO,EAGT,OAAO,CACR,CAiCA,SAASwZ,GAAc3R,EAAKzB,EAAMpG,GACjC,OAAK0H,EAAiBG,GACd4E,GAAW5E,EAAKzB,EAAMpG,GA3G/B,SAAkB6H,EAAKzB,EAAMpG,GAC5B,IAAIgK,EACAtK,EACJ,QAAe,IAAVM,EAAmB,CACvB,IAAMN,EAAI,EAAGA,EAAImI,EAAIlI,OAAQD,IAE5B,GAAK6Z,GADLvP,EAAInC,EAAKnI,GACQ0G,IAAU4D,EAAG5D,KAAWpG,EACxC,OAAO,EAGT,OAAO,CACP,CACD,IAAMN,EAAI,EAAGA,EAAImI,EAAIlI,OAAQD,IAC5B,GAAKmI,EAAKnI,GAAK0G,KAAWpG,EACzB,OAAO,EAGT,OAAO,CACR,CA2FQyZ,CAAS5R,EAAKzB,EAAMpG,EAC5B,CEvIA,SAAS0Z,KACR,IAGIha,EAHAuZ,EAAI9U,UAEJwV,EAAI,uBADAV,EAAG,GACsB,IAEjC,IAAMvZ,EAAI,EAAGA,EAAIuZ,EAAEtZ,OAAQD,IAC1Bia,GAAK,UAAYC,mBAAoBX,EAAGvZ,IAEzC,OAAOia,CACR,CCVA,SAASE,GAAQ3Z,GAChB,IAAI2H,EACAnI,EAGJ,GADAmI,EAAM,GACD3H,GAAK,EACT,OAAO2H,EAER,IAAMnI,EAAI,EAAGA,EAAIQ,EAAGR,IACnBmI,EAAI7C,KAAMtF,GAEX,OAAOmI,CACR,CCiDA,SAASiS,GAAS3Z,EAAK6L,EAAM+N,EAAQ5S,GACpC,IAAI6C,EACAzC,EACA7H,EAKJ,IAHA6H,EAAa,EAATwS,EACJra,EAAa,EAATyH,EACJ6C,EAAI,EACItK,GAAK,GAAKA,EAAIsM,EAAKrM,QAC1BqM,EAAMtM,GAAMsK,EACZgC,EAAMtM,EAAE,GAAM,EACdA,GAAK6H,EACLyC,GAAK,EAEN,OAAO7J,CACR,CCxEA,SAAS6Z,GAAM/Q,EAAGgR,GACjB,IAAI9Z,EACAT,EAGJ,IADAS,EAAM,GACAT,EAAI,EAAGA,EAAIua,EAAQta,OAAQD,IAChCS,EAAI6E,KAAMiE,EAAGgR,EAASva,KAEvB,OAAOS,CACR,CCsBA,SAAS+Z,GAAiBnP,EAAIoP,EAAIC,EAAIC,GACrC,IAAIzD,ECKL,SAAoB1P,EAAO1H,GAC1B,IAAIsI,EACA8O,EACAtP,EACA4B,EACA/I,EACA6K,EACAgN,EACAsC,EACA5a,EACAqE,EAMJ,IAJAiU,EAAIxY,EAAQG,OAGZiX,EAAM,GACAlX,EAAI,EAAGA,EAAI,EAAGA,IACnBkX,EAAI5R,KAAM,IAKX,IAHAsV,EAAI1D,EAAIjX,OAGFD,EAAI,EAAGA,EAAIsY,EAAGtY,IACnBkX,EAAKtL,GAAe9L,EAASE,KAAQsF,KAAMxF,EAASE,IAIrD,IADA4H,EAAMsP,EAAK,GAAIjX,UACFqY,EAEZhN,EAAKxL,EAAS,QACR,GAAK8H,IAAQ0Q,EAAE,GAErB,IAAMtY,EAAI,EAAGA,EAAI4a,EAAG5a,IACnB,GAAKkX,EAAKlX,GAAIC,OAAS,CACtBqL,EAAK4L,EAAKlX,GAAK,GACf,KACA,MAEI,CAGN,IADAqE,EAAI,EACErE,EAAI,EAAGA,EAAI4a,EAAG5a,KACnBwJ,EAAM0N,EAAKlX,GAAIC,SACH2H,IACXA,EAAM4B,EACNnF,EAAIrE,GAINsL,EAAK4L,EAAK7S,GAAK,EACf,CAWD,IATA+D,EAAM+R,GAAQ3S,EAAMvH,QC3ErB,SAAmBsJ,EAAGsR,GACrB,IAAIC,EAEAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACArb,EAMJ,IAJA+a,EAAK,EACLC,EAAK,EAGChb,EAAI,EAAGA,EAAIuJ,EAAEtJ,OAAQD,IAAM,CAUhC,IARA8a,GADAK,EAAK5R,EAAGwR,IACK,GAAOI,EAAKA,EAEzBC,EAAKP,EAAGG,GAERC,EAAKF,EAAK,EACVG,EAAKF,EAAK,EAGFC,GAAM,OACbI,EAAK9R,EAAG0R,IACK,GAAOI,EAAKA,IACbP,IAGZvR,EAAG0R,EAAG,GAAMI,EACZR,EAAGK,EAAG,GAAML,EAAGK,GACfD,GAAM,EACNC,GAAM,EAEP3R,EAAG0R,EAAG,GAAME,EACZN,EAAGK,EAAG,GAAME,EACZL,GAAM,EACNC,GAAM,CACN,CACF,CDoCCM,CAAUhS,EAAMgC,GAAMlD,GAGtB3H,EAAM,CAAE6Z,GAAM9S,EAAOY,IAGfpI,EAAI,EAAGA,EAAIsY,EAAGtY,IACnBS,EAAI6E,KAAMgV,GAAMxa,EAASE,GAAKoI,IAE/B,OAAO3H,CACR,CDtEW8a,CAAWlQ,EAAI,CAAEoP,EAAIC,EAAIC,IACnC,MAAO,CACNtP,GAAM6L,EAAK,GACXuD,GAAMvD,EAAK,GACXwD,GAAMxD,EAAK,GACXyD,GAAMzD,EAAK,GAEb,CGlCA,SAASsE,GAAmBlb,GAC3B,OACCwR,GAAWxR,IACXA,EAAQ,CAEV,CCLA,SAASkb,GAAmBlb,GAC3B,OACCwR,GAAWxR,IACXA,EAAMmK,UAAY,CAEpB,CCYA,SAAS+Q,GAAmBlb,GAC3B,OAASqK,GAAarK,IAAWsK,GAAUtK,EAC5C,CClBA,SAAS2X,GAAM3X,GACd,OAAOH,OAAO8X,KAAM9X,OAAQG,GAC7B,CCOAwH,EAAA5H,GAAA,UT8HA,SAAiBO,EAAK4Z,EAAQ5S,GAC7B,IU7H0B8B,EACtB8C,EV4HA5F,GU5HA4F,EAAK7D,GADiBe,EV6HE9I,GU3HvBuH,EAAiBuB,GACd,CACN+C,KAAQ/C,EACRf,MAAS6D,EACTS,kBAAoB,EACpBC,UAAa,CACZC,EAAgBX,GAChBY,EAAgBZ,KAIZ,CACNC,KAAQ/C,EACRf,MAAS6D,EACTS,kBAAoB,EACpBC,UAAa,CACZxE,EAAQ8D,GACR3D,EAAQ2D,MV2GV,OAAK5F,EAAIqG,iBAEW,eAAdrG,EAAI+B,MACD4R,GAAS3Z,EAAKmW,GAAgBnW,EAAK,GAAK4Z,EAAQ5S,GAErC,cAAdhB,EAAI+B,MACD4R,GAAS3Z,EAAKkW,GAAelW,EAAK,GAAK4Z,EAAQ5S,GAlDzD,SAAoBhH,EAAK4Z,EAAQ5S,GAChC,IAAI6E,EACArF,EACAqD,EACAtK,EAOJ,IALAsM,EAAO7L,EAAI6L,KACXrF,EAAMxG,EAAIsM,UAAW,GAErB/M,EAAIyH,EACJ6C,EAAI,EACItK,GAAK,GAAKA,EAAIsM,EAAKrM,QAC1BgH,EAAKqF,EAAMtM,EAAGsK,GACdtK,GAAKqa,EACL/P,GAAK,EAEN,OAAOgC,CACR,CAmCSS,CAAWtG,EAAK4T,EAAQ5S,GAzIjC,SAAkBhH,EAAK4Z,EAAQ5S,GAC9B,IAAI6C,EACAtK,EAIJ,IAFAA,EAAIyH,EACJ6C,EAAI,EACItK,GAAK,GAAKA,EAAIS,EAAIR,QACzBQ,EAAKT,GAAMsK,EACXtK,GAAKqa,EACL/P,GAAK,EAEN,OAAO7J,CACR,CA+HQsZ,CAAStZ,EAAK4Z,EAAQ5S,EAC9B,IWtHAK,EAAA5H,GAAA,cAAAyK,IACA7C,EAAA5H,GAAA,WAAA0K,ICnDA,ICKIwB,GDLAA,QAAgC,IAAhBjM,OAAO8X,KEwB3B,SAASwD,GAAanb,GACrB,MAAkC,uBAAzB8J,GAAa9J,EACvB,CDCIob,GAPJ,WACC,OAAOD,GAAahX,UACrB,CAKOkX,GAKP,IAAAC,GAAexP,GElBf,SAASzI,GAAO4F,GACf,OAASA,GAAMA,CAChB,CCQA,SAAS5F,GAAOrD,GACf,OACCD,GAAUC,IACVub,GAAOvb,EAET,CCTA,SAASqD,GAAOrD,GACf,OACCD,GAAUC,IACVub,GAAOvb,EAAMmK,UAEf,CCGA,SAAS9G,GAAOrD,GACf,OAASqK,GAAarK,IAAWsK,GAAUtK,EAC5C,CCoBAwH,EAAA5H,GAAA,cAAAyK,IACA7C,EAAA5H,GAAA,WAAA0K,ICzBA,IAAIkR,GAAuB3b,OAAOiB,UAAU2a,qBCE5CC,IAXSC,GAAO5Z,KAAM,OAAQ,KCe9B,SAASyZ,GAAsBxb,EAAO2J,GACrC,IAAImC,EACJ,OACC9L,YAKD8L,EAAO6P,GAAO5Z,KAAM/B,EAAO2J,KACb+R,IAAoBvS,GAAUnJ,IAIzCqD,GAFFsG,GAAYA,IAGX6H,GAAW7H,IACXA,GAAY,GACZA,EAAW3J,EAAML,OAGZmM,EACR,CChBA,IAAA8P,GATKN,GACU1b,GCAf,SAAsBI,GACrB,OACW,OAAVA,GACiB,iBAAVA,IACNmD,GAASnD,IACc,iBAAjBA,EAAML,QACb6R,GAAWxR,EAAML,SACjBK,EAAML,QAAU,GAChBK,EAAML,QAAUmS,IAChBpI,GAAY1J,EAAO,YAClBwb,GAAsBxb,EAAO,SAEhC,EClCI8E,GAAQ1B,MAAMtC,UAAUgE,MCCxBgH,GAAO0P,ICFX,WAEA,GDAuC,aEMnC1P,IAAQ0P,GARF,CACT9Z,SAAY,MAO0B,YCiDvC,SAASwC,GAAS2D,EAAKyP,EAAeC,GACrC,IAAIrO,EACAxJ,EACJ,IAAMsS,GAAcnK,KAAUsB,EAAUtB,GACvC,MAAM,IAAI7D,UAAWiB,EAAQ,8EAA+E4C,IAG7G,GAAa,KADbqB,EAAMrB,EAAIlI,QAET,OAAQ,EAET,GAA0B,IAArBwE,UAAUxE,OAAe,CAC7B,IAAM6R,GAAW+F,GAChB,MAAM,IAAIvT,UAAWiB,EAAQ,oEAAqEsS,IAEnG,GAAKA,GAAa,EAAI,CACrB,GAAKA,GAAarO,EACjB,OAAQ,EAETxJ,EAAI6X,CACP,MACG7X,EAAIwJ,EAAMqO,GACD,IACR7X,EAAI,EAGR,MACEA,EAAI,EAGL,GAAK2D,GAAOiU,IACX,KAAQ5X,EAAIwJ,EAAKxJ,IAChB,GAAK2D,GAAOwE,EAAInI,IACf,OAAOA,OAIT,KAAQA,EAAIwJ,EAAKxJ,IAChB,GAAKmI,EAAKnI,KAAQ4X,EACjB,OAAO5X,EAIV,OAAQ,CACT,CClGA,SAASmc,GAAwB7b,GAChC,OAASA,EAAMkN,aAAelN,EAAMkN,YAAYpM,YAAcd,CAC/D,KCiBI2X,2PC1BAmE,GAAwB,oBAAXnJ,YAA2B,EAASA,OCqDrDoJ,GA9BA,WACC,IAAIC,EACJ,GAAuB,cAAlBrI,GAAQsI,IACZ,OAAO,EAER,IAAMD,KAAKC,GACV,KAEmC,IAAjC/X,GAASgY,GAAeF,IACxBtS,GAAYuS,GAAKD,IACJ,OAAbC,GAAKD,IACkB,WAAvBrI,GAAQsI,GAAKD,KAEbH,GAAwBI,GAAKD,GAE9B,CAAC,MAAQhW,GACT,OAAO,CACP,CAEF,OAAO,CACR,CAKOmW,GChDHrQ,GAA2B,oBAAX6G,wHH+BlBgF,GAJGyE,GIhBL,WACC,OAA8C,KAArCzE,GAAMxT,YAAe,IAAKxE,MACpC,CAgBQyK,CAAM,EAAG,GVFjB,SAAepK,GACd,OAAKmb,GAAanb,GACVkG,GAASpB,GAAM/C,KAAM/B,IAEtBkG,GAASlG,EACjB,EMDSkG,GKJT,SAAelG,GACd,IAAIqc,EACAC,EACAC,EACApc,EACA6b,EACAQ,EACA9c,EAGJ,GADAS,EAAM,GACDgb,GAAanb,GAAU,CAE3B,IAAMN,EAAI,EAAGA,EAAIM,EAAML,OAAQD,IAC9BS,EAAI6E,KAAMtF,EAAEgC,YAGb,OAAOvB,CACP,CACD,GAAsB,iBAAVH,GAEX,GAAKA,EAAML,OAAS,IAAM+J,GAAY1J,EAAO,KAC5C,IAAMN,EAAI,EAAGA,EAAIM,EAAML,OAAQD,IAC9BS,EAAI6E,KAAMtF,EAAEgC,gBAGR,CAEN,GAAe,IADf6a,EAA2B,mBAAVvc,KACQ+M,GAAc/M,GACtC,OAAOG,EAERmc,EAAkBG,IAAsBF,CACxC,CACD,IAAMP,KAAKhc,EACFsc,GAAuB,cAANN,IAAuBtS,GAAY1J,EAAOgc,IAClE7b,EAAI6E,KAAMnE,OAAQmb,IAGpB,GAAKU,GAEJ,IADAL,ECnDF,SAAkBrc,GACjB,IAAoB,IAAf2c,KAAyBZ,GAC7B,OAAOF,GAAwB7b,GAEhC,IACC,OAAO6b,GAAwB7b,EAC/B,CAAC,MAAQ4c,GACT,OAAO,CACP,CACF,CD0CoBf,CAAwB7b,GACpCN,EAAI,EAAGA,EAAImd,GAAeld,OAAQD,IACvC8c,EAAIK,GAAgBnd,GACZ2c,GAAyB,gBAANG,IAAyB9S,GAAY1J,EAAOwc,IACtErc,EAAI6E,KAAMnE,OAAQ2b,IAIrB,OAAOrc,CACR,ELlCA,IOjCI2c,GPiCJld,GAAe+X,GQVXoF,GAAMld,OC9BNid,GAAWjd,OAAOmd,eFSrBF,GADIpJ,GAAY7T,OAAOmd,gBACZ9W,GGKZ,SAAyBC,GACxB,IAAI8W,ECVL,SAAmB9W,GAElB,OAAOA,EAAIM,SACZ,CDOaqW,CAAU3W,GACtB,OAAK8W,GAAmB,OAAVA,EACNA,EAEgC,sBAAnCnT,GAAa3D,EAAI+G,aAEd/G,EAAI+G,YAAYpM,UAEnBqF,aAAetG,GACZA,GAAOiB,UAGR,IACR,EHXA,IAAAoc,GAAeJ,GKRXK,GAAkBtd,OAAOiB,UAyC7B,SAASsc,GAAepd,GACvB,IAAIid,EAGJ,QAAM3S,GAAUtK,KAIhBid,EC1CD,SAAyBjd,GACxB,OACCA,QAGO,MAGRA,EAAQH,GAAQG,GAET8c,GAAU9c,GAClB,CD+BSgd,CAAgBhd,IAClBid,IAMJvT,GAAY1J,EAAO,gBAGpB0J,GAAYuT,EAAO,gBACnBvJ,GAAYuJ,EAAM/P,cACmB,sBAArCpD,GAAamT,EAAM/P,cAGnBxD,GAAYuT,EAAO,kBACnBvJ,GAAYuJ,EAAMI,iBAIjBJ,IAAUE,IAzDb,SAAmBhX,GAClB,IAAImX,EAGJ,IAAMA,KAAOnX,EACZ,IAAMuD,GAAYvD,EAAKmX,GACtB,OAAO,EAGT,OAAO,CACR,CAkDGC,CAAUvd,IAGb,CE7EA,IAAIwd,GCwCJ,SAAiBrX,EAAKqS,GACrB,IACIb,EACAzO,EACAoU,EACAtE,EACA7Y,EACA6J,EACAtK,EAPA+d,GAAa,EAQjB,IAAM1Q,GAAc5G,GACnB,MAAM,IAAInC,UAAWiB,EAAQ,iFAAkFkB,IAEhH,GAAKhC,UAAUxE,OAAS,EAAI,CAC3B,IAAM2K,GAAUkO,GACf,MAAM,IAAIxU,UAAWiB,EAAQ,qEAAsEuT,IAEpG,GAAK9O,GAAY8O,EAAM,gBAEhBjG,GADNkL,EAAajF,EAAKkF,YAEjB,MAAM,IAAI1Z,UAAWiB,EAAQ,+DAAgE,aAAcwY,GAG7G,CAID,GAFAvU,GADAyO,EAAOgG,GAAYxX,IACRxG,OACXQ,EAAM,CAAA,EACDsd,EACJ,IAAM/d,EAAI,EAAGA,EAAIwJ,EAAKxJ,IAGfgK,GAAYvJ,EADlB6Y,EAAM7S,EADNmX,EAAM3F,EAAMjY,MAMZsK,EAAI7J,EAAK6Y,GACJ7V,GAAS6G,GACb7J,EAAK6Y,GAAMhU,KAAMsY,GAEjBnd,EAAK6Y,GAAQ,CAAEhP,EAAGsT,IAPlBnd,EAAK6Y,GAAQsE,OAWf,IAAM5d,EAAI,EAAGA,EAAIwJ,EAAKxJ,IAErBS,EAAKgG,EADLmX,EAAM3F,EAAMjY,KACQ4d,EAGtB,OAAOnd,CACR,CDxFWyd,CEWH,CAEN9R,KAAQ,EAGRrD,KAAQ,EACRG,MAAS,EACTC,OAAU,EACVL,MAAS,EACTG,OAAU,EACVJ,MAAS,EACTG,OAAU,EACVmV,MAAS,EACTC,OAAU,EAOVC,QAAW,GAEXzV,QAAW,GACXD,QAAW,GAIX2V,UAAa,GACbjW,UAAa,GACbH,WAAc,GAGdqW,OAAU,GAGVnV,QAAW,GAGXoV,OAAU,GAGVC,iBAAoB,KFpDkB,CACvCT,YAAc,0OG6Bf,SAASU,GAAiBlW,GACzB,IAAI8B,EACJ,OAAKb,EAAUjB,GACPwM,GAAmBxM,IAAW,KAEjCnI,GAAUmI,GACPwM,GHdT,SAAmBxM,GAClB,IAAI8B,EAAIwT,GAAMtV,GACd,OAASiB,EAAUa,GAAQA,EAAI,IAChC,CGW4BqU,CAAUnW,KAAa,KAE7CA,GAECgT,GADLlR,EAAI9B,EAAMqO,YAEFvM,EAGF,IACR,CCpDA,IAAIsU,GAAW,CAEdC,oBAAuB,GAGvBC,uBAA0B,GCY3B,SAASC,GAAiBC,EAAQC,EAAQC,GACzC,OCFD,SAAoBC,GACnB,IAAIvX,EACA4B,EACA4V,EACApf,EAGJ,IADAwJ,EAAM2V,EAAOlf,SACD,EACX,OAAO2e,GAASE,uBAGjB,GAAa,QADblX,EAAM8W,GAAiBS,EAAQ,KAE9B,OAAOP,GAASE,uBAGjB,IAAM9e,EAAI,EAAGA,EAAIwJ,EAAKxJ,IAAM,CAE3B,GAAY,QADZof,EAAKV,GAAiBS,EAAQnf,KAE7B,OAAO4e,GAASE,uBAEZM,EAAKxX,IACTA,EAAMwX,EAEP,CAED,OADAA,EAAOR,GAASC,oBAAoBjX,EAAM,GAC5B,EAAMwX,EAAK,CAC1B,CDxBQC,CAAW,CAAEL,EAAQC,EAAQC,GACrC,CESA,SAASI,GAAW9X,EAAO1H,EAAS2H,EAAQsD,EAAO3C,EAAKmX,GACvD,IAAI7X,EACA8B,EACAgW,EACA3X,EACA7H,EAIJ,IAFA0H,EAAQF,EAAMvH,OACduJ,EAAM,EACAxJ,EAAI,EAAGA,EAAI0H,EAAO1H,IACvBwJ,GAAOhC,EAAOxH,GAEf,GAAc,UAATuf,EACCnX,EAAM,EACVA,EAAM,EACKA,GAAOoB,IAClBpB,EAAMoB,EAAM,QAEP,GAAc,SAAT+V,EACNnX,EAAM,GACVA,GAAOoB,GACI,GAEG,IADbpB,GAAOoB,KAENpB,GAAOoB,GAGEpB,GAAOoB,IAClBpB,GAAOoB,IACKA,IACXpB,GAAOoB,QAOT,GAHc,cAAT+V,GAAwBnX,EAAM,IAClCA,GAAOoB,GAEHpB,EAAM,GAAKA,GAAOoB,EACtB,MAAM,IAAIkN,WAAYnR,EAAQ,gHAAiHiE,EAAKpB,IAKtJ,GADAoX,EAAM/X,EACDuD,GAAeD,GAAU,CAC7B,IAAM/K,EAAI,EAAGA,EAAI0H,EAAO1H,IAEvBoI,GADAP,EAAIO,EAAMZ,EAAOxH,GAEjBoI,GAAOZ,EAAOxH,GACdwf,GAAO3X,EAAI/H,EAASE,GAErB,OAAOwf,CACP,CAED,IAAMxf,EAAI0H,EAAM,EAAG1H,GAAK,EAAGA,IAE1BoI,GADAP,EAAIO,EAAMZ,EAAOxH,GAEjBoI,GAAOZ,EAAOxH,GACdwf,GAAO3X,EAAI/H,EAASE,GAErB,OAAOwf,CACR,CClFA,IAAIC,GAAO,QCAPA,GAAO,QC8CPC,GAAS,CCiCb,SAAmBnW,EAAGsR,EAAGtF,EAAGoC,GAC3BpC,EAAEjJ,KAAMiJ,EAAE9N,QAAWkQ,EAAKpO,EAAE+C,KAAM/C,EAAE9B,QAAUoT,EAAEvO,KAAMuO,EAAEpT,QACzD,ECFA,SAAmB8B,EAAGsR,EAAGtF,EAAGoC,GAC3B,IAAIxL,EACAwT,EACAC,EACAC,EACAC,EACAC,EACAC,EACAjF,EACAC,EACAiF,EACAC,EAqBJ,IAhBAF,EAAKzW,EAAE/B,MAAO,GACdqY,EAAMtW,EAAEzJ,QAAS,GACjBggB,EAAMjF,EAAE/a,QAAS,GACjBigB,EAAMxK,EAAEzV,QAAS,GAGjBib,EAAKxR,EAAE9B,OACPuT,EAAKH,EAAEpT,OACPwY,EAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGH4T,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOtI,EAAKxL,EAAM4O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,CAER,ECrCA,SAAmBxW,EAAGsR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAIxL,EACAwT,EACAC,EACAC,EACAO,EACAN,EACAO,EACAN,EACAO,EACAjV,EACA2U,EACAO,EACA9F,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EAyCJ,IApCAnV,EAAK9B,EAAE/B,MACPiT,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QACFqgB,GAEJH,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,KAGxBqF,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,IAGzBI,EAAKxR,EAAE9B,OACPuT,EAAKH,EAAEpT,OACPwY,EAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGHkU,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOtI,EAAKxL,EAAM4O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACF,ECxEA,SAAmB/W,EAAGsR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAIxL,EACAwT,EACAC,EACAC,EACAO,EACAK,EACAX,EACAO,EACAK,EACAX,EACAO,EACAK,EACAtV,EACA2U,EACAO,EACAK,EACAnG,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EAiDJ,IA5CAxV,EAAK9B,EAAE/B,MACPiT,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QACFqgB,GAEJH,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,KAGxBqF,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,IAGzBI,EAAKxR,EAAE9B,OACPuT,EAAKH,EAAEpT,OACPwY,EAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGHuU,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOtI,EAAKxL,EAAM4O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACF,EC1FA,SAAmBpX,EAAGsR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAIxL,EACAwT,EACAC,EACAC,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACA3V,EACA2U,EACAO,EACAK,EACAK,EACAxG,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EAyDJ,IApDA7V,EAAK9B,EAAE/B,MACPiT,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QACFqgB,GAEJH,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,KAGxBqF,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,IAGzBI,EAAKxR,EAAE9B,OACPuT,EAAKH,EAAEpT,OACPwY,EAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGH4U,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOtI,EAAKxL,EAAM4O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACF,EC1GA,SAAmBzX,EAAGsR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAIxL,EACAwT,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACAhW,EACA2U,EACAO,EACAK,EACAK,EACAK,EACA7G,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACAK,EAiEJ,IA5DAlW,EAAK9B,EAAE/B,MACPiT,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QACFqgB,GAEJH,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,KAGxBqF,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,IAGzBI,EAAKxR,EAAE9B,OACPuT,EAAKH,EAAEpT,OACPwY,EAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGHiV,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOtI,EAAKxL,EAAM4O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACF,EC9HA,SAAmB9X,EAAGsR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAIxL,EACAwT,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACArW,EACA2U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAlH,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EAyEJ,IApEAvW,EAAK9B,EAAE/B,MACPiT,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QACFqgB,GAEJH,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,KAGxBqF,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,IAGzBI,EAAKxR,EAAE9B,OACPuT,EAAKH,EAAEpT,OACPwY,EAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGHsV,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOtI,EAAKxL,EAAM4O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACDtG,GAAMyG,EACNxG,GAAMyG,EACNxB,GAAMyB,CACN,CACF,EChJA,SAAmBnY,EAAGsR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAIxL,EACAwT,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA1W,EACA2U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAvH,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EACAK,EAiFJ,IA5EA5W,EAAK9B,EAAE/B,MACPiT,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QACFqgB,GAEJH,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACT2W,EAAK3W,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,KAGxBqF,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACT2W,EAAK3W,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,IAGzBI,EAAKxR,EAAE9B,OACPuT,EAAKH,EAAEpT,OACPwY,EAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGH2V,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOtI,EAAKxL,EAAM4O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACDtG,GAAMyG,EACNxG,GAAMyG,EACNxB,GAAMyB,CACN,CACD3G,GAAM8G,EACN7G,GAAM8G,EACN7B,GAAM8B,CACN,CACF,EClKA,SAAmBxY,EAAGsR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAIxL,EACAwT,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACApC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACApC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/W,EACA2U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA5H,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,GAyFJ,IApFAjX,EAAK9B,EAAE/B,MACPiT,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QACFqgB,GAEJH,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACT2W,EAAK3W,EAAI,GACTgX,EAAKhX,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,KAGxBqF,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACT2W,EAAK3W,EAAI,GACTgX,EAAKhX,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,IAGzBI,EAAKxR,EAAE9B,OACPuT,EAAKH,EAAEpT,OACPwY,EAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGHgW,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOtI,EAAKxL,EAAM4O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACDtG,GAAMyG,EACNxG,GAAMyG,EACNxB,GAAMyB,CACN,CACD3G,GAAM8G,EACN7G,GAAM8G,EACN7B,GAAM8B,CACN,CACDhH,GAAMmH,EACNlH,GAAMmH,EACNlC,GAAMmC,CACN,CACF,ECpLA,SAAmB7Y,EAAGsR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAIxL,EACAwT,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAzC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAzC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACApX,EACA2U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAjI,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GAiGJ,IA5FAtX,EAAK9B,EAAE/B,MACPiT,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QACFqgB,GAEJH,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACT2W,EAAK3W,EAAI,GACTgX,EAAKhX,EAAI,GACTqX,EAAKrX,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ4H,EAAG5H,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ2H,EAAG3H,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ0H,EAAG1H,EAAG,KAGxBqF,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACT2W,EAAK3W,EAAI,GACTgX,EAAKhX,EAAI,GACTqX,EAAKrX,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ4H,EAAG5H,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ2H,EAAG3H,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ0H,EAAG1H,EAAG,IAGzBI,EAAKxR,EAAE9B,OACPuT,EAAKH,EAAEpT,OACPwY,EAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGHqW,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOtI,EAAKxL,EAAM4O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACDtG,GAAMyG,EACNxG,GAAMyG,EACNxB,GAAMyB,CACN,CACD3G,GAAM8G,EACN7G,GAAM8G,EACN7B,GAAM8B,CACN,CACDhH,GAAMmH,EACNlH,GAAMmH,EACNlC,GAAMmC,CACN,CACDrH,GAAMwH,EACNvH,GAAMwH,EACNvC,GAAMwC,CACN,CACF,ECtMA,SAAoBlZ,EAAGsR,EAAGtF,EAAG4K,EAAYxI,GACxC,IAAIxL,EACAwT,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA9C,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA9C,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAzX,EACA2U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAtI,EACAC,EACAC,EACAI,EACAC,EACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GAyGJ,IApGA3X,EAAK9B,EAAE/B,MACPiT,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QACFqgB,GAEJH,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACT2W,EAAK3W,EAAI,GACTgX,EAAKhX,EAAI,GACTqX,EAAKrX,EAAI,GACT0X,EAAK1X,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ4H,EAAG5H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQiI,EAAGjI,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ2H,EAAG3H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQgI,EAAGhI,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ0H,EAAG1H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQ+H,EAAG/H,EAAG,KAGxBqF,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACT2W,EAAK3W,EAAI,GACTgX,EAAKhX,EAAI,GACTqX,EAAKrX,EAAI,GACT0X,EAAK1X,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ4H,EAAG5H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQiI,EAAGjI,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ2H,EAAG3H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQgI,EAAGhI,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ0H,EAAG1H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQ+H,EAAG/H,EAAG,IAGzBI,EAAKxR,EAAE9B,OACPuT,EAAKH,EAAEpT,OACPwY,GAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGH0W,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKF,EAAIE,KACtBN,EAAMK,IAAOtI,EAAKxL,EAAM4O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,IAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,IAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,IAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,IAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,IAAMoB,CACN,CACDtG,GAAMyG,EACNxG,GAAMyG,EACNxB,IAAMyB,CACN,CACD3G,GAAM8G,EACN7G,GAAM8G,EACN7B,IAAM8B,CACN,CACDhH,GAAMmH,EACNlH,GAAMmH,EACNlC,IAAMmC,CACN,CACDrH,GAAMwH,EACNvH,GAAMwH,EACNvC,IAAMwC,CACN,CACD1H,GAAM6H,EACN5H,GAAM6H,EACN5C,IAAM6C,CACN,CACF,GX/OIG,GAAkB,CY2BtB,SAAmB1Z,EAAGsR,EAAGtF,EAAGoC,GAC3BpC,EAAExI,UAAW,GAAKwI,EAAEjJ,KAAMiJ,EAAE9N,OAAQkQ,EAAKpO,EAAEwD,UAAW,GAAKxD,EAAE+C,KAAM/C,EAAE9B,QAAUoT,EAAE9N,UAAW,GAAK8N,EAAEvO,KAAMuO,EAAEpT,SAC5G,ECDA,SAAmB8B,EAAGsR,EAAGtF,EAAGoC,GAC3B,IAAIxL,EACAwT,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAC,EACAC,EACAC,EACAjF,EACAC,EACAiF,EACAC,EA0BJ,IArBAF,EAAKzW,EAAE/B,MAAO,GACdqY,EAAMtW,EAAEzJ,QAAS,GACjBggB,EAAMjF,EAAE/a,QAAS,GACjBigB,EAAMxK,EAAEzV,QAAS,GAGjBib,EAAKxR,EAAE9B,OACPuT,EAAKH,EAAEpT,OACPwY,EAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGT4W,EAAO3Z,EAAEwD,UAAW,GACpBoW,EAAOtI,EAAE9N,UAAW,GACpBqW,EAAO7N,EAAExI,UAAW,GAGdmT,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAM/W,EAAM4O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,CAER,EC7CA,SAAmBxW,EAAGsR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAIxL,EACAwT,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAN,EACAO,EACAN,EACAO,EACAjV,EACA2U,EACAO,EACA9F,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EA8CJ,IAzCAnV,EAAK9B,EAAE/B,MACPiT,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QACFqgB,GAEJH,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,KAGxBqF,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,IAGzBI,EAAKxR,EAAE9B,OACPuT,EAAKH,EAAEpT,OACPwY,EAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGT4W,EAAO3Z,EAAEwD,UAAW,GACpBoW,EAAOtI,EAAE9N,UAAW,GACpBqW,EAAO7N,EAAExI,UAAW,GAGdyT,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAM/W,EAAM4O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACF,EChFA,SAAmB/W,EAAGsR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAIxL,EACAwT,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAX,EACAO,EACAK,EACAX,EACAO,EACAK,EACAtV,EACA2U,EACAO,EACAK,EACAnG,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EAsDJ,IAjDAxV,EAAK9B,EAAE/B,MACPiT,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QACFqgB,GAEJH,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,KAGxBqF,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,IAGzBI,EAAKxR,EAAE9B,OACPuT,EAAKH,EAAEpT,OACPwY,EAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGT4W,EAAO3Z,EAAEwD,UAAW,GACpBoW,EAAOtI,EAAE9N,UAAW,GACpBqW,EAAO7N,EAAExI,UAAW,GAGd8T,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAM/W,EAAM4O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACF,EClGA,SAAmBpX,EAAGsR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAIxL,EACAwT,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACA3V,EACA2U,EACAO,EACAK,EACAK,EACAxG,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EA8DJ,IAzDA7V,EAAK9B,EAAE/B,MACPiT,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QACFqgB,GAEJH,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,KAGxBqF,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,IAGzBI,EAAKxR,EAAE9B,OACPuT,EAAKH,EAAEpT,OACPwY,EAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGT4W,EAAO3Z,EAAEwD,UAAW,GACpBoW,EAAOtI,EAAE9N,UAAW,GACpBqW,EAAO7N,EAAExI,UAAW,GAGdmU,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAM/W,EAAM4O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACF,EClHA,SAAmBzX,EAAGsR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAIxL,EACAwT,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACAhW,EACA2U,EACAO,EACAK,EACAK,EACAK,EACA7G,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACAK,EAsEJ,IAjEAlW,EAAK9B,EAAE/B,MACPiT,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QACFqgB,GAEJH,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,KAGxBqF,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,IAGzBI,EAAKxR,EAAE9B,OACPuT,EAAKH,EAAEpT,OACPwY,EAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGT4W,EAAO3Z,EAAEwD,UAAW,GACpBoW,EAAOtI,EAAE9N,UAAW,GACpBqW,EAAO7N,EAAExI,UAAW,GAGdwU,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAM/W,EAAM4O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACF,ECtIA,SAAmB9X,EAAGsR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAIxL,EACAwT,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACArW,EACA2U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAlH,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EA8EJ,IAzEAvW,EAAK9B,EAAE/B,MACPiT,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QACFqgB,GAEJH,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,KAGxBqF,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,IAGzBI,EAAKxR,EAAE9B,OACPuT,EAAKH,EAAEpT,OACPwY,EAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGT4W,EAAO3Z,EAAEwD,UAAW,GACpBoW,EAAOtI,EAAE9N,UAAW,GACpBqW,EAAO7N,EAAExI,UAAW,GAGd6U,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAM/W,EAAM4O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACDtG,GAAMyG,EACNxG,GAAMyG,EACNxB,GAAMyB,CACN,CACF,ECxJA,SAAmBnY,EAAGsR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAIxL,EACAwT,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA1W,EACA2U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAvH,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EACAK,EAsFJ,IAjFA5W,EAAK9B,EAAE/B,MACPiT,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QACFqgB,GAEJH,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACT2W,EAAK3W,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,KAGxBqF,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACT2W,EAAK3W,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,IAGzBI,EAAKxR,EAAE9B,OACPuT,EAAKH,EAAEpT,OACPwY,EAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGT4W,EAAO3Z,EAAEwD,UAAW,GACpBoW,EAAOtI,EAAE9N,UAAW,GACpBqW,EAAO7N,EAAExI,UAAW,GAGdkV,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAM/W,EAAM4O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACDtG,GAAMyG,EACNxG,GAAMyG,EACNxB,GAAMyB,CACN,CACD3G,GAAM8G,EACN7G,GAAM8G,EACN7B,GAAM8B,CACN,CACF,EC1KA,SAAmBxY,EAAGsR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAIxL,EACAwT,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACApC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACApC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/W,EACA2U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA5H,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACAK,GACAK,GACAK,GACAK,GA8FJ,IAzFAjX,EAAK9B,EAAE/B,MACPiT,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QACFqgB,GAEJH,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACT2W,EAAK3W,EAAI,GACTgX,EAAKhX,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,KAGxBqF,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACT2W,EAAK3W,EAAI,GACTgX,EAAKhX,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,IAGzBI,EAAKxR,EAAE9B,OACPuT,EAAKH,EAAEpT,OACPwY,EAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGT4W,EAAO3Z,EAAEwD,UAAW,GACpBoW,EAAOtI,EAAE9N,UAAW,GACpBqW,EAAO7N,EAAExI,UAAW,GAGduV,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAM/W,EAAM4O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACDtG,GAAMyG,EACNxG,GAAMyG,EACNxB,GAAMyB,CACN,CACD3G,GAAM8G,EACN7G,GAAM8G,EACN7B,GAAM8B,CACN,CACDhH,GAAMmH,EACNlH,GAAMmH,EACNlC,GAAMmC,CACN,CACF,EC5LA,SAAmB7Y,EAAGsR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAIxL,EACAwT,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAzC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAzC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACApX,EACA2U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAjI,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GAsGJ,IAjGAtX,EAAK9B,EAAE/B,MACPiT,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QACFqgB,GAEJH,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACT2W,EAAK3W,EAAI,GACTgX,EAAKhX,EAAI,GACTqX,EAAKrX,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ4H,EAAG5H,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ2H,EAAG3H,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ0H,EAAG1H,EAAG,KAGxBqF,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACT2W,EAAK3W,EAAI,GACTgX,EAAKhX,EAAI,GACTqX,EAAKrX,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ4H,EAAG5H,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ2H,EAAG3H,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ0H,EAAG1H,EAAG,IAGzBI,EAAKxR,EAAE9B,OACPuT,EAAKH,EAAEpT,OACPwY,EAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGT4W,EAAO3Z,EAAEwD,UAAW,GACpBoW,EAAOtI,EAAE9N,UAAW,GACpBqW,EAAO7N,EAAExI,UAAW,GAGd4V,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKF,EAAIE,KACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAM/W,EAAM4O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACDtG,GAAMyG,EACNxG,GAAMyG,EACNxB,GAAMyB,CACN,CACD3G,GAAM8G,EACN7G,GAAM8G,EACN7B,GAAM8B,CACN,CACDhH,GAAMmH,EACNlH,GAAMmH,EACNlC,GAAMmC,CACN,CACDrH,GAAMwH,EACNvH,GAAMwH,EACNvC,GAAMwC,CACN,CACF,EC9MA,SAAoBlZ,EAAGsR,EAAGtF,EAAG4K,EAAYxI,GACxC,IAAIxL,EACAwT,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA9C,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA9C,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAzX,EACA2U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAtI,EACAC,EACAC,GACAI,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GA8GJ,IAzGA3X,EAAK9B,EAAE/B,MACPiT,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,GAAKpF,EAAEzV,QACFqgB,GAEJH,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACT2W,EAAK3W,EAAI,GACTgX,EAAKhX,EAAI,GACTqX,EAAKrX,EAAI,GACT0X,EAAK1X,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ4H,EAAG5H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQiI,EAAGjI,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ2H,EAAG3H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQgI,EAAGhI,EAAG,GACxBqF,EAAMpF,GAAI,GACV2F,EAAM3F,GAAI,GAAQqF,EAAGrF,GAAG,GACxBgG,EAAMhG,GAAI,GAAQ4F,EAAG5F,GAAG,GACxBqG,EAAMrG,GAAI,GAAQiG,EAAGjG,GAAG,GACxB0G,EAAM1G,GAAI,GAAQsG,EAAGtG,GAAG,GACxB+G,EAAM/G,GAAI,GAAQ2G,EAAG3G,GAAG,GACxBoH,EAAMpH,GAAI,GAAQgH,EAAGhH,GAAG,GACxByH,EAAMzH,GAAI,GAAQqH,EAAGrH,GAAG,GACxB8H,EAAM9H,GAAI,GAAQ0H,EAAG1H,GAAG,GACxBmI,EAAMnI,GAAI,GAAQ+H,EAAG/H,GAAG,KAGxBqF,EAAK3U,EAAI,GACTkV,EAAKlV,EAAI,GACTuV,EAAKvV,EAAI,GACT4V,EAAK5V,EAAI,GACTiW,EAAKjW,EAAI,GACTsW,EAAKtW,EAAI,GACT2W,EAAK3W,EAAI,GACTgX,EAAKhX,EAAI,GACTqX,EAAKrX,EAAI,GACT0X,EAAK1X,EAAI,GACTwU,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ4H,EAAG5H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQiI,EAAGjI,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ2H,EAAG3H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQgI,EAAGhI,EAAG,GACxBqF,EAAMpF,GAAI,GACV2F,EAAM3F,GAAI,GAAQqF,EAAGrF,GAAG,GACxBgG,EAAMhG,GAAI,GAAQ4F,EAAG5F,GAAG,GACxBqG,EAAMrG,GAAI,GAAQiG,EAAGjG,GAAG,GACxB0G,EAAM1G,GAAI,GAAQsG,EAAGtG,GAAG,GACxB+G,EAAM/G,GAAI,GAAQ2G,EAAG3G,GAAG,GACxBoH,EAAMpH,GAAI,GAAQgH,EAAGhH,GAAG,GACxByH,EAAMzH,GAAI,GAAQqH,EAAGrH,GAAG,GACxB8H,EAAM9H,GAAI,GAAQ0H,EAAG1H,GAAG,GACxBmI,EAAMnI,GAAI,GAAQ+H,EAAG/H,GAAG,IAGzBI,GAAKxR,EAAE9B,OACPuT,GAAKH,EAAEpT,OACPwY,GAAK1K,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGT4W,EAAO3Z,EAAEwD,UAAW,GACpBoW,EAAOtI,EAAE9N,UAAW,GACpBqW,EAAO7N,EAAExI,UAAW,GAGdiW,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKF,EAAIE,KACtBkD,EAAMxD,EAAMK,GAAItI,EAAKuL,EAAM/W,EAAM4O,IAAMoI,EAAMxD,EAAM3E,MACnDD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CACD3G,IAAM8G,EACN7G,IAAM8G,EACN7B,IAAM8B,CACN,CACDhH,IAAMmH,EACNlH,IAAMmH,EACNlC,IAAMmC,CACN,CACDrH,IAAMwH,EACNvH,IAAMwH,EACNvC,IAAMwC,CACN,CACD1H,IAAM6H,EACN5H,IAAM6H,EACN5C,IAAM6C,CACN,CACF,GtBlPIO,GAAiB,CuBYrB,SAA0B9Z,EAAGsR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACAnX,EACAwT,EACAC,EACAC,EACAO,EACAN,EACAO,EACAN,EACAO,EACAiD,EACAC,EACAC,EACApY,EACAqY,EACA3X,EACA0O,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EACAiF,EACAC,EACAM,EACAsD,EACAC,EACArY,EA8BJ,IAxBAL,GADAK,EAAI6P,GAAWhS,EAAE/B,MAAO+B,EAAEzJ,QAAS+a,EAAE/a,QAASyV,EAAEzV,UACzCuL,GACPoP,EAAK/O,EAAE+O,GACPC,EAAKhP,EAAEgP,GACPC,EAAKjP,EAAEiP,GAGP2I,EAAQjE,GAAW9V,EAAEf,MAAOqS,EAAErS,MAAO+M,EAAE/M,OAGvCmb,EAAKpa,EAAE9B,OACPmc,EAAK/I,EAAEpT,OACPoc,EAAKtO,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTuT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGHoJ,EAAK1Y,EAAG,GAAI0Y,EAAK,GAWtB,IAVKA,EAAKT,GACTvX,EAAKgY,EACLA,EAAK,IAELhY,EAAKuX,EACLS,GAAMT,GAEPC,EAAMI,EAAOI,EAAGtJ,EAAG,GACnB+I,EAAMI,EAAOG,EAAGrJ,EAAG,GACnB+I,EAAMI,EAAOE,EAAGpJ,EAAG,GACbmJ,EAAKzY,EAAG,GAAIyY,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPvI,EAAKwI,EAAQO,EAAGrJ,EAAG,GACnBO,EAAKwI,EAAQM,EAAGpJ,EAAG,GACnBuF,EAAKwD,EAAQK,EAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhB6F,EAAK,EAAGA,EAAKzU,EAAIyU,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBN,EAAMK,GAAOtI,EAAKxL,EAAM4O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CAGJ,ECrGA,SAA0B/W,EAAGsR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACAnX,EACAwT,EACAC,EACAC,EACAO,EACAK,EACAX,EACAO,EACAK,EACAX,EACAO,EACAK,EACA4C,EACAS,EACAR,EACAS,EACAR,EACAS,EACA7Y,EACAqY,EACA3X,EACAC,EACAyO,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAiD,EACAC,EACAI,EACAzY,EA8BJ,IAxBAL,GADAK,EAAI6P,GAAWhS,EAAE/B,MAAO+B,EAAEzJ,QAAS+a,EAAE/a,QAASyV,EAAEzV,UACzCuL,GACPoP,EAAK/O,EAAE+O,GACPC,EAAKhP,EAAEgP,GACPC,EAAKjP,EAAEiP,GAGP2I,EAAQjE,GAAW9V,EAAEf,MAAOqS,EAAErS,MAAO+M,EAAE/M,OAGvCmb,EAAKpa,EAAE9B,OACPmc,EAAK/I,EAAEpT,OACPoc,EAAKtO,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTuT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGHwJ,EAAK9Y,EAAG,GAAI8Y,EAAK,GAWtB,IAVKA,EAAKb,GACTtX,EAAKmY,EACLA,EAAK,IAELnY,EAAKsX,EACLa,GAAMb,GAEPU,EAAML,EAAOQ,EAAG1J,EAAG,GACnBwJ,EAAML,EAAOO,EAAGzJ,EAAG,GACnBwJ,EAAML,EAAOM,EAAGxJ,EAAG,GACboJ,EAAK1Y,EAAG,GAAI0Y,EAAK,GActB,IAbKA,EAAKT,GACTvX,EAAKgY,EACLA,EAAK,IAELhY,EAAKuX,EACLS,GAAMT,GAEP7C,EAAMhG,EAAG,GAAO1O,EAAG0O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO5O,EAAG4O,EAAG,GACtB4I,EAAMS,EAAQD,EAAGtJ,EAAG,GACpB+I,EAAMS,EAAQF,EAAGrJ,EAAG,GACpB+I,EAAMS,EAAQH,EAAGpJ,EAAG,GACdmJ,EAAKzY,EAAG,GAAIyY,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPvI,EAAKwI,EAAQO,EAAGrJ,EAAG,GACnBO,EAAKwI,EAAQM,EAAGpJ,EAAG,GACnBuF,EAAKwD,EAAQK,EAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhBkG,EAAK,EAAGA,EAAK7U,EAAI6U,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKzU,EAAIyU,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBN,EAAMK,GAAOtI,EAAKxL,EAAM4O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CAIL,ECpIA,SAA0BpX,EAAGsR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACAnX,EACAwT,EACAC,EACAC,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAuC,EACAS,EACAI,EACAZ,EACAS,EACAI,EACAZ,EACAS,EACAI,EACAjZ,EACAqY,EACA3X,EACAC,EACAuY,EACA9J,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACA4C,EACAC,EACAI,EACAK,EACA9Y,EA8BJ,IAxBAL,GADAK,EAAI6P,GAAWhS,EAAE/B,MAAO+B,EAAEzJ,QAAS+a,EAAE/a,QAASyV,EAAEzV,UACzCuL,GACPoP,EAAK/O,EAAE+O,GACPC,EAAKhP,EAAEgP,GACPC,EAAKjP,EAAEiP,GAGP2I,EAAQjE,GAAW9V,EAAEf,MAAOqS,EAAErS,MAAO+M,EAAE/M,OAGvCmb,EAAKpa,EAAE9B,OACPmc,EAAK/I,EAAEpT,OACPoc,EAAKtO,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTuT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGH6J,EAAKnZ,EAAG,GAAImZ,EAAK,GAWtB,IAVKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPc,EAAMT,EAAOa,EAAG/J,EAAG,GACnB4J,EAAMT,EAAOY,EAAG9J,EAAG,GACnB4J,EAAMT,EAAOW,EAAG7J,EAAG,GACbwJ,EAAK9Y,EAAG,GAAI8Y,EAAK,GActB,IAbKA,EAAKb,GACTtX,EAAKmY,EACLA,EAAK,IAELnY,EAAKsX,EACLa,GAAMb,GAEPxC,EAAMrG,EAAG,GAAOzO,EAAGyO,EAAG,GACtBsG,EAAMrG,EAAG,GAAO1O,EAAG0O,EAAG,GACtBsG,EAAMrG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBqJ,EAAMI,EAAQD,EAAG1J,EAAG,GACpBwJ,EAAMI,EAAQF,EAAGzJ,EAAG,GACpBwJ,EAAMI,EAAQH,EAAGxJ,EAAG,GACdoJ,EAAK1Y,EAAG,GAAI0Y,EAAK,GActB,IAbKA,EAAKT,GACTvX,EAAKgY,EACLA,EAAK,IAELhY,EAAKuX,EACLS,GAAMT,GAEP7C,EAAMhG,EAAG,GAAO1O,EAAG0O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO5O,EAAG4O,EAAG,GACtB4I,EAAMS,EAAQD,EAAGtJ,EAAG,GACpB+I,EAAMS,EAAQF,EAAGrJ,EAAG,GACpB+I,EAAMS,EAAQH,EAAGpJ,EAAG,GACdmJ,EAAKzY,EAAG,GAAIyY,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPvI,EAAKwI,EAAQO,EAAGrJ,EAAG,GACnBO,EAAKwI,EAAQM,EAAGpJ,EAAG,GACnBuF,EAAKwD,EAAQK,EAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhBuG,EAAK,EAAGA,EAAKqD,EAAIrD,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAK7U,EAAI6U,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKzU,EAAIyU,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBN,EAAMK,GAAOtI,EAAKxL,EAAM4O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CAKN,ECjKA,SAA0BzX,EAAGsR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACAnX,EACAwT,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACAkC,EACAS,EACAI,EACAK,EACAjB,EACAS,EACAI,EACAK,EACAjB,EACAS,EACAI,EACAK,EACAtZ,EACAqY,EACA3X,EACAC,EACAuY,EACAK,EACAnK,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACAK,GACAuC,GACAC,GACAI,GACAK,GACAK,GACAnZ,GA8BJ,IAxBAL,GADAK,GAAI6P,GAAWhS,EAAE/B,MAAO+B,EAAEzJ,QAAS+a,EAAE/a,QAASyV,EAAEzV,UACzCuL,GACPoP,EAAK/O,GAAE+O,GACPC,EAAKhP,GAAEgP,GACPC,EAAKjP,GAAEiP,GAGP2I,EAAQjE,GAAW9V,EAAEf,MAAOqS,EAAErS,MAAO+M,EAAE/M,OAGvCmb,EAAKpa,EAAE9B,OACPmc,EAAK/I,EAAEpT,OACPoc,EAAKtO,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTuT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGHkK,GAAKxZ,EAAG,GAAIwZ,GAAK,GAWtB,IAVKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEPmB,EAAMd,EAAOkB,GAAGpK,EAAG,GACnBiK,EAAMd,EAAOiB,GAAGnK,EAAG,GACnBiK,EAAMd,EAAOgB,GAAGlK,EAAG,GACb6J,GAAKnZ,EAAG,GAAImZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,EAAG,GAAO8J,EAAG9J,EAAG,GACtB2G,EAAM1G,EAAG,GAAO6J,EAAG7J,EAAG,GACtB2G,EAAM1G,EAAG,GAAO4J,EAAG5J,EAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,EAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,EAAG,GACpB4J,EAAMK,EAAQH,GAAG7J,EAAG,GACdwJ,GAAK9Y,EAAG,GAAI8Y,GAAK,GActB,IAbKA,GAAKb,GACTtX,EAAKmY,GACLA,GAAK,IAELnY,EAAKsX,EACLa,IAAMb,GAEPxC,EAAMrG,EAAG,GAAOzO,EAAGyO,EAAG,GACtBsG,EAAMrG,EAAG,GAAO1O,EAAG0O,EAAG,GACtBsG,EAAMrG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,EAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,EAAG,GACpBwJ,EAAMI,EAAQH,GAAGxJ,EAAG,GACdoJ,GAAK1Y,EAAG,GAAI0Y,GAAK,GActB,IAbKA,GAAKT,GACTvX,EAAKgY,GACLA,GAAK,IAELhY,EAAKuX,EACLS,IAAMT,GAEP7C,EAAMhG,EAAG,GAAO1O,EAAG0O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO5O,EAAG4O,EAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,EAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,EAAG,GACpB+I,EAAMS,EAAQH,GAAGpJ,EAAG,GACdmJ,GAAKzY,EAAG,GAAIyY,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPvI,EAAKwI,EAAQO,GAAGrJ,EAAG,GACnBO,EAAKwI,EAAQM,GAAGpJ,EAAG,GACnBuF,EAAKwD,EAAQK,GAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhB4G,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKqD,EAAIrD,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAK7U,EAAI6U,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKzU,EAAIyU,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBN,EAAMK,GAAOtI,EAAKxL,EAAM4O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CAMP,EC9LA,SAA0B9X,EAAGsR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACAnX,EACAwT,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACA6B,EACAS,EACAI,EACAK,EACAK,EACAtB,EACAS,EACAI,EACAK,EACAK,EACAtB,EACAS,EACAI,EACAK,EACAK,EACA3Z,EACAqY,EACA3X,EACAC,EACAuY,EACAK,EACAK,EACAxK,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAkC,GACAC,GACAI,GACAK,GACAK,GACAK,GACAxZ,GA8BJ,IAxBAL,GADAK,GAAI6P,GAAWhS,EAAE/B,MAAO+B,EAAEzJ,QAAS+a,EAAE/a,QAASyV,EAAEzV,UACzCuL,GACPoP,EAAK/O,GAAE+O,GACPC,EAAKhP,GAAEgP,GACPC,EAAKjP,GAAEiP,GAGP2I,EAAQjE,GAAW9V,EAAEf,MAAOqS,EAAErS,MAAO+M,EAAE/M,OAGvCmb,EAAKpa,EAAE9B,OACPmc,EAAK/I,EAAEpT,OACPoc,EAAKtO,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTuT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGHuK,GAAK7Z,EAAG,GAAI6Z,GAAK,GAWtB,IAVKA,GAAK5B,GACT2B,EAAKC,GACLA,GAAK,IAELD,EAAK3B,EACL4B,IAAM5B,GAEPwB,EAAMnB,EAAOuB,GAAGzK,EAAG,GACnBsK,EAAMnB,EAAOsB,GAAGxK,EAAG,GACnBsK,EAAMnB,EAAOqB,GAAGvK,EAAG,GACbkK,GAAKxZ,EAAG,GAAIwZ,GAAK,GActB,IAbKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,EAAG,GAAOmK,EAAGnK,EAAG,GACtBgH,EAAM/G,EAAG,GAAOkK,EAAGlK,EAAG,GACtBgH,EAAM/G,EAAG,GAAOiK,EAAGjK,EAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,EAAG,GACpBiK,EAAMK,EAAQF,GAAGnK,EAAG,GACpBiK,EAAMK,EAAQH,GAAGlK,EAAG,GACd6J,GAAKnZ,EAAG,GAAImZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,EAAG,GAAO8J,EAAG9J,EAAG,GACtB2G,EAAM1G,EAAG,GAAO6J,EAAG7J,EAAG,GACtB2G,EAAM1G,EAAG,GAAO4J,EAAG5J,EAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,EAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,EAAG,GACpB4J,EAAMK,EAAQH,GAAG7J,EAAG,GACdwJ,GAAK9Y,EAAG,GAAI8Y,GAAK,GActB,IAbKA,GAAKb,GACTtX,EAAKmY,GACLA,GAAK,IAELnY,EAAKsX,EACLa,IAAMb,GAEPxC,EAAMrG,EAAG,GAAOzO,EAAGyO,EAAG,GACtBsG,EAAMrG,EAAG,GAAO1O,EAAG0O,EAAG,GACtBsG,EAAMrG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,EAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,EAAG,GACpBwJ,EAAMI,EAAQH,GAAGxJ,EAAG,GACdoJ,GAAK1Y,EAAG,GAAI0Y,GAAK,GActB,IAbKA,GAAKT,GACTvX,EAAKgY,GACLA,GAAK,IAELhY,EAAKuX,EACLS,IAAMT,GAEP7C,EAAMhG,EAAG,GAAO1O,EAAG0O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO5O,EAAG4O,EAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,EAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,EAAG,GACpB+I,EAAMS,EAAQH,GAAGpJ,EAAG,GACdmJ,GAAKzY,EAAG,GAAIyY,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,EAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,EAAG,GACnBuF,GAAKwD,EAAQK,GAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhBiH,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK7U,EAAI6U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKzU,EAAIyU,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,EAAIxD,KACtBN,EAAMK,IAAOtI,EAAKxL,EAAM4O,IAAM4E,EAAM3E,KACpCD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CAOR,EC3NA,SAA0BnY,EAAGsR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACAnX,EACAwT,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAwB,EACAS,EACAI,EACAK,EACAK,EACAK,EACA3B,EACAS,EACAI,EACAK,EACAK,EACAK,EACA3B,EACAS,EACAI,EACAK,EACAK,EACAK,EACAha,EACAqY,EACA3X,EACAC,EACAuY,EACAK,EACAK,EACAK,GACA7K,GACAC,GACAC,GACAgJ,GACAC,GACAC,GACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACA6B,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACA7Z,GA8BJ,IAxBAL,GADAK,GAAI6P,GAAWhS,EAAE/B,MAAO+B,EAAEzJ,QAAS+a,EAAE/a,QAASyV,EAAEzV,UACzCuL,GACPoP,GAAK/O,GAAE+O,GACPC,GAAKhP,GAAEgP,GACPC,GAAKjP,GAAEiP,GAGP2I,EAAQjE,GAAW9V,EAAEf,MAAOqS,EAAErS,MAAO+M,EAAE/M,OAGvCmb,GAAKpa,EAAE9B,OACPmc,GAAK/I,EAAEpT,OACPoc,GAAKtO,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTuT,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GAGH4K,GAAKla,EAAG,GAAIka,GAAK,GAWtB,IAVKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEP6B,EAAMxB,GAAO4B,GAAG9K,GAAG,GACnB2K,EAAMxB,GAAO2B,GAAG7K,GAAG,GACnB2K,EAAMxB,GAAO0B,GAAG5K,GAAG,GACbuK,GAAK7Z,EAAG,GAAI6Z,GAAK,GActB,IAbKA,GAAK5B,GACT2B,EAAKC,GACLA,GAAK,IAELD,EAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpH,GAAG,GAAOwK,EAAGxK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOuK,EAAGvK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOsK,EAAGtK,GAAG,GACtBmK,EAAMK,EAAQD,GAAGzK,GAAG,GACpBsK,EAAMK,EAAQF,GAAGxK,GAAG,GACpBsK,EAAMK,EAAQH,GAAGvK,GAAG,GACdkK,GAAKxZ,EAAG,GAAIwZ,GAAK,GActB,IAbKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,GAAG,GAAOmK,EAAGnK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOkK,EAAGlK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOiK,EAAGjK,GAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,GAAG,GACpBiK,EAAMK,EAAQF,GAAGnK,GAAG,GACpBiK,EAAMK,EAAQH,GAAGlK,GAAG,GACd6J,GAAKnZ,EAAG,GAAImZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,GAAG,GAAO8J,EAAG9J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO6J,EAAG7J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO4J,EAAG5J,GAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,GAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,GAAG,GACpB4J,EAAMK,EAAQH,GAAG7J,GAAG,GACdwJ,GAAK9Y,EAAG,GAAI8Y,GAAK,GActB,IAbKA,GAAKb,GACTtX,EAAKmY,GACLA,GAAK,IAELnY,EAAKsX,EACLa,IAAMb,GAEPxC,EAAMrG,GAAG,GAAOzO,EAAGyO,GAAG,GACtBsG,EAAMrG,GAAG,GAAO1O,EAAG0O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO3O,EAAG2O,GAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,GAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,GAAG,GACpBwJ,EAAMI,EAAQH,GAAGxJ,GAAG,GACdoJ,GAAK1Y,EAAG,GAAI0Y,GAAK,GActB,IAbKA,GAAKT,GACTvX,EAAKgY,GACLA,GAAK,IAELhY,EAAKuX,EACLS,IAAMT,GAEP7C,EAAMhG,GAAG,GAAO1O,EAAG0O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO3O,EAAG2O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO5O,EAAG4O,GAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,GAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,GAAG,GACpB+I,EAAMS,EAAQH,GAAGpJ,GAAG,GACdmJ,GAAKzY,EAAG,GAAIyY,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,GAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,GAAG,GACnBuF,GAAKwD,EAAQK,GAAGnJ,GAAG,GAGnByF,EAAM3F,GAAG,GAAOiJ,EAAGjJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAOgJ,EAAGhJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAO+I,EAAG/I,GAAG,GAGhBsH,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK7U,EAAI6U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKzU,EAAIyU,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,EAAIxD,KACtBN,EAAMK,IAAOtI,EAAKxL,EAAM4O,IAAM4E,EAAM3E,KACpCD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CACD3G,IAAM8G,EACN7G,IAAM8G,EACN7B,IAAM8B,CACN,CAQT,ECxPA,SAA0BxY,EAAGsR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACAnX,EACAwT,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACApC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACApC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAmB,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAhC,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAhC,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAra,EACAqY,GACA3X,GACAC,GACAuY,GACAK,GACAK,GACAK,GACAK,GACAlL,GACAC,GACAC,GACAgJ,GACAC,GACAC,GACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAwB,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAla,GA8BJ,IAxBAL,GADAK,GAAI6P,GAAWhS,EAAE/B,MAAO+B,EAAEzJ,QAAS+a,EAAE/a,QAASyV,EAAEzV,UACzCuL,GACPoP,GAAK/O,GAAE+O,GACPC,GAAKhP,GAAEgP,GACPC,GAAKjP,GAAEiP,GAGP2I,EAAQjE,GAAW9V,EAAEf,MAAOqS,EAAErS,MAAO+M,EAAE/M,OAGvCmb,GAAKpa,EAAE9B,OACPmc,GAAK/I,EAAEpT,OACPoc,GAAKtO,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTuT,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GAGHiL,GAAKva,EAAG,GAAIua,GAAK,GAWtB,IAVKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPkC,EAAM7B,GAAOiC,GAAGnL,GAAG,GACnBgL,EAAM7B,GAAOgC,GAAGlL,GAAG,GACnBgL,EAAM7B,GAAO+B,GAAGjL,GAAG,GACb4K,GAAKla,EAAG,GAAIka,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzH,GAAG,GAAO6K,GAAG7K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO4K,GAAG5K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO2K,GAAG3K,GAAG,GACtBwK,EAAMK,EAAQD,GAAG9K,GAAG,GACpB2K,EAAMK,EAAQF,GAAG7K,GAAG,GACpB2K,EAAMK,EAAQH,GAAG5K,GAAG,GACduK,GAAK7Z,EAAG,GAAI6Z,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpH,GAAG,GAAOwK,GAAGxK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOuK,GAAGvK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOsK,GAAGtK,GAAG,GACtBmK,EAAMK,EAAQD,GAAGzK,GAAG,GACpBsK,EAAMK,EAAQF,GAAGxK,GAAG,GACpBsK,EAAMK,EAAQH,GAAGvK,GAAG,GACdkK,GAAKxZ,EAAG,GAAIwZ,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,GAAG,GAAOmK,GAAGnK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOkK,GAAGlK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOiK,GAAGjK,GAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,GAAG,GACpBiK,EAAMK,EAAQF,GAAGnK,GAAG,GACpBiK,EAAMK,EAAQH,GAAGlK,GAAG,GACd6J,GAAKnZ,EAAG,GAAImZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,GAAG,GAAO8J,GAAG9J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO6J,GAAG7J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO4J,GAAG5J,GAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,GAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,GAAG,GACpB4J,EAAMK,EAAQH,GAAG7J,GAAG,GACdwJ,GAAK9Y,EAAG,GAAI8Y,GAAK,GActB,IAbKA,GAAKb,GACTtX,GAAKmY,GACLA,GAAK,IAELnY,GAAKsX,EACLa,IAAMb,GAEPxC,EAAMrG,GAAG,GAAOzO,GAAGyO,GAAG,GACtBsG,EAAMrG,GAAG,GAAO1O,GAAG0O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO3O,GAAG2O,GAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,GAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,GAAG,GACpBwJ,EAAMI,EAAQH,GAAGxJ,GAAG,GACdoJ,GAAK1Y,EAAG,GAAI0Y,GAAK,GActB,IAbKA,GAAKT,GACTvX,GAAKgY,GACLA,GAAK,IAELhY,GAAKuX,EACLS,IAAMT,GAEP7C,EAAMhG,GAAG,GAAO1O,GAAG0O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO3O,GAAG2O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO5O,GAAG4O,GAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,GAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,GAAG,GACpB+I,EAAMS,EAAQH,GAAGpJ,GAAG,GACdmJ,GAAKzY,EAAG,GAAIyY,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,GAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,GAAG,GACnBuF,GAAKwD,EAAQK,GAAGnJ,GAAG,GAGnByF,EAAM3F,GAAG,GAAOiJ,GAAGjJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAOgJ,GAAGhJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAO+I,GAAG/I,GAAG,GAGhB2H,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK7U,GAAI6U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKzU,GAAIyU,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBN,EAAMK,IAAOtI,EAAKxL,EAAM4O,IAAM4E,EAAM3E,KACpCD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CACD3G,IAAM8G,EACN7G,IAAM8G,EACN7B,IAAM8B,CACN,CACDhH,IAAMmH,EACNlH,IAAMmH,EACNlC,IAAMmC,CACN,CASV,ECrRA,SAA0B7Y,EAAGsR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACAnX,EACAwT,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAzC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAzC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAc,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAK,EACArC,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAK,EACArC,EACAS,EACAI,EACAK,GACAK,GACAK,GACAK,GACAK,GACA1a,GACAqY,GACA3X,GACAC,GACAuY,GACAK,GACAK,GACAK,GACAK,GACAK,GACAvL,GACAC,GACAC,GACAgJ,GACAC,GACAC,GACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAmB,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAva,GA8BJ,IAxBAL,IADAK,GAAI6P,GAAWhS,EAAE/B,MAAO+B,EAAEzJ,QAAS+a,EAAE/a,QAASyV,EAAEzV,UACzCuL,GACPoP,GAAK/O,GAAE+O,GACPC,GAAKhP,GAAEgP,GACPC,GAAKjP,GAAEiP,GAGP2I,EAAQjE,GAAW9V,EAAEf,MAAOqS,EAAErS,MAAO+M,EAAE/M,OAGvCmb,GAAKpa,EAAE9B,OACPmc,GAAK/I,EAAEpT,OACPoc,GAAKtO,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTuT,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GAGHsL,GAAK5a,GAAG,GAAI4a,GAAK,GAWtB,IAVKA,GAAK3C,GACT0C,GAAKC,GACLA,GAAK,IAELD,GAAK1C,EACL2C,IAAM3C,GAEPuC,EAAMlC,GAAOsC,GAAGxL,GAAG,GACnBqL,EAAMlC,GAAOqC,GAAGvL,GAAG,GACnBqL,GAAMlC,GAAOoC,GAAGtL,GAAG,GACbiL,GAAKva,GAAG,GAAIua,GAAK,GActB,IAbKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPf,EAAM9H,GAAG,GAAOkL,GAAGlL,GAAG,GACtB+H,EAAM9H,GAAG,GAAOiL,GAAGjL,GAAG,GACtB+H,EAAM9H,GAAG,GAAOgL,GAAGhL,GAAG,GACtB6K,EAAMK,EAAQD,GAAGnL,GAAG,GACpBgL,EAAMK,EAAQF,GAAGlL,GAAG,GACpBgL,GAAMK,GAAQH,GAAGjL,GAAG,GACd4K,GAAKla,GAAG,GAAIka,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzH,GAAG,GAAO6K,GAAG7K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO4K,GAAG5K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO2K,GAAG3K,GAAG,GACtBwK,EAAMK,EAAQD,GAAG9K,GAAG,GACpB2K,EAAMK,EAAQF,GAAG7K,GAAG,GACpB2K,GAAMK,GAAQH,GAAG5K,GAAG,GACduK,GAAK7Z,GAAG,GAAI6Z,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpH,GAAG,GAAOwK,GAAGxK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOuK,GAAGvK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOsK,GAAGtK,GAAG,GACtBmK,EAAMK,EAAQD,GAAGzK,GAAG,GACpBsK,EAAMK,EAAQF,GAAGxK,GAAG,GACpBsK,GAAMK,GAAQH,GAAGvK,GAAG,GACdkK,GAAKxZ,GAAG,GAAIwZ,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,GAAG,GAAOmK,GAAGnK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOkK,GAAGlK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOiK,GAAGjK,GAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,GAAG,GACpBiK,EAAMK,EAAQF,GAAGnK,GAAG,GACpBiK,GAAMK,GAAQH,GAAGlK,GAAG,GACd6J,GAAKnZ,GAAG,GAAImZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,GAAG,GAAO8J,GAAG9J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO6J,GAAG7J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO4J,GAAG5J,GAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,GAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,GAAG,GACpB4J,EAAMK,GAAQH,GAAG7J,GAAG,GACdwJ,GAAK9Y,GAAG,GAAI8Y,GAAK,GActB,IAbKA,GAAKb,GACTtX,GAAKmY,GACLA,GAAK,IAELnY,GAAKsX,EACLa,IAAMb,GAEPxC,EAAMrG,GAAG,GAAOzO,GAAGyO,GAAG,GACtBsG,EAAMrG,GAAG,GAAO1O,GAAG0O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO3O,GAAG2O,GAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,GAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,GAAG,GACpBwJ,EAAMI,EAAQH,GAAGxJ,GAAG,GACdoJ,GAAK1Y,GAAG,GAAI0Y,GAAK,GActB,IAbKA,GAAKT,GACTvX,GAAKgY,GACLA,GAAK,IAELhY,GAAKuX,EACLS,IAAMT,GAEP7C,EAAMhG,GAAG,GAAO1O,GAAG0O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO3O,GAAG2O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO5O,GAAG4O,GAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,GAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,GAAG,GACpB+I,EAAMS,EAAQH,GAAGpJ,GAAG,GACdmJ,GAAKzY,GAAG,GAAIyY,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,GAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,GAAG,GACnBuF,GAAKwD,EAAQK,GAAGnJ,GAAG,GAGnByF,EAAM3F,GAAG,GAAOiJ,GAAGjJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAOgJ,GAAGhJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAO+I,GAAG/I,GAAG,GAGhBgI,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK7U,GAAI6U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKzU,GAAIyU,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBN,EAAMK,IAAOtI,EAAKxL,EAAM4O,IAAM4E,EAAM3E,KACpCD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CACD3G,IAAM8G,EACN7G,IAAM8G,EACN7B,IAAM8B,CACN,CACDhH,IAAMmH,EACNlH,IAAMmH,EACNlC,IAAMmC,CACN,CACDrH,IAAMwH,EACNvH,IAAMwH,EACNvC,IAAMwC,CACN,CAUX,EClTA,SAA2BlZ,EAAGsR,EAAGtF,EAAGoC,GACnC,IAAI2L,EACAnX,EACAwT,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA9C,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA9C,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAS,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA1C,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAK,GACAK,GACA1C,GACAS,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACA/a,GACAqY,GACA3X,GACAC,GACAuY,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACA5L,GACAC,GACAC,GACAgJ,GACAC,GACAC,GACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAc,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACA5a,GA8BJ,IAxBAL,IADAK,GAAI6P,GAAWhS,EAAE/B,MAAO+B,EAAEzJ,QAAS+a,EAAE/a,QAASyV,EAAEzV,UACzCuL,GACPoP,GAAK/O,GAAE+O,GACPC,GAAKhP,GAAEgP,GACPC,GAAKjP,GAAEiP,GAGP2I,EAAQjE,GAAW9V,EAAEf,MAAOqS,EAAErS,MAAO+M,EAAE/M,OAGvCmb,GAAKpa,EAAE9B,OACPmc,GAAK/I,EAAEpT,OACPoc,GAAKtO,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTuT,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GAGH2L,GAAKjb,GAAG,GAAIib,GAAK,GAWtB,IAVKA,GAAKhD,GACT+C,GAAKC,GACLA,GAAK,IAELD,GAAK/C,EACLgD,IAAMhD,GAEP4C,EAAMvC,GAAO2C,GAAG7L,GAAG,GACnB0L,GAAMvC,GAAO0C,GAAG5L,GAAG,GACnB0L,GAAMvC,GAAOyC,GAAG3L,GAAG,GACbsL,GAAK5a,GAAG,GAAI4a,GAAK,GActB,IAbKA,GAAK3C,GACT0C,GAAKC,GACLA,GAAK,IAELD,GAAK1C,EACL2C,IAAM3C,GAEPV,EAAMnI,GAAG,GAAOuL,GAAGvL,GAAG,GACtBoI,EAAMnI,GAAG,GAAOsL,GAAGtL,GAAG,GACtBoI,EAAMnI,GAAG,GAAOqL,GAAGrL,GAAG,GACtBkL,EAAMK,EAAQD,GAAGxL,GAAG,GACpBqL,GAAMK,GAAQF,GAAGvL,GAAG,GACpBqL,GAAMK,GAAQH,GAAGtL,GAAG,GACdiL,GAAKva,GAAG,GAAIua,GAAK,GActB,IAbKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPf,EAAM9H,GAAG,GAAOkL,GAAGlL,GAAG,GACtB+H,EAAM9H,GAAG,GAAOiL,GAAGjL,GAAG,GACtB+H,EAAM9H,GAAG,GAAOgL,GAAGhL,GAAG,GACtB6K,EAAMK,EAAQD,GAAGnL,GAAG,GACpBgL,EAAMK,GAAQF,GAAGlL,GAAG,GACpBgL,GAAMK,GAAQH,GAAGjL,GAAG,GACd4K,GAAKla,GAAG,GAAIka,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzH,GAAG,GAAO6K,GAAG7K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO4K,GAAG5K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO2K,GAAG3K,GAAG,GACtBwK,EAAMK,EAAQD,GAAG9K,GAAG,GACpB2K,EAAMK,EAAQF,GAAG7K,GAAG,GACpB2K,GAAMK,GAAQH,GAAG5K,GAAG,GACduK,GAAK7Z,GAAG,GAAI6Z,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpH,GAAG,GAAOwK,GAAGxK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOuK,GAAGvK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOsK,GAAGtK,GAAG,GACtBmK,EAAMK,EAAQD,GAAGzK,GAAG,GACpBsK,EAAMK,EAAQF,GAAGxK,GAAG,GACpBsK,GAAMK,GAAQH,GAAGvK,GAAG,GACdkK,GAAKxZ,GAAG,GAAIwZ,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,GAAG,GAAOmK,GAAGnK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOkK,GAAGlK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOiK,GAAGjK,GAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,GAAG,GACpBiK,EAAMK,EAAQF,GAAGnK,GAAG,GACpBiK,GAAMK,GAAQH,GAAGlK,GAAG,GACd6J,GAAKnZ,GAAG,GAAImZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,GAAG,GAAO8J,GAAG9J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO6J,GAAG7J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO4J,GAAG5J,GAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,GAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,GAAG,GACpB4J,GAAMK,GAAQH,GAAG7J,GAAG,GACdwJ,GAAK9Y,GAAG,GAAI8Y,GAAK,GActB,IAbKA,GAAKb,GACTtX,GAAKmY,GACLA,GAAK,IAELnY,GAAKsX,EACLa,IAAMb,GAEPxC,EAAMrG,GAAG,GAAOzO,GAAGyO,GAAG,GACtBsG,EAAMrG,GAAG,GAAO1O,GAAG0O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO3O,GAAG2O,GAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,GAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,GAAG,GACpBwJ,GAAMI,GAAQH,GAAGxJ,GAAG,GACdoJ,GAAK1Y,GAAG,GAAI0Y,GAAK,GActB,IAbKA,GAAKT,GACTvX,GAAKgY,GACLA,GAAK,IAELhY,GAAKuX,EACLS,IAAMT,GAEP7C,EAAMhG,GAAG,GAAO1O,GAAG0O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO3O,GAAG2O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO5O,GAAG4O,GAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,GAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,GAAG,GACpB+I,GAAMS,GAAQH,GAAGpJ,GAAG,GACdmJ,GAAKzY,GAAG,GAAIyY,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,GAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,GAAG,GACnBuF,GAAKwD,GAAQK,GAAGnJ,GAAG,GAGnByF,EAAM3F,GAAG,GAAOiJ,GAAGjJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAOgJ,GAAGhJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAO+I,GAAG/I,GAAG,GAGhBqI,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK7U,GAAI6U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKzU,GAAIyU,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBN,EAAMK,IAAOtI,EAAKxL,EAAM4O,IAAM4E,EAAM3E,KACpCD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CACD3G,IAAM8G,EACN7G,IAAM8G,EACN7B,IAAM8B,CACN,CACDhH,IAAMmH,EACNlH,IAAMmH,EACNlC,IAAMmC,CACN,CACDrH,IAAMwH,EACNvH,IAAMwH,EACNvC,IAAMwC,CACN,CACD1H,IAAM6H,EACN5H,IAAM6H,EACN5C,IAAM6C,CACN,CAWZ,G/BlVIyD,GAA0B,CgCS9B,SAA0Bhd,EAAGsR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACAnX,EACAwT,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAN,EACAO,EACAN,EACAO,EACAiD,EACAC,EACAC,EACApY,EACAqY,EACA3X,EACA0O,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EACAiF,EACAC,EACAM,EACAsD,EACAC,EACArY,EAmCJ,IA7BAL,GADAK,EAAI6P,GAAWhS,EAAE/B,MAAO+B,EAAEzJ,QAAS+a,EAAE/a,QAASyV,EAAEzV,UACzCuL,GACPoP,EAAK/O,EAAE+O,GACPC,EAAKhP,EAAEgP,GACPC,EAAKjP,EAAEiP,GAGP2I,EAAQjE,GAAW9V,EAAEf,MAAOqS,EAAErS,MAAO+M,EAAE/M,OAGvCmb,EAAKpa,EAAE9B,OACPmc,EAAK/I,EAAEpT,OACPoc,EAAKtO,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTuT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGTuI,EAAO3Z,EAAEwD,UAAU,GACnBoW,EAAOtI,EAAE9N,UAAU,GACnBqW,EAAO7N,EAAExI,UAAU,GAGbgX,EAAK1Y,EAAG,GAAI0Y,EAAK,GAWtB,IAVKA,EAAKT,GACTvX,EAAKgY,EACLA,EAAK,IAELhY,EAAKuX,EACLS,GAAMT,GAEPC,EAAMI,EAAOI,EAAGtJ,EAAG,GACnB+I,EAAMI,EAAOG,EAAGrJ,EAAG,GACnB+I,EAAMI,EAAOE,EAAGpJ,EAAG,GACbmJ,EAAKzY,EAAG,GAAIyY,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPvI,EAAKwI,EAAQO,EAAGrJ,EAAG,GACnBO,EAAKwI,EAAQM,EAAGpJ,EAAG,GACnBuF,EAAKwD,EAAQK,EAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhB6F,EAAK,EAAGA,EAAKzU,EAAIyU,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAM/W,EAAM4O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CAGJ,EC7GA,SAA0B/W,EAAGsR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACAnX,EACAwT,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAX,EACAO,EACAK,EACAX,EACAO,EACAK,EACA4C,EACAS,EACAR,EACAS,EACAR,EACAS,EACA7Y,EACAqY,EACA3X,EACAC,EACAyO,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAiD,EACAC,EACAI,EACAzY,EAmCJ,IA7BAL,GADAK,EAAI6P,GAAWhS,EAAE/B,MAAO+B,EAAEzJ,QAAS+a,EAAE/a,QAASyV,EAAEzV,UACzCuL,GACPoP,EAAK/O,EAAE+O,GACPC,EAAKhP,EAAEgP,GACPC,EAAKjP,EAAEiP,GAGP2I,EAAQjE,GAAW9V,EAAEf,MAAOqS,EAAErS,MAAO+M,EAAE/M,OAGvCmb,EAAKpa,EAAE9B,OACPmc,EAAK/I,EAAEpT,OACPoc,EAAKtO,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTuT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGTuI,EAAO3Z,EAAEwD,UAAU,GACnBoW,EAAOtI,EAAE9N,UAAU,GACnBqW,EAAO7N,EAAExI,UAAU,GAGboX,EAAK9Y,EAAG,GAAI8Y,EAAK,GAWtB,IAVKA,EAAKb,GACTtX,EAAKmY,EACLA,EAAK,IAELnY,EAAKsX,EACLa,GAAMb,GAEPU,EAAML,EAAOQ,EAAG1J,EAAG,GACnBwJ,EAAML,EAAOO,EAAGzJ,EAAG,GACnBwJ,EAAML,EAAOM,EAAGxJ,EAAG,GACboJ,EAAK1Y,EAAG,GAAI0Y,EAAK,GActB,IAbKA,EAAKT,GACTvX,EAAKgY,EACLA,EAAK,IAELhY,EAAKuX,EACLS,GAAMT,GAEP7C,EAAMhG,EAAG,GAAO1O,EAAG0O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO5O,EAAG4O,EAAG,GACtB4I,EAAMS,EAAQD,EAAGtJ,EAAG,GACpB+I,EAAMS,EAAQF,EAAGrJ,EAAG,GACpB+I,EAAMS,EAAQH,EAAGpJ,EAAG,GACdmJ,EAAKzY,EAAG,GAAIyY,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPvI,EAAKwI,EAAQO,EAAGrJ,EAAG,GACnBO,EAAKwI,EAAQM,EAAGpJ,EAAG,GACnBuF,EAAKwD,EAAQK,EAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhBkG,EAAK,EAAGA,EAAK7U,EAAI6U,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKzU,EAAIyU,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAM/W,EAAM4O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CAIL,EC5IA,SAA0BpX,EAAGsR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACAnX,EACAwT,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAuC,EACAS,EACAI,EACAZ,EACAS,EACAI,EACAZ,EACAS,EACAI,EACAjZ,EACAqY,EACA3X,EACAC,EACAuY,EACA9J,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACA4C,EACAC,EACAI,EACAK,EACA9Y,GAmCJ,IA7BAL,GADAK,GAAI6P,GAAWhS,EAAE/B,MAAO+B,EAAEzJ,QAAS+a,EAAE/a,QAASyV,EAAEzV,UACzCuL,GACPoP,EAAK/O,GAAE+O,GACPC,EAAKhP,GAAEgP,GACPC,EAAKjP,GAAEiP,GAGP2I,EAAQjE,GAAW9V,EAAEf,MAAOqS,EAAErS,MAAO+M,EAAE/M,OAGvCmb,EAAKpa,EAAE9B,OACPmc,EAAK/I,EAAEpT,OACPoc,EAAKtO,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTuT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGTuI,EAAO3Z,EAAEwD,UAAU,GACnBoW,EAAOtI,EAAE9N,UAAU,GACnBqW,EAAO7N,EAAExI,UAAU,GAGbyX,EAAKnZ,EAAG,GAAImZ,EAAK,GAWtB,IAVKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPc,EAAMT,EAAOa,EAAG/J,EAAG,GACnB4J,EAAMT,EAAOY,EAAG9J,EAAG,GACnB4J,EAAMT,EAAOW,EAAG7J,EAAG,GACbwJ,EAAK9Y,EAAG,GAAI8Y,EAAK,GActB,IAbKA,EAAKb,GACTtX,EAAKmY,EACLA,EAAK,IAELnY,EAAKsX,EACLa,GAAMb,GAEPxC,EAAMrG,EAAG,GAAOzO,EAAGyO,EAAG,GACtBsG,EAAMrG,EAAG,GAAO1O,EAAG0O,EAAG,GACtBsG,EAAMrG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBqJ,EAAMI,EAAQD,EAAG1J,EAAG,GACpBwJ,EAAMI,EAAQF,EAAGzJ,EAAG,GACpBwJ,EAAMI,EAAQH,EAAGxJ,EAAG,GACdoJ,EAAK1Y,EAAG,GAAI0Y,EAAK,GActB,IAbKA,EAAKT,GACTvX,EAAKgY,EACLA,EAAK,IAELhY,EAAKuX,EACLS,GAAMT,GAEP7C,EAAMhG,EAAG,GAAO1O,EAAG0O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO5O,EAAG4O,EAAG,GACtB4I,EAAMS,EAAQD,EAAGtJ,EAAG,GACpB+I,EAAMS,EAAQF,EAAGrJ,EAAG,GACpB+I,EAAMS,EAAQH,EAAGpJ,EAAG,GACdmJ,EAAKzY,EAAG,GAAIyY,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPvI,EAAKwI,EAAQO,EAAGrJ,EAAG,GACnBO,EAAKwI,EAAQM,EAAGpJ,EAAG,GACnBuF,EAAKwD,EAAQK,EAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhBuG,EAAK,EAAGA,EAAKqD,EAAIrD,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAK7U,EAAI6U,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKzU,EAAIyU,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAM/W,EAAM4O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CAKN,ECzKA,SAA0BzX,EAAGsR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACAnX,EACAwT,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACAkC,EACAS,EACAI,EACAK,EACAjB,EACAS,EACAI,EACAK,EACAjB,EACAS,EACAI,EACAK,EACAtZ,EACAqY,EACA3X,EACAC,EACAuY,EACAK,EACAnK,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EACAiF,EACAC,EACAM,GACAK,GACAK,GACAK,GACAuC,GACAC,GACAI,GACAK,GACAK,GACAnZ,GAmCJ,IA7BAL,GADAK,GAAI6P,GAAWhS,EAAE/B,MAAO+B,EAAEzJ,QAAS+a,EAAE/a,QAASyV,EAAEzV,UACzCuL,GACPoP,EAAK/O,GAAE+O,GACPC,EAAKhP,GAAEgP,GACPC,EAAKjP,GAAEiP,GAGP2I,EAAQjE,GAAW9V,EAAEf,MAAOqS,EAAErS,MAAO+M,EAAE/M,OAGvCmb,EAAKpa,EAAE9B,OACPmc,EAAK/I,EAAEpT,OACPoc,EAAKtO,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTuT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGTuI,EAAO3Z,EAAEwD,UAAU,GACnBoW,EAAOtI,EAAE9N,UAAU,GACnBqW,EAAO7N,EAAExI,UAAU,GAGb8X,GAAKxZ,EAAG,GAAIwZ,GAAK,GAWtB,IAVKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEPmB,EAAMd,EAAOkB,GAAGpK,EAAG,GACnBiK,EAAMd,EAAOiB,GAAGnK,EAAG,GACnBiK,EAAMd,EAAOgB,GAAGlK,EAAG,GACb6J,GAAKnZ,EAAG,GAAImZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,EAAG,GAAO8J,EAAG9J,EAAG,GACtB2G,EAAM1G,EAAG,GAAO6J,EAAG7J,EAAG,GACtB2G,EAAM1G,EAAG,GAAO4J,EAAG5J,EAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,EAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,EAAG,GACpB4J,EAAMK,EAAQH,GAAG7J,EAAG,GACdwJ,GAAK9Y,EAAG,GAAI8Y,GAAK,GActB,IAbKA,GAAKb,GACTtX,EAAKmY,GACLA,GAAK,IAELnY,EAAKsX,EACLa,IAAMb,GAEPxC,EAAMrG,EAAG,GAAOzO,EAAGyO,EAAG,GACtBsG,EAAMrG,EAAG,GAAO1O,EAAG0O,EAAG,GACtBsG,EAAMrG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,EAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,EAAG,GACpBwJ,EAAMI,EAAQH,GAAGxJ,EAAG,GACdoJ,GAAK1Y,EAAG,GAAI0Y,GAAK,GActB,IAbKA,GAAKT,GACTvX,EAAKgY,GACLA,GAAK,IAELhY,EAAKuX,EACLS,IAAMT,GAEP7C,EAAMhG,EAAG,GAAO1O,EAAG0O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO5O,EAAG4O,EAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,EAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,EAAG,GACpB+I,EAAMS,EAAQH,GAAGpJ,EAAG,GACdmJ,GAAKzY,EAAG,GAAIyY,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPvI,EAAKwI,EAAQO,GAAGrJ,EAAG,GACnBO,EAAKwI,EAAQM,GAAGpJ,EAAG,GACnBuF,EAAKwD,EAAQK,GAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhB4G,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK7U,EAAI6U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKzU,EAAIyU,KAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAM/W,EAAM4O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CAMP,ECtMA,SAA0B9X,EAAGsR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACAnX,EACAwT,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACA6B,EACAS,EACAI,EACAK,EACAK,EACAtB,EACAS,EACAI,EACAK,EACAK,EACAtB,EACAS,EACAI,EACAK,EACAK,EACA3Z,EACAqY,EACA3X,EACAC,EACAuY,EACAK,EACAK,EACAxK,EACAC,EACAC,EACAgJ,GACAC,GACAC,GACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAkC,GACAC,GACAI,GACAK,GACAK,GACAK,GACAxZ,GAmCJ,IA7BAL,GADAK,GAAI6P,GAAWhS,EAAE/B,MAAO+B,EAAEzJ,QAAS+a,EAAE/a,QAASyV,EAAEzV,UACzCuL,GACPoP,EAAK/O,GAAE+O,GACPC,EAAKhP,GAAEgP,GACPC,EAAKjP,GAAEiP,GAGP2I,EAAQjE,GAAW9V,EAAEf,MAAOqS,EAAErS,MAAO+M,EAAE/M,OAGvCmb,GAAKpa,EAAE9B,OACPmc,GAAK/I,EAAEpT,OACPoc,GAAKtO,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTuT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGTuI,EAAO3Z,EAAEwD,UAAU,GACnBoW,EAAOtI,EAAE9N,UAAU,GACnBqW,EAAO7N,EAAExI,UAAU,GAGbmY,GAAK7Z,EAAG,GAAI6Z,GAAK,GAWtB,IAVKA,GAAK5B,GACT2B,EAAKC,GACLA,GAAK,IAELD,EAAK3B,EACL4B,IAAM5B,GAEPwB,EAAMnB,GAAOuB,GAAGzK,EAAG,GACnBsK,EAAMnB,GAAOsB,GAAGxK,EAAG,GACnBsK,EAAMnB,GAAOqB,GAAGvK,EAAG,GACbkK,GAAKxZ,EAAG,GAAIwZ,GAAK,GActB,IAbKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,EAAG,GAAOmK,EAAGnK,EAAG,GACtBgH,EAAM/G,EAAG,GAAOkK,EAAGlK,EAAG,GACtBgH,EAAM/G,EAAG,GAAOiK,EAAGjK,EAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,EAAG,GACpBiK,EAAMK,EAAQF,GAAGnK,EAAG,GACpBiK,EAAMK,EAAQH,GAAGlK,EAAG,GACd6J,GAAKnZ,EAAG,GAAImZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,EAAG,GAAO8J,EAAG9J,EAAG,GACtB2G,EAAM1G,EAAG,GAAO6J,EAAG7J,EAAG,GACtB2G,EAAM1G,EAAG,GAAO4J,EAAG5J,EAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,EAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,EAAG,GACpB4J,EAAMK,EAAQH,GAAG7J,EAAG,GACdwJ,GAAK9Y,EAAG,GAAI8Y,GAAK,GActB,IAbKA,GAAKb,GACTtX,EAAKmY,GACLA,GAAK,IAELnY,EAAKsX,EACLa,IAAMb,GAEPxC,EAAMrG,EAAG,GAAOzO,EAAGyO,EAAG,GACtBsG,EAAMrG,EAAG,GAAO1O,EAAG0O,EAAG,GACtBsG,EAAMrG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,EAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,EAAG,GACpBwJ,EAAMI,EAAQH,GAAGxJ,EAAG,GACdoJ,GAAK1Y,EAAG,GAAI0Y,GAAK,GActB,IAbKA,GAAKT,GACTvX,EAAKgY,GACLA,GAAK,IAELhY,EAAKuX,EACLS,IAAMT,GAEP7C,EAAMhG,EAAG,GAAO1O,EAAG0O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO5O,EAAG4O,EAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,EAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,EAAG,GACpB+I,EAAMS,EAAQH,GAAGpJ,EAAG,GACdmJ,GAAKzY,EAAG,GAAIyY,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,EAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,EAAG,GACnBuF,GAAKwD,EAAQK,GAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhBiH,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK7U,EAAI6U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKzU,EAAIyU,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,EAAIxD,KACtBkD,EAAMxD,EAAMK,GAAItI,EAAKuL,EAAM/W,EAAM4O,IAAMoI,EAAMxD,EAAM3E,MACnDD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CAOR,ECnOA,SAA0BnY,EAAGsR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACAnX,EACAwT,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAwB,EACAS,EACAI,EACAK,EACAK,EACAK,EACA3B,EACAS,EACAI,EACAK,EACAK,EACAK,EACA3B,EACAS,EACAI,EACAK,EACAK,EACAK,EACAha,EACAqY,EACA3X,EACAC,EACAuY,GACAK,GACAK,GACAK,GACA7K,GACAC,GACAC,GACAgJ,GACAC,GACAC,GACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACA6B,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACA7Z,GAmCJ,IA7BAL,GADAK,GAAI6P,GAAWhS,EAAE/B,MAAO+B,EAAEzJ,QAAS+a,EAAE/a,QAASyV,EAAEzV,UACzCuL,GACPoP,GAAK/O,GAAE+O,GACPC,GAAKhP,GAAEgP,GACPC,GAAKjP,GAAEiP,GAGP2I,EAAQjE,GAAW9V,EAAEf,MAAOqS,EAAErS,MAAO+M,EAAE/M,OAGvCmb,GAAKpa,EAAE9B,OACPmc,GAAK/I,EAAEpT,OACPoc,GAAKtO,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTuT,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GAGTuI,EAAO3Z,EAAEwD,UAAU,GACnBoW,EAAOtI,EAAE9N,UAAU,GACnBqW,EAAO7N,EAAExI,UAAU,GAGbwY,GAAKla,EAAG,GAAIka,GAAK,GAWtB,IAVKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEP6B,EAAMxB,GAAO4B,GAAG9K,GAAG,GACnB2K,EAAMxB,GAAO2B,GAAG7K,GAAG,GACnB2K,EAAMxB,GAAO0B,GAAG5K,GAAG,GACbuK,GAAK7Z,EAAG,GAAI6Z,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpH,GAAG,GAAOwK,GAAGxK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOuK,GAAGvK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOsK,GAAGtK,GAAG,GACtBmK,EAAMK,EAAQD,GAAGzK,GAAG,GACpBsK,EAAMK,EAAQF,GAAGxK,GAAG,GACpBsK,EAAMK,EAAQH,GAAGvK,GAAG,GACdkK,GAAKxZ,EAAG,GAAIwZ,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,GAAG,GAAOmK,GAAGnK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOkK,GAAGlK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOiK,GAAGjK,GAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,GAAG,GACpBiK,EAAMK,EAAQF,GAAGnK,GAAG,GACpBiK,EAAMK,EAAQH,GAAGlK,GAAG,GACd6J,GAAKnZ,EAAG,GAAImZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,GAAG,GAAO8J,GAAG9J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO6J,GAAG7J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO4J,GAAG5J,GAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,GAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,GAAG,GACpB4J,EAAMK,EAAQH,GAAG7J,GAAG,GACdwJ,GAAK9Y,EAAG,GAAI8Y,GAAK,GActB,IAbKA,GAAKb,GACTtX,EAAKmY,GACLA,GAAK,IAELnY,EAAKsX,EACLa,IAAMb,GAEPxC,EAAMrG,GAAG,GAAOzO,EAAGyO,GAAG,GACtBsG,EAAMrG,GAAG,GAAO1O,EAAG0O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO3O,EAAG2O,GAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,GAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,GAAG,GACpBwJ,EAAMI,EAAQH,GAAGxJ,GAAG,GACdoJ,GAAK1Y,EAAG,GAAI0Y,GAAK,GActB,IAbKA,GAAKT,GACTvX,EAAKgY,GACLA,GAAK,IAELhY,EAAKuX,EACLS,IAAMT,GAEP7C,EAAMhG,GAAG,GAAO1O,EAAG0O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO3O,EAAG2O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO5O,EAAG4O,GAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,GAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,GAAG,GACpB+I,EAAMS,EAAQH,GAAGpJ,GAAG,GACdmJ,GAAKzY,EAAG,GAAIyY,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,GAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,GAAG,GACnBuF,GAAKwD,EAAQK,GAAGnJ,GAAG,GAGnByF,EAAM3F,GAAG,GAAOiJ,EAAGjJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAOgJ,EAAGhJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAO+I,EAAG/I,GAAG,GAGhBsH,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK7U,EAAI6U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKzU,EAAIyU,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,EAAIxD,KACtBkD,EAAMxD,EAAMK,GAAItI,EAAKuL,EAAM/W,EAAM4O,IAAMoI,EAAMxD,EAAM3E,MACnDD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CACD3G,IAAM8G,EACN7G,IAAM8G,EACN7B,IAAM8B,CACN,CAQT,EChQA,SAA0BxY,EAAGsR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACAnX,EACAwT,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACApC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACApC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAmB,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAhC,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAhC,EACAS,EACAI,EACAK,EACAK,EACAK,GACAK,GACAra,GACAqY,GACA3X,GACAC,GACAuY,GACAK,GACAK,GACAK,GACAK,GACAlL,GACAC,GACAC,GACAgJ,GACAC,GACAC,GACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAwB,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAla,GAmCJ,IA7BAL,IADAK,GAAI6P,GAAWhS,EAAE/B,MAAO+B,EAAEzJ,QAAS+a,EAAE/a,QAASyV,EAAEzV,UACzCuL,GACPoP,GAAK/O,GAAE+O,GACPC,GAAKhP,GAAEgP,GACPC,GAAKjP,GAAEiP,GAGP2I,EAAQjE,GAAW9V,EAAEf,MAAOqS,EAAErS,MAAO+M,EAAE/M,OAGvCmb,GAAKpa,EAAE9B,OACPmc,GAAK/I,EAAEpT,OACPoc,GAAKtO,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTuT,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GAGTuI,EAAO3Z,EAAEwD,UAAU,GACnBoW,EAAOtI,EAAE9N,UAAU,GACnBqW,EAAO7N,EAAExI,UAAU,GAGb6Y,GAAKva,GAAG,GAAIua,GAAK,GAWtB,IAVKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPkC,EAAM7B,GAAOiC,GAAGnL,GAAG,GACnBgL,EAAM7B,GAAOgC,GAAGlL,GAAG,GACnBgL,GAAM7B,GAAO+B,GAAGjL,GAAG,GACb4K,GAAKla,GAAG,GAAIka,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzH,GAAG,GAAO6K,GAAG7K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO4K,GAAG5K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO2K,GAAG3K,GAAG,GACtBwK,EAAMK,EAAQD,GAAG9K,GAAG,GACpB2K,EAAMK,EAAQF,GAAG7K,GAAG,GACpB2K,GAAMK,GAAQH,GAAG5K,GAAG,GACduK,GAAK7Z,GAAG,GAAI6Z,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpH,GAAG,GAAOwK,GAAGxK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOuK,GAAGvK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOsK,GAAGtK,GAAG,GACtBmK,EAAMK,EAAQD,GAAGzK,GAAG,GACpBsK,EAAMK,EAAQF,GAAGxK,GAAG,GACpBsK,EAAMK,GAAQH,GAAGvK,GAAG,GACdkK,GAAKxZ,GAAG,GAAIwZ,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,GAAG,GAAOmK,GAAGnK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOkK,GAAGlK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOiK,GAAGjK,GAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,GAAG,GACpBiK,EAAMK,EAAQF,GAAGnK,GAAG,GACpBiK,EAAMK,EAAQH,GAAGlK,GAAG,GACd6J,GAAKnZ,GAAG,GAAImZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,GAAG,GAAO8J,GAAG9J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO6J,GAAG7J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO4J,GAAG5J,GAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,GAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,GAAG,GACpB4J,EAAMK,EAAQH,GAAG7J,GAAG,GACdwJ,GAAK9Y,GAAG,GAAI8Y,GAAK,GActB,IAbKA,GAAKb,GACTtX,GAAKmY,GACLA,GAAK,IAELnY,GAAKsX,EACLa,IAAMb,GAEPxC,EAAMrG,GAAG,GAAOzO,GAAGyO,GAAG,GACtBsG,EAAMrG,GAAG,GAAO1O,GAAG0O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO3O,GAAG2O,GAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,GAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,GAAG,GACpBwJ,EAAMI,EAAQH,GAAGxJ,GAAG,GACdoJ,GAAK1Y,GAAG,GAAI0Y,GAAK,GActB,IAbKA,GAAKT,GACTvX,GAAKgY,GACLA,GAAK,IAELhY,GAAKuX,EACLS,IAAMT,GAEP7C,EAAMhG,GAAG,GAAO1O,GAAG0O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO3O,GAAG2O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO5O,GAAG4O,GAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,GAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,GAAG,GACpB+I,EAAMS,EAAQH,GAAGpJ,GAAG,GACdmJ,GAAKzY,GAAG,GAAIyY,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,GAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,GAAG,GACnBuF,GAAKwD,EAAQK,GAAGnJ,GAAG,GAGnByF,EAAM3F,GAAG,GAAOiJ,GAAGjJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAOgJ,GAAGhJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAO+I,GAAG/I,GAAG,GAGhB2H,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK7U,GAAI6U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKzU,GAAIyU,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBkD,EAAMxD,EAAMK,GAAItI,EAAKuL,EAAM/W,EAAM4O,IAAMoI,EAAMxD,EAAM3E,MACnDD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CACD3G,IAAM8G,EACN7G,IAAM8G,EACN7B,IAAM8B,CACN,CACDhH,IAAMmH,EACNlH,IAAMmH,EACNlC,IAAMmC,CACN,CASV,EC7RA,SAA0B7Y,EAAGsR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACAnX,EACAwT,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAzC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAzC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAc,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAK,EACArC,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAK,EACArC,GACAS,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACA1a,GACAqY,GACA3X,GACAC,GACAuY,GACAK,GACAK,GACAK,GACAK,GACAK,GACAvL,GACAC,GACAC,GACAgJ,GACAC,GACAC,GACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAmB,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAva,GAmCJ,IA7BAL,IADAK,GAAI6P,GAAWhS,EAAE/B,MAAO+B,EAAEzJ,QAAS+a,EAAE/a,QAASyV,EAAEzV,UACzCuL,GACPoP,GAAK/O,GAAE+O,GACPC,GAAKhP,GAAEgP,GACPC,GAAKjP,GAAEiP,GAGP2I,EAAQjE,GAAW9V,EAAEf,MAAOqS,EAAErS,MAAO+M,EAAE/M,OAGvCmb,GAAKpa,EAAE9B,OACPmc,GAAK/I,EAAEpT,OACPoc,GAAKtO,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTuT,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GAGTuI,EAAO3Z,EAAEwD,UAAU,GACnBoW,EAAOtI,EAAE9N,UAAU,GACnBqW,EAAO7N,EAAExI,UAAU,GAGbkZ,GAAK5a,GAAG,GAAI4a,GAAK,GAWtB,IAVKA,GAAK3C,GACT0C,GAAKC,GACLA,GAAK,IAELD,GAAK1C,EACL2C,IAAM3C,GAEPuC,EAAMlC,GAAOsC,GAAGxL,GAAG,GACnBqL,EAAMlC,GAAOqC,GAAGvL,GAAG,GACnBqL,GAAMlC,GAAOoC,GAAGtL,GAAG,GACbiL,GAAKva,GAAG,GAAIua,GAAK,GActB,IAbKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPf,EAAM9H,GAAG,GAAOkL,GAAGlL,GAAG,GACtB+H,EAAM9H,GAAG,GAAOiL,GAAGjL,GAAG,GACtB+H,EAAM9H,GAAG,GAAOgL,GAAGhL,GAAG,GACtB6K,EAAMK,EAAQD,GAAGnL,GAAG,GACpBgL,EAAMK,EAAQF,GAAGlL,GAAG,GACpBgL,GAAMK,GAAQH,GAAGjL,GAAG,GACd4K,GAAKla,GAAG,GAAIka,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzH,GAAG,GAAO6K,GAAG7K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO4K,GAAG5K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO2K,GAAG3K,GAAG,GACtBwK,EAAMK,EAAQD,GAAG9K,GAAG,GACpB2K,EAAMK,EAAQF,GAAG7K,GAAG,GACpB2K,GAAMK,GAAQH,GAAG5K,GAAG,GACduK,GAAK7Z,GAAG,GAAI6Z,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpH,GAAG,GAAOwK,GAAGxK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOuK,GAAGvK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOsK,GAAGtK,GAAG,GACtBmK,EAAMK,EAAQD,GAAGzK,GAAG,GACpBsK,EAAMK,EAAQF,GAAGxK,GAAG,GACpBsK,GAAMK,GAAQH,GAAGvK,GAAG,GACdkK,GAAKxZ,GAAG,GAAIwZ,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,GAAG,GAAOmK,GAAGnK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOkK,GAAGlK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOiK,GAAGjK,GAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,GAAG,GACpBiK,EAAMK,EAAQF,GAAGnK,GAAG,GACpBiK,GAAMK,GAAQH,GAAGlK,GAAG,GACd6J,GAAKnZ,GAAG,GAAImZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,GAAG,GAAO8J,GAAG9J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO6J,GAAG7J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO4J,GAAG5J,GAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,GAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,GAAG,GACpB4J,GAAMK,GAAQH,GAAG7J,GAAG,GACdwJ,GAAK9Y,GAAG,GAAI8Y,GAAK,GActB,IAbKA,GAAKb,GACTtX,GAAKmY,GACLA,GAAK,IAELnY,GAAKsX,EACLa,IAAMb,GAEPxC,EAAMrG,GAAG,GAAOzO,GAAGyO,GAAG,GACtBsG,EAAMrG,GAAG,GAAO1O,GAAG0O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO3O,GAAG2O,GAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,GAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,GAAG,GACpBwJ,GAAMI,GAAQH,GAAGxJ,GAAG,GACdoJ,GAAK1Y,GAAG,GAAI0Y,GAAK,GActB,IAbKA,GAAKT,GACTvX,GAAKgY,GACLA,GAAK,IAELhY,GAAKuX,EACLS,IAAMT,GAEP7C,EAAMhG,GAAG,GAAO1O,GAAG0O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO3O,GAAG2O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO5O,GAAG4O,GAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,GAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,GAAG,GACpB+I,GAAMS,GAAQH,GAAGpJ,GAAG,GACdmJ,GAAKzY,GAAG,GAAIyY,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,GAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,GAAG,GACnBuF,GAAKwD,GAAQK,GAAGnJ,GAAG,GAGnByF,EAAM3F,GAAG,GAAOiJ,GAAGjJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAOgJ,GAAGhJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAO+I,GAAG/I,GAAG,GAGhBgI,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK7U,GAAI6U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKzU,GAAIyU,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBkD,EAAMxD,EAAMK,GAAItI,EAAKuL,EAAM/W,EAAM4O,IAAMoI,EAAMxD,EAAM3E,MACnDD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CACD3G,IAAM8G,EACN7G,IAAM8G,EACN7B,IAAM8B,CACN,CACDhH,IAAMmH,EACNlH,IAAMmH,EACNlC,IAAMmC,CACN,CACDrH,IAAMwH,EACNvH,IAAMwH,EACNvC,IAAMwC,CACN,CAUX,EC1TA,SAA2BlZ,EAAGsR,EAAGtF,EAAGoC,GACnC,IAAI2L,EACAnX,EACAwT,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA9C,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA9C,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAS,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA1C,EACAS,EACAI,EACAK,EACAK,GACAK,GACAK,GACAK,GACAK,GACA1C,GACAS,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACA/a,GACAqY,GACA3X,GACAC,GACAuY,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACA5L,GACAC,GACAC,GACAgJ,GACAC,GACAC,GACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAc,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACA5a,GAmCJ,IA7BAL,IADAK,GAAI6P,GAAWhS,EAAE/B,MAAO+B,EAAEzJ,QAAS+a,EAAE/a,QAASyV,EAAEzV,UACzCuL,GACPoP,GAAK/O,GAAE+O,GACPC,GAAKhP,GAAEgP,GACPC,GAAKjP,GAAEiP,GAGP2I,EAAQjE,GAAW9V,EAAEf,MAAOqS,EAAErS,MAAO+M,EAAE/M,OAGvCmb,GAAKpa,EAAE9B,OACPmc,GAAK/I,EAAEpT,OACPoc,GAAKtO,EAAE9N,OAGP0E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTuT,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GAGTuI,EAAO3Z,EAAEwD,UAAU,GACnBoW,EAAOtI,EAAE9N,UAAU,GACnBqW,EAAO7N,EAAExI,UAAU,GAGbuZ,GAAKjb,GAAG,GAAIib,GAAK,GAWtB,IAVKA,GAAKhD,GACT+C,GAAKC,GACLA,GAAK,IAELD,GAAK/C,EACLgD,IAAMhD,GAEP4C,EAAMvC,GAAO2C,GAAG7L,GAAG,GACnB0L,GAAMvC,GAAO0C,GAAG5L,GAAG,GACnB0L,GAAMvC,GAAOyC,GAAG3L,GAAG,GACbsL,GAAK5a,GAAG,GAAI4a,GAAK,GActB,IAbKA,GAAK3C,GACT0C,GAAKC,GACLA,GAAK,IAELD,GAAK1C,EACL2C,IAAM3C,GAEPV,EAAMnI,GAAG,GAAOuL,GAAGvL,GAAG,GACtBoI,EAAMnI,GAAG,GAAOsL,GAAGtL,GAAG,GACtBoI,EAAMnI,GAAG,GAAOqL,GAAGrL,GAAG,GACtBkL,EAAMK,EAAQD,GAAGxL,GAAG,GACpBqL,GAAMK,GAAQF,GAAGvL,GAAG,GACpBqL,GAAMK,GAAQH,GAAGtL,GAAG,GACdiL,GAAKva,GAAG,GAAIua,GAAK,GActB,IAbKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPf,EAAM9H,GAAG,GAAOkL,GAAGlL,GAAG,GACtB+H,EAAM9H,GAAG,GAAOiL,GAAGjL,GAAG,GACtB+H,EAAM9H,GAAG,GAAOgL,GAAGhL,GAAG,GACtB6K,EAAMK,EAAQD,GAAGnL,GAAG,GACpBgL,GAAMK,GAAQF,GAAGlL,GAAG,GACpBgL,GAAMK,GAAQH,GAAGjL,GAAG,GACd4K,GAAKla,GAAG,GAAIka,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzH,GAAG,GAAO6K,GAAG7K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO4K,GAAG5K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO2K,GAAG3K,GAAG,GACtBwK,EAAMK,EAAQD,GAAG9K,GAAG,GACpB2K,GAAMK,GAAQF,GAAG7K,GAAG,GACpB2K,GAAMK,GAAQH,GAAG5K,GAAG,GACduK,GAAK7Z,GAAG,GAAI6Z,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpH,GAAG,GAAOwK,GAAGxK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOuK,GAAGvK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOsK,GAAGtK,GAAG,GACtBmK,EAAMK,EAAQD,GAAGzK,GAAG,GACpBsK,GAAMK,GAAQF,GAAGxK,GAAG,GACpBsK,GAAMK,GAAQH,GAAGvK,GAAG,GACdkK,GAAKxZ,GAAG,GAAIwZ,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,GAAG,GAAOmK,GAAGnK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOkK,GAAGlK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOiK,GAAGjK,GAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,GAAG,GACpBiK,EAAMK,GAAQF,GAAGnK,GAAG,GACpBiK,GAAMK,GAAQH,GAAGlK,GAAG,GACd6J,GAAKnZ,GAAG,GAAImZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,GAAG,GAAO8J,GAAG9J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO6J,GAAG7J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO4J,GAAG5J,GAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,GAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,GAAG,GACpB4J,GAAMK,GAAQH,GAAG7J,GAAG,GACdwJ,GAAK9Y,GAAG,GAAI8Y,GAAK,GActB,IAbKA,GAAKb,GACTtX,GAAKmY,GACLA,GAAK,IAELnY,GAAKsX,EACLa,IAAMb,GAEPxC,EAAMrG,GAAG,GAAOzO,GAAGyO,GAAG,GACtBsG,EAAMrG,GAAG,GAAO1O,GAAG0O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO3O,GAAG2O,GAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,GAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,GAAG,GACpBwJ,GAAMI,GAAQH,GAAGxJ,GAAG,GACdoJ,GAAK1Y,GAAG,GAAI0Y,GAAK,GActB,IAbKA,GAAKT,GACTvX,GAAKgY,GACLA,GAAK,IAELhY,GAAKuX,EACLS,IAAMT,GAEP7C,EAAMhG,GAAG,GAAO1O,GAAG0O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO3O,GAAG2O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO5O,GAAG4O,GAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,GAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,GAAG,GACpB+I,GAAMS,GAAQH,GAAGpJ,GAAG,GACdmJ,GAAKzY,GAAG,GAAIyY,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,GAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,GAAG,GACnBuF,GAAKwD,GAAQK,GAAGnJ,GAAG,GAGnByF,EAAM3F,GAAG,GAAOiJ,GAAGjJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAOgJ,GAAGhJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAO+I,GAAG/I,GAAG,GAGhBqI,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK7U,GAAI6U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKzU,GAAIyU,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBkD,EAAMxD,EAAMK,GAAItI,EAAKuL,EAAM/W,EAAM4O,IAAMoI,EAAMxD,EAAM3E,MACnDD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CACD3G,IAAM8G,EACN7G,IAAM8G,EACN7B,IAAM8B,CACN,CACDhH,IAAMmH,EACNlH,IAAMmH,EACNlC,IAAMmC,CACN,CACDrH,IAAMwH,EACNvH,IAAMwH,EACNvC,IAAMwC,CACN,CACD1H,IAAM6H,EACN5H,IAAM6H,EACN5C,IAAM6C,CACN,CAWZ,GxCvVI0D,GAAW9G,GAAOzf,OAAS,EAc/B,SAASwmB,GAAcld,EAAGsR,EAAGtF,GAC5B,OAAOuE,GAAc,CAAEvQ,EAAGsR,EAAGtF,GAAK,oBAAoB,EACvD,QA+DA,SAAiBmR,EAAQ/O,GACxB,IAAIjQ,EACAif,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACA3d,EACA4B,EACAqP,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACAuD,EACA7d,EACAsR,EACAtF,EACA8R,EACArnB,EAYJ,GATAuJ,EAAI+d,GAAgBZ,EAAQ,IAC5B7L,EAAIyM,GAAgBZ,EAAQ,IAC5BnR,EAAI+R,GAAgBZ,EAAQ,IAG5BI,EAAMvd,EAAE/B,MACRuf,EAAMlM,EAAErT,MACRwf,EAAMzR,EAAE/N,OACRE,EAAQof,EAAI7mB,UACG8mB,EAAI9mB,QAAUyH,IAAUsf,EAAI/mB,OAC1C,MAAM,IAAI8B,MAAOwD,GAAQ,uIAAwImC,EAAOqf,EAAI9mB,OAAQ+mB,EAAI/mB,SAGzL,GAAe,IAAVyH,EACJ,OAAK+e,GAAcld,EAAGsR,EAAGtF,GACjB0N,GAAiBvb,GAAS6B,EAAGsR,EAAGtF,EAAGoC,GAEpC+H,GAAQhY,GAAS6B,EAAGsR,EAAGtF,EAAGoC,GAKlC,IAFAnO,EAAM,EACN4d,EAAK,EACCpnB,EAAI,EAAGA,EAAI0H,EAAO1H,IAAM,CAE7B,IADAqnB,EAAIP,EAAK9mB,MACE+mB,EAAK/mB,IAAOqnB,IAAML,EAAKhnB,GACjC,MAAM,IAAI+B,MAAOwD,GAAO,WAGzBiE,GAAO6d,EAGI,IAANA,IACJD,GAAM,EAEP,CAED,GAAa,IAAR5d,EAAL,CAIA,GAAe,IAAV9B,EACJ,OAAK+e,GAAcld,EAAGsR,EAAGtF,GACjB0N,GAAiBvb,GAAS6B,EAAGsR,EAAGtF,EAAGoC,GAEpC+H,GAAQhY,GAAS6B,EAAGsR,EAAGtF,EAAGoC,GAOlC,GALA8C,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QAGFsnB,IAAO1f,EAAM,EAAI,CAErB,IAAM1H,EAAI,EAAGA,EAAI0H,GACE,IAAbof,EAAK9mB,GADaA,KAWxB,OANAuJ,EAAE/B,MAAQ,CAAEsf,EAAI9mB,IAChB6a,EAAErT,MAAQ+B,EAAE/B,MACZ+N,EAAE/N,MAAQ+B,EAAE/B,MACZ+B,EAAEzJ,QAAU,CAAE2a,EAAGza,IACjB6a,EAAE/a,QAAU,CAAE4a,EAAG1a,IACjBuV,EAAEzV,QAAU,CAAE6a,EAAG3a,IACZymB,GAAcld,EAAGsR,EAAGtF,GACjB0N,GAAiB,GAAK1Z,EAAGsR,EAAGtF,EAAGoC,GAEhC+H,GAAQ,GAAKnW,EAAGsR,EAAGtF,EAAGoC,EAC7B,CAOD,GANAsP,EAAMpnB,EAAgB4a,GACtByM,EAAMrnB,EAAgB6a,GACtByM,EAAMtnB,EAAgB8a,GAGtBvP,EAAMQ,GAAe6O,GACR,IAARwM,GAAqB,IAARC,GAAqB,IAARC,GAAa/b,IAAQQ,GAAe8O,IAAQtP,IAAQQ,GAAe+O,GAAO,CAOxG,GALAgM,EAAOpf,EAAuBuf,EAAKrM,EAAIlR,EAAE9B,QACzCmf,EAAOrf,EAAuBwf,EAAKrM,EAAIG,EAAEpT,QACzCof,EAAOtf,EAAuByf,EAAKrM,EAAIpF,EAAE9N,QAIxC+B,IAAUmd,EAAK,GAAGA,EAAK,GAAG,GAC1Bnd,IAAUod,EAAK,GAAGA,EAAK,GAAG,GAC1Bpd,IAAUqd,EAAK,GAAGA,EAAK,GAAG,EA2B1B,OAvBClD,EADY,IAARsD,EACCN,EAAM,GAENA,EAAM,GAGX/C,EADY,IAARsD,EACCN,EAAM,GAENA,EAAM,GAGX/C,EADY,IAARsD,EACCN,EAAM,GAENA,EAAM,GAEZtd,EAAE/B,MAAQ,CAAEgC,GACZqR,EAAErT,MAAQ+B,EAAE/B,MACZ+N,EAAE/N,MAAQ+B,EAAE/B,MACZ+B,EAAEzJ,QAAU,CAAEmnB,GACdpM,EAAE/a,QAAU,CAAEonB,GACd3R,EAAEzV,QAAU,CAAEqnB,GACd5d,EAAE9B,OAASkc,EACX9I,EAAEpT,OAASmc,EACXrO,EAAE9N,OAASoc,EACN4C,GAAcld,EAAGsR,EAAGtF,GACjB0N,GAAiB,GAAK1Z,EAAGsR,EAAGtF,EAAGoC,GAEhC+H,GAAQ,GAAKnW,EAAGsR,EAAGtF,EAAGoC,GAK9B,GAAKjQ,GAAS8e,GAEb,OAAKC,GAAcld,EAAGsR,EAAGtF,GACjB0N,GAAiBvb,GAAS6B,EAAGsR,EAAGtF,EAAW,IAARnK,EAAWuM,GAE/C+H,GAAQhY,GAAS6B,EAAGsR,EAAGtF,EAAW,IAARnK,EAAWuM,EAG7C,CAID,OAAKjQ,GAAS8e,GACRC,GAAcld,EAAGsR,EAAGtF,GACjBgR,GAAyB7e,EAAM,GAAK6B,EAAGsR,EAAGtF,EAAGoC,GAE9C0L,GAAgB3b,EAAM,GAAK6B,EAAGsR,EAAGtF,EAAGoC,GAGvC8O,GAAcld,EAAGsR,EAAGtF,GFjP1B,SAAmBhM,EAAGsR,EAAGtF,EAAGoC,GAC3B,IAAIxL,EACAwT,EACAC,EACA2H,EACAC,EACAC,EACAvE,EACAC,EACAC,EACA5Z,EACA6B,EACAoP,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EAEAhb,EAiCJ,IA5BAwJ,EAAMH,EAHNgC,EAAK9B,EAAE/B,OAMP2E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTmO,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QAGP6jB,EAAKpa,EAAE9B,OACPmc,EAAK/I,EAAEpT,OACPoc,EAAKtO,EAAE9N,OAGP8f,EAAOhe,EAAEwB,MACTyc,EAAO3M,EAAE9P,MACT0c,EAAOlS,EAAExK,MAGTmY,EAAO3Z,EAAEwD,UAAW,GACpBoW,EAAOtI,EAAE9N,UAAW,GACpBqW,EAAO7N,EAAExI,UAAW,GAGd/M,EAAI,EAAGA,EAAIwJ,EAAKxJ,IACrB+a,EAAKuE,GAAWjU,EAAIoP,EAAIkJ,EAAI4D,EAAMvnB,EAAGyf,IACrCzE,EAAKsE,GAAWjU,EAAIqP,EAAIkJ,EAAI4D,EAAMxnB,EAAGyf,IAErC2D,EAAMxD,EADDN,GAAWjU,EAAIsP,EAAIkJ,EAAI4D,EAAMznB,EAAGyf,IACrB9H,EAAKuL,EAAM/W,EAAM4O,GAAMoI,EAAMxD,EAAM3E,IAErD,CEsLS0M,CAAkBne,EAAGsR,EAAGtF,EAAGoC,QD1PpC,SAAmBpO,EAAGsR,EAAGtF,EAAGoC,GAC3B,IAAIxL,EACAwT,EACAC,EACA2H,EACAC,EACAC,EACAje,EACA6B,EACAoP,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EAEAhb,EA4BJ,IAvBAwJ,EAAMH,EAHNgC,EAAK9B,EAAE/B,OAMP2E,EAAO5C,EAAE+C,KACTqT,EAAO9E,EAAEvO,KACTsT,EAAOrK,EAAEjJ,KAGTmO,EAAKlR,EAAEzJ,QACP4a,EAAKG,EAAE/a,QACP6a,EAAKpF,EAAEzV,QAGP6jB,EAAKpa,EAAE9B,OACPmc,EAAK/I,EAAEpT,OACPoc,EAAKtO,EAAE9N,OAGP8f,EAAOhe,EAAEwB,MACTyc,EAAO3M,EAAE9P,MACT0c,EAAOlS,EAAExK,MAGH/K,EAAI,EAAGA,EAAIwJ,EAAKxJ,IACrB+a,EAAKuE,GAAWjU,EAAIoP,EAAIkJ,EAAI4D,EAAMvnB,EAAGyf,IACrCzE,EAAKsE,GAAWjU,EAAIqP,EAAIkJ,EAAI4D,EAAMxnB,EAAGyf,IAErCG,EADKN,GAAWjU,EAAIsP,EAAIkJ,EAAI4D,EAAMznB,EAAGyf,KACxB9H,EAAKxL,EAAM4O,GAAM4E,EAAM3E,GAEtC,CCwMC2M,CAAUpe,EAAGsR,EAAGtF,EAAGoC,EAxGlB,CAyGF","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266]} \ No newline at end of file diff --git a/dist/index.d.ts b/dist/index.d.ts deleted file mode 100644 index f2f5228..0000000 --- a/dist/index.d.ts +++ /dev/null @@ -1,3 +0,0 @@ -/// -import binary from '../docs/types/index'; -export = binary; \ No newline at end of file diff --git a/dist/index.js b/dist/index.js deleted file mode 100644 index de52db4..0000000 --- a/dist/index.js +++ /dev/null @@ -1,19 +0,0 @@ -"use strict";var Dr=function(a,e){return function(){try{return e||a((e={exports:{}}).exports,e),e.exports}catch(v){throw e=0,v}}};var ca=Dr(function(ud,ua){"use strict";var Hv=require("@stdlib/ndarray-base-binary-loop-interchange-order"),Jv=require("@stdlib/ndarray-base-binary-tiling-block-size");function Qv(a,e,v,fr){var r,Z,W,$,J,Q,T,V,X,G,K,P,H,L,D,F,_,i,l,c,E,q,k,w,C,z,h,A,u,p,b,f,g;for(g=Hv(a.shape,a.strides,e.strides,v.strides),_=g.sh,c=g.sx,E=g.sy,q=g.sz,r=Jv(a.dtype,e.dtype,v.dtype),k=a.offset,w=e.offset,C=v.offset,Z=a.data,W=e.data,$=v.data,V=c[0],G=E[0],P=q[0],J=a.accessors[0],Q=e.accessors[0],T=v.accessors[1],f=_[1];f>0;)for(f0;)for(b0;)for(m0;)for(O0;)for(o0;)for(M0;)for(R0;)for(N0;)for(x0;)for(dr0;)for(mr0;)for(ir0;)for(vr0;)for(er0;)for(ur0;)for(br0;)for(zr0;)for(gr0;)for(cr0;)for(tr0;)for(qr0;)for(jr0;)for(Sr0;)for(lr0;)for(nr0;)for(Ar0;)for(kr0;)for(Yr0;)for(Nr0;)for(Er0;)for(wr0;)for(Ir0;)for(Rr0;)for(Cr0;)for(Br0;)for(Lr0;)for(Hr0;)for(Kr0;)for(Mr0;)for(Fr0;)for(Xr0;)for(Vr0;)for(Pr0;)for(_r0;)for(ra0;)for($r0;)for(Zr0;)for(Wr0;)for(Ur0;)for(Tr0;)for(Qr0;)for(Jr0;)for(Gr0;)for(Lr0;)for(u0;)for(A0;)for(s0;)for(I0;)for(j0;)for(x0;)for(y0;)for(B0;)for(Y0;)for(vr0;)for(er0;)for(ar0;)for(rr0;)for(sr0;)for(gr0;)for(cr0;)for(tr0;)for(yr0;)for(xr0;)for(or0;)for(lr0;)for(nr0;)for(Ar0;)for(kr0;)for(hr0;)for(pr0;)for(ur0;)for(wr0;)for(Ir0;)for(Rr0;)for(Cr0;)for(Br0;)for(Or0;)for(qr0;)for(jr0;)for(Mr0;)for(Fr0;)for(Xr0;)for(Vr0;)for(Pr0;)for(_r0;)for(Yr0;)for(Nr0;)for(Er0;)for(Wr0;)for(Ur0;)for(Tr0;)for(Qr0;)for(Jr0;)for(Gr0;)for(Lr0;)for(Hr0;)for(Kr0;)for(Mr} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 6, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary2d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary2d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dy0;\n\tvar dy1;\n\tvar dz0;\n\tvar dz1;\n\tvar ox1;\n\tvar oy1;\n\tvar oz1;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar j0;\n\tvar j1;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\tif ( j1 < bsize ) {\n\t\t\ts1 = j1;\n\t\t\tj1 = 0;\n\t\t} else {\n\t\t\ts1 = bsize;\n\t\t\tj1 -= bsize;\n\t\t}\n\t\tox1 = ox + ( j1*sx[1] );\n\t\toy1 = oy + ( j1*sy[1] );\n\t\toz1 = oz + ( j1*sz[1] );\n\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\tif ( j0 < bsize ) {\n\t\t\t\ts0 = j0;\n\t\t\t\tj0 = 0;\n\t\t\t} else {\n\t\t\t\ts0 = bsize;\n\t\t\t\tj0 -= bsize;\n\t\t\t}\n\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t// Compute loop offset increments...\n\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t// Iterate over the ndarray dimensions...\n\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\tix += dx0;\n\t\t\t\t\tiy += dy0;\n\t\t\t\t\tiz += dz0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t\tiy += dy1;\n\t\t\t\tiz += dz1;\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in three-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n* var sy = [ 4, 2, 1 ];\n* var sz = [ 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary3d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary3d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar ox1;\n\tvar ox2;\n\tvar oy1;\n\tvar oy2;\n\tvar oz1;\n\tvar oz2;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\tif ( j2 < bsize ) {\n\t\t\ts2 = j2;\n\t\t\tj2 = 0;\n\t\t} else {\n\t\t\ts2 = bsize;\n\t\t\tj2 -= bsize;\n\t\t}\n\t\tox2 = ox + ( j2*sx[2] );\n\t\toy2 = oy + ( j2*sy[2] );\n\t\toz2 = oz + ( j2*sz[2] );\n\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\tif ( j1 < bsize ) {\n\t\t\t\ts1 = j1;\n\t\t\t\tj1 = 0;\n\t\t\t} else {\n\t\t\t\ts1 = bsize;\n\t\t\t\tj1 -= bsize;\n\t\t\t}\n\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\ts0 = j0;\n\t\t\t\t\tj0 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts0 = bsize;\n\t\t\t\t\tj0 -= bsize;\n\t\t\t\t}\n\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t// Compute loop offset increments...\n\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t\tiy += dy2;\n\t\t\t\t\tiz += dz2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in four-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary4d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary4d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\tif ( j3 < bsize ) {\n\t\t\ts3 = j3;\n\t\t\tj3 = 0;\n\t\t} else {\n\t\t\ts3 = bsize;\n\t\t\tj3 -= bsize;\n\t\t}\n\t\tox3 = ox + ( j3*sx[3] );\n\t\toy3 = oy + ( j3*sy[3] );\n\t\toz3 = oz + ( j3*sz[3] );\n\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\tif ( j2 < bsize ) {\n\t\t\t\ts2 = j2;\n\t\t\t\tj2 = 0;\n\t\t\t} else {\n\t\t\t\ts2 = bsize;\n\t\t\t\tj2 -= bsize;\n\t\t\t}\n\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\ts1 = j1;\n\t\t\t\t\tj1 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts1 = bsize;\n\t\t\t\t\tj1 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in five-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary5d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary5d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\tif ( j4 < bsize ) {\n\t\t\ts4 = j4;\n\t\t\tj4 = 0;\n\t\t} else {\n\t\t\ts4 = bsize;\n\t\t\tj4 -= bsize;\n\t\t}\n\t\tox4 = ox + ( j4*sx[4] );\n\t\toy4 = oy + ( j4*sy[4] );\n\t\toz4 = oz + ( j4*sz[4] );\n\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\tif ( j3 < bsize ) {\n\t\t\t\ts3 = j3;\n\t\t\t\tj3 = 0;\n\t\t\t} else {\n\t\t\t\ts3 = bsize;\n\t\t\t\tj3 -= bsize;\n\t\t\t}\n\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\ts2 = j2;\n\t\t\t\t\tj2 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts2 = bsize;\n\t\t\t\t\tj2 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in six-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary6d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary6d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\tif ( j5 < bsize ) {\n\t\t\ts5 = j5;\n\t\t\tj5 = 0;\n\t\t} else {\n\t\t\ts5 = bsize;\n\t\t\tj5 -= bsize;\n\t\t}\n\t\tox5 = ox + ( j5*sx[5] );\n\t\toy5 = oy + ( j5*sy[5] );\n\t\toz5 = oz + ( j5*sz[5] );\n\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\tif ( j4 < bsize ) {\n\t\t\t\ts4 = j4;\n\t\t\t\tj4 = 0;\n\t\t\t} else {\n\t\t\t\ts4 = bsize;\n\t\t\t\tj4 -= bsize;\n\t\t\t}\n\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\ts3 = j3;\n\t\t\t\t\tj3 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts3 = bsize;\n\t\t\t\t\tj3 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary6d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in seven-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary7d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary7d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\tif ( j6 < bsize ) {\n\t\t\ts6 = j6;\n\t\t\tj6 = 0;\n\t\t} else {\n\t\t\ts6 = bsize;\n\t\t\tj6 -= bsize;\n\t\t}\n\t\tox6 = ox + ( j6*sx[6] );\n\t\toy6 = oy + ( j6*sy[6] );\n\t\toz6 = oz + ( j6*sz[6] );\n\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\tif ( j5 < bsize ) {\n\t\t\t\ts5 = j5;\n\t\t\t\tj5 = 0;\n\t\t\t} else {\n\t\t\t\ts5 = bsize;\n\t\t\t\tj5 -= bsize;\n\t\t\t}\n\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\ts4 = j4;\n\t\t\t\t\tj4 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts4 = bsize;\n\t\t\t\t\tj4 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary7d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in eight-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary8d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary8d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oy7;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar oz7;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\tif ( j7 < bsize ) {\n\t\t\ts7 = j7;\n\t\t\tj7 = 0;\n\t\t} else {\n\t\t\ts7 = bsize;\n\t\t\tj7 -= bsize;\n\t\t}\n\t\tox7 = ox + ( j7*sx[7] );\n\t\toy7 = oy + ( j7*sy[7] );\n\t\toz7 = oz + ( j7*sz[7] );\n\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\tif ( j6 < bsize ) {\n\t\t\t\ts6 = j6;\n\t\t\t\tj6 = 0;\n\t\t\t} else {\n\t\t\t\ts6 = bsize;\n\t\t\t\tj6 -= bsize;\n\t\t\t}\n\t\t\tdx7 = sx[7] - ( s6*sx[6] );\n\t\t\tdy7 = sy[7] - ( s6*sy[6] );\n\t\t\tdz7 = sz[7] - ( s6*sz[6] );\n\t\t\tox6 = ox7 + ( j6*sx[6] );\n\t\t\toy6 = oy7 + ( j6*sy[6] );\n\t\t\toz6 = oz7 + ( j6*sz[6] );\n\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\ts5 = j5;\n\t\t\t\t\tj5 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts5 = bsize;\n\t\t\t\t\tj5 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx7;\n\t\t\t\t\t\t\t\t\t\tiy += dy7;\n\t\t\t\t\t\t\t\t\t\tiz += dz7;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary8d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in nine-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary9d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary9d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oy7;\n\tvar oy8;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar oz7;\n\tvar oz8;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar s8;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar j8;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j8 = sh[8]; j8 > 0; ) {\n\t\tif ( j8 < bsize ) {\n\t\t\ts8 = j8;\n\t\t\tj8 = 0;\n\t\t} else {\n\t\t\ts8 = bsize;\n\t\t\tj8 -= bsize;\n\t\t}\n\t\tox8 = ox + ( j8*sx[8] );\n\t\toy8 = oy + ( j8*sy[8] );\n\t\toz8 = oz + ( j8*sz[8] );\n\t\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\t\tif ( j7 < bsize ) {\n\t\t\t\ts7 = j7;\n\t\t\t\tj7 = 0;\n\t\t\t} else {\n\t\t\t\ts7 = bsize;\n\t\t\t\tj7 -= bsize;\n\t\t\t}\n\t\t\tdx8 = sx[8] - ( s7*sx[7] );\n\t\t\tdy8 = sy[8] - ( s7*sy[7] );\n\t\t\tdz8 = sz[8] - ( s7*sz[7] );\n\t\t\tox7 = ox8 + ( j7*sx[7] );\n\t\t\toy7 = oy8 + ( j7*sy[7] );\n\t\t\toz7 = oz8 + ( j7*sz[7] );\n\t\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\t\tif ( j6 < bsize ) {\n\t\t\t\t\ts6 = j6;\n\t\t\t\t\tj6 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts6 = bsize;\n\t\t\t\t\tj6 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx7 = sx[7] - ( s6*sx[6] );\n\t\t\t\tdy7 = sy[7] - ( s6*sy[6] );\n\t\t\t\tdz7 = sz[7] - ( s6*sz[6] );\n\t\t\t\tox6 = ox7 + ( j6*sx[6] );\n\t\t\t\toy6 = oy7 + ( j6*sy[6] );\n\t\t\t\toz6 = oz7 + ( j6*sz[6] );\n\t\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\t\ts5 = j5;\n\t\t\t\t\t\tj5 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts5 = bsize;\n\t\t\t\t\t\tj5 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\t\t\tfor ( i8 = 0; i8 < s8; i8++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx7;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy7;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz7;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx8;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy8;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz8;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary9d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function, max-lines */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in ten-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary10d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary10d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dx9;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dy9;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar dz9;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\n\tvar ox9;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oy7;\n\tvar oy8;\n\tvar oy9;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar oz7;\n\tvar oz8;\n\tvar oz9;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar s8;\n\tvar s9;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar i9;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar j8;\n\tvar j9;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j9 = sh[9]; j9 > 0; ) {\n\t\tif ( j9 < bsize ) {\n\t\t\ts9 = j9;\n\t\t\tj9 = 0;\n\t\t} else {\n\t\t\ts9 = bsize;\n\t\t\tj9 -= bsize;\n\t\t}\n\t\tox9 = ox + ( j9*sx[9] );\n\t\toy9 = oy + ( j9*sy[9] );\n\t\toz9 = oz + ( j9*sz[9] );\n\t\tfor ( j8 = sh[8]; j8 > 0; ) {\n\t\t\tif ( j8 < bsize ) {\n\t\t\t\ts8 = j8;\n\t\t\t\tj8 = 0;\n\t\t\t} else {\n\t\t\t\ts8 = bsize;\n\t\t\t\tj8 -= bsize;\n\t\t\t}\n\t\t\tdx9 = sx[9] - ( s8*sx[8] );\n\t\t\tdy9 = sy[9] - ( s8*sy[8] );\n\t\t\tdz9 = sz[9] - ( s8*sz[8] );\n\t\t\tox8 = ox9 + ( j8*sx[8] );\n\t\t\toy8 = oy9 + ( j8*sy[8] );\n\t\t\toz8 = oz9 + ( j8*sz[8] );\n\t\t\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\t\t\tif ( j7 < bsize ) {\n\t\t\t\t\ts7 = j7;\n\t\t\t\t\tj7 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts7 = bsize;\n\t\t\t\t\tj7 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx8 = sx[8] - ( s7*sx[7] );\n\t\t\t\tdy8 = sy[8] - ( s7*sy[7] );\n\t\t\t\tdz8 = sz[8] - ( s7*sz[7] );\n\t\t\t\tox7 = ox8 + ( j7*sx[7] );\n\t\t\t\toy7 = oy8 + ( j7*sy[7] );\n\t\t\t\toz7 = oz8 + ( j7*sz[7] );\n\t\t\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\t\t\tif ( j6 < bsize ) {\n\t\t\t\t\t\ts6 = j6;\n\t\t\t\t\t\tj6 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts6 = bsize;\n\t\t\t\t\t\tj6 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx7 = sx[7] - ( s6*sx[6] );\n\t\t\t\t\tdy7 = sy[7] - ( s6*sy[6] );\n\t\t\t\t\tdz7 = sz[7] - ( s6*sz[6] );\n\t\t\t\t\tox6 = ox7 + ( j6*sx[6] );\n\t\t\t\t\toy6 = oy7 + ( j6*sy[6] );\n\t\t\t\t\toz6 = oz7 + ( j6*sz[6] );\n\t\t\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\t\t\ts5 = j5;\n\t\t\t\t\t\t\tj5 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts5 = bsize;\n\t\t\t\t\t\t\tj5 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\t\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\t\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\t\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\t\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\t\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\t\t\t\tfor ( i9 = 0; i9 < s9; i9++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i8 = 0; i8 < s8; i8++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx7;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy7;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz7;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx8;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy8;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz8;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx9;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy9;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz9;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary10d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 6, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary2d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary2d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dy0;\n\tvar dy1;\n\tvar dz0;\n\tvar dz1;\n\tvar ox1;\n\tvar oy1;\n\tvar oz1;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar j0;\n\tvar j1;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\tif ( j1 < bsize ) {\n\t\t\ts1 = j1;\n\t\t\tj1 = 0;\n\t\t} else {\n\t\t\ts1 = bsize;\n\t\t\tj1 -= bsize;\n\t\t}\n\t\tox1 = ox + ( j1*sx[1] );\n\t\toy1 = oy + ( j1*sy[1] );\n\t\toz1 = oz + ( j1*sz[1] );\n\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\tif ( j0 < bsize ) {\n\t\t\t\ts0 = j0;\n\t\t\t\tj0 = 0;\n\t\t\t} else {\n\t\t\t\ts0 = bsize;\n\t\t\t\tj0 -= bsize;\n\t\t\t}\n\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t// Compute loop offset increments...\n\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t// Iterate over the ndarray dimensions...\n\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\tix += dx0;\n\t\t\t\t\tiy += dy0;\n\t\t\t\t\tiz += dz0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t\tiy += dy1;\n\t\t\t\tiz += dz1;\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in three-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n* var sy = [ 4, 2, 1 ];\n* var sz = [ 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary3d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary3d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar ox1;\n\tvar ox2;\n\tvar oy1;\n\tvar oy2;\n\tvar oz1;\n\tvar oz2;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\tif ( j2 < bsize ) {\n\t\t\ts2 = j2;\n\t\t\tj2 = 0;\n\t\t} else {\n\t\t\ts2 = bsize;\n\t\t\tj2 -= bsize;\n\t\t}\n\t\tox2 = ox + ( j2*sx[2] );\n\t\toy2 = oy + ( j2*sy[2] );\n\t\toz2 = oz + ( j2*sz[2] );\n\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\tif ( j1 < bsize ) {\n\t\t\t\ts1 = j1;\n\t\t\t\tj1 = 0;\n\t\t\t} else {\n\t\t\t\ts1 = bsize;\n\t\t\t\tj1 -= bsize;\n\t\t\t}\n\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\ts0 = j0;\n\t\t\t\t\tj0 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts0 = bsize;\n\t\t\t\t\tj0 -= bsize;\n\t\t\t\t}\n\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t// Compute loop offset increments...\n\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t\tiy += dy2;\n\t\t\t\t\tiz += dz2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in four-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary4d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary4d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\tif ( j3 < bsize ) {\n\t\t\ts3 = j3;\n\t\t\tj3 = 0;\n\t\t} else {\n\t\t\ts3 = bsize;\n\t\t\tj3 -= bsize;\n\t\t}\n\t\tox3 = ox + ( j3*sx[3] );\n\t\toy3 = oy + ( j3*sy[3] );\n\t\toz3 = oz + ( j3*sz[3] );\n\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\tif ( j2 < bsize ) {\n\t\t\t\ts2 = j2;\n\t\t\t\tj2 = 0;\n\t\t\t} else {\n\t\t\t\ts2 = bsize;\n\t\t\t\tj2 -= bsize;\n\t\t\t}\n\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\ts1 = j1;\n\t\t\t\t\tj1 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts1 = bsize;\n\t\t\t\t\tj1 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements, max-len */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in five-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary5d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary5d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\tif ( j4 < bsize ) {\n\t\t\ts4 = j4;\n\t\t\tj4 = 0;\n\t\t} else {\n\t\t\ts4 = bsize;\n\t\t\tj4 -= bsize;\n\t\t}\n\t\tox4 = ox + ( j4*sx[4] );\n\t\toy4 = oy + ( j4*sy[4] );\n\t\toz4 = oz + ( j4*sz[4] );\n\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\tif ( j3 < bsize ) {\n\t\t\t\ts3 = j3;\n\t\t\t\tj3 = 0;\n\t\t\t} else {\n\t\t\t\ts3 = bsize;\n\t\t\t\tj3 -= bsize;\n\t\t\t}\n\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\ts2 = j2;\n\t\t\t\t\tj2 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts2 = bsize;\n\t\t\t\t\tj2 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in six-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary6d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary6d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\tif ( j5 < bsize ) {\n\t\t\ts5 = j5;\n\t\t\tj5 = 0;\n\t\t} else {\n\t\t\ts5 = bsize;\n\t\t\tj5 -= bsize;\n\t\t}\n\t\tox5 = ox + ( j5*sx[5] );\n\t\toy5 = oy + ( j5*sy[5] );\n\t\toz5 = oz + ( j5*sz[5] );\n\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\tif ( j4 < bsize ) {\n\t\t\t\ts4 = j4;\n\t\t\t\tj4 = 0;\n\t\t\t} else {\n\t\t\t\ts4 = bsize;\n\t\t\t\tj4 -= bsize;\n\t\t\t}\n\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\ts3 = j3;\n\t\t\t\t\tj3 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts3 = bsize;\n\t\t\t\t\tj3 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary6d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in seven-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary7d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary7d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\tif ( j6 < bsize ) {\n\t\t\ts6 = j6;\n\t\t\tj6 = 0;\n\t\t} else {\n\t\t\ts6 = bsize;\n\t\t\tj6 -= bsize;\n\t\t}\n\t\tox6 = ox + ( j6*sx[6] );\n\t\toy6 = oy + ( j6*sy[6] );\n\t\toz6 = oz + ( j6*sz[6] );\n\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\tif ( j5 < bsize ) {\n\t\t\t\ts5 = j5;\n\t\t\t\tj5 = 0;\n\t\t\t} else {\n\t\t\t\ts5 = bsize;\n\t\t\t\tj5 -= bsize;\n\t\t\t}\n\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\ts4 = j4;\n\t\t\t\t\tj4 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts4 = bsize;\n\t\t\t\t\tj4 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary7d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in eight-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary8d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary8d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oy7;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar oz7;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\tif ( j7 < bsize ) {\n\t\t\ts7 = j7;\n\t\t\tj7 = 0;\n\t\t} else {\n\t\t\ts7 = bsize;\n\t\t\tj7 -= bsize;\n\t\t}\n\t\tox7 = ox + ( j7*sx[7] );\n\t\toy7 = oy + ( j7*sy[7] );\n\t\toz7 = oz + ( j7*sz[7] );\n\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\tif ( j6 < bsize ) {\n\t\t\t\ts6 = j6;\n\t\t\t\tj6 = 0;\n\t\t\t} else {\n\t\t\t\ts6 = bsize;\n\t\t\t\tj6 -= bsize;\n\t\t\t}\n\t\t\tdx7 = sx[7] - ( s6*sx[6] );\n\t\t\tdy7 = sy[7] - ( s6*sy[6] );\n\t\t\tdz7 = sz[7] - ( s6*sz[6] );\n\t\t\tox6 = ox7 + ( j6*sx[6] );\n\t\t\toy6 = oy7 + ( j6*sy[6] );\n\t\t\toz6 = oz7 + ( j6*sz[6] );\n\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\ts5 = j5;\n\t\t\t\t\tj5 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts5 = bsize;\n\t\t\t\t\tj5 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx7;\n\t\t\t\t\t\t\t\t\t\tiy += dy7;\n\t\t\t\t\t\t\t\t\t\tiz += dz7;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary8d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in nine-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary9d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary9d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oy7;\n\tvar oy8;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar oz7;\n\tvar oz8;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar s8;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar j8;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j8 = sh[8]; j8 > 0; ) {\n\t\tif ( j8 < bsize ) {\n\t\t\ts8 = j8;\n\t\t\tj8 = 0;\n\t\t} else {\n\t\t\ts8 = bsize;\n\t\t\tj8 -= bsize;\n\t\t}\n\t\tox8 = ox + ( j8*sx[8] );\n\t\toy8 = oy + ( j8*sy[8] );\n\t\toz8 = oz + ( j8*sz[8] );\n\t\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\t\tif ( j7 < bsize ) {\n\t\t\t\ts7 = j7;\n\t\t\t\tj7 = 0;\n\t\t\t} else {\n\t\t\t\ts7 = bsize;\n\t\t\t\tj7 -= bsize;\n\t\t\t}\n\t\t\tdx8 = sx[8] - ( s7*sx[7] );\n\t\t\tdy8 = sy[8] - ( s7*sy[7] );\n\t\t\tdz8 = sz[8] - ( s7*sz[7] );\n\t\t\tox7 = ox8 + ( j7*sx[7] );\n\t\t\toy7 = oy8 + ( j7*sy[7] );\n\t\t\toz7 = oz8 + ( j7*sz[7] );\n\t\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\t\tif ( j6 < bsize ) {\n\t\t\t\t\ts6 = j6;\n\t\t\t\t\tj6 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts6 = bsize;\n\t\t\t\t\tj6 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx7 = sx[7] - ( s6*sx[6] );\n\t\t\t\tdy7 = sy[7] - ( s6*sy[6] );\n\t\t\t\tdz7 = sz[7] - ( s6*sz[6] );\n\t\t\t\tox6 = ox7 + ( j6*sx[6] );\n\t\t\t\toy6 = oy7 + ( j6*sy[6] );\n\t\t\t\toz6 = oz7 + ( j6*sz[6] );\n\t\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\t\ts5 = j5;\n\t\t\t\t\t\tj5 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts5 = bsize;\n\t\t\t\t\t\tj5 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\t\t\tfor ( i8 = 0; i8 < s8; i8++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx7;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy7;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz7;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx8;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy8;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz8;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary9d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function, max-lines */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in ten-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary10d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary10d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dx9;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dy9;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar dz9;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\n\tvar ox9;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oy7;\n\tvar oy8;\n\tvar oy9;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar oz7;\n\tvar oz8;\n\tvar oz9;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar s8;\n\tvar s9;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar i9;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar j8;\n\tvar j9;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j9 = sh[9]; j9 > 0; ) {\n\t\tif ( j9 < bsize ) {\n\t\t\ts9 = j9;\n\t\t\tj9 = 0;\n\t\t} else {\n\t\t\ts9 = bsize;\n\t\t\tj9 -= bsize;\n\t\t}\n\t\tox9 = ox + ( j9*sx[9] );\n\t\toy9 = oy + ( j9*sy[9] );\n\t\toz9 = oz + ( j9*sz[9] );\n\t\tfor ( j8 = sh[8]; j8 > 0; ) {\n\t\t\tif ( j8 < bsize ) {\n\t\t\t\ts8 = j8;\n\t\t\t\tj8 = 0;\n\t\t\t} else {\n\t\t\t\ts8 = bsize;\n\t\t\t\tj8 -= bsize;\n\t\t\t}\n\t\t\tdx9 = sx[9] - ( s8*sx[8] );\n\t\t\tdy9 = sy[9] - ( s8*sy[8] );\n\t\t\tdz9 = sz[9] - ( s8*sz[8] );\n\t\t\tox8 = ox9 + ( j8*sx[8] );\n\t\t\toy8 = oy9 + ( j8*sy[8] );\n\t\t\toz8 = oz9 + ( j8*sz[8] );\n\t\t\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\t\t\tif ( j7 < bsize ) {\n\t\t\t\t\ts7 = j7;\n\t\t\t\t\tj7 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts7 = bsize;\n\t\t\t\t\tj7 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx8 = sx[8] - ( s7*sx[7] );\n\t\t\t\tdy8 = sy[8] - ( s7*sy[7] );\n\t\t\t\tdz8 = sz[8] - ( s7*sz[7] );\n\t\t\t\tox7 = ox8 + ( j7*sx[7] );\n\t\t\t\toy7 = oy8 + ( j7*sy[7] );\n\t\t\t\toz7 = oz8 + ( j7*sz[7] );\n\t\t\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\t\t\tif ( j6 < bsize ) {\n\t\t\t\t\t\ts6 = j6;\n\t\t\t\t\t\tj6 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts6 = bsize;\n\t\t\t\t\t\tj6 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx7 = sx[7] - ( s6*sx[6] );\n\t\t\t\t\tdy7 = sy[7] - ( s6*sy[6] );\n\t\t\t\t\tdz7 = sz[7] - ( s6*sz[6] );\n\t\t\t\t\tox6 = ox7 + ( j6*sx[6] );\n\t\t\t\t\toy6 = oy7 + ( j6*sy[6] );\n\t\t\t\t\toz6 = oz7 + ( j6*sz[6] );\n\t\t\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\t\t\ts5 = j5;\n\t\t\t\t\t\t\tj5 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts5 = bsize;\n\t\t\t\t\t\t\tj5 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\t\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\t\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\t\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\t\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\t\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\t\t\t\tfor ( i9 = 0; i9 < s9; i9++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i8 = 0; i8 < s8; i8++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx7;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy7;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz7;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx8;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy8;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz8;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx9;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy9;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz9;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary10d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in zero-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0 ] );\n* var ybuf = toAccessorArray( [ 2.0 ] );\n* var zbuf = toAccessorArray( [ 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [];\n*\n* // Define the array strides:\n* var sx = [ 0 ];\n* var sy = [ 0 ];\n* var sz = [ 0 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary0d( x, y, z, fcn );\n*\n* var v = z.data.get( 0 );\n* // returns 3.0\n*/\nfunction binary0d( x, y, z, fcn ) {\n\tz.accessors[ 1 ]( z.data, z.offset, fcn( x.accessors[ 0 ]( x.data, x.offset ), y.accessors[ 0 ]( y.data, y.offset ) ) ); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary0d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in one-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 12 ];\n*\n* // Define the array strides:\n* var sx = [ 1 ];\n* var sy = [ 1 ];\n* var sz = [ 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary1d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary1d( x, y, z, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dy0;\n\tvar dz0;\n\tvar S0;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables: dimensions and loop offset (pointer) increments...\n\tS0 = x.shape[ 0 ];\n\tdx0 = x.strides[ 0 ];\n\tdy0 = y.strides[ 0 ];\n\tdz0 = z.strides[ 0 ];\n\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\tix += dx0;\n\t\tiy += dy0;\n\t\tiz += dz0;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary1d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 6, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary2d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary2d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dy0;\n\tvar dy1;\n\tvar dz0;\n\tvar dz1;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 1 ];\n\t\tS1 = sh[ 0 ];\n\t\tdx0 = sx[ 1 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 0 ] - ( S0*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 1 ];\n\t\tdy1 = sy[ 0 ] - ( S0*sy[1] );\n\t\tdz0 = sz[ 1 ];\n\t\tdz1 = sz[ 0 ] - ( S0*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\tix += dx0;\n\t\t\tiy += dy0;\n\t\t\tiz += dz0;\n\t\t}\n\t\tix += dx1;\n\t\tiy += dy1;\n\t\tiz += dz1;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in three-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n* var sy = [ 4, 2, 1 ];\n* var sz = [ 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary3d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary3d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 2 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 0 ];\n\t\tdx0 = sx[ 2 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[2] );\n\t\tdx2 = sx[ 0 ] - ( S1*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 2 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[2] );\n\t\tdy2 = sy[ 0 ] - ( S1*sy[1] );\n\t\tdz0 = sz[ 2 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[2] );\n\t\tdz2 = sz[ 0 ] - ( S1*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\tix += dx0;\n\t\t\t\tiy += dy0;\n\t\t\t\tiz += dz0;\n\t\t\t}\n\t\t\tix += dx1;\n\t\t\tiy += dy1;\n\t\t\tiz += dz1;\n\t\t}\n\t\tix += dx2;\n\t\tiy += dy2;\n\t\tiz += dz2;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in four-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary4d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary4d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 3 ];\n\t\tS1 = sh[ 2 ];\n\t\tS2 = sh[ 1 ];\n\t\tS3 = sh[ 0 ];\n\t\tdx0 = sx[ 3 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 2 ] - ( S0*sx[3] );\n\t\tdx2 = sx[ 1 ] - ( S1*sx[2] );\n\t\tdx3 = sx[ 0 ] - ( S2*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 3 ];\n\t\tdy1 = sy[ 2 ] - ( S0*sy[3] );\n\t\tdy2 = sy[ 1 ] - ( S1*sy[2] );\n\t\tdy3 = sy[ 0 ] - ( S2*sy[1] );\n\t\tdz0 = sz[ 3 ];\n\t\tdz1 = sz[ 2 ] - ( S0*sz[3] );\n\t\tdz2 = sz[ 1 ] - ( S1*sz[2] );\n\t\tdz3 = sz[ 0 ] - ( S2*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\tix += dx0;\n\t\t\t\t\tiy += dy0;\n\t\t\t\t\tiz += dz0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t\tiy += dy1;\n\t\t\t\tiz += dz1;\n\t\t\t}\n\t\t\tix += dx2;\n\t\t\tiy += dy2;\n\t\t\tiz += dz2;\n\t\t}\n\t\tix += dx3;\n\t\tiy += dy3;\n\t\tiz += dz3;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-len, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in five-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary5d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary5d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 4 ];\n\t\tS1 = sh[ 3 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 1 ];\n\t\tS4 = sh[ 0 ];\n\t\tdx0 = sx[ 4 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 3 ] - ( S0*sx[4] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[3] );\n\t\tdx3 = sx[ 1 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 0 ] - ( S3*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 4 ];\n\t\tdy1 = sy[ 3 ] - ( S0*sy[4] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[3] );\n\t\tdy3 = sy[ 1 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 0 ] - ( S3*sy[1] );\n\t\tdz0 = sz[ 4 ];\n\t\tdz1 = sz[ 3 ] - ( S0*sz[4] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[3] );\n\t\tdz3 = sz[ 1 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 0 ] - ( S3*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx1;\n\t\t\t\t\tiy += dy1;\n\t\t\t\t\tiz += dz1;\n\t\t\t\t}\n\t\t\t\tix += dx2;\n\t\t\t\tiy += dy2;\n\t\t\t\tiz += dz2;\n\t\t\t}\n\t\t\tix += dx3;\n\t\t\tiy += dy3;\n\t\t\tiz += dz3;\n\t\t}\n\t\tix += dx4;\n\t\tiy += dy4;\n\t\tiz += dz4;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in six-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary6d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary6d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 5 ];\n\t\tS1 = sh[ 4 ];\n\t\tS2 = sh[ 3 ];\n\t\tS3 = sh[ 2 ];\n\t\tS4 = sh[ 1 ];\n\t\tS5 = sh[ 0 ];\n\t\tdx0 = sx[ 5 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 4 ] - ( S0*sx[5] );\n\t\tdx2 = sx[ 3 ] - ( S1*sx[4] );\n\t\tdx3 = sx[ 2 ] - ( S2*sx[3] );\n\t\tdx4 = sx[ 1 ] - ( S3*sx[2] );\n\t\tdx5 = sx[ 0 ] - ( S4*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 5 ];\n\t\tdy1 = sy[ 4 ] - ( S0*sy[5] );\n\t\tdy2 = sy[ 3 ] - ( S1*sy[4] );\n\t\tdy3 = sy[ 2 ] - ( S2*sy[3] );\n\t\tdy4 = sy[ 1 ] - ( S3*sy[2] );\n\t\tdy5 = sy[ 0 ] - ( S4*sy[1] );\n\t\tdz0 = sz[ 5 ];\n\t\tdz1 = sz[ 4 ] - ( S0*sz[5] );\n\t\tdz2 = sz[ 3 ] - ( S1*sz[4] );\n\t\tdz3 = sz[ 2 ] - ( S2*sz[3] );\n\t\tdz4 = sz[ 1 ] - ( S3*sz[2] );\n\t\tdz5 = sz[ 0 ] - ( S4*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t\tiy += dy2;\n\t\t\t\t\tiz += dz2;\n\t\t\t\t}\n\t\t\t\tix += dx3;\n\t\t\t\tiy += dy3;\n\t\t\t\tiz += dz3;\n\t\t\t}\n\t\t\tix += dx4;\n\t\t\tiy += dy4;\n\t\t\tiz += dz4;\n\t\t}\n\t\tix += dx5;\n\t\tiy += dy5;\n\t\tiz += dz5;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary6d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in seven-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary7d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary7d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 6 ];\n\t\tS1 = sh[ 5 ];\n\t\tS2 = sh[ 4 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 2 ];\n\t\tS5 = sh[ 1 ];\n\t\tS6 = sh[ 0 ];\n\t\tdx0 = sx[ 6 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 5 ] - ( S0*sx[6] );\n\t\tdx2 = sx[ 4 ] - ( S1*sx[5] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[4] );\n\t\tdx4 = sx[ 2 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 1 ] - ( S4*sx[2] );\n\t\tdx6 = sx[ 0 ] - ( S5*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 6 ];\n\t\tdy1 = sy[ 5 ] - ( S0*sy[6] );\n\t\tdy2 = sy[ 4 ] - ( S1*sy[5] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[4] );\n\t\tdy4 = sy[ 2 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 1 ] - ( S4*sy[2] );\n\t\tdy6 = sy[ 0 ] - ( S5*sy[1] );\n\t\tdz0 = sz[ 6 ];\n\t\tdz1 = sz[ 5 ] - ( S0*sz[6] );\n\t\tdz2 = sz[ 4 ] - ( S1*sz[5] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[4] );\n\t\tdz4 = sz[ 2 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 1 ] - ( S4*sz[2] );\n\t\tdz6 = sz[ 0 ] - ( S5*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx3;\n\t\t\t\t\tiy += dy3;\n\t\t\t\t\tiz += dz3;\n\t\t\t\t}\n\t\t\t\tix += dx4;\n\t\t\t\tiy += dy4;\n\t\t\t\tiz += dz4;\n\t\t\t}\n\t\t\tix += dx5;\n\t\t\tiy += dy5;\n\t\t\tiz += dz5;\n\t\t}\n\t\tix += dx6;\n\t\tiy += dy6;\n\t\tiz += dz6;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary7d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in eight-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary8d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary8d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 7 ];\n\t\tS1 = sh[ 6 ];\n\t\tS2 = sh[ 5 ];\n\t\tS3 = sh[ 4 ];\n\t\tS4 = sh[ 3 ];\n\t\tS5 = sh[ 2 ];\n\t\tS6 = sh[ 1 ];\n\t\tS7 = sh[ 0 ];\n\t\tdx0 = sx[ 7 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 6 ] - ( S0*sx[7] );\n\t\tdx2 = sx[ 5 ] - ( S1*sx[6] );\n\t\tdx3 = sx[ 4 ] - ( S2*sx[5] );\n\t\tdx4 = sx[ 3 ] - ( S3*sx[4] );\n\t\tdx5 = sx[ 2 ] - ( S4*sx[3] );\n\t\tdx6 = sx[ 1 ] - ( S5*sx[2] );\n\t\tdx7 = sx[ 0 ] - ( S6*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 7 ];\n\t\tdy1 = sy[ 6 ] - ( S0*sy[7] );\n\t\tdy2 = sy[ 5 ] - ( S1*sy[6] );\n\t\tdy3 = sy[ 4 ] - ( S2*sy[5] );\n\t\tdy4 = sy[ 3 ] - ( S3*sy[4] );\n\t\tdy5 = sy[ 2 ] - ( S4*sy[3] );\n\t\tdy6 = sy[ 1 ] - ( S5*sy[2] );\n\t\tdy7 = sy[ 0 ] - ( S6*sy[1] );\n\t\tdz0 = sz[ 7 ];\n\t\tdz1 = sz[ 6 ] - ( S0*sz[7] );\n\t\tdz2 = sz[ 5 ] - ( S1*sz[6] );\n\t\tdz3 = sz[ 4 ] - ( S2*sz[5] );\n\t\tdz4 = sz[ 3 ] - ( S3*sz[4] );\n\t\tdz5 = sz[ 2 ] - ( S4*sz[3] );\n\t\tdz6 = sz[ 1 ] - ( S5*sz[2] );\n\t\tdz7 = sz[ 0 ] - ( S6*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] );\n\t\tdx7 = sx[ 7 ] - ( S6*sx[6] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdy7 = sy[ 7 ] - ( S6*sy[6] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t\tdz7 = sz[ 7 ] - ( S6*sz[6] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx4;\n\t\t\t\t\tiy += dy4;\n\t\t\t\t\tiz += dz4;\n\t\t\t\t}\n\t\t\t\tix += dx5;\n\t\t\t\tiy += dy5;\n\t\t\t\tiz += dz5;\n\t\t\t}\n\t\t\tix += dx6;\n\t\t\tiy += dy6;\n\t\t\tiz += dz6;\n\t\t}\n\t\tix += dx7;\n\t\tiy += dy7;\n\t\tiz += dz7;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary8d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in nine-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary9d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary9d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar S8;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 8 ];\n\t\tS1 = sh[ 7 ];\n\t\tS2 = sh[ 6 ];\n\t\tS3 = sh[ 5 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 3 ];\n\t\tS6 = sh[ 2 ];\n\t\tS7 = sh[ 1 ];\n\t\tS8 = sh[ 0 ];\n\t\tdx0 = sx[ 8 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 7 ] - ( S0*sx[8] );\n\t\tdx2 = sx[ 6 ] - ( S1*sx[7] );\n\t\tdx3 = sx[ 5 ] - ( S2*sx[6] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[5] );\n\t\tdx5 = sx[ 3 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 2 ] - ( S5*sx[3] );\n\t\tdx7 = sx[ 1 ] - ( S6*sx[2] );\n\t\tdx8 = sx[ 0 ] - ( S7*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 8 ];\n\t\tdy1 = sy[ 7 ] - ( S0*sy[8] );\n\t\tdy2 = sy[ 6 ] - ( S1*sy[7] );\n\t\tdy3 = sy[ 5 ] - ( S2*sy[6] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[5] );\n\t\tdy5 = sy[ 3 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 2 ] - ( S5*sy[3] );\n\t\tdy7 = sy[ 1 ] - ( S6*sy[2] );\n\t\tdy8 = sy[ 0 ] - ( S7*sy[1] );\n\t\tdz0 = sz[ 8 ];\n\t\tdz1 = sz[ 7 ] - ( S0*sz[8] );\n\t\tdz2 = sz[ 6 ] - ( S1*sz[7] );\n\t\tdz3 = sz[ 5 ] - ( S2*sz[6] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[5] );\n\t\tdz5 = sz[ 3 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 2 ] - ( S5*sz[3] );\n\t\tdz7 = sz[ 1 ] - ( S6*sz[2] );\n\t\tdz8 = sz[ 0 ] - ( S7*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tS8 = sh[ 8 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] );\n\t\tdx7 = sx[ 7 ] - ( S6*sx[6] );\n\t\tdx8 = sx[ 8 ] - ( S7*sx[7] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdy7 = sy[ 7 ] - ( S6*sy[6] );\n\t\tdy8 = sy[ 8 ] - ( S7*sy[7] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t\tdz7 = sz[ 7 ] - ( S6*sz[6] );\n\t\tdz8 = sz[ 8 ] - ( S7*sz[7] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i8 = 0; i8 < S8; i8++ ) {\n\t\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx5;\n\t\t\t\t\tiy += dy5;\n\t\t\t\t\tiz += dz5;\n\t\t\t\t}\n\t\t\t\tix += dx6;\n\t\t\t\tiy += dy6;\n\t\t\t\tiz += dz6;\n\t\t\t}\n\t\t\tix += dx7;\n\t\t\tiy += dy7;\n\t\t\tiz += dz7;\n\t\t}\n\t\tix += dx8;\n\t\tiy += dy8;\n\t\tiz += dz8;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary9d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in ten-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary10d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary10d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dx9;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dy9;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar dz9;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar S8;\n\tvar S9;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar i9;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 9 ];\n\t\tS1 = sh[ 8 ];\n\t\tS2 = sh[ 7 ];\n\t\tS3 = sh[ 6 ];\n\t\tS4 = sh[ 5 ];\n\t\tS5 = sh[ 4 ];\n\t\tS6 = sh[ 3 ];\n\t\tS7 = sh[ 2 ];\n\t\tS8 = sh[ 1 ];\n\t\tS9 = sh[ 0 ];\n\t\tdx0 = sx[ 9 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 8 ] - ( S0*sx[9] );\n\t\tdx2 = sx[ 7 ] - ( S1*sx[8] );\n\t\tdx3 = sx[ 6 ] - ( S2*sx[7] );\n\t\tdx4 = sx[ 5 ] - ( S3*sx[6] );\n\t\tdx5 = sx[ 4 ] - ( S4*sx[5] );\n\t\tdx6 = sx[ 3 ] - ( S5*sx[4] );\n\t\tdx7 = sx[ 2 ] - ( S6*sx[3] );\n\t\tdx8 = sx[ 1 ] - ( S7*sx[2] );\n\t\tdx9 = sx[ 0 ] - ( S8*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 9 ];\n\t\tdy1 = sy[ 8 ] - ( S0*sy[9] );\n\t\tdy2 = sy[ 7 ] - ( S1*sy[8] );\n\t\tdy3 = sy[ 6 ] - ( S2*sy[7] );\n\t\tdy4 = sy[ 5 ] - ( S3*sy[6] );\n\t\tdy5 = sy[ 4 ] - ( S4*sy[5] );\n\t\tdy6 = sy[ 3 ] - ( S5*sy[4] );\n\t\tdy7 = sy[ 2 ] - ( S6*sy[3] );\n\t\tdy8 = sy[ 1 ] - ( S7*sy[2] );\n\t\tdy9 = sy[ 0 ] - ( S8*sy[1] );\n\t\tdz0 = sz[ 9 ];\n\t\tdz1 = sz[ 8 ] - ( S0*sz[9] );\n\t\tdz2 = sz[ 7 ] - ( S1*sz[8] );\n\t\tdz3 = sz[ 6 ] - ( S2*sz[7] );\n\t\tdz4 = sz[ 5 ] - ( S3*sz[6] );\n\t\tdz5 = sz[ 4 ] - ( S4*sz[5] );\n\t\tdz6 = sz[ 3 ] - ( S5*sz[4] );\n\t\tdz7 = sz[ 2 ] - ( S6*sz[3] );\n\t\tdz8 = sz[ 1 ] - ( S7*sz[2] );\n\t\tdz9 = sz[ 0 ] - ( S8*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tS8 = sh[ 8 ];\n\t\tS9 = sh[ 9 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] );\n\t\tdx7 = sx[ 7 ] - ( S6*sx[6] );\n\t\tdx8 = sx[ 8 ] - ( S7*sx[7] );\n\t\tdx9 = sx[ 9 ] - ( S8*sx[8] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdy7 = sy[ 7 ] - ( S6*sy[6] );\n\t\tdy8 = sy[ 8 ] - ( S7*sy[7] );\n\t\tdy9 = sy[ 9 ] - ( S8*sy[8] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t\tdz7 = sz[ 7 ] - ( S6*sz[6] );\n\t\tdz8 = sz[ 8 ] - ( S7*sz[7] );\n\t\tdz9 = sz[ 9 ] - ( S8*sz[8] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i9 = 0; i9 < S9; i9++ ) {\n\t\tfor ( i8 = 0; i8 < S8; i8++ ) {\n\t\t\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\t\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx6;\n\t\t\t\t\tiy += dy6;\n\t\t\t\t\tiz += dz6;\n\t\t\t\t}\n\t\t\t\tix += dx7;\n\t\t\t\tiy += dy7;\n\t\t\t\tiz += dz7;\n\t\t\t}\n\t\t\tix += dx8;\n\t\t\tiy += dy8;\n\t\t\tiz += dz8;\n\t\t}\n\t\tix += dx9;\n\t\tiy += dy9;\n\t\tiz += dz9;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary10d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar numel = require( '@stdlib/ndarray-base-numel' );\nvar vind2bind = require( '@stdlib/ndarray-base-vind2bind' );\n\n\n// VARIABLES //\n\nvar MODE = 'throw';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in n-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var copy = require( '@stdlib/array-base-copy' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 6, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binarynd( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binarynd( x, y, z, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar ordx;\n\tvar ordy;\n\tvar ordz;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar len;\n\tvar sh;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i;\n\n\tsh = x.shape;\n\n\t// Compute the total number of elements over which to iterate:\n\tlen = numel( sh );\n\n\t// Cache references to the input and output ndarray data buffers:\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache references to the respective stride arrays:\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays:\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache the respective array orders:\n\tordx = x.order;\n\tordy = y.order;\n\tordz = z.order;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over each element based on the linear **view** index, regardless as to how the data is stored in memory...\n\tfor ( i = 0; i < len; i++ ) {\n\t\tix = vind2bind( sh, sx, ox, ordx, i, MODE );\n\t\tiy = vind2bind( sh, sy, oy, ordy, i, MODE );\n\t\tiz = vind2bind( sh, sz, oz, ordz, i, MODE );\n\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binarynd;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in zero-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0 ] );\n* var ybuf = new Float64Array( [ 2.0 ] );\n* var zbuf = new Float64Array( [ 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [];\n*\n* // Define the array strides:\n* var sx = [ 0 ];\n* var sy = [ 0 ];\n* var sz = [ 0 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary0d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 3.0 ]\n*/\nfunction binary0d( x, y, z, fcn ) {\n\tz.data[ z.offset ] = fcn( x.data[ x.offset ], y.data[ y.offset ] );\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary0d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in one-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 12 ];\n*\n* // Define the array strides:\n* var sx = [ 1 ];\n* var sy = [ 1 ];\n* var sz = [ 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary1d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary1d( x, y, z, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dy0;\n\tvar dz0;\n\tvar S0;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables: dimensions and loop offset (pointer) increments...\n\tS0 = x.shape[ 0 ];\n\tdx0 = x.strides[ 0 ];\n\tdy0 = y.strides[ 0 ];\n\tdz0 = z.strides[ 0 ];\n\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\tix += dx0;\n\t\tiy += dy0;\n\t\tiz += dz0;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary1d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 6, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary2d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary2d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dy0;\n\tvar dy1;\n\tvar dz0;\n\tvar dz1;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 1 ];\n\t\tS1 = sh[ 0 ];\n\t\tdx0 = sx[ 1 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 0 ] - ( S0*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 1 ];\n\t\tdy1 = sy[ 0 ] - ( S0*sy[1] );\n\t\tdz0 = sz[ 1 ];\n\t\tdz1 = sz[ 0 ] - ( S0*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\tix += dx0;\n\t\t\tiy += dy0;\n\t\t\tiz += dz0;\n\t\t}\n\t\tix += dx1;\n\t\tiy += dy1;\n\t\tiz += dz1;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in three-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n* var sy = [ 4, 2, 1 ];\n* var sz = [ 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary3d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary3d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 2 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 0 ];\n\t\tdx0 = sx[ 2 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[2] );\n\t\tdx2 = sx[ 0 ] - ( S1*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 2 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[2] );\n\t\tdy2 = sy[ 0 ] - ( S1*sy[1] );\n\t\tdz0 = sz[ 2 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[2] );\n\t\tdz2 = sz[ 0 ] - ( S1*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\tix += dx0;\n\t\t\t\tiy += dy0;\n\t\t\t\tiz += dz0;\n\t\t\t}\n\t\t\tix += dx1;\n\t\t\tiy += dy1;\n\t\t\tiz += dz1;\n\t\t}\n\t\tix += dx2;\n\t\tiy += dy2;\n\t\tiz += dz2;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in four-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary4d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary4d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 3 ];\n\t\tS1 = sh[ 2 ];\n\t\tS2 = sh[ 1 ];\n\t\tS3 = sh[ 0 ];\n\t\tdx0 = sx[ 3 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 2 ] - ( S0*sx[3] );\n\t\tdx2 = sx[ 1 ] - ( S1*sx[2] );\n\t\tdx3 = sx[ 0 ] - ( S2*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 3 ];\n\t\tdy1 = sy[ 2 ] - ( S0*sy[3] );\n\t\tdy2 = sy[ 1 ] - ( S1*sy[2] );\n\t\tdy3 = sy[ 0 ] - ( S2*sy[1] );\n\t\tdz0 = sz[ 3 ];\n\t\tdz1 = sz[ 2 ] - ( S0*sz[3] );\n\t\tdz2 = sz[ 1 ] - ( S1*sz[2] );\n\t\tdz3 = sz[ 0 ] - ( S2*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\tix += dx0;\n\t\t\t\t\tiy += dy0;\n\t\t\t\t\tiz += dz0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t\tiy += dy1;\n\t\t\t\tiz += dz1;\n\t\t\t}\n\t\t\tix += dx2;\n\t\t\tiy += dy2;\n\t\t\tiz += dz2;\n\t\t}\n\t\tix += dx3;\n\t\tiy += dy3;\n\t\tiz += dz3;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in five-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary5d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary5d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 4 ];\n\t\tS1 = sh[ 3 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 1 ];\n\t\tS4 = sh[ 0 ];\n\t\tdx0 = sx[ 4 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 3 ] - ( S0*sx[4] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[3] );\n\t\tdx3 = sx[ 1 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 0 ] - ( S3*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 4 ];\n\t\tdy1 = sy[ 3 ] - ( S0*sy[4] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[3] );\n\t\tdy3 = sy[ 1 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 0 ] - ( S3*sy[1] );\n\t\tdz0 = sz[ 4 ];\n\t\tdz1 = sz[ 3 ] - ( S0*sz[4] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[3] );\n\t\tdz3 = sz[ 1 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 0 ] - ( S3*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx1;\n\t\t\t\t\tiy += dy1;\n\t\t\t\t\tiz += dz1;\n\t\t\t\t}\n\t\t\t\tix += dx2;\n\t\t\t\tiy += dy2;\n\t\t\t\tiz += dz2;\n\t\t\t}\n\t\t\tix += dx3;\n\t\t\tiy += dy3;\n\t\t\tiz += dz3;\n\t\t}\n\t\tix += dx4;\n\t\tiy += dy4;\n\t\tiz += dz4;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in six-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary6d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary6d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 5 ];\n\t\tS1 = sh[ 4 ];\n\t\tS2 = sh[ 3 ];\n\t\tS3 = sh[ 2 ];\n\t\tS4 = sh[ 1 ];\n\t\tS5 = sh[ 0 ];\n\t\tdx0 = sx[ 5 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 4 ] - ( S0*sx[5] );\n\t\tdx2 = sx[ 3 ] - ( S1*sx[4] );\n\t\tdx3 = sx[ 2 ] - ( S2*sx[3] );\n\t\tdx4 = sx[ 1 ] - ( S3*sx[2] );\n\t\tdx5 = sx[ 0 ] - ( S4*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 5 ];\n\t\tdy1 = sy[ 4 ] - ( S0*sy[5] );\n\t\tdy2 = sy[ 3 ] - ( S1*sy[4] );\n\t\tdy3 = sy[ 2 ] - ( S2*sy[3] );\n\t\tdy4 = sy[ 1 ] - ( S3*sy[2] );\n\t\tdy5 = sy[ 0 ] - ( S4*sy[1] );\n\t\tdz0 = sz[ 5 ];\n\t\tdz1 = sz[ 4 ] - ( S0*sz[5] );\n\t\tdz2 = sz[ 3 ] - ( S1*sz[4] );\n\t\tdz3 = sz[ 2 ] - ( S2*sz[3] );\n\t\tdz4 = sz[ 1 ] - ( S3*sz[2] );\n\t\tdz5 = sz[ 0 ] - ( S4*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t\tiy += dy2;\n\t\t\t\t\tiz += dz2;\n\t\t\t\t}\n\t\t\t\tix += dx3;\n\t\t\t\tiy += dy3;\n\t\t\t\tiz += dz3;\n\t\t\t}\n\t\t\tix += dx4;\n\t\t\tiy += dy4;\n\t\t\tiz += dz4;\n\t\t}\n\t\tix += dx5;\n\t\tiy += dy5;\n\t\tiz += dz5;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary6d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in seven-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary7d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary7d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 6 ];\n\t\tS1 = sh[ 5 ];\n\t\tS2 = sh[ 4 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 2 ];\n\t\tS5 = sh[ 1 ];\n\t\tS6 = sh[ 0 ];\n\t\tdx0 = sx[ 6 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 5 ] - ( S0*sx[6] );\n\t\tdx2 = sx[ 4 ] - ( S1*sx[5] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[4] );\n\t\tdx4 = sx[ 2 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 1 ] - ( S4*sx[2] );\n\t\tdx6 = sx[ 0 ] - ( S5*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 6 ];\n\t\tdy1 = sy[ 5 ] - ( S0*sy[6] );\n\t\tdy2 = sy[ 4 ] - ( S1*sy[5] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[4] );\n\t\tdy4 = sy[ 2 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 1 ] - ( S4*sy[2] );\n\t\tdy6 = sy[ 0 ] - ( S5*sy[1] );\n\t\tdz0 = sz[ 6 ];\n\t\tdz1 = sz[ 5 ] - ( S0*sz[6] );\n\t\tdz2 = sz[ 4 ] - ( S1*sz[5] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[4] );\n\t\tdz4 = sz[ 2 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 1 ] - ( S4*sz[2] );\n\t\tdz6 = sz[ 0 ] - ( S5*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx3;\n\t\t\t\t\tiy += dy3;\n\t\t\t\t\tiz += dz3;\n\t\t\t\t}\n\t\t\t\tix += dx4;\n\t\t\t\tiy += dy4;\n\t\t\t\tiz += dz4;\n\t\t\t}\n\t\t\tix += dx5;\n\t\t\tiy += dy5;\n\t\t\tiz += dz5;\n\t\t}\n\t\tix += dx6;\n\t\tiy += dy6;\n\t\tiz += dz6;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary7d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in eight-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary8d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary8d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 7 ];\n\t\tS1 = sh[ 6 ];\n\t\tS2 = sh[ 5 ];\n\t\tS3 = sh[ 4 ];\n\t\tS4 = sh[ 3 ];\n\t\tS5 = sh[ 2 ];\n\t\tS6 = sh[ 1 ];\n\t\tS7 = sh[ 0 ];\n\t\tdx0 = sx[ 7 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 6 ] - ( S0*sx[7] );\n\t\tdx2 = sx[ 5 ] - ( S1*sx[6] );\n\t\tdx3 = sx[ 4 ] - ( S2*sx[5] );\n\t\tdx4 = sx[ 3 ] - ( S3*sx[4] );\n\t\tdx5 = sx[ 2 ] - ( S4*sx[3] );\n\t\tdx6 = sx[ 1 ] - ( S5*sx[2] );\n\t\tdx7 = sx[ 0 ] - ( S6*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 7 ];\n\t\tdy1 = sy[ 6 ] - ( S0*sy[7] );\n\t\tdy2 = sy[ 5 ] - ( S1*sy[6] );\n\t\tdy3 = sy[ 4 ] - ( S2*sy[5] );\n\t\tdy4 = sy[ 3 ] - ( S3*sy[4] );\n\t\tdy5 = sy[ 2 ] - ( S4*sy[3] );\n\t\tdy6 = sy[ 1 ] - ( S5*sy[2] );\n\t\tdy7 = sy[ 0 ] - ( S6*sy[1] );\n\t\tdz0 = sz[ 7 ];\n\t\tdz1 = sz[ 6 ] - ( S0*sz[7] );\n\t\tdz2 = sz[ 5 ] - ( S1*sz[6] );\n\t\tdz3 = sz[ 4 ] - ( S2*sz[5] );\n\t\tdz4 = sz[ 3 ] - ( S3*sz[4] );\n\t\tdz5 = sz[ 2 ] - ( S4*sz[3] );\n\t\tdz6 = sz[ 1 ] - ( S5*sz[2] );\n\t\tdz7 = sz[ 0 ] - ( S6*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] );\n\t\tdx7 = sx[ 7 ] - ( S6*sx[6] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdy7 = sy[ 7 ] - ( S6*sy[6] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t\tdz7 = sz[ 7 ] - ( S6*sz[6] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx4;\n\t\t\t\t\tiy += dy4;\n\t\t\t\t\tiz += dz4;\n\t\t\t\t}\n\t\t\t\tix += dx5;\n\t\t\t\tiy += dy5;\n\t\t\t\tiz += dz5;\n\t\t\t}\n\t\t\tix += dx6;\n\t\t\tiy += dy6;\n\t\t\tiz += dz6;\n\t\t}\n\t\tix += dx7;\n\t\tiy += dy7;\n\t\tiz += dz7;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary8d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements, max-len */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in nine-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary9d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary9d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar S8;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 8 ];\n\t\tS1 = sh[ 7 ];\n\t\tS2 = sh[ 6 ];\n\t\tS3 = sh[ 5 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 3 ];\n\t\tS6 = sh[ 2 ];\n\t\tS7 = sh[ 1 ];\n\t\tS8 = sh[ 0 ];\n\t\tdx0 = sx[ 8 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 7 ] - ( S0*sx[8] );\n\t\tdx2 = sx[ 6 ] - ( S1*sx[7] );\n\t\tdx3 = sx[ 5 ] - ( S2*sx[6] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[5] );\n\t\tdx5 = sx[ 3 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 2 ] - ( S5*sx[3] );\n\t\tdx7 = sx[ 1 ] - ( S6*sx[2] );\n\t\tdx8 = sx[ 0 ] - ( S7*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 8 ];\n\t\tdy1 = sy[ 7 ] - ( S0*sy[8] );\n\t\tdy2 = sy[ 6 ] - ( S1*sy[7] );\n\t\tdy3 = sy[ 5 ] - ( S2*sy[6] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[5] );\n\t\tdy5 = sy[ 3 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 2 ] - ( S5*sy[3] );\n\t\tdy7 = sy[ 1 ] - ( S6*sy[2] );\n\t\tdy8 = sy[ 0 ] - ( S7*sy[1] );\n\t\tdz0 = sz[ 8 ];\n\t\tdz1 = sz[ 7 ] - ( S0*sz[8] );\n\t\tdz2 = sz[ 6 ] - ( S1*sz[7] );\n\t\tdz3 = sz[ 5 ] - ( S2*sz[6] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[5] );\n\t\tdz5 = sz[ 3 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 2 ] - ( S5*sz[3] );\n\t\tdz7 = sz[ 1 ] - ( S6*sz[2] );\n\t\tdz8 = sz[ 0 ] - ( S7*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tS8 = sh[ 8 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] );\n\t\tdx7 = sx[ 7 ] - ( S6*sx[6] );\n\t\tdx8 = sx[ 8 ] - ( S7*sx[7] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdy7 = sy[ 7 ] - ( S6*sy[6] );\n\t\tdy8 = sy[ 8 ] - ( S7*sy[7] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t\tdz7 = sz[ 7 ] - ( S6*sz[6] );\n\t\tdz8 = sz[ 8 ] - ( S7*sz[7] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i8 = 0; i8 < S8; i8++ ) {\n\t\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx5;\n\t\t\t\t\tiy += dy5;\n\t\t\t\t\tiz += dz5;\n\t\t\t\t}\n\t\t\t\tix += dx6;\n\t\t\t\tiy += dy6;\n\t\t\t\tiz += dz6;\n\t\t\t}\n\t\t\tix += dx7;\n\t\t\tiy += dy7;\n\t\t\tiz += dz7;\n\t\t}\n\t\tix += dx8;\n\t\tiy += dy8;\n\t\tiz += dz8;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary9d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements, max-len, max-lines-per-function */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in ten-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary10d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary10d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dx9;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dy9;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar dz9;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar S8;\n\tvar S9;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar i9;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 9 ];\n\t\tS1 = sh[ 8 ];\n\t\tS2 = sh[ 7 ];\n\t\tS3 = sh[ 6 ];\n\t\tS4 = sh[ 5 ];\n\t\tS5 = sh[ 4 ];\n\t\tS6 = sh[ 3 ];\n\t\tS7 = sh[ 2 ];\n\t\tS8 = sh[ 1 ];\n\t\tS9 = sh[ 0 ];\n\t\tdx0 = sx[ 9 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 8 ] - ( S0*sx[9] );\n\t\tdx2 = sx[ 7 ] - ( S1*sx[8] );\n\t\tdx3 = sx[ 6 ] - ( S2*sx[7] );\n\t\tdx4 = sx[ 5 ] - ( S3*sx[6] );\n\t\tdx5 = sx[ 4 ] - ( S4*sx[5] );\n\t\tdx6 = sx[ 3 ] - ( S5*sx[4] );\n\t\tdx7 = sx[ 2 ] - ( S6*sx[3] );\n\t\tdx8 = sx[ 1 ] - ( S7*sx[2] );\n\t\tdx9 = sx[ 0 ] - ( S8*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 9 ];\n\t\tdy1 = sy[ 8 ] - ( S0*sy[9] );\n\t\tdy2 = sy[ 7 ] - ( S1*sy[8] );\n\t\tdy3 = sy[ 6 ] - ( S2*sy[7] );\n\t\tdy4 = sy[ 5 ] - ( S3*sy[6] );\n\t\tdy5 = sy[ 4 ] - ( S4*sy[5] );\n\t\tdy6 = sy[ 3 ] - ( S5*sy[4] );\n\t\tdy7 = sy[ 2 ] - ( S6*sy[3] );\n\t\tdy8 = sy[ 1 ] - ( S7*sy[2] );\n\t\tdy9 = sy[ 0 ] - ( S8*sy[1] );\n\t\tdz0 = sz[ 9 ];\n\t\tdz1 = sz[ 8 ] - ( S0*sz[9] );\n\t\tdz2 = sz[ 7 ] - ( S1*sz[8] );\n\t\tdz3 = sz[ 6 ] - ( S2*sz[7] );\n\t\tdz4 = sz[ 5 ] - ( S3*sz[6] );\n\t\tdz5 = sz[ 4 ] - ( S4*sz[5] );\n\t\tdz6 = sz[ 3 ] - ( S5*sz[4] );\n\t\tdz7 = sz[ 2 ] - ( S6*sz[3] );\n\t\tdz8 = sz[ 1 ] - ( S7*sz[2] );\n\t\tdz9 = sz[ 0 ] - ( S8*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tS8 = sh[ 8 ];\n\t\tS9 = sh[ 9 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] );\n\t\tdx7 = sx[ 7 ] - ( S6*sx[6] );\n\t\tdx8 = sx[ 8 ] - ( S7*sx[7] );\n\t\tdx9 = sx[ 9 ] - ( S8*sx[8] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdy7 = sy[ 7 ] - ( S6*sy[6] );\n\t\tdy8 = sy[ 8 ] - ( S7*sy[7] );\n\t\tdy9 = sy[ 9 ] - ( S8*sy[8] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t\tdz7 = sz[ 7 ] - ( S6*sz[6] );\n\t\tdz8 = sz[ 8 ] - ( S7*sz[7] );\n\t\tdz9 = sz[ 9 ] - ( S8*sz[8] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i9 = 0; i9 < S9; i9++ ) {\n\t\tfor ( i8 = 0; i8 < S8; i8++ ) {\n\t\t\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\t\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx6;\n\t\t\t\t\tiy += dy6;\n\t\t\t\t\tiz += dz6;\n\t\t\t\t}\n\t\t\t\tix += dx7;\n\t\t\t\tiy += dy7;\n\t\t\t\tiz += dz7;\n\t\t\t}\n\t\t\tix += dx8;\n\t\t\tiy += dy8;\n\t\t\tiz += dz8;\n\t\t}\n\t\tix += dx9;\n\t\tiy += dy9;\n\t\tiz += dz9;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary10d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar numel = require( '@stdlib/ndarray-base-numel' );\nvar vind2bind = require( '@stdlib/ndarray-base-vind2bind' );\n\n\n// VARIABLES //\n\nvar MODE = 'throw';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in n-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 6, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binarynd( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binarynd( x, y, z, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar ordx;\n\tvar ordy;\n\tvar ordz;\n\tvar len;\n\tvar sh;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i;\n\n\tsh = x.shape;\n\n\t// Compute the total number of elements over which to iterate:\n\tlen = numel( sh );\n\n\t// Cache references to the input and output ndarray data buffers:\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache references to the respective stride arrays:\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays:\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache the respective array orders:\n\tordx = x.order;\n\tordy = y.order;\n\tordz = z.order;\n\n\t// Iterate over each element based on the linear **view** index, regardless as to how the data is stored in memory...\n\tfor ( i = 0; i < len; i++ ) {\n\t\tix = vind2bind( sh, sx, ox, ordx, i, MODE );\n\t\tiy = vind2bind( sh, sy, oy, ordy, i, MODE );\n\t\tiz = vind2bind( sh, sz, oz, ordz, i, MODE );\n\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binarynd;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar iterationOrder = require( '@stdlib/ndarray-base-iteration-order' );\nvar minmaxViewBufferIndex = require( '@stdlib/ndarray-base-minmax-view-buffer-index' );\nvar ndarray2object = require( '@stdlib/ndarray-base-ndarraylike2object' );\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\nvar anyIsEntryIn = require( '@stdlib/array-base-any-is-entry-in' );\nvar format = require( '@stdlib/string-format' );\nvar blockedaccessorbinary2d = require( './2d_blocked_accessors.js' );\nvar blockedaccessorbinary3d = require( './3d_blocked_accessors.js' );\nvar blockedaccessorbinary4d = require( './4d_blocked_accessors.js' );\nvar blockedaccessorbinary5d = require( './5d_blocked_accessors.js' );\nvar blockedaccessorbinary6d = require( './6d_blocked_accessors.js' );\nvar blockedaccessorbinary7d = require( './7d_blocked_accessors.js' );\nvar blockedaccessorbinary8d = require( './8d_blocked_accessors.js' );\nvar blockedaccessorbinary9d = require( './9d_blocked_accessors.js' );\nvar blockedaccessorbinary10d = require( './10d_blocked_accessors.js' );\nvar blockedbinary2d = require( './2d_blocked.js' );\nvar blockedbinary3d = require( './3d_blocked.js' );\nvar blockedbinary4d = require( './4d_blocked.js' );\nvar blockedbinary5d = require( './5d_blocked.js' );\nvar blockedbinary6d = require( './6d_blocked.js' );\nvar blockedbinary7d = require( './7d_blocked.js' );\nvar blockedbinary8d = require( './8d_blocked.js' );\nvar blockedbinary9d = require( './9d_blocked.js' );\nvar blockedbinary10d = require( './10d_blocked.js' );\nvar accessorbinary0d = require( './0d_accessors.js' );\nvar accessorbinary1d = require( './1d_accessors.js' );\nvar accessorbinary2d = require( './2d_accessors.js' );\nvar accessorbinary3d = require( './3d_accessors.js' );\nvar accessorbinary4d = require( './4d_accessors.js' );\nvar accessorbinary5d = require( './5d_accessors.js' );\nvar accessorbinary6d = require( './6d_accessors.js' );\nvar accessorbinary7d = require( './7d_accessors.js' );\nvar accessorbinary8d = require( './8d_accessors.js' );\nvar accessorbinary9d = require( './9d_accessors.js' );\nvar accessorbinary10d = require( './10d_accessors.js' );\nvar accessorbinarynd = require( './nd_accessors.js' );\nvar binary0d = require( './0d.js' );\nvar binary1d = require( './1d.js' );\nvar binary2d = require( './2d.js' );\nvar binary3d = require( './3d.js' );\nvar binary4d = require( './4d.js' );\nvar binary5d = require( './5d.js' );\nvar binary6d = require( './6d.js' );\nvar binary7d = require( './7d.js' );\nvar binary8d = require( './8d.js' );\nvar binary9d = require( './9d.js' );\nvar binary10d = require( './10d.js' );\nvar binarynd = require( './nd.js' );\n\n\n// VARIABLES //\n\nvar BINARY = [\n\tbinary0d,\n\tbinary1d,\n\tbinary2d,\n\tbinary3d,\n\tbinary4d,\n\tbinary5d,\n\tbinary6d,\n\tbinary7d,\n\tbinary8d,\n\tbinary9d,\n\tbinary10d\n];\nvar ACCESSOR_BINARY = [\n\taccessorbinary0d,\n\taccessorbinary1d,\n\taccessorbinary2d,\n\taccessorbinary3d,\n\taccessorbinary4d,\n\taccessorbinary5d,\n\taccessorbinary6d,\n\taccessorbinary7d,\n\taccessorbinary8d,\n\taccessorbinary9d,\n\taccessorbinary10d\n];\nvar BLOCKED_BINARY = [\n\tblockedbinary2d, // 0\n\tblockedbinary3d,\n\tblockedbinary4d,\n\tblockedbinary5d,\n\tblockedbinary6d,\n\tblockedbinary7d,\n\tblockedbinary8d,\n\tblockedbinary9d,\n\tblockedbinary10d // 8\n];\nvar BLOCKED_ACCESSOR_BINARY = [\n\tblockedaccessorbinary2d, // 0\n\tblockedaccessorbinary3d,\n\tblockedaccessorbinary4d,\n\tblockedaccessorbinary5d,\n\tblockedaccessorbinary6d,\n\tblockedaccessorbinary7d,\n\tblockedaccessorbinary8d,\n\tblockedaccessorbinary9d,\n\tblockedaccessorbinary10d // 8\n];\nvar MAX_DIMS = BINARY.length - 1;\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating if at least one ndarray data buffer implements the accessor protocol.\n*\n* @private\n* @param {ndarrayLike} x - first ndarray\n* @param {ndarrayLike} y - second ndarray\n* @param {ndarrayLike} z - third ndarray\n* @returns {boolean} boolean indicating whether an ndarray data buffer implements the accessor protocol\n*/\nfunction hasAccessors( x, y, z ) {\n\treturn anyIsEntryIn( [ x, y, z ], 'accessorProtocol', true );\n}\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in input ndarrays and assigns results to elements in an output ndarray.\n*\n* ## Notes\n*\n* - Each provided ndarray should be an object with the following properties:\n*\n* - **dtype**: data type.\n* - **data**: data buffer.\n* - **shape**: dimensions.\n* - **strides**: stride lengths.\n* - **offset**: index offset.\n* - **order**: specifies whether an ndarray is row-major (C-style) or column major (Fortran-style).\n*\n* @param {ArrayLikeObject} arrays - array-like object containing two input arrays and one output array\n* @param {Callback} fcn - binary callback\n* @throws {Error} arrays must have the same number of dimensions\n* @throws {Error} arrays must have the same shape\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray = require( '@stdlib/ndarray-ctor' );\n* var getData = require( '@stdlib/ndarray-data-buffer' );\n*\n* function add( a, b ) {\n* return a + b;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] );\n* var zbuf = new Float64Array( 6 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 2, 1 ];\n* var sy = [ 2, 2, 1 ];\n* var sz = [ 2, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarrays:\n* var x = new ndarray( 'float64', xbuf, shape, sx, ox, 'row-major' );\n* var y = new ndarray( 'float64', ybuf, shape, sy, oy, 'row-major' );\n* var z = new ndarray( 'float64', zbuf, shape, sz, oz, 'row-major' );\n*\n* // Apply the binary function:\n* binary( [ x, y, z ], add );\n*\n* console.log( getData( z ) );\n* // => [ 2.0, 4.0, 6.0, 8.0, 10.0, 12.0 ]\n*/\nfunction binary( arrays, fcn ) { // eslint-disable-line max-statements\n\tvar ndims;\n\tvar xmmv;\n\tvar ymmv;\n\tvar zmmv;\n\tvar shx;\n\tvar shy;\n\tvar shz;\n\tvar iox;\n\tvar ioy;\n\tvar ioz;\n\tvar len;\n\tvar ord;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ns;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar d;\n\tvar i;\n\n\t// Unpack the ndarrays and standardize ndarray meta data:\n\tx = ndarray2object( arrays[ 0 ] );\n\ty = ndarray2object( arrays[ 1 ] );\n\tz = ndarray2object( arrays[ 2 ] );\n\n\t// Verify that the input and output arrays have the same number of dimensions...\n\tshx = x.shape;\n\tshy = y.shape;\n\tshz = z.shape;\n\tndims = shx.length;\n\tif ( ndims !== shy.length || ndims !== shz.length ) {\n\t\tthrow new Error( format( 'invalid arguments. Arrays must have the same number of dimensions (i.e., same rank). ndims(x) == %d. ndims(y) == %d. ndims(z) == %d.', ndims, shy.length, shz.length ) );\n\t}\n\t// Determine whether we can avoid iteration altogether...\n\tif ( ndims === 0 ) {\n\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\treturn ACCESSOR_BINARY[ ndims ]( x, y, z, fcn );\n\t\t}\n\t\treturn BINARY[ ndims ]( x, y, z, fcn );\n\t}\n\t// Verify that the input and output arrays have the same dimensions...\n\tlen = 1; // number of elements\n\tns = 0; // number of singleton dimensions\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\td = shx[ i ];\n\t\tif ( d !== shy[ i ] || d !== shz[ i ] ) {\n\t\t\tthrow new Error( 'invalid arguments. Arrays must have the same shape.' );\n\t\t}\n\t\t// Note that, if one of the dimensions is `0`, the length will be `0`...\n\t\tlen *= d;\n\n\t\t// Check whether the current dimension is a singleton dimension...\n\t\tif ( d === 1 ) {\n\t\t\tns += 1;\n\t\t}\n\t}\n\t// Check whether we were provided empty ndarrays...\n\tif ( len === 0 ) {\n\t\treturn;\n\t}\n\t// Determine whether the ndarrays are one-dimensional and thus readily translate to one-dimensional strided arrays...\n\tif ( ndims === 1 ) {\n\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\treturn ACCESSOR_BINARY[ ndims ]( x, y, z, fcn );\n\t\t}\n\t\treturn BINARY[ ndims ]( x, y, z, fcn );\n\t}\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\n\t// Determine whether the ndarrays have only **one** non-singleton dimension (e.g., ndims=4, shape=[10,1,1,1]) so that we can treat the ndarrays as being equivalent to one-dimensional strided arrays...\n\tif ( ns === ndims-1 ) {\n\t\t// Get the index of the non-singleton dimension...\n\t\tfor ( i = 0; i < ndims; i++ ) {\n\t\t\tif ( shx[ i ] !== 1 ) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tx.shape = [ shx[i] ];\n\t\ty.shape = x.shape;\n\t\tz.shape = x.shape;\n\t\tx.strides = [ sx[i] ];\n\t\ty.strides = [ sy[i] ];\n\t\tz.strides = [ sz[i] ];\n\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\treturn ACCESSOR_BINARY[ 1 ]( x, y, z, fcn );\n\t\t}\n\t\treturn BINARY[ 1 ]( x, y, z, fcn );\n\t}\n\tiox = iterationOrder( sx ); // +/-1\n\tioy = iterationOrder( sy ); // +/-1\n\tioz = iterationOrder( sz ); // +/-1\n\n\t// Determine whether we can avoid blocked iteration...\n\tord = strides2order( sx );\n\tif ( iox !== 0 && ioy !== 0 && ioz !== 0 && ord === strides2order( sy ) && ord === strides2order( sz ) ) { // eslint-disable-line max-len\n\t\t// Determine the minimum and maximum linear indices which are accessible by the array views:\n\t\txmmv = minmaxViewBufferIndex( shx, sx, x.offset );\n\t\tymmv = minmaxViewBufferIndex( shy, sy, y.offset );\n\t\tzmmv = minmaxViewBufferIndex( shz, sz, z.offset );\n\n\t\t// Determine whether we can ignore shape (and strides) and treat the ndarrays as linear one-dimensional strided arrays...\n\t\tif (\n\t\t\tlen === ( xmmv[1]-xmmv[0]+1 ) &&\n\t\t\tlen === ( ymmv[1]-ymmv[0]+1 ) &&\n\t\t\tlen === ( zmmv[1]-zmmv[0]+1 )\n\t\t) {\n\t\t\t// Note: the above is equivalent to @stdlib/ndarray/base/assert/is-contiguous, but in-lined so we can retain computed values...\n\t\t\tif ( iox === 1 ) {\n\t\t\t\tox = xmmv[ 0 ];\n\t\t\t} else {\n\t\t\t\tox = xmmv[ 1 ];\n\t\t\t}\n\t\t\tif ( ioy === 1 ) {\n\t\t\t\toy = ymmv[ 0 ];\n\t\t\t} else {\n\t\t\t\toy = ymmv[ 1 ];\n\t\t\t}\n\t\t\tif ( ioz === 1 ) {\n\t\t\t\toz = zmmv[ 0 ];\n\t\t\t} else {\n\t\t\t\toz = zmmv[ 1 ];\n\t\t\t}\n\t\t\tx.shape = [ len ];\n\t\t\ty.shape = x.shape;\n\t\t\tz.shape = x.shape;\n\t\t\tx.strides = [ iox ];\n\t\t\ty.strides = [ ioy ];\n\t\t\tz.strides = [ ioz ];\n\t\t\tx.offset = ox;\n\t\t\ty.offset = oy;\n\t\t\tz.offset = oz;\n\t\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\t\treturn ACCESSOR_BINARY[ 1 ]( x, y, z, fcn );\n\t\t\t}\n\t\t\treturn BINARY[ 1 ]( x, y, z, fcn );\n\t\t}\n\t\t// At least one ndarray is non-contiguous, so we cannot directly use one-dimensional array functionality...\n\n\t\t// Determine whether we can use simple nested loops...\n\t\tif ( ndims <= MAX_DIMS ) {\n\t\t\t// So long as iteration for each respective array always moves in the same direction (i.e., no mixed sign strides), we can leverage cache-optimal (i.e., normal) nested loops without resorting to blocked iteration...\n\t\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\t\treturn ACCESSOR_BINARY[ ndims ]( x, y, z, ord === 1, fcn );\n\t\t\t}\n\t\t\treturn BINARY[ ndims ]( x, y, z, ord === 1, fcn );\n\t\t}\n\t\t// Fall-through to blocked iteration...\n\t}\n\t// At this point, we're either dealing with non-contiguous n-dimensional arrays, high dimensional n-dimensional arrays, and/or arrays having differing memory layouts, so our only hope is that we can still perform blocked iteration...\n\n\t// Determine whether we can perform blocked iteration...\n\tif ( ndims <= MAX_DIMS ) {\n\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\treturn BLOCKED_ACCESSOR_BINARY[ ndims-2 ]( x, y, z, fcn );\n\t\t}\n\t\treturn BLOCKED_BINARY[ ndims-2 ]( x, y, z, fcn );\n\t}\n\t// Fall-through to linear view iteration without regard for how data is stored in memory (i.e., take the slow path)...\n\tif ( hasAccessors( x, y, z ) ) {\n\t\treturn accessorbinarynd( x, y, z, fcn );\n\t}\n\tbinarynd( x, y, z, fcn );\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a binary callback to elements in input ndarrays and assign results to elements in an output ndarray.\n*\n* @module @stdlib/ndarray-base-binary\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray = require( '@stdlib/ndarray-ctor' );\n* var getData = require( '@stdlib/ndarray-data-buffer' );\n* var binary = require( '@stdlib/ndarray-base-binary' );\n*\n* function add( a, b ) {\n* return a + b;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] );\n* var zbuf = new Float64Array( 6 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 2, 1 ];\n* var sy = [ 2, 2, 1 ];\n* var sz = [ 2, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarrays:\n* var x = new ndarray( 'float64', xbuf, shape, sx, ox, 'row-major' );\n* var y = new ndarray( 'float64', ybuf, shape, sy, oy, 'row-major' );\n* var z = new ndarray( 'float64', zbuf, shape, sz, oz, 'row-major' );\n*\n* // Apply the binary function:\n* binary( [ x, y, z ], add );\n*\n* console.log( getData( z ) );\n* // => [ 2.0, 4.0, 6.0, 8.0, 10.0, 12.0 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"], - "mappings": "kIAAA,IAAAA,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EAiGzE,SAASC,GAAiBC,EAAGC,EAAGC,EAAGC,GAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAmCJ,IA9BAA,EAAIvC,GAAWG,EAAE,MAAOA,EAAE,QAASC,EAAE,QAASC,EAAE,OAAQ,EACxDkB,EAAKgB,EAAE,GACPb,EAAKa,EAAE,GACPZ,EAAKY,EAAE,GACPX,EAAKW,EAAE,GAGPhC,EAAQN,GAAWE,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7CwB,EAAK1B,EAAE,OACP2B,EAAK1B,EAAE,OACP2B,EAAK1B,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTS,EAAMY,EAAG,CAAC,EACVV,EAAMW,EAAG,CAAC,EACVT,EAAMU,EAAG,CAAC,EAGVjB,EAAOR,EAAE,UAAU,CAAC,EACpBS,EAAOR,EAAE,UAAU,CAAC,EACpBS,EAAOR,EAAE,UAAU,CAAC,EAGdiC,EAAKf,EAAG,CAAC,EAAGe,EAAK,GAWtB,IAVKA,EAAK/B,GACTkB,EAAKa,EACLA,EAAK,IAELb,EAAKlB,EACL+B,GAAM/B,GAEPa,EAAMS,EAAOS,EAAGZ,EAAG,CAAC,EACpBL,EAAMS,EAAOQ,EAAGX,EAAG,CAAC,EACpBL,EAAMS,EAAOO,EAAGV,EAAG,CAAC,EACdS,EAAKd,EAAG,CAAC,EAAGc,EAAK,GAmBtB,IAlBKA,EAAK9B,GACTiB,EAAKa,EACLA,EAAK,IAELb,EAAKjB,EACL8B,GAAM9B,GAGPyB,EAAKZ,EAAQiB,EAAGX,EAAG,CAAC,EACpBO,EAAKZ,EAAQgB,EAAGV,EAAG,CAAC,EACpBO,EAAKZ,EAAQe,EAAGT,EAAG,CAAC,EAGpBb,EAAMW,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBT,EAAMU,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBR,EAAMS,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EAGjBQ,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IACtBtB,EAAMH,EAAMwB,EAAI5B,GAAKK,EAAMH,EAAMwB,CAAG,EAAGpB,EAAMH,EAAMwB,CAAG,CAAE,CAAE,EAC1DD,GAAMlB,EACNmB,GAAMjB,EACNkB,GAAMhB,EAEPc,GAAMjB,EACNkB,GAAMhB,EACNiB,GAAMf,CACP,CAGH,CAKApB,GAAO,QAAUG,KC5OjB,IAAAsC,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EAiGzE,SAASC,GAAiBC,EAAGC,EAAGC,EAAGC,GAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAmCJ,IA9BAA,EAAIhD,GAAWG,EAAE,MAAOA,EAAE,QAASC,EAAE,QAASC,EAAE,OAAQ,EACxDwB,EAAKmB,EAAE,GACPf,EAAKe,EAAE,GACPd,EAAKc,EAAE,GACPb,EAAKa,EAAE,GAGPzC,EAAQN,GAAWE,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7C+B,EAAKjC,EAAE,OACPkC,EAAKjC,EAAE,OACPkC,EAAKjC,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTS,EAAMmB,EAAG,CAAC,EACVhB,EAAMiB,EAAG,CAAC,EACVd,EAAMe,EAAG,CAAC,EAGVxB,EAAOR,EAAE,UAAU,CAAC,EACpBS,EAAOR,EAAE,UAAU,CAAC,EACpBS,EAAOR,EAAE,UAAU,CAAC,EAGd0C,EAAKlB,EAAG,CAAC,EAAGkB,EAAK,GAWtB,IAVKA,EAAKxC,GACTyB,EAAKe,EACLA,EAAK,IAELf,EAAKzB,EACLwC,GAAMxC,GAEPiB,EAAMY,EAAOW,EAAGd,EAAG,CAAC,EACpBP,EAAMW,EAAOU,EAAGb,EAAG,CAAC,EACpBN,EAAMU,EAAOS,EAAGZ,EAAG,CAAC,EACdW,EAAKjB,EAAG,CAAC,EAAGiB,EAAK,GActB,IAbKA,EAAKvC,GACTwB,EAAKe,EACLA,EAAK,IAELf,EAAKxB,EACLuC,GAAMvC,GAEPS,EAAMiB,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBd,EAAMe,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBZ,EAAMa,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBZ,EAAMC,EAAQsB,EAAGb,EAAG,CAAC,EACrBR,EAAMC,EAAQoB,EAAGZ,EAAG,CAAC,EACrBP,EAAMC,EAAQkB,EAAGX,EAAG,CAAC,EACfU,EAAKhB,EAAG,CAAC,EAAGgB,EAAK,GAmBtB,IAlBKA,EAAKtC,GACTuB,EAAKe,EACLA,EAAK,IAELf,EAAKvB,EACLsC,GAAMtC,GAGPgC,EAAKhB,EAAQsB,EAAGZ,EAAG,CAAC,EACpBO,EAAKf,EAAQoB,EAAGX,EAAG,CAAC,EACpBO,EAAKd,EAAQkB,EAAGV,EAAG,CAAC,EAGpBpB,EAAMkB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBf,EAAMgB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBb,EAAMc,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EAGjBS,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IACtB7B,EAAMH,EAAM+B,EAAInC,GAAKK,EAAMH,EAAM+B,CAAG,EAAG3B,EAAMH,EAAM+B,CAAG,CAAE,CAAE,EAC1DD,GAAMzB,EACN0B,GAAMvB,EACNwB,GAAMrB,EAEPmB,GAAMxB,EACNyB,GAAMtB,EACNuB,GAAMpB,CACP,CACAkB,GAAMvB,EACNwB,GAAMrB,EACNsB,GAAMnB,CACP,CAIJ,CAKAvB,GAAO,QAAUG,KC3QjB,IAAA+C,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EAiGzE,SAASC,GAAiBC,EAAGC,EAAGC,EAAGC,GAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAmCJ,IA9BAA,EAAIzD,GAAWG,EAAE,MAAOA,EAAE,QAASC,EAAE,QAASC,EAAE,OAAQ,EACxD8B,EAAKsB,EAAE,GACPjB,EAAKiB,EAAE,GACPhB,EAAKgB,EAAE,GACPf,EAAKe,EAAE,GAGPlD,EAAQN,GAAWE,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7CsC,EAAKxC,EAAE,OACPyC,EAAKxC,EAAE,OACPyC,EAAKxC,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTS,EAAM0B,EAAG,CAAC,EACVtB,EAAMuB,EAAG,CAAC,EACVnB,EAAMoB,EAAG,CAAC,EAGV/B,EAAOR,EAAE,UAAU,CAAC,EACpBS,EAAOR,EAAE,UAAU,CAAC,EACpBS,EAAOR,EAAE,UAAU,CAAC,EAGdmD,EAAKrB,EAAG,CAAC,EAAGqB,EAAK,GAWtB,IAVKA,EAAKjD,GACTgC,EAAKiB,EACLA,EAAK,IAELjB,EAAKhC,EACLiD,GAAMjD,GAEPqB,EAAMe,EAAOa,EAAGhB,EAAG,CAAC,EACpBT,EAAMa,EAAOY,EAAGf,EAAG,CAAC,EACpBP,EAAMW,EAAOW,EAAGd,EAAG,CAAC,EACda,EAAKpB,EAAG,CAAC,EAAGoB,EAAK,GActB,IAbKA,EAAKhD,GACT+B,EAAKiB,EACLA,EAAK,IAELjB,EAAK/B,EACLgD,GAAMhD,GAEPU,EAAMuB,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBnB,EAAMoB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBhB,EAAMiB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBf,EAAMC,EAAQ2B,EAAGf,EAAG,CAAC,EACrBV,EAAMC,EAAQwB,EAAGd,EAAG,CAAC,EACrBR,EAAMC,EAAQqB,EAAGb,EAAG,CAAC,EACfY,EAAKnB,EAAG,CAAC,EAAGmB,EAAK,GActB,IAbKA,EAAK/C,GACT8B,EAAKiB,EACLA,EAAK,IAELjB,EAAK9B,EACL+C,GAAM/C,GAEPS,EAAMwB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBpB,EAAMqB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBjB,EAAMkB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBhB,EAAMC,EAAQ2B,EAAGd,EAAG,CAAC,EACrBX,EAAMC,EAAQwB,EAAGb,EAAG,CAAC,EACrBT,EAAMC,EAAQqB,EAAGZ,EAAG,CAAC,EACfW,EAAKlB,EAAG,CAAC,EAAGkB,EAAK,GAmBtB,IAlBKA,EAAK9C,GACT6B,EAAKiB,EACLA,EAAK,IAELjB,EAAK7B,EACL8C,GAAM9C,GAGPuC,EAAKpB,EAAQ2B,EAAGb,EAAG,CAAC,EACpBO,EAAKlB,EAAQwB,EAAGZ,EAAG,CAAC,EACpBO,EAAKhB,EAAQqB,EAAGX,EAAG,CAAC,EAGpB3B,EAAMyB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBrB,EAAMsB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBlB,EAAMmB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EAGjBU,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IACtBpC,EAAMH,EAAMsC,EAAI1C,GAAKK,EAAMH,EAAMsC,CAAG,EAAGlC,EAAMH,EAAMsC,CAAG,CAAE,CAAE,EAC1DD,GAAMhC,EACNiC,GAAM7B,EACN8B,GAAM1B,EAEPwB,GAAM/B,EACNgC,GAAM5B,EACN6B,GAAMzB,CACP,CACAuB,GAAM9B,EACN+B,GAAM3B,EACN4B,GAAMxB,CACP,CACAsB,GAAM7B,EACN8B,GAAM1B,EACN2B,GAAMvB,CACP,CAKL,CAKA1B,GAAO,QAAUG,KCxSjB,IAAAwD,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EAiGzE,SAASC,GAAiBC,EAAGC,EAAGC,EAAGC,GAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAmCJ,IA9BAA,GAAIlE,GAAWG,EAAE,MAAOA,EAAE,QAASC,EAAE,QAASC,EAAE,OAAQ,EACxDoC,EAAKyB,GAAE,GACPnB,EAAKmB,GAAE,GACPlB,EAAKkB,GAAE,GACPjB,EAAKiB,GAAE,GAGP3D,EAAQN,GAAWE,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7C6C,EAAK/C,EAAE,OACPgD,EAAK/C,EAAE,OACPgD,EAAK/C,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTS,EAAMiC,EAAG,CAAC,EACV5B,EAAM6B,EAAG,CAAC,EACVxB,EAAMyB,EAAG,CAAC,EAGVtC,EAAOR,EAAE,UAAU,CAAC,EACpBS,EAAOR,EAAE,UAAU,CAAC,EACpBS,EAAOR,EAAE,UAAU,CAAC,EAGd4D,GAAKxB,EAAG,CAAC,EAAGwB,GAAK,GAWtB,IAVKA,GAAK1D,GACTuC,EAAKmB,GACLA,GAAK,IAELnB,EAAKvC,EACL0D,IAAM1D,GAEPyB,EAAMkB,EAAOe,GAAGlB,EAAG,CAAC,EACpBX,EAAMe,EAAOc,GAAGjB,EAAG,CAAC,EACpBR,EAAMY,EAAOa,GAAGhB,EAAG,CAAC,EACde,GAAKvB,EAAG,CAAC,EAAGuB,GAAK,GActB,IAbKA,GAAKzD,GACTsC,EAAKmB,GACLA,GAAK,IAELnB,EAAKtC,EACLyD,IAAMzD,GAEPW,EAAM6B,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBxB,EAAMyB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBpB,EAAMqB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBlB,EAAMC,EAAQgC,GAAGjB,EAAG,CAAC,EACrBZ,EAAMC,EAAQ4B,GAAGhB,EAAG,CAAC,EACrBT,EAAMC,EAAQwB,GAAGf,EAAG,CAAC,EACfc,GAAKtB,EAAG,CAAC,EAAGsB,GAAK,GActB,IAbKA,GAAKxD,GACTqC,EAAKmB,GACLA,GAAK,IAELnB,EAAKrC,EACLwD,IAAMxD,GAEPU,EAAM8B,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBzB,EAAM0B,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBrB,EAAMsB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBnB,EAAMC,EAAQgC,GAAGhB,EAAG,CAAC,EACrBb,EAAMC,EAAQ4B,GAAGf,EAAG,CAAC,EACrBV,EAAMC,EAAQwB,GAAGd,EAAG,CAAC,EACfa,GAAKrB,EAAG,CAAC,EAAGqB,GAAK,GActB,IAbKA,GAAKvD,GACToC,EAAKmB,GACLA,GAAK,IAELnB,EAAKpC,EACLuD,IAAMvD,GAEPS,EAAM+B,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvB1B,EAAM2B,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBtB,EAAMuB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBpB,EAAMC,EAAQgC,GAAGf,EAAG,CAAC,EACrBd,EAAMC,EAAQ4B,GAAGd,EAAG,CAAC,EACrBX,EAAMC,EAAQwB,GAAGb,EAAG,CAAC,EACfY,GAAKpB,EAAG,CAAC,EAAGoB,GAAK,GAmBtB,IAlBKA,GAAKtD,GACTmC,EAAKmB,GACLA,GAAK,IAELnB,EAAKnC,EACLsD,IAAMtD,GAGP8C,EAAKxB,EAAQgC,GAAGd,EAAG,CAAC,EACpBO,EAAKrB,EAAQ4B,GAAGb,EAAG,CAAC,EACpBO,EAAKlB,EAAQwB,GAAGZ,EAAG,CAAC,EAGpBlC,EAAMgC,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvB3B,EAAM4B,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBvB,EAAMwB,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,EAGjBW,GAAK,EAAGA,GAAKd,EAAIc,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKd,EAAIc,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKd,EAAIc,KAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKd,EAAIc,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKd,EAAIc,IACtB3C,EAAMH,EAAM6C,EAAIjD,GAAKK,EAAMH,EAAM6C,CAAG,EAAGzC,EAAMH,EAAM6C,CAAG,CAAE,CAAE,EAC1DD,GAAMvC,EACNwC,GAAMnC,EACNoC,GAAM/B,EAEP6B,GAAMtC,EACNuC,GAAMlC,EACNmC,GAAM9B,CACP,CACA4B,GAAMrC,EACNsC,GAAMjC,EACNkC,GAAM7B,CACP,CACA2B,GAAMpC,EACNqC,GAAMhC,EACNiC,GAAM5B,CACP,CACA0B,GAAMnC,EACNoC,GAAM/B,EACNgC,GAAM3B,CACP,CAMN,CAKA7B,GAAO,QAAUG,KCrUjB,IAAAiE,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EAiGzE,SAASC,GAAiBC,EAAGC,EAAGC,EAAGC,GAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAmCJ,IA9BAA,GAAI3E,GAAWG,EAAE,MAAOA,EAAE,QAASC,EAAE,QAASC,EAAE,OAAQ,EACxD0C,EAAK4B,GAAE,GACPrB,EAAKqB,GAAE,GACPpB,EAAKoB,GAAE,GACPnB,EAAKmB,GAAE,GAGPpE,EAAQN,GAAWE,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7CoD,EAAKtD,EAAE,OACPuD,GAAKtD,EAAE,OACPuD,GAAKtD,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTS,EAAMwC,EAAG,CAAC,EACVlC,EAAMmC,EAAG,CAAC,EACV7B,EAAM8B,EAAG,CAAC,EAGV7C,EAAOR,EAAE,UAAU,CAAC,EACpBS,EAAOR,EAAE,UAAU,CAAC,EACpBS,EAAOR,EAAE,UAAU,CAAC,EAGdqE,GAAK3B,EAAG,CAAC,EAAG2B,GAAK,GAWtB,IAVKA,GAAKnE,GACT8C,EAAKqB,GACLA,GAAK,IAELrB,EAAK9C,EACLmE,IAAMnE,GAEP6B,EAAMqB,EAAOiB,GAAGpB,EAAG,CAAC,EACpBb,EAAMiB,GAAOgB,GAAGnB,EAAG,CAAC,EACpBT,EAAMa,GAAOe,GAAGlB,EAAG,CAAC,EACdiB,GAAK1B,EAAG,CAAC,EAAG0B,GAAK,GActB,IAbKA,GAAKlE,GACT6C,EAAKqB,GACLA,GAAK,IAELrB,EAAK7C,EACLkE,IAAMlE,GAEPY,EAAMmC,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvB7B,EAAM8B,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBxB,EAAMyB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBrB,EAAMC,EAAQqC,GAAGnB,EAAG,CAAC,EACrBd,EAAMC,EAAQgC,GAAGlB,EAAG,CAAC,EACrBV,EAAMC,EAAQ2B,GAAGjB,EAAG,CAAC,EACfgB,GAAKzB,EAAG,CAAC,EAAGyB,GAAK,GActB,IAbKA,GAAKjE,GACT4C,EAAKqB,GACLA,GAAK,IAELrB,EAAK5C,EACLiE,IAAMjE,GAEPW,EAAMoC,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvB9B,EAAM+B,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBzB,EAAM0B,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBtB,EAAMC,EAAQqC,GAAGlB,EAAG,CAAC,EACrBf,EAAMC,EAAQgC,GAAGjB,EAAG,CAAC,EACrBX,EAAMC,EAAQ2B,GAAGhB,EAAG,CAAC,EACfe,GAAKxB,EAAG,CAAC,EAAGwB,GAAK,GActB,IAbKA,GAAKhE,GACT2C,EAAKqB,GACLA,GAAK,IAELrB,EAAK3C,EACLgE,IAAMhE,GAEPU,EAAMqC,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvB/B,EAAMgC,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvB1B,EAAM2B,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBvB,EAAMC,EAAQqC,GAAGjB,EAAG,CAAC,EACrBhB,EAAMC,EAAQgC,GAAGhB,EAAG,CAAC,EACrBZ,EAAMC,EAAQ2B,GAAGf,EAAG,CAAC,EACfc,GAAKvB,EAAG,CAAC,EAAGuB,GAAK,GActB,IAbKA,GAAK/D,GACT0C,EAAKqB,GACLA,GAAK,IAELrB,EAAK1C,EACL+D,IAAM/D,GAEPS,EAAMsC,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBhC,EAAMiC,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvB3B,EAAM4B,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,EACvBxB,EAAMC,EAAQqC,GAAGhB,EAAG,CAAC,EACrBjB,EAAMC,EAAQgC,GAAGf,EAAG,CAAC,EACrBb,EAAMC,EAAQ2B,GAAGd,EAAG,CAAC,EACfa,GAAKtB,EAAG,CAAC,EAAGsB,GAAK,GAmBtB,IAlBKA,GAAK9D,GACTyC,EAAKqB,GACLA,GAAK,IAELrB,EAAKzC,EACL8D,IAAM9D,GAGPqD,GAAK5B,EAAQqC,GAAGf,EAAG,CAAC,EACpBO,GAAKxB,EAAQgC,GAAGd,EAAG,CAAC,EACpBO,GAAKpB,EAAQ2B,GAAGb,EAAG,CAAC,EAGpBzC,EAAMuC,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBjC,EAAMkC,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,EACvB5B,EAAM6B,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,EAGjBY,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KACtBlD,EAAMH,EAAMoD,GAAIxD,GAAKK,EAAMH,EAAMoD,EAAG,EAAGhD,EAAMH,EAAMoD,EAAG,CAAE,CAAE,EAC1DD,IAAM9C,EACN+C,IAAMzC,EACN0C,IAAMpC,EAEPkC,IAAM7C,EACN8C,IAAMxC,EACNyC,IAAMnC,CACP,CACAiC,IAAM5C,EACN6C,IAAMvC,EACNwC,IAAMlC,CACP,CACAgC,IAAM3C,EACN4C,IAAMtC,EACNuC,IAAMjC,CACP,CACA+B,IAAM1C,EACN2C,IAAMrC,EACNsC,IAAMhC,CACP,CACA8B,IAAMzC,EACN0C,IAAMpC,EACNqC,IAAM/B,CACP,CAOP,CAKAhC,GAAO,QAAUG,KClWjB,IAAA0E,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EAiGzE,SAASC,GAAiBC,EAAGC,EAAGC,EAAGC,GAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAmCJ,IA9BAA,GAAIpF,GAAWG,EAAE,MAAOA,EAAE,QAASC,EAAE,QAASC,EAAE,OAAQ,EACxDgD,EAAK+B,GAAE,GACPvB,GAAKuB,GAAE,GACPtB,GAAKsB,GAAE,GACPrB,GAAKqB,GAAE,GAGP7E,EAAQN,GAAWE,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7C2D,GAAK7D,EAAE,OACP8D,GAAK7D,EAAE,OACP8D,GAAK7D,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTS,EAAM+C,GAAG,CAAC,EACVxC,EAAMyC,GAAG,CAAC,EACVlC,EAAMmC,GAAG,CAAC,EAGVpD,EAAOR,EAAE,UAAU,CAAC,EACpBS,EAAOR,EAAE,UAAU,CAAC,EACpBS,EAAOR,EAAE,UAAU,CAAC,EAGd8E,GAAK9B,EAAG,CAAC,EAAG8B,GAAK,GAWtB,IAVKA,GAAK5E,GACTqD,GAAKuB,GACLA,GAAK,IAELvB,GAAKrD,EACL4E,IAAM5E,GAEPiC,EAAMwB,GAAOmB,GAAGtB,GAAG,CAAC,EACpBf,EAAMmB,GAAOkB,GAAGrB,GAAG,CAAC,EACpBV,EAAMc,GAAOiB,GAAGpB,GAAG,CAAC,EACdmB,GAAK7B,EAAG,CAAC,EAAG6B,GAAK,GActB,IAbKA,GAAK3E,GACToD,GAAKuB,GACLA,GAAK,IAELvB,GAAKpD,EACL2E,IAAM3E,GAEPa,EAAMyC,GAAG,CAAC,EAAMF,GAAGE,GAAG,CAAC,EACvBlC,EAAMmC,GAAG,CAAC,EAAMH,GAAGG,GAAG,CAAC,EACvB5B,EAAM6B,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvBxB,EAAMC,EAAQ0C,GAAGrB,GAAG,CAAC,EACrBhB,EAAMC,EAAQoC,GAAGpB,GAAG,CAAC,EACrBX,EAAMC,EAAQ8B,GAAGnB,GAAG,CAAC,EACfkB,GAAK5B,EAAG,CAAC,EAAG4B,GAAK,GActB,IAbKA,GAAK1E,GACTmD,GAAKuB,GACLA,GAAK,IAELvB,GAAKnD,EACL0E,IAAM1E,GAEPY,EAAM0C,GAAG,CAAC,EAAMH,GAAGG,GAAG,CAAC,EACvBnC,EAAMoC,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvB7B,EAAM8B,GAAG,CAAC,EAAML,GAAGK,GAAG,CAAC,EACvBzB,EAAMC,EAAQ0C,GAAGpB,GAAG,CAAC,EACrBjB,EAAMC,EAAQoC,GAAGnB,GAAG,CAAC,EACrBZ,EAAMC,EAAQ8B,GAAGlB,GAAG,CAAC,EACfiB,GAAK3B,EAAG,CAAC,EAAG2B,GAAK,GActB,IAbKA,GAAKzE,GACTkD,EAAKuB,GACLA,GAAK,IAELvB,EAAKlD,EACLyE,IAAMzE,GAEPW,EAAM2C,GAAG,CAAC,EAAMJ,EAAGI,GAAG,CAAC,EACvBpC,EAAMqC,GAAG,CAAC,EAAML,EAAGK,GAAG,CAAC,EACvB9B,EAAM+B,GAAG,CAAC,EAAMN,EAAGM,GAAG,CAAC,EACvB1B,EAAMC,EAAQ0C,GAAGnB,GAAG,CAAC,EACrBlB,EAAMC,EAAQoC,GAAGlB,GAAG,CAAC,EACrBb,EAAMC,EAAQ8B,GAAGjB,GAAG,CAAC,EACfgB,GAAK1B,EAAG,CAAC,EAAG0B,GAAK,GActB,IAbKA,GAAKxE,GACTiD,EAAKuB,GACLA,GAAK,IAELvB,EAAKjD,EACLwE,IAAMxE,GAEPU,EAAM4C,GAAG,CAAC,EAAML,EAAGK,GAAG,CAAC,EACvBrC,EAAMsC,GAAG,CAAC,EAAMN,EAAGM,GAAG,CAAC,EACvB/B,EAAMgC,GAAG,CAAC,EAAMP,EAAGO,GAAG,CAAC,EACvB3B,EAAMC,EAAQ0C,GAAGlB,GAAG,CAAC,EACrBnB,EAAMC,EAAQoC,GAAGjB,GAAG,CAAC,EACrBd,EAAMC,EAAQ8B,GAAGhB,GAAG,CAAC,EACfe,GAAKzB,EAAG,CAAC,EAAGyB,GAAK,GActB,IAbKA,GAAKvE,GACTgD,EAAKuB,GACLA,GAAK,IAELvB,EAAKhD,EACLuE,IAAMvE,GAEPS,EAAM6C,GAAG,CAAC,EAAMN,EAAGM,GAAG,CAAC,EACvBtC,EAAMuC,GAAG,CAAC,EAAMP,EAAGO,GAAG,CAAC,EACvBhC,EAAMiC,GAAG,CAAC,EAAMR,EAAGQ,GAAG,CAAC,EACvB5B,EAAMC,EAAQ0C,GAAGjB,GAAG,CAAC,EACrBpB,EAAMC,EAAQoC,GAAGhB,GAAG,CAAC,EACrBf,EAAMC,EAAQ8B,GAAGf,GAAG,CAAC,EACfc,GAAKxB,EAAG,CAAC,EAAGwB,GAAK,GAmBtB,IAlBKA,GAAKtE,GACT+C,EAAKuB,GACLA,GAAK,IAELvB,EAAK/C,EACLsE,IAAMtE,GAGP4D,GAAKhC,EAAQ0C,GAAGhB,GAAG,CAAC,EACpBO,GAAK3B,EAAQoC,GAAGf,GAAG,CAAC,EACpBO,GAAKtB,EAAQ8B,GAAGd,GAAG,CAAC,EAGpBhD,EAAM8C,GAAG,CAAC,EAAMP,EAAGO,GAAG,CAAC,EACvBvC,EAAMwC,GAAG,CAAC,EAAMR,EAAGQ,GAAG,CAAC,EACvBjC,EAAMkC,GAAG,CAAC,EAAMT,EAAGS,GAAG,CAAC,EAGjBa,GAAK,EAAGA,GAAKhB,GAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,GAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,GAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KACtBzD,EAAMH,EAAM2D,GAAI/D,GAAKK,EAAMH,EAAM2D,EAAG,EAAGvD,EAAMH,EAAM2D,EAAG,CAAE,CAAE,EAC1DD,IAAMrD,EACNsD,IAAM/C,EACNgD,IAAMzC,EAEPuC,IAAMpD,EACNqD,IAAM9C,EACN+C,IAAMxC,CACP,CACAsC,IAAMnD,EACNoD,IAAM7C,EACN8C,IAAMvC,CACP,CACAqC,IAAMlD,EACNmD,IAAM5C,EACN6C,IAAMtC,CACP,CACAoC,IAAMjD,EACNkD,IAAM3C,EACN4C,IAAMrC,CACP,CACAmC,IAAMhD,EACNiD,IAAM1C,EACN2C,IAAMpC,CACP,CACAkC,IAAM/C,EACNgD,IAAMzC,EACN0C,IAAMnC,CACP,CAQR,CAKAnC,GAAO,QAAUG,KC/XjB,IAAAmF,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EAiGzE,SAASC,GAAiBC,EAAGC,EAAGC,EAAGC,GAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAmCJ,IA9BAA,GAAI7F,GAAWG,EAAE,MAAOA,EAAE,QAASC,EAAE,QAASC,EAAE,OAAQ,EACxDsD,GAAKkC,GAAE,GACPzB,GAAKyB,GAAE,GACPxB,GAAKwB,GAAE,GACPvB,GAAKuB,GAAE,GAGPtF,EAAQN,GAAWE,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7CkE,GAAKpE,EAAE,OACPqE,GAAKpE,EAAE,OACPqE,GAAKpE,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTS,EAAMsD,GAAG,CAAC,EACV9C,EAAM+C,GAAG,CAAC,EACVvC,EAAMwC,GAAG,CAAC,EAGV3D,EAAOR,EAAE,UAAU,CAAC,EACpBS,EAAOR,EAAE,UAAU,CAAC,EACpBS,EAAOR,EAAE,UAAU,CAAC,EAGduF,GAAKjC,GAAG,CAAC,EAAGiC,GAAK,GAWtB,IAVKA,GAAKrF,GACT4D,GAAKyB,GACLA,GAAK,IAELzB,GAAK5D,EACLqF,IAAMrF,GAEPqC,EAAM2B,GAAOqB,GAAGxB,GAAG,CAAC,EACpBjB,EAAMqB,GAAOoB,GAAGvB,GAAG,CAAC,EACpBX,GAAMe,GAAOmB,GAAGtB,GAAG,CAAC,EACdqB,GAAKhC,GAAG,CAAC,EAAGgC,GAAK,GActB,IAbKA,GAAKpF,GACT2D,GAAKyB,GACLA,GAAK,IAELzB,GAAK3D,EACLoF,IAAMpF,GAEPc,EAAM+C,GAAG,CAAC,EAAMF,GAAGE,GAAG,CAAC,EACvBvC,EAAMwC,GAAG,CAAC,EAAMH,GAAGG,GAAG,CAAC,EACvBhC,EAAMiC,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvB3B,EAAMC,EAAQ+C,GAAGvB,GAAG,CAAC,EACrBlB,EAAMC,EAAQwC,GAAGtB,GAAG,CAAC,EACrBZ,EAAMC,GAAQiC,GAAGrB,GAAG,CAAC,EACfoB,GAAK/B,GAAG,CAAC,EAAG+B,GAAK,GActB,IAbKA,GAAKnF,GACT0D,GAAKyB,GACLA,GAAK,IAELzB,GAAK1D,EACLmF,IAAMnF,GAEPa,EAAMgD,GAAG,CAAC,EAAMH,GAAGG,GAAG,CAAC,EACvBxC,EAAMyC,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvBjC,EAAMkC,GAAG,CAAC,EAAML,GAAGK,GAAG,CAAC,EACvB5B,EAAMC,EAAQ+C,GAAGtB,GAAG,CAAC,EACrBnB,EAAMC,EAAQwC,GAAGrB,GAAG,CAAC,EACrBb,EAAMC,EAAQiC,GAAGpB,GAAG,CAAC,EACfmB,GAAK9B,GAAG,CAAC,EAAG8B,GAAK,GActB,IAbKA,GAAKlF,GACTyD,GAAKyB,GACLA,GAAK,IAELzB,GAAKzD,EACLkF,IAAMlF,GAEPY,EAAMiD,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvBzC,EAAM0C,GAAG,CAAC,EAAML,GAAGK,GAAG,CAAC,EACvBlC,EAAMmC,GAAG,CAAC,EAAMN,GAAGM,GAAG,CAAC,EACvB7B,EAAMC,EAAQ+C,GAAGrB,GAAG,CAAC,EACrBpB,EAAMC,EAAQwC,GAAGpB,GAAG,CAAC,EACrBd,EAAMC,EAAQiC,GAAGnB,GAAG,CAAC,EACfkB,GAAK7B,GAAG,CAAC,EAAG6B,GAAK,GActB,IAbKA,GAAKjF,GACTwD,GAAKyB,GACLA,GAAK,IAELzB,GAAKxD,EACLiF,IAAMjF,GAEPW,EAAMkD,GAAG,CAAC,EAAML,GAAGK,GAAG,CAAC,EACvB1C,EAAM2C,GAAG,CAAC,EAAMN,GAAGM,GAAG,CAAC,EACvBnC,EAAMoC,GAAG,CAAC,EAAMP,GAAGO,GAAG,CAAC,EACvB9B,EAAMC,EAAQ+C,GAAGpB,GAAG,CAAC,EACrBrB,EAAMC,EAAQwC,GAAGnB,GAAG,CAAC,EACrBf,EAAMC,EAAQiC,GAAGlB,GAAG,CAAC,EACfiB,GAAK5B,GAAG,CAAC,EAAG4B,GAAK,GActB,IAbKA,GAAKhF,GACTuD,GAAKyB,GACLA,GAAK,IAELzB,GAAKvD,EACLgF,IAAMhF,GAEPU,EAAMmD,GAAG,CAAC,EAAMN,GAAGM,GAAG,CAAC,EACvB3C,EAAM4C,GAAG,CAAC,EAAMP,GAAGO,GAAG,CAAC,EACvBpC,EAAMqC,GAAG,CAAC,EAAMR,GAAGQ,GAAG,CAAC,EACvB/B,EAAMC,EAAQ+C,GAAGnB,GAAG,CAAC,EACrBtB,EAAMC,EAAQwC,GAAGlB,GAAG,CAAC,EACrBhB,EAAMC,EAAQiC,GAAGjB,GAAG,CAAC,EACfgB,GAAK3B,GAAG,CAAC,EAAG2B,GAAK,GActB,IAbKA,GAAK/E,GACTsD,GAAKyB,GACLA,GAAK,IAELzB,GAAKtD,EACL+E,IAAM/E,GAEPS,EAAMoD,GAAG,CAAC,EAAMP,GAAGO,GAAG,CAAC,EACvB5C,EAAM6C,GAAG,CAAC,EAAMR,GAAGQ,GAAG,CAAC,EACvBrC,EAAMsC,GAAG,CAAC,EAAMT,GAAGS,GAAG,CAAC,EACvBhC,EAAMC,EAAQ+C,GAAGlB,GAAG,CAAC,EACrBvB,EAAMC,EAAQwC,GAAGjB,GAAG,CAAC,EACrBjB,EAAMC,EAAQiC,GAAGhB,GAAG,CAAC,EACfe,GAAK1B,GAAG,CAAC,EAAG0B,GAAK,GAmBtB,IAlBKA,GAAK9E,GACTqD,GAAKyB,GACLA,GAAK,IAELzB,GAAKrD,EACL8E,IAAM9E,GAGPmE,GAAKpC,EAAQ+C,GAAGjB,GAAG,CAAC,EACpBO,GAAK9B,EAAQwC,GAAGhB,GAAG,CAAC,EACpBO,GAAKxB,EAAQiC,GAAGf,GAAG,CAAC,EAGpBvD,EAAMqD,GAAG,CAAC,EAAMR,GAAGQ,GAAG,CAAC,EACvB7C,EAAM8C,GAAG,CAAC,EAAMT,GAAGS,GAAG,CAAC,EACvBtC,EAAMuC,GAAG,CAAC,EAAMV,GAAGU,GAAG,CAAC,EAGjBc,GAAK,EAAGA,GAAKjB,GAAIiB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKjB,GAAIiB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKjB,GAAIiB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKjB,GAAIiB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKjB,GAAIiB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKjB,GAAIiB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKjB,GAAIiB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKjB,GAAIiB,KACtBhE,EAAMH,EAAMkE,GAAItE,GAAKK,EAAMH,EAAMkE,EAAG,EAAG9D,EAAMH,EAAMkE,EAAG,CAAE,CAAE,EAC1DD,IAAM5D,EACN6D,IAAMrD,EACNsD,IAAM9C,EAEP4C,IAAM3D,EACN4D,IAAMpD,EACNqD,IAAM7C,CACP,CACA2C,IAAM1D,EACN2D,IAAMnD,EACNoD,IAAM5C,CACP,CACA0C,IAAMzD,EACN0D,IAAMlD,EACNmD,IAAM3C,CACP,CACAyC,IAAMxD,EACNyD,IAAMjD,EACNkD,IAAM1C,CACP,CACAwC,IAAMvD,EACNwD,IAAMhD,EACNiD,IAAMzC,CACP,CACAuC,IAAMtD,EACNuD,IAAM/C,EACNgD,IAAMxC,CACP,CACAsC,IAAMrD,EACNsD,IAAM9C,EACN+C,IAAMvC,CACP,CAST,CAKAtC,GAAO,QAAUG,KC5ZjB,IAAA4F,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EAiGzE,SAASC,GAAiBC,EAAGC,EAAGC,EAAGC,GAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAmCJ,IA9BAA,GAAItG,GAAWG,EAAE,MAAOA,EAAE,QAASC,EAAE,QAASC,EAAE,OAAQ,EACxD4D,GAAKqC,GAAE,GACP3B,GAAK2B,GAAE,GACP1B,GAAK0B,GAAE,GACPzB,GAAKyB,GAAE,GAGP/F,EAAQN,GAAWE,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7CyE,GAAK3E,EAAE,OACP4E,GAAK3E,EAAE,OACP4E,GAAK3E,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTS,EAAM6D,GAAG,CAAC,EACVpD,EAAMqD,GAAG,CAAC,EACV5C,EAAM6C,GAAG,CAAC,EAGVlE,EAAOR,EAAE,UAAU,CAAC,EACpBS,EAAOR,EAAE,UAAU,CAAC,EACpBS,EAAOR,EAAE,UAAU,CAAC,EAGdgG,GAAKpC,GAAG,CAAC,EAAGoC,GAAK,GAWtB,IAVKA,GAAK9F,GACTmE,GAAK2B,GACLA,GAAK,IAEL3B,GAAKnE,EACL8F,IAAM9F,GAEPyC,EAAM8B,GAAOuB,GAAG1B,GAAG,CAAC,EACpBnB,EAAMuB,GAAOsB,GAAGzB,GAAG,CAAC,EACpBZ,GAAMgB,GAAOqB,GAAGxB,GAAG,CAAC,EACduB,GAAKnC,GAAG,CAAC,EAAGmC,GAAK,GActB,IAbKA,GAAK7F,GACTkE,GAAK2B,GACLA,GAAK,IAEL3B,GAAKlE,EACL6F,IAAM7F,GAEPe,EAAMqD,GAAG,CAAC,EAAMF,GAAGE,GAAG,CAAC,EACvB5C,EAAM6C,GAAG,CAAC,EAAMH,GAAGG,GAAG,CAAC,EACvBpC,EAAMqC,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvB9B,EAAMC,EAAQoD,GAAGzB,GAAG,CAAC,EACrBpB,EAAMC,EAAQ4C,GAAGxB,GAAG,CAAC,EACrBb,GAAMC,GAAQoC,GAAGvB,GAAG,CAAC,EACfsB,GAAKlC,GAAG,CAAC,EAAGkC,GAAK,GActB,IAbKA,GAAK5F,GACTiE,GAAK2B,GACLA,GAAK,IAEL3B,GAAKjE,EACL4F,IAAM5F,GAEPc,EAAMsD,GAAG,CAAC,EAAMH,GAAGG,GAAG,CAAC,EACvB7C,EAAM8C,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvBrC,EAAMsC,GAAG,CAAC,EAAML,GAAGK,GAAG,CAAC,EACvB/B,EAAMC,EAAQoD,GAAGxB,GAAG,CAAC,EACrBrB,EAAMC,EAAQ4C,GAAGvB,GAAG,CAAC,EACrBd,GAAMC,GAAQoC,GAAGtB,GAAG,CAAC,EACfqB,GAAKjC,GAAG,CAAC,EAAGiC,GAAK,GActB,IAbKA,GAAK3F,GACTgE,GAAK2B,GACLA,GAAK,IAEL3B,GAAKhE,EACL2F,IAAM3F,GAEPa,EAAMuD,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvB9C,EAAM+C,GAAG,CAAC,EAAML,GAAGK,GAAG,CAAC,EACvBtC,EAAMuC,GAAG,CAAC,EAAMN,GAAGM,GAAG,CAAC,EACvBhC,EAAMC,EAAQoD,GAAGvB,GAAG,CAAC,EACrBtB,EAAMC,EAAQ4C,GAAGtB,GAAG,CAAC,EACrBf,GAAMC,GAAQoC,GAAGrB,GAAG,CAAC,EACfoB,GAAKhC,GAAG,CAAC,EAAGgC,GAAK,GActB,IAbKA,GAAK1F,GACT+D,GAAK2B,GACLA,GAAK,IAEL3B,GAAK/D,EACL0F,IAAM1F,GAEPY,EAAMwD,GAAG,CAAC,EAAML,GAAGK,GAAG,CAAC,EACvB/C,EAAMgD,GAAG,CAAC,EAAMN,GAAGM,GAAG,CAAC,EACvBvC,EAAMwC,GAAG,CAAC,EAAMP,GAAGO,GAAG,CAAC,EACvBjC,EAAMC,EAAQoD,GAAGtB,GAAG,CAAC,EACrBvB,EAAMC,EAAQ4C,GAAGrB,GAAG,CAAC,EACrBhB,GAAMC,GAAQoC,GAAGpB,GAAG,CAAC,EACfmB,GAAK/B,GAAG,CAAC,EAAG+B,GAAK,GActB,IAbKA,GAAKzF,GACT8D,GAAK2B,GACLA,GAAK,IAEL3B,GAAK9D,EACLyF,IAAMzF,GAEPW,EAAMyD,GAAG,CAAC,EAAMN,GAAGM,GAAG,CAAC,EACvBhD,EAAMiD,GAAG,CAAC,EAAMP,GAAGO,GAAG,CAAC,EACvBxC,EAAMyC,GAAG,CAAC,EAAMR,GAAGQ,GAAG,CAAC,EACvBlC,EAAMC,EAAQoD,GAAGrB,GAAG,CAAC,EACrBxB,EAAMC,EAAQ4C,GAAGpB,GAAG,CAAC,EACrBjB,GAAMC,GAAQoC,GAAGnB,GAAG,CAAC,EACfkB,GAAK9B,GAAG,CAAC,EAAG8B,GAAK,GActB,IAbKA,GAAKxF,GACT6D,GAAK2B,GACLA,GAAK,IAEL3B,GAAK7D,EACLwF,IAAMxF,GAEPU,EAAM0D,GAAG,CAAC,EAAMP,GAAGO,GAAG,CAAC,EACvBjD,EAAMkD,GAAG,CAAC,EAAMR,GAAGQ,GAAG,CAAC,EACvBzC,EAAM0C,GAAG,CAAC,EAAMT,GAAGS,GAAG,CAAC,EACvBnC,EAAMC,EAAQoD,GAAGpB,GAAG,CAAC,EACrBzB,EAAMC,EAAQ4C,GAAGnB,GAAG,CAAC,EACrBlB,GAAMC,GAAQoC,GAAGlB,GAAG,CAAC,EACfiB,GAAK7B,GAAG,CAAC,EAAG6B,GAAK,GActB,IAbKA,GAAKvF,GACT4D,GAAK2B,GACLA,GAAK,IAEL3B,GAAK5D,EACLuF,IAAMvF,GAEPS,EAAM2D,GAAG,CAAC,EAAMR,GAAGQ,GAAG,CAAC,EACvBlD,EAAMmD,GAAG,CAAC,EAAMT,GAAGS,GAAG,CAAC,EACvB1C,EAAM2C,GAAG,CAAC,EAAMV,GAAGU,GAAG,CAAC,EACvBpC,EAAMC,EAAQoD,GAAGnB,GAAG,CAAC,EACrB1B,EAAMC,EAAQ4C,GAAGlB,GAAG,CAAC,EACrBnB,EAAMC,GAAQoC,GAAGjB,GAAG,CAAC,EACfgB,GAAK5B,GAAG,CAAC,EAAG4B,GAAK,GAmBtB,IAlBKA,GAAKtF,GACT2D,GAAK2B,GACLA,GAAK,IAEL3B,GAAK3D,EACLsF,IAAMtF,GAGP0E,GAAKxC,EAAQoD,GAAGlB,GAAG,CAAC,EACpBO,GAAKjC,EAAQ4C,GAAGjB,GAAG,CAAC,EACpBO,GAAK1B,EAAQoC,GAAGhB,GAAG,CAAC,EAGpB9D,EAAM4D,GAAG,CAAC,EAAMT,GAAGS,GAAG,CAAC,EACvBnD,EAAMoD,GAAG,CAAC,EAAMV,GAAGU,GAAG,CAAC,EACvB3C,EAAM4C,GAAG,CAAC,EAAMX,GAAGW,GAAG,CAAC,EAGjBe,GAAK,EAAGA,GAAKlB,GAAIkB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKlB,GAAIkB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKlB,GAAIkB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKlB,GAAIkB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKlB,GAAIkB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKlB,GAAIkB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKlB,GAAIkB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKlB,GAAIkB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKlB,GAAIkB,KACtBvE,EAAMH,EAAMyE,GAAI7E,GAAKK,EAAMH,EAAMyE,EAAG,EAAGrE,EAAMH,EAAMyE,EAAG,CAAE,CAAE,EAC1DD,IAAMnE,EACNoE,IAAM3D,EACN4D,IAAMnD,EAEPiD,IAAMlE,EACNmE,IAAM1D,EACN2D,IAAMlD,CACP,CACAgD,IAAMjE,EACNkE,IAAMzD,EACN0D,IAAMjD,CACP,CACA+C,IAAMhE,EACNiE,IAAMxD,EACNyD,IAAMhD,CACP,CACA8C,IAAM/D,EACNgE,IAAMvD,EACNwD,IAAM/C,CACP,CACA6C,IAAM9D,EACN+D,IAAMtD,EACNuD,IAAM9C,CACP,CACA4C,IAAM7D,EACN8D,IAAMrD,EACNsD,IAAM7C,CACP,CACA2C,IAAM5D,EACN6D,IAAMpD,EACNqD,IAAM5C,CACP,CACA0C,IAAM3D,EACN4D,IAAMnD,EACNoD,IAAM3C,CACP,CAUV,CAKAzC,GAAO,QAAUG,KCzbjB,IAAAqG,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EAiGzE,SAASC,GAAkBC,EAAGC,EAAGC,EAAGC,GAAM,CACzC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAmCJ,IA9BAA,GAAI/G,GAAWG,EAAE,MAAOA,EAAE,QAASC,EAAE,QAASC,EAAE,OAAQ,EACxDkE,GAAKwC,GAAE,GACP7B,GAAK6B,GAAE,GACP5B,GAAK4B,GAAE,GACP3B,GAAK2B,GAAE,GAGPxG,EAAQN,GAAWE,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7CgF,GAAKlF,EAAE,OACPmF,GAAKlF,EAAE,OACPmF,GAAKlF,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTS,EAAMoE,GAAG,CAAC,EACV1D,EAAM2D,GAAG,CAAC,EACVjD,EAAMkD,GAAG,CAAC,EAGVzE,EAAOR,EAAE,UAAU,CAAC,EACpBS,EAAOR,EAAE,UAAU,CAAC,EACpBS,EAAOR,EAAE,UAAU,CAAC,EAGdyG,GAAKvC,GAAG,CAAC,EAAGuC,GAAK,GAWtB,IAVKA,GAAKvG,GACT0E,GAAK6B,GACLA,GAAK,IAEL7B,GAAK1E,EACLuG,IAAMvG,GAEP6C,EAAMiC,GAAOyB,GAAG5B,GAAG,CAAC,EACpBrB,GAAMyB,GAAOwB,GAAG3B,GAAG,CAAC,EACpBb,GAAMiB,GAAOuB,GAAG1B,GAAG,CAAC,EACdyB,GAAKtC,GAAG,CAAC,EAAGsC,GAAK,GActB,IAbKA,GAAKtG,GACTyE,GAAK6B,GACLA,GAAK,IAEL7B,GAAKzE,EACLsG,IAAMtG,GAEPgB,EAAM2D,GAAG,CAAC,EAAMF,GAAGE,GAAG,CAAC,EACvBjD,EAAMkD,GAAG,CAAC,EAAMH,GAAGG,GAAG,CAAC,EACvBxC,EAAMyC,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvBjC,EAAMC,EAAQyD,GAAG3B,GAAG,CAAC,EACrBtB,GAAMC,GAAQgD,GAAG1B,GAAG,CAAC,EACrBd,GAAMC,GAAQuC,GAAGzB,GAAG,CAAC,EACfwB,GAAKrC,GAAG,CAAC,EAAGqC,GAAK,GActB,IAbKA,GAAKrG,GACTwE,GAAK6B,GACLA,GAAK,IAEL7B,GAAKxE,EACLqG,IAAMrG,GAEPe,EAAM4D,GAAG,CAAC,EAAMH,GAAGG,GAAG,CAAC,EACvBlD,EAAMmD,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvBzC,EAAM0C,GAAG,CAAC,EAAML,GAAGK,GAAG,CAAC,EACvBlC,EAAMC,EAAQyD,GAAG1B,GAAG,CAAC,EACrBvB,GAAMC,GAAQgD,GAAGzB,GAAG,CAAC,EACrBf,GAAMC,GAAQuC,GAAGxB,GAAG,CAAC,EACfuB,GAAKpC,GAAG,CAAC,EAAGoC,GAAK,GActB,IAbKA,GAAKpG,GACTuE,GAAK6B,GACLA,GAAK,IAEL7B,GAAKvE,EACLoG,IAAMpG,GAEPc,EAAM6D,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvBnD,EAAMoD,GAAG,CAAC,EAAML,GAAGK,GAAG,CAAC,EACvB1C,EAAM2C,GAAG,CAAC,EAAMN,GAAGM,GAAG,CAAC,EACvBnC,EAAMC,EAAQyD,GAAGzB,GAAG,CAAC,EACrBxB,GAAMC,GAAQgD,GAAGxB,GAAG,CAAC,EACrBhB,GAAMC,GAAQuC,GAAGvB,GAAG,CAAC,EACfsB,GAAKnC,GAAG,CAAC,EAAGmC,GAAK,GActB,IAbKA,GAAKnG,GACTsE,GAAK6B,GACLA,GAAK,IAEL7B,GAAKtE,EACLmG,IAAMnG,GAEPa,EAAM8D,GAAG,CAAC,EAAML,GAAGK,GAAG,CAAC,EACvBpD,EAAMqD,GAAG,CAAC,EAAMN,GAAGM,GAAG,CAAC,EACvB3C,EAAM4C,GAAG,CAAC,EAAMP,GAAGO,GAAG,CAAC,EACvBpC,EAAMC,EAAQyD,GAAGxB,GAAG,CAAC,EACrBzB,EAAMC,GAAQgD,GAAGvB,GAAG,CAAC,EACrBjB,GAAMC,GAAQuC,GAAGtB,GAAG,CAAC,EACfqB,GAAKlC,GAAG,CAAC,EAAGkC,GAAK,GActB,IAbKA,GAAKlG,GACTqE,GAAK6B,GACLA,GAAK,IAEL7B,GAAKrE,EACLkG,IAAMlG,GAEPY,EAAM+D,GAAG,CAAC,EAAMN,GAAGM,GAAG,CAAC,EACvBrD,EAAMsD,GAAG,CAAC,EAAMP,GAAGO,GAAG,CAAC,EACvB5C,EAAM6C,GAAG,CAAC,EAAMR,GAAGQ,GAAG,CAAC,EACvBrC,EAAMC,EAAQyD,GAAGvB,GAAG,CAAC,EACrB1B,EAAMC,EAAQgD,GAAGtB,GAAG,CAAC,EACrBlB,GAAMC,GAAQuC,GAAGrB,GAAG,CAAC,EACfoB,GAAKjC,GAAG,CAAC,EAAGiC,GAAK,GActB,IAbKA,GAAKjG,GACToE,GAAK6B,GACLA,GAAK,IAEL7B,GAAKpE,EACLiG,IAAMjG,GAEPW,EAAMgE,GAAG,CAAC,EAAMP,GAAGO,GAAG,CAAC,EACvBtD,EAAMuD,GAAG,CAAC,EAAMR,GAAGQ,GAAG,CAAC,EACvB7C,EAAM8C,GAAG,CAAC,EAAMT,GAAGS,GAAG,CAAC,EACvBtC,EAAMC,EAAQyD,GAAGtB,GAAG,CAAC,EACrB3B,EAAMC,EAAQgD,GAAGrB,GAAG,CAAC,EACrBnB,GAAMC,GAAQuC,GAAGpB,GAAG,CAAC,EACfmB,GAAKhC,GAAG,CAAC,EAAGgC,GAAK,GActB,IAbKA,GAAKhG,GACTmE,GAAK6B,GACLA,GAAK,IAEL7B,GAAKnE,EACLgG,IAAMhG,GAEPU,EAAMiE,GAAG,CAAC,EAAMR,GAAGQ,GAAG,CAAC,EACvBvD,EAAMwD,GAAG,CAAC,EAAMT,GAAGS,GAAG,CAAC,EACvB9C,EAAM+C,GAAG,CAAC,EAAMV,GAAGU,GAAG,CAAC,EACvBvC,EAAMC,EAAQyD,GAAGrB,GAAG,CAAC,EACrB5B,EAAMC,EAAQgD,GAAGpB,GAAG,CAAC,EACrBpB,GAAMC,GAAQuC,GAAGnB,GAAG,CAAC,EACfkB,GAAK/B,GAAG,CAAC,EAAG+B,GAAK,GActB,IAbKA,GAAK/F,GACTkE,GAAK6B,GACLA,GAAK,IAEL7B,GAAKlE,EACL+F,IAAM/F,GAEPS,EAAMkE,GAAG,CAAC,EAAMT,GAAGS,GAAG,CAAC,EACvBxD,EAAMyD,GAAG,CAAC,EAAMV,GAAGU,GAAG,CAAC,EACvB/C,EAAMgD,GAAG,CAAC,EAAMX,GAAGW,GAAG,CAAC,EACvBxC,EAAMC,EAAQyD,GAAGpB,GAAG,CAAC,EACrB7B,EAAMC,EAAQgD,GAAGnB,GAAG,CAAC,EACrBrB,GAAMC,GAAQuC,GAAGlB,GAAG,CAAC,EACfiB,GAAK9B,GAAG,CAAC,EAAG8B,GAAK,GAmBtB,IAlBKA,GAAK9F,GACTiE,GAAK6B,GACLA,GAAK,IAEL7B,GAAKjE,EACL8F,IAAM9F,GAGPiF,GAAK5C,EAAQyD,GAAGnB,GAAG,CAAC,EACpBO,GAAKpC,EAAQgD,GAAGlB,GAAG,CAAC,EACpBO,GAAK5B,GAAQuC,GAAGjB,GAAG,CAAC,EAGpBrE,EAAMmE,GAAG,CAAC,EAAMV,GAAGU,GAAG,CAAC,EACvBzD,EAAM0D,GAAG,CAAC,EAAMX,GAAGW,GAAG,CAAC,EACvBhD,EAAMiD,GAAG,CAAC,EAAMZ,GAAGY,GAAG,CAAC,EAGjBgB,GAAK,EAAGA,GAAKnB,GAAImB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKnB,GAAImB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKnB,GAAImB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKnB,GAAImB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKnB,GAAImB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKnB,GAAImB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKnB,GAAImB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKnB,GAAImB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKnB,GAAImB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKnB,GAAImB,KACtB9E,EAAMH,EAAMgF,GAAIpF,GAAKK,EAAMH,EAAMgF,EAAG,EAAG5E,EAAMH,EAAMgF,EAAG,CAAE,CAAE,EAC1DD,IAAM1E,EACN2E,IAAMjE,EACNkE,IAAMxD,EAEPsD,IAAMzE,EACN0E,IAAMhE,EACNiE,IAAMvD,CACP,CACAqD,IAAMxE,EACNyE,IAAM/D,EACNgE,IAAMtD,CACP,CACAoD,IAAMvE,EACNwE,IAAM9D,EACN+D,IAAMrD,CACP,CACAmD,IAAMtE,EACNuE,IAAM7D,EACN8D,IAAMpD,CACP,CACAkD,IAAMrE,EACNsE,IAAM5D,EACN6D,IAAMnD,CACP,CACAiD,IAAMpE,EACNqE,IAAM3D,EACN4D,IAAMlD,CACP,CACAgD,IAAMnE,EACNoE,IAAM1D,EACN2D,IAAMjD,CACP,CACA+C,IAAMlE,EACNmE,IAAMzD,EACN0D,IAAMhD,CACP,CACA8C,IAAMjE,EACNkE,IAAMxD,EACNyD,IAAM/C,CACP,CAWX,CAKA5C,GAAO,QAAUG,KCtdjB,IAAA8G,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EAyFzE,SAASC,GAAiBC,EAAGC,EAAGC,EAAGC,GAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA8BJ,IAzBAA,EAAIpC,GAAWG,EAAE,MAAOA,EAAE,QAASC,EAAE,QAASC,EAAE,OAAQ,EACxDe,EAAKgB,EAAE,GACPb,EAAKa,EAAE,GACPZ,EAAKY,EAAE,GACPX,EAAKW,EAAE,GAGP7B,EAAQN,GAAWE,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7CqB,EAAKvB,EAAE,OACPwB,EAAKvB,EAAE,OACPwB,EAAKvB,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTM,EAAMY,EAAG,CAAC,EACVV,EAAMW,EAAG,CAAC,EACVT,EAAMU,EAAG,CAAC,EAGJU,EAAKf,EAAG,CAAC,EAAGe,EAAK,GAWtB,IAVKA,EAAK5B,GACTe,EAAKa,EACLA,EAAK,IAELb,EAAKf,EACL4B,GAAM5B,GAEPU,EAAMS,EAAOS,EAAGZ,EAAG,CAAC,EACpBL,EAAMS,EAAOQ,EAAGX,EAAG,CAAC,EACpBL,EAAMS,EAAOO,EAAGV,EAAG,CAAC,EACdS,EAAKd,EAAG,CAAC,EAAGc,EAAK,GAmBtB,IAlBKA,EAAK3B,GACTc,EAAKa,EACLA,EAAK,IAELb,EAAKd,EACL2B,GAAM3B,GAGPsB,EAAKZ,EAAQiB,EAAGX,EAAG,CAAC,EACpBO,EAAKZ,EAAQgB,EAAGV,EAAG,CAAC,EACpBO,EAAKZ,EAAQe,EAAGT,EAAG,CAAC,EAGpBb,EAAMW,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBT,EAAMU,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBR,EAAMS,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EAGjBQ,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IACtBtB,EAAMqB,CAAG,EAAIzB,GAAKE,EAAMqB,CAAG,EAAGpB,EAAMqB,CAAG,CAAE,EACzCD,GAAMlB,EACNmB,GAAMjB,EACNkB,GAAMhB,EAEPc,GAAMjB,EACNkB,GAAMhB,EACNiB,GAAMf,CACP,CAGH,CAKAjB,GAAO,QAAUG,KC5NjB,IAAAmC,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EAyFzE,SAASC,GAAiBC,EAAGC,EAAGC,EAAGC,GAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACA,EA8BJ,IAzBA,EAAI5C,GAAWG,EAAE,MAAOA,EAAE,QAASC,EAAE,QAASC,EAAE,OAAQ,EACxDqB,EAAK,EAAE,GACPI,EAAK,EAAE,GACPC,EAAK,EAAE,GACPC,EAAK,EAAE,GAGPzB,EAAQN,GAAWE,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7C4B,EAAK9B,EAAE,OACP+B,EAAK9B,EAAE,OACP+B,EAAK9B,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTM,EAAMmB,EAAG,CAAC,EACVhB,EAAMiB,EAAG,CAAC,EACVd,EAAMe,EAAG,CAAC,EAGJY,EAAKlB,EAAG,CAAC,EAAGkB,EAAK,GAWtB,IAVKA,EAAKrC,GACTsB,EAAKe,EACLA,EAAK,IAELf,EAAKtB,EACLqC,GAAMrC,GAEPc,EAAMY,EAAOW,EAAGd,EAAG,CAAC,EACpBP,EAAMW,EAAOU,EAAGb,EAAG,CAAC,EACpBN,EAAMU,EAAOS,EAAGZ,EAAG,CAAC,EACdW,EAAKjB,EAAG,CAAC,EAAGiB,EAAK,GActB,IAbKA,EAAKpC,GACTqB,EAAKe,EACLA,EAAK,IAELf,EAAKrB,EACLoC,GAAMpC,GAEPM,EAAMiB,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBd,EAAMe,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBZ,EAAMa,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBZ,EAAMC,EAAQsB,EAAGb,EAAG,CAAC,EACrBR,EAAMC,EAAQoB,EAAGZ,EAAG,CAAC,EACrBP,EAAMC,EAAQkB,EAAGX,EAAG,CAAC,EACfU,EAAKhB,EAAG,CAAC,EAAGgB,EAAK,GAmBtB,IAlBKA,EAAKnC,GACToB,EAAKe,EACLA,EAAK,IAELf,EAAKpB,EACLmC,GAAMnC,GAGP6B,EAAKhB,EAAQsB,EAAGZ,EAAG,CAAC,EACpBO,EAAKf,EAAQoB,EAAGX,EAAG,CAAC,EACpBO,EAAKd,EAAQkB,EAAGV,EAAG,CAAC,EAGpBpB,EAAMkB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBf,EAAMgB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBb,EAAMc,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EAGjBS,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IACtB7B,EAAM4B,CAAG,EAAIhC,GAAKE,EAAM4B,CAAG,EAAG3B,EAAM4B,CAAG,CAAE,EACzCD,GAAMzB,EACN0B,GAAMvB,EACNwB,GAAMrB,EAEPmB,GAAMxB,EACNyB,GAAMtB,EACNuB,GAAMpB,CACP,CACAkB,GAAMvB,EACNwB,GAAMrB,EACNsB,GAAMnB,CACP,CAIJ,CAKApB,GAAO,QAAUG,KC3PjB,IAAA2C,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EAyFzE,SAASC,GAAiBC,EAAGC,EAAGC,EAAGC,GAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA8BJ,IAzBAA,EAAItD,GAAWG,EAAE,MAAOA,EAAE,QAASC,EAAE,QAASC,EAAE,OAAQ,EACxD2B,EAAKsB,EAAE,GACPjB,EAAKiB,EAAE,GACPhB,EAAKgB,EAAE,GACPf,EAAKe,EAAE,GAGP/C,EAAQN,GAAWE,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7CmC,EAAKrC,EAAE,OACPsC,EAAKrC,EAAE,OACPsC,EAAKrC,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTM,EAAM0B,EAAG,CAAC,EACVtB,EAAMuB,EAAG,CAAC,EACVnB,EAAMoB,EAAG,CAAC,EAGJc,EAAKrB,EAAG,CAAC,EAAGqB,EAAK,GAWtB,IAVKA,EAAK9C,GACT6B,EAAKiB,EACLA,EAAK,IAELjB,EAAK7B,EACL8C,GAAM9C,GAEPkB,EAAMe,EAAOa,EAAGhB,EAAG,CAAC,EACpBT,EAAMa,EAAOY,EAAGf,EAAG,CAAC,EACpBP,EAAMW,EAAOW,EAAGd,EAAG,CAAC,EACda,EAAKpB,EAAG,CAAC,EAAGoB,EAAK,GActB,IAbKA,EAAK7C,GACT4B,EAAKiB,EACLA,EAAK,IAELjB,EAAK5B,EACL6C,GAAM7C,GAEPO,EAAMuB,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBnB,EAAMoB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBhB,EAAMiB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBf,EAAMC,EAAQ2B,EAAGf,EAAG,CAAC,EACrBV,EAAMC,EAAQwB,EAAGd,EAAG,CAAC,EACrBR,EAAMC,EAAQqB,EAAGb,EAAG,CAAC,EACfY,EAAKnB,EAAG,CAAC,EAAGmB,EAAK,GActB,IAbKA,EAAK5C,GACT2B,EAAKiB,EACLA,EAAK,IAELjB,EAAK3B,EACL4C,GAAM5C,GAEPM,EAAMwB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBpB,EAAMqB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBjB,EAAMkB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBhB,EAAMC,EAAQ2B,EAAGd,EAAG,CAAC,EACrBX,EAAMC,EAAQwB,EAAGb,EAAG,CAAC,EACrBT,EAAMC,EAAQqB,EAAGZ,EAAG,CAAC,EACfW,EAAKlB,EAAG,CAAC,EAAGkB,EAAK,GAmBtB,IAlBKA,EAAK3C,GACT0B,EAAKiB,EACLA,EAAK,IAELjB,EAAK1B,EACL2C,GAAM3C,GAGPoC,EAAKpB,EAAQ2B,EAAGb,EAAG,CAAC,EACpBO,EAAKlB,EAAQwB,EAAGZ,EAAG,CAAC,EACpBO,EAAKhB,EAAQqB,EAAGX,EAAG,CAAC,EAGpB3B,EAAMyB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBrB,EAAMsB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBlB,EAAMmB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EAGjBU,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IACtBpC,EAAMmC,CAAG,EAAIvC,GAAKE,EAAMmC,CAAG,EAAGlC,EAAMmC,CAAG,CAAE,EACzCD,GAAMhC,EACNiC,GAAM7B,EACN8B,GAAM1B,EAEPwB,GAAM/B,EACNgC,GAAM5B,EACN6B,GAAMzB,CACP,CACAuB,GAAM9B,EACN+B,GAAM3B,EACN4B,GAAMxB,CACP,CACAsB,GAAM7B,EACN8B,GAAM1B,EACN2B,GAAMvB,CACP,CAKL,CAKAvB,GAAO,QAAUG,KCxRjB,IAAAqD,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EAyFzE,SAASC,GAAiBC,EAAGC,EAAGC,EAAGC,GAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GA8BJ,IAzBAA,GAAI/D,GAAWG,EAAE,MAAOA,EAAE,QAASC,EAAE,QAASC,EAAE,OAAQ,EACxDiC,EAAKyB,GAAE,GACPnB,EAAKmB,GAAE,GACPlB,EAAKkB,GAAE,GACPjB,EAAKiB,GAAE,GAGPxD,EAAQN,GAAWE,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7C0C,EAAK5C,EAAE,OACP6C,EAAK5C,EAAE,OACP6C,EAAK5C,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTM,EAAMiC,EAAG,CAAC,EACV5B,EAAM6B,EAAG,CAAC,EACVxB,EAAMyB,EAAG,CAAC,EAGJgB,GAAKxB,EAAG,CAAC,EAAGwB,GAAK,GAWtB,IAVKA,GAAKvD,GACToC,EAAKmB,GACLA,GAAK,IAELnB,EAAKpC,EACLuD,IAAMvD,GAEPsB,EAAMkB,EAAOe,GAAGlB,EAAG,CAAC,EACpBX,EAAMe,EAAOc,GAAGjB,EAAG,CAAC,EACpBR,EAAMY,EAAOa,GAAGhB,EAAG,CAAC,EACde,GAAKvB,EAAG,CAAC,EAAGuB,GAAK,GActB,IAbKA,GAAKtD,GACTmC,EAAKmB,GACLA,GAAK,IAELnB,EAAKnC,EACLsD,IAAMtD,GAEPQ,EAAM6B,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBxB,EAAMyB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBpB,EAAMqB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBlB,EAAMC,EAAQgC,GAAGjB,EAAG,CAAC,EACrBZ,EAAMC,EAAQ4B,GAAGhB,EAAG,CAAC,EACrBT,EAAMC,EAAQwB,GAAGf,EAAG,CAAC,EACfc,GAAKtB,EAAG,CAAC,EAAGsB,GAAK,GActB,IAbKA,GAAKrD,GACTkC,EAAKmB,GACLA,GAAK,IAELnB,EAAKlC,EACLqD,IAAMrD,GAEPO,EAAM8B,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBzB,EAAM0B,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBrB,EAAMsB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBnB,EAAMC,EAAQgC,GAAGhB,EAAG,CAAC,EACrBb,EAAMC,EAAQ4B,GAAGf,EAAG,CAAC,EACrBV,EAAMC,EAAQwB,GAAGd,EAAG,CAAC,EACfa,GAAKrB,EAAG,CAAC,EAAGqB,GAAK,GActB,IAbKA,GAAKpD,GACTiC,EAAKmB,GACLA,GAAK,IAELnB,EAAKjC,EACLoD,IAAMpD,GAEPM,EAAM+B,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvB1B,EAAM2B,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBtB,EAAMuB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBpB,EAAMC,EAAQgC,GAAGf,EAAG,CAAC,EACrBd,EAAMC,EAAQ4B,GAAGd,EAAG,CAAC,EACrBX,EAAMC,EAAQwB,GAAGb,EAAG,CAAC,EACfY,GAAKpB,EAAG,CAAC,EAAGoB,GAAK,GAmBtB,IAlBKA,GAAKnD,GACTgC,EAAKmB,GACLA,GAAK,IAELnB,EAAKhC,EACLmD,IAAMnD,GAGP2C,EAAKxB,EAAQgC,GAAGd,EAAG,CAAC,EACpBO,EAAKrB,EAAQ4B,GAAGb,EAAG,CAAC,EACpBO,EAAKlB,EAAQwB,GAAGZ,EAAG,CAAC,EAGpBlC,EAAMgC,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvB3B,EAAM4B,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBvB,EAAMwB,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,EAGjBW,EAAK,EAAGA,EAAKd,EAAIc,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKd,EAAIc,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKd,EAAIc,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKd,EAAIc,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKd,EAAIc,IACtB3C,EAAM0C,CAAG,EAAI9C,GAAKE,EAAM0C,CAAG,EAAGzC,EAAM0C,CAAG,CAAE,EACzCD,GAAMvC,EACNwC,GAAMnC,EACNoC,GAAM/B,EAEP6B,GAAMtC,EACNuC,GAAMlC,EACNmC,GAAM9B,CACP,CACA4B,GAAMrC,EACNsC,GAAMjC,EACNkC,GAAM7B,CACP,CACA2B,GAAMpC,EACNqC,GAAMhC,EACNiC,GAAM5B,CACP,CACA0B,GAAMnC,EACNoC,GAAM/B,EACNgC,GAAM3B,CACP,CAMN,CAKA1B,GAAO,QAAUG,KCrTjB,IAAA8D,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EAyFzE,SAASC,GAAiBC,EAAGC,EAAGC,EAAGC,GAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GA8BJ,IAzBAA,GAAIxE,GAAWG,EAAE,MAAOA,EAAE,QAASC,EAAE,QAASC,EAAE,OAAQ,EACxDuC,EAAK4B,GAAE,GACPrB,EAAKqB,GAAE,GACPpB,EAAKoB,GAAE,GACPnB,EAAKmB,GAAE,GAGPjE,EAAQN,GAAWE,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7CiD,EAAKnD,EAAE,OACPoD,EAAKnD,EAAE,OACPoD,EAAKnD,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTM,EAAMwC,EAAG,CAAC,EACVlC,EAAMmC,EAAG,CAAC,EACV7B,EAAM8B,EAAG,CAAC,EAGJkB,GAAK3B,EAAG,CAAC,EAAG2B,GAAK,GAWtB,IAVKA,GAAKhE,GACT2C,EAAKqB,GACLA,GAAK,IAELrB,EAAK3C,EACLgE,IAAMhE,GAEP0B,EAAMqB,EAAOiB,GAAGpB,EAAG,CAAC,EACpBb,EAAMiB,EAAOgB,GAAGnB,EAAG,CAAC,EACpBT,EAAMa,EAAOe,GAAGlB,EAAG,CAAC,EACdiB,GAAK1B,EAAG,CAAC,EAAG0B,GAAK,GActB,IAbKA,GAAK/D,GACT0C,EAAKqB,GACLA,GAAK,IAELrB,EAAK1C,EACL+D,IAAM/D,GAEPS,EAAMmC,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvB7B,EAAM8B,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBxB,EAAMyB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBrB,EAAMC,EAAQqC,GAAGnB,EAAG,CAAC,EACrBd,EAAMC,EAAQgC,GAAGlB,EAAG,CAAC,EACrBV,EAAMC,EAAQ2B,GAAGjB,EAAG,CAAC,EACfgB,GAAKzB,EAAG,CAAC,EAAGyB,GAAK,GActB,IAbKA,GAAK9D,GACTyC,EAAKqB,GACLA,GAAK,IAELrB,EAAKzC,EACL8D,IAAM9D,GAEPQ,EAAMoC,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvB9B,EAAM+B,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBzB,EAAM0B,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBtB,EAAMC,EAAQqC,GAAGlB,EAAG,CAAC,EACrBf,EAAMC,EAAQgC,GAAGjB,EAAG,CAAC,EACrBX,EAAMC,EAAQ2B,GAAGhB,EAAG,CAAC,EACfe,GAAKxB,EAAG,CAAC,EAAGwB,GAAK,GActB,IAbKA,GAAK7D,GACTwC,EAAKqB,GACLA,GAAK,IAELrB,EAAKxC,EACL6D,IAAM7D,GAEPO,EAAMqC,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvB/B,EAAMgC,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvB1B,EAAM2B,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBvB,EAAMC,EAAQqC,GAAGjB,EAAG,CAAC,EACrBhB,EAAMC,EAAQgC,GAAGhB,EAAG,CAAC,EACrBZ,EAAMC,EAAQ2B,GAAGf,EAAG,CAAC,EACfc,GAAKvB,EAAG,CAAC,EAAGuB,GAAK,GActB,IAbKA,GAAK5D,GACTuC,EAAKqB,GACLA,GAAK,IAELrB,EAAKvC,EACL4D,IAAM5D,GAEPM,EAAMsC,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBhC,EAAMiC,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvB3B,EAAM4B,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,EACvBxB,EAAMC,EAAQqC,GAAGhB,EAAG,CAAC,EACrBjB,EAAMC,EAAQgC,GAAGf,EAAG,CAAC,EACrBb,EAAMC,EAAQ2B,GAAGd,EAAG,CAAC,EACfa,GAAKtB,EAAG,CAAC,EAAGsB,GAAK,GAmBtB,IAlBKA,GAAK3D,GACTsC,EAAKqB,GACLA,GAAK,IAELrB,EAAKtC,EACL2D,IAAM3D,GAGPkD,EAAK5B,EAAQqC,GAAGf,EAAG,CAAC,EACpBO,GAAKxB,EAAQgC,GAAGd,EAAG,CAAC,EACpBO,GAAKpB,EAAQ2B,GAAGb,EAAG,CAAC,EAGpBzC,EAAMuC,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBjC,EAAMkC,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,EACvB5B,EAAM6B,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,EAGjBY,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KACtBlD,EAAMiD,EAAG,EAAIrD,GAAKE,EAAMiD,CAAG,EAAGhD,EAAMiD,EAAG,CAAE,EACzCD,GAAM9C,EACN+C,IAAMzC,EACN0C,IAAMpC,EAEPkC,GAAM7C,EACN8C,IAAMxC,EACNyC,IAAMnC,CACP,CACAiC,GAAM5C,EACN6C,IAAMvC,EACNwC,IAAMlC,CACP,CACAgC,GAAM3C,EACN4C,IAAMtC,EACNuC,IAAMjC,CACP,CACA+B,GAAM1C,EACN2C,IAAMrC,EACNsC,IAAMhC,CACP,CACA8B,GAAMzC,EACN0C,IAAMpC,EACNqC,IAAM/B,CACP,CAOP,CAKA7B,GAAO,QAAUG,KClVjB,IAAAuE,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EAyFzE,SAASC,GAAiBC,EAAGC,EAAGC,EAAGC,GAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GA8BJ,IAzBAA,GAAIjF,GAAWG,EAAE,MAAOA,EAAE,QAASC,EAAE,QAASC,EAAE,OAAQ,EACxD6C,EAAK+B,GAAE,GACPvB,GAAKuB,GAAE,GACPtB,GAAKsB,GAAE,GACPrB,GAAKqB,GAAE,GAGP1E,EAAQN,GAAWE,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7CwD,GAAK1D,EAAE,OACP2D,GAAK1D,EAAE,OACP2D,GAAK1D,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTM,EAAM+C,GAAG,CAAC,EACVxC,EAAMyC,GAAG,CAAC,EACVlC,EAAMmC,GAAG,CAAC,EAGJoB,GAAK9B,EAAG,CAAC,EAAG8B,GAAK,GAWtB,IAVKA,GAAKzE,GACTkD,EAAKuB,GACLA,GAAK,IAELvB,EAAKlD,EACLyE,IAAMzE,GAEP8B,EAAMwB,GAAOmB,GAAGtB,GAAG,CAAC,EACpBf,EAAMmB,GAAOkB,GAAGrB,GAAG,CAAC,EACpBV,EAAMc,GAAOiB,GAAGpB,GAAG,CAAC,EACdmB,GAAK7B,EAAG,CAAC,EAAG6B,GAAK,GActB,IAbKA,GAAKxE,GACTiD,EAAKuB,GACLA,GAAK,IAELvB,EAAKjD,EACLwE,IAAMxE,GAEPU,EAAMyC,GAAG,CAAC,EAAMF,EAAGE,GAAG,CAAC,EACvBlC,EAAMmC,GAAG,CAAC,EAAMH,EAAGG,GAAG,CAAC,EACvB5B,EAAM6B,GAAG,CAAC,EAAMJ,EAAGI,GAAG,CAAC,EACvBxB,EAAMC,EAAQ0C,GAAGrB,GAAG,CAAC,EACrBhB,EAAMC,EAAQoC,GAAGpB,GAAG,CAAC,EACrBX,EAAMC,EAAQ8B,GAAGnB,GAAG,CAAC,EACfkB,GAAK5B,EAAG,CAAC,EAAG4B,GAAK,GActB,IAbKA,GAAKvE,GACTgD,EAAKuB,GACLA,GAAK,IAELvB,EAAKhD,EACLuE,IAAMvE,GAEPS,EAAM0C,GAAG,CAAC,EAAMH,EAAGG,GAAG,CAAC,EACvBnC,EAAMoC,GAAG,CAAC,EAAMJ,EAAGI,GAAG,CAAC,EACvB7B,EAAM8B,GAAG,CAAC,EAAML,EAAGK,GAAG,CAAC,EACvBzB,EAAMC,EAAQ0C,GAAGpB,GAAG,CAAC,EACrBjB,EAAMC,EAAQoC,GAAGnB,GAAG,CAAC,EACrBZ,EAAMC,EAAQ8B,GAAGlB,GAAG,CAAC,EACfiB,GAAK3B,EAAG,CAAC,EAAG2B,GAAK,GActB,IAbKA,GAAKtE,GACT+C,EAAKuB,GACLA,GAAK,IAELvB,EAAK/C,EACLsE,IAAMtE,GAEPQ,EAAM2C,GAAG,CAAC,EAAMJ,EAAGI,GAAG,CAAC,EACvBpC,EAAMqC,GAAG,CAAC,EAAML,EAAGK,GAAG,CAAC,EACvB9B,EAAM+B,GAAG,CAAC,EAAMN,EAAGM,GAAG,CAAC,EACvB1B,EAAMC,EAAQ0C,GAAGnB,GAAG,CAAC,EACrBlB,EAAMC,EAAQoC,GAAGlB,GAAG,CAAC,EACrBb,EAAMC,EAAQ8B,GAAGjB,GAAG,CAAC,EACfgB,GAAK1B,EAAG,CAAC,EAAG0B,GAAK,GActB,IAbKA,GAAKrE,GACT8C,EAAKuB,GACLA,GAAK,IAELvB,EAAK9C,EACLqE,IAAMrE,GAEPO,EAAM4C,GAAG,CAAC,EAAML,EAAGK,GAAG,CAAC,EACvBrC,EAAMsC,GAAG,CAAC,EAAMN,EAAGM,GAAG,CAAC,EACvB/B,EAAMgC,GAAG,CAAC,EAAMP,EAAGO,GAAG,CAAC,EACvB3B,EAAMC,EAAQ0C,GAAGlB,GAAG,CAAC,EACrBnB,EAAMC,EAAQoC,GAAGjB,GAAG,CAAC,EACrBd,EAAMC,EAAQ8B,GAAGhB,GAAG,CAAC,EACfe,GAAKzB,EAAG,CAAC,EAAGyB,GAAK,GActB,IAbKA,GAAKpE,GACT6C,EAAKuB,GACLA,GAAK,IAELvB,EAAK7C,EACLoE,IAAMpE,GAEPM,EAAM6C,GAAG,CAAC,EAAMN,EAAGM,GAAG,CAAC,EACvBtC,EAAMuC,GAAG,CAAC,EAAMP,EAAGO,GAAG,CAAC,EACvBhC,EAAMiC,GAAG,CAAC,EAAMR,EAAGQ,GAAG,CAAC,EACvB5B,EAAMC,EAAQ0C,GAAGjB,GAAG,CAAC,EACrBpB,EAAMC,EAAQoC,GAAGhB,GAAG,CAAC,EACrBf,EAAMC,EAAQ8B,GAAGf,GAAG,CAAC,EACfc,GAAKxB,EAAG,CAAC,EAAGwB,GAAK,GAmBtB,IAlBKA,GAAKnE,GACT4C,EAAKuB,GACLA,GAAK,IAELvB,EAAK5C,EACLmE,IAAMnE,GAGPyD,GAAKhC,EAAQ0C,GAAGhB,GAAG,CAAC,EACpBO,GAAK3B,EAAQoC,GAAGf,GAAG,CAAC,EACpBO,GAAKtB,EAAQ8B,GAAGd,GAAG,CAAC,EAGpBhD,EAAM8C,GAAG,CAAC,EAAMP,EAAGO,GAAG,CAAC,EACvBvC,EAAMwC,GAAG,CAAC,EAAMR,EAAGQ,GAAG,CAAC,EACvBjC,EAAMkC,GAAG,CAAC,EAAMT,EAAGS,GAAG,CAAC,EAGjBa,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KACtBzD,EAAMwD,EAAG,EAAI5D,GAAKE,EAAMwD,EAAG,EAAGvD,EAAMwD,EAAG,CAAE,EACzCD,IAAMrD,EACNsD,IAAM/C,EACNgD,IAAMzC,EAEPuC,IAAMpD,EACNqD,IAAM9C,EACN+C,IAAMxC,CACP,CACAsC,IAAMnD,EACNoD,IAAM7C,EACN8C,IAAMvC,CACP,CACAqC,IAAMlD,EACNmD,IAAM5C,EACN6C,IAAMtC,CACP,CACAoC,IAAMjD,EACNkD,IAAM3C,EACN4C,IAAMrC,CACP,CACAmC,IAAMhD,EACNiD,IAAM1C,EACN2C,IAAMpC,CACP,CACAkC,IAAM/C,EACNgD,IAAMzC,EACN0C,IAAMnC,CACP,CAQR,CAKAhC,GAAO,QAAUG,KC/WjB,IAAAgF,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EAyFzE,SAASC,GAAiBC,EAAGC,EAAGC,EAAGC,GAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GA8BJ,IAzBAA,GAAI1F,GAAWG,EAAE,MAAOA,EAAE,QAASC,EAAE,QAASC,EAAE,OAAQ,EACxDmD,EAAKkC,GAAE,GACPzB,GAAKyB,GAAE,GACPxB,GAAKwB,GAAE,GACPvB,GAAKuB,GAAE,GAGPnF,EAAQN,GAAWE,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7C+D,GAAKjE,EAAE,OACPkE,GAAKjE,EAAE,OACPkE,GAAKjE,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTM,EAAMsD,GAAG,CAAC,EACV9C,EAAM+C,GAAG,CAAC,EACVvC,EAAMwC,GAAG,CAAC,EAGJsB,GAAKjC,EAAG,CAAC,EAAGiC,GAAK,GAWtB,IAVKA,GAAKlF,GACTyD,GAAKyB,GACLA,GAAK,IAELzB,GAAKzD,EACLkF,IAAMlF,GAEPkC,EAAM2B,GAAOqB,GAAGxB,GAAG,CAAC,EACpBjB,EAAMqB,GAAOoB,GAAGvB,GAAG,CAAC,EACpBX,EAAMe,GAAOmB,GAAGtB,GAAG,CAAC,EACdqB,GAAKhC,EAAG,CAAC,EAAGgC,GAAK,GActB,IAbKA,GAAKjF,GACTwD,GAAKyB,GACLA,GAAK,IAELzB,GAAKxD,EACLiF,IAAMjF,GAEPW,EAAM+C,GAAG,CAAC,EAAMF,GAAGE,GAAG,CAAC,EACvBvC,EAAMwC,GAAG,CAAC,EAAMH,GAAGG,GAAG,CAAC,EACvBhC,EAAMiC,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvB3B,EAAMC,EAAQ+C,GAAGvB,GAAG,CAAC,EACrBlB,EAAMC,EAAQwC,GAAGtB,GAAG,CAAC,EACrBZ,EAAMC,EAAQiC,GAAGrB,GAAG,CAAC,EACfoB,GAAK/B,EAAG,CAAC,EAAG+B,GAAK,GActB,IAbKA,GAAKhF,GACTuD,GAAKyB,GACLA,GAAK,IAELzB,GAAKvD,EACLgF,IAAMhF,GAEPU,EAAMgD,GAAG,CAAC,EAAMH,GAAGG,GAAG,CAAC,EACvBxC,EAAMyC,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvBjC,EAAMkC,GAAG,CAAC,EAAML,GAAGK,GAAG,CAAC,EACvB5B,EAAMC,EAAQ+C,GAAGtB,GAAG,CAAC,EACrBnB,EAAMC,EAAQwC,GAAGrB,GAAG,CAAC,EACrBb,EAAMC,EAAQiC,GAAGpB,GAAG,CAAC,EACfmB,GAAK9B,EAAG,CAAC,EAAG8B,GAAK,GActB,IAbKA,GAAK/E,GACTsD,GAAKyB,GACLA,GAAK,IAELzB,GAAKtD,EACL+E,IAAM/E,GAEPS,EAAMiD,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvBzC,EAAM0C,GAAG,CAAC,EAAML,GAAGK,GAAG,CAAC,EACvBlC,EAAMmC,GAAG,CAAC,EAAMN,GAAGM,GAAG,CAAC,EACvB7B,EAAMC,EAAQ+C,GAAGrB,GAAG,CAAC,EACrBpB,EAAMC,EAAQwC,GAAGpB,GAAG,CAAC,EACrBd,EAAMC,EAAQiC,GAAGnB,GAAG,CAAC,EACfkB,GAAK7B,EAAG,CAAC,EAAG6B,GAAK,GActB,IAbKA,GAAK9E,GACTqD,GAAKyB,GACLA,GAAK,IAELzB,GAAKrD,EACL8E,IAAM9E,GAEPQ,EAAMkD,GAAG,CAAC,EAAML,GAAGK,GAAG,CAAC,EACvB1C,EAAM2C,GAAG,CAAC,EAAMN,GAAGM,GAAG,CAAC,EACvBnC,EAAMoC,GAAG,CAAC,EAAMP,GAAGO,GAAG,CAAC,EACvB9B,EAAMC,EAAQ+C,GAAGpB,GAAG,CAAC,EACrBrB,EAAMC,EAAQwC,GAAGnB,GAAG,CAAC,EACrBf,EAAMC,EAAQiC,GAAGlB,GAAG,CAAC,EACfiB,GAAK5B,EAAG,CAAC,EAAG4B,GAAK,GActB,IAbKA,GAAK7E,GACToD,GAAKyB,GACLA,GAAK,IAELzB,GAAKpD,EACL6E,IAAM7E,GAEPO,EAAMmD,GAAG,CAAC,EAAMN,GAAGM,GAAG,CAAC,EACvB3C,EAAM4C,GAAG,CAAC,EAAMP,GAAGO,GAAG,CAAC,EACvBpC,EAAMqC,GAAG,CAAC,EAAMR,GAAGQ,GAAG,CAAC,EACvB/B,EAAMC,EAAQ+C,GAAGnB,GAAG,CAAC,EACrBtB,EAAMC,EAAQwC,GAAGlB,GAAG,CAAC,EACrBhB,EAAMC,EAAQiC,GAAGjB,GAAG,CAAC,EACfgB,GAAK3B,EAAG,CAAC,EAAG2B,GAAK,GActB,IAbKA,GAAK5E,GACTmD,GAAKyB,GACLA,GAAK,IAELzB,GAAKnD,EACL4E,IAAM5E,GAEPM,EAAMoD,GAAG,CAAC,EAAMP,GAAGO,GAAG,CAAC,EACvB5C,EAAM6C,GAAG,CAAC,EAAMR,GAAGQ,GAAG,CAAC,EACvBrC,EAAMsC,GAAG,CAAC,EAAMT,GAAGS,GAAG,CAAC,EACvBhC,EAAMC,EAAQ+C,GAAGlB,GAAG,CAAC,EACrBvB,EAAMC,EAAQwC,GAAGjB,GAAG,CAAC,EACrBjB,EAAMC,EAAQiC,GAAGhB,GAAG,CAAC,EACfe,GAAK1B,EAAG,CAAC,EAAG0B,GAAK,GAmBtB,IAlBKA,GAAK3E,GACTkD,EAAKyB,GACLA,GAAK,IAELzB,EAAKlD,EACL2E,IAAM3E,GAGPgE,GAAKpC,EAAQ+C,GAAGjB,GAAG,CAAC,EACpBO,GAAK9B,EAAQwC,GAAGhB,GAAG,CAAC,EACpBO,GAAKxB,EAAQiC,GAAGf,GAAG,CAAC,EAGpBvD,EAAMqD,GAAG,CAAC,EAAMR,EAAGQ,GAAG,CAAC,EACvB7C,EAAM8C,GAAG,CAAC,EAAMT,EAAGS,GAAG,CAAC,EACvBtC,EAAMuC,GAAG,CAAC,EAAMV,EAAGU,GAAG,CAAC,EAGjBc,GAAK,EAAGA,GAAKjB,GAAIiB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKjB,GAAIiB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKjB,GAAIiB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKjB,GAAIiB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKjB,GAAIiB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKjB,GAAIiB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKjB,GAAIiB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKjB,EAAIiB,KACtBhE,EAAM+D,EAAG,EAAInE,GAAKE,EAAM+D,EAAG,EAAG9D,EAAM+D,EAAG,CAAE,EACzCD,IAAM5D,EACN6D,IAAMrD,EACNsD,IAAM9C,EAEP4C,IAAM3D,EACN4D,IAAMpD,EACNqD,IAAM7C,CACP,CACA2C,IAAM1D,EACN2D,IAAMnD,EACNoD,IAAM5C,CACP,CACA0C,IAAMzD,EACN0D,IAAMlD,EACNmD,IAAM3C,CACP,CACAyC,IAAMxD,EACNyD,IAAMjD,EACNkD,IAAM1C,CACP,CACAwC,IAAMvD,EACNwD,IAAMhD,EACNiD,IAAMzC,CACP,CACAuC,IAAMtD,EACNuD,IAAM/C,EACNgD,IAAMxC,CACP,CACAsC,IAAMrD,EACNsD,IAAM9C,EACN+C,IAAMvC,CACP,CAST,CAKAnC,GAAO,QAAUG,KC5YjB,IAAAyF,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EAyFzE,SAASC,GAAiBC,EAAGC,EAAGC,EAAGC,GAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GA8BJ,IAzBAA,GAAInG,GAAWG,EAAE,MAAOA,EAAE,QAASC,EAAE,QAASC,EAAE,OAAQ,EACxDyD,GAAKqC,GAAE,GACP3B,GAAK2B,GAAE,GACP1B,GAAK0B,GAAE,GACPzB,GAAKyB,GAAE,GAGP5F,EAAQN,GAAWE,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7CsE,GAAKxE,EAAE,OACPyE,GAAKxE,EAAE,OACPyE,GAAKxE,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTM,EAAM6D,GAAG,CAAC,EACVpD,EAAMqD,GAAG,CAAC,EACV5C,EAAM6C,GAAG,CAAC,EAGJwB,GAAKpC,GAAG,CAAC,EAAGoC,GAAK,GAWtB,IAVKA,GAAK3F,GACTgE,GAAK2B,GACLA,GAAK,IAEL3B,GAAKhE,EACL2F,IAAM3F,GAEPsC,EAAM8B,GAAOuB,GAAG1B,GAAG,CAAC,EACpBnB,EAAMuB,GAAOsB,GAAGzB,GAAG,CAAC,EACpBZ,GAAMgB,GAAOqB,GAAGxB,GAAG,CAAC,EACduB,GAAKnC,GAAG,CAAC,EAAGmC,GAAK,GActB,IAbKA,GAAK1F,GACT+D,GAAK2B,GACLA,GAAK,IAEL3B,GAAK/D,EACL0F,IAAM1F,GAEPY,EAAMqD,GAAG,CAAC,EAAMF,GAAGE,GAAG,CAAC,EACvB5C,EAAM6C,GAAG,CAAC,EAAMH,GAAGG,GAAG,CAAC,EACvBpC,EAAMqC,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvB9B,EAAMC,EAAQoD,GAAGzB,GAAG,CAAC,EACrBpB,EAAMC,EAAQ4C,GAAGxB,GAAG,CAAC,EACrBb,GAAMC,GAAQoC,GAAGvB,GAAG,CAAC,EACfsB,GAAKlC,GAAG,CAAC,EAAGkC,GAAK,GActB,IAbKA,GAAKzF,GACT8D,GAAK2B,GACLA,GAAK,IAEL3B,GAAK9D,EACLyF,IAAMzF,GAEPW,EAAMsD,GAAG,CAAC,EAAMH,GAAGG,GAAG,CAAC,EACvB7C,EAAM8C,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvBrC,EAAMsC,GAAG,CAAC,EAAML,GAAGK,GAAG,CAAC,EACvB/B,EAAMC,EAAQoD,GAAGxB,GAAG,CAAC,EACrBrB,EAAMC,EAAQ4C,GAAGvB,GAAG,CAAC,EACrBd,GAAMC,GAAQoC,GAAGtB,GAAG,CAAC,EACfqB,GAAKjC,GAAG,CAAC,EAAGiC,GAAK,GActB,IAbKA,GAAKxF,GACT6D,GAAK2B,GACLA,GAAK,IAEL3B,GAAK7D,EACLwF,IAAMxF,GAEPU,EAAMuD,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvB9C,EAAM+C,GAAG,CAAC,EAAML,GAAGK,GAAG,CAAC,EACvBtC,EAAMuC,GAAG,CAAC,EAAMN,GAAGM,GAAG,CAAC,EACvBhC,EAAMC,EAAQoD,GAAGvB,GAAG,CAAC,EACrBtB,EAAMC,EAAQ4C,GAAGtB,GAAG,CAAC,EACrBf,GAAMC,GAAQoC,GAAGrB,GAAG,CAAC,EACfoB,GAAKhC,GAAG,CAAC,EAAGgC,GAAK,GActB,IAbKA,GAAKvF,GACT4D,GAAK2B,GACLA,GAAK,IAEL3B,GAAK5D,EACLuF,IAAMvF,GAEPS,EAAMwD,GAAG,CAAC,EAAML,GAAGK,GAAG,CAAC,EACvB/C,EAAMgD,GAAG,CAAC,EAAMN,GAAGM,GAAG,CAAC,EACvBvC,EAAMwC,GAAG,CAAC,EAAMP,GAAGO,GAAG,CAAC,EACvBjC,EAAMC,EAAQoD,GAAGtB,GAAG,CAAC,EACrBvB,EAAMC,EAAQ4C,GAAGrB,GAAG,CAAC,EACrBhB,EAAMC,GAAQoC,GAAGpB,GAAG,CAAC,EACfmB,GAAK/B,GAAG,CAAC,EAAG+B,GAAK,GActB,IAbKA,GAAKtF,GACT2D,GAAK2B,GACLA,GAAK,IAEL3B,GAAK3D,EACLsF,IAAMtF,GAEPQ,EAAMyD,GAAG,CAAC,EAAMN,GAAGM,GAAG,CAAC,EACvBhD,EAAMiD,GAAG,CAAC,EAAMP,GAAGO,GAAG,CAAC,EACvBxC,EAAMyC,GAAG,CAAC,EAAMR,GAAGQ,GAAG,CAAC,EACvBlC,EAAMC,EAAQoD,GAAGrB,GAAG,CAAC,EACrBxB,EAAMC,EAAQ4C,GAAGpB,GAAG,CAAC,EACrBjB,EAAMC,EAAQoC,GAAGnB,GAAG,CAAC,EACfkB,GAAK9B,GAAG,CAAC,EAAG8B,GAAK,GActB,IAbKA,GAAKrF,GACT0D,GAAK2B,GACLA,GAAK,IAEL3B,GAAK1D,EACLqF,IAAMrF,GAEPO,EAAM0D,GAAG,CAAC,EAAMP,GAAGO,GAAG,CAAC,EACvBjD,EAAMkD,GAAG,CAAC,EAAMR,GAAGQ,GAAG,CAAC,EACvBzC,EAAM0C,GAAG,CAAC,EAAMT,GAAGS,GAAG,CAAC,EACvBnC,EAAMC,EAAQoD,GAAGpB,GAAG,CAAC,EACrBzB,EAAMC,EAAQ4C,GAAGnB,GAAG,CAAC,EACrBlB,EAAMC,EAAQoC,GAAGlB,GAAG,CAAC,EACfiB,GAAK7B,GAAG,CAAC,EAAG6B,GAAK,GActB,IAbKA,GAAKpF,GACTyD,GAAK2B,GACLA,GAAK,IAEL3B,GAAKzD,EACLoF,IAAMpF,GAEPM,EAAM2D,GAAG,CAAC,EAAMR,GAAGQ,GAAG,CAAC,EACvBlD,EAAMmD,GAAG,CAAC,EAAMT,GAAGS,GAAG,CAAC,EACvB1C,EAAM2C,GAAG,CAAC,EAAMV,GAAGU,GAAG,CAAC,EACvBpC,EAAMC,EAAQoD,GAAGnB,GAAG,CAAC,EACrB1B,EAAMC,EAAQ4C,GAAGlB,GAAG,CAAC,EACrBnB,EAAMC,EAAQoC,GAAGjB,GAAG,CAAC,EACfgB,GAAK5B,GAAG,CAAC,EAAG4B,GAAK,GAmBtB,IAlBKA,GAAKnF,GACTwD,GAAK2B,GACLA,GAAK,IAEL3B,GAAKxD,EACLmF,IAAMnF,GAGPuE,GAAKxC,EAAQoD,GAAGlB,GAAG,CAAC,EACpBO,GAAKjC,EAAQ4C,GAAGjB,GAAG,CAAC,EACpBO,GAAK1B,EAAQoC,GAAGhB,GAAG,CAAC,EAGpB9D,EAAM4D,GAAG,CAAC,EAAMT,GAAGS,GAAG,CAAC,EACvBnD,EAAMoD,GAAG,CAAC,EAAMV,GAAGU,GAAG,CAAC,EACvB3C,EAAM4C,GAAG,CAAC,EAAMX,GAAGW,GAAG,CAAC,EAGjBe,GAAK,EAAGA,GAAKlB,GAAIkB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKlB,GAAIkB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKlB,GAAIkB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKlB,GAAIkB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKlB,GAAIkB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKlB,GAAIkB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKlB,GAAIkB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKlB,GAAIkB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKlB,GAAIkB,KACtBvE,EAAMsE,EAAG,EAAI1E,GAAKE,EAAMsE,EAAG,EAAGrE,EAAMsE,EAAG,CAAE,EACzCD,IAAMnE,EACNoE,IAAM3D,EACN4D,IAAMnD,EAEPiD,IAAMlE,EACNmE,IAAM1D,EACN2D,IAAMlD,CACP,CACAgD,IAAMjE,EACNkE,IAAMzD,EACN0D,IAAMjD,CACP,CACA+C,IAAMhE,EACNiE,IAAMxD,EACNyD,IAAMhD,CACP,CACA8C,IAAM/D,EACNgE,IAAMvD,EACNwD,IAAM/C,CACP,CACA6C,IAAM9D,EACN+D,IAAMtD,EACNuD,IAAM9C,CACP,CACA4C,IAAM7D,EACN8D,IAAMrD,EACNsD,IAAM7C,CACP,CACA2C,IAAM5D,EACN6D,IAAMpD,EACNqD,IAAM5C,CACP,CACA0C,IAAM3D,EACN4D,IAAMnD,EACNoD,IAAM3C,CACP,CAUV,CAKAtC,GAAO,QAAUG,KCzajB,IAAAkG,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EAyFzE,SAASC,GAAkBC,EAAGC,EAAGC,EAAGC,GAAM,CACzC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GA8BJ,IAzBAA,GAAI5G,GAAWG,EAAE,MAAOA,EAAE,QAASC,EAAE,QAASC,EAAE,OAAQ,EACxD+D,GAAKwC,GAAE,GACP7B,GAAK6B,GAAE,GACP5B,GAAK4B,GAAE,GACP3B,GAAK2B,GAAE,GAGPrG,EAAQN,GAAWE,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7C6E,GAAK/E,EAAE,OACPgF,GAAK/E,EAAE,OACPgF,GAAK/E,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTM,EAAMoE,GAAG,CAAC,EACV1D,EAAM2D,GAAG,CAAC,EACVjD,EAAMkD,GAAG,CAAC,EAGJ0B,GAAKvC,GAAG,CAAC,EAAGuC,GAAK,GAWtB,IAVKA,GAAKpG,GACTuE,GAAK6B,GACLA,GAAK,IAEL7B,GAAKvE,EACLoG,IAAMpG,GAEP0C,EAAMiC,GAAOyB,GAAG5B,GAAG,CAAC,EACpBrB,GAAMyB,GAAOwB,GAAG3B,GAAG,CAAC,EACpBb,GAAMiB,GAAOuB,GAAG1B,GAAG,CAAC,EACdyB,GAAKtC,GAAG,CAAC,EAAGsC,GAAK,GActB,IAbKA,GAAKnG,GACTsE,GAAK6B,GACLA,GAAK,IAEL7B,GAAKtE,EACLmG,IAAMnG,GAEPa,EAAM2D,GAAG,CAAC,EAAMF,GAAGE,GAAG,CAAC,EACvBjD,EAAMkD,GAAG,CAAC,EAAMH,GAAGG,GAAG,CAAC,EACvBxC,EAAMyC,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvBjC,EAAMC,EAAQyD,GAAG3B,GAAG,CAAC,EACrBtB,EAAMC,GAAQgD,GAAG1B,GAAG,CAAC,EACrBd,GAAMC,GAAQuC,GAAGzB,GAAG,CAAC,EACfwB,GAAKrC,GAAG,CAAC,EAAGqC,GAAK,GActB,IAbKA,GAAKlG,GACTqE,GAAK6B,GACLA,GAAK,IAEL7B,GAAKrE,EACLkG,IAAMlG,GAEPY,EAAM4D,GAAG,CAAC,EAAMH,GAAGG,GAAG,CAAC,EACvBlD,EAAMmD,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvBzC,EAAM0C,GAAG,CAAC,EAAML,GAAGK,GAAG,CAAC,EACvBlC,EAAMC,EAAQyD,GAAG1B,GAAG,CAAC,EACrBvB,EAAMC,EAAQgD,GAAGzB,GAAG,CAAC,EACrBf,GAAMC,GAAQuC,GAAGxB,GAAG,CAAC,EACfuB,GAAKpC,GAAG,CAAC,EAAGoC,GAAK,GActB,IAbKA,GAAKjG,GACToE,GAAK6B,GACLA,GAAK,IAEL7B,GAAKpE,EACLiG,IAAMjG,GAEPW,EAAM6D,GAAG,CAAC,EAAMJ,GAAGI,GAAG,CAAC,EACvBnD,EAAMoD,GAAG,CAAC,EAAML,GAAGK,GAAG,CAAC,EACvB1C,EAAM2C,GAAG,CAAC,EAAMN,GAAGM,GAAG,CAAC,EACvBnC,EAAMC,EAAQyD,GAAGzB,GAAG,CAAC,EACrBxB,EAAMC,EAAQgD,GAAGxB,GAAG,CAAC,EACrBhB,GAAMC,GAAQuC,GAAGvB,GAAG,CAAC,EACfsB,GAAKnC,GAAG,CAAC,EAAGmC,GAAK,GActB,IAbKA,GAAKhG,GACTmE,GAAK6B,GACLA,GAAK,IAEL7B,GAAKnE,EACLgG,IAAMhG,GAEPU,EAAM8D,GAAG,CAAC,EAAML,GAAGK,GAAG,CAAC,EACvBpD,EAAMqD,GAAG,CAAC,EAAMN,GAAGM,GAAG,CAAC,EACvB3C,EAAM4C,GAAG,CAAC,EAAMP,GAAGO,GAAG,CAAC,EACvBpC,EAAMC,EAAQyD,GAAGxB,GAAG,CAAC,EACrBzB,EAAMC,EAAQgD,GAAGvB,GAAG,CAAC,EACrBjB,GAAMC,GAAQuC,GAAGtB,GAAG,CAAC,EACfqB,GAAKlC,GAAG,CAAC,EAAGkC,GAAK,GActB,IAbKA,GAAK/F,GACTkE,GAAK6B,GACLA,GAAK,IAEL7B,GAAKlE,EACL+F,IAAM/F,GAEPS,EAAM+D,GAAG,CAAC,EAAMN,GAAGM,GAAG,CAAC,EACvBrD,EAAMsD,GAAG,CAAC,EAAMP,GAAGO,GAAG,CAAC,EACvB5C,EAAM6C,GAAG,CAAC,EAAMR,GAAGQ,GAAG,CAAC,EACvBrC,EAAMC,EAAQyD,GAAGvB,GAAG,CAAC,EACrB1B,EAAMC,EAAQgD,GAAGtB,GAAG,CAAC,EACrBlB,GAAMC,GAAQuC,GAAGrB,GAAG,CAAC,EACfoB,GAAKjC,GAAG,CAAC,EAAGiC,GAAK,GActB,IAbKA,GAAK9F,GACTiE,GAAK6B,GACLA,GAAK,IAEL7B,GAAKjE,EACL8F,IAAM9F,GAEPQ,EAAMgE,GAAG,CAAC,EAAMP,GAAGO,GAAG,CAAC,EACvBtD,EAAMuD,GAAG,CAAC,EAAMR,GAAGQ,GAAG,CAAC,EACvB7C,EAAM8C,GAAG,CAAC,EAAMT,GAAGS,GAAG,CAAC,EACvBtC,EAAMC,EAAQyD,GAAGtB,GAAG,CAAC,EACrB3B,EAAMC,EAAQgD,GAAGrB,GAAG,CAAC,EACrBnB,GAAMC,GAAQuC,GAAGpB,GAAG,CAAC,EACfmB,GAAKhC,GAAG,CAAC,EAAGgC,GAAK,GActB,IAbKA,GAAK7F,GACTgE,GAAK6B,GACLA,GAAK,IAEL7B,GAAKhE,EACL6F,IAAM7F,GAEPO,EAAMiE,GAAG,CAAC,EAAMR,GAAGQ,GAAG,CAAC,EACvBvD,EAAMwD,GAAG,CAAC,EAAMT,GAAGS,GAAG,CAAC,EACvB9C,EAAM+C,GAAG,CAAC,EAAMV,GAAGU,GAAG,CAAC,EACvBvC,EAAMC,EAAQyD,GAAGrB,GAAG,CAAC,EACrB5B,EAAMC,EAAQgD,GAAGpB,GAAG,CAAC,EACrBpB,GAAMC,GAAQuC,GAAGnB,GAAG,CAAC,EACfkB,GAAK/B,GAAG,CAAC,EAAG+B,GAAK,GActB,IAbKA,GAAK5F,GACT+D,GAAK6B,GACLA,GAAK,IAEL7B,GAAK/D,EACL4F,IAAM5F,GAEPM,EAAMkE,GAAG,CAAC,EAAMT,GAAGS,GAAG,CAAC,EACvBxD,EAAMyD,GAAG,CAAC,EAAMV,GAAGU,GAAG,CAAC,EACvB/C,EAAMgD,GAAG,CAAC,EAAMX,GAAGW,GAAG,CAAC,EACvBxC,EAAMC,EAAQyD,GAAGpB,GAAG,CAAC,EACrB7B,EAAMC,EAAQgD,GAAGnB,GAAG,CAAC,EACrBrB,GAAMC,GAAQuC,GAAGlB,GAAG,CAAC,EACfiB,GAAK9B,GAAG,CAAC,EAAG8B,GAAK,GAmBtB,IAlBKA,GAAK3F,GACT8D,GAAK6B,GACLA,GAAK,IAEL7B,GAAK9D,EACL2F,IAAM3F,GAGP8E,GAAK5C,EAAQyD,GAAGnB,GAAG,CAAC,EACpBO,GAAKpC,EAAQgD,GAAGlB,GAAG,CAAC,EACpBO,GAAK5B,GAAQuC,GAAGjB,GAAG,CAAC,EAGpBrE,EAAMmE,GAAG,CAAC,EAAMV,GAAGU,GAAG,CAAC,EACvBzD,EAAM0D,GAAG,CAAC,EAAMX,GAAGW,GAAG,CAAC,EACvBhD,EAAMiD,GAAG,CAAC,EAAMZ,GAAGY,GAAG,CAAC,EAGjBgB,GAAK,EAAGA,GAAKnB,GAAImB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKnB,GAAImB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKnB,GAAImB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKnB,GAAImB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKnB,GAAImB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKnB,GAAImB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKnB,GAAImB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKnB,GAAImB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKnB,GAAImB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKnB,GAAImB,KACtB9E,EAAM6E,EAAG,EAAIjF,GAAKE,EAAM6E,EAAG,EAAG5E,EAAM6E,EAAG,CAAE,EACzCD,IAAM1E,EACN2E,IAAMjE,EACNkE,IAAMxD,EAEPsD,IAAMzE,EACN0E,IAAMhE,EACNiE,IAAMvD,CACP,CACAqD,IAAMxE,EACNyE,IAAM/D,EACNgE,IAAMtD,CACP,CACAoD,IAAMvE,EACNwE,IAAM9D,EACN+D,IAAMrD,CACP,CACAmD,IAAMtE,EACNuE,IAAM7D,EACN8D,IAAMpD,CACP,CACAkD,IAAMrE,EACNsE,IAAM5D,EACN6D,IAAMnD,CACP,CACAiD,IAAMpE,EACNqE,IAAM3D,EACN4D,IAAMlD,CACP,CACAgD,IAAMnE,EACNoE,IAAM1D,EACN2D,IAAMjD,CACP,CACA+C,IAAMlE,EACNmE,IAAMzD,EACN0D,IAAMhD,CACP,CACA8C,IAAMjE,EACNkE,IAAMxD,EACNyD,IAAM/C,CACP,CAWX,CAKAzC,GAAO,QAAUG,KCtcjB,IAAA2G,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAkHA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAM,CACjCD,EAAE,UAAW,CAAE,EAAGA,EAAE,KAAMA,EAAE,OAAQC,GAAKH,EAAE,UAAW,CAAE,EAAGA,EAAE,KAAMA,EAAE,MAAO,EAAGC,EAAE,UAAW,CAAE,EAAGA,EAAE,KAAMA,EAAE,MAAO,CAAE,CAAE,CACvH,CAKAH,GAAO,QAAUC,KCzHjB,IAAAK,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAmHA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAM,CACjC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA0BJ,IArBAJ,EAAKb,EAAE,MAAO,CAAE,EAChBU,EAAMV,EAAE,QAAS,CAAE,EACnBW,EAAMV,EAAE,QAAS,CAAE,EACnBW,EAAMV,EAAE,QAAS,CAAE,EAGnBY,EAAKd,EAAE,OACPe,EAAKd,EAAE,OACPe,EAAKd,EAAE,OAGPE,EAAOJ,EAAE,KACTK,EAAOJ,EAAE,KACTK,EAAOJ,EAAE,KAGTK,EAAOP,EAAE,UAAW,CAAE,EACtBQ,EAAOP,EAAE,UAAW,CAAE,EACtBQ,EAAOP,EAAE,UAAW,CAAE,EAGhBe,EAAK,EAAGA,EAAKJ,EAAII,IACtBR,EAAMH,EAAMU,EAAIb,GAAKI,EAAMH,EAAMU,CAAG,EAAGN,EAAMH,EAAMU,CAAG,CAAE,CAAE,EAC1DD,GAAMJ,EACNK,GAAMJ,EACNK,GAAMJ,CAER,CAKAd,GAAO,QAAUC,KCtKjB,IAAAmB,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAoHA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAYC,EAAM,CAC7C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA8CJ,IAzCAV,EAAKjB,EAAE,MACPoB,EAAKpB,EAAE,QACPqB,EAAKpB,EAAE,QACPqB,EAAKpB,EAAE,QACFC,IAEJe,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXN,EAAMS,EAAI,CAAE,EACZR,EAAMQ,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBP,EAAMQ,EAAI,CAAE,EACZP,EAAMO,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBN,EAAMO,EAAI,CAAE,EACZN,EAAMM,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,IAGzBJ,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXN,EAAMS,EAAI,CAAE,EACZR,EAAMQ,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBP,EAAMQ,EAAI,CAAE,EACZP,EAAMO,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBN,EAAMO,EAAI,CAAE,EACZN,EAAMM,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,GAG1BC,EAAKvB,EAAE,OACPwB,EAAKvB,EAAE,OACPwB,EAAKvB,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTM,EAAOR,EAAE,UAAW,CAAE,EACtBS,EAAOR,EAAE,UAAW,CAAE,EACtBS,EAAOR,EAAE,UAAW,CAAE,EAGhByB,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IACtBhB,EAAMH,EAAMkB,EAAIrB,EAAKI,EAAMH,EAAMkB,CAAG,EAAGd,EAAMH,EAAMkB,CAAG,CAAE,CAAE,EAC1DD,GAAMZ,EACNa,GAAMX,EACNY,GAAMV,EAEPQ,GAAMX,EACNY,GAAMV,EACNW,GAAMT,CACP,CACD,CAKAlB,GAAO,QAAUC,KCzMjB,IAAA6B,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAoHA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAYC,EAAM,CAC7C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAsDJ,IAjDAZ,EAAKpB,EAAE,MACPwB,EAAKxB,EAAE,QACPyB,EAAKxB,EAAE,QACPyB,EAAKxB,EAAE,QACFC,IAEJkB,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXT,EAAMa,EAAI,CAAE,EACZZ,EAAMY,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBV,EAAMW,EAAI,CAAE,EACZV,EAAMU,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBR,EAAMS,EAAI,CAAE,EACZR,EAAMQ,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBP,EAAMO,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,IAGzBL,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXT,EAAMa,EAAI,CAAE,EACZZ,EAAMY,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBV,EAAMW,EAAI,CAAE,EACZV,EAAMU,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBR,EAAMS,EAAI,CAAE,EACZR,EAAMQ,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBP,EAAMO,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,GAG1BC,EAAK3B,EAAE,OACP4B,EAAK3B,EAAE,OACP4B,EAAK3B,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTM,EAAOR,EAAE,UAAW,CAAE,EACtBS,EAAOR,EAAE,UAAW,CAAE,EACtBS,EAAOR,EAAE,UAAW,CAAE,EAGhB8B,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IACtBpB,EAAMH,EAAMsB,EAAIzB,EAAKI,EAAMH,EAAMsB,CAAG,EAAGlB,EAAMH,EAAMsB,CAAG,CAAE,CAAE,EAC1DD,GAAMhB,EACNiB,GAAMd,EACNe,GAAMZ,EAEPU,GAAMf,EACNgB,GAAMb,EACNc,GAAMX,CACP,CACAS,GAAMd,EACNe,GAAMZ,EACNa,GAAMV,CACP,CACD,CAKArB,GAAO,QAAUC,KC3NjB,IAAAkC,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAoHA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAYC,EAAM,CAC7C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA8DJ,IAzDAd,EAAKvB,EAAE,MACP4B,EAAK5B,EAAE,QACP6B,EAAK5B,EAAE,QACP6B,EAAK5B,EAAE,QACFC,IAEJqB,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXZ,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBb,EAAMc,EAAI,CAAE,EACZb,EAAMa,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBV,EAAMW,EAAI,CAAE,EACZV,EAAMU,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBR,EAAMQ,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,IAGzBN,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXZ,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBb,EAAMc,EAAI,CAAE,EACZb,EAAMa,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBV,EAAMW,EAAI,CAAE,EACZV,EAAMU,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBR,EAAMQ,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,GAG1BC,EAAK/B,EAAE,OACPgC,EAAK/B,EAAE,OACPgC,EAAK/B,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTM,EAAOR,EAAE,UAAW,CAAE,EACtBS,EAAOR,EAAE,UAAW,CAAE,EACtBS,EAAOR,EAAE,UAAW,CAAE,EAGhBmC,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IACtBxB,EAAMH,EAAM0B,EAAI7B,EAAKI,EAAMH,EAAM0B,CAAG,EAAGtB,EAAMH,EAAM0B,CAAG,CAAE,CAAE,EAC1DD,GAAMpB,EACNqB,GAAMjB,EACNkB,GAAMd,EAEPY,GAAMnB,EACNoB,GAAMhB,EACNiB,GAAMb,CACP,CACAW,GAAMlB,EACNmB,GAAMf,EACNgB,GAAMZ,CACP,CACAU,GAAMjB,EACNkB,GAAMd,EACNe,GAAMX,CACP,CACD,CAKAxB,GAAO,QAAUC,KC7OjB,IAAAuC,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAsHA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAYC,EAAM,CAC7C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAsEJ,IAjEAhB,EAAK1B,EAAE,MACPgC,EAAKhC,EAAE,QACPiC,EAAKhC,EAAE,QACPiC,EAAKhC,EAAE,QACFC,IAEJwB,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXf,EAAMqB,EAAI,CAAE,EACZpB,EAAMoB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBhB,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBZ,EAAMa,EAAI,CAAE,EACZZ,EAAMY,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,IAGzBP,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXf,EAAMqB,EAAI,CAAE,EACZpB,EAAMoB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBhB,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBZ,EAAMa,EAAI,CAAE,EACZZ,EAAMY,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,GAG1BC,EAAKnC,EAAE,OACPoC,EAAKnC,EAAE,OACPoC,EAAKnC,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTM,EAAOR,EAAE,UAAW,CAAE,EACtBS,EAAOR,EAAE,UAAW,CAAE,EACtBS,EAAOR,EAAE,UAAW,CAAE,EAGhBwC,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IACtB5B,EAAMH,EAAM8B,EAAIjC,EAAKI,EAAMH,EAAM8B,CAAG,EAAG1B,EAAMH,EAAM8B,CAAG,CAAE,CAAE,EAC1DD,GAAMxB,EACNyB,GAAMpB,EACNqB,GAAMhB,EAEPc,GAAMvB,EACNwB,GAAMnB,EACNoB,GAAMf,CACP,CACAa,GAAMtB,EACNuB,GAAMlB,EACNmB,GAAMd,CACP,CACAY,GAAMrB,EACNsB,GAAMjB,EACNkB,GAAMb,CACP,CACAW,GAAMpB,EACNqB,GAAMhB,EACNiB,GAAMZ,CACP,CACD,CAKA3B,GAAO,QAAUC,KCjQjB,IAAA4C,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAsHA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAYC,EAAM,CAC7C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA8EJ,IAzEAlB,EAAK7B,EAAE,MACPoC,EAAKpC,EAAE,QACPqC,EAAKpC,EAAE,QACPqC,EAAKpC,EAAE,QACFC,IAEJ2B,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXlB,EAAMyB,EAAI,CAAE,EACZxB,EAAMwB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBtB,EAAMsB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBpB,EAAMoB,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBnB,EAAMoB,EAAI,CAAE,EACZnB,EAAMmB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBd,EAAMe,EAAI,CAAE,EACZd,EAAMc,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,IAGzBR,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXlB,EAAMyB,EAAI,CAAE,EACZxB,EAAMwB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBtB,EAAMsB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBpB,EAAMoB,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBnB,EAAMoB,EAAI,CAAE,EACZnB,EAAMmB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBd,EAAMe,EAAI,CAAE,EACZd,EAAMc,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,GAG1BC,EAAKvC,EAAE,OACPwC,EAAKvC,EAAE,OACPwC,EAAKvC,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTM,EAAOR,EAAE,UAAW,CAAE,EACtBS,EAAOR,EAAE,UAAW,CAAE,EACtBS,EAAOR,EAAE,UAAW,CAAE,EAGhB6C,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IACtBhC,EAAMH,EAAMkC,EAAIrC,EAAKI,EAAMH,EAAMkC,CAAG,EAAG9B,EAAMH,EAAMkC,CAAG,CAAE,CAAE,EAC1DD,GAAM5B,EACN6B,GAAMvB,EACNwB,GAAMlB,EAEPgB,GAAM3B,EACN4B,GAAMtB,EACNuB,GAAMjB,CACP,CACAe,GAAM1B,EACN2B,GAAMrB,EACNsB,GAAMhB,CACP,CACAc,GAAMzB,EACN0B,GAAMpB,EACNqB,GAAMf,CACP,CACAa,GAAMxB,EACNyB,GAAMnB,EACNoB,GAAMd,CACP,CACAY,GAAMvB,EACNwB,GAAMlB,EACNmB,GAAMb,CACP,CACD,CAKA9B,GAAO,QAAUC,KCnRjB,IAAAiD,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAsHA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAYC,EAAM,CAC7C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAsFJ,IAjFApB,EAAKhC,EAAE,MACPwC,EAAKxC,EAAE,QACPyC,EAAKxC,EAAE,QACPyC,EAAKxC,EAAE,QACFC,IAEJ8B,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXrB,EAAM6B,EAAI,CAAE,EACZ5B,EAAM4B,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzB3B,EAAM2B,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzB1B,EAAM0B,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBzB,EAAMyB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBxB,EAAMwB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBtB,EAAMuB,EAAI,CAAE,EACZtB,EAAMsB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBpB,EAAMoB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBhB,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,IAGzBT,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXrB,EAAM6B,EAAI,CAAE,EACZ5B,EAAM4B,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzB3B,EAAM2B,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzB1B,EAAM0B,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBzB,EAAMyB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBxB,EAAMwB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBtB,EAAMuB,EAAI,CAAE,EACZtB,EAAMsB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBpB,EAAMoB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBhB,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,GAG1BC,EAAK3C,EAAE,OACP4C,EAAK3C,EAAE,OACP4C,EAAK3C,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTM,EAAOR,EAAE,UAAW,CAAE,EACtBS,EAAOR,EAAE,UAAW,CAAE,EACtBS,EAAOR,EAAE,UAAW,CAAE,EAGhBkD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IACtBpC,EAAMH,EAAMsC,EAAIzC,EAAKI,EAAMH,EAAMsC,CAAG,EAAGlC,EAAMH,EAAMsC,CAAG,CAAE,CAAE,EAC1DD,GAAMhC,EACNiC,GAAM1B,EACN2B,GAAMpB,EAEPkB,GAAM/B,EACNgC,GAAMzB,EACN0B,GAAMnB,CACP,CACAiB,GAAM9B,EACN+B,GAAMxB,EACNyB,GAAMlB,CACP,CACAgB,GAAM7B,EACN8B,GAAMvB,EACNwB,GAAMjB,CACP,CACAe,GAAM5B,EACN6B,GAAMtB,EACNuB,GAAMhB,CACP,CACAc,GAAM3B,EACN4B,GAAMrB,EACNsB,GAAMf,CACP,CACAa,GAAM1B,EACN2B,GAAMpB,EACNqB,GAAMd,CACP,CACD,CAKAjC,GAAO,QAAUC,KCrSjB,IAAAsD,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAsHA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAYC,EAAM,CAC7C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GA8FJ,IAzFAtB,EAAKnC,EAAE,MACP4C,EAAK5C,EAAE,QACP6C,EAAK5C,EAAE,QACP6C,EAAK5C,EAAE,QACFC,IAEJiC,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXxB,EAAMiC,EAAI,CAAE,EACZhC,EAAMgC,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzB/B,EAAM+B,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzB9B,EAAM8B,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzB7B,EAAM6B,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzB5B,EAAM4B,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzB3B,EAAM2B,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzB1B,EAAM0B,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBzB,EAAM0B,EAAI,CAAE,EACZzB,EAAMyB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBxB,EAAMwB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBtB,EAAMsB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBpB,EAAMoB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBlB,EAAMmB,EAAI,CAAE,EACZlB,EAAMkB,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,IAGzBV,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXxB,EAAMiC,EAAI,CAAE,EACZhC,EAAMgC,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzB/B,EAAM+B,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzB9B,EAAM8B,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzB7B,EAAM6B,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzB5B,EAAM4B,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzB3B,EAAM2B,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzB1B,EAAM0B,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBzB,EAAM0B,EAAI,CAAE,EACZzB,EAAMyB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBxB,EAAMwB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBtB,EAAMsB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBpB,EAAMoB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBlB,EAAMmB,EAAI,CAAE,EACZlB,EAAMkB,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,GAG1BC,EAAK/C,EAAE,OACPgD,EAAK/C,EAAE,OACPgD,EAAK/C,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTM,EAAOR,EAAE,UAAW,CAAE,EACtBS,EAAOR,EAAE,UAAW,CAAE,EACtBS,EAAOR,EAAE,UAAW,CAAE,EAGhBuD,GAAK,EAAGA,GAAKd,EAAIc,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKd,EAAIc,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKd,EAAIc,KAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKd,EAAIc,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKd,EAAIc,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKd,EAAIc,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKd,EAAIc,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKd,EAAIc,IACtBxC,EAAMH,EAAM0C,EAAI7C,EAAKI,EAAMH,EAAM0C,CAAG,EAAGtC,EAAMH,EAAM0C,CAAG,CAAE,CAAE,EAC1DD,GAAMpC,EACNqC,GAAM7B,EACN8B,GAAMtB,EAEPoB,GAAMnC,EACNoC,GAAM5B,EACN6B,GAAMrB,CACP,CACAmB,GAAMlC,EACNmC,GAAM3B,EACN4B,GAAMpB,CACP,CACAkB,GAAMjC,EACNkC,GAAM1B,EACN2B,GAAMnB,CACP,CACAiB,GAAMhC,EACNiC,GAAMzB,EACN0B,GAAMlB,CACP,CACAgB,GAAM/B,EACNgC,GAAMxB,EACNyB,GAAMjB,CACP,CACAe,GAAM9B,EACN+B,GAAMvB,EACNwB,GAAMhB,CACP,CACAc,GAAM7B,EACN8B,GAAMtB,EACNuB,GAAMf,CACP,CACD,CAKApC,GAAO,QAAUC,KCvTjB,IAAA2D,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAsHA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAYC,EAAM,CAC7C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAsGJ,IAjGAxB,EAAKtC,EAAE,MACPgD,EAAKhD,EAAE,QACPiD,EAAKhD,EAAE,QACPiD,EAAKhD,EAAE,QACFC,IAEJoC,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACX3B,EAAMqC,EAAI,CAAE,EACZpC,EAAMoC,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBnC,EAAMmC,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBlC,EAAMkC,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBjC,EAAMiC,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBhC,EAAMgC,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzB/B,EAAM+B,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzB9B,EAAM8B,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzB7B,EAAM6B,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzB5B,EAAM6B,EAAI,CAAE,EACZ5B,EAAM4B,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzB3B,EAAM2B,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzB1B,EAAM0B,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBzB,EAAMyB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBxB,EAAMwB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBtB,EAAMsB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBpB,EAAMqB,EAAI,CAAE,EACZpB,EAAMoB,EAAI,CAAE,EAAMX,EAAGW,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,IAGzBX,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACX3B,EAAMqC,EAAI,CAAE,EACZpC,EAAMoC,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBnC,EAAMmC,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBlC,EAAMkC,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBjC,EAAMiC,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBhC,EAAMgC,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzB/B,EAAM+B,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzB9B,EAAM8B,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzB7B,EAAM6B,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzB5B,EAAM6B,EAAI,CAAE,EACZ5B,EAAM4B,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzB3B,EAAM2B,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzB1B,EAAM0B,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBzB,EAAMyB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBxB,EAAMwB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBtB,EAAMsB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBpB,EAAMqB,EAAI,CAAE,EACZpB,EAAMoB,EAAI,CAAE,EAAMX,EAAGW,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,GAG1BC,EAAKnD,EAAE,OACPoD,EAAKnD,EAAE,OACPoD,EAAKnD,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTM,EAAOR,EAAE,UAAW,CAAE,EACtBS,EAAOR,EAAE,UAAW,CAAE,EACtBS,EAAOR,EAAE,UAAW,CAAE,EAGhB4D,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKf,EAAIe,IACtB5C,EAAMH,EAAM8C,EAAIjD,EAAKI,EAAMH,EAAM8C,CAAG,EAAG1C,EAAMH,EAAM8C,CAAG,CAAE,CAAE,EAC1DD,GAAMxC,EACNyC,GAAMhC,EACNiC,GAAMxB,EAEPsB,GAAMvC,EACNwC,GAAM/B,EACNgC,GAAMvB,CACP,CACAqB,GAAMtC,EACNuC,GAAM9B,EACN+B,GAAMtB,CACP,CACAoB,GAAMrC,EACNsC,GAAM7B,EACN8B,GAAMrB,CACP,CACAmB,GAAMpC,EACNqC,GAAM5B,EACN6B,GAAMpB,CACP,CACAkB,GAAMnC,EACNoC,GAAM3B,EACN4B,GAAMnB,CACP,CACAiB,GAAMlC,EACNmC,GAAM1B,EACN2B,GAAMlB,CACP,CACAgB,GAAMjC,EACNkC,GAAMzB,EACN0B,GAAMjB,CACP,CACAe,GAAMhC,EACNiC,GAAMxB,EACNyB,GAAMhB,CACP,CACD,CAKAvC,GAAO,QAAUC,KCzUjB,IAAAgE,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAsHA,SAASC,GAAWC,EAAGC,EAAGC,EAAGC,GAAYC,EAAM,CAC9C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GA8GJ,IAzGA1B,EAAKzC,EAAE,MACPoD,EAAKpD,EAAE,QACPqD,EAAKpD,EAAE,QACPqD,EAAKpD,EAAE,QACFC,IAEJuC,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXU,EAAKV,EAAI,CAAE,EACX9B,EAAMyC,EAAI,CAAE,EACZxC,EAAMwC,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBvC,EAAMuC,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBtC,EAAMsC,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBrC,EAAMqC,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBpC,EAAMoC,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBnC,EAAMmC,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBlC,EAAMkC,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBjC,EAAMiC,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBhC,EAAMgC,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzB/B,EAAMgC,EAAI,CAAE,EACZ/B,EAAM+B,EAAI,CAAE,EAAMX,EAAGW,EAAG,CAAC,EACzB9B,EAAM8B,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzB7B,EAAM6B,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzB5B,EAAM4B,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzB3B,EAAM2B,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzB1B,EAAM0B,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBzB,EAAMyB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBxB,EAAMwB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBtB,EAAMuB,EAAI,CAAE,EACZtB,EAAMsB,EAAI,CAAE,EAAMZ,EAAGY,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAMX,EAAGW,EAAG,CAAC,EACzBpB,EAAMoB,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,IAGzBZ,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXU,EAAKV,EAAI,CAAE,EACX9B,EAAMyC,EAAI,CAAE,EACZxC,EAAMwC,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBvC,EAAMuC,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBtC,EAAMsC,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBrC,EAAMqC,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBpC,EAAMoC,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBnC,EAAMmC,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBlC,EAAMkC,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBjC,EAAMiC,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBhC,EAAMgC,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzB/B,EAAMgC,EAAI,CAAE,EACZ/B,EAAM+B,EAAI,CAAE,EAAMX,EAAGW,EAAG,CAAC,EACzB9B,EAAM8B,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzB7B,EAAM6B,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzB5B,EAAM4B,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzB3B,EAAM2B,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzB1B,EAAM0B,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBzB,EAAMyB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBxB,EAAMwB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBtB,EAAMuB,EAAI,CAAE,EACZtB,EAAMsB,EAAI,CAAE,EAAMZ,EAAGY,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAMX,EAAGW,EAAG,CAAC,EACzBpB,EAAMoB,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,GAG1BC,GAAKvD,EAAE,OACPwD,GAAKvD,EAAE,OACPwD,GAAKvD,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGTM,EAAOR,EAAE,UAAW,CAAE,EACtBS,EAAOR,EAAE,UAAW,CAAE,EACtBS,EAAOR,EAAE,UAAW,CAAE,EAGhBiE,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KACtBhD,EAAMH,EAAMkD,GAAIrD,EAAKI,EAAMH,EAAMkD,EAAG,EAAG9C,EAAMH,EAAMkD,EAAG,CAAE,CAAE,EAC1DD,IAAM5C,EACN6C,IAAMnC,EACNoC,IAAM1B,EAEPwB,IAAM3C,EACN4C,IAAMlC,EACNmC,IAAMzB,CACP,CACAuB,IAAM1C,EACN2C,IAAMjC,EACNkC,IAAMxB,CACP,CACAsB,IAAMzC,EACN0C,IAAMhC,EACNiC,IAAMvB,CACP,CACAqB,IAAMxC,EACNyC,IAAM/B,EACNgC,IAAMtB,CACP,CACAoB,IAAMvC,EACNwC,IAAM9B,EACN+B,IAAMrB,CACP,CACAmB,IAAMtC,EACNuC,IAAM7B,EACN8B,IAAMpB,CACP,CACAkB,IAAMrC,EACNsC,IAAM5B,EACN6B,IAAMnB,CACP,CACAiB,IAAMpC,EACNqC,IAAM3B,EACN4B,IAAMlB,CACP,CACAgB,IAAMnC,EACNoC,IAAM1B,EACN2B,IAAMjB,CACP,CACD,CAKA1C,GAAO,QAAUC,KC3VjB,IAAAqE,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,QAAS,4BAA6B,EAC9CC,GAAY,QAAS,gCAAiC,EAKtDC,GAAO,QAkGX,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAM,CACjC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAiCJ,IA/BAV,EAAKd,EAAE,MAGPa,EAAMjB,GAAOkB,CAAG,EAGhBV,EAAOJ,EAAE,KACTK,EAAOJ,EAAE,KACTK,EAAOJ,EAAE,KAGTa,EAAKf,EAAE,QACPgB,EAAKf,EAAE,QACPgB,EAAKf,EAAE,QAGPgB,EAAKlB,EAAE,OACPmB,EAAKlB,EAAE,OACPmB,EAAKlB,EAAE,OAGPK,EAAOP,EAAE,MACTQ,EAAOP,EAAE,MACTQ,EAAOP,EAAE,MAGTQ,EAAOV,EAAE,UAAW,CAAE,EACtBW,EAAOV,EAAE,UAAW,CAAE,EACtBW,EAAOV,EAAE,UAAW,CAAE,EAGhBsB,EAAI,EAAGA,EAAIX,EAAKW,IACrBH,EAAKxB,GAAWiB,EAAIC,EAAIG,EAAIX,EAAMiB,EAAG1B,EAAK,EAC1CwB,EAAKzB,GAAWiB,EAAIE,EAAIG,EAAIX,EAAMgB,EAAG1B,EAAK,EAC1CyB,EAAK1B,GAAWiB,EAAIG,EAAIG,EAAIX,EAAMe,EAAG1B,EAAK,EAC1Cc,EAAMN,EAAMiB,EAAIpB,GAAKO,EAAMN,EAAMiB,CAAG,EAAGV,EAAMN,EAAMiB,CAAG,CAAE,CAAE,CAE5D,CAKA3B,GAAO,QAAUI,KC/LjB,IAAA0B,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cA2GA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAM,CACjCD,EAAE,KAAMA,EAAE,MAAO,EAAIC,GAAKH,EAAE,KAAMA,EAAE,MAAO,EAAGC,EAAE,KAAMA,EAAE,MAAO,CAAE,CAClE,CAKAH,GAAO,QAAUC,KClHjB,IAAAK,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cA2GA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAM,CACjC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAqBJ,IAhBAJ,EAAKV,EAAE,MAAO,CAAE,EAChBO,EAAMP,EAAE,QAAS,CAAE,EACnBQ,EAAMP,EAAE,QAAS,CAAE,EACnBQ,EAAMP,EAAE,QAAS,CAAE,EAGnBS,EAAKX,EAAE,OACPY,EAAKX,EAAE,OACPY,EAAKX,EAAE,OAGPE,EAAOJ,EAAE,KACTK,EAAOJ,EAAE,KACTK,EAAOJ,EAAE,KAGHY,EAAK,EAAGA,EAAKJ,EAAII,IACtBR,EAAMO,CAAG,EAAIV,GAAKC,EAAMO,CAAG,EAAGN,EAAMO,CAAG,CAAE,EACzCD,GAAMJ,EACNK,GAAMJ,EACNK,GAAMJ,CAER,CAKAX,GAAO,QAAUC,KCtJjB,IAAAgB,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cA4GA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAYC,EAAM,CAC7C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyCJ,IApCAV,EAAKd,EAAE,MACPiB,EAAKjB,EAAE,QACPkB,EAAKjB,EAAE,QACPkB,EAAKjB,EAAE,QACFC,IAEJY,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXN,EAAMS,EAAI,CAAE,EACZR,EAAMQ,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBP,EAAMQ,EAAI,CAAE,EACZP,EAAMO,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBN,EAAMO,EAAI,CAAE,EACZN,EAAMM,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,IAGzBJ,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXN,EAAMS,EAAI,CAAE,EACZR,EAAMQ,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBP,EAAMQ,EAAI,CAAE,EACZP,EAAMO,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBN,EAAMO,EAAI,CAAE,EACZN,EAAMM,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,GAG1BC,EAAKpB,EAAE,OACPqB,EAAKpB,EAAE,OACPqB,EAAKpB,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGHsB,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IACtBhB,EAAMe,CAAG,EAAIlB,EAAKC,EAAMe,CAAG,EAAGd,EAAMe,CAAG,CAAE,EACzCD,GAAMZ,EACNa,GAAMX,EACNY,GAAMV,EAEPQ,GAAMX,EACNY,GAAMV,EACNW,GAAMT,CACP,CACD,CAKAf,GAAO,QAAUC,KCzLjB,IAAA0B,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cA4GA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAYC,EAAM,CAC7C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAiDJ,IA5CAZ,EAAKjB,EAAE,MACPqB,EAAKrB,EAAE,QACPsB,EAAKrB,EAAE,QACPsB,EAAKrB,EAAE,QACFC,IAEJe,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXT,EAAMa,EAAI,CAAE,EACZZ,EAAMY,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBV,EAAMW,EAAI,CAAE,EACZV,EAAMU,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBR,EAAMS,EAAI,CAAE,EACZR,EAAMQ,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBP,EAAMO,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,IAGzBL,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXT,EAAMa,EAAI,CAAE,EACZZ,EAAMY,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBV,EAAMW,EAAI,CAAE,EACZV,EAAMU,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBR,EAAMS,EAAI,CAAE,EACZR,EAAMQ,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBP,EAAMO,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,GAG1BC,EAAKxB,EAAE,OACPyB,EAAKxB,EAAE,OACPyB,EAAKxB,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGH2B,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IACtBpB,EAAMmB,CAAG,EAAItB,EAAKC,EAAMmB,CAAG,EAAGlB,EAAMmB,CAAG,CAAE,EACzCD,GAAMhB,EACNiB,GAAMd,EACNe,GAAMZ,EAEPU,GAAMf,EACNgB,GAAMb,EACNc,GAAMX,CACP,CACAS,GAAMd,EACNe,GAAMZ,EACNa,GAAMV,CACP,CACD,CAKAlB,GAAO,QAAUC,KC3MjB,IAAA+B,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cA4GA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAYC,EAAM,CAC7C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyDJ,IApDAd,EAAKpB,EAAE,MACPyB,EAAKzB,EAAE,QACP0B,EAAKzB,EAAE,QACP0B,EAAKzB,EAAE,QACFC,IAEJkB,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXZ,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBb,EAAMc,EAAI,CAAE,EACZb,EAAMa,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBV,EAAMW,EAAI,CAAE,EACZV,EAAMU,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBR,EAAMQ,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,IAGzBN,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXZ,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBb,EAAMc,EAAI,CAAE,EACZb,EAAMa,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBV,EAAMW,EAAI,CAAE,EACZV,EAAMU,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBR,EAAMQ,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,GAG1BC,EAAK5B,EAAE,OACP6B,EAAK5B,EAAE,OACP6B,EAAK5B,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGHgC,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IACtBxB,EAAMuB,CAAG,EAAI1B,EAAKC,EAAMuB,CAAG,EAAGtB,EAAMuB,CAAG,CAAE,EACzCD,GAAMpB,EACNqB,GAAMjB,EACNkB,GAAMd,EAEPY,GAAMnB,EACNoB,GAAMhB,EACNiB,GAAMb,CACP,CACAW,GAAMlB,EACNmB,GAAMf,EACNgB,GAAMZ,CACP,CACAU,GAAMjB,EACNkB,GAAMd,EACNe,GAAMX,CACP,CACD,CAKArB,GAAO,QAAUC,KC7NjB,IAAAoC,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cA8GA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAYC,EAAM,CAC7C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAiEJ,IA5DAhB,EAAKvB,EAAE,MACP6B,EAAK7B,EAAE,QACP8B,EAAK7B,EAAE,QACP8B,EAAK7B,EAAE,QACFC,IAEJqB,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXf,EAAMqB,EAAI,CAAE,EACZpB,EAAMoB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBhB,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBZ,EAAMa,EAAI,CAAE,EACZZ,EAAMY,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,IAGzBP,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXf,EAAMqB,EAAI,CAAE,EACZpB,EAAMoB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBhB,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBZ,EAAMa,EAAI,CAAE,EACZZ,EAAMY,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,GAG1BC,EAAKhC,EAAE,OACPiC,EAAKhC,EAAE,OACPiC,EAAKhC,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGHqC,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IACtB5B,EAAM2B,CAAG,EAAI9B,EAAKC,EAAM2B,CAAG,EAAG1B,EAAM2B,CAAG,CAAE,EACzCD,GAAMxB,EACNyB,GAAMpB,EACNqB,GAAMhB,EAEPc,GAAMvB,EACNwB,GAAMnB,EACNoB,GAAMf,CACP,CACAa,GAAMtB,EACNuB,GAAMlB,EACNmB,GAAMd,CACP,CACAY,GAAMrB,EACNsB,GAAMjB,EACNkB,GAAMb,CACP,CACAW,GAAMpB,EACNqB,GAAMhB,EACNiB,GAAMZ,CACP,CACD,CAKAxB,GAAO,QAAUC,KCjPjB,IAAAyC,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cA8GA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAYC,EAAM,CAC7C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyEJ,IApEAlB,EAAK1B,EAAE,MACPiC,EAAKjC,EAAE,QACPkC,EAAKjC,EAAE,QACPkC,EAAKjC,EAAE,QACFC,IAEJwB,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXlB,EAAMyB,EAAI,CAAE,EACZxB,EAAMwB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBtB,EAAMsB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBpB,EAAMoB,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBnB,EAAMoB,EAAI,CAAE,EACZnB,EAAMmB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBd,EAAMe,EAAI,CAAE,EACZd,EAAMc,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,IAGzBR,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXlB,EAAMyB,EAAI,CAAE,EACZxB,EAAMwB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBtB,EAAMsB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBpB,EAAMoB,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBnB,EAAMoB,EAAI,CAAE,EACZnB,EAAMmB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBd,EAAMe,EAAI,CAAE,EACZd,EAAMc,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,GAG1BC,EAAKpC,EAAE,OACPqC,EAAKpC,EAAE,OACPqC,EAAKpC,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGH0C,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IACtBhC,EAAM+B,CAAG,EAAIlC,EAAKC,EAAM+B,CAAG,EAAG9B,EAAM+B,CAAG,CAAE,EACzCD,GAAM5B,EACN6B,GAAMvB,EACNwB,GAAMlB,EAEPgB,GAAM3B,EACN4B,GAAMtB,EACNuB,GAAMjB,CACP,CACAe,GAAM1B,EACN2B,GAAMrB,EACNsB,GAAMhB,CACP,CACAc,GAAMzB,EACN0B,GAAMpB,EACNqB,GAAMf,CACP,CACAa,GAAMxB,EACNyB,GAAMnB,EACNoB,GAAMd,CACP,CACAY,GAAMvB,EACNwB,GAAMlB,EACNmB,GAAMb,CACP,CACD,CAKA3B,GAAO,QAAUC,KCnQjB,IAAA8C,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cA8GA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAYC,EAAM,CAC7C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAiFJ,IA5EApB,EAAK7B,EAAE,MACPqC,EAAKrC,EAAE,QACPsC,EAAKrC,EAAE,QACPsC,EAAKrC,EAAE,QACFC,IAEJ2B,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXrB,EAAM6B,EAAI,CAAE,EACZ5B,EAAM4B,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzB3B,EAAM2B,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzB1B,EAAM0B,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBzB,EAAMyB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBxB,EAAMwB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBtB,EAAMuB,EAAI,CAAE,EACZtB,EAAMsB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBpB,EAAMoB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBhB,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,IAGzBT,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXrB,EAAM6B,EAAI,CAAE,EACZ5B,EAAM4B,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzB3B,EAAM2B,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzB1B,EAAM0B,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBzB,EAAMyB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBxB,EAAMwB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBtB,EAAMuB,EAAI,CAAE,EACZtB,EAAMsB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBpB,EAAMoB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBhB,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,GAG1BC,EAAKxC,EAAE,OACPyC,EAAKxC,EAAE,OACPyC,EAAKxC,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGH+C,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IACtBpC,EAAMmC,CAAG,EAAItC,EAAKC,EAAMmC,CAAG,EAAGlC,EAAMmC,CAAG,CAAE,EACzCD,GAAMhC,EACNiC,GAAM1B,EACN2B,GAAMpB,EAEPkB,GAAM/B,EACNgC,GAAMzB,EACN0B,GAAMnB,CACP,CACAiB,GAAM9B,EACN+B,GAAMxB,EACNyB,GAAMlB,CACP,CACAgB,GAAM7B,EACN8B,GAAMvB,EACNwB,GAAMjB,CACP,CACAe,GAAM5B,EACN6B,GAAMtB,EACNuB,GAAMhB,CACP,CACAc,GAAM3B,EACN4B,GAAMrB,EACNsB,GAAMf,CACP,CACAa,GAAM1B,EACN2B,GAAMpB,EACNqB,GAAMd,CACP,CACD,CAKA9B,GAAO,QAAUC,KCrRjB,IAAAmD,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cA8GA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAYC,EAAM,CAC7C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyFJ,IApFAtB,EAAKhC,EAAE,MACPyC,EAAKzC,EAAE,QACP0C,EAAKzC,EAAE,QACP0C,EAAKzC,EAAE,QACFC,IAEJ8B,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXxB,EAAMiC,EAAI,CAAE,EACZhC,EAAMgC,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzB/B,EAAM+B,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzB9B,EAAM8B,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzB7B,EAAM6B,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzB5B,EAAM4B,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzB3B,EAAM2B,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzB1B,EAAM0B,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBzB,EAAM0B,EAAI,CAAE,EACZzB,EAAMyB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBxB,EAAMwB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBtB,EAAMsB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBpB,EAAMoB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBlB,EAAMmB,EAAI,CAAE,EACZlB,EAAMkB,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,IAGzBV,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXxB,EAAMiC,EAAI,CAAE,EACZhC,EAAMgC,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzB/B,EAAM+B,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzB9B,EAAM8B,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzB7B,EAAM6B,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzB5B,EAAM4B,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzB3B,EAAM2B,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzB1B,EAAM0B,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzBzB,EAAM0B,EAAI,CAAE,EACZzB,EAAMyB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBxB,EAAMwB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBtB,EAAMsB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBpB,EAAMoB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBlB,EAAMmB,EAAI,CAAE,EACZlB,EAAMkB,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,GAG1BC,EAAK5C,EAAE,OACP6C,EAAK5C,EAAE,OACP6C,EAAK5C,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGHoD,EAAK,EAAGA,EAAKd,EAAIc,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKd,EAAIc,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKd,EAAIc,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKd,EAAIc,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKd,EAAIc,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKd,EAAIc,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKd,EAAIc,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKd,EAAIc,IACtBxC,EAAMuC,CAAG,EAAI1C,EAAKC,EAAMuC,CAAG,EAAGtC,EAAMuC,CAAG,CAAE,EACzCD,GAAMpC,EACNqC,GAAM7B,EACN8B,GAAMtB,EAEPoB,GAAMnC,EACNoC,GAAM5B,EACN6B,GAAMrB,CACP,CACAmB,GAAMlC,EACNmC,GAAM3B,EACN4B,GAAMpB,CACP,CACAkB,GAAMjC,EACNkC,GAAM1B,EACN2B,GAAMnB,CACP,CACAiB,GAAMhC,EACNiC,GAAMzB,EACN0B,GAAMlB,CACP,CACAgB,GAAM/B,EACNgC,GAAMxB,EACNyB,GAAMjB,CACP,CACAe,GAAM9B,EACN+B,GAAMvB,EACNwB,GAAMhB,CACP,CACAc,GAAM7B,EACN8B,GAAMtB,EACNuB,GAAMf,CACP,CACD,CAKAjC,GAAO,QAAUC,KCvSjB,IAAAwD,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cA8GA,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAYC,EAAM,CAC7C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GAiGJ,IA5FAxB,EAAKnC,EAAE,MACP6C,EAAK7C,EAAE,QACP8C,EAAK7C,EAAE,QACP8C,EAAK7C,EAAE,QACFC,IAEJiC,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACX3B,EAAMqC,EAAI,CAAE,EACZpC,EAAMoC,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBnC,EAAMmC,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBlC,EAAMkC,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBjC,EAAMiC,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBhC,EAAMgC,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzB/B,EAAM+B,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzB9B,EAAM8B,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzB7B,EAAM6B,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzB5B,EAAM6B,EAAI,CAAE,EACZ5B,EAAM4B,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzB3B,EAAM2B,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzB1B,EAAM0B,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBzB,EAAMyB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBxB,EAAMwB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBtB,EAAMsB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBpB,EAAMqB,EAAI,CAAE,EACZpB,EAAMoB,EAAI,CAAE,EAAMX,EAAGW,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,IAGzBX,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACX3B,EAAMqC,EAAI,CAAE,EACZpC,EAAMoC,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBnC,EAAMmC,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBlC,EAAMkC,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBjC,EAAMiC,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBhC,EAAMgC,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzB/B,EAAM+B,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzB9B,EAAM8B,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzB7B,EAAM6B,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzB5B,EAAM6B,EAAI,CAAE,EACZ5B,EAAM4B,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzB3B,EAAM2B,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzB1B,EAAM0B,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBzB,EAAMyB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBxB,EAAMwB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBtB,EAAMsB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBpB,EAAMqB,EAAI,CAAE,EACZpB,EAAMoB,EAAI,CAAE,EAAMX,EAAGW,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,GAG1BC,EAAKhD,EAAE,OACPiD,EAAKhD,EAAE,OACPiD,EAAKhD,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGHyD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKf,EAAIe,KAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKf,EAAIe,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKf,EAAIe,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKf,EAAIe,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKf,EAAIe,IACtB5C,EAAM2C,CAAG,EAAI9C,EAAKC,EAAM2C,CAAG,EAAG1C,EAAM2C,CAAG,CAAE,EACzCD,GAAMxC,EACNyC,GAAMhC,EACNiC,GAAMxB,EAEPsB,GAAMvC,EACNwC,GAAM/B,EACNgC,GAAMvB,CACP,CACAqB,GAAMtC,EACNuC,GAAM9B,EACN+B,GAAMtB,CACP,CACAoB,GAAMrC,EACNsC,GAAM7B,EACN8B,GAAMrB,CACP,CACAmB,GAAMpC,EACNqC,GAAM5B,EACN6B,GAAMpB,CACP,CACAkB,GAAMnC,EACNoC,GAAM3B,EACN4B,GAAMnB,CACP,CACAiB,GAAMlC,EACNmC,GAAM1B,EACN2B,GAAMlB,CACP,CACAgB,GAAMjC,EACNkC,GAAMzB,EACN0B,GAAMjB,CACP,CACAe,GAAMhC,EACNiC,GAAMxB,EACNyB,GAAMhB,CACP,CACD,CAKApC,GAAO,QAAUC,KCzTjB,IAAA6D,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cA8GA,SAASC,GAAWC,EAAGC,EAAGC,EAAGC,GAAYC,EAAM,CAC9C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAyGJ,IApGA1B,EAAKtC,EAAE,MACPiD,EAAKjD,EAAE,QACPkD,EAAKjD,EAAE,QACPkD,EAAKjD,EAAE,QACFC,IAEJoC,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXU,EAAKV,EAAI,CAAE,EACX9B,EAAMyC,EAAI,CAAE,EACZxC,EAAMwC,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBvC,EAAMuC,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBtC,EAAMsC,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBrC,EAAMqC,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBpC,EAAMoC,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBnC,EAAMmC,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBlC,EAAMkC,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBjC,EAAMiC,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBhC,EAAMgC,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzB/B,EAAMgC,EAAI,CAAE,EACZ/B,EAAM+B,EAAI,CAAE,EAAMX,EAAGW,EAAG,CAAC,EACzB9B,EAAM8B,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzB7B,EAAM6B,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzB5B,EAAM4B,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzB3B,EAAM2B,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzB1B,EAAM0B,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBzB,EAAMyB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBxB,EAAMwB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBtB,EAAMuB,EAAI,CAAE,EACZtB,EAAMsB,EAAI,CAAE,EAAMZ,EAAGY,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAMX,EAAGW,EAAG,CAAC,EACzBpB,EAAMoB,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,IAGzBZ,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXU,EAAKV,EAAI,CAAE,EACX9B,EAAMyC,EAAI,CAAE,EACZxC,EAAMwC,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBvC,EAAMuC,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBtC,EAAMsC,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBrC,EAAMqC,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBpC,EAAMoC,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBnC,EAAMmC,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBlC,EAAMkC,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBjC,EAAMiC,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBhC,EAAMgC,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,EACzB/B,EAAMgC,EAAI,CAAE,EACZ/B,EAAM+B,EAAI,CAAE,EAAMX,EAAGW,EAAG,CAAC,EACzB9B,EAAM8B,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzB7B,EAAM6B,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzB5B,EAAM4B,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzB3B,EAAM2B,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzB1B,EAAM0B,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBzB,EAAMyB,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBxB,EAAMwB,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBvB,EAAMuB,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBtB,EAAMuB,EAAI,CAAE,EACZtB,EAAMsB,EAAI,CAAE,EAAMZ,EAAGY,EAAG,CAAC,EACzBrB,EAAMqB,EAAI,CAAE,EAAMX,EAAGW,EAAG,CAAC,EACzBpB,EAAMoB,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,GAG1BC,EAAKpD,EAAE,OACPqD,EAAKpD,EAAE,OACPqD,EAAKpD,EAAE,OAGPG,EAAOL,EAAE,KACTM,EAAOL,EAAE,KACTM,EAAOL,EAAE,KAGH8D,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKhB,EAAIgB,KACtBhD,EAAM+C,CAAG,EAAIlD,EAAKC,EAAM+C,CAAG,EAAG9C,EAAM+C,CAAG,CAAE,EACzCD,GAAM5C,EACN6C,GAAMnC,EACNoC,GAAM1B,EAEPwB,GAAM3C,EACN4C,GAAMlC,EACNmC,GAAMzB,CACP,CACAuB,GAAM1C,EACN2C,GAAMjC,EACNkC,GAAMxB,CACP,CACAsB,GAAMzC,EACN0C,GAAMhC,EACNiC,GAAMvB,CACP,CACAqB,GAAMxC,EACNyC,GAAM/B,EACNgC,GAAMtB,CACP,CACAoB,GAAMvC,EACNwC,GAAM9B,EACN+B,GAAMrB,CACP,CACAmB,GAAMtC,EACNuC,GAAM7B,EACN8B,GAAMpB,CACP,CACAkB,GAAMrC,EACNsC,GAAM5B,EACN6B,GAAMnB,CACP,CACAiB,GAAMpC,EACNqC,GAAM3B,EACN4B,GAAMlB,CACP,CACAgB,GAAMnC,EACNoC,GAAM1B,EACN2B,GAAMjB,CACP,CACD,CAKAvC,GAAO,QAAUC,KC3UjB,IAAAkE,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,QAAS,4BAA6B,EAC9CC,GAAY,QAAS,gCAAiC,EAKtDC,GAAO,QA0FX,SAASC,GAAUC,EAAGC,EAAGC,EAAGC,GAAM,CACjC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACA,EA4BJ,IA1BAT,EAAKX,EAAE,MAGPU,EAAMd,GAAOe,CAAG,EAGhBP,EAAOJ,EAAE,KACTK,EAAOJ,EAAE,KACTK,EAAOJ,EAAE,KAGTU,EAAKZ,EAAE,QACPa,EAAKZ,EAAE,QACPa,EAAKZ,EAAE,QAGPa,EAAKf,EAAE,OACPgB,EAAKf,EAAE,OACPgB,EAAKf,EAAE,OAGPK,EAAOP,EAAE,MACTQ,EAAOP,EAAE,MACTQ,EAAOP,EAAE,MAGH,EAAI,EAAG,EAAIQ,EAAK,IACrBQ,EAAKrB,GAAWc,EAAIC,EAAIG,EAAIR,EAAM,EAAGT,EAAK,EAC1CqB,EAAKtB,GAAWc,EAAIE,EAAIG,EAAIR,EAAM,EAAGV,EAAK,EAC1CsB,EAAKvB,GAAWc,EAAIG,EAAIG,EAAIR,EAAM,EAAGX,EAAK,EAC1CQ,EAAMc,CAAG,EAAIjB,GAAKC,EAAMc,CAAG,EAAGb,EAAMc,CAAG,CAAE,CAE3C,CAKAxB,GAAO,QAAUI,KC/KjB,IAAAsB,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAiB,QAAS,sCAAuC,EACjEC,GAAwB,QAAS,+CAAgD,EACjFC,GAAiB,QAAS,yCAA0C,EACpEC,GAAgB,QAAS,oCAAqC,EAC9DC,GAAe,QAAS,oCAAqC,EAC7DC,GAAS,QAAS,uBAAwB,EAC1CC,GAA0B,KAC1BC,GAA0B,KAC1BC,GAA0B,KAC1BC,GAA0B,KAC1BC,GAA0B,KAC1BC,GAA0B,KAC1BC,GAA0B,KAC1BC,GAA0B,KAC1BC,GAA2B,KAC3BC,GAAkB,KAClBC,GAAkB,KAClBC,GAAkB,KAClBC,GAAkB,KAClBC,GAAkB,KAClBC,GAAkB,KAClBC,GAAkB,KAClBC,GAAkB,KAClBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAoB,KACpBC,GAAmB,KACnBC,GAAW,KACXC,GAAW,KACXC,GAAW,KACXC,GAAW,KACXC,GAAW,KACXC,GAAW,KACXC,GAAW,KACXC,GAAW,KACXC,GAAW,KACXC,GAAW,KACXC,GAAY,KACZC,GAAW,KAKXC,GAAS,CACZZ,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,EACD,EACIG,GAAkB,CACrBzB,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,EACD,EACIgB,GAAiB,CACpBnC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,EACD,EACI4B,GAA0B,CAC7B7C,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,EACD,EACIsC,GAAWJ,GAAO,OAAS,EAc/B,SAASK,GAAcC,EAAGC,EAAGC,EAAI,CAChC,OAAOpD,GAAc,CAAEkD,EAAGC,EAAGC,CAAE,EAAG,mBAAoB,EAAK,CAC5D,CA+DA,SAASC,GAAQC,EAAQC,EAAM,CAC9B,IAAIC,EACAC,GACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAxB,EACAC,EACAC,EACAuB,EACAC,EAYJ,GATA1B,EAAIpD,GAAgBwD,EAAQ,CAAE,CAAE,EAChCH,EAAIrD,GAAgBwD,EAAQ,CAAE,CAAE,EAChCF,EAAItD,GAAgBwD,EAAQ,CAAE,CAAE,EAGhCM,EAAMV,EAAE,MACRW,EAAMV,EAAE,MACRW,EAAMV,EAAE,MACRI,EAAQI,EAAI,OACPJ,IAAUK,EAAI,QAAUL,IAAUM,EAAI,OAC1C,MAAM,IAAI,MAAO7D,GAAQ,uIAAwIuD,EAAOK,EAAI,OAAQC,EAAI,MAAO,CAAE,EAGlM,GAAKN,IAAU,EACd,OAAKP,GAAcC,EAAGC,EAAGC,CAAE,EACnBP,GAAiBW,CAAM,EAAGN,EAAGC,EAAGC,EAAGG,CAAI,EAExCX,GAAQY,CAAM,EAAGN,EAAGC,EAAGC,EAAGG,CAAI,EAKtC,IAFAW,EAAM,EACNQ,EAAK,EACCE,EAAI,EAAGA,EAAIpB,EAAOoB,IAAM,CAE7B,GADAD,EAAIf,EAAKgB,CAAE,EACND,IAAMd,EAAKe,CAAE,GAAKD,IAAMb,EAAKc,CAAE,EACnC,MAAM,IAAI,MAAO,qDAAsD,EAGxEV,GAAOS,EAGFA,IAAM,IACVD,GAAM,EAER,CAEA,GAAKR,IAAQ,EAIb,IAAKV,IAAU,EACd,OAAKP,GAAcC,EAAGC,EAAGC,CAAE,EACnBP,GAAiBW,CAAM,EAAGN,EAAGC,EAAGC,EAAGG,CAAI,EAExCX,GAAQY,CAAM,EAAGN,EAAGC,EAAGC,EAAGG,CAAI,EAOtC,GALAa,EAAKlB,EAAE,QACPmB,EAAKlB,EAAE,QACPmB,EAAKlB,EAAE,QAGFsB,IAAOlB,EAAM,EAAI,CAErB,IAAMoB,EAAI,EAAGA,EAAIpB,GACXI,EAAKgB,CAAE,IAAM,EADKA,IACvB,CAUD,OANA1B,EAAE,MAAQ,CAAEU,EAAIgB,CAAC,CAAE,EACnBzB,EAAE,MAAQD,EAAE,MACZE,EAAE,MAAQF,EAAE,MACZA,EAAE,QAAU,CAAEkB,EAAGQ,CAAC,CAAE,EACpBzB,EAAE,QAAU,CAAEkB,EAAGO,CAAC,CAAE,EACpBxB,EAAE,QAAU,CAAEkB,EAAGM,CAAC,CAAE,EACf3B,GAAcC,EAAGC,EAAGC,CAAE,EACnBP,GAAiB,CAAE,EAAGK,EAAGC,EAAGC,EAAGG,CAAI,EAEpCX,GAAQ,CAAE,EAAGM,EAAGC,EAAGC,EAAGG,CAAI,CAClC,CAOA,GANAQ,EAAMnE,GAAgBwE,CAAG,EACzBJ,EAAMpE,GAAgByE,CAAG,EACzBJ,EAAMrE,GAAgB0E,CAAG,EAGzBH,EAAMpE,GAAeqE,CAAG,EACnBL,IAAQ,GAAKC,IAAQ,GAAKC,IAAQ,GAAKE,IAAQpE,GAAesE,CAAG,GAAKF,IAAQpE,GAAeuE,CAAG,EAAI,CAOxG,GALAb,GAAO5D,GAAuB+D,EAAKQ,EAAIlB,EAAE,MAAO,EAChDQ,EAAO7D,GAAuBgE,EAAKQ,EAAIlB,EAAE,MAAO,EAChDQ,EAAO9D,GAAuBiE,EAAKQ,EAAIlB,EAAE,MAAO,EAI/Cc,IAAUT,GAAK,CAAC,EAAEA,GAAK,CAAC,EAAE,GAC1BS,IAAUR,EAAK,CAAC,EAAEA,EAAK,CAAC,EAAE,GAC1BQ,IAAUP,EAAK,CAAC,EAAEA,EAAK,CAAC,EAAE,EA2B1B,OAxBKI,IAAQ,EACZQ,EAAKd,GAAM,CAAE,EAEbc,EAAKd,GAAM,CAAE,EAETO,IAAQ,EACZQ,EAAKd,EAAM,CAAE,EAEbc,EAAKd,EAAM,CAAE,EAETO,IAAQ,EACZQ,EAAKd,EAAM,CAAE,EAEbc,EAAKd,EAAM,CAAE,EAEdT,EAAE,MAAQ,CAAEgB,CAAI,EAChBf,EAAE,MAAQD,EAAE,MACZE,EAAE,MAAQF,EAAE,MACZA,EAAE,QAAU,CAAEa,CAAI,EAClBZ,EAAE,QAAU,CAAEa,CAAI,EAClBZ,EAAE,QAAU,CAAEa,CAAI,EAClBf,EAAE,OAASqB,EACXpB,EAAE,OAASqB,EACXpB,EAAE,OAASqB,EACNxB,GAAcC,EAAGC,EAAGC,CAAE,EACnBP,GAAiB,CAAE,EAAGK,EAAGC,EAAGC,EAAGG,CAAI,EAEpCX,GAAQ,CAAE,EAAGM,EAAGC,EAAGC,EAAGG,CAAI,EAKlC,GAAKC,GAASR,GAEb,OAAKC,GAAcC,EAAGC,EAAGC,CAAE,EACnBP,GAAiBW,CAAM,EAAGN,EAAGC,EAAGC,EAAGe,IAAQ,EAAGZ,CAAI,EAEnDX,GAAQY,CAAM,EAAGN,EAAGC,EAAGC,EAAGe,IAAQ,EAAGZ,CAAI,CAGlD,CAIA,GAAKC,GAASR,GACb,OAAKC,GAAcC,EAAGC,EAAGC,CAAE,EACnBL,GAAyBS,EAAM,CAAE,EAAGN,EAAGC,EAAGC,EAAGG,CAAI,EAElDT,GAAgBU,EAAM,CAAE,EAAGN,EAAGC,EAAGC,EAAGG,CAAI,EAGhD,GAAKN,GAAcC,EAAGC,EAAGC,CAAE,EAC1B,OAAOrB,GAAkBmB,EAAGC,EAAGC,EAAGG,CAAI,EAEvCZ,GAAUO,EAAGC,EAAGC,EAAGG,CAAI,EACxB,CAKA5D,GAAO,QAAU0D,KCrTjB,IAAIwB,GAAO,KAKX,OAAO,QAAUA", - "names": ["require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedbinary2d", "x", "y", "z", "fcn", "bsize", "xbuf", "ybuf", "zbuf", "xget", "yget", "zset", "dx0", "dx1", "dy0", "dy1", "dz0", "dz1", "ox1", "oy1", "oz1", "sh", "s0", "s1", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "i0", "i1", "j0", "j1", "o", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedbinary3d", "x", "y", "z", "fcn", "bsize", "xbuf", "ybuf", "zbuf", "xget", "yget", "zset", "dx0", "dx1", "dx2", "dy0", "dy1", "dy2", "dz0", "dz1", "dz2", "ox1", "ox2", "oy1", "oy2", "oz1", "oz2", "sh", "s0", "s1", "s2", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "i0", "i1", "i2", "j0", "j1", "j2", "o", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedbinary4d", "x", "y", "z", "fcn", "bsize", "xbuf", "ybuf", "zbuf", "xget", "yget", "zset", "dx0", "dx1", "dx2", "dx3", "dy0", "dy1", "dy2", "dy3", "dz0", "dz1", "dz2", "dz3", "ox1", "ox2", "ox3", "oy1", "oy2", "oy3", "oz1", "oz2", "oz3", "sh", "s0", "s1", "s2", "s3", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "j0", "j1", "j2", "j3", "o", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedbinary5d", "x", "y", "z", "fcn", "bsize", "xbuf", "ybuf", "zbuf", "xget", "yget", "zset", "dx0", "dx1", "dx2", "dx3", "dx4", "dy0", "dy1", "dy2", "dy3", "dy4", "dz0", "dz1", "dz2", "dz3", "dz4", "ox1", "ox2", "ox3", "ox4", "oy1", "oy2", "oy3", "oy4", "oz1", "oz2", "oz3", "oz4", "sh", "s0", "s1", "s2", "s3", "s4", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "j0", "j1", "j2", "j3", "j4", "o", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedbinary6d", "x", "y", "z", "fcn", "bsize", "xbuf", "ybuf", "zbuf", "xget", "yget", "zset", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "ox1", "ox2", "ox3", "ox4", "ox5", "oy1", "oy2", "oy3", "oy4", "oy5", "oz1", "oz2", "oz3", "oz4", "oz5", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "j0", "j1", "j2", "j3", "j4", "j5", "o", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedbinary7d", "x", "y", "z", "fcn", "bsize", "xbuf", "ybuf", "zbuf", "xget", "yget", "zset", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dy6", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "dz6", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "oy1", "oy2", "oy3", "oy4", "oy5", "oy6", "oz1", "oz2", "oz3", "oz4", "oz5", "oz6", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "o", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedbinary8d", "x", "y", "z", "fcn", "bsize", "xbuf", "ybuf", "zbuf", "xget", "yget", "zset", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dy6", "dy7", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "dz6", "dz7", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "ox7", "oy1", "oy2", "oy3", "oy4", "oy5", "oy6", "oy7", "oz1", "oz2", "oz3", "oz4", "oz5", "oz6", "oz7", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "o", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedbinary9d", "x", "y", "z", "fcn", "bsize", "xbuf", "ybuf", "zbuf", "xget", "yget", "zset", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dy6", "dy7", "dy8", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "dz6", "dz7", "dz8", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "ox7", "ox8", "oy1", "oy2", "oy3", "oy4", "oy5", "oy6", "oy7", "oy8", "oz1", "oz2", "oz3", "oz4", "oz5", "oz6", "oz7", "oz8", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "s8", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "j8", "o", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedbinary10d", "x", "y", "z", "fcn", "bsize", "xbuf", "ybuf", "zbuf", "xget", "yget", "zset", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "dx9", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dy6", "dy7", "dy8", "dy9", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "dz6", "dz7", "dz8", "dz9", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "ox7", "ox8", "ox9", "oy1", "oy2", "oy3", "oy4", "oy5", "oy6", "oy7", "oy8", "oy9", "oz1", "oz2", "oz3", "oz4", "oz5", "oz6", "oz7", "oz8", "oz9", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "s8", "s9", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "i9", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "j8", "j9", "o", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedbinary2d", "x", "y", "z", "fcn", "bsize", "xbuf", "ybuf", "zbuf", "dx0", "dx1", "dy0", "dy1", "dz0", "dz1", "ox1", "oy1", "oz1", "sh", "s0", "s1", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "i0", "i1", "j0", "j1", "o", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedbinary3d", "x", "y", "z", "fcn", "bsize", "xbuf", "ybuf", "zbuf", "dx0", "dx1", "dx2", "dy0", "dy1", "dy2", "dz0", "dz1", "dz2", "ox1", "ox2", "oy1", "oy2", "oz1", "oz2", "sh", "s0", "s1", "s2", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "i0", "i1", "i2", "j0", "j1", "j2", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedbinary4d", "x", "y", "z", "fcn", "bsize", "xbuf", "ybuf", "zbuf", "dx0", "dx1", "dx2", "dx3", "dy0", "dy1", "dy2", "dy3", "dz0", "dz1", "dz2", "dz3", "ox1", "ox2", "ox3", "oy1", "oy2", "oy3", "oz1", "oz2", "oz3", "sh", "s0", "s1", "s2", "s3", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "j0", "j1", "j2", "j3", "o", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedbinary5d", "x", "y", "z", "fcn", "bsize", "xbuf", "ybuf", "zbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dy0", "dy1", "dy2", "dy3", "dy4", "dz0", "dz1", "dz2", "dz3", "dz4", "ox1", "ox2", "ox3", "ox4", "oy1", "oy2", "oy3", "oy4", "oz1", "oz2", "oz3", "oz4", "sh", "s0", "s1", "s2", "s3", "s4", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "j0", "j1", "j2", "j3", "j4", "o", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedbinary6d", "x", "y", "z", "fcn", "bsize", "xbuf", "ybuf", "zbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "ox1", "ox2", "ox3", "ox4", "ox5", "oy1", "oy2", "oy3", "oy4", "oy5", "oz1", "oz2", "oz3", "oz4", "oz5", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "j0", "j1", "j2", "j3", "j4", "j5", "o", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedbinary7d", "x", "y", "z", "fcn", "bsize", "xbuf", "ybuf", "zbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dy6", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "dz6", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "oy1", "oy2", "oy3", "oy4", "oy5", "oy6", "oz1", "oz2", "oz3", "oz4", "oz5", "oz6", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "o", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedbinary8d", "x", "y", "z", "fcn", "bsize", "xbuf", "ybuf", "zbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dy6", "dy7", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "dz6", "dz7", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "ox7", "oy1", "oy2", "oy3", "oy4", "oy5", "oy6", "oy7", "oz1", "oz2", "oz3", "oz4", "oz5", "oz6", "oz7", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "o", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedbinary9d", "x", "y", "z", "fcn", "bsize", "xbuf", "ybuf", "zbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dy6", "dy7", "dy8", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "dz6", "dz7", "dz8", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "ox7", "ox8", "oy1", "oy2", "oy3", "oy4", "oy5", "oy6", "oy7", "oy8", "oz1", "oz2", "oz3", "oz4", "oz5", "oz6", "oz7", "oz8", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "s8", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "j8", "o", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedbinary10d", "x", "y", "z", "fcn", "bsize", "xbuf", "ybuf", "zbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "dx9", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dy6", "dy7", "dy8", "dy9", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "dz6", "dz7", "dz8", "dz9", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "ox7", "ox8", "ox9", "oy1", "oy2", "oy3", "oy4", "oy5", "oy6", "oy7", "oy8", "oy9", "oz1", "oz2", "oz3", "oz4", "oz5", "oz6", "oz7", "oz8", "oz9", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "s8", "s9", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "i9", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "j8", "j9", "o", "require_d_accessors", "__commonJSMin", "exports", "module", "binary0d", "x", "y", "z", "fcn", "require_d_accessors", "__commonJSMin", "exports", "module", "binary1d", "x", "y", "z", "fcn", "xbuf", "ybuf", "zbuf", "xget", "yget", "zset", "dx0", "dy0", "dz0", "S0", "ix", "iy", "iz", "i0", "require_d_accessors", "__commonJSMin", "exports", "module", "binary2d", "x", "y", "z", "isRowMajor", "fcn", "xbuf", "ybuf", "zbuf", "xget", "yget", "zset", "dx0", "dx1", "dy0", "dy1", "dz0", "dz1", "sh", "S0", "S1", "sx", "sy", "sz", "ix", "iy", "iz", "i0", "i1", "require_d_accessors", "__commonJSMin", "exports", "module", "binary3d", "x", "y", "z", "isRowMajor", "fcn", "xbuf", "ybuf", "zbuf", "xget", "yget", "zset", "dx0", "dx1", "dx2", "dy0", "dy1", "dy2", "dz0", "dz1", "dz2", "sh", "S0", "S1", "S2", "sx", "sy", "sz", "ix", "iy", "iz", "i0", "i1", "i2", "require_d_accessors", "__commonJSMin", "exports", "module", "binary4d", "x", "y", "z", "isRowMajor", "fcn", "xbuf", "ybuf", "zbuf", "xget", "yget", "zset", "dx0", "dx1", "dx2", "dx3", "dy0", "dy1", "dy2", "dy3", "dz0", "dz1", "dz2", "dz3", "sh", "S0", "S1", "S2", "S3", "sx", "sy", "sz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "require_d_accessors", "__commonJSMin", "exports", "module", "binary5d", "x", "y", "z", "isRowMajor", "fcn", "xbuf", "ybuf", "zbuf", "xget", "yget", "zset", "dx0", "dx1", "dx2", "dx3", "dx4", "dy0", "dy1", "dy2", "dy3", "dy4", "dz0", "dz1", "dz2", "dz3", "dz4", "sh", "S0", "S1", "S2", "S3", "S4", "sx", "sy", "sz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "require_d_accessors", "__commonJSMin", "exports", "module", "binary6d", "x", "y", "z", "isRowMajor", "fcn", "xbuf", "ybuf", "zbuf", "xget", "yget", "zset", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "sx", "sy", "sz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "require_d_accessors", "__commonJSMin", "exports", "module", "binary7d", "x", "y", "z", "isRowMajor", "fcn", "xbuf", "ybuf", "zbuf", "xget", "yget", "zset", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dy6", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "dz6", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "sx", "sy", "sz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "require_d_accessors", "__commonJSMin", "exports", "module", "binary8d", "x", "y", "z", "isRowMajor", "fcn", "xbuf", "ybuf", "zbuf", "xget", "yget", "zset", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dy6", "dy7", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "dz6", "dz7", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "sx", "sy", "sz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "require_d_accessors", "__commonJSMin", "exports", "module", "binary9d", "x", "y", "z", "isRowMajor", "fcn", "xbuf", "ybuf", "zbuf", "xget", "yget", "zset", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dy6", "dy7", "dy8", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "dz6", "dz7", "dz8", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "S8", "sx", "sy", "sz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "require_d_accessors", "__commonJSMin", "exports", "module", "binary10d", "x", "y", "z", "isRowMajor", "fcn", "xbuf", "ybuf", "zbuf", "xget", "yget", "zset", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "dx9", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dy6", "dy7", "dy8", "dy9", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "dz6", "dz7", "dz8", "dz9", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "S8", "S9", "sx", "sy", "sz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "i9", "require_nd_accessors", "__commonJSMin", "exports", "module", "numel", "vind2bind", "MODE", "binarynd", "x", "y", "z", "fcn", "xbuf", "ybuf", "zbuf", "ordx", "ordy", "ordz", "xget", "yget", "zset", "len", "sh", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "i", "require_d", "__commonJSMin", "exports", "module", "binary0d", "x", "y", "z", "fcn", "require_d", "__commonJSMin", "exports", "module", "binary1d", "x", "y", "z", "fcn", "xbuf", "ybuf", "zbuf", "dx0", "dy0", "dz0", "S0", "ix", "iy", "iz", "i0", "require_d", "__commonJSMin", "exports", "module", "binary2d", "x", "y", "z", "isRowMajor", "fcn", "xbuf", "ybuf", "zbuf", "dx0", "dx1", "dy0", "dy1", "dz0", "dz1", "sh", "S0", "S1", "sx", "sy", "sz", "ix", "iy", "iz", "i0", "i1", "require_d", "__commonJSMin", "exports", "module", "binary3d", "x", "y", "z", "isRowMajor", "fcn", "xbuf", "ybuf", "zbuf", "dx0", "dx1", "dx2", "dy0", "dy1", "dy2", "dz0", "dz1", "dz2", "sh", "S0", "S1", "S2", "sx", "sy", "sz", "ix", "iy", "iz", "i0", "i1", "i2", "require_d", "__commonJSMin", "exports", "module", "binary4d", "x", "y", "z", "isRowMajor", "fcn", "xbuf", "ybuf", "zbuf", "dx0", "dx1", "dx2", "dx3", "dy0", "dy1", "dy2", "dy3", "dz0", "dz1", "dz2", "dz3", "sh", "S0", "S1", "S2", "S3", "sx", "sy", "sz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "require_d", "__commonJSMin", "exports", "module", "binary5d", "x", "y", "z", "isRowMajor", "fcn", "xbuf", "ybuf", "zbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dy0", "dy1", "dy2", "dy3", "dy4", "dz0", "dz1", "dz2", "dz3", "dz4", "sh", "S0", "S1", "S2", "S3", "S4", "sx", "sy", "sz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "require_d", "__commonJSMin", "exports", "module", "binary6d", "x", "y", "z", "isRowMajor", "fcn", "xbuf", "ybuf", "zbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "sx", "sy", "sz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "require_d", "__commonJSMin", "exports", "module", "binary7d", "x", "y", "z", "isRowMajor", "fcn", "xbuf", "ybuf", "zbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dy6", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "dz6", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "sx", "sy", "sz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "require_d", "__commonJSMin", "exports", "module", "binary8d", "x", "y", "z", "isRowMajor", "fcn", "xbuf", "ybuf", "zbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dy6", "dy7", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "dz6", "dz7", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "sx", "sy", "sz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "require_d", "__commonJSMin", "exports", "module", "binary9d", "x", "y", "z", "isRowMajor", "fcn", "xbuf", "ybuf", "zbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dy6", "dy7", "dy8", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "dz6", "dz7", "dz8", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "S8", "sx", "sy", "sz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "require_d", "__commonJSMin", "exports", "module", "binary10d", "x", "y", "z", "isRowMajor", "fcn", "xbuf", "ybuf", "zbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "dx9", "dy0", "dy1", "dy2", "dy3", "dy4", "dy5", "dy6", "dy7", "dy8", "dy9", "dz0", "dz1", "dz2", "dz3", "dz4", "dz5", "dz6", "dz7", "dz8", "dz9", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "S8", "S9", "sx", "sy", "sz", "ix", "iy", "iz", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "i9", "require_nd", "__commonJSMin", "exports", "module", "numel", "vind2bind", "MODE", "binarynd", "x", "y", "z", "fcn", "xbuf", "ybuf", "zbuf", "ordx", "ordy", "ordz", "len", "sh", "sx", "sy", "sz", "ox", "oy", "oz", "ix", "iy", "iz", "require_main", "__commonJSMin", "exports", "module", "iterationOrder", "minmaxViewBufferIndex", "ndarray2object", "strides2order", "anyIsEntryIn", "format", "blockedaccessorbinary2d", "blockedaccessorbinary3d", "blockedaccessorbinary4d", "blockedaccessorbinary5d", "blockedaccessorbinary6d", "blockedaccessorbinary7d", "blockedaccessorbinary8d", "blockedaccessorbinary9d", "blockedaccessorbinary10d", "blockedbinary2d", "blockedbinary3d", "blockedbinary4d", "blockedbinary5d", "blockedbinary6d", "blockedbinary7d", "blockedbinary8d", "blockedbinary9d", "blockedbinary10d", "accessorbinary0d", "accessorbinary1d", "accessorbinary2d", "accessorbinary3d", "accessorbinary4d", "accessorbinary5d", "accessorbinary6d", "accessorbinary7d", "accessorbinary8d", "accessorbinary9d", "accessorbinary10d", "accessorbinarynd", "binary0d", "binary1d", "binary2d", "binary3d", "binary4d", "binary5d", "binary6d", "binary7d", "binary8d", "binary9d", "binary10d", "binarynd", "BINARY", "ACCESSOR_BINARY", "BLOCKED_BINARY", "BLOCKED_ACCESSOR_BINARY", "MAX_DIMS", "hasAccessors", "x", "y", "z", "binary", "arrays", "fcn", "ndims", "xmmv", "ymmv", "zmmv", "shx", "shy", "shz", "iox", "ioy", "ioz", "len", "ord", "sx", "sy", "sz", "ox", "oy", "oz", "ns", "d", "i", "main"] -} diff --git a/docs/repl.txt b/docs/repl.txt deleted file mode 100644 index 33afb7b..0000000 --- a/docs/repl.txt +++ /dev/null @@ -1,79 +0,0 @@ - -{{alias}}( arrays, fcn ) - Applies a binary callback to elements in input ndarrays and assigns results - to elements in an output ndarray. - - Each provided "ndarray" should be an object with the following properties: - - - dtype: data type. - - data: data buffer. - - shape: dimensions. - - strides: stride lengths. - - offset: index offset. - - order: specifies whether an ndarray is row-major (C-style) or column-major - (Fortran-style). - - Parameters - ---------- - arrays: ArrayLikeObject - Array-like object containing two input ndarrays and one output ndarray. - - fcn: Function - Binary callback. - - Examples - -------- - // Define ndarray data and meta data... - > var xbuf = new {{alias:@stdlib/array/float64}}( [ 1.0, 2.0, 3.0, 4.0 ] ); - > var ybuf = new {{alias:@stdlib/array/float64}}( [ 5.0, 6.0, 7.0, 8.0 ] ); - > var zbuf = new {{alias:@stdlib/array/float64}}( [ 0.0, 0.0, 0.0, 0.0 ] ); - > var dtype = 'float64'; - > var shape = [ 2, 2 ]; - > var sx = [ 2, 1 ]; - > var sy = [ 2, 1 ]; - > var sz = [ 2, 1 ]; - > var ox = 0; - > var oy = 0; - > var oz = 0; - > var order = 'row-major'; - - // Using ndarrays... - > var x = {{alias:@stdlib/ndarray/ctor}}( dtype, xbuf, shape, sx, ox, order ); - > var y = {{alias:@stdlib/ndarray/ctor}}( dtype, ybuf, shape, sy, oy, order ); - > var z = {{alias:@stdlib/ndarray/ctor}}( dtype, zbuf, shape, sz, oz, order ); - > {{alias}}( [ x, y, z ], {{alias:@stdlib/number/float64/base/add}} ); - > {{alias:@stdlib/ndarray/data-buffer}}( z ) - [ 6.0, 8.0, 10.0, 12.0 ] - - // Using minimal ndarray-like objects... - > x = { - ... 'dtype': dtype, - ... 'data': xbuf, - ... 'shape': shape, - ... 'strides': sx, - ... 'offset': ox, - ... 'order': order - ... }; - > y = { - ... 'dtype': dtype, - ... 'data': ybuf, - ... 'shape': shape, - ... 'strides': sy, - ... 'offset': oy, - ... 'order': order - ... }; - > z = { - ... 'dtype': dtype, - ... 'data': zbuf, - ... 'shape': shape, - ... 'strides': sz, - ... 'offset': oz, - ... 'order': order - ... }; - > {{alias}}( [ x, y, z ], {{alias:@stdlib/number/float64/base/add}} ); - > {{alias:@stdlib/ndarray/data-buffer}}( z ) - [ 6.0, 8.0, 10.0, 12.0 ] - - See Also - -------- - diff --git a/docs/types/index.d.ts b/docs/types/index.d.ts deleted file mode 100644 index d6da25a..0000000 --- a/docs/types/index.d.ts +++ /dev/null @@ -1,86 +0,0 @@ -/* -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -// TypeScript Version: 4.1 - -/// - -import { ArrayLike } from '@stdlib/types/array'; -import { ndarray } from '@stdlib/types/ndarray'; - -/** -* Callback invoked for ndarray elements. -* -* @param x - first ndarray element -* @param y - second ndarray element -* @returns result -*/ -type Binary = ( x: any, y: any ) => any; - -/** -* Applies a binary callback to elements in input ndarrays and assigns results to elements in an output ndarray. -* -* @param arrays - array-like object containing two input ndarrays and one output ndarray -* @param fcn - binary callback -* @throws arrays must have the same number of dimensions -* @throws arrays must have the same shape -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* var ndarray = require( '@stdlib/ndarray-ctor' ); -* var getData = require( '@stdlib/ndarray-data-buffer' ); -* -* function add( a, b ) { -* return a + b; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] ); -* var zbuf = new Float64Array( 6 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 3, 1, 2 ]; -* -* // Define the array strides: -* var sx = [ 2, 2, 1 ]; -* var sy = [ 2, 2, 1 ]; -* var sz = [ 2, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarrays: -* var x = new ndarray( 'float64', xbuf, shape, sx, ox, 'row-major' ); -* var y = new ndarray( 'float64', ybuf, shape, sy, oy, 'row-major' ); -* var z = new ndarray( 'float64', zbuf, shape, sz, oz, 'row-major' ); -* -* // Apply the binary function: -* binary( [ x, y, z ], add ); -* -* console.log( getData( z ) ); -* // => [ 2.0, 4.0, 6.0, 8.0, 10.0, 12.0 ] -*/ -declare function binary( arrays: ArrayLike, fcn: Binary ): void; - - -// EXPORTS // - -export = binary; diff --git a/docs/types/test.ts b/docs/types/test.ts deleted file mode 100644 index 34b4040..0000000 --- a/docs/types/test.ts +++ /dev/null @@ -1,85 +0,0 @@ -/* -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -import zeros = require( '@stdlib/ndarray-zeros' ); -import binary = require( './index' ); - -/** -* Callback function. -* -* @param x - first input value -* @param y - second input value -* @returns result -*/ -function fcn( x: number, y: number ): number { - return x + y; -} - - -// TESTS // - -// The function returns `undefined`... -{ - const x = zeros( [ 2, 2 ] ); - const y = zeros( [ 2, 2 ] ); - const z = zeros( [ 2, 2 ] ); - const arrays = [ x, y, z ]; - - binary( arrays, fcn ); // $ExpectType void -} - -// The compiler throws an error if the function is provided a first argument which is not an array-like object containing ndarray-like objects... -{ - binary( 5, fcn ); // $ExpectError - binary( true, fcn ); // $ExpectError - binary( false, fcn ); // $ExpectError - binary( null, fcn ); // $ExpectError - binary( undefined, fcn ); // $ExpectError - binary( {}, fcn ); // $ExpectError - binary( [ 1 ], fcn ); // $ExpectError - binary( ( x: number ): number => x, fcn ); // $ExpectError -} - -// The compiler throws an error if the function is provided a second argument which is not a binary function... -{ - const x = zeros( [ 2, 2 ] ); - const y = zeros( [ 2, 2 ] ); - const z = zeros( [ 2, 2 ] ); - const arrays = [ x, y, z ]; - - binary( arrays, '10' ); // $ExpectError - binary( arrays, 5 ); // $ExpectError - binary( arrays, true ); // $ExpectError - binary( arrays, false ); // $ExpectError - binary( arrays, null ); // $ExpectError - binary( arrays, undefined ); // $ExpectError - binary( arrays, [] ); // $ExpectError - binary( arrays, {} ); // $ExpectError -} - -// The compiler throws an error if the function is provided an unsupported number of arguments... -{ - const x = zeros( [ 2, 2 ] ); - const y = zeros( [ 2, 2 ] ); - const z = zeros( [ 2, 2 ] ); - const arrays = [ x, y, z ]; - - binary(); // $ExpectError - binary( arrays ); // $ExpectError - binary( arrays, fcn, 10 ); // $ExpectError -} diff --git a/examples/index.js b/examples/index.js deleted file mode 100644 index 2d643dd..0000000 --- a/examples/index.js +++ /dev/null @@ -1,60 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -var discreteUniform = require( '@stdlib/random-base-discrete-uniform' ).factory; -var filledarray = require( '@stdlib/array-filled' ); -var filledarrayBy = require( '@stdlib/array-filled-by' ); -var add = require( '@stdlib/number-float64-base-add' ); -var shape2strides = require( '@stdlib/ndarray-base-shape2strides' ); -var ndarray2array = require( '@stdlib/ndarray-base-to-array' ); -var binary = require( './../lib' ); - -var N = 10; -var x = { - 'dtype': 'generic', - 'data': filledarrayBy( N, 'generic', discreteUniform( -100, 100 ) ), - 'shape': [ 5, 2 ], - 'strides': [ 2, 1 ], - 'offset': 0, - 'order': 'row-major' -}; -console.log( ndarray2array( x.data, x.shape, x.strides, x.offset, x.order ) ); - -var y = { - 'dtype': 'generic', - 'data': filledarrayBy( N, 'generic', discreteUniform( -100, 100 ) ), - 'shape': x.shape.slice(), - 'strides': shape2strides( x.shape, 'column-major' ), - 'offset': 0, - 'order': 'column-major' -}; -console.log( ndarray2array( y.data, y.shape, y.strides, y.offset, y.order ) ); - -var z = { - 'dtype': 'generic', - 'data': filledarray( 0, N, 'generic' ), - 'shape': x.shape.slice(), - 'strides': shape2strides( x.shape, 'column-major' ), - 'offset': 0, - 'order': 'column-major' -}; - -binary( [ x, y, z ], add ); -console.log( ndarray2array( z.data, z.shape, z.strides, z.offset, z.order ) ); diff --git a/index.js b/index.js new file mode 100644 index 0000000..547c820 --- /dev/null +++ b/index.js @@ -0,0 +1,3 @@ +// Copyright (c) 2026 The Stdlib Authors. License is Apache-2.0: http://www.apache.org/licenses/LICENSE-2.0 +!function(r,t){"object"==typeof exports&&"undefined"!=typeof module?module.exports=t():"function"==typeof define&&define.amd?define(t):(r="undefined"!=typeof globalThis?globalThis:r||self).binary=t()}(this,(function(){"use strict";function r(r){var t,e;for(t=0,e=0;e0&&(e-=1),n=r.toExponential(e)):n=r.toPrecision(t.precision),t.alternate||(n=c.call(n,w,"$1e"),n=c.call(n,v,"e"),n=c.call(n,m,""));break;default:throw new Error("invalid double notation. Value: "+t.specifier)}return n=c.call(n,p,"e+0$1"),n=c.call(n,y,"e-0$1"),t.alternate&&(n=c.call(n,d,"$1."),n=c.call(n,g,"$1.e")),r>=0&&t.sign&&(n=t.sign+n),n=t.specifier===h.call(t.specifier)?h.call(n):l.call(n)}function E(r){var t,e="";for(t=0;t127)throw new Error("invalid character code. Value: "+o.arg);o.arg=x(f)?String(o.arg):_(f)}break;case"e":case"E":case"f":case"F":case"g":case"G":if(t||(o.precision=6),h=parseFloat(o.arg),!isFinite(h)){if(!n(o.arg))throw new Error("invalid floating-point number. Value: "+u);h=o.arg,o.padZeros=!1}o.arg=b(h,o);break;default:throw new Error("invalid specifier: "+o.specifier)}o.maxWidth>=0&&o.arg.length>o.maxWidth&&(o.arg=o.arg.substring(0,o.maxWidth)),o.padZeros?o.arg=i(o.arg,o.width||o.precision,o.padRight):o.width&&(o.arg=(y=o.arg,d=o.width,g=o.padRight,m=void 0,(m=d-y.length)<0?y:y=g?y+E(m):E(m)+y)),u+=o.arg||"",l+=1}return u}var j=/%(?:([1-9]\d*)\$)?([0 +\-#]*)(\*|\d+)?(?:(\.)(\*|\d+)?)?[hlL]?([%A-Za-z])/g;function S(r){var t={mapping:r[1]?parseInt(r[1],10):void 0,flags:r[2],width:r[3],precision:r[5],specifier:r[6]};return"."===r[4]&&void 0===r[5]&&(t.precision="1"),t}function F(r){var t,e,n,o;for(e=[],o=0,n=j.exec(r);n;)(t=r.slice(o,j.lastIndex-n[0].length)).length&&e.push(t),"%"===n[6]?e.push("%"):e.push(S(n)),o=j.lastIndex,n=j.exec(r);return(t=r.slice(o)).length&&e.push(t),e}function O(r){var t,e;if("string"!=typeof r)throw new TypeError(O("invalid argument. First argument must be a string. Value: `%s`.",r));for(t=[F(r)],e=1;e0?i+=a*(r[f]-1):a<0&&(o+=a*(r[f]-1))}return[o,i]}N(U,"assign",(function(r,t,e,n){var o,i,a,f,s;for(o=r.length,i=e,a=e,s=0;s0?a+=f*(r[s]-1):f<0&&(i+=f*(r[s]-1))}return n[0]=i,n[1]=a,n}));var Y="function";function z(r){return typeof r.get===Y&&typeof r.set===Y}var W={complex128:function(r,t){return r.get(t)},complex64:function(r,t){return r.get(t)},default:function(r,t){return r.get(t)}};function Z(r){var t=W[r];return"function"==typeof t?t:W.default}var $={complex128:function(r,t,e){r.set(e,t)},complex64:function(r,t,e){r.set(e,t)},default:function(r,t,e){r.set(e,t)}};function G(r){var t=$[r];return"function"==typeof t?t:$.default}var K={float64:function(r,t){return r[t]},float32:function(r,t){return r[t]},int32:function(r,t){return r[t]},int16:function(r,t){return r[t]},int8:function(r,t){return r[t]},uint32:function(r,t){return r[t]},uint16:function(r,t){return r[t]},uint8:function(r,t){return r[t]},uint8c:function(r,t){return r[t]},generic:function(r,t){return r[t]},default:function(r,t){return r[t]}};function X(r){var t=K[r];return"function"==typeof t?t:K.default}var H={float64:function(r,t,e){r[t]=e},float32:function(r,t,e){r[t]=e},int32:function(r,t,e){r[t]=e},int16:function(r,t,e){r[t]=e},int8:function(r,t,e){r[t]=e},uint32:function(r,t,e){r[t]=e},uint16:function(r,t,e){r[t]=e},uint8:function(r,t,e){r[t]=e},uint8c:function(r,t,e){r[t]=e},generic:function(r,t,e){r[t]=e},default:function(r,t,e){r[t]=e}};function J(r){var t=H[r];return"function"==typeof t?t:H.default}function D(r){var t,e,n;if(0===(t=r.length))return 0;for(e=1,n=0;n=0;o--)e[o]=n,n*=r[o];return e}(r)}N(hr,"isPrimitive",Q),N(hr,"isObject",lr),N(pr,"assign",(function(r,t,e){return cr(t)?function(r,t){var e,n;for(e=1,n=0;n=0;n--)t[n]=e,e*=r[n];return t}(r,e)}));var yr="row-major";function dr(r,t){var e,n,o;return"object"!=typeof(o=r.strides)||null===o?0===(n=r.shape).length?[0]:(Q(e=r.order)||(e=yr),pr(n,e)):t?q(o):o}function gr(r){return"number"==typeof r}var mr=Number,vr=mr.prototype.toString;var wr=tr();function br(r){return"object"==typeof r&&(r instanceof mr||(wr?function(r){try{return vr.call(r),!0}catch(r){return!1}}(r):"[object Number]"===fr(r)))}function Er(r){return gr(r)||br(r)}function _r(r){var t,e,n;return gr(n=r.offset)?n:0===(e=r.shape).length||"object"!=typeof(t=r.strides)||null===t?0:function(r,t){var e,n,o;for(n=r.length,e=0,o=0;oo&&(n=!1),!n&&!t)return 0;o=i}return n&&t?3:n?1:2}N(Er,"isPrimitive",gr),N(Er,"isObject",br);var Vr="row-major",Ar="column-major";function jr(r){var t,e;return Q(e=r.order)?e:"object"!=typeof(t=r.strides)||null===t||1===(e=xr(t))||3===e?Vr:2===e?Ar:0===r.shape.length?Vr:null}function Sr(r){var t,e,n,o;return t=function(r){return r.data}(r),n=function(r,t){var e=r.shape;return t?q(e):e}(r,!0),o=function(r){return r.dtype}(r),e=z(t),{ref:r,dtype:o,data:t,length:D(n),shape:n,strides:dr(r,!0),offset:_r(r),order:jr(r),accessorProtocol:e,accessors:e?[Z(o),G(o)]:[X(o),J(o)]}}var Fr=Array.isArray?Array.isArray:function(r){return"[object Array]"===fr(r)};function Or(r){if("function"!=typeof r)throw new TypeError(O("invalid argument. Must provide a function. Value: `%s`.",r));return function(t){var e,n;if(!Fr(t))return!1;if(0===(e=t.length))return!1;for(n=0;nOt&&It(r)}function Bt(r){return gr(r)&&kt(r)}function Rt(r){return br(r)&&kt(r.valueOf())}function Mt(r){return Bt(r)||Rt(r)}function Ct(r){return Bt(r)&&r>=0}function Pt(r){return Rt(r)&&r.valueOf()>=0}function Nt(r){return Ct(r)||Pt(r)}N(Mt,"isPrimitive",Bt),N(Mt,"isObject",Rt),N(Nt,"isPrimitive",Ct),N(Nt,"isObject",Pt);var Ut=4294967295;function Yt(r){return"object"==typeof r&&null!==r&&"number"==typeof r.length&&It(r.length)&&r.length>=0&&r.length<=Ut}var zt=9007199254740991;function Wt(r){return"object"==typeof r&&null!==r&&"number"==typeof r.length&&It(r.length)&&r.length>=0&&r.length<=zt}var Zt="function"==typeof ArrayBuffer;function $t(r){return Zt&&r instanceof ArrayBuffer||"[object ArrayBuffer]"===fr(r)}function Gt(r){return"object"==typeof r&&null!==r&&!Fr(r)}var Kt=Or(hr.isPrimitive),Xt=Or(hr.isObject),Ht=Or(hr);N(Ht,"primitives",Kt),N(Ht,"objects",Xt);var Jt=/./;function Dt(r){return"boolean"==typeof r}var qt=Boolean,Qt=Boolean.prototype.toString;var re=tr();function te(r){return"object"==typeof r&&(r instanceof qt||(re?function(r){try{return Qt.call(r),!0}catch(r){return!1}}(r):"[object Boolean]"===fr(r)))}function ee(r){return Dt(r)||te(r)}N(ee,"isPrimitive",Dt),N(ee,"isObject",te);var ne="object"==typeof self?self:null,oe="object"==typeof window?window:null,ie="object"==typeof global?global:null,ae="object"==typeof globalThis?globalThis:null;var fe=function(r){if(arguments.length){if(!Dt(r))throw new TypeError(O("invalid argument. Must provide a boolean. Value: `%s`.",r));if(r)return new Function("return this;")()}if(ae)return ae;if(ne)return ne;if(oe)return oe;if(ie)return ie;throw new Error("unexpected error. Unable to resolve global object.")}(),se=fe.document&&fe.document.childNodes,ue=Int8Array;var le="function"==typeof Jt||"object"==typeof ue||"function"==typeof se?function(r){return Rr(r).toLowerCase()}:function(r){var t;return null===r?"null":"object"===(t=typeof r)?Rr(r).toLowerCase():t};function he(r){return"function"===le(r)}function ce(r,t,e){P(r,t,{configurable:!1,enumerable:!0,writable:!1,value:e})}function pe(r,t){if(!(this instanceof pe))throw new TypeError("invalid invocation. Constructor must be called with the `new` keyword.");if(!gr(r))throw new TypeError(O("invalid argument. Real component must be a number. Value: `%s`.",r));if(!gr(t))throw new TypeError(O("invalid argument. Imaginary component must be a number. Value: `%s`.",t));return ce(this,"re",r),ce(this,"im",t),this}N(pe,"name","Complex128"),N(pe,"BYTES_PER_ELEMENT",8),N(pe.prototype,"BYTES_PER_ELEMENT",8),N(pe.prototype,"byteLength",16),N(pe.prototype,"toString",(function(){var r=""+this.re;return this.im<0?r+=" - "+-this.im:r+=" + "+this.im,r+="i"})),N(pe.prototype,"toJSON",(function(){var r={type:"Complex128"};return r.re=this.re,r.im=this.im,r}));var ye="function"==typeof Math.fround?Math.fround:null,de=new Kr(1);var ge="function"==typeof ye?ye:function(r){return de[0]=r,de[0]};function me(r,t){if(!(this instanceof me))throw new TypeError("invalid invocation. Constructor must be called with the `new` keyword.");if(!gr(r))throw new TypeError(O("invalid argument. Real component must be a number. Value: `%s`.",r));if(!gr(t))throw new TypeError(O("invalid argument. Imaginary component must be a number. Value: `%s`.",t));return ce(this,"re",ge(r)),ce(this,"im",ge(t)),this}function ve(r){return r instanceof pe||r instanceof me||"object"==typeof r&&null!==r&&"number"==typeof r.re&&"number"==typeof r.im}function we(r){return It(r/2)}N(me,"name","Complex64"),N(me,"BYTES_PER_ELEMENT",4),N(me.prototype,"BYTES_PER_ELEMENT",4),N(me.prototype,"byteLength",8),N(me.prototype,"toString",(function(){var r=""+this.re;return this.im<0?r+=" - "+-this.im:r+=" + "+this.im,r+="i"})),N(me.prototype,"toJSON",(function(){var r={type:"Complex64"};return r.re=this.re,r.im=this.im,r}));var be=8;function Ee(r){return"object"==typeof r&&null!==r&&"Complex64Array"===r.constructor.name&&r.BYTES_PER_ELEMENT===be}var _e=16;function Te(r){return"object"==typeof r&&null!==r&&"Complex128Array"===r.constructor.name&&r.BYTES_PER_ELEMENT===_e}function xe(){return"function"==typeof ir&&"symbol"==typeof ir("foo")&&or(ir,"iterator")&&"symbol"==typeof ir.iterator}var Ve=xe()?Symbol.iterator:null;function Ae(r,t,e){P(r,t,{configurable:!1,enumerable:!1,get:e})}function je(r){return r.re}function Se(r){return r.im}function Fe(r,t){return new Kr(r.buffer,r.byteOffset+r.BYTES_PER_ELEMENT*t,2*(r.length-t))}function Oe(r,t){return new Yr(r.buffer,r.byteOffset+r.BYTES_PER_ELEMENT*t,2*(r.length-t))}function Le(r){var t,e,n;for(t=[];!(e=r.next()).done;)if(Yt(n=e.value)&&n.length>=2)t.push(n[0],n[1]);else{if(!ve(n))return new TypeError(O("invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",n));t.push(je(n),Se(n))}return t}var Ie=2*Kr.BYTES_PER_ELEMENT,ke=xe();function Be(r){return r instanceof Ce||"object"==typeof r&&null!==r&&("Complex64Array"===r.constructor.name||"Complex128Array"===r.constructor.name)&&"number"==typeof r._length&&"object"==typeof r._buffer}function Re(r){return r===Ce||"Complex128Array"===r.name}function Me(r,t){return new me(r[t*=2],r[t+1])}function Ce(){var r,t,e,n;if(t=arguments.length,!(this instanceof Ce))return 0===t?new Ce:1===t?new Ce(arguments[0]):2===t?new Ce(arguments[0],arguments[1]):new Ce(arguments[0],arguments[1],arguments[2]);if(0===t)e=new Kr(0);else if(1===t)if(Ct(arguments[0]))e=new Kr(2*arguments[0]);else if(Wt(arguments[0]))if((n=(e=arguments[0]).length)&&Fr(e)&&ve(e[0])){if(e=function(r,t){var e,n,o,i;for(e=t.length,i=0,o=0;oe.byteLength-r)throw new RangeError(O("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",n*Ie));e=new Kr(e,r,2*n)}}return N(this,"_buffer",e),N(this,"_length",e.length/2),this}function Pe(r){return r.re}function Ne(r){return r.im}function Ue(r){var t,e,n;for(t=[];!(e=r.next()).done;)if(Yt(n=e.value)&&n.length>=2)t.push(n[0],n[1]);else{if(!ve(n))return new TypeError(O("invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",n));t.push(Pe(n),Ne(n))}return t}N(Ce,"BYTES_PER_ELEMENT",Ie),N(Ce,"name","Complex64Array"),N(Ce,"from",(function(r){var t,e,n,o,i,a,f,s,u,l,h,c;if(!he(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if((e=arguments.length)>1){if(!he(n=arguments[1]))throw new TypeError(O("invalid argument. Second argument must be a function. Value: `%s`.",n));e>2&&(t=arguments[2])}if(Be(r)){if(s=r.length,n){for(i=(o=new this(s))._buffer,c=0,h=0;h=2))throw new TypeError(O("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));i[c]=l[0],i[c+1]=l[1]}c+=2}return o}return new this(r)}if(Wt(r)){if(n){for(s=r.length,f=r.get&&r.set?Z("default"):X("default"),h=0;h=2))throw new TypeError(O("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));i[c]=l[0],i[c+1]=l[1]}c+=2}return o}return new this(r)}if(Gt(r)&&ke&&he(r[Ve])){if(!he((i=r[Ve]()).next))throw new TypeError(O("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",r));if(a=n?function(r,t,e){var n,o,i,a;for(n=[],a=-1;!(o=r.next()).done;)if(a+=1,Yt(i=t.call(e,o.value,a))&&i.length>=2)n.push(i[0],i[1]);else{if(!ve(i))return new TypeError(O("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",i));n.push(je(i),Se(i))}return n}(i,n,t):Le(i),a instanceof Error)throw a;for(i=(o=new this(s=a.length/2))._buffer,h=0;h=this._length))return Me(this._buffer,r)})),Ae(Ce.prototype,"buffer",(function(){return this._buffer.buffer})),Ae(Ce.prototype,"byteLength",(function(){return this._buffer.byteLength})),Ae(Ce.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),N(Ce.prototype,"BYTES_PER_ELEMENT",Ce.BYTES_PER_ELEMENT),N(Ce.prototype,"copyWithin",(function(r,t){if(!Be(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return 2===arguments.length?this._buffer.copyWithin(2*r,2*t):this._buffer.copyWithin(2*r,2*t,2*arguments[2]),this})),N(Ce.prototype,"entries",(function(){var r,t,e,n,o,i;if(!Be(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return r=this,n=this._buffer,e=this._length,i=-1,N(t={},"next",(function(){if(i+=1,o||i>=e)return{done:!0};return{value:[i,Me(n,i)],done:!1}})),N(t,"return",(function(r){if(o=!0,arguments.length)return{value:r,done:!0};return{done:!0}})),Ve&&N(t,Ve,(function(){return r.entries()})),t})),N(Ce.prototype,"every",(function(r,t){var e,n;if(!Be(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!he(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n1){if(!It(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));if(t<0&&(t+=o)<0&&(t=0),arguments.length>2){if(!It(e))throw new TypeError(O("invalid argument. Third argument must be an integer. Value: `%s`.",e));e<0&&(e+=o)<0&&(e=0),e>o&&(e=o)}else e=o}else t=0,e=o;for(a=je(r),f=Se(r),s=t;s=0;n--)if(o=Me(e,n),r.call(t,o,n,this))return o})),N(Ce.prototype,"findLastIndex",(function(r,t){var e,n,o;if(!Be(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!he(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length-1;n>=0;n--)if(o=Me(e,n),r.call(t,o,n,this))return n;return-1})),N(Ce.prototype,"forEach",(function(r,t){var e,n,o;if(!Be(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!he(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n=this._length))return Me(this._buffer,r)})),N(Ce.prototype,"includes",(function(r,t){var e,n,o,i,a;if(!Be(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!ve(r))throw new TypeError(O("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!It(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(o=je(r),i=Se(r),e=this._buffer,a=t;a1){if(!It(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(o=je(r),i=Se(r),e=this._buffer,a=t;a=e)return{done:!0};return{value:o,done:!1}})),N(t,"return",(function(r){if(n=!0,arguments.length)return{value:r,done:!0};return{done:!0}})),Ve&&N(t,Ve,(function(){return r.keys()})),t})),N(Ce.prototype,"lastIndexOf",(function(r,t){var e,n,o,i,a;if(!Be(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!ve(r))throw new TypeError(O("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!It(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t>=this._length?t=this._length-1:t<0&&(t+=this._length)}else t=this._length-1;for(o=je(r),i=Se(r),e=this._buffer,a=t;a>=0;a--)if(o===e[n=2*a]&&i===e[n+1])return a;return-1})),Ae(Ce.prototype,"length",(function(){return this._length})),N(Ce.prototype,"map",(function(r,t){var e,n,o,i,a;if(!Be(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!he(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(n=this._buffer,e=(o=new this.constructor(this._length))._buffer,i=0;i1)n=t,i=0;else{if(0===o)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");n=Me(e,0),i=1}for(;i1)n=t,i=o-1;else{if(0===o)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");n=Me(e,o-1),i=o-2}for(;i>=0;i--)n=r(n,Me(e,i),i,this);return n})),N(Ce.prototype,"reverse",(function(){var r,t,e,n,o,i;if(!Be(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(e=this._length,r=this._buffer,n=Lt(e/2),o=0;o1){if(!Ct(e=arguments[1]))throw new TypeError(O("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",e))}else e=0;if(ve(r)){if(e>=this._length)throw new RangeError(O("invalid argument. Index argument is out-of-bounds. Value: `%u`.",e));return n[e*=2]=je(r),void(n[e+1]=Se(r))}if(Be(r)){if(e+(a=r._length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=r._buffer,u=n.byteOffset+e*Ie,t.buffer===n.buffer&&t.byteOffsetu){for(o=new Kr(t.length),s=0;sthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=r,u=n.byteOffset+e*Ie,t.buffer===n.buffer&&t.byteOffsetu){for(o=new Kr(a),s=0;sthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");for(e*=2,s=0;sf&&(t=f)}}for(e=ro&&(t=o)}}return r>=o?(o=0,e=n.byteLength):r>=t?(o=0,e=n.byteOffset+r*Ie):(o=t-r,e=n.byteOffset+r*Ie),new this.constructor(n.buffer,e,o<0?0:o)})),N(Ce.prototype,"toLocaleString",(function(r,t){var e,n,o,i,a;if(!Be(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(0===arguments.length)n=[];else{if(!Q(r)&&!Kt(r))throw new TypeError(O("invalid argument. First argument must be a string or an array of strings. Value: `%s`.",r));n=r}if(arguments.length<2)e={};else{if(!Gt(t))throw new TypeError(O("invalid argument. Options argument must be an object. Value: `%s`.",t));e=t}for(i=this._buffer,o=[],a=0;a=e)return{done:!0};return{value:Me(o,i),done:!1}})),N(r,"return",(function(r){if(n=!0,arguments.length)return{value:r,done:!0};return{done:!0}})),Ve&&N(r,Ve,(function(){return t.values()})),r})),N(Ce.prototype,"with",(function(r,t){var e,n,o;if(!Be(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!It(r))throw new TypeError(O("invalid argument. First argument must be an integer. Value: `%s`.",r));if(o=this._length,r<0&&(r+=o),r<0||r>=o)throw new RangeError(O("invalid argument. Index argument is out-of-bounds. Value: `%s`.",r));if(!ve(t))throw new TypeError(O("invalid argument. Second argument must be a complex number. Value: `%s`.",t));return(e=(n=new this.constructor(this._buffer))._buffer)[2*r]=je(t),e[2*r+1]=Se(t),n}));var Ye=2*Yr.BYTES_PER_ELEMENT,ze=xe();function We(r){return r instanceof Ge||"object"==typeof r&&null!==r&&("Complex64Array"===r.constructor.name||"Complex128Array"===r.constructor.name)&&"number"==typeof r._length&&"object"==typeof r._buffer}function Ze(r){return r===Ge||"Complex64Array"===r.name}function $e(r,t){return new pe(r[t*=2],r[t+1])}function Ge(){var r,t,e,n;if(t=arguments.length,!(this instanceof Ge))return 0===t?new Ge:1===t?new Ge(arguments[0]):2===t?new Ge(arguments[0],arguments[1]):new Ge(arguments[0],arguments[1],arguments[2]);if(0===t)e=new Yr(0);else if(1===t)if(Ct(arguments[0]))e=new Yr(2*arguments[0]);else if(Wt(arguments[0]))if((n=(e=arguments[0]).length)&&Fr(e)&&ve(e[0])){if(e=function(r,t){var e,n,o,i;for(e=t.length,i=0,o=0;oe.byteLength-r)throw new RangeError(O("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",n*Ye));e=new Yr(e,r,2*n)}}return N(this,"_buffer",e),N(this,"_length",e.length/2),this}function Ke(r){var t,e;for(t=[];!(e=r.next()).done;)t.push(qt(e.value));return t}N(Ge,"BYTES_PER_ELEMENT",Ye),N(Ge,"name","Complex128Array"),N(Ge,"from",(function(r){var t,e,n,o,i,a,f,s,u,l,h,c;if(!he(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Ze(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if((e=arguments.length)>1){if(!he(n=arguments[1]))throw new TypeError(O("invalid argument. Second argument must be a function. Value: `%s`.",n));e>2&&(t=arguments[2])}if(We(r)){if(s=r.length,n){for(i=(o=new this(s))._buffer,c=0,h=0;h=2))throw new TypeError(O("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));i[c]=l[0],i[c+1]=l[1]}c+=2}return o}return new this(r)}if(Wt(r)){if(n){for(s=r.length,f=r.get&&r.set?Z("default"):X("default"),h=0;h=2))throw new TypeError(O("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));i[c]=l[0],i[c+1]=l[1]}c+=2}return o}return new this(r)}if(Gt(r)&&ze&&he(r[Ve])){if(!he((i=r[Ve]()).next))throw new TypeError(O("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",r));if(a=n?function(r,t,e){var n,o,i,a;for(n=[],a=-1;!(o=r.next()).done;)if(a+=1,Yt(i=t.call(e,o.value,a))&&i.length>=2)n.push(i[0],i[1]);else{if(!ve(i))return new TypeError(O("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",i));n.push(Pe(i),Ne(i))}return n}(i,n,t):Ue(i),a instanceof Error)throw a;for(i=(o=new this(s=a.length/2))._buffer,h=0;h=this._length))return $e(this._buffer,r)})),Ae(Ge.prototype,"buffer",(function(){return this._buffer.buffer})),Ae(Ge.prototype,"byteLength",(function(){return this._buffer.byteLength})),Ae(Ge.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),N(Ge.prototype,"BYTES_PER_ELEMENT",Ge.BYTES_PER_ELEMENT),N(Ge.prototype,"copyWithin",(function(r,t){if(!We(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return 2===arguments.length?this._buffer.copyWithin(2*r,2*t):this._buffer.copyWithin(2*r,2*t,2*arguments[2]),this})),N(Ge.prototype,"entries",(function(){var r,t,e,n,o,i,a;if(!We(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return t=this,r=this._buffer,n=this._length,i=-1,a=-2,N(e={},"next",(function(){var t;if(i+=1,o||i>=n)return{done:!0};return t=new pe(r[a+=2],r[a+1]),{value:[i,t],done:!1}})),N(e,"return",(function(r){if(o=!0,arguments.length)return{value:r,done:!0};return{done:!0}})),Ve&&N(e,Ve,(function(){return t.entries()})),e})),N(Ge.prototype,"every",(function(r,t){var e,n;if(!We(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!he(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n1){if(!It(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));if(t<0&&(t+=o)<0&&(t=0),arguments.length>2){if(!It(e))throw new TypeError(O("invalid argument. Third argument must be an integer. Value: `%s`.",e));e<0&&(e+=o)<0&&(e=0),e>o&&(e=o)}else e=o}else t=0,e=o;for(a=Pe(r),f=Ne(r),s=t;s=0;n--)if(o=$e(e,n),r.call(t,o,n,this))return o})),N(Ge.prototype,"findLastIndex",(function(r,t){var e,n,o;if(!We(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!he(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length-1;n>=0;n--)if(o=$e(e,n),r.call(t,o,n,this))return n;return-1})),N(Ge.prototype,"forEach",(function(r,t){var e,n,o;if(!We(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!he(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n=this._length))return $e(this._buffer,r)})),Ae(Ge.prototype,"length",(function(){return this._length})),N(Ge.prototype,"includes",(function(r,t){var e,n,o,i,a;if(!We(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!ve(r))throw new TypeError(O("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!It(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(o=Pe(r),i=Ne(r),e=this._buffer,a=t;a1){if(!It(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(o=Pe(r),i=Ne(r),e=this._buffer,a=t;a=e)return{done:!0};return{value:o,done:!1}})),N(t,"return",(function(r){if(n=!0,arguments.length)return{value:r,done:!0};return{done:!0}})),Ve&&N(t,Ve,(function(){return r.keys()})),t})),N(Ge.prototype,"lastIndexOf",(function(r,t){var e,n,o,i,a;if(!We(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!ve(r))throw new TypeError(O("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!It(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t>=this._length?t=this._length-1:t<0&&(t+=this._length)}else t=this._length-1;for(o=Pe(r),i=Ne(r),e=this._buffer,a=t;a>=0;a--)if(o===e[n=2*a]&&i===e[n+1])return a;return-1})),N(Ge.prototype,"map",(function(r,t){var e,n,o,i,a;if(!We(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!he(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(n=this._buffer,e=(o=new this.constructor(this._length))._buffer,i=0;i1)n=t,i=0;else{if(0===o)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");n=$e(e,0),i=1}for(;i1)n=t,i=o-1;else{if(0===o)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");n=$e(e,o-1),i=o-2}for(;i>=0;i--)n=r(n,$e(e,i),i,this);return n})),N(Ge.prototype,"reverse",(function(){var r,t,e,n,o,i;if(!We(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(e=this._length,r=this._buffer,n=Lt(e/2),o=0;o1){if(!Ct(e=arguments[1]))throw new TypeError(O("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",e))}else e=0;if(ve(r)){if(e>=this._length)throw new RangeError(O("invalid argument. Index argument is out-of-bounds. Value: `%u`.",e));return n[e*=2]=Pe(r),void(n[e+1]=Ne(r))}if(We(r)){if(e+(a=r._length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=r._buffer,u=n.byteOffset+e*Ye,t.buffer===n.buffer&&t.byteOffsetu){for(o=new Yr(t.length),s=0;sthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=r,u=n.byteOffset+e*Ye,t.buffer===n.buffer&&t.byteOffsetu){for(o=new Yr(a),s=0;sthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");for(e*=2,s=0;sf&&(t=f)}}for(e=ro&&(t=o)}}return r>=o?(o=0,e=n.byteLength):r>=t?(o=0,e=n.byteOffset+r*Ye):(o=t-r,e=n.byteOffset+r*Ye),new this.constructor(n.buffer,e,o<0?0:o)})),N(Ge.prototype,"toLocaleString",(function(r,t){var e,n,o,i,a;if(!We(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(0===arguments.length)n=[];else{if(!hr(r)&&!Kt(r))throw new TypeError(O("invalid argument. First argument must be a string or an array of strings. Value: `%s`.",r));n=r}if(arguments.length<2)e={};else{if(!Gt(t))throw new TypeError(O("invalid argument. Options argument must be an object. Value: `%s`.",t));e=t}for(i=this._buffer,o=[],a=0;a=e)return{done:!0};return{value:$e(o,i),done:!1}})),N(r,"return",(function(r){if(n=!0,arguments.length)return{value:r,done:!0};return{done:!0}})),Ve&&N(r,Ve,(function(){return t.values()})),r})),N(Ge.prototype,"with",(function(r,t){var e,n,o;if(!We(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!It(r))throw new TypeError(O("invalid argument. First argument must be an integer. Value: `%s`.",r));if(o=this._length,r<0&&(r+=o),r<0||r>=o)throw new RangeError(O("invalid argument. Index argument is out-of-bounds. Value: `%s`.",r));if(!ve(t))throw new TypeError(O("invalid argument. Second argument must be a complex number. Value: `%s`.",t));return(e=(n=new this.constructor(this._buffer))._buffer)[2*r]=Pe(t),e[2*r+1]=Ne(t),n}));var Xe=wt.BYTES_PER_ELEMENT,He=xe();function Je(r){return"object"==typeof r&&null!==r&&"BooleanArray"===r.constructor.name&&r.BYTES_PER_ELEMENT===Xe}function De(r){return r===qe}function qe(){var r,t,e,n,o;if(t=arguments.length,!(this instanceof qe))return 0===t?new qe:1===t?new qe(arguments[0]):2===t?new qe(arguments[0],arguments[1]):new qe(arguments[0],arguments[1],arguments[2]);if(0===t)e=new wt(0);else if(1===t)if(Ct(o=arguments[0]))e=new wt(o);else if(Wt(o))e=function(r,t){var e,n;for(e=t.length,n=0;ne.byteLength-r)throw new RangeError(O("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",n*Xe));e=new wt(e,r,n)}}return N(this,"_buffer",e),N(this,"_length",e.length),this}N(qe,"BYTES_PER_ELEMENT",Xe),N(qe,"name","BooleanArray"),N(qe,"from",(function(r){var t,e,n,o,i,a,f,s,u;if(!he(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if((e=arguments.length)>1){if(!he(n=arguments[1]))throw new TypeError(O("invalid argument. Second argument must be a function. Value: `%s`.",n));e>2&&(t=arguments[2])}if(Wt(r)){if(n){for(s=r.length,f=r.get&&r.set?Z("default"):X("default"),i=(o=new this(s))._buffer,u=0;u=e))return qt(t[r])})),Ae(qe.prototype,"buffer",(function(){return this._buffer.buffer})),Ae(qe.prototype,"byteLength",(function(){return this._buffer.byteLength})),Ae(qe.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),N(qe.prototype,"BYTES_PER_ELEMENT",qe.BYTES_PER_ELEMENT),N(qe.prototype,"copyWithin",(function(r,t){if(!Je(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");return 2===arguments.length?this._buffer.copyWithin(r,t):this._buffer.copyWithin(r,t,arguments[2]),this})),N(qe.prototype,"entries",(function(){var r,t,e,n,o,i;if(!Je(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");return r=this,n=this._buffer,e=this._length,i=-1,N(t={},"next",(function(){if(i+=1,o||i>=e)return{done:!0};return{value:[i,qt(n[i])],done:!1}})),N(t,"return",(function(r){if(o=!0,arguments.length)return{value:r,done:!0};return{done:!0}})),Ve&&N(t,Ve,(function(){return r.entries()})),t})),N(qe.prototype,"every",(function(r,t){var e,n;if(!Je(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!he(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n1){if(!Bt(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));if(t<0&&(t+=o)<0&&(t=0),arguments.length>2){if(!Bt(e))throw new TypeError(O("invalid argument. Third argument must be an integer. Value: `%s`.",e));e<0&&(e+=o)<0&&(e=0),e>o&&(e=o)}else e=o}else t=0,e=o;for(i=r?1:0,a=t;a=0;o--)if(n=qt(e[o]),r.call(t,n,o,this))return n})),N(qe.prototype,"findLastIndex",(function(r,t){var e,n,o;if(!Je(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!he(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,o=this._length-1;o>=0;o--)if(n=qt(e[o]),r.call(t,n,o,this))return o;return-1})),N(qe.prototype,"forEach",(function(r,t){var e,n;if(!Je(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!he(r))throw new TypeError(O("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n=this._length))return qt(this._buffer[r])})),N(qe.prototype,"includes",(function(r,t){var e,n;if(!Je(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!Dt(r))throw new TypeError(O("invalid argument. First argument must be a boolean. Value: `%s`.",r));if(arguments.length>1){if(!Bt(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(e=this._buffer,n=t;n1){if(!Bt(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(e=this._buffer,n=t;n0){if(!Q(r))throw new TypeError(O("invalid argument. First argument must be a string. Value: `%s`.",r))}else r=",";for(t=this._buffer,e=[],n=0;n=e)return{done:!0};return{value:o,done:!1}})),N(t,"return",(function(r){if(n=!0,arguments.length)return{value:r,done:!0};return{done:!0}})),Ve&&N(t,Ve,(function(){return r.keys()})),t})),N(qe.prototype,"lastIndexOf",(function(r,t){var e,n;if(!Je(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!Dt(r))throw new TypeError(O("invalid argument. First argument must be a boolean. Value: `%s`.",r));if(arguments.length>1){if(!Bt(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t>=this._length?t=this._length-1:t<0&&(t+=this._length)}else t=this._length-1;for(e=this._buffer,n=t;n>=0;n--)if(r===qt(e[n]))return n;return-1})),Ae(qe.prototype,"length",(function(){return this._length})),N(qe.prototype,"map",(function(r,t){var e,n,o,i;if(!Je(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!he(r))throw new TypeError("invalid argument. First argument must be a function. Value: `%s`.",r);for(o=this._buffer,e=(n=new this.constructor(this._length))._buffer,i=0;i1)o=t,i=0;else{if(0===n)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");o=qt(e[0]),i=1}for(;i1)o=t,i=n-1;else{if(0===n)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");o=qt(e[n-1]),i=n-2}for(;i>=0;i--)o=r(o,qt(e[i]),i,this);return o})),N(qe.prototype,"reverse",(function(){var r,t,e,n,o,i;if(!Je(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");for(r=this._buffer,e=this._length,n=Lt(e/2),o=0;o1){if(!Ct(e=arguments[1]))throw new TypeError(O("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",e))}else e=0;if(Wt(r)){if(e+(i=r.length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=Je(r)?r._buffer:r,f=n.byteOffset+e*Xe,t.buffer===n.buffer&&t.byteOffsetf){for(o=new wt(t.length),a=0;a=this._length)throw new RangeError(O("invalid argument. Index argument is out-of-bounds. Value: `%u`.",e));n[e]=r?1:0}})),N(qe.prototype,"slice",(function(r,t){var e,n,o,i,a,f;if(!Je(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(i=this._buffer,a=this._length,0===arguments.length)r=0,t=a;else{if(!Bt(r))throw new TypeError(O("invalid argument. First argument must be an integer. Value: `%s`.",r));if(r<0&&(r+=a)<0&&(r=0),1===arguments.length)t=a;else{if(!Bt(t))throw new TypeError(O("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0?(t+=a)<0&&(t=0):t>a&&(t=a)}}for(e=ro&&(t=o)}}return r>=o?(o=0,e=n.byteLength):r>=t?(o=0,e=n.byteOffset+r*Xe):(o=t-r,e=n.byteOffset+r*Xe),new this.constructor(n.buffer,e,o<0?0:o)})),N(qe.prototype,"toLocaleString",(function(r,t){var e,n,o,i,a;if(!Je(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(0===arguments.length)n=[];else{if(!Q(r)&&!Kt(r))throw new TypeError(O("invalid argument. First argument must be a string or an array of strings. Value: `%s`.",r));n=r}if(arguments.length<2)e={};else{if(!Gt(t))throw new TypeError(O("invalid argument. Options argument must be an object. Value: `%s`.",t));e=t}for(i=this._buffer,o=[],a=0;a=e)return{done:!0};return{value:qt(o[i]),done:!1}})),N(r,"return",(function(r){if(n=!0,arguments.length)return{value:r,done:!0};return{done:!0}})),Ve&&N(r,Ve,(function(){return t.values()})),r})),N(qe.prototype,"with",(function(r,t){var e,n;if(!Je(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!Bt(r))throw new TypeError(O("invalid argument. First argument must be an integer. Value: `%s`.",r));if(n=this._length,r<0&&(r+=n),r<0||r>=n)throw new RangeError(O("invalid argument. Index argument is out-of-bounds. Value: `%s`.",r));if(!Dt(t))throw new TypeError(O("invalid argument. Second argument must be a boolean. Value: `%s`.",t));return(e=new this.constructor(this._buffer))._buffer[r]=t?1:0,e}));var Qe=[Yr,Kr,ot,Qr,yt,ut,Ft,wt,xt,Ce,Ge,qe],rn=["float64","float32","int32","uint32","int16","uint16","int8","uint8","uint8c","complex64","complex128","bool"],tn=rn.length;function en(r){var t;if(Fr(r))return"generic";if(Ir(r))return null;for(t=0;t=0&&a=o&&(o=i,h=l);f=n[h][0]}for(e=sn(r.length),function(r,t){var e,n,o,i,a,f,s,u,l;for(n=1,o=1,l=1;l=0&&!(((u=r[i])<0?-u:u)<=e);)r[i+1]=u,t[a+1]=t[a],i-=1,a-=1;r[i+1]=f,t[a+1]=s,n+=1,o+=1}}(q(f),e),a=[ln(r,e)],l=0;l0}function pn(r){return Rt(r)&&r.valueOf()>0}function yn(r){return cn(r)||pn(r)}function dn(r){return Object.keys(Object(r))}N(sn,"assign",(function(r,t,e){var n,o,i=(o=en(n=r),z(n)?{data:n,dtype:o,accessorProtocol:!0,accessors:[Z(o),G(o)]}:{data:n,dtype:o,accessorProtocol:!1,accessors:[X(o),J(o)]});return i.accessorProtocol?"complex128"===i.dtype?un(r,Oe(r,0),t,e):"complex64"===i.dtype?un(r,Fe(r,0),t,e):function(r,t,e){var n,o,i,a;for(n=r.data,o=r.accessors[1],a=e,i=0;a>=0&&a=0&&o=0&&t=0&&r.length<=Hr&&or(r,"callee")&&!An(r,"callee")},Sn=Array.prototype.slice;var Fn=An((function(){}),"prototype"),On=!An({toString:null},"toString");function Ln(r,t,e){var n,o;if(!Wt(r)&&!Q(r))throw new TypeError(O("invalid argument. First argument must be an array-like object. Value: `%s`.",r));if(0===(n=r.length))return-1;if(3===arguments.length){if(!Bt(e))throw new TypeError(O("invalid argument. Third argument must be an integer. Value: `%s`.",e));if(e>=0){if(e>=n)return-1;o=e}else(o=n+e)<0&&(o=0)}else o=0;if(Tn(t)){for(;o0&&!or(r,"0"))for(f=0;f1){if(!$n(t))throw new TypeError(O("invalid argument. Options argument must be an object. Value: `%s`.",t));if(or(t,"duplicates")&&!Dt(u=t.duplicates))throw new TypeError(O("invalid option. `%s` option must be a boolean. Option: `%s`.","duplicates",u))}if(n=(e=Un(r)).length,a={},u)for(s=0;st&&(t=n)}return(n=Hn.BLOCK_SIZE_IN_BYTES/t|0)>0?n:1}([r,t,e])}function Dn(r,t,e,n,o,i){var a,f,s,u,l;for(a=r.length,f=1,l=0;l=f&&(o=f-1);else if("wrap"===i)o<0?(o+=f)<0&&0!==(o%=f)&&(o+=f):o>=f&&(o-=f)>=f&&(o%=f);else if("normalize"===i&&o<0&&(o+=f),o<0||o>=f)throw new RangeError(O("invalid argument. Linear index must not exceed array dimensions. Number of array elements: `%u`. Value: `%d`.",f,o));if(s=e,cr(n)){for(l=0;l=0;l--)o-=u=o%r[l],o/=r[l],s+=u*t[l];return s}var qn="throw";var Qn="throw";var ro=[function(r,t,e,n){e.data[e.offset]=n(r.data[r.offset],t.data[t.offset])},function(r,t,e,n){var o,i,a,f,s,u,l,h,c,p,y;for(l=r.shape[0],f=r.strides[0],s=t.strides[0],u=e.strides[0],h=r.offset,c=t.offset,p=e.offset,o=r.data,i=t.data,a=e.data,y=0;y0;)for(I0;)for(L0;)for(Y0;)for(U0;)for(N0;)for(J0;)for(H0;)for(X0;)for(K0;)for(ir0;)for(or0;)for(nr0;)for(er0;)for(tr0;)for(yr0;)for(pr0;)for(cr0;)for(hr0;)for(lr0;)for(ur0;)for(Tr0;)for(_r0;)for(Er0;)for(br0;)for(wr0;)for(vr0;)for(mr0;)for(Ir0;)for(Lr0;)for(Or0;)for(Fr0;)for(Sr0;)for(jr0;)for(Ar0;)for(Vr0;)for(Yr0;)for(Ur0;)for(Nr0;)for(Pr0;)for(Cr0;)for(Mr0;)for(Rr0;)for(Br0;)for(kr0;)for(Jr0;)for(Hr0;)for(Xr0;)for(Kr0;)for(Gr0;)for($r0;)for(Zr0;)for(Wr0;)for(zr0;)for(Yr0;)for(R0;)for(B0;)for(Z0;)for(W0;)for(z0;)for(Q0;)for(q0;)for(D0;)for(J0;)for(sr0;)for(fr0;)for(ar0;)for(ir0;)for(or0;)for(mr0;)for(gr0;)for(dr0;)for(yr0;)for(pr0;)for(cr0;)for(Ar0;)for(Vr0;)for(xr0;)for(Tr0;)for(_r0;)for(Er0;)for(br0;)for(Rr0;)for(Br0;)for(kr0;)for(Ir0;)for(Lr0;)for(Or0;)for(Fr0;)for(Sr0;)for(Zr0;)for(Wr0;)for(zr0;)for(Yr0;)for(Ur0;)for(Nr0;)for(Pr0;)for(Cr0;)for(Mr0;)for(Qr0;)for(qr0;)for(Dr0;)for(Jr0;)for(Hr0;)for(Xr0;)for(Kr0;)for(Gr0;)for($r0;)for(Zr 0 ) {\n\t\t\t\tdigits -= 1;\n\t\t\t}\n\t\t\tout = f.toExponential( digits );\n\t\t} else {\n\t\t\tout = f.toPrecision( token.precision );\n\t\t}\n\t\tif ( !token.alternate ) {\n\t\t\tout = replace.call( out, RE_ZERO_BEFORE_EXP, '$1e' );\n\t\t\tout = replace.call( out, RE_PERIOD_ZERO_EXP, 'e' );\n\t\t\tout = replace.call( out, RE_TRAILING_PERIOD_ZERO, '' );\n\t\t}\n\t\tbreak;\n\tdefault:\n\t\tthrow new Error( 'invalid double notation. Value: ' + token.specifier );\n\t}\n\tout = replace.call( out, RE_EXP_POS_DIGITS, 'e+0$1' );\n\tout = replace.call( out, RE_EXP_NEG_DIGITS, 'e-0$1' );\n\tif ( token.alternate ) {\n\t\tout = replace.call( out, RE_ONLY_DIGITS, '$1.' );\n\t\tout = replace.call( out, RE_DIGITS_BEFORE_EXP, '$1.e' );\n\t}\n\tif ( f >= 0 && token.sign ) {\n\t\tout = token.sign + out;\n\t}\n\tout = ( token.specifier === uppercase.call( token.specifier ) ) ?\n\t\tuppercase.call( out ) :\n\t\tlowercase.call( out );\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default formatDouble;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// FUNCTIONS //\n\n/**\n* Returns `n` spaces.\n*\n* @private\n* @param {number} n - number of spaces\n* @returns {string} string of spaces\n*/\nfunction spaces( n ) {\n\tvar out = '';\n\tvar i;\n\tfor ( i = 0; i < n; i++ ) {\n\t\tout += ' ';\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Pads a token with spaces to the specified width.\n*\n* @private\n* @param {string} str - token argument\n* @param {number} width - token width\n* @param {boolean} [right=false] - boolean indicating whether to pad to the right\n* @returns {string} padded token argument\n*/\nfunction spacePad( str, width, right ) {\n\tvar pad = width - str.length;\n\tif ( pad < 0 ) {\n\t\treturn str;\n\t}\n\tstr = ( right ) ?\n\t\tstr + spaces( pad ) :\n\t\tspaces( pad ) + str;\n\treturn str;\n}\n\n\n// EXPORTS //\n\nexport default spacePad;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport formatInteger from './format_integer.js';\nimport isString from './is_string.js';\nimport isNumber from './is_number.js';\nimport formatDouble from './format_double.js';\nimport spacePad from './space_pad.js';\nimport zeroPad from './zero_pad.js';\n\n\n// VARIABLES //\n\nvar fromCharCode = String.fromCharCode;\nvar isArray = Array.isArray; // NOTE: We use the global `Array.isArray` function here instead of `@stdlib/assert/is-array` to avoid circular dependencies.\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating whether a value is `NaN`.\n*\n* @private\n* @param {*} value - input value\n* @returns {boolean} boolean indicating whether a value is `NaN`\n*\n* @example\n* var bool = isnan( NaN );\n* // returns true\n*\n* @example\n* var bool = isnan( 4 );\n* // returns false\n*/\nfunction isnan( value ) { // explicitly define a function here instead of `@stdlib/math/base/assert/is-nan` in order to avoid circular dependencies\n\treturn ( value !== value );\n}\n\n/**\n* Initializes token object with properties of supplied format identifier object or default values if not present.\n*\n* @private\n* @param {Object} token - format identifier object\n* @returns {Object} token object\n*/\nfunction initialize( token ) {\n\tvar out = {};\n\tout.specifier = token.specifier;\n\tout.precision = ( token.precision === void 0 ) ? 1 : token.precision;\n\tout.width = token.width;\n\tout.flags = token.flags || '';\n\tout.mapping = token.mapping;\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Generates string from a token array by interpolating values.\n*\n* @param {Array} tokens - string parts and format identifier objects\n* @param {Array} ...args - variable values\n* @throws {TypeError} first argument must be an array\n* @throws {Error} invalid flags\n* @returns {string} formatted string\n*\n* @example\n* var tokens = [ 'beep ', { 'specifier': 's' } ];\n* var out = formatInterpolate( tokens, 'boop' );\n* // returns 'beep boop'\n*/\nfunction formatInterpolate( tokens ) {\n\tvar hasPeriod;\n\tvar flags;\n\tvar token;\n\tvar flag;\n\tvar num;\n\tvar out;\n\tvar pos;\n\tvar f;\n\tvar i;\n\tvar j;\n\n\tif ( !isArray( tokens ) ) {\n\t\tthrow new TypeError( 'invalid argument. First argument must be an array. Value: `' + tokens + '`.' );\n\t}\n\tout = '';\n\tpos = 1;\n\tfor ( i = 0; i < tokens.length; i++ ) {\n\t\ttoken = tokens[ i ];\n\t\tif ( isString( token ) ) {\n\t\t\tout += token;\n\t\t} else {\n\t\t\thasPeriod = token.precision !== void 0;\n\t\t\ttoken = initialize( token );\n\t\t\tif ( !token.specifier ) {\n\t\t\t\tthrow new TypeError( 'invalid argument. Token is missing `specifier` property. Index: `'+ i +'`. Value: `' + token + '`.' );\n\t\t\t}\n\t\t\tif ( token.mapping ) {\n\t\t\t\tpos = token.mapping;\n\t\t\t}\n\t\t\tflags = token.flags;\n\t\t\tfor ( j = 0; j < flags.length; j++ ) {\n\t\t\t\tflag = flags.charAt( j );\n\t\t\t\tswitch ( flag ) {\n\t\t\t\tcase ' ':\n\t\t\t\t\ttoken.sign = ' ';\n\t\t\t\t\tbreak;\n\t\t\t\tcase '+':\n\t\t\t\t\ttoken.sign = '+';\n\t\t\t\t\tbreak;\n\t\t\t\tcase '-':\n\t\t\t\t\ttoken.padRight = true;\n\t\t\t\t\ttoken.padZeros = false;\n\t\t\t\t\tbreak;\n\t\t\t\tcase '0':\n\t\t\t\t\ttoken.padZeros = flags.indexOf( '-' ) < 0; // NOTE: We use built-in `Array.prototype.indexOf` here instead of `@stdlib/assert/contains` in order to avoid circular dependencies.\n\t\t\t\t\tbreak;\n\t\t\t\tcase '#':\n\t\t\t\t\ttoken.alternate = true;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tthrow new Error( 'invalid flag: ' + flag );\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( token.width === '*' ) {\n\t\t\t\ttoken.width = parseInt( arguments[ pos ], 10 );\n\t\t\t\tpos += 1;\n\t\t\t\tif ( isnan( token.width ) ) {\n\t\t\t\t\tthrow new TypeError( 'the argument for * width at position ' + pos + ' is not a number. Value: `' + token.width + '`.' );\n\t\t\t\t}\n\t\t\t\tif ( token.width < 0 ) {\n\t\t\t\t\ttoken.padRight = true;\n\t\t\t\t\ttoken.width = -token.width;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( hasPeriod ) {\n\t\t\t\tif ( token.precision === '*' ) {\n\t\t\t\t\ttoken.precision = parseInt( arguments[ pos ], 10 );\n\t\t\t\t\tpos += 1;\n\t\t\t\t\tif ( isnan( token.precision ) ) {\n\t\t\t\t\t\tthrow new TypeError( 'the argument for * precision at position ' + pos + ' is not a number. Value: `' + token.precision + '`.' );\n\t\t\t\t\t}\n\t\t\t\t\tif ( token.precision < 0 ) {\n\t\t\t\t\t\ttoken.precision = 1;\n\t\t\t\t\t\thasPeriod = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\ttoken.arg = arguments[ pos ];\n\t\t\tswitch ( token.specifier ) {\n\t\t\tcase 'b':\n\t\t\tcase 'o':\n\t\t\tcase 'x':\n\t\t\tcase 'X':\n\t\t\tcase 'd':\n\t\t\tcase 'i':\n\t\t\tcase 'u':\n\t\t\t\t// Case: %b (binary), %o (octal), %x, %X (hexadecimal), %d, %i (decimal), %u (unsigned decimal)\n\t\t\t\tif ( hasPeriod ) {\n\t\t\t\t\ttoken.padZeros = false;\n\t\t\t\t}\n\t\t\t\ttoken.arg = formatInteger( token );\n\t\t\t\tbreak;\n\t\t\tcase 's':\n\t\t\t\t// Case: %s (string)\n\t\t\t\ttoken.maxWidth = ( hasPeriod ) ? token.precision : -1;\n\t\t\t\ttoken.arg = String( token.arg );\n\t\t\t\tbreak;\n\t\t\tcase 'c':\n\t\t\t\t// Case: %c (character)\n\t\t\t\tif ( !isnan( token.arg ) ) {\n\t\t\t\t\tnum = parseInt( token.arg, 10 );\n\t\t\t\t\tif ( num < 0 || num > 127 ) {\n\t\t\t\t\t\tthrow new Error( 'invalid character code. Value: ' + token.arg );\n\t\t\t\t\t}\n\t\t\t\t\ttoken.arg = ( isnan( num ) ) ? String( token.arg ) : fromCharCode( num ); // eslint-disable-line max-len\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 'e':\n\t\t\tcase 'E':\n\t\t\tcase 'f':\n\t\t\tcase 'F':\n\t\t\tcase 'g':\n\t\t\tcase 'G':\n\t\t\t\t// Case: %e, %E (scientific notation), %f, %F (decimal floating point), %g, %G (uses the shorter of %e/E or %f/F)\n\t\t\t\tif ( !hasPeriod ) {\n\t\t\t\t\ttoken.precision = 6;\n\t\t\t\t}\n\t\t\t\tf = parseFloat( token.arg );\n\t\t\t\tif ( !isFinite( f ) ) { // NOTE: We use the global `isFinite` function here instead of `@stdlib/math/base/assert/is-finite` in order to avoid circular dependencies.\n\t\t\t\t\tif ( !isNumber( token.arg ) ) {\n\t\t\t\t\t\tthrow new Error( 'invalid floating-point number. Value: ' + out );\n\t\t\t\t\t}\n\t\t\t\t\t// Case: NaN, Infinity, or -Infinity\n\t\t\t\t\tf = token.arg;\n\t\t\t\t\ttoken.padZeros = false;\n\t\t\t\t}\n\t\t\t\ttoken.arg = formatDouble( f, token );\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tthrow new Error( 'invalid specifier: ' + token.specifier );\n\t\t\t}\n\t\t\t// Fit argument into field width...\n\t\t\tif ( token.maxWidth >= 0 && token.arg.length > token.maxWidth ) {\n\t\t\t\ttoken.arg = token.arg.substring( 0, token.maxWidth );\n\t\t\t}\n\t\t\tif ( token.padZeros ) {\n\t\t\t\ttoken.arg = zeroPad( token.arg, token.width || token.precision, token.padRight ); // eslint-disable-line max-len\n\t\t\t} else if ( token.width ) {\n\t\t\t\ttoken.arg = spacePad( token.arg, token.width, token.padRight );\n\t\t\t}\n\t\t\tout += token.arg || '';\n\t\t\tpos += 1;\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default formatInterpolate;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a string primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a string primitive\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns true\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns false\n*/\nfunction isString( value ) {\n\treturn ( typeof value === 'string' ); // NOTE: we inline the `isString.isPrimitive` function from `@stdlib/assert/is-string` in order to avoid circular dependencies.\n}\n\n\n// EXPORTS //\n\nexport default isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar RE = /%(?:([1-9]\\d*)\\$)?([0 +\\-#]*)(\\*|\\d+)?(?:(\\.)(\\*|\\d+)?)?[hlL]?([%A-Za-z])/g;\n\n\n// FUNCTIONS //\n\n/**\n* Parses a delimiter.\n*\n* @private\n* @param {Array} match - regular expression match\n* @returns {Object} delimiter token object\n*/\nfunction parse( match ) {\n\tvar token = {\n\t\t'mapping': ( match[ 1 ] ) ? parseInt( match[ 1 ], 10 ) : void 0,\n\t\t'flags': match[ 2 ],\n\t\t'width': match[ 3 ],\n\t\t'precision': match[ 5 ],\n\t\t'specifier': match[ 6 ]\n\t};\n\tif ( match[ 4 ] === '.' && match[ 5 ] === void 0 ) {\n\t\ttoken.precision = '1';\n\t}\n\treturn token;\n}\n\n\n// MAIN //\n\n/**\n* Tokenizes a string into an array of string parts and format identifier objects.\n*\n* @param {string} str - input string\n* @returns {Array} tokens\n*\n* @example\n* var tokens = formatTokenize( 'Hello %s!' );\n* // returns [ 'Hello ', {...}, '!' ]\n*/\nfunction formatTokenize( str ) {\n\tvar content;\n\tvar tokens;\n\tvar match;\n\tvar prev;\n\n\ttokens = [];\n\tprev = 0;\n\tmatch = RE.exec( str );\n\twhile ( match ) {\n\t\tcontent = str.slice( prev, RE.lastIndex - match[ 0 ].length );\n\t\tif ( content.length ) {\n\t\t\ttokens.push( content );\n\t\t}\n\t\t// Check for an escaped percent sign `%%`...\n\t\tif ( match[ 6 ] === '%' ) {\n\t\t\ttokens.push( '%' );\n\t\t} else {\n\t\t\ttokens.push( parse( match ) );\n\t\t}\n\t\tprev = RE.lastIndex;\n\t\tmatch = RE.exec( str );\n\t}\n\tcontent = str.slice( prev );\n\tif ( content.length ) {\n\t\ttokens.push( content );\n\t}\n\treturn tokens;\n}\n\n\n// EXPORTS //\n\nexport default formatTokenize;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport interpolate from '@stdlib/string-base-format-interpolate';\nimport tokenize from '@stdlib/string-base-format-tokenize';\nimport isString from './is_string.js';\n\n\n// MAIN //\n\n/**\n* Inserts supplied variable values into a format string.\n*\n* @param {string} str - input string\n* @param {Array} ...args - variable values\n* @throws {TypeError} first argument must be a string\n* @throws {Error} invalid flags\n* @returns {string} formatted string\n*\n* @example\n* var str = format( 'Hello %s!', 'world' );\n* // returns 'Hello world!'\n*\n* @example\n* var str = format( 'Pi: ~%.2f', 3.141592653589793 );\n* // returns 'Pi: ~3.14'\n*/\nfunction format( str ) {\n\tvar args;\n\tvar i;\n\n\tif ( !isString( str ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string. Value: `%s`.', str ) );\n\t}\n\targs = [ tokenize( str ) ];\n\tfor ( i = 1; i < arguments.length; i++ ) {\n\t\targs.push( arguments[ i ] );\n\t}\n\treturn interpolate.apply( null, args );\n}\n\n\n// EXPORTS //\n\nexport default format;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a string primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a string primitive\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns true\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns false\n*/\nfunction isString( value ) {\n\treturn ( typeof value === 'string' ); // NOTE: we inline the `isString.isPrimitive` function from `@stdlib/assert/is-string` in order to avoid circular dependencies.\n}\n\n\n// EXPORTS //\n\nexport default isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable no-underscore-dangle, no-proto */\n\n'use strict';\n\n// MODULES //\n\nimport format from '@stdlib/string-format';\n\n\n// VARIABLES //\n\nvar objectProtoype = Object.prototype;\nvar toStr = objectProtoype.toString;\nvar defineGetter = objectProtoype.__defineGetter__;\nvar defineSetter = objectProtoype.__defineSetter__;\nvar lookupGetter = objectProtoype.__lookupGetter__;\nvar lookupSetter = objectProtoype.__lookupSetter__;\n\n\n// MAIN //\n\n/**\n* Defines (or modifies) an object property.\n*\n* ## Notes\n*\n* - Property descriptors come in two flavors: **data descriptors** and **accessor descriptors**. A data descriptor is a property that has a value, which may or may not be writable. An accessor descriptor is a property described by a getter-setter function pair. A descriptor must be one of these two flavors and cannot be both.\n*\n* @param {Object} obj - object on which to define the property\n* @param {string} prop - property name\n* @param {Object} descriptor - property descriptor\n* @param {boolean} [descriptor.configurable=false] - boolean indicating if property descriptor can be changed and if the property can be deleted from the provided object\n* @param {boolean} [descriptor.enumerable=false] - boolean indicating if the property shows up when enumerating object properties\n* @param {boolean} [descriptor.writable=false] - boolean indicating if the value associated with the property can be changed with an assignment operator\n* @param {*} [descriptor.value] - property value\n* @param {(Function|void)} [descriptor.get=undefined] - function which serves as a getter for the property, or, if no getter, undefined. When the property is accessed, a getter function is called without arguments and with the `this` context set to the object through which the property is accessed (which may not be the object on which the property is defined due to inheritance). The return value will be used as the property value.\n* @param {(Function|void)} [descriptor.set=undefined] - function which serves as a setter for the property, or, if no setter, undefined. When assigning a property value, a setter function is called with one argument (the value being assigned to the property) and with the `this` context set to the object through which the property is assigned.\n* @throws {TypeError} first argument must be an object\n* @throws {TypeError} third argument must be an object\n* @throws {Error} property descriptor cannot have both a value and a setter and/or getter\n* @returns {Object} object with added property\n*\n* @example\n* var obj = {};\n*\n* defineProperty( obj, 'foo', {\n* 'value': 'bar'\n* });\n*\n* var str = obj.foo;\n* // returns 'bar'\n*/\nfunction defineProperty( obj, prop, descriptor ) {\n\tvar prototype;\n\tvar hasValue;\n\tvar hasGet;\n\tvar hasSet;\n\n\tif ( typeof obj !== 'object' || obj === null || toStr.call( obj ) === '[object Array]' ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an object. Value: `%s`.', obj ) );\n\t}\n\tif ( typeof descriptor !== 'object' || descriptor === null || toStr.call( descriptor ) === '[object Array]' ) {\n\t\tthrow new TypeError( format( 'invalid argument. Property descriptor must be an object. Value: `%s`.', descriptor ) );\n\t}\n\thasValue = ( 'value' in descriptor );\n\tif ( hasValue ) {\n\t\tif (\n\t\t\tlookupGetter.call( obj, prop ) ||\n\t\t\tlookupSetter.call( obj, prop )\n\t\t) {\n\t\t\t// Override `__proto__` to avoid touching inherited accessors:\n\t\t\tprototype = obj.__proto__;\n\t\t\tobj.__proto__ = objectProtoype;\n\n\t\t\t// Delete property as existing getters/setters prevent assigning value to specified property:\n\t\t\tdelete obj[ prop ];\n\t\t\tobj[ prop ] = descriptor.value;\n\n\t\t\t// Restore original prototype:\n\t\t\tobj.__proto__ = prototype;\n\t\t} else {\n\t\t\tobj[ prop ] = descriptor.value;\n\t\t}\n\t}\n\thasGet = ( 'get' in descriptor );\n\thasSet = ( 'set' in descriptor );\n\n\tif ( hasValue && ( hasGet || hasSet ) ) {\n\t\tthrow new Error( 'invalid argument. Cannot specify one or more accessors and a value or writable attribute in the property descriptor.' );\n\t}\n\n\tif ( hasGet && defineGetter ) {\n\t\tdefineGetter.call( obj, prop, descriptor.get );\n\t}\n\tif ( hasSet && defineSetter ) {\n\t\tdefineSetter.call( obj, prop, descriptor.set );\n\t}\n\treturn obj;\n}\n\n\n// EXPORTS //\n\nexport default defineProperty;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Define (or modify) an object property.\n*\n* @module @stdlib/utils-define-property\n*\n* @example\n* import defineProperty from '@stdlib/utils-define-property';\n*\n* var obj = {};\n* defineProperty( obj, 'foo', {\n* 'value': 'bar',\n* 'writable': false,\n* 'configurable': false,\n* 'enumerable': false\n* });\n* obj.foo = 'boop'; // => throws\n*/\n\n// MODULES //\n\nimport hasDefinePropertySupport from './has_define_property_support.js';\nimport builtin from './builtin.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar defineProperty;\nif ( hasDefinePropertySupport() ) {\n\tdefineProperty = builtin;\n} else {\n\tdefineProperty = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default defineProperty;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport defineProperty from './define_property.js';\n\n\n// MAIN //\n\n/**\n* Tests for `Object.defineProperty` support.\n*\n* @private\n* @returns {boolean} boolean indicating if an environment has `Object.defineProperty` support\n*\n* @example\n* var bool = hasDefinePropertySupport();\n* // returns \n*/\nfunction hasDefinePropertySupport() {\n\t// Test basic support...\n\ttry {\n\t\tdefineProperty( {}, 'x', {} );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default hasDefinePropertySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport defineProperty from '@stdlib/utils-define-property';\n\n\n// MAIN //\n\n/**\n* Defines a non-enumerable read-only property.\n*\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {*} value - value to set\n*\n* @example\n* var obj = {};\n*\n* setNonEnumerableReadOnly( obj, 'foo', 'bar' );\n*\n* try {\n* obj.foo = 'boop';\n* } catch ( err ) {\n* console.error( err.message );\n* }\n*/\nfunction setNonEnumerableReadOnly( obj, prop, value ) {\n\tdefineProperty( obj, prop, {\n\t\t'configurable': false,\n\t\t'enumerable': false,\n\t\t'writable': false,\n\t\t'value': value\n\t});\n}\n\n\n// EXPORTS //\n\nexport default setNonEnumerableReadOnly;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Computes the minimum and maximum linear indices in an underlying data buffer which are accessible to an array view.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @param {NonNegativeInteger} offset - index offset\n* @returns {Array} linear indices\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ 10, 1 ];\n* var offset = 10;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 10, 109 ]\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ -10, -1 ];\n* var offset = 99;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 0, 99 ]\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ 1, 10 ];\n* var offset = 10;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 10, 109 ]\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ -1, -10 ];\n* var offset = 99;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 0, 99 ]\n*/\nfunction minmaxViewBufferIndex( shape, strides, offset ) {\n\tvar ndims;\n\tvar min;\n\tvar max;\n\tvar s;\n\tvar i;\n\n\tndims = shape.length;\n\tmin = offset;\n\tmax = offset;\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tif ( shape[ i ] === 0 ) {\n\t\t\treturn [ offset, offset ];\n\t\t}\n\t\ts = strides[ i ];\n\t\tif ( s > 0 ) {\n\t\t\tmax += s * ( shape[i]-1 );\n\t\t} else if ( s < 0 ) {\n\t\t\tmin += s * ( shape[i]-1 ); // decrements min\n\t\t}\n\t}\n\treturn [ min, max ];\n}\n\n\n// EXPORTS //\n\nexport default minmaxViewBufferIndex;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Compute the minimum and maximum linear indices in an underlying data buffer which are accessible to an array view.\n*\n* @module @stdlib/ndarray-base-minmax-view-buffer-index\n*\n* @example\n* import minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\n*\n* var shape = [ 10, 10 ];\n* var strides = [ 10, 1 ];\n* var offset = 10;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 10, 109 ]\n*\n* @example\n* import minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\n*\n* var shape = [ 10, 10 ];\n* var strides = [ -10, -1 ];\n* var offset = 99;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 0, 99 ]\n*\n* @example\n* import minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\n*\n* var shape = [ 10, 10 ];\n* var strides = [ 1, 10 ];\n* var offset = 10;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 10, 109 ]\n*\n* @example\n* import minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\n*\n* var shape = [ 10, 10 ];\n* var strides = [ -1, -10 ];\n* var offset = 99;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 0, 99 ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport assign from './assign.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Computes the minimum and maximum linear indices in an underlying data buffer which are accessible to an array view and assigns results to a provided output array.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @param {NonNegativeInteger} offset - index offset\n* @param {(Array|TypedArray|Object)} out - output object\n* @returns {(Array|TypedArray|Object)} linear indices\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ 10, 1 ];\n* var offset = 10;\n*\n* var out = [ 0, 0 ];\n* var idx = minmaxViewBufferIndex( shape, strides, offset, out );\n* // returns [ 10, 109 ]\n*\n* var bool = ( idx === out );\n* // returns true\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ -10, -1 ];\n* var offset = 99;\n*\n* var out = [ 0, 0 ];\n* var idx = minmaxViewBufferIndex( shape, strides, offset, out );\n* // returns [ 0, 99 ]\n*\n* var bool = ( idx === out );\n* // returns true\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ 1, 10 ];\n* var offset = 10;\n*\n* var out = [ 0, 0 ];\n* var idx = minmaxViewBufferIndex( shape, strides, offset, out );\n* // returns [ 10, 109 ]\n*\n* var bool = ( idx === out );\n* // returns true\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ -1, -10 ];\n* var offset = 99;\n*\n* var out = [ 0, 0 ];\n* var idx = minmaxViewBufferIndex( shape, strides, offset, out );\n* // returns [ 0, 99 ]\n*\n* var bool = ( idx === out );\n* // returns true\n*/\nfunction minmaxViewBufferIndex( shape, strides, offset, out ) {\n\tvar ndims;\n\tvar min;\n\tvar max;\n\tvar s;\n\tvar i;\n\n\tndims = shape.length;\n\tmin = offset;\n\tmax = offset;\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tif ( shape[ i ] === 0 ) {\n\t\t\tout[ 0 ] = offset;\n\t\t\tout[ 1 ] = offset;\n\t\t\treturn out;\n\t\t}\n\t\ts = strides[ i ];\n\t\tif ( s > 0 ) {\n\t\t\tmax += s * ( shape[i]-1 );\n\t\t} else if ( s < 0 ) {\n\t\t\tmin += s * ( shape[i]-1 ); // decrements min\n\t\t}\n\t}\n\tout[ 0 ] = min;\n\tout[ 1 ] = max;\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default minmaxViewBufferIndex;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar TYPE = 'function';\n\n\n// MAIN //\n\n/**\n* Tests if an array-like object supports the accessor (get/set) protocol.\n*\n* @param {Object} value - value to test\n* @returns {boolean} boolean indicating whether a value is an accessor array\n*\n* @example\n* import Complex128Array from '@stdlib/array-complex128';\n*\n* var bool = isAccessorArray( new Complex128Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isAccessorArray( [] );\n* // returns false\n*/\nfunction isAccessorArray( value ) {\n\treturn ( typeof value.get === TYPE && typeof value.set === TYPE ); // eslint-disable-line valid-typeof\n}\n\n\n// EXPORTS //\n\nexport default isAccessorArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar GETTERS = {\n\t'complex128': getComplex128,\n\t'complex64': getComplex64,\n\t'default': getArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Returns an element from a `Complex128Array`.\n*\n* @private\n* @param {Complex128Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Complex128Array from '@stdlib/array-complex128';\n*\n* var arr = new Complex128Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getComplex128( arr, 1 );\n* // returns [ 3.0, 4.0 ]\n*/\nfunction getComplex128( arr, idx ) {\n\treturn arr.get( idx );\n}\n\n/**\n* Returns an element from a `Complex64Array`.\n*\n* @private\n* @param {Complex64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Complex64Array from '@stdlib/array-complex64';\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getComplex64( arr, 1 );\n* // returns [ 3.0, 4.0 ]\n*/\nfunction getComplex64( arr, idx ) {\n\treturn arr.get( idx );\n}\n\n/**\n* Returns an element from an array-like object supporting the get/set protocol.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {*} element value\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* function get( idx ) {\n* return arr[ idx ];\n* }\n*\n* function set( value, idx ) {\n* arr[ idx ] = value;\n* }\n*\n* arr.get = get;\n* arr.set = set;\n*\n* var v = getArrayLike( arr, 2 );\n* // returns 3\n*/\nfunction getArrayLike( arr, idx ) {\n\treturn arr.get( idx );\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for retrieving an element from an array-like object supporting the get/set protocol.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* import Complex64Array from '@stdlib/array-complex64';\n* import dtype from '@stdlib/array-dtype';\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* var get = getter( dtype( arr ) );\n* var v = get( arr, 1 );\n* // returns [ 3.0, 4.0 ]\n*/\nfunction getter( dtype ) {\n\tvar f = GETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn GETTERS.default;\n}\n\n\n// EXPORTS //\n\nexport default getter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar SETTERS = {\n\t'complex128': setComplex128,\n\t'complex64': setComplex64,\n\t'default': setArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Sets an element in a `Complex128Array`.\n*\n* @private\n* @param {Complex128Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n*\n* @example\n* import Complex128Array from '@stdlib/array-complex128';\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var arr = new Complex128Array( [ 1, 2, 3, 4 ] );\n*\n* setComplex128( arr, 1, new Complex128( 10.0, 11.0 ) );\n* var v = arr.get( 1 );\n* // returns [ 10.0, 11.0 ]\n*/\nfunction setComplex128( arr, idx, value ) {\n\tarr.set( value, idx );\n}\n\n/**\n* Sets an element in a `Complex64Array`.\n*\n* @private\n* @param {Complex64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n*\n* @example\n* import Complex64Array from '@stdlib/array-complex64';\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* setComplex64( arr, 1, new Complex64( 10.0, 11.0 ) );\n* var v = arr.get( 1 );\n* // returns [ 10.0, 11.0 ]\n*/\nfunction setComplex64( arr, idx, value ) {\n\tarr.set( value, idx );\n}\n\n/**\n* Sets an element in an array-like object supporting the get/set protocol.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* function get( idx ) {\n* return arr[ idx ];\n* }\n*\n* function set( value, idx ) {\n* arr[ idx ] = value;\n* }\n*\n* arr.get = get;\n* arr.set = set;\n*\n* setArrayLike( arr, 2, 10 );\n*\n* var v = arr[ 2 ];\n* // returns 10\n*/\nfunction setArrayLike( arr, idx, value ) {\n\tarr.set( value, idx );\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for setting an element in an array-like object supporting the get/set protocol.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* import Complex64Array from '@stdlib/array-complex64';\n* import Complex64 from '@stdlib/complex-float32-ctor';\n* import dtype from '@stdlib/array-dtype';\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* var set = setter( dtype( arr ) );\n* set( arr, 1, new Complex64( 10.0, 11.0 ) );\n*\n* var v = arr.get( 1 );\n* // returns [ 10.0, 11.0 ]\n*/\nfunction setter( dtype ) {\n\tvar f = SETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn SETTERS.default;\n}\n\n\n// EXPORTS //\n\nexport default setter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar GETTERS = {\n\t'float64': getFloat64,\n\t'float32': getFloat32,\n\t'int32': getInt32,\n\t'int16': getInt16,\n\t'int8': getInt8,\n\t'uint32': getUint32,\n\t'uint16': getUint16,\n\t'uint8': getUint8,\n\t'uint8c': getUint8c,\n\t'generic': getGeneric,\n\t'default': getArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Returns an element from a `Float64Array`.\n*\n* @private\n* @param {Float64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var arr = new Float64Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getFloat64( arr, 2 );\n* // returns 3.0\n*/\nfunction getFloat64( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Float32Array`.\n*\n* @private\n* @param {Float32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Float32Array from '@stdlib/array-float32';\n*\n* var arr = new Float32Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getFloat32( arr, 2 );\n* // returns 3.0\n*/\nfunction getFloat32( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an `Int32Array`.\n*\n* @private\n* @param {Int32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Int32Array from '@stdlib/array-int32';\n*\n* var arr = new Int32Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getInt32( arr, 2 );\n* // returns 3\n*/\nfunction getInt32( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an `Int16Array`.\n*\n* @private\n* @param {Int16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Int16Array from '@stdlib/array-int16';\n*\n* var arr = new Int16Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getInt16( arr, 2 );\n* // returns 3\n*/\nfunction getInt16( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an `Int8Array`.\n*\n* @private\n* @param {Int8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Int8Array from '@stdlib/array-int8';\n*\n* var arr = new Int8Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getInt8( arr, 2 );\n* // returns 3\n*/\nfunction getInt8( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint32Array`.\n*\n* @private\n* @param {Uint32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Uint32Array from '@stdlib/array-uint32';\n*\n* var arr = new Uint32Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint32( arr, 2 );\n* // returns 3\n*/\nfunction getUint32( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint16Array`.\n*\n* @private\n* @param {Uint16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Uint16Array from '@stdlib/array-uint16';\n*\n* var arr = new Uint16Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint16( arr, 2 );\n* // returns 3\n*/\nfunction getUint16( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint8Array`.\n*\n* @private\n* @param {Uint8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Uint8Array from '@stdlib/array-uint8';\n*\n* var arr = new Uint8Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint8( arr, 2 );\n* // returns 3\n*/\nfunction getUint8( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint8ClampedArray`.\n*\n* @private\n* @param {Uint8ClampedArray} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Uint8ClampedArray from '@stdlib/array-uint8c';\n*\n* var arr = new Uint8ClampedArray( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint8c( arr, 2 );\n* // returns 3\n*/\nfunction getUint8c( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a generic `Array`.\n*\n* @private\n* @param {Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {*} element value\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var v = getGeneric( arr, 2 );\n* // returns 3\n*/\nfunction getGeneric( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an indexed array-like object.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {*} element value\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var v = getArrayLike( arr, 2 );\n* // returns 3\n*/\nfunction getArrayLike( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for retrieving an element from an indexed array-like object.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* import dtype from '@stdlib/array-dtype';\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var get = getter( dtype( arr ) );\n* var v = get( arr, 2 );\n* // returns 3\n*/\nfunction getter( dtype ) {\n\tvar f = GETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn GETTERS.default;\n}\n\n\n// EXPORTS //\n\nexport default getter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar SETTERS = {\n\t'float64': setFloat64,\n\t'float32': setFloat32,\n\t'int32': setInt32,\n\t'int16': setInt16,\n\t'int8': setInt8,\n\t'uint32': setUint32,\n\t'uint16': setUint16,\n\t'uint8': setUint8,\n\t'uint8c': setUint8c,\n\t'generic': setGeneric,\n\t'default': setArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Sets an element in a `Float64Array`.\n*\n* @private\n* @param {Float64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var arr = new Float64Array( 4 );\n*\n* setFloat64( arr, 2, 3.0 );\n*\n* var v = arr[ 2 ];\n* // returns 3.0\n*/\nfunction setFloat64( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Float32Array`.\n*\n* @private\n* @param {Float32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Float32Array from '@stdlib/array-float32';\n*\n* var arr = new Float32Array( 4 );\n*\n* setFloat32( arr, 2, 3.0 );\n*\n* var v = arr[ 2 ];\n* // returns 3.0\n*/\nfunction setFloat32( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an `Int32Array`.\n*\n* @private\n* @param {Int32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Int32Array from '@stdlib/array-int32';\n*\n* var arr = new Int32Array( 4 );\n*\n* setInt32( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setInt32( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an `Int16Array`.\n*\n* @private\n* @param {Int16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Int16Array from '@stdlib/array-int16';\n*\n* var arr = new Int16Array( 4 );\n*\n* setInt16( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setInt16( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an `Int8Array`.\n*\n* @private\n* @param {Int8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Int8Array from '@stdlib/array-int8';\n*\n* var arr = new Int8Array( 4 );\n*\n* setInt8( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setInt8( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint32Array`.\n*\n* @private\n* @param {Uint32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Uint32Array from '@stdlib/array-uint32';\n*\n* var arr = new Uint32Array( 4 );\n*\n* setUint32( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint32( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint16Array`.\n*\n* @private\n* @param {Uint16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Uint16Array from '@stdlib/array-uint16';\n*\n* var arr = new Uint16Array( 4 );\n*\n* setUint16( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint16( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint8Array`.\n*\n* @private\n* @param {Uint8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Uint8Array from '@stdlib/array-uint8';\n*\n* var arr = new Uint8Array( 4 );\n*\n* setUint8( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint8( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint8ClampedArray`.\n*\n* @private\n* @param {Uint8ClampedArray} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Uint8ClampedArray from '@stdlib/array-uint8c';\n*\n* var arr = new Uint8ClampedArray( 4 );\n*\n* setUint8c( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint8c( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a generic `Array`.\n*\n* @private\n* @param {Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {*} value - value to set\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* setGeneric( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setGeneric( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an indexed array-like object.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {*} value - value to set\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* setArrayLike( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setArrayLike( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for setting an element in an indexed array-like object.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* import dtype from '@stdlib/array-dtype';\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var set = setter( dtype( arr ) );\n* set( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setter( dtype ) {\n\tvar f = SETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn SETTERS.default;\n}\n\n\n// EXPORTS //\n\nexport default setter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the number of elements in an array.\n*\n* @param {(NonNegativeIntegerArray|EmptyArray)} shape - array shape\n* @returns {NonNegativeInteger} number of elements\n*\n* @example\n* var n = numel( [ 3, 3, 3 ] );\n* // returns 27\n*/\nfunction numel( shape ) {\n\tvar ndims;\n\tvar n;\n\tvar i;\n\n\tndims = shape.length;\n\tif ( ndims === 0 ) {\n\t\treturn 0;\n\t}\n\tn = 1;\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tn *= shape[ i ];\n\t}\n\treturn n;\n}\n\n\n// EXPORTS //\n\nexport default numel;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Copies the elements of an indexed array-like object to a new \"generic\" array.\n*\n* @param {Collection} x - input array\n* @returns {Array} output array\n*\n* @example\n* var out = copy( [ 1, 2, 3 ] );\n* // returns [ 1, 2, 3 ]\n*/\nfunction copy( x ) {\n\tvar out;\n\tvar len;\n\tvar i;\n\n\tlen = x.length;\n\tout = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tout.push( x[ i ] ); // use `Array#push` to ensure \"fast\" elements\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default copy;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a string primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a string primitive\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns true\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns false\n*/\nfunction isString( value ) {\n\treturn ( typeof value === 'string' );\n}\n\n\n// EXPORTS //\n\nexport default isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasSymbols from '@stdlib/assert-has-symbol-support';\n\n\n// VARIABLES //\n\nvar FLG = hasSymbols();\n\n\n// MAIN //\n\n/**\n* Tests for native `Symbol.toStringTag` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Symbol.toStringTag` support\n*\n* @example\n* var bool = hasToStringTagSupport();\n* // returns \n*/\nfunction hasToStringTagSupport() {\n\treturn ( FLG && typeof Symbol.toStringTag === 'symbol' );\n}\n\n\n// EXPORTS //\n\nexport default hasToStringTagSupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests for native `Symbol` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Symbol` support\n*\n* @example\n* var bool = hasSymbolSupport();\n* // returns \n*/\nfunction hasSymbolSupport() {\n\treturn (\n\t\ttypeof Symbol === 'function' &&\n\t\ttypeof Symbol( 'foo' ) === 'symbol'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default hasSymbolSupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar toStr = Object.prototype.toString;\n\n\n// EXPORTS //\n\nexport default toStr;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// FUNCTIONS //\n\nvar has = Object.prototype.hasOwnProperty;\n\n\n// MAIN //\n\n/**\n* Tests if an object has a specified property.\n*\n* @param {*} value - value to test\n* @param {*} property - property to test\n* @returns {boolean} boolean indicating if an object has a specified property\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = hasOwnProp( beep, 'boop' );\n* // returns true\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = hasOwnProp( beep, 'bap' );\n* // returns false\n*/\nfunction hasOwnProp( value, property ) {\n\tif (\n\t\tvalue === void 0 ||\n\t\tvalue === null\n\t) {\n\t\treturn false;\n\t}\n\treturn has.call( value, property );\n}\n\n\n// EXPORTS //\n\nexport default hasOwnProp;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar Sym = ( typeof Symbol === 'function' ) ? Symbol : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default Sym;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Symbol from '@stdlib/symbol-ctor';\n\n\n// MAIN //\n\nvar toStrTag = ( typeof Symbol === 'function' ) ? Symbol.toStringTag : '';\n\n\n// EXPORTS //\n\nexport default toStrTag;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a string value indicating a specification defined classification of an object.\n*\n* @module @stdlib/utils-native-class\n*\n* @example\n* import nativeClass from '@stdlib/utils-native-class';\n*\n* var str = nativeClass( 'a' );\n* // returns '[object String]'\n*\n* str = nativeClass( 5 );\n* // returns '[object Number]'\n*\n* function Beep() {\n* return this;\n* }\n* str = nativeClass( new Beep() );\n* // returns '[object Object]'\n*/\n\n// MODULES //\n\nimport hasToStringTag from '@stdlib/assert-has-tostringtag-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar main;\nif ( hasToStringTag() ) {\n\tmain = polyfill;\n} else {\n\tmain = builtin;\n}\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport toStringTag from './tostringtag.js';\nimport toStr from './tostring.js';\n\n\n// MAIN //\n\n/**\n* Returns a string value indicating a specification defined classification of an object in environments supporting `Symbol.toStringTag`.\n*\n* @param {*} v - input value\n* @returns {string} string value indicating a specification defined classification of the input value\n*\n* @example\n* var str = nativeClass( 'a' );\n* // returns '[object String]'\n*\n* @example\n* var str = nativeClass( 5 );\n* // returns '[object Number]'\n*\n* @example\n* function Beep() {\n* return this;\n* }\n* var str = nativeClass( new Beep() );\n* // returns '[object Object]'\n*/\nfunction nativeClass( v ) {\n\tvar isOwn;\n\tvar tag;\n\tvar out;\n\n\tif ( v === null || v === void 0 ) {\n\t\treturn toStr.call( v );\n\t}\n\ttag = v[ toStringTag ];\n\tisOwn = hasOwnProp( v, toStringTag );\n\n\t// Attempt to override the `toStringTag` property. For built-ins having a `Symbol.toStringTag` property (e.g., `JSON`, `Math`, etc), the `Symbol.toStringTag` property is read-only (e.g., , so we need to wrap in a `try/catch`.\n\ttry {\n\t\tv[ toStringTag ] = void 0;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn toStr.call( v );\n\t}\n\tout = toStr.call( v );\n\n\tif ( isOwn ) {\n\t\tv[ toStringTag ] = tag;\n\t} else {\n\t\tdelete v[ toStringTag ];\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default nativeClass;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport toStr from './tostring.js';\n\n\n// MAIN //\n\n/**\n* Returns a string value indicating a specification defined classification (via the internal property `[[Class]]`) of an object.\n*\n* @param {*} v - input value\n* @returns {string} string value indicating a specification defined classification of the input value\n*\n* @example\n* var str = nativeClass( 'a' );\n* // returns '[object String]'\n*\n* @example\n* var str = nativeClass( 5 );\n* // returns '[object Number]'\n*\n* @example\n* function Beep() {\n* return this;\n* }\n* var str = nativeClass( new Beep() );\n* // returns '[object Object]'\n*/\nfunction nativeClass( v ) {\n\treturn toStr.call( v );\n}\n\n\n// EXPORTS //\n\nexport default nativeClass;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// eslint-disable-next-line stdlib/no-redeclare\nvar valueOf = String.prototype.valueOf; // non-generic\n\n\n// EXPORTS //\n\nexport default valueOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasToStringTag from '@stdlib/assert-has-tostringtag-support';\nimport nativeClass from '@stdlib/utils-native-class';\nimport test from './try2valueof.js';\n\n\n// VARIABLES //\n\nvar FLG = hasToStringTag();\n\n\n// MAIN //\n\n/**\n* Tests if a value is a string object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a string object\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns false\n*/\nfunction isString( value ) {\n\tif ( typeof value === 'object' ) {\n\t\tif ( value instanceof String ) {\n\t\t\treturn true;\n\t\t}\n\t\tif ( FLG ) {\n\t\t\treturn test( value );\n\t\t}\n\t\treturn ( nativeClass( value ) === '[object String]' );\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport valueOf from './valueof.js'; // eslint-disable-line stdlib/no-redeclare\n\n\n// MAIN //\n\n/**\n* Attempts to extract a string value.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a string can be extracted\n*/\nfunction test( value ) {\n\ttry {\n\t\tvalueOf.call( value );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default test;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a string.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a string\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns true\n*/\nfunction isString( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests whether an input value is the string representing column-major order.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean result\n*\n* @example\n* var bool = isColumnMajorString( 'column-major' );\n* // returns true\n*\n* bool = isColumnMajorString( 'row-major' );\n* // returns false\n*\n* bool = isColumnMajorString( 'foo' );\n* // returns false\n*/\nfunction isColumnMajorString( v ) {\n\treturn ( v === 'column-major' );\n}\n\n\n// EXPORTS //\n\nexport default isColumnMajorString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isColumnMajor from '@stdlib/ndarray-base-assert-is-column-major-string';\n\n\n// FUNCTIONS //\n\n/**\n* Generates a stride array from an array shape (row-major).\n*\n* @private\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} array strides\n*/\nfunction rowmajor( shape ) {\n\tvar ndims;\n\tvar out;\n\tvar s;\n\tvar i;\n\n\tndims = shape.length;\n\tout = [];\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tout.push( 0 );\n\t}\n\ts = 1;\n\tfor ( i = ndims-1; i >= 0; i-- ) {\n\t\tout[ i ] = s;\n\t\ts *= shape[ i ];\n\t}\n\treturn out;\n}\n\n/**\n* Generates a stride array from an array shape (column-major).\n*\n* @private\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} array strides\n*/\nfunction columnmajor( shape ) {\n\tvar out;\n\tvar s;\n\tvar i;\n\n\tout = [];\n\ts = 1;\n\tfor ( i = 0; i < shape.length; i++ ) {\n\t\tout.push( s );\n\t\ts *= shape[ i ];\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Generates a stride array from an array shape.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {string} order - specifies whether an array is row-major (C-style) or column-major (Fortran-style)\n* @returns {Array} array strides\n*\n* @example\n* var s = shape2strides( [ 3, 2 ], 'row-major' );\n* // returns [ 2, 1 ]\n*\n* s = shape2strides( [ 3, 2 ], 'column-major' );\n* // returns [ 1, 3 ]\n*/\nfunction shape2strides( shape, order ) {\n\tif ( isColumnMajor( order ) ) {\n\t\treturn columnmajor( shape );\n\t}\n\treturn rowmajor( shape );\n}\n\n\n// EXPORTS //\n\nexport default shape2strides;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a string.\n*\n* @module @stdlib/assert-is-string\n*\n* @example\n* import isString from '@stdlib/assert-is-string';\n*\n* var bool = isString( 'beep' );\n* // returns true\n*\n* bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* bool = isString( 5 );\n* // returns false\n*\n* @example\n* import { isObject as isString } from '@stdlib/assert-is-string';\n*\n* var bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* bool = isString( 'beep' );\n* // returns false\n*\n* @example\n* import { isPrimitive as isString } from '@stdlib/assert-is-string';\n*\n* var bool = isString( 'beep' );\n* // returns true\n*\n* bool = isString( new String( 'beep' ) );\n* // returns false\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate a stride array from an array shape.\n*\n* @module @stdlib/ndarray-base-shape2strides\n*\n* @example\n* import shape2strides from '@stdlib/ndarray-base-shape2strides';\n*\n* var strides = shape2strides( [ 3, 2 ], 'row-major' );\n* // returns [ 2, 1 ]\n*\n* strides = shape2strides( [ 3, 2 ], 'column-major' );\n* // returns [ 1, 3 ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport assign from './assign.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isColumnMajor from '@stdlib/ndarray-base-assert-is-column-major-string';\n\n\n// FUNCTIONS //\n\n/**\n* Generates a stride array from an array shape (row-major).\n*\n* @private\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {(Array|TypedArray|Object)} out - output object\n* @returns {(Array|TypedArray|Object)} array strides\n*/\nfunction rowmajor( shape, out ) {\n\tvar ndims;\n\tvar s;\n\tvar i;\n\n\tndims = shape.length;\n\ts = 1;\n\tfor ( i = ndims-1; i >= 0; i-- ) {\n\t\tout[ i ] = s;\n\t\ts *= shape[ i ];\n\t}\n\treturn out;\n}\n\n/**\n* Generates a stride array from an array shape (column-major).\n*\n* @private\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {(Array|TypedArray|Object)} out - output object\n* @returns {(Array|TypedArray|Object)} array strides\n*/\nfunction columnmajor( shape, out ) {\n\tvar s;\n\tvar i;\n\n\ts = 1;\n\tfor ( i = 0; i < shape.length; i++ ) {\n\t\tout[ i ] = s;\n\t\ts *= shape[ i ];\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Generates a stride array from an array shape.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {string} order - specifies whether an array is row-major (C-style) or column-major (Fortran-style)\n* @param {(Array|TypedArray|Object)} out - output object\n* @returns {(Array|TypedArray|Object)} array strides\n*\n* @example\n* var strides = [ 0, 0 ];\n*\n* var out = shape2strides( [ 3, 2 ], 'row-major', strides );\n* // returns [ 2, 1 ]\n*\n* var bool = ( out === strides );\n* // returns true\n*\n* out = shape2strides( [ 3, 2 ], 'column-major', strides );\n* // returns [ 1, 3 ]\n*/\nfunction shape2strides( shape, order, out ) {\n\tif ( isColumnMajor( order ) ) {\n\t\treturn columnmajor( shape, out );\n\t}\n\treturn rowmajor( shape, out );\n}\n\n\n// EXPORTS //\n\nexport default shape2strides;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport shape2strides from '@stdlib/ndarray-base-shape2strides';\nimport copyIndexed from '@stdlib/array-base-copy-indexed';\n\n\n// VARIABLES //\n\nvar ROW_MAJOR = 'row-major';\n\n\n// MAIN //\n\n/**\n* Returns the strides of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @param {boolean} copy - boolean indicating whether to explicitly copy the value assigned to the input ndarray's `strides` property\n* @returns {IntegerArray} strides\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var out = strides( zeros( [ 3, 3, 3 ] ), false );\n* // returns [ 9, 3, 1 ]\n*/\nfunction strides( x, copy ) {\n\tvar ord;\n\tvar sh;\n\tvar st;\n\n\tst = x.strides;\n\tif ( typeof st !== 'object' || st === null ) {\n\t\tsh = x.shape;\n\t\tif ( sh.length === 0 ) {\n\t\t\treturn [ 0 ];\n\t\t}\n\t\tord = x.order;\n\t\tif ( !isString( ord ) ) {\n\t\t\tord = ROW_MAJOR;\n\t\t}\n\t\treturn shape2strides( sh, ord );\n\t}\n\tif ( copy ) {\n\t\treturn copyIndexed( st );\n\t}\n\treturn st;\n}\n\n\n// EXPORTS //\n\nexport default strides;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a number primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive\n*\n* @example\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* @example\n* var bool = isNumber( NaN );\n* // returns true\n*\n* @example\n* var bool = isNumber( new Number( 3.14 ) );\n* // returns false\n*/\nfunction isNumber( value ) {\n\treturn ( typeof value === 'number' );\n}\n\n\n// EXPORTS //\n\nexport default isNumber;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// EXPORTS //\n\nexport default Number; // eslint-disable-line stdlib/require-globals\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Number from '@stdlib/number-ctor';\n\n\n// MAIN //\n\n// eslint-disable-next-line stdlib/no-redeclare\nvar toString = Number.prototype.toString; // non-generic\n\n\n// EXPORTS //\n\nexport default toString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasToStringTag from '@stdlib/assert-has-tostringtag-support';\nimport nativeClass from '@stdlib/utils-native-class';\nimport Number from '@stdlib/number-ctor';\nimport test from './try2serialize.js';\n\n\n// VARIABLES //\n\nvar FLG = hasToStringTag();\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object\n*\n* @example\n* var bool = isNumber( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*/\nfunction isNumber( value ) {\n\tif ( typeof value === 'object' ) {\n\t\tif ( value instanceof Number ) {\n\t\t\treturn true;\n\t\t}\n\t\tif ( FLG ) {\n\t\t\treturn test( value );\n\t\t}\n\t\treturn ( nativeClass( value ) === '[object Number]' );\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isNumber;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport toString from './tostring.js'; // eslint-disable-line stdlib/no-redeclare\n\n\n// MAIN //\n\n/**\n* Attempts to serialize a value to a string.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value can be serialized\n*/\nfunction test( value ) {\n\ttry {\n\t\ttoString.call( value );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default test;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a number\n*\n* @example\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* @example\n* var bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*\n* @example\n* var bool = isNumber( NaN );\n* // returns true\n*\n* @example\n* var bool = isNumber( null );\n* // returns false\n*/\nfunction isNumber( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isNumber;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport strides2offset from '@stdlib/ndarray-base-strides2offset';\n\n\n// MAIN //\n\n/**\n* Returns the index offset specifying the underlying buffer index of the first iterated ndarray element.\n*\n* @param {ndarrayLike} x - input ndarray\n* @returns {NonNegativeInteger} index offset\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var n = offset( zeros( [ 3, 3, 3 ] ) );\n* // returns 0\n*/\nfunction offset( x ) {\n\tvar st;\n\tvar sh;\n\tvar o;\n\n\to = x.offset;\n\tif ( isNumber( o ) ) {\n\t\treturn o;\n\t}\n\tsh = x.shape;\n\tif ( sh.length === 0 ) {\n\t\treturn 0;\n\t}\n\tst = x.strides;\n\tif ( typeof st !== 'object' || st === null ) {\n\t\treturn 0;\n\t}\n\treturn strides2offset( sh, st );\n}\n\n\n// EXPORTS //\n\nexport default offset;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the index offset which specifies the location of the first indexed value in a multidimensional array based on a stride array.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @returns {NonNegativeInteger} offset - offset\n*\n* @example\n* var shape = [ 2, 3, 10 ];\n* var strides = [ 30, -10, 1 ];\n*\n* var offset = strides2offset( shape, strides );\n* // returns 20\n*/\nfunction strides2offset( shape, strides ) {\n\tvar offset;\n\tvar ndims;\n\tvar i;\n\n\tndims = shape.length;\n\toffset = 0;\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tif ( strides[ i ] < 0 ) {\n\t\t\t// Note that, since the stride is negative, this operation increments, not decrements, the offset...\n\t\t\toffset -= strides[ i ] * ( shape[ i ]-1 );\n\t\t}\n\t}\n\treturn offset;\n}\n\n\n// EXPORTS //\n\nexport default strides2offset;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Computes the absolute value of a double-precision floating-point number `x`.\n*\n* @param {number} x - input value\n* @returns {number} absolute value\n*\n* @example\n* var v = abs( -1.0 );\n* // returns 1.0\n*\n* @example\n* var v = abs( 2.0 );\n* // returns 2.0\n*\n* @example\n* var v = abs( 0.0 );\n* // returns 0.0\n*\n* @example\n* var v = abs( -0.0 );\n* // returns 0.0\n*\n* @example\n* var v = abs( NaN );\n* // returns NaN\n*/\nfunction abs( x ) {\n\treturn Math.abs( x ); // eslint-disable-line stdlib/no-builtin-math\n}\n\n\n// EXPORTS //\n\nexport default abs;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport abs from '@stdlib/math-base-special-abs';\n\n\n// MAIN //\n\n/**\n* Determines the order of a multidimensional array based on a provided stride array.\n*\n* @param {IntegerArray} strides - stride array\n* @returns {integer} order\n*\n* @example\n* var order = strides2order( [ 2, 1 ] );\n* // returns 1\n*\n* order = strides2order( [ 1, 2 ] );\n* // returns 2\n*\n* order = strides2order( [ 1, 1, 1 ] );\n* // returns 3\n*\n* order = strides2order( [ 2, 3, 1 ] );\n* // returns 0\n*/\nfunction strides2order( strides ) {\n\tvar column;\n\tvar ndims;\n\tvar row;\n\tvar s1;\n\tvar s2;\n\tvar i;\n\n\tndims = strides.length;\n\tif ( ndims === 0 ) {\n\t\treturn 0|0; // 'none'\n\t}\n\tcolumn = true;\n\trow = true;\n\n\ts1 = abs( strides[ 0 ] );\n\tfor ( i = 1; i < ndims; i++ ) {\n\t\ts2 = abs( strides[ i ] );\n\t\tif ( column && s2 < s1 ) {\n\t\t\tcolumn = false;\n\t\t} else if ( row && s2 > s1 ) {\n\t\t\trow = false;\n\t\t}\n\t\tif ( row || column ) {\n\t\t\ts1 = s2;\n\t\t} else {\n\t\t\treturn 0|0; // 'none'\n\t\t}\n\t}\n\tif ( row && column ) {\n\t\treturn 3|0; // 'both'\n\t}\n\tif ( row ) {\n\t\treturn 1|0; // 'row-major'\n\t}\n\treturn 2|0; // 'column-major'\n}\n\n\n// EXPORTS //\n\nexport default strides2order;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a number.\n*\n* @module @stdlib/assert-is-number\n*\n* @example\n* import isNumber from '@stdlib/assert-is-number';\n*\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*\n* bool = isNumber( NaN );\n* // returns true\n*\n* bool = isNumber( null );\n* // returns false\n*\n* @example\n* import { isPrimitive as isNumber } from '@stdlib/assert-is-number';\n*\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* bool = isNumber( NaN );\n* // returns true\n*\n* bool = isNumber( new Number( 3.14 ) );\n* // returns false\n*\n* @example\n* import { isObject as isNumber } from '@stdlib/assert-is-number';\n*\n* var bool = isNumber( 3.14 );\n* // returns false\n*\n* bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// VARIABLES //\n\nvar ROW_MAJOR = 'row-major';\nvar COLUMN_MAJOR = 'column-major';\n\n\n// MAIN //\n\n/**\n* Returns the layout order of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @returns {(string|null)} layout order\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var x = zeros( [ 3, 3, 3 ], {\n* 'order': 'row-major'\n* });\n*\n* var out = order( x );\n* // returns 'row-major'\n*/\nfunction order( x ) {\n\tvar st;\n\tvar o;\n\n\to = x.order;\n\tif ( isString( o ) ) {\n\t\treturn o;\n\t}\n\t// Try to infer the layout order from the strides array...\n\tst = x.strides;\n\tif ( typeof st !== 'object' || st === null ) {\n\t\treturn ROW_MAJOR; // WARNING: default to row-major for ndarray-like objects lacking strides. This may or may not be accurate, and we're defaulting to row-major here based on the belief that row-major is more likely given that, e.g., JavaScript arrays are similar to C arrays (i.e., stored in row-major order).\n\t}\n\to = strides2order( st );\n\tif ( o === 1 || o === 3 ) {\n\t\treturn ROW_MAJOR; // for o == 3 (both row- and column-major; e.g., one-dimensional ndarrays), default to row-major\n\t}\n\tif ( o === 2 ) {\n\t\treturn COLUMN_MAJOR;\n\t}\n\t// o === 0\n\tif ( x.shape.length === 0 ) {\n\t\treturn ROW_MAJOR; // default to row-major for zero-dimensional ndarrays\n\t}\n\t// Case: mixed strides (e.g., [ 2, 3, 1 ] )\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default order;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isAccessorArray from '@stdlib/array-base-assert-is-accessor-array';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport accessorSetter from '@stdlib/array-base-accessor-setter';\nimport getter from '@stdlib/array-base-getter';\nimport setter from '@stdlib/array-base-setter';\nimport numel from '@stdlib/ndarray-base-numel';\nimport getDType from '@stdlib/ndarray-base-dtype';\nimport getShape from '@stdlib/ndarray-base-shape';\nimport getStrides from '@stdlib/ndarray-base-strides';\nimport getOffset from '@stdlib/ndarray-base-offset';\nimport getOrder from '@stdlib/ndarray-base-order';\nimport getData from '@stdlib/ndarray-base-data-buffer';\n\n\n// MAIN //\n\n/**\n* Converts an ndarray-like object to an object likely to have the same \"shape\".\n*\n* ## Notes\n*\n* - This function is intended as a potential performance optimization. In V8, for example, even if two objects share common properties, if those properties were added in different orders or if one object has additional properties not shared by the other object, then those objects will have different \"hidden\" classes. If a function is provided many objects having different \"shapes\", some JavaScript VMs (e.g., V8) will consider the function \"megamorphic\" and fail to perform various runtime optimizations. Accordingly, the intent of this function is to standardize the \"shape\" of the object holding ndarray meta data to ensure that internal functions operating on ndarrays are provided consistent argument \"shapes\".\n*\n* - The returned object has the following properties:\n*\n* - **ref**: reference to the original ndarray-like object.\n* - **dtype**: underlying data type.\n* - **data**: data buffer.\n* - **length**: number of elements.\n* - **shape**: array dimensions.\n* - **strides**: array strides.\n* - **offset**: index offset.\n* - **order**: order.\n* - **accessorProtocol**: `boolean` indicating whether the data buffer supports the get/set protocol (i.e., uses accessors for getting and setting elements).\n* - **accessors**: a two-element array whose first element is an accessor for retrieving an ndarray element and whose second element is an accessor for setting an ndarray element.\n*\n* @param {ndarrayLike} x - ndarray-like object\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @returns {Object} object containing ndarray meta data\n*\n* @example\n* import array from '@stdlib/ndarray-array';\n*\n* var x = array( [ [ 1, 2, 3 ], [ 4, 5, 6 ] ] );\n*\n* var obj = ndarraylike2object( x );\n* // returns {...}\n*/\nfunction ndarraylike2object( x ) {\n\tvar xbuf;\n\tvar bool;\n\tvar sh;\n\tvar dt;\n\n\txbuf = getData( x );\n\tsh = getShape( x, true );\n\tdt = getDType( x );\n\n\tbool = isAccessorArray( xbuf );\n\n\treturn {\n\t\t'ref': x,\n\t\t'dtype': dt,\n\t\t'data': xbuf,\n\t\t'length': numel( sh ),\n\t\t'shape': sh,\n\t\t'strides': getStrides( x, true ),\n\t\t'offset': getOffset( x ),\n\t\t'order': getOrder( x ),\n\t\t'accessorProtocol': bool,\n\t\t'accessors': ( bool ) ?\n\t\t\t[ accessorGetter( dt ), accessorSetter( dt ) ] :\n\t\t\t[ getter( dt ), setter( dt ) ]\n\t};\n}\n\n\n// EXPORTS //\n\nexport default ndarraylike2object;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the underlying data buffer of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @returns {Collection} underlying data buffer\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var x = zeros( [ 3, 3, 3 ], {\n* 'dtype': 'float64'\n* });\n*\n* var out = data( x );\n* // returns \n*/\nfunction data( x ) {\n\treturn x.data;\n}\n\n\n// EXPORTS //\n\nexport default data;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport copyIndexed from '@stdlib/array-base-copy-indexed';\n\n\n// MAIN //\n\n/**\n* Returns the shape of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @param {boolean} copy - boolean indicating whether to explicitly copy the value assigned to the input ndarray's `shape` property\n* @returns {NonNegativeIntegerArray} shape\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var out = shape( zeros( [ 3, 3, 3 ] ), false );\n* // returns [ 3, 3, 3 ]\n*/\nfunction shape( x, copy ) {\n\tvar sh = x.shape;\n\tif ( copy ) {\n\t\treturn copyIndexed( sh );\n\t}\n\treturn sh;\n}\n\n\n// EXPORTS //\n\nexport default shape;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the data type of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @returns {string} data type\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var x = zeros( [ 3, 3, 3 ], {\n* 'dtype': 'float64'\n* });\n*\n* var dt = dtype( x );\n* // returns 'float64'\n*/\nfunction dtype( x ) {\n\treturn x.dtype;\n}\n\n\n// EXPORTS //\n\nexport default dtype;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar f;\n\n\n// FUNCTIONS //\n\n/**\n* Tests if a value is an array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an array\n*\n* @example\n* var bool = isArray( [] );\n* // returns true\n*\n* @example\n* var bool = isArray( {} );\n* // returns false\n*/\nfunction isArray( value ) {\n\treturn ( nativeClass( value ) === '[object Array]' );\n}\n\n\n// MAIN //\n\nif ( Array.isArray ) {\n\tf = Array.isArray;\n} else {\n\tf = isArray;\n}\n\n\n// EXPORTS //\n\nexport default f;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArray from '@stdlib/assert-is-array';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns a function which tests if every element in an array passes a test condition.\n*\n* @param {Function} predicate - function to apply\n* @throws {TypeError} must provide a function\n* @returns {Function} an array function\n*\n* @example\n* import isOdd from '@stdlib/assert-is-odd';\n*\n* var arr1 = [ 1, 3, 5, 7 ];\n* var arr2 = [ 3, 5, 8 ];\n*\n* var validate = arrayfcn( isOdd );\n*\n* var bool = validate( arr1 );\n* // returns true\n*\n* bool = validate( arr2 );\n* // returns false\n*/\nfunction arrayfcn( predicate ) {\n\tif ( typeof predicate !== 'function' ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a function. Value: `%s`.', predicate ) );\n\t}\n\treturn every;\n\n\t/**\n\t* Tests if every element in an array passes a test condition.\n\t*\n\t* @private\n\t* @param {*} value - value to test\n\t* @returns {boolean} boolean indicating whether a value is an array for which all elements pass a test condition\n\t*/\n\tfunction every( value ) {\n\t\tvar len;\n\t\tvar i;\n\t\tif ( !isArray( value ) ) {\n\t\t\treturn false;\n\t\t}\n\t\tlen = value.length;\n\t\tif ( len === 0 ) {\n\t\t\treturn false;\n\t\t}\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tif ( predicate( value[ i ] ) === false ) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default arrayfcn;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is object-like.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is object-like\n*\n* @example\n* var bool = isObjectLike( {} );\n* // returns true\n*\n* @example\n* var bool = isObjectLike( [] );\n* // returns true\n*\n* @example\n* var bool = isObjectLike( null );\n* // returns false\n*/\nfunction isObjectLike( value ) {\n\treturn (\n\t\tvalue !== null &&\n\t\ttypeof value === 'object'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isObjectLike;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isObjectLike from '@stdlib/assert-is-object-like';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Buffer instance.\n*\n* @param {*} value - value to validate\n* @returns {boolean} boolean indicating if a value is a Buffer instance\n*\n* @example\n* var v = isBuffer( new Buffer( 'beep' ) );\n* // returns true\n*\n* @example\n* var v = isBuffer( new Buffer( [1,2,3,4] ) );\n* // returns true\n*\n* @example\n* var v = isBuffer( {} );\n* // returns false\n*\n* @example\n* var v = isBuffer( [] );\n* // returns false\n*/\nfunction isBuffer( value ) {\n\treturn (\n\t\tisObjectLike( value ) &&\n\t\t(\n\t\t\t// eslint-disable-next-line no-underscore-dangle\n\t\t\tvalue._isBuffer || // for envs missing Object.prototype.constructor (e.g., Safari 5-7)\n\t\t\t(\n\t\t\t\tvalue.constructor &&\n\n\t\t\t\t// WARNING: `typeof` is not a foolproof check, as certain envs consider RegExp and NodeList instances to be functions\n\t\t\t\ttypeof value.constructor.isBuffer === 'function' &&\n\t\t\t\tvalue.constructor.isBuffer( value )\n\t\t\t)\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isBuffer;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns a regular expression to capture everything that is not a space immediately after the `function` keyword and before the first left parenthesis.\n*\n* @returns {RegExp} regular expression\n*\n* @example\n* var RE_FUNCTION_NAME = reFunctionName();\n*\n* function fname( fcn ) {\n* return RE_FUNCTION_NAME.exec( fcn.toString() )[ 1 ];\n* }\n*\n* var fn = fname( Math.sqrt );\n* // returns 'sqrt'\n*\n* fn = fname( Int8Array );\n* // returns 'Int8Array'\n*\n* fn = fname( Object.prototype.toString );\n* // returns 'toString'\n*\n* fn = fname( function(){} );\n* // returns ''\n*/\nfunction reFunctionName() {\n\treturn /^\\s*function\\s*([^(]*)/i;\n}\n\n\n// EXPORTS //\n\nexport default reFunctionName;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is object-like.\n*\n* @module @stdlib/assert-is-object-like\n*\n* @example\n* import isObjectLike from '@stdlib/assert-is-object-like';\n*\n* var bool = isObjectLike( {} );\n* // returns true\n*\n* bool = isObjectLike( [] );\n* // returns true\n*\n* bool = isObjectLike( null );\n* // returns false\n*\n* @example\n* import { isObjectLikeArray as isObjectLike } from '@stdlib/assert-is-object-like';\n*\n* var bool = isObjectLike( [ {}, [] ] );\n* // returns true\n*\n* bool = isObjectLike( [ {}, '3.0' ] );\n* // returns false\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport arrayfun from '@stdlib/assert-tools-array-function';\nimport main from './main.js';\n\n\n// VARIABLES //\n\nvar isObjectLikeArray = arrayfun( main );\n\n\n// MAIN //\n\nsetReadOnly( main, 'isObjectLikeArray', isObjectLikeArray );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport reFunctionName from './main.js';\n\n\n// MAIN //\n\n/**\n* Captures everything that is not a space immediately after the `function` keyword and before the first left parenthesis.\n*\n* Regular expression: `/^\\s*function\\s*([^(]*)/i`\n*\n* - `/^\\s*`\n* - Match zero or more spaces at beginning\n*\n* - `function`\n* - Match the word `function`\n*\n* - `\\s*`\n* - Match zero or more spaces after the word `function`\n*\n* - `()`\n* - Capture\n*\n* - `[^(]*`\n* - Match anything except a left parenthesis `(` zero or more times\n*\n* - `/i`\n* - ignore case\n*\n* @constant\n* @type {RegExp}\n* @default /^\\s*function\\s*([^(]*)/i\n*/\nvar RE_FUNCTION_NAME = reFunctionName();\n\n\n// EXPORTS //\n\nexport default RE_FUNCTION_NAME;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\nimport { REGEXP as RE } from '@stdlib/regexp-function-name';\nimport isBuffer from '@stdlib/assert-is-buffer';\n\n\n// MAIN //\n\n/**\n* Determines the name of a value's constructor.\n*\n* @param {*} v - input value\n* @returns {string} name of a value's constructor\n*\n* @example\n* var v = constructorName( 'a' );\n* // returns 'String'\n*\n* @example\n* var v = constructorName( 5 );\n* // returns 'Number'\n*\n* @example\n* var v = constructorName( null );\n* // returns 'Null'\n*\n* @example\n* var v = constructorName( undefined );\n* // returns 'Undefined'\n*\n* @example\n* var v = constructorName( function noop() {} );\n* // returns 'Function'\n*/\nfunction constructorName( v ) {\n\tvar match;\n\tvar name;\n\tvar ctor;\n\tname = nativeClass( v ).slice( 8, -1 );\n\tif ( (name === 'Object' || name === 'Error') && v.constructor ) {\n\t\tctor = v.constructor;\n\t\tif ( typeof ctor.name === 'string' ) {\n\t\t\treturn ctor.name;\n\t\t}\n\t\tmatch = RE.exec( ctor.toString() );\n\t\tif ( match ) {\n\t\t\treturn match[ 1 ];\n\t\t}\n\t}\n\tif ( isBuffer( v ) ) {\n\t\treturn 'Buffer';\n\t}\n\treturn name;\n}\n\n\n// EXPORTS //\n\nexport default constructorName;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Regular expression to capture everything that is not a space immediately after the `function` keyword and before the first left parenthesis.\n*\n* @module @stdlib/regexp-function-name\n*\n* @example\n* import reFunctionName from '@stdlib/regexp-function-name';\n* var RE_FUNCTION_NAME = reFunctionName();\n*\n* function fname( fcn ) {\n* return RE_FUNCTION_NAME.exec( fcn.toString() )[ 1 ];\n* }\n*\n* var fn = fname( Math.sqrt );\n* // returns 'sqrt'\n*\n* fn = fname( Int8Array );\n* // returns 'Int8Array'\n*\n* fn = fname( Object.prototype.toString );\n* // returns 'toString'\n*\n* fn = fname( function(){} );\n* // returns ''\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport REGEXP from './regexp.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'REGEXP', REGEXP );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n// Mapping from array constructors to data types...\nvar ctor2dtypes = {\n\t'Float32Array': 'float32',\n\t'Float64Array': 'float64',\n\t'Array': 'generic',\n\t'Int16Array': 'int16',\n\t'Int32Array': 'int32',\n\t'Int8Array': 'int8',\n\t'Uint16Array': 'uint16',\n\t'Uint32Array': 'uint32',\n\t'Uint8Array': 'uint8',\n\t'Uint8ClampedArray': 'uint8c',\n\t'Complex64Array': 'complex64',\n\t'Complex128Array': 'complex128',\n\t'BooleanArray': 'bool'\n};\n\n\n// EXPORTS //\n\nexport default ctor2dtypes;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasFloat64Array = ( typeof Float64Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Float64Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Float64Array\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var bool = isFloat64Array( new Float64Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isFloat64Array( [] );\n* // returns false\n*/\nfunction isFloat64Array( value ) {\n\treturn (\n\t\t( hasFloat64Array && value instanceof Float64Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Float64Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isFloat64Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Float64Array === 'function' ) ? Float64Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Float64Array === 'function' ) ? Float64Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of double-precision floating-point numbers in the platform byte order.\n*\n* @module @stdlib/array-float64\n*\n* @example\n* import ctor from '@stdlib/array-float64';\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasFloat64ArraySupport from '@stdlib/assert-has-float64array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasFloat64ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isFloat64Array from '@stdlib/assert-is-float64array';\nimport GlobalFloat64Array from './float64array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Float64Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Float64Array` support\n*\n* @example\n* var bool = hasFloat64ArraySupport();\n* // returns \n*/\nfunction hasFloat64ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalFloat64Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalFloat64Array( [ 1.0, 3.14, -3.14, NaN ] );\n\t\tbool = (\n\t\t\tisFloat64Array( arr ) &&\n\t\t\tarr[ 0 ] === 1.0 &&\n\t\t\tarr[ 1 ] === 3.14 &&\n\t\t\tarr[ 2 ] === -3.14 &&\n\t\t\tarr[ 3 ] !== arr[ 3 ]\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasFloat64ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of double-precision floating-point numbers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasFloat32Array = ( typeof Float32Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Float32Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Float32Array\n*\n* @example\n* import Float32Array from '@stdlib/array-float32';\n*\n* var bool = isFloat32Array( new Float32Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isFloat32Array( [] );\n* // returns false\n*/\nfunction isFloat32Array( value ) {\n\treturn (\n\t\t( hasFloat32Array && value instanceof Float32Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Float32Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isFloat32Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Double-precision floating-point positive infinity.\n*\n* @module @stdlib/constants-float64-pinf\n* @type {number}\n*\n* @example\n* import FLOAT64_PINF from '@stdlib/constants-float64-pinf';\n* // returns Infinity\n*/\n\n\n// MAIN //\n\n/**\n* Double-precision floating-point positive infinity.\n*\n* ## Notes\n*\n* Double-precision floating-point positive infinity has the bit sequence\n*\n* ```binarystring\n* 0 11111111111 00000000000000000000 00000000000000000000000000000000\n* ```\n*\n* @constant\n* @type {number}\n* @default Number.POSITIVE_INFINITY\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_PINF = Number.POSITIVE_INFINITY; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default FLOAT64_PINF;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Float32Array === 'function' ) ? Float32Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Float32Array === 'function' ) ? Float32Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of single-precision floating-point numbers in the platform byte order.\n*\n* @module @stdlib/array-float32\n*\n* @example\n* import ctor from '@stdlib/array-float32';\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasFloat32ArraySupport from '@stdlib/assert-has-float32array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasFloat32ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isFloat32Array from '@stdlib/assert-is-float32array';\nimport PINF from '@stdlib/constants-float64-pinf';\nimport GlobalFloat32Array from './float32array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Float32Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Float32Array` support\n*\n* @example\n* var bool = hasFloat32ArraySupport();\n* // returns \n*/\nfunction hasFloat32ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalFloat32Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalFloat32Array( [ 1.0, 3.14, -3.14, 5.0e40 ] );\n\t\tbool = (\n\t\t\tisFloat32Array( arr ) &&\n\t\t\tarr[ 0 ] === 1.0 &&\n\t\t\tarr[ 1 ] === 3.140000104904175 &&\n\t\t\tarr[ 2 ] === -3.140000104904175 &&\n\t\t\tarr[ 3 ] === PINF\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasFloat32ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of single-precision floating-point numbers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasUint32Array = ( typeof Uint32Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Uint32Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Uint32Array\n*\n* @example\n* import Uint32Array from '@stdlib/array-uint32';\n*\n* var bool = isUint32Array( new Uint32Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isUint32Array( [] );\n* // returns false\n*/\nfunction isUint32Array( value ) {\n\treturn (\n\t\t( hasUint32Array && value instanceof Uint32Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Uint32Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isUint32Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum unsigned 32-bit integer.\n*\n* @module @stdlib/constants-uint32-max\n* @type {uinteger32}\n*\n* @example\n* import UINT32_MAX from '@stdlib/constants-uint32-max';\n* // returns 4294967295\n*/\n\n\n// MAIN //\n\n/**\n* Maximum unsigned 32-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* 2^{32} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 11111111111111111111111111111111\n* ```\n*\n* @constant\n* @type {uinteger32}\n* @default 4294967295\n*/\nvar UINT32_MAX = 4294967295;\n\n\n// EXPORTS //\n\nexport default UINT32_MAX;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Uint32Array === 'function' ) ? Uint32Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint32Array === 'function' ) ? Uint32Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 32-bit unsigned integers in the platform byte order.\n*\n* @module @stdlib/array-uint32\n*\n* @example\n* import ctor from '@stdlib/array-uint32';\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasUint32ArraySupport from '@stdlib/assert-has-uint32array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasUint32ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isUint32Array from '@stdlib/assert-is-uint32array';\nimport UINT32_MAX from '@stdlib/constants-uint32-max';\nimport GlobalUint32Array from './uint32array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Uint32Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Uint32Array` support\n*\n* @example\n* var bool = hasUint32ArraySupport();\n* // returns \n*/\nfunction hasUint32ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalUint32Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = [ 1, 3.14, -3.14, UINT32_MAX+1, UINT32_MAX+2 ];\n\t\tarr = new GlobalUint32Array( arr );\n\t\tbool = (\n\t\t\tisUint32Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 && // truncation\n\t\t\tarr[ 2 ] === UINT32_MAX-2 && // truncation and wrap around\n\t\t\tarr[ 3 ] === 0 && // wrap around\n\t\t\tarr[ 4 ] === 1 // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasUint32ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 32-bit unsigned integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasInt32Array = ( typeof Int32Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an Int32Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an Int32Array\n*\n* @example\n* import Int32Array from '@stdlib/array-int32';\n*\n* var bool = isInt32Array( new Int32Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isInt32Array( [] );\n* // returns false\n*/\nfunction isInt32Array( value ) {\n\treturn (\n\t\t( hasInt32Array && value instanceof Int32Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Int32Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInt32Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum signed 32-bit integer.\n*\n* @module @stdlib/constants-int32-max\n* @type {integer32}\n*\n* @example\n* import INT32_MAX from '@stdlib/constants-int32-max';\n* // returns 2147483647\n*/\n\n\n// MAIN //\n\n/**\n* Maximum signed 32-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* 2^{31} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 01111111111111111111111111111111\n* ```\n*\n* @constant\n* @type {integer32}\n* @default 2147483647\n*/\nvar INT32_MAX = 2147483647|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default INT32_MAX;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Int32Array === 'function' ) ? Int32Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Int32Array === 'function' ) ? Int32Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of twos-complement 32-bit signed integers in the platform byte order.\n*\n* @module @stdlib/array-int32\n*\n* @example\n* import ctor from '@stdlib/array-int32';\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasInt32ArraySupport from '@stdlib/assert-has-int32array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasInt32ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isInt32Array from '@stdlib/assert-is-int32array';\nimport INT32_MAX from '@stdlib/constants-int32-max';\nimport INT32_MIN from '@stdlib/constants-int32-min';\nimport GlobalInt32Array from './int32array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Int32Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Int32Array` support\n*\n* @example\n* var bool = hasInt32ArraySupport();\n* // returns \n*/\nfunction hasInt32ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalInt32Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalInt32Array( [ 1, 3.14, -3.14, INT32_MAX+1 ] );\n\t\tbool = (\n\t\t\tisInt32Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 && // truncation\n\t\t\tarr[ 2 ] === -3 && // truncation\n\t\t\tarr[ 3 ] === INT32_MIN // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasInt32ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Minimum signed 32-bit integer.\n*\n* @module @stdlib/constants-int32-min\n* @type {integer32}\n*\n* @example\n* import INT32_MIN from '@stdlib/constants-int32-min';\n* // returns -2147483648\n*/\n\n\n// MAIN //\n\n/**\n* Minimum signed 32-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* -(2^{31})\n* ```\n*\n* which corresponds to the two's complement bit sequence\n*\n* ```binarystring\n* 10000000000000000000000000000000\n* ```\n*\n* @constant\n* @type {integer32}\n* @default -2147483648\n*/\nvar INT32_MIN = -2147483648|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default INT32_MIN;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of twos-complement 32-bit signed integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasUint16Array = ( typeof Uint16Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Uint16Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Uint16Array\n*\n* @example\n* import Uint16Array from '@stdlib/array-uint16';\n*\n* var bool = isUint16Array( new Uint16Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isUint16Array( [] );\n* // returns false\n*/\nfunction isUint16Array( value ) {\n\treturn (\n\t\t( hasUint16Array && value instanceof Uint16Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Uint16Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isUint16Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum unsigned 16-bit integer.\n*\n* @module @stdlib/constants-uint16-max\n* @type {integer32}\n*\n* @example\n* import UINT16_MAX from '@stdlib/constants-uint16-max';\n* // returns 65535\n*/\n\n\n// MAIN //\n\n/**\n* Maximum unsigned 16-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* 2^{16} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 1111111111111111\n* ```\n*\n* @constant\n* @type {integer32}\n* @default 65535\n*/\nvar UINT16_MAX = 65535|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default UINT16_MAX;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Uint16Array === 'function' ) ? Uint16Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint16Array === 'function' ) ? Uint16Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 16-bit unsigned integers in the platform byte order.\n*\n* @module @stdlib/array-uint16\n*\n* @example\n* import ctor from '@stdlib/array-uint16';\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasUint16ArraySupport from '@stdlib/assert-has-uint16array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasUint16ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isUint16Array from '@stdlib/assert-is-uint16array';\nimport UINT16_MAX from '@stdlib/constants-uint16-max';\nimport GlobalUint16Array from './uint16array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Uint16Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Uint16Array` support\n*\n* @example\n* var bool = hasUint16ArraySupport();\n* // returns \n*/\nfunction hasUint16ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalUint16Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = [ 1, 3.14, -3.14, UINT16_MAX+1, UINT16_MAX+2 ];\n\t\tarr = new GlobalUint16Array( arr );\n\t\tbool = (\n\t\t\tisUint16Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 && // truncation\n\t\t\tarr[ 2 ] === UINT16_MAX-2 && // truncation and wrap around\n\t\t\tarr[ 3 ] === 0 && // wrap around\n\t\t\tarr[ 4 ] === 1 // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasUint16ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 16-bit unsigned integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasInt16Array = ( typeof Int16Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an Int16Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an Int16Array\n*\n* @example\n* import Int16Array from '@stdlib/array-int16';\n*\n* var bool = isInt16Array( new Int16Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isInt16Array( [] );\n* // returns false\n*/\nfunction isInt16Array( value ) {\n\treturn (\n\t\t( hasInt16Array && value instanceof Int16Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Int16Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInt16Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum signed 16-bit integer.\n*\n* @module @stdlib/constants-int16-max\n* @type {integer32}\n*\n* @example\n* import INT16_MAX from '@stdlib/constants-int16-max';\n* // returns 32767\n*/\n\n\n// MAIN //\n\n/**\n* Maximum signed 16-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* 2^{15} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 0111111111111111\n* ```\n*\n* @constant\n* @type {integer32}\n* @default 32767\n*/\nvar INT16_MAX = 32767|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default INT16_MAX;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Int16Array === 'function' ) ? Int16Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Int16Array === 'function' ) ? Int16Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of twos-complement 16-bit signed integers in the platform byte order.\n*\n* @module @stdlib/array-int16\n*\n* @example\n* import ctor from '@stdlib/array-int16';\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasInt16ArraySupport from '@stdlib/assert-has-int16array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasInt16ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isInt16Array from '@stdlib/assert-is-int16array';\nimport INT16_MAX from '@stdlib/constants-int16-max';\nimport INT16_MIN from '@stdlib/constants-int16-min';\nimport GlobalInt16Array from './int16array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Int16Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Int16Array` support\n*\n* @example\n* var bool = hasInt16ArraySupport();\n* // returns \n*/\nfunction hasInt16ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalInt16Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalInt16Array( [ 1, 3.14, -3.14, INT16_MAX+1 ] );\n\t\tbool = (\n\t\t\tisInt16Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 && // truncation\n\t\t\tarr[ 2 ] === -3 && // truncation\n\t\t\tarr[ 3 ] === INT16_MIN // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasInt16ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Minimum signed 16-bit integer.\n*\n* @module @stdlib/constants-int16-min\n* @type {integer32}\n*\n* @example\n* import INT16_MIN from '@stdlib/constants-int16-min';\n* // returns -32768\n*/\n\n\n// MAIN //\n\n/**\n* Minimum signed 16-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* -(2^{15})\n* ```\n*\n* which corresponds to the two's complement bit sequence\n*\n* ```binarystring\n* 1000000000000000\n* ```\n*\n* @constant\n* @type {integer32}\n* @default -32768\n*/\nvar INT16_MIN = -32768|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default INT16_MIN;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of twos-complement 16-bit signed integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasUint8Array = ( typeof Uint8Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Uint8Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Uint8Array\n*\n* @example\n* import Uint8Array from '@stdlib/array-uint8';\n*\n* var bool = isUint8Array( new Uint8Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isUint8Array( [] );\n* // returns false\n*/\nfunction isUint8Array( value ) {\n\treturn (\n\t\t( hasUint8Array && value instanceof Uint8Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Uint8Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isUint8Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum unsigned 8-bit integer.\n*\n* @module @stdlib/constants-uint8-max\n* @type {integer32}\n*\n* @example\n* import UINT8_MAX from '@stdlib/constants-uint8-max';\n* // returns 255\n*/\n\n\n// MAIN //\n\n/**\n* Maximum unsigned 8-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* 2^{8} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 11111111\n* ```\n*\n* @constant\n* @type {integer32}\n* @default 255\n*/\nvar UINT8_MAX = 255|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default UINT8_MAX;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Uint8Array === 'function' ) ? Uint8Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint8Array === 'function' ) ? Uint8Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 8-bit unsigned integers in the platform byte order.\n*\n* @module @stdlib/array-uint8\n*\n* @example\n* import ctor from '@stdlib/array-uint8';\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasUint8ArraySupport from '@stdlib/assert-has-uint8array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasUint8ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isUint8Array from '@stdlib/assert-is-uint8array';\nimport UINT8_MAX from '@stdlib/constants-uint8-max';\nimport GlobalUint8Array from './uint8array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Uint8Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Uint8Array` support\n*\n* @example\n* var bool = hasUint8ArraySupport();\n* // returns \n*/\nfunction hasUint8ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalUint8Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = [ 1, 3.14, -3.14, UINT8_MAX+1, UINT8_MAX+2 ];\n\t\tarr = new GlobalUint8Array( arr );\n\t\tbool = (\n\t\t\tisUint8Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 && // truncation\n\t\t\tarr[ 2 ] === UINT8_MAX-2 && // truncation and wrap around\n\t\t\tarr[ 3 ] === 0 && // wrap around\n\t\t\tarr[ 4 ] === 1 // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasUint8ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 8-bit unsigned integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasUint8ClampedArray = ( typeof Uint8ClampedArray === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Uint8ClampedArray.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Uint8ClampedArray\n*\n* @example\n* import Uint8ClampedArray from '@stdlib/array-uint8c';\n*\n* var bool = isUint8ClampedArray( new Uint8ClampedArray( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isUint8ClampedArray( [] );\n* // returns false\n*/\nfunction isUint8ClampedArray( value ) {\n\treturn (\n\t\t( hasUint8ClampedArray && value instanceof Uint8ClampedArray ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Uint8ClampedArray]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isUint8ClampedArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Uint8ClampedArray === 'function' ) ? Uint8ClampedArray : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint8ClampedArray === 'function' ) ? Uint8ClampedArray : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 8-bit unsigned integers in the platform byte order clamped to 0-255.\n*\n* @module @stdlib/array-uint8c\n*\n* @example\n* import ctor from '@stdlib/array-uint8c';\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasUint8ClampedArraySupport from '@stdlib/assert-has-uint8clampedarray-support'; // eslint-disable-line id-length\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasUint8ClampedArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isUint8ClampedArray from '@stdlib/assert-is-uint8clampedarray';\nimport GlobalUint8ClampedArray from './uint8clampedarray.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Uint8ClampedArray` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Uint8ClampedArray` support\n*\n* @example\n* var bool = hasUint8ClampedArraySupport();\n* // returns \n*/\nfunction hasUint8ClampedArraySupport() { // eslint-disable-line id-length\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalUint8ClampedArray !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalUint8ClampedArray( [ -1, 0, 1, 3.14, 4.99, 255, 256 ] );\n\t\tbool = (\n\t\t\tisUint8ClampedArray( arr ) &&\n\t\t\tarr[ 0 ] === 0 && // clamped\n\t\t\tarr[ 1 ] === 0 &&\n\t\t\tarr[ 2 ] === 1 &&\n\t\t\tarr[ 3 ] === 3 && // round to nearest\n\t\t\tarr[ 4 ] === 5 && // round to nearest\n\t\t\tarr[ 5 ] === 255 &&\n\t\t\tarr[ 6 ] === 255 // clamped\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasUint8ClampedArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 8-bit unsigned integers in the platform byte order clamped to 0-255.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasInt8Array = ( typeof Int8Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an Int8Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an Int8Array\n*\n* @example\n* import Int8Array from '@stdlib/array-int8';\n*\n* var bool = isInt8Array( new Int8Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isInt8Array( [] );\n* // returns false\n*/\nfunction isInt8Array( value ) {\n\treturn (\n\t\t( hasInt8Array && value instanceof Int8Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Int8Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInt8Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum signed 8-bit integer.\n*\n* @module @stdlib/constants-int8-max\n* @type {integer32}\n*\n* @example\n* import INT8_MAX from '@stdlib/constants-int8-max';\n* // returns 127\n*/\n\n\n// MAIN //\n\n/**\n* Maximum signed 8-bit integer.\n*\n* ## Notes\n*\n* The number is given by\n*\n* ```tex\n* 2^{7} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 01111111\n* ```\n*\n* @constant\n* @type {integer32}\n* @default 127\n*/\nvar INT8_MAX = 127|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default INT8_MAX;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Int8Array === 'function' ) ? Int8Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Int8Array === 'function' ) ? Int8Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of twos-complement 8-bit signed integers in the platform byte order.\n*\n* @module @stdlib/array-int8\n*\n* @example\n* import ctor from '@stdlib/array-int8';\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasInt8ArraySupport from '@stdlib/assert-has-int8array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasInt8ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isInt8Array from '@stdlib/assert-is-int8array';\nimport INT8_MAX from '@stdlib/constants-int8-max';\nimport INT8_MIN from '@stdlib/constants-int8-min';\nimport GlobalInt8Array from './int8array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Int8Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Int8Array` support\n*\n* @example\n* var bool = hasInt8ArraySupport();\n* // returns \n*/\nfunction hasInt8ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalInt8Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalInt8Array( [ 1, 3.14, -3.14, INT8_MAX+1 ] );\n\t\tbool = (\n\t\t\tisInt8Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 && // truncation\n\t\t\tarr[ 2 ] === -3 && // truncation\n\t\t\tarr[ 3 ] === INT8_MIN // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasInt8ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Minimum signed 8-bit integer.\n*\n* @module @stdlib/constants-int8-min\n* @type {integer32}\n*\n* @example\n* import INT8_MIN from '@stdlib/constants-int8-min';\n* // returns -128\n*/\n\n\n// MAIN //\n\n/**\n* Minimum signed 8-bit integer.\n*\n* ## Notes\n*\n* The number is given by\n*\n* ```tex\n* -(2^{7})\n* ```\n*\n* which corresponds to the two's complement bit sequence\n*\n* ```binarystring\n* 10000000\n* ```\n*\n* @constant\n* @type {integer32}\n* @default -128\n*/\nvar INT8_MIN = -128|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default INT8_MIN;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of twos-complement 8-bit signed integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Double-precision floating-point negative infinity.\n*\n* @module @stdlib/constants-float64-ninf\n* @type {number}\n*\n* @example\n* import FLOAT64_NINF from '@stdlib/constants-float64-ninf';\n* // returns -Infinity\n*/\n\n// MODULES //\n\nimport Number from '@stdlib/number-ctor';\n\n\n// MAIN //\n\n/**\n* Double-precision floating-point negative infinity.\n*\n* ## Notes\n*\n* Double-precision floating-point negative infinity has the bit sequence\n*\n* ```binarystring\n* 1 11111111111 00000000000000000000 00000000000000000000000000000000\n* ```\n*\n* @constant\n* @type {number}\n* @default Number.NEGATIVE_INFINITY\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_NINF = Number.NEGATIVE_INFINITY;\n\n\n// EXPORTS //\n\nexport default FLOAT64_NINF;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: implementation (?)\n\n/**\n* Rounds a double-precision floating-point number toward negative infinity.\n*\n* @param {number} x - input value\n* @returns {number} rounded value\n*\n* @example\n* var v = floor( -4.2 );\n* // returns -5.0\n*\n* @example\n* var v = floor( 9.99999 );\n* // returns 9.0\n*\n* @example\n* var v = floor( 0.0 );\n* // returns 0.0\n*\n* @example\n* var v = floor( NaN );\n* // returns NaN\n*/\nvar floor = Math.floor; // eslint-disable-line stdlib/no-builtin-math\n\n\n// EXPORTS //\n\nexport default floor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport floor from '@stdlib/math-base-special-floor';\n\n\n// MAIN //\n\n/**\n* Tests if a finite double-precision floating-point number is an integer.\n*\n* @param {number} x - value to test\n* @returns {boolean} boolean indicating whether the value is an integer\n*\n* @example\n* var bool = isInteger( 1.0 );\n* // returns true\n*\n* @example\n* var bool = isInteger( 3.14 );\n* // returns false\n*/\nfunction isInteger( x ) {\n\treturn (floor(x) === x);\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport PINF from '@stdlib/constants-float64-pinf';\nimport NINF from '@stdlib/constants-float64-ninf';\nimport isInt from '@stdlib/math-base-assert-is-integer';\n\n\n// MAIN //\n\n/**\n* Tests if a number primitive is an integer value.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a number primitive is an integer value\n*/\nfunction isInteger( value ) {\n\treturn (\n\t\tvalue < PINF &&\n\t\tvalue > NINF &&\n\t\tisInt( value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport isInt from './integer.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number primitive having an integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive having an integer value\n*\n* @example\n* var bool = isInteger( -3.0 );\n* // returns true\n*\n* @example\n* var bool = isInteger( new Number( -3.0 ) );\n* // returns false\n*/\nfunction isInteger( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisInt( value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isObject as isNumber } from '@stdlib/assert-is-number';\nimport isInt from './integer.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object having an integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object having an integer value\n*\n* @example\n* var bool = isInteger( 3.0 );\n* // returns false\n*\n* @example\n* var bool = isInteger( new Number( 3.0 ) );\n* // returns true\n*/\nfunction isInteger( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisInt( value.valueOf() )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is an integer.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an integer\n*\n* @example\n* var bool = isInteger( 5.0 );\n* // returns true\n*\n* @example\n* var bool = isInteger( new Number( 5.0 ) );\n* // returns true\n*\n* @example\n* var bool = isInteger( -3.14 );\n* // returns false\n*\n* @example\n* var bool = isInteger( null );\n* // returns false\n*/\nfunction isInteger( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number primitive having a nonnegative integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive having a nonnegative integer value\n*\n* @example\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns true\n*\n* @example\n* var bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns false\n*/\nfunction isNonNegativeInteger( value ) {\n\treturn (\n\t\tisInteger( value ) &&\n\t\tvalue >= 0\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isNonNegativeInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isObject as isInteger } from '@stdlib/assert-is-integer';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object having a nonnegative integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object having a nonnegative integer value\n*\n* @example\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns false\n*\n* @example\n* var bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns true\n*/\nfunction isNonNegativeInteger( value ) {\n\treturn (\n\t\tisInteger( value ) &&\n\t\tvalue.valueOf() >= 0\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isNonNegativeInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a nonnegative integer.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a nonnegative integer\n*\n* @example\n* var bool = isNonNegativeInteger( 5.0 );\n* // returns true\n*\n* @example\n* var bool = isNonNegativeInteger( new Number( 5.0 ) );\n* // returns true\n*\n* @example\n* var bool = isNonNegativeInteger( -5.0 );\n* // returns false\n*\n* @example\n* var bool = isNonNegativeInteger( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isNonNegativeInteger( null );\n* // returns false\n*/\nfunction isNonNegativeInteger( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isNonNegativeInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an integer.\n*\n* @module @stdlib/assert-is-integer\n*\n* @example\n* import isInteger from '@stdlib/assert-is-integer';\n*\n* var bool = isInteger( 5.0 );\n* // returns true\n*\n* bool = isInteger( new Number( 5.0 ) );\n* // returns true\n*\n* bool = isInteger( -3.14 );\n* // returns false\n*\n* bool = isInteger( null );\n* // returns false\n*\n* @example\n* // Use interface to check for integer primitives...\n* import { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\n*\n* var bool = isInteger( -3.0 );\n* // returns true\n*\n* bool = isInteger( new Number( -3.0 ) );\n* // returns false\n*\n* @example\n* // Use interface to check for integer objects...\n* import { isObject as isInteger } from '@stdlib/assert-is-integer';\n*\n* var bool = isInteger( 3.0 );\n* // returns false\n*\n* bool = isInteger( new Number( 3.0 ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a nonnegative integer.\n*\n* @module @stdlib/assert-is-nonnegative-integer\n*\n* @example\n* import isNonNegativeInteger from '@stdlib/assert-is-nonnegative-integer';\n*\n* var bool = isNonNegativeInteger( 5.0 );\n* // returns true\n*\n* bool = isNonNegativeInteger( new Number( 5.0 ) );\n* // returns true\n*\n* bool = isNonNegativeInteger( -5.0 );\n* // returns false\n*\n* bool = isNonNegativeInteger( 3.14 );\n* // returns false\n*\n* bool = isNonNegativeInteger( null );\n* // returns false\n*\n* @example\n* import { isPrimitive as isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\n*\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns true\n*\n* bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns false\n*\n* @example\n* import { isObject as isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\n*\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns false\n*\n* bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum length of a generic array.\n*\n* @module @stdlib/constants-array-max-array-length\n*\n* @example\n* import MAX_ARRAY_LENGTH from '@stdlib/constants-array-max-array-length';\n* // returns 4294967295\n*/\n\n// MAIN //\n\n/**\n* Maximum length of a generic array.\n*\n* ```tex\n* 2^{32} - 1\n* ```\n*\n* @constant\n* @type {uinteger32}\n* @default 4294967295\n*/\nvar MAX_ARRAY_LENGTH = 4294967295>>>0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default MAX_ARRAY_LENGTH;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isInteger from '@stdlib/math-base-assert-is-integer';\nimport MAX_LENGTH from '@stdlib/constants-array-max-array-length';\n\n\n// MAIN //\n\n/**\n* Tests if a value is an array-like object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is an array-like object\n*\n* @example\n* var bool = isArrayLikeObject( [] );\n* // returns true\n*\n* @example\n* var bool = isArrayLikeObject( { 'length': 10 } );\n* // returns true\n*\n* @example\n* var bool = isArrayLikeObject( 'beep' );\n* // returns false\n*/\nfunction isArrayLikeObject( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\ttypeof value.length === 'number' &&\n\t\tisInteger( value.length ) &&\n\t\tvalue.length >= 0 &&\n\t\tvalue.length <= MAX_LENGTH\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isArrayLikeObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum length of a typed array.\n*\n* @module @stdlib/constants-array-max-typed-array-length\n*\n* @example\n* import MAX_TYPED_ARRAY_LENGTH from '@stdlib/constants-array-max-typed-array-length';\n* // returns 9007199254740991\n*/\n\n// MAIN //\n\n/**\n* Maximum length of a typed array.\n*\n* ```tex\n* 2^{53} - 1\n* ```\n*\n* @constant\n* @type {number}\n* @default 9007199254740991\n*/\nvar MAX_TYPED_ARRAY_LENGTH = 9007199254740991;\n\n\n// EXPORTS //\n\nexport default MAX_TYPED_ARRAY_LENGTH;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isInteger from '@stdlib/math-base-assert-is-integer';\nimport MAX_LENGTH from '@stdlib/constants-array-max-typed-array-length';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a collection.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is a collection\n*\n* @example\n* var bool = isCollection( [] );\n* // returns true\n*\n* @example\n* var bool = isCollection( {} );\n* // returns false\n*/\nfunction isCollection( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\ttypeof value.length === 'number' &&\n\t\tisInteger( value.length ) &&\n\t\tvalue.length >= 0 &&\n\t\tvalue.length <= MAX_LENGTH\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isCollection;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasArrayBuffer = ( typeof ArrayBuffer === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an ArrayBuffer.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an ArrayBuffer\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var bool = isArrayBuffer( new ArrayBuffer( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isArrayBuffer( [] );\n* // returns false\n*/\nfunction isArrayBuffer( value ) {\n\treturn (\n\t\t( hasArrayBuffer && value instanceof ArrayBuffer ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object ArrayBuffer]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isArrayBuffer;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArray from '@stdlib/assert-is-array';\n\n\n// MAIN //\n\n/**\n* Tests if a value is an object; e.g., `{}`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an object\n*\n* @example\n* var bool = isObject( {} );\n* // returns true\n*\n* @example\n* var bool = isObject( null );\n* // returns false\n*/\nfunction isObject( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\t!isArray( value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an array of strings.\n*\n* @module @stdlib/assert-is-string-array\n*\n* @example\n* import isStringArray from '@stdlib/assert-is-string-array';\n*\n* var bool = isStringArray( [ 'abc', 'def' ] );\n* // returns true\n*\n* bool = isStringArray( [ 'abc', 123 ] );\n* // returns false\n*\n* @example\n* import { primitives as isStringArray } from '@stdlib/assert-is-string-array';\n*\n* var bool = isStringArray( [ 'abc', 'def' ] );\n* // returns true\n*\n* bool = isStringArray( [ 'abc', new String( 'def' ) ] );\n* // returns false\n*\n* @example\n* import { objects as isStringArray } from '@stdlib/assert-is-string-array';\n*\n* var bool = isStringArray( [ new String( 'abc' ), new String( 'def' ) ] );\n* // returns true\n*\n* bool = isStringArray( [ new String( 'abc' ), 'def' ] );\n* // returns false\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport arrayfun from '@stdlib/assert-tools-array-function';\nimport isString from '@stdlib/assert-is-string';\n\n\n// VARIABLES //\n\nvar isPrimitiveArray = arrayfun( isString.isPrimitive );\nvar isObjectArray = arrayfun( isString.isObject );\n\n\n// MAIN //\n\nvar isStringArray = arrayfun( isString );\nsetReadOnly( isStringArray, 'primitives', isPrimitiveArray );\nsetReadOnly( isStringArray, 'objects', isObjectArray );\n\n\n// EXPORTS //\n\nexport default isStringArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\nvar RE = /./;\n\n\n// EXPORTS //\n\nexport default RE;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a boolean primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a boolean primitive\n*\n* @example\n* var bool = isBoolean( true );\n* // returns true\n*\n* @example\n* var bool = isBoolean( false );\n* // returns true\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n*\n* var bool = isBoolean( new Boolean( true ) );\n* // returns false\n*/\nfunction isBoolean( value ) {\n\treturn ( typeof value === 'boolean' );\n}\n\n\n// EXPORTS //\n\nexport default isBoolean;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns a boolean.\n*\n* @name Boolean\n* @constructor\n* @type {Function}\n* @param {*} value - input value\n* @returns {(boolean|Boolean)} boolean\n*\n* @example\n* var b = Boolean( null );\n* // returns false\n*\n* b = Boolean( [] );\n* // returns true\n*\n* b = Boolean( {} );\n* // returns true\n*\n* @example\n* var b = new Boolean( false );\n* // returns \n*/\nvar Bool = Boolean; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default Bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// eslint-disable-next-line stdlib/no-redeclare\nvar toString = Boolean.prototype.toString; // non-generic\n\n\n// EXPORTS //\n\nexport default toString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasToStringTag from '@stdlib/assert-has-tostringtag-support';\nimport nativeClass from '@stdlib/utils-native-class';\nimport Boolean from '@stdlib/boolean-ctor';\nimport test from './try2serialize.js';\n\n\n// VARIABLES //\n\nvar FLG = hasToStringTag();\n\n\n// MAIN //\n\n/**\n* Tests if a value is a boolean object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a boolean object\n*\n* @example\n* var bool = isBoolean( true );\n* // returns false\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n*\n* var bool = isBoolean( new Boolean( false ) );\n* // returns true\n*/\nfunction isBoolean( value ) {\n\tif ( typeof value === 'object' ) {\n\t\tif ( value instanceof Boolean ) {\n\t\t\treturn true;\n\t\t}\n\t\tif ( FLG ) {\n\t\t\treturn test( value );\n\t\t}\n\t\treturn ( nativeClass( value ) === '[object Boolean]' );\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isBoolean;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport toString from './tostring.js'; // eslint-disable-line stdlib/no-redeclare\n\n\n// MAIN //\n\n/**\n* Attempts to serialize a value to a string.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value can be serialized\n*/\nfunction test( value ) {\n\ttry {\n\t\ttoString.call( value );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default test;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a boolean.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a boolean\n*\n* @example\n* var bool = isBoolean( false );\n* // returns true\n*\n* @example\n* var bool = isBoolean( true );\n* // returns true\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n*\n* var bool = isBoolean( new Boolean( false ) );\n* // returns true\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n*\n* var bool = isBoolean( new Boolean( true ) );\n* // returns true\n*/\nfunction isBoolean( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isBoolean;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a boolean.\n*\n* @module @stdlib/assert-is-boolean\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n* import isBoolean from '@stdlib/assert-is-boolean';\n*\n* var bool = isBoolean( false );\n* // returns true\n*\n* bool = isBoolean( new Boolean( false ) );\n* // returns true\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n* import { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\n*\n* var bool = isBoolean( false );\n* // returns true\n*\n* bool = isBoolean( new Boolean( true ) );\n* // returns false\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n* import { isObject as isBoolean } from '@stdlib/assert-is-boolean';\n*\n* var bool = isBoolean( true );\n* // returns false\n*\n* bool = isBoolean( new Boolean( false ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar obj = ( typeof self === 'object' ) ? self : null;\n\n\n// EXPORTS //\n\nexport default obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar obj = ( typeof window === 'object' ) ? window : null;\n\n\n// EXPORTS //\n\nexport default obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar obj = ( typeof global === 'object' ) ? global : null;\n\n\n// EXPORTS //\n\nexport default obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar obj = ( typeof globalThis === 'object' ) ? globalThis : null; // eslint-disable-line no-undef\n\n\n// EXPORTS //\n\nexport default obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport getGlobal from '@stdlib/utils-global';\n\n\n// MAIN //\n\nvar root = getGlobal();\nvar nodeList = root.document && root.document.childNodes;\n\n\n// EXPORTS //\n\nexport default nodeList;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport format from '@stdlib/string-format';\nimport getThis from './codegen.js';\nimport Self from './self.js';\nimport Win from './window.js';\nimport Global from './global.js';\nimport GlobalThis from './global_this.js';\n\n\n// MAIN //\n\n/**\n* Returns the global object.\n*\n* ## Notes\n*\n* - Using code generation is the **most** reliable way to resolve the global object; however, doing so is likely to violate content security policies (CSPs) in, e.g., Chrome Apps and elsewhere.\n*\n* @param {boolean} [codegen=false] - boolean indicating whether to use code generation to resolve the global object\n* @throws {TypeError} must provide a boolean\n* @throws {Error} unable to resolve global object\n* @returns {Object} global object\n*\n* @example\n* var g = getGlobal();\n* // returns {...}\n*/\nfunction getGlobal( codegen ) {\n\tif ( arguments.length ) {\n\t\tif ( !isBoolean( codegen ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a boolean. Value: `%s`.', codegen ) );\n\t\t}\n\t\tif ( codegen ) {\n\t\t\treturn getThis();\n\t\t}\n\t\t// Fall through...\n\t}\n\t// Case: 2020 revision of ECMAScript standard\n\tif ( GlobalThis ) {\n\t\treturn GlobalThis;\n\t}\n\t// Case: browsers and web workers\n\tif ( Self ) {\n\t\treturn Self;\n\t}\n\t// Case: browsers\n\tif ( Win ) {\n\t\treturn Win;\n\t}\n\t// Case: Node.js\n\tif ( Global ) {\n\t\treturn Global;\n\t}\n\t// Case: unknown\n\tthrow new Error( 'unexpected error. Unable to resolve global object.' );\n}\n\n\n// EXPORTS //\n\nexport default getGlobal;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the global object using code generation.\n*\n* @private\n* @returns {Object} global object\n*/\nfunction getGlobal() {\n\treturn new Function( 'return this;' )(); // eslint-disable-line no-new-func, stdlib/require-globals\n}\n\n\n// EXPORTS //\n\nexport default getGlobal;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\nvar typedarray = Int8Array; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default typedarray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Determine a value's type.\n*\n* @module @stdlib/utils-type-of\n*\n* @example\n* import typeOf from '@stdlib/utils-type-of';\n*\n* var str = typeOf( 'a' );\n* // returns 'string'\n*\n* str = typeOf( 5 );\n* // returns 'number'\n*/\n\n// MODULES //\n\nimport usePolyfill from './check.js';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar main = ( usePolyfill() ) ? polyfill : builtin;\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport RE from './fixtures/re.js';\nimport nodeList from './fixtures/nodelist.js';\nimport typedarray from './fixtures/typedarray.js';\n\n\n// MAIN //\n\n/**\n* Checks whether a polyfill is needed when using the `typeof` operator.\n*\n* @private\n* @returns {boolean} boolean indicating whether a polyfill is needed\n*/\nfunction check() {\n\tif (\n\t\t// Chrome 1-12 returns 'function' for regular expression instances (see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/typeof):\n\t\ttypeof RE === 'function' ||\n\n\t\t// Safari 8 returns 'object' for typed array and weak map constructors (underscore #1929):\n\t\ttypeof typedarray === 'object' ||\n\n\t\t// PhantomJS 1.9 returns 'function' for `NodeList` instances (underscore #2236):\n\t\ttypeof nodeList === 'function'\n\t) {\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default check;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport ctorName from '@stdlib/utils-constructor-name';\n\n\n// MAIN //\n\n/**\n* Determines a value's type.\n*\n* @param {*} v - input value\n* @returns {string} string indicating the value's type\n*/\nfunction typeOf( v ) {\n\treturn ctorName( v ).toLowerCase();\n}\n\n\n// EXPORTS //\n\nexport default typeOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport ctorName from '@stdlib/utils-constructor-name';\n\n\n// NOTES //\n\n/*\n* Built-in `typeof` operator behavior:\n*\n* ```text\n* typeof null => 'object'\n* typeof undefined => 'undefined'\n* typeof 'a' => 'string'\n* typeof 5 => 'number'\n* typeof NaN => 'number'\n* typeof true => 'boolean'\n* typeof false => 'boolean'\n* typeof {} => 'object'\n* typeof [] => 'object'\n* typeof function foo(){} => 'function'\n* typeof function* foo(){} => 'object'\n* typeof Symbol() => 'symbol'\n* ```\n*\n*/\n\n\n// MAIN //\n\n/**\n* Determines a value's type.\n*\n* @param {*} v - input value\n* @returns {string} string indicating the value's type\n*/\nfunction typeOf( v ) {\n\tvar type;\n\n\t// Address `typeof null` => `object` (see http://wiki.ecmascript.org/doku.php?id=harmony:typeof_null):\n\tif ( v === null ) {\n\t\treturn 'null';\n\t}\n\ttype = typeof v;\n\n\t// If the `typeof` operator returned something other than `object`, we are done. Otherwise, we need to check for an internal class name or search for a constructor.\n\tif ( type === 'object' ) {\n\t\treturn ctorName( v ).toLowerCase();\n\t}\n\treturn type;\n}\n\n\n// EXPORTS //\n\nexport default typeOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport typeOf from '@stdlib/utils-type-of';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a function.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a function\n*\n* @example\n* function beep() {\n* return 'beep';\n* }\n*\n* var bool = isFunction( beep );\n* // returns true\n*/\nfunction isFunction( value ) {\n\t// Note: cannot use `typeof` directly, as various browser engines incorrectly return `'function'` when operating on non-function objects, such as regular expressions and NodeLists.\n\treturn ( typeOf( value ) === 'function' );\n}\n\n\n// EXPORTS //\n\nexport default isFunction;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport defineProperty from '@stdlib/utils-define-property';\n\n\n// MAIN //\n\n/**\n* Defines a read-only property.\n*\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {*} value - value to set\n*\n* @example\n* var obj = {};\n*\n* setReadOnly( obj, 'foo', 'bar' );\n*\n* try {\n* obj.foo = 'boop';\n* } catch ( err ) {\n* console.error( err.message );\n* }\n*/\nfunction setReadOnly( obj, prop, value ) {\n\tdefineProperty( obj, prop, {\n\t\t'configurable': false,\n\t\t'enumerable': true,\n\t\t'writable': false,\n\t\t'value': value\n\t});\n}\n\n\n// EXPORTS //\n\nexport default setReadOnly;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport setEnumerableReadOnly from '@stdlib/utils-define-read-only-property';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport format from '@stdlib/string-format';\nimport toStr from './tostring.js';\nimport toJSON from './tojson.js';\n\n\n// MAIN //\n\n/**\n* 128-bit complex number constructor.\n*\n* @constructor\n* @param {number} real - real component\n* @param {number} imag - imaginary component\n* @throws {TypeError} must invoke using the `new` keyword\n* @throws {TypeError} real component must be a number\n* @throws {TypeError} imaginary component must be a number\n* @returns {Complex128} 128-bit complex number\n*\n* @example\n* var z = new Complex128( 5.0, 3.0 );\n* // returns \n*/\nfunction Complex128( real, imag ) {\n\tif ( !( this instanceof Complex128 ) ) {\n\t\tthrow new TypeError( 'invalid invocation. Constructor must be called with the `new` keyword.' );\n\t}\n\tif ( !isNumber( real ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Real component must be a number. Value: `%s`.', real ) );\n\t}\n\tif ( !isNumber( imag ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Imaginary component must be a number. Value: `%s`.', imag ) );\n\t}\n\tsetEnumerableReadOnly( this, 're', real );\n\tsetEnumerableReadOnly( this, 'im', imag );\n\treturn this;\n}\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof Complex128\n* @readonly\n* @type {string}\n* @default 'Complex128'\n*\n* @example\n* var name = Complex128.name;\n* // returns 'Complex128'\n*/\nsetReadOnly( Complex128, 'name', 'Complex128' );\n\n/**\n* Size (in bytes) of each component.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex128\n* @type {integer}\n* @returns {integer} size of each component\n*\n* @example\n* var nbytes = Complex128.BYTES_PER_ELEMENT;\n* // returns 8\n*/\nsetReadOnly( Complex128, 'BYTES_PER_ELEMENT', 8 );\n\n/**\n* Size (in bytes) of each component.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex128.prototype\n* @type {integer}\n* @returns {integer} size of each component\n*\n* @example\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var nbytes = z.BYTES_PER_ELEMENT;\n* // returns 8\n*/\nsetReadOnly( Complex128.prototype, 'BYTES_PER_ELEMENT', 8 );\n\n/**\n* Length (in bytes) of a complex number.\n*\n* @name byteLength\n* @memberof Complex128.prototype\n* @type {integer}\n* @returns {integer} byte length\n*\n* @example\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var nbytes = z.byteLength;\n* // returns 16\n*/\nsetReadOnly( Complex128.prototype, 'byteLength', 16 );\n\n/**\n* Serializes a complex number as a string.\n*\n* @name toString\n* @memberof Complex128.prototype\n* @type {Function}\n* @returns {string} serialized complex number\n*\n* @example\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var str = z.toString();\n* // returns '5 + 3i'\n*/\nsetReadOnly( Complex128.prototype, 'toString', toStr );\n\n/**\n* Serializes a complex number as a JSON object.\n*\n* ## Notes\n*\n* - `JSON.stringify()` implicitly calls this method when stringifying a `Complex128` instance.\n*\n* @name toJSON\n* @memberof Complex128.prototype\n* @type {Function}\n* @returns {Object} serialized complex number\n*\n* @example\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var obj = z.toJSON();\n* // returns { 'type': 'Complex128', 're': 5.0, 'im': 3.0 }\n*/\nsetReadOnly( Complex128.prototype, 'toJSON', toJSON );\n\n\n// EXPORTS //\n\nexport default Complex128;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Serializes a complex number as a string.\n*\n* @private\n* @returns {string} serialized complex number\n*/\nfunction toString() { // eslint-disable-line stdlib/no-redeclare\n\t/* eslint-disable no-invalid-this */\n\tvar str = '' + this.re;\n\tif ( this.im < 0 ) {\n\t\tstr += ' - ' + (-this.im);\n\t} else {\n\t\tstr += ' + ' + this.im;\n\t}\n\tstr += 'i';\n\treturn str;\n}\n\n\n// EXPORTS //\n\nexport default toString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Serializes a complex number as a JSON object.\n*\n* @private\n* @returns {Object} JSON representation\n*/\nfunction toJSON() {\n\t/* eslint-disable no-invalid-this */\n\tvar out = {};\n\tout.type = 'Complex128';\n\tout.re = this.re;\n\tout.im = this.im;\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default toJSON;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar fround = ( typeof Math.fround === 'function' ) ? Math.fround : null; // eslint-disable-line stdlib/no-builtin-math\n\n\n// EXPORTS //\n\nexport default fround;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Float32Array from '@stdlib/array-float32';\n\n\n// VARIABLES //\n\nvar FLOAT32_VIEW = new Float32Array( 1 );\n\n\n// MAIN //\n\n/**\n* Converts a double-precision floating-point number to the nearest single-precision floating-point number.\n*\n* @param {number} x - double-precision floating-point number\n* @returns {number} nearest single-precision floating-point number\n*\n* @example\n* var y = float64ToFloat32( 1.337 );\n* // returns 1.3370000123977661\n*/\nfunction float64ToFloat32( x ) {\n\tFLOAT32_VIEW[ 0 ] = x;\n\treturn FLOAT32_VIEW[ 0 ];\n}\n\n\n// EXPORTS //\n\nexport default float64ToFloat32;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Convert a double-precision floating-point number to the nearest single-precision floating-point number.\n*\n* @module @stdlib/number-float64-base-to-float32\n*\n* @example\n* import float64ToFloat32 from '@stdlib/number-float64-base-to-float32';\n*\n* var y = float64ToFloat32( 1.337 );\n* // returns 1.3370000123977661\n*/\n\n// MODULES //\n\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar float64ToFloat32;\nif ( typeof builtin === 'function' ) {\n\tfloat64ToFloat32 = builtin;\n} else {\n\tfloat64ToFloat32 = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default float64ToFloat32;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport setEnumerableReadOnly from '@stdlib/utils-define-read-only-property';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport float64ToFloat32 from '@stdlib/number-float64-base-to-float32';\nimport format from '@stdlib/string-format';\nimport toStr from './tostring.js';\nimport toJSON from './tojson.js';\n\n\n// MAIN //\n\n/**\n* 64-bit complex number constructor.\n*\n* @constructor\n* @param {number} real - real component\n* @param {number} imag - imaginary component\n* @throws {TypeError} must invoke using the `new` keyword\n* @throws {TypeError} real component must be a number\n* @throws {TypeError} imaginary component must be a number\n* @returns {Complex64} 64-bit complex number\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n* // returns \n*/\nfunction Complex64( real, imag ) {\n\tif ( !( this instanceof Complex64 ) ) {\n\t\tthrow new TypeError( 'invalid invocation. Constructor must be called with the `new` keyword.' );\n\t}\n\tif ( !isNumber( real ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Real component must be a number. Value: `%s`.', real ) );\n\t}\n\tif ( !isNumber( imag ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Imaginary component must be a number. Value: `%s`.', imag ) );\n\t}\n\tsetEnumerableReadOnly( this, 're', float64ToFloat32( real ) );\n\tsetEnumerableReadOnly( this, 'im', float64ToFloat32( imag ) );\n\treturn this;\n}\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof Complex64\n* @readonly\n* @type {string}\n* @default 'Complex64'\n*\n* @example\n* var name = Complex64.name;\n* // returns 'Complex64'\n*/\nsetReadOnly( Complex64, 'name', 'Complex64' );\n\n/**\n* Size (in bytes) of each component.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex64\n* @type {integer}\n* @returns {integer} size of each component\n*\n* @example\n* var nbytes = Complex64.BYTES_PER_ELEMENT;\n* // returns 4\n*/\nsetReadOnly( Complex64, 'BYTES_PER_ELEMENT', 4 );\n\n/**\n* Size (in bytes) of each component.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex64.prototype\n* @type {integer}\n* @returns {integer} size of each component\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var nbytes = z.BYTES_PER_ELEMENT;\n* // returns 4\n*/\nsetReadOnly( Complex64.prototype, 'BYTES_PER_ELEMENT', 4 );\n\n/**\n* Length (in bytes) of a complex number.\n*\n* @name byteLength\n* @memberof Complex64.prototype\n* @type {integer}\n* @returns {integer} byte length\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var nbytes = z.byteLength;\n* // returns 8\n*/\nsetReadOnly( Complex64.prototype, 'byteLength', 8 );\n\n/**\n* Serializes a complex number as a string.\n*\n* @name toString\n* @memberof Complex64.prototype\n* @type {Function}\n* @returns {string} serialized complex number\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var str = z.toString();\n* // returns '5 + 3i'\n*/\nsetReadOnly( Complex64.prototype, 'toString', toStr );\n\n/**\n* Serializes a complex number as a JSON object.\n*\n* ## Notes\n*\n* - `JSON.stringify()` implicitly calls this method when stringifying a `Complex64` instance.\n*\n* @name toJSON\n* @memberof Complex64.prototype\n* @type {Function}\n* @returns {Object} serialized complex number\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var obj = z.toJSON();\n* // returns { 'type': 'Complex64', 're': 5.0, 'im': 3.0 }\n*/\nsetReadOnly( Complex64.prototype, 'toJSON', toJSON );\n\n\n// EXPORTS //\n\nexport default Complex64;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Complex128 from '@stdlib/complex-float64-ctor';\nimport Complex64 from '@stdlib/complex-float32-ctor';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a complex number-like object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex number-like object.\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var x = new Complex128( 4.0, 2.0 );\n* var bool = isComplexLike( x );\n* // returns true\n*\n* x = new Complex64( 4.0, 2.0 );\n* bool = isComplexLike( x );\n* // returns true\n*/\nfunction isComplexLike( value ) {\n\tif ( value instanceof Complex128 || value instanceof Complex64 ) {\n\t\treturn true;\n\t}\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\ttypeof value.re === 'number' &&\n\t\ttypeof value.im === 'number'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isComplexLike;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isInteger from '@stdlib/math-base-assert-is-integer';\n\n\n// MAIN //\n\n/**\n* Tests if a finite numeric value is an even number.\n*\n* @param {number} x - value to test\n* @returns {boolean} boolean indicating whether the value is an even number\n*\n* @example\n* var bool = isEven( 5.0 );\n* // returns false\n*\n* @example\n* var bool = isEven( -2.0 );\n* // returns true\n*\n* @example\n* var bool = isEven( 0.0 );\n* // returns true\n*\n* @example\n* var bool = isEven( NaN );\n* // returns false\n*/\nfunction isEven( x ) {\n\treturn isInteger( x/2.0 );\n}\n\n\n// EXPORTS //\n\nexport default isEven;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Serializes a complex number as a string.\n*\n* @private\n* @returns {string} serialized complex number\n*/\nfunction toString() { // eslint-disable-line stdlib/no-redeclare\n\t/* eslint-disable no-invalid-this */\n\tvar str = '' + this.re;\n\tif ( this.im < 0 ) {\n\t\tstr += ' - ' + (-this.im);\n\t} else {\n\t\tstr += ' + ' + this.im;\n\t}\n\tstr += 'i';\n\treturn str;\n}\n\n\n// EXPORTS //\n\nexport default toString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Serializes a complex number as a JSON object.\n*\n* @private\n* @returns {Object} JSON representation\n*/\nfunction toJSON() {\n\t/* eslint-disable no-invalid-this */\n\tvar out = {};\n\tout.type = 'Complex64';\n\tout.re = this.re;\n\tout.im = this.im;\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default toJSON;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar BYTES_PER_ELEMENT = 8; // 4 bytes per float32 x (1 real + 1 imag component)\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a value is a `Complex64Array`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a `Complex64Array`\n*\n* @example\n* import Complex64Array from '@stdlib/array-complex64';\n*\n* var bool = isComplex64Array( new Complex64Array( 10 ) );\n* // returns true\n*\n* bool = isComplex64Array( [] );\n* // returns false\n*/\nfunction isComplex64Array( value ) {\n\t// Note: the following is not robust and that is intentional. In this case, we are seeking a lower cost way to reasonably determine whether an input value is a `Complex64Array` in order to avoid walking the prototype chain and resolving constructors, which is necessary for robust identification of cross-realm instances. For more robust validation, see `@stdlib/assert/is-complex64array`.\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\tvalue.constructor.name === 'Complex64Array' &&\n\t\tvalue.BYTES_PER_ELEMENT === BYTES_PER_ELEMENT\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isComplex64Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar BYTES_PER_ELEMENT = 16; // 8 bytes per float64 x (1 real + 1 imag component)\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a value is a `Complex128Array`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a `Complex128Array`\n*\n* @example\n* import Complex128Array from '@stdlib/array-complex128';\n*\n* var bool = isComplex128Array( new Complex128Array( 10 ) );\n* // returns true\n*\n* bool = isComplex128Array( [] );\n* // returns false\n*/\nfunction isComplex128Array( value ) {\n\t// Note: the following is not robust and that is intentional. In this case, we are seeking a lower cost way to reasonably determine whether an input value is a `Complex128Array` in order to avoid walking the prototype chain and resolving constructors, which is necessary for robust identification of cross-realm instances. For more robust validation, see `@stdlib/assert/is-complex128array`.\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\tvalue.constructor.name === 'Complex128Array' &&\n\t\tvalue.BYTES_PER_ELEMENT === BYTES_PER_ELEMENT\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isComplex128Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport Symbol from '@stdlib/symbol-ctor';\n\n\n// MAIN //\n\n/**\n* Tests for native `Symbol.iterator` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Symbol.iterator` support\n*\n* @example\n* var bool = hasIteratorSymbolSupport();\n* // returns \n*/\nfunction hasIteratorSymbolSupport() {\n\treturn (\n\t\ttypeof Symbol === 'function' &&\n\t\ttypeof Symbol( 'foo' ) === 'symbol' &&\n\t\thasOwnProp( Symbol, 'iterator' ) &&\n\t\ttypeof Symbol.iterator === 'symbol'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default hasIteratorSymbolSupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasIteratorSymbolSupport from '@stdlib/assert-has-iterator-symbol-support';\n\n\n// MAIN //\n\n/**\n* Iterator symbol.\n*\n* @name IteratorSymbol\n* @constant\n* @type {(symbol|null)}\n*\n* @example\n* function iterator() {\n* var it;\n* var i;\n*\n* i = -1;\n*\n* it = {};\n* it.next = next;\n* it.return = done;\n*\n* if ( IteratorSymbol ) {\n* it[ IteratorSymbol ] = iterator;\n* }\n* return it;\n*\n* function next() {\n* i += 1;\n* return {\n* 'value': i,\n* 'done': false\n* };\n* }\n*\n* function done( value ) {\n* if ( arguments.length === 0 ) {\n* return {\n* 'done': true\n* };\n* }\n* return {\n* 'value': value,\n* 'done': true\n* };\n* }\n* }\n*\n* var obj = iterator();\n*/\nvar IteratorSymbol = ( hasIteratorSymbolSupport() ) ? Symbol.iterator : null;\n\n\n// EXPORTS //\n\nexport default IteratorSymbol;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport defineProperty from '@stdlib/utils-define-property';\n\n\n// MAIN //\n\n/**\n* Defines a non-enumerable read-only accessor.\n*\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {Function} getter - accessor\n*\n* @example\n* function getter() {\n* return 'bar';\n* }\n*\n* var obj = {};\n*\n* setNonEnumerableReadOnlyAccessor( obj, 'foo', getter );\n*\n* try {\n* obj.foo = 'boop';\n* } catch ( err ) {\n* console.error( err.message );\n* }\n*/\nfunction setNonEnumerableReadOnlyAccessor( obj, prop, getter ) { // eslint-disable-line id-length\n\tdefineProperty( obj, prop, {\n\t\t'configurable': false,\n\t\t'enumerable': false,\n\t\t'get': getter\n\t});\n}\n\n\n// EXPORTS //\n\nexport default setNonEnumerableReadOnlyAccessor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the real component of a single-precision complex floating-point number.\n*\n* @param {Complex} z - complex number\n* @returns {number} real component\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var re = real( z );\n* // returns 5.0\n*/\nfunction real( z ) {\n\treturn z.re;\n}\n\n\n// EXPORTS //\n\nexport default real;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the imaginary component of a single-precision complex floating-point number.\n*\n* @param {Complex} z - complex number\n* @returns {number} imaginary component\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var im = imag( z );\n* // returns 3.0\n*/\nfunction imag( z ) {\n\treturn z.im;\n}\n\n\n// EXPORTS //\n\nexport default imag;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Float32Array from '@stdlib/array-float32';\n\n\n// MAIN //\n\n/**\n* Reinterprets a `Complex64Array` as a `Float32Array`.\n*\n* @param {Complex64Array} x - input array\n* @param {NonNegativeInteger} offset - starting index\n* @returns {Float32Array} `Float32Array` view\n*\n* @example\n* import Complex64Array from '@stdlib/array-complex64';\n*\n* var x = new Complex64Array( 10 );\n*\n* var out = reinterpret( x, 0 );\n* // returns \n*\n* var bool = ( out.buffer === x.buffer );\n* // returns true\n*/\nfunction reinterpret( x, offset ) {\n\treturn new Float32Array( x.buffer, x.byteOffset+(x.BYTES_PER_ELEMENT*offset), 2*(x.length-offset) ); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nexport default reinterpret;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Float64Array from '@stdlib/array-float64';\n\n\n// MAIN //\n\n/**\n* Reinterprets a `Complex128Array` as a `Float64Array`.\n*\n* @param {Complex128Array} x - input array\n* @param {NonNegativeInteger} offset - starting index\n* @returns {Float64Array} `Float64Array` view\n*\n* @example\n* import Complex128Array from '@stdlib/array-complex128';\n*\n* var x = new Complex128Array( 10 );\n*\n* var out = reinterpret( x, 0 );\n* // returns \n*\n* var bool = ( out.buffer === x.buffer );\n* // returns true\n*/\nfunction reinterpret( x, offset ) {\n\treturn new Float64Array( x.buffer, x.byteOffset+(x.BYTES_PER_ELEMENT*offset), 2*(x.length-offset) ); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nexport default reinterpret;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArrayLikeObject from '@stdlib/assert-is-array-like-object';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport realf from '@stdlib/complex-float32-real';\nimport imagf from '@stdlib/complex-float32-imag';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @returns {(Array|TypeError)} array or an error\n*/\nfunction fromIterator( it ) {\n\tvar out;\n\tvar v;\n\tvar z;\n\n\tout = [];\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\tz = v.value;\n\t\tif ( isArrayLikeObject( z ) && z.length >= 2 ) {\n\t\t\tout.push( z[ 0 ], z[ 1 ] );\n\t\t} else if ( isComplexLike( z ) ) {\n\t\t\tout.push( realf( z ), imagf( z ) );\n\t\t} else {\n\t\t\treturn new TypeError( format( 'invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', z ) );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default fromIterator;\n","/* eslint-disable no-restricted-syntax, max-lines, no-invalid-this */\n\n/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\nimport isArrayLikeObject from '@stdlib/assert-is-array-like-object';\nimport isCollection from '@stdlib/assert-is-collection';\nimport isArrayBuffer from '@stdlib/assert-is-arraybuffer';\nimport isObject from '@stdlib/assert-is-object';\nimport isArray from '@stdlib/assert-is-array';\nimport { primitives as isStringArray } from '@stdlib/assert-is-string-array';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport isFunction from '@stdlib/assert-is-function';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport isEven from '@stdlib/math-base-assert-is-even';\nimport isInteger from '@stdlib/math-base-assert-is-integer';\nimport isComplex64Array from '@stdlib/array-base-assert-is-complex64array';\nimport isComplex128Array from '@stdlib/array-base-assert-is-complex128array';\nimport hasIteratorSymbolSupport from '@stdlib/assert-has-iterator-symbol-support';\nimport ITERATOR_SYMBOL from '@stdlib/symbol-iterator';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport setReadOnlyAccessor from '@stdlib/utils-define-nonenumerable-read-only-accessor';\nimport Float32Array from '@stdlib/array-float32';\nimport Complex64 from '@stdlib/complex-float32-ctor';\nimport format from '@stdlib/string-format';\nimport realf from '@stdlib/complex-float32-real';\nimport imagf from '@stdlib/complex-float32-imag';\nimport floor from '@stdlib/math-base-special-floor';\nimport reinterpret64 from '@stdlib/strided-base-reinterpret-complex64';\nimport reinterpret128 from '@stdlib/strided-base-reinterpret-complex128';\nimport getter from '@stdlib/array-base-getter';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport fromIterator from './from_iterator.js';\nimport fromIteratorMap from './from_iterator_map.js';\nimport fromArray from './from_array.js';\n\n\n// VARIABLES //\n\nvar BYTES_PER_ELEMENT = Float32Array.BYTES_PER_ELEMENT * 2;\nvar HAS_ITERATOR_SYMBOL = hasIteratorSymbolSupport();\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating if a value is a complex typed array.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex typed array\n*/\nfunction isComplexArray( value ) {\n\treturn (\n\t\tvalue instanceof Complex64Array ||\n\t\t(\n\t\t\ttypeof value === 'object' &&\n\t\t\tvalue !== null &&\n\t\t\t(\n\t\t\t\tvalue.constructor.name === 'Complex64Array' ||\n\t\t\t\tvalue.constructor.name === 'Complex128Array'\n\t\t\t) &&\n\t\t\ttypeof value._length === 'number' && // eslint-disable-line no-underscore-dangle\n\n\t\t\t// NOTE: we don't perform a more rigorous test here for a typed array for performance reasons, as robustly checking for a typed array instance could require walking the prototype tree and performing relatively expensive constructor checks...\n\t\t\ttypeof value._buffer === 'object' // eslint-disable-line no-underscore-dangle\n\t\t)\n\t);\n}\n\n/**\n* Returns a boolean indicating if a value is a complex typed array constructor.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex typed array constructor\n*/\nfunction isComplexArrayConstructor( value ) {\n\treturn (\n\t\tvalue === Complex64Array ||\n\n\t\t// NOTE: weaker test in order to avoid a circular dependency with Complex128Array...\n\t\tvalue.name === 'Complex128Array'\n\t);\n}\n\n/**\n* Retrieves a complex number from a complex number array buffer.\n*\n* @private\n* @param {Float32Array} buf - array buffer\n* @param {NonNegativeInteger} idx - element index\n* @returns {Complex64} complex number\n*/\nfunction getComplex64( buf, idx ) {\n\tidx *= 2;\n\treturn new Complex64( buf[ idx ], buf[ idx+1 ] );\n}\n\n\n// MAIN //\n\n/**\n* 64-bit complex number array constructor.\n*\n* @constructor\n* @param {(NonNegativeInteger|Collection|ArrayBuffer|Iterable)} [arg] - length, typed array, array-like object, buffer, or an iterable\n* @param {NonNegativeInteger} [byteOffset=0] - byte offset\n* @param {NonNegativeInteger} [length] - view length\n* @throws {RangeError} ArrayBuffer byte length must be a multiple of `8`\n* @throws {RangeError} array-like object and typed array input arguments must have a length which is a multiple of two\n* @throws {TypeError} if provided only a single argument, must provide a valid argument\n* @throws {TypeError} byte offset must be a nonnegative integer\n* @throws {RangeError} byte offset must be a multiple of `8`\n* @throws {TypeError} view length must be a positive multiple of `8`\n* @throws {RangeError} must provide sufficient memory to accommodate byte offset and view length requirements\n* @throws {TypeError} an iterator must return either a two element array containing real and imaginary components or a complex number\n* @returns {Complex64Array} complex number array\n*\n* @example\n* var arr = new Complex64Array();\n* // returns \n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var arr = new Complex64Array( 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var arr = new Complex64Array( [ 1.0, -1.0 ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = new Complex64Array( buf );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = new Complex64Array( buf, 8 );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new Complex64Array( buf, 8, 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*/\nfunction Complex64Array() {\n\tvar byteOffset;\n\tvar nargs;\n\tvar buf;\n\tvar len;\n\n\tnargs = arguments.length;\n\tif ( !(this instanceof Complex64Array) ) {\n\t\tif ( nargs === 0 ) {\n\t\t\treturn new Complex64Array();\n\t\t}\n\t\tif ( nargs === 1 ) {\n\t\t\treturn new Complex64Array( arguments[0] );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\treturn new Complex64Array( arguments[0], arguments[1] );\n\t\t}\n\t\treturn new Complex64Array( arguments[0], arguments[1], arguments[2] );\n\t}\n\t// Create the underlying data buffer...\n\tif ( nargs === 0 ) {\n\t\tbuf = new Float32Array( 0 ); // backward-compatibility\n\t} else if ( nargs === 1 ) {\n\t\tif ( isNonNegativeInteger( arguments[0] ) ) {\n\t\t\tbuf = new Float32Array( arguments[0]*2 );\n\t\t} else if ( isCollection( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tlen = buf.length;\n\n\t\t\t// If provided a \"generic\" array, peak at the first value, and, if the value is a complex number, try to process as an array of complex numbers, falling back to \"normal\" typed array initialization if we fail and ensuring consistency if the first value had not been a complex number...\n\t\t\tif ( len && isArray( buf ) && isComplexLike( buf[0] ) ) {\n\t\t\t\tbuf = fromArray( new Float32Array( len*2 ), buf );\n\t\t\t\tif ( buf === null ) {\n\t\t\t\t\t// We failed and we are now forced to allocate a new array :-(\n\t\t\t\t\tif ( !isEven( len ) ) {\n\t\t\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t\t}\n\t\t\t\t\t// We failed, so fall back to directly setting values...\n\t\t\t\t\tbuf = new Float32Array( arguments[0] );\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif ( isComplex64Array( buf ) ) {\n\t\t\t\t\tbuf = reinterpret64( buf, 0 );\n\t\t\t\t} else if ( isComplex128Array( buf ) ) {\n\t\t\t\t\tbuf = reinterpret128( buf, 0 );\n\t\t\t\t} else if ( !isEven( len ) ) {\n\t\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object and typed array arguments must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t}\n\t\t\t\tbuf = new Float32Array( buf );\n\t\t\t}\n\t\t} else if ( isArrayBuffer( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tif ( !isInteger( buf.byteLength/BYTES_PER_ELEMENT ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. ArrayBuffer byte length must be a multiple of %u. Byte length: `%u`.', BYTES_PER_ELEMENT, buf.byteLength ) );\n\t\t\t}\n\t\t\tbuf = new Float32Array( buf );\n\t\t} else if ( isObject( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tif ( HAS_ITERATOR_SYMBOL === false ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tif ( !isFunction( buf[ ITERATOR_SYMBOL ] ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tbuf = buf[ ITERATOR_SYMBOL ]();\n\t\t\tif ( !isFunction( buf.next ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', buf ) ); // FIXME: `buf` is what is returned from above, NOT the original value\n\t\t\t}\n\t\t\tbuf = fromIterator( buf );\n\t\t\tif ( buf instanceof Error ) {\n\t\t\t\tthrow buf;\n\t\t\t}\n\t\t\tbuf = new Float32Array( buf );\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arguments[0] ) );\n\t\t}\n\t} else {\n\t\tbuf = arguments[ 0 ];\n\t\tif ( !isArrayBuffer( buf ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an ArrayBuffer. Value: `%s`.', buf ) );\n\t\t}\n\t\tbyteOffset = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( byteOffset ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.', byteOffset ) );\n\t\t}\n\t\tif ( !isInteger( byteOffset/BYTES_PER_ELEMENT ) ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Byte offset must be a multiple of %u. Value: `%u`.', BYTES_PER_ELEMENT, byteOffset ) );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\tlen = buf.byteLength - byteOffset;\n\t\t\tif ( !isInteger( len/BYTES_PER_ELEMENT ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid arguments. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.', BYTES_PER_ELEMENT, len ) );\n\t\t\t}\n\t\t\tbuf = new Float32Array( buf, byteOffset );\n\t\t} else {\n\t\t\tlen = arguments[ 2 ];\n\t\t\tif ( !isNonNegativeInteger( len ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Length must be a nonnegative integer. Value: `%s`.', len ) );\n\t\t\t}\n\t\t\tif ( (len*BYTES_PER_ELEMENT) > (buf.byteLength-byteOffset) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.', len*BYTES_PER_ELEMENT ) );\n\t\t\t}\n\t\t\tbuf = new Float32Array( buf, byteOffset, len*2 );\n\t\t}\n\t}\n\tsetReadOnly( this, '_buffer', buf );\n\tsetReadOnly( this, '_length', buf.length/2 );\n\n\treturn this;\n}\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex64Array\n* @readonly\n* @type {PositiveInteger}\n* @default 8\n*\n* @example\n* var nbytes = Complex64Array.BYTES_PER_ELEMENT;\n* // returns 8\n*/\nsetReadOnly( Complex64Array, 'BYTES_PER_ELEMENT', BYTES_PER_ELEMENT );\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof Complex64Array\n* @readonly\n* @type {string}\n* @default 'Complex64Array'\n*\n* @example\n* var str = Complex64Array.name;\n* // returns 'Complex64Array'\n*/\nsetReadOnly( Complex64Array, 'name', 'Complex64Array' );\n\n/**\n* Creates a new 64-bit complex number array from an array-like object or an iterable.\n*\n* @name from\n* @memberof Complex64Array\n* @type {Function}\n* @param {(Collection|Iterable)} src - array-like object or iterable\n* @param {Function} [clbk] - callback to invoke for each source element\n* @param {*} [thisArg] - context\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an array-like object or an iterable\n* @throws {TypeError} second argument must be a function\n* @throws {RangeError} array-like objects must have a length which is a multiple of two\n* @throws {TypeError} an iterator must return either a two element array containing real and imaginary components or a complex number\n* @throws {TypeError} when provided an iterator, a callback must return either a two element array containing real and imaginary components or a complex number\n* @returns {Complex64Array} 64-bit complex number array\n*\n* @example\n* var arr = Complex64Array.from( [ 1.0, -1.0 ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var arr = Complex64Array.from( [ new Complex64( 1.0, 1.0 ) ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* function clbk( v ) {\n* return new Complex64( realf(v)*2.0, imagf(v)*2.0 );\n* }\n*\n* var arr = Complex64Array.from( [ new Complex64( 1.0, 1.0 ) ], clbk );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*/\nsetReadOnly( Complex64Array, 'from', function from( src ) {\n\tvar thisArg;\n\tvar nargs;\n\tvar clbk;\n\tvar out;\n\tvar buf;\n\tvar tmp;\n\tvar get;\n\tvar len;\n\tvar flg;\n\tvar v;\n\tvar i;\n\tvar j;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isComplexArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tnargs = arguments.length;\n\tif ( nargs > 1 ) {\n\t\tclbk = arguments[ 1 ];\n\t\tif ( !isFunction( clbk ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a function. Value: `%s`.', clbk ) );\n\t\t}\n\t\tif ( nargs > 2 ) {\n\t\t\tthisArg = arguments[ 2 ];\n\t\t}\n\t}\n\tif ( isComplexArray( src ) ) {\n\t\tlen = src.length;\n\t\tif ( clbk ) {\n\t\t\tout = new this( len );\n\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tv = clbk.call( thisArg, src.get( i ), i );\n\t\t\t\tif ( isComplexLike( v ) ) {\n\t\t\t\t\tbuf[ j ] = realf( v );\n\t\t\t\t\tbuf[ j+1 ] = imagf( v );\n\t\t\t\t} else if ( isArrayLikeObject( v ) && v.length >= 2 ) {\n\t\t\t\t\tbuf[ j ] = v[ 0 ];\n\t\t\t\t\tbuf[ j+1 ] = v[ 1 ];\n\t\t\t\t} else {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t\t\t}\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\treturn new this( src );\n\t}\n\tif ( isCollection( src ) ) {\n\t\tif ( clbk ) {\n\t\t\t// Note: array contents affect how we iterate over a provided data source. If only complex number objects, we can extract real and imaginary components. Otherwise, for non-complex number arrays (e.g., `Float64Array`, etc), we assume a strided array where real and imaginary components are interleaved. In the former case, we expect a callback to return real and imaginary components (possibly as a complex number). In the latter case, we expect a callback to return *either* a real or imaginary component.\n\n\t\t\tlen = src.length;\n\t\t\tif ( src.get && src.set ) {\n\t\t\t\tget = accessorGetter( 'default' );\n\t\t\t} else {\n\t\t\t\tget = getter( 'default' );\n\t\t\t}\n\t\t\t// Detect whether we've been provided an array which returns complex number objects...\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tif ( !isComplexLike( get( src, i ) ) ) {\n\t\t\t\t\tflg = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// If an array does not contain only complex number objects, then we assume interleaved real and imaginary components...\n\t\t\tif ( flg ) {\n\t\t\t\tif ( !isEven( len ) ) {\n\t\t\t\t\tthrow new RangeError( format( 'invalid argument. First argument must have a length which is a multiple of %u. Length: `%u`.', 2, len ) );\n\t\t\t\t}\n\t\t\t\tout = new this( len/2 );\n\t\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\t\tbuf[ i ] = clbk.call( thisArg, get( src, i ), i );\n\t\t\t\t}\n\t\t\t\treturn out;\n\t\t\t}\n\t\t\t// If an array contains only complex number objects, then we need to extract real and imaginary components...\n\t\t\tout = new this( len );\n\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tv = clbk.call( thisArg, get( src, i ), i );\n\t\t\t\tif ( isComplexLike( v ) ) {\n\t\t\t\t\tbuf[ j ] = realf( v );\n\t\t\t\t\tbuf[ j+1 ] = imagf( v );\n\t\t\t\t} else if ( isArrayLikeObject( v ) && v.length >= 2 ) {\n\t\t\t\t\tbuf[ j ] = v[ 0 ];\n\t\t\t\t\tbuf[ j+1 ] = v[ 1 ];\n\t\t\t\t} else {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t\t\t}\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\treturn new this( src );\n\t}\n\tif ( isObject( src ) && HAS_ITERATOR_SYMBOL && isFunction( src[ ITERATOR_SYMBOL ] ) ) { // eslint-disable-line max-len\n\t\tbuf = src[ ITERATOR_SYMBOL ]();\n\t\tif ( !isFunction( buf.next ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n\t\t}\n\t\tif ( clbk ) {\n\t\t\ttmp = fromIteratorMap( buf, clbk, thisArg );\n\t\t} else {\n\t\t\ttmp = fromIterator( buf );\n\t\t}\n\t\tif ( tmp instanceof Error ) {\n\t\t\tthrow tmp;\n\t\t}\n\t\tlen = tmp.length / 2;\n\t\tout = new this( len );\n\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tbuf[ i ] = tmp[ i ];\n\t\t}\n\t\treturn out;\n\t}\n\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n});\n\n/**\n* Creates a new 64-bit complex number array from a variable number of arguments.\n*\n* @name of\n* @memberof Complex64Array\n* @type {Function}\n* @param {...*} element - array elements\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex64Array} 64-bit complex number array\n*\n* @example\n* var arr = Complex64Array.of( 1.0, 1.0, 1.0, 1.0 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*/\nsetReadOnly( Complex64Array, 'of', function of() {\n\tvar args;\n\tvar i;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isComplexArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\targs = [];\n\tfor ( i = 0; i < arguments.length; i++ ) {\n\t\targs.push( arguments[ i ] );\n\t}\n\treturn new this( args );\n});\n\n/**\n* Returns an array element with support for both nonnegative and negative integer indices.\n*\n* @name at\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} idx - element index\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} must provide an integer\n* @returns {(Complex64|void)} array element\n*\n* @example\n* var arr = new Complex64Array( 10 );\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* var z = arr.at( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 0.0\n*\n* var im = imagf( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 9.0, -9.0 ], 9 );\n*\n* z = arr.at( 0 );\n* // returns \n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns -1.0\n*\n* z = arr.at( -1 );\n* // returns \n*\n* re = realf( z );\n* // returns 9.0\n*\n* im = imagf( z );\n* // returns -9.0\n*\n* z = arr.at( 100 );\n* // returns undefined\n*\n* z = arr.at( -100 );\n* // returns undefined\n*/\nsetReadOnly( Complex64Array.prototype, 'at', function at( idx ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an integer. Value: `%s`.', idx ) );\n\t}\n\tif ( idx < 0 ) {\n\t\tidx += this._length;\n\t}\n\tif ( idx < 0 || idx >= this._length ) {\n\t\treturn;\n\t}\n\treturn getComplex64( this._buffer, idx );\n});\n\n/**\n* Pointer to the underlying data buffer.\n*\n* @name buffer\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {ArrayBuffer}\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var buf = arr.buffer;\n* // returns \n*/\nsetReadOnlyAccessor( Complex64Array.prototype, 'buffer', function get() {\n\treturn this._buffer.buffer;\n});\n\n/**\n* Size (in bytes) of the array.\n*\n* @name byteLength\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var byteLength = arr.byteLength;\n* // returns 80\n*/\nsetReadOnlyAccessor( Complex64Array.prototype, 'byteLength', function get() {\n\treturn this._buffer.byteLength;\n});\n\n/**\n* Offset (in bytes) of the array from the start of its underlying `ArrayBuffer`.\n*\n* @name byteOffset\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var byteOffset = arr.byteOffset;\n* // returns 0\n*/\nsetReadOnlyAccessor( Complex64Array.prototype, 'byteOffset', function get() {\n\treturn this._buffer.byteOffset;\n});\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {PositiveInteger}\n* @default 8\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var nbytes = arr.BYTES_PER_ELEMENT;\n* // returns 8\n*/\nsetReadOnly( Complex64Array.prototype, 'BYTES_PER_ELEMENT', Complex64Array.BYTES_PER_ELEMENT );\n\n/**\n* Copies a sequence of elements within the array to the position starting at `target`.\n*\n* @name copyWithin\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} target - index at which to start copying elements\n* @param {integer} start - source index at which to copy elements from\n* @param {integer} [end] - source index at which to stop copying elements from\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex64Array} modified array\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* var arr = new Complex64Array( 4 );\n*\n* // Set the array elements:\n* arr.set( new Complex64( 1.0, 1.0 ), 0 );\n* arr.set( new Complex64( 2.0, 2.0 ), 1 );\n* arr.set( new Complex64( 3.0, 3.0 ), 2 );\n* arr.set( new Complex64( 4.0, 4.0 ), 3 );\n*\n* // Copy the first two elements to the last two elements:\n* arr.copyWithin( 2, 0, 2 );\n*\n* // Get the last array element:\n* var z = arr.get( 3 );\n*\n* var re = realf( z );\n* // returns 2.0\n*\n* var im = imagf( z );\n* // returns 2.0\n*/\nsetReadOnly( Complex64Array.prototype, 'copyWithin', function copyWithin( target, start ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\t// FIXME: prefer a functional `copyWithin` implementation which addresses lack of universal browser support (e.g., IE11 and Safari) or ensure that typed arrays are polyfilled\n\tif ( arguments.length === 2 ) {\n\t\tthis._buffer.copyWithin( target*2, start*2 );\n\t} else {\n\t\tthis._buffer.copyWithin( target*2, start*2, arguments[2]*2 );\n\t}\n\treturn this;\n});\n\n/**\n* Returns an iterator for iterating over array key-value pairs.\n*\n* @name entries\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Iterator} iterator\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var arr = [\n* new Complex64( 1.0, 1.0 ),\n* new Complex64( 2.0, 2.0 ),\n* new Complex64( 3.0, 3.0 )\n* ];\n* arr = new Complex64Array( arr );\n*\n* // Create an iterator:\n* var it = arr.entries();\n*\n* // Iterate over the key-value pairs...\n* var v = it.next().value;\n* // returns [ 0, ]\n*\n* v = it.next().value;\n* // returns [ 1, ]\n*\n* v = it.next().value;\n* // returns [ 2, ]\n*\n* var bool = it.next().done;\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'entries', function entries() {\n\tvar self;\n\tvar iter;\n\tvar len;\n\tvar buf;\n\tvar FLG;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tself = this;\n\tbuf = this._buffer;\n\tlen = this._length;\n\n\t// Initialize an iteration index:\n\ti = -1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': [ i, getComplex64( buf, i ) ],\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.entries();\n\t}\n});\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @name every\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var bool = arr.every( predicate );\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'every', function every( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( !predicate.call( thisArg, getComplex64( buf, i ), i, this ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n});\n\n/**\n* Returns a modified typed array filled with a fill value.\n*\n* @name fill\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {ComplexLike} value - fill value\n* @param {integer} [start=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @throws {TypeError} third argument must be an integer\n* @returns {Complex64Array} modified array\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.fill( new Complex64( 1.0, 1.0 ), 1 );\n*\n* var z = arr.get( 1 );\n* // returns \n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns 1.0\n*\n* z = arr.get( 2 );\n* // returns \n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'fill', function fill( value, start, end ) {\n\tvar buf;\n\tvar len;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', value ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( start ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', start ) );\n\t\t}\n\t\tif ( start < 0 ) {\n\t\t\tstart += len;\n\t\t\tif ( start < 0 ) {\n\t\t\t\tstart = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length > 2 ) {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t} else {\n\t\t\tend = len;\n\t\t}\n\t} else {\n\t\tstart = 0;\n\t\tend = len;\n\t}\n\tre = realf( value );\n\tim = imagf( value );\n\tfor ( i = start; i < end; i++ ) {\n\t\tidx = 2*i;\n\t\tbuf[ idx ] = re;\n\t\tbuf[ idx+1 ] = im;\n\t}\n\treturn this;\n});\n\n/**\n* Returns a new array containing the elements of an array which pass a test implemented by a predicate function.\n*\n* @name filter\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex64Array} complex number array\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var out = arr.filter( predicate );\n* // returns \n*\n* var len = out.length;\n* // returns 1\n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 2.0\n*\n* var im = imagf( z );\n* // returns 2.0\n*/\nsetReadOnly( Complex64Array.prototype, 'filter', function filter( predicate, thisArg ) {\n\tvar buf;\n\tvar out;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tout = [];\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\tout.push( z );\n\t\t}\n\t}\n\treturn new this.constructor( out );\n});\n\n/**\n* Returns the first element in an array for which a predicate function returns a truthy value.\n*\n* @name find\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {(Complex64|void)} array element or undefined\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.find( predicate );\n* // returns \n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'find', function find( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn z;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the first element in an array for which a predicate function returns a truthy value.\n*\n* @name findIndex\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var idx = arr.findIndex( predicate );\n* // returns 2\n*/\nsetReadOnly( Complex64Array.prototype, 'findIndex', function findIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLast\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {(Complex64|void)} array element or undefined\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.findLast( predicate );\n* // returns \n*\n* var re = realf( z );\n* // returns 3.0\n*\n* var im = imagf( z );\n* // returns 3.0\n*/\nsetReadOnly( Complex64Array.prototype, 'findLast', function findLast( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn z;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLastIndex\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var idx = arr.findLastIndex( predicate );\n* // returns 1\n*/\nsetReadOnly( Complex64Array.prototype, 'findLastIndex', function findLastIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Invokes a function once for each array element.\n*\n* @name forEach\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} fcn - function to invoke\n* @param {*} [thisArg] - function invocation context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* function log( v, i ) {\n* console.log( '%s: %s', i, v.toString() );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* arr.forEach( log );\n*/\nsetReadOnly( Complex64Array.prototype, 'forEach', function forEach( fcn, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex64( buf, i );\n\t\tfcn.call( thisArg, z, i, this );\n\t}\n});\n\n/**\n* Returns an array element.\n*\n* @name get\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {NonNegativeInteger} idx - element index\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} must provide a nonnegative integer\n* @returns {(Complex64|void)} array element\n*\n* @example\n* var arr = new Complex64Array( 10 );\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* var z = arr.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 0.0\n*\n* var im = imagf( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n*\n* z = arr.get( 0 );\n* // returns \n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns -1.0\n*\n* z = arr.get( 100 );\n* // returns undefined\n*/\nsetReadOnly( Complex64Array.prototype, 'get', function get( idx ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isNonNegativeInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a nonnegative integer. Value: `%s`.', idx ) );\n\t}\n\tif ( idx >= this._length ) {\n\t\treturn;\n\t}\n\treturn getComplex64( this._buffer, idx );\n});\n\n/**\n* Returns a boolean indicating whether an array includes a provided value.\n*\n* @name includes\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - search element\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {boolean} boolean indicating whether an array includes a provided value\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var arr = new Complex64Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var bool = arr.includes( new Complex64( 3.0, -3.0 ) );\n* // returns true\n*\n* bool = arr.includes( new Complex64( 3.0, -3.0 ), 3 );\n* // returns false\n*\n* bool = arr.includes( new Complex64( 4.0, -4.0 ), -3 );\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'includes', function includes( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tre = realf( searchElement );\n\tim = imagf( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Returns the first index at which a given element can be found.\n*\n* @name indexOf\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - element to find\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var arr = new Complex64Array( 10 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var idx = arr.indexOf( new Complex64( 3.0, -3.0 ) );\n* // returns 2\n*\n* idx = arr.indexOf( new Complex64( 3.0, -3.0 ), 3 );\n* // returns -1\n*\n* idx = arr.indexOf( new Complex64( 4.0, -4.0 ), -3 );\n* // returns -1\n*/\nsetReadOnly( Complex64Array.prototype, 'indexOf', function indexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tre = realf( searchElement );\n\tim = imagf( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns a new string by concatenating all array elements.\n*\n* @name join\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {string} [separator=','] - element separator\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a string\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex64Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.join();\n* // returns '1 + 1i,2 + 2i'\n*\n* str = arr.join( '/' );\n* // returns '1 + 1i/2 + 2i'\n*/\nsetReadOnly( Complex64Array.prototype, 'join', function join( separator ) {\n\tvar out;\n\tvar buf;\n\tvar sep;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( arguments.length === 0 ) {\n\t\tsep = ',';\n\t} else if ( isString( separator ) ) {\n\t\tsep = separator;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string. Value: `%s`.', separator ) );\n\t}\n\tout = [];\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex64( buf, i ).toString() );\n\t}\n\treturn out.join( sep );\n});\n\n/**\n* Returns an iterator for iterating over each index key in a typed array.\n*\n* @name keys\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Iterator} iterator\n*\n* @example\n* var arr = new Complex64Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var iter = arr.keys();\n*\n* var v = iter.next().value;\n* // returns 0\n*\n* v = iter.next().value;\n* // returns 1\n*\n* var bool = iter.next().done;\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'keys', function keys() {\n\tvar self;\n\tvar iter;\n\tvar len;\n\tvar FLG;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tself = this;\n\tlen = this._length;\n\n\t// Initialize an iteration index:\n\ti = -1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': i,\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.keys();\n\t}\n});\n\n/**\n* Returns the last index at which a given element can be found.\n*\n* @name lastIndexOf\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - element to find\n* @param {integer} [fromIndex] - index at which to start searching backward (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var arr = new Complex64Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 3.0, -3.0 ], 4 );\n*\n* var idx = arr.lastIndexOf( new Complex64( 3.0, -3.0 ) );\n* // returns 4\n*\n* idx = arr.lastIndexOf( new Complex64( 3.0, -3.0 ), 3 );\n* // returns 2\n*\n* idx = arr.lastIndexOf( new Complex64( 5.0, -5.0 ), 3 );\n* // returns -1\n*\n* idx = arr.lastIndexOf( new Complex64( 2.0, -2.0 ), -3 );\n* // returns 1\n*/\nsetReadOnly( Complex64Array.prototype, 'lastIndexOf', function lastIndexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex >= this._length ) {\n\t\t\tfromIndex = this._length - 1;\n\t\t} else if ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t}\n\t} else {\n\t\tfromIndex = this._length - 1;\n\t}\n\tre = realf( searchElement );\n\tim = imagf( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i >= 0; i-- ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Number of array elements.\n*\n* @name length\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var len = arr.length;\n* // returns 10\n*/\nsetReadOnlyAccessor( Complex64Array.prototype, 'length', function get() {\n\treturn this._length;\n});\n\n/**\n* Returns a new array with each element being the result of a provided callback function.\n*\n* @name map\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} fcn - callback function\n* @param {*} [thisArg] - callback function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex64Array} complex number array\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* function scale( v, i ) {\n* return new Complex64( 2.0*realf( v ), 2.0*imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var out = arr.map( scale );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 2\n*\n* var im = imagf( z );\n* // returns -2\n*/\nsetReadOnly( Complex64Array.prototype, 'map', function map( fcn, thisArg ) {\n\tvar outbuf;\n\tvar buf;\n\tvar out;\n\tvar i;\n\tvar v;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\tbuf = this._buffer;\n\tout = new this.constructor( this._length );\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tv = fcn.call( thisArg, getComplex64( buf, i ), i, this );\n\t\tif ( isComplexLike( v ) ) {\n\t\t\toutbuf[ 2*i ] = realf( v );\n\t\t\toutbuf[ (2*i)+1 ] = imagf( v );\n\t\t} else if ( isArrayLikeObject( v ) && v.length === 2 ) {\n\t\t\toutbuf[ 2*i ] = v[ 0 ];\n\t\t\toutbuf[ (2*i)+1 ] = v[ 1 ];\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t}\n\t}\n\treturn out;\n});\n\n/**\n* Applies a provided callback function to each element of the array, in order, passing in the return value from the calculation on the preceding element and returning the accumulated result upon completion.\n*\n* @name reduce\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} reducer - callback function\n* @param {*} [initialValue] - initial value\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @throws {Error} if not provided an initial value, the array must have at least one element\n* @returns {*} accumulated result\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n* import caddf from '@stdlib/complex-float32-base-add';\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.reduce( caddf );\n* // returns \n*\n* var re = realf( z );\n* // returns 6.0\n*\n* var im = imagf( z );\n* // returns 6.0\n*/\nsetReadOnly( Complex64Array.prototype, 'reduce', function reduce( reducer, initialValue ) {\n\tvar buf;\n\tvar acc;\n\tvar len;\n\tvar v;\n\tvar i;\n\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( reducer ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', reducer ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tacc = initialValue;\n\t\ti = 0;\n\t} else {\n\t\tif ( len === 0 ) {\n\t\t\tthrow new Error( 'invalid operation. If not provided an initial value, an array must contain at least one element.' );\n\t\t}\n\t\tacc = getComplex64( buf, 0 );\n\t\ti = 1;\n\t}\n\tfor ( ; i < len; i++ ) {\n\t\tv = getComplex64( buf, i );\n\t\tacc = reducer( acc, v, i, this );\n\t}\n\treturn acc;\n});\n\n/**\n* Applies a provided callback function to each element of the array, in reverse order, passing in the return value from the calculation on the preceding element and returning the accumulated result upon completion.\n*\n* @name reduceRight\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} reducer - callback function\n* @param {*} [initialValue] - initial value\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @throws {Error} if not provided an initial value, the array must have at least one element\n* @returns {*} accumulated result\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n* import caddf from '@stdlib/complex-float32-base-add';\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.reduceRight( caddf );\n* // returns \n*\n* var re = realf( z );\n* // returns 6.0\n*\n* var im = imagf( z );\n* // returns 6.0\n*/\nsetReadOnly( Complex64Array.prototype, 'reduceRight', function reduceRight( reducer, initialValue ) {\n\tvar buf;\n\tvar acc;\n\tvar len;\n\tvar v;\n\tvar i;\n\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( reducer ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', reducer ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tacc = initialValue;\n\t\ti = len-1;\n\t} else {\n\t\tif ( len === 0 ) {\n\t\t\tthrow new Error( 'invalid operation. If not provided an initial value, an array must contain at least one element.' );\n\t\t}\n\t\tacc = getComplex64( buf, len-1 );\n\t\ti = len-2;\n\t}\n\tfor ( ; i >= 0; i-- ) {\n\t\tv = getComplex64( buf, i );\n\t\tacc = reducer( acc, v, i, this );\n\t}\n\treturn acc;\n});\n\n/**\n* Reverses an array in-place.\n*\n* @name reverse\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex64Array} reversed array\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.reverse();\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 3.0\n*\n* var im = imagf( z );\n* // returns 3.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns 2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'reverse', function reverse() {\n\tvar buf;\n\tvar tmp;\n\tvar len;\n\tvar N;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tlen = this._length;\n\tbuf = this._buffer;\n\tN = floor( len / 2 );\n\tfor ( i = 0; i < N; i++ ) {\n\t\tj = len - i - 1;\n\t\ttmp = buf[ (2*i) ];\n\t\tbuf[ (2*i) ] = buf[ (2*j) ];\n\t\tbuf[ (2*j) ] = tmp;\n\t\ttmp = buf[ (2*i)+1 ];\n\t\tbuf[ (2*i)+1 ] = buf[ (2*j)+1 ];\n\t\tbuf[ (2*j)+1 ] = tmp;\n\t}\n\treturn this;\n});\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* - When provided a typed array, real or complex, we must check whether the source array shares the same buffer as the target array and whether the underlying memory overlaps. In particular, we are concerned with the following scenario:\n*\n* ```text\n* buf: ---------------------\n* src: ---------------------\n* ```\n*\n* In the above, as we copy values from `src`, we will overwrite values in the `src` view, resulting in duplicated values copied into the end of `buf`, which is not intended. Hence, to avoid overwriting source values, we must **copy** source values to a temporary array.\n*\n* In the other overlapping scenario,\n*\n* ```text\n* buf: ---------------------\n* src: ---------------------\n* ```\n*\n* by the time we begin copying into the overlapping region, we are copying from the end of `src`, a non-overlapping region, which means we don't run the risk of copying copied values, rather than the original `src` values, as intended.\n*\n* @name set\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n* @param {NonNegativeInteger} [i=0] - element index at which to start writing values\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be either a complex number, an array-like object, or a complex number array\n* @throws {TypeError} index argument must be a nonnegative integer\n* @throws {RangeError} array-like objects must have a length which is a multiple of two\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {RangeError} target array lacks sufficient storage to accommodate source values\n* @returns {void}\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* var arr = new Complex64Array( 10 );\n*\n* var z = arr.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 0.0\n*\n* var im = imagf( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n*\n* z = arr.get( 0 );\n* // returns \n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns -1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'set', function set( value ) {\n\t/* eslint-disable no-underscore-dangle */\n\tvar sbuf;\n\tvar idx;\n\tvar buf;\n\tvar tmp;\n\tvar flg;\n\tvar N;\n\tvar v;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tif ( arguments.length > 1 ) {\n\t\tidx = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( idx ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Index argument must be a nonnegative integer. Value: `%s`.', idx ) );\n\t\t}\n\t} else {\n\t\tidx = 0;\n\t}\n\tif ( isComplexLike( value ) ) {\n\t\tif ( idx >= this._length ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%u`.', idx ) );\n\t\t}\n\t\tidx *= 2;\n\t\tbuf[ idx ] = realf( value );\n\t\tbuf[ idx+1 ] = imagf( value );\n\t\treturn;\n\t}\n\tif ( isComplexArray( value ) ) {\n\t\tN = value._length;\n\t\tif ( idx+N > this._length ) {\n\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t}\n\t\tsbuf = value._buffer;\n\n\t\t// Check for overlapping memory...\n\t\tj = buf.byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\tif (\n\t\t\tsbuf.buffer === buf.buffer &&\n\t\t\t(\n\t\t\t\tsbuf.byteOffset < j &&\n\t\t\t\tsbuf.byteOffset+sbuf.byteLength > j\n\t\t\t)\n\t\t) {\n\t\t\t// We need to copy source values...\n\t\t\ttmp = new Float32Array( sbuf.length );\n\t\t\tfor ( i = 0; i < sbuf.length; i++ ) {\n\t\t\t\ttmp[ i ] = sbuf[ i ];\n\t\t\t}\n\t\t\tsbuf = tmp;\n\t\t}\n\t\tidx *= 2;\n\t\tj = 0;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tbuf[ idx ] = sbuf[ j ];\n\t\t\tbuf[ idx+1 ] = sbuf[ j+1 ];\n\t\t\tidx += 2; // stride\n\t\t\tj += 2; // stride\n\t\t}\n\t\treturn;\n\t}\n\tif ( isCollection( value ) ) {\n\t\t// Detect whether we've been provided an array of complex numbers...\n\t\tN = value.length;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tif ( !isComplexLike( value[ i ] ) ) {\n\t\t\t\tflg = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t// If an array does not contain only complex numbers, then we assume interleaved real and imaginary components...\n\t\tif ( flg ) {\n\t\t\tif ( !isEven( N ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.', N ) );\n\t\t\t}\n\t\t\tif ( idx+(N/2) > this._length ) {\n\t\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t\t}\n\t\t\tsbuf = value;\n\n\t\t\t// Check for overlapping memory...\n\t\t\tj = buf.byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\t\tif (\n\t\t\t\tsbuf.buffer === buf.buffer &&\n\t\t\t\t(\n\t\t\t\t\tsbuf.byteOffset < j &&\n\t\t\t\t\tsbuf.byteOffset+sbuf.byteLength > j\n\t\t\t\t)\n\t\t\t) {\n\t\t\t\t// We need to copy source values...\n\t\t\t\ttmp = new Float32Array( N );\n\t\t\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t\t\ttmp[ i ] = sbuf[ i ]; // TODO: handle accessor arrays\n\t\t\t\t}\n\t\t\t\tsbuf = tmp;\n\t\t\t}\n\t\t\tidx *= 2;\n\t\t\tN /= 2;\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t\tbuf[ idx ] = sbuf[ j ];\n\t\t\t\tbuf[ idx+1 ] = sbuf[ j+1 ];\n\t\t\t\tidx += 2; // stride\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\t// If an array contains only complex numbers, then we need to extract real and imaginary components...\n\t\tif ( idx+N > this._length ) {\n\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t}\n\t\tidx *= 2;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tv = value[ i ];\n\t\t\tbuf[ idx ] = realf( v );\n\t\t\tbuf[ idx+1 ] = imagf( v );\n\t\t\tidx += 2; // stride\n\t\t}\n\t\treturn;\n\t}\n\tthrow new TypeError( format( 'invalid argument. First argument must be either a complex number, an array-like object, or a complex number array. Value: `%s`.', value ) );\n\n\t/* eslint-enable no-underscore-dangle */\n});\n\n/**\n* Copies a portion of a typed array to a new typed array.\n*\n* @name slice\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} [start=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {TypeError} second argument must be an integer\n* @returns {Complex64Array} complex number array\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* var arr = new Complex64Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var out = arr.slice();\n* // returns \n*\n* var len = out.length;\n* // returns 5\n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns -1.0\n*\n* z = out.get( len-1 );\n* // returns \n*\n* re = realf( z );\n* // returns 5.0\n*\n* im = imagf( z );\n* // returns -5.0\n*\n* out = arr.slice( 1, -2 );\n* // returns \n*\n* len = out.length;\n* // returns 2\n*\n* z = out.get( 0 );\n* // returns \n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns -2.0\n*\n* z = out.get( len-1 );\n* // returns \n*\n* re = realf( z );\n* // returns 3.0\n*\n* im = imagf( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex64Array.prototype, 'slice', function slice( start, end ) {\n\tvar outlen;\n\tvar outbuf;\n\tvar out;\n\tvar idx;\n\tvar buf;\n\tvar len;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length === 0 ) {\n\t\tstart = 0;\n\t\tend = len;\n\t} else {\n\t\tif ( !isInteger( start ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', start ) );\n\t\t}\n\t\tif ( start < 0 ) {\n\t\t\tstart += len;\n\t\t\tif ( start < 0 ) {\n\t\t\t\tstart = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length === 1 ) {\n\t\t\tend = len;\n\t\t} else {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t} else if ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t}\n\t}\n\tif ( start < end ) {\n\t\toutlen = end - start;\n\t} else {\n\t\toutlen = 0;\n\t}\n\tout = new this.constructor( outlen );\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < outlen; i++ ) {\n\t\tidx = 2*(i+start);\n\t\toutbuf[ 2*i ] = buf[ idx ];\n\t\toutbuf[ (2*i)+1 ] = buf[ idx+1 ];\n\t}\n\treturn out;\n});\n\n/**\n* Tests whether at least one element in an array passes a test implemented by a predicate function.\n*\n* @name some\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether at least one element passes a test\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var bool = arr.some( predicate );\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'some', function some( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( predicate.call( thisArg, getComplex64( buf, i ), i, this ) ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Sorts an array in-place.\n*\n* @name sort\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} compareFcn - comparison function\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex64Array} sorted array\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* function compare( a, b ) {\n* var re1;\n* var re2;\n* var im1;\n* var im2;\n* re1 = realf( a );\n* re2 = realf( b );\n* if ( re1 < re2 ) {\n* return -1;\n* }\n* if ( re1 > re2 ) {\n* return 1;\n* }\n* im1 = imagf( a );\n* im2 = imagf( b );\n* if ( im1 < im2 ) {\n* return -1;\n* }\n* if ( im1 > im2 ) {\n* return 1;\n* }\n* return 0;\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 3.0, -3.0 ], 0 );\n* arr.set( [ 1.0, -1.0 ], 1 );\n* arr.set( [ 2.0, -2.0 ], 2 );\n*\n* var out = arr.sort( compare );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns -1.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns -2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = realf( z );\n* // returns 3.0\n*\n* im = imagf( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex64Array.prototype, 'sort', function sort( compareFcn ) {\n\tvar tmp;\n\tvar buf;\n\tvar len;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( compareFcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', compareFcn ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\ttmp = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\ttmp.push( getComplex64( buf, i ) );\n\t}\n\ttmp.sort( compareFcn );\n\tfor ( i = 0; i < len; i++ ) {\n\t\tj = 2 * i;\n\t\tbuf[ j ] = realf( tmp[i] );\n\t\tbuf[ j+1 ] = imagf( tmp[i] );\n\t}\n\treturn this;\n});\n\n/**\n* Creates a new typed array view over the same underlying `ArrayBuffer` and with the same underlying data type as the host array.\n*\n* @name subarray\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} [begin=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {TypeError} second argument must be an integer\n* @returns {Complex64Array} subarray\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* var arr = new Complex64Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var subarr = arr.subarray();\n* // returns \n*\n* var len = subarr.length;\n* // returns 5\n*\n* var z = subarr.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns -1.0\n*\n* z = subarr.get( len-1 );\n* // returns \n*\n* re = realf( z );\n* // returns 5.0\n*\n* im = imagf( z );\n* // returns -5.0\n*\n* subarr = arr.subarray( 1, -2 );\n* // returns \n*\n* len = subarr.length;\n* // returns 2\n*\n* z = subarr.get( 0 );\n* // returns \n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns -2.0\n*\n* z = subarr.get( len-1 );\n* // returns \n*\n* re = realf( z );\n* // returns 3.0\n*\n* im = imagf( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex64Array.prototype, 'subarray', function subarray( begin, end ) {\n\tvar offset;\n\tvar buf;\n\tvar len;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length === 0 ) {\n\t\tbegin = 0;\n\t\tend = len;\n\t} else {\n\t\tif ( !isInteger( begin ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', begin ) );\n\t\t}\n\t\tif ( begin < 0 ) {\n\t\t\tbegin += len;\n\t\t\tif ( begin < 0 ) {\n\t\t\t\tbegin = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length === 1 ) {\n\t\t\tend = len;\n\t\t} else {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t} else if ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t}\n\t}\n\tif ( begin >= len ) {\n\t\tlen = 0;\n\t\toffset = buf.byteLength;\n\t} else if ( begin >= end ) {\n\t\tlen = 0;\n\t\toffset = buf.byteOffset + (begin*BYTES_PER_ELEMENT);\n\t} else {\n\t\tlen = end - begin;\n\t\toffset = buf.byteOffset + ( begin*BYTES_PER_ELEMENT );\n\t}\n\treturn new this.constructor( buf.buffer, offset, ( len < 0 ) ? 0 : len );\n});\n\n/**\n* Serializes an array as a locale-specific string.\n*\n* @name toLocaleString\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {(string|Array)} [locales] - locale identifier(s)\n* @param {Object} [options] - configuration options\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a string or an array of strings\n* @throws {TypeError} options argument must be an object\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex64Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.toLocaleString();\n* // returns '1 + 1i,2 + 2i'\n*/\nsetReadOnly( Complex64Array.prototype, 'toLocaleString', function toLocaleString( locales, options ) {\n\tvar opts;\n\tvar loc;\n\tvar out;\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( arguments.length === 0 ) {\n\t\tloc = [];\n\t} else if ( isString( locales ) || isStringArray( locales ) ) {\n\t\tloc = locales;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string or an array of strings. Value: `%s`.', locales ) );\n\t}\n\tif ( arguments.length < 2 ) {\n\t\topts = {};\n\t} else if ( isObject( options ) ) {\n\t\topts = options;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );\n\t}\n\tbuf = this._buffer;\n\tout = [];\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex64( buf, i ).toLocaleString( loc, opts ) );\n\t}\n\treturn out.join( ',' );\n});\n\n/**\n* Returns a new typed array containing the elements in reversed order.\n*\n* @name toReversed\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex64Array} reversed array\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.toReversed();\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 3.0\n*\n* var im = imagf( z );\n* // returns 3.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns 2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'toReversed', function toReversed() {\n\tvar outbuf;\n\tvar out;\n\tvar len;\n\tvar buf;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tlen = this._length;\n\tout = new this.constructor( len );\n\tbuf = this._buffer;\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < len; i++ ) {\n\t\tj = len - i - 1;\n\t\toutbuf[ (2*i) ] = buf[ (2*j) ];\n\t\toutbuf[ (2*i)+1 ] = buf[ (2*j)+1 ];\n\t}\n\treturn out;\n});\n\n/**\n* Returns a new typed array containing the elements in sorted order.\n*\n* @name toSorted\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} compareFcn - comparison function\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex64Array} sorted array\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n*\n* function compare( a, b ) {\n* var re1;\n* var re2;\n* var im1;\n* var im2;\n* re1 = realf( a );\n* re2 = realf( b );\n* if ( re1 < re2 ) {\n* return -1;\n* }\n* if ( re1 > re2 ) {\n* return 1;\n* }\n* im1 = imagf( a );\n* im2 = imagf( b );\n* if ( im1 < im2 ) {\n* return -1;\n* }\n* if ( im1 > im2 ) {\n* return 1;\n* }\n* return 0;\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 3.0, -3.0 ], 0 );\n* arr.set( [ 1.0, -1.0 ], 1 );\n* arr.set( [ 2.0, -2.0 ], 2 );\n*\n* var out = arr.sort( compare );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns -1.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns -2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = realf( z );\n* // returns 3.0\n*\n* im = imagf( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex64Array.prototype, 'toSorted', function toSorted( compareFcn ) {\n\tvar tmp;\n\tvar buf;\n\tvar len;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( compareFcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', compareFcn ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\ttmp = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\ttmp.push( getComplex64( buf, i ) );\n\t}\n\ttmp.sort( compareFcn );\n\treturn new Complex64Array( tmp );\n});\n\n/**\n* Serializes an array as a string.\n*\n* @name toString\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex64Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.toString();\n* // returns '1 + 1i,2 + 2i'\n*/\nsetReadOnly( Complex64Array.prototype, 'toString', function toString() {\n\tvar out;\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tout = [];\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex64( buf, i ).toString() );\n\t}\n\treturn out.join( ',' );\n});\n\n/**\n* Returns an iterator for iterating over each value in a typed array.\n*\n* @name values\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Iterator} iterator\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n* var arr = new Complex64Array( 2 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n*\n* var iter = arr.values();\n*\n* var v = iter.next().value;\n* // returns \n*\n* var re = realf( v );\n* // returns 1.0\n*\n* var im = imagf( v );\n* // returns -1.0\n*\n* v = iter.next().value;\n* // returns \n*\n* re = realf( v );\n* // returns 2.0\n*\n* im = imagf( v );\n* // returns -2.0\n*\n* var bool = iter.next().done;\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'values', function values() {\n\tvar iter;\n\tvar self;\n\tvar len;\n\tvar FLG;\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tself = this;\n\tbuf = this._buffer;\n\tlen = this._length;\n\n\t// Initialize an iteration index:\n\ti = -1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': getComplex64( buf, i ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.values();\n\t}\n});\n\n/**\n* Returns a new typed array with the element at a provided index replaced with a provided value.\n*\n* @name with\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} index - element index\n* @param {ComplexLike} value - new value\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {TypeError} second argument must be a complex number\n* @returns {Complex64Array} new typed array\n*\n* @example\n* import realf from '@stdlib/complex-float32-real';\n* import imagf from '@stdlib/complex-float32-imag';\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.with( 0, new Complex64( 4.0, 4.0 ) );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 4.0\n*\n* var im = imagf( z );\n* // returns 4.0\n*/\nsetReadOnly( Complex64Array.prototype, 'with', function copyWith( index, value ) {\n\tvar buf;\n\tvar out;\n\tvar len;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isInteger( index ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', index ) );\n\t}\n\tlen = this._length;\n\tif ( index < 0 ) {\n\t\tindex += len;\n\t}\n\tif ( index < 0 || index >= len ) {\n\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%s`.', index ) );\n\t}\n\tif ( !isComplexLike( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a complex number. Value: `%s`.', value ) );\n\t}\n\tout = new this.constructor( this._buffer );\n\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tbuf[ 2*index ] = realf( value );\n\tbuf[ (2*index)+1 ] = imagf( value );\n\treturn out;\n});\n\n\n// EXPORTS //\n\nexport default Complex64Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport realf from '@stdlib/complex-float32-real';\nimport imagf from '@stdlib/complex-float32-imag';\n\n\n// MAIN //\n\n/**\n* Returns a strided array of real and imaginary components.\n*\n* @private\n* @param {Float32Array} buf - output array\n* @param {Array} arr - array containing complex numbers\n* @returns {(Float32Array|null)} output array or null\n*/\nfunction fromArray( buf, arr ) {\n\tvar len;\n\tvar v;\n\tvar i;\n\tvar j;\n\n\tlen = arr.length;\n\tj = 0;\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = arr[ i ];\n\t\tif ( !isComplexLike( v ) ) {\n\t\t\treturn null;\n\t\t}\n\t\tbuf[ j ] = realf( v );\n\t\tbuf[ j+1 ] = imagf( v );\n\t\tj += 2; // stride\n\t}\n\treturn buf;\n}\n\n\n// EXPORTS //\n\nexport default fromArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the real component of a double-precision complex floating-point number.\n*\n* @param {Complex} z - complex number\n* @returns {number} real component\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var re = real( z );\n* // returns 5.0\n*/\nfunction real( z ) {\n\treturn z.re;\n}\n\n\n// EXPORTS //\n\nexport default real;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the imaginary component of a double-precision complex floating-point number.\n*\n* @param {Complex} z - complex number\n* @returns {number} imaginary component\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var im = imag( z );\n* // returns 3.0\n*/\nfunction imag( z ) {\n\treturn z.im;\n}\n\n\n// EXPORTS //\n\nexport default imag;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArrayLikeObject from '@stdlib/assert-is-array-like-object';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport format from '@stdlib/string-format';\nimport real from '@stdlib/complex-float64-real';\nimport imag from '@stdlib/complex-float64-imag';\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @returns {(Array|TypeError)} array or an error\n*/\nfunction fromIterator( it ) {\n\tvar out;\n\tvar v;\n\tvar z;\n\n\tout = [];\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\tz = v.value;\n\t\tif ( isArrayLikeObject( z ) && z.length >= 2 ) {\n\t\t\tout.push( z[ 0 ], z[ 1 ] );\n\t\t} else if ( isComplexLike( z ) ) {\n\t\t\tout.push( real( z ), imag( z ) );\n\t\t} else {\n\t\t\treturn new TypeError( format( 'invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', z ) );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default fromIterator;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArrayLikeObject from '@stdlib/assert-is-array-like-object';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport realf from '@stdlib/complex-float32-real';\nimport imagf from '@stdlib/complex-float32-imag';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @param {Function} clbk - callback to invoke for each iterated value\n* @param {*} thisArg - invocation context\n* @returns {(Array|TypeError)} array or an error\n*/\nfunction fromIteratorMap( it, clbk, thisArg ) {\n\tvar out;\n\tvar v;\n\tvar z;\n\tvar i;\n\n\tout = [];\n\ti = -1;\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\ti += 1;\n\t\tz = clbk.call( thisArg, v.value, i );\n\t\tif ( isArrayLikeObject( z ) && z.length >= 2 ) {\n\t\t\tout.push( z[ 0 ], z[ 1 ] );\n\t\t} else if ( isComplexLike( z ) ) {\n\t\t\tout.push( realf( z ), imagf( z ) );\n\t\t} else {\n\t\t\treturn new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', z ) );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default fromIteratorMap;\n","/* eslint-disable no-restricted-syntax, max-lines, no-invalid-this */\n\n/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\nimport isArrayLikeObject from '@stdlib/assert-is-array-like-object';\nimport isCollection from '@stdlib/assert-is-collection';\nimport isArrayBuffer from '@stdlib/assert-is-arraybuffer';\nimport isObject from '@stdlib/assert-is-object';\nimport isArray from '@stdlib/assert-is-array';\nimport { primitives as isStringArray } from '@stdlib/assert-is-string-array';\nimport isString from '@stdlib/assert-is-string';\nimport isFunction from '@stdlib/assert-is-function';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport isEven from '@stdlib/math-base-assert-is-even';\nimport isInteger from '@stdlib/math-base-assert-is-integer';\nimport isComplex64Array from '@stdlib/array-base-assert-is-complex64array';\nimport isComplex128Array from '@stdlib/array-base-assert-is-complex128array';\nimport hasIteratorSymbolSupport from '@stdlib/assert-has-iterator-symbol-support';\nimport ITERATOR_SYMBOL from '@stdlib/symbol-iterator';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport setReadOnlyAccessor from '@stdlib/utils-define-nonenumerable-read-only-accessor';\nimport Float64Array from '@stdlib/array-float64';\nimport Complex128 from '@stdlib/complex-float64-ctor';\nimport real from '@stdlib/complex-float64-real';\nimport imag from '@stdlib/complex-float64-imag';\nimport floor from '@stdlib/math-base-special-floor';\nimport reinterpret64 from '@stdlib/strided-base-reinterpret-complex64';\nimport reinterpret128 from '@stdlib/strided-base-reinterpret-complex128';\nimport getter from '@stdlib/array-base-getter';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport format from '@stdlib/string-format';\nimport fromIterator from './from_iterator.js';\nimport fromIteratorMap from './from_iterator_map.js';\nimport fromArray from './from_array.js';\n\n\n// VARIABLES //\n\nvar BYTES_PER_ELEMENT = Float64Array.BYTES_PER_ELEMENT * 2;\nvar HAS_ITERATOR_SYMBOL = hasIteratorSymbolSupport();\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating if a value is a complex typed array.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex typed array\n*/\nfunction isComplexArray( value ) {\n\treturn (\n\t\tvalue instanceof Complex128Array ||\n\t\t(\n\t\t\ttypeof value === 'object' &&\n\t\t\tvalue !== null &&\n\t\t\t(\n\t\t\t\tvalue.constructor.name === 'Complex64Array' ||\n\t\t\t\tvalue.constructor.name === 'Complex128Array'\n\t\t\t) &&\n\t\t\ttypeof value._length === 'number' && // eslint-disable-line no-underscore-dangle\n\n\t\t\t// NOTE: we don't perform a more rigorous test here for a typed array for performance reasons, as robustly checking for a typed array instance could require walking the prototype tree and performing relatively expensive constructor checks...\n\t\t\ttypeof value._buffer === 'object' // eslint-disable-line no-underscore-dangle\n\t\t)\n\t);\n}\n\n/**\n* Returns a boolean indicating if a value is a complex typed array constructor.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex typed array constructor\n*/\nfunction isComplexArrayConstructor( value ) {\n\treturn (\n\t\tvalue === Complex128Array ||\n\n\t\t// NOTE: weaker test in order to avoid a circular dependency with Complex64Array...\n\t\tvalue.name === 'Complex64Array'\n\t);\n}\n\n/**\n* Retrieves a complex number from a complex number array buffer.\n*\n* @private\n* @param {Float64Array} buf - array buffer\n* @param {NonNegativeInteger} idx - element index\n* @returns {Complex128} complex number\n*/\nfunction getComplex128( buf, idx ) {\n\tidx *= 2;\n\treturn new Complex128( buf[ idx ], buf[ idx+1 ] );\n}\n\n\n// MAIN //\n\n/**\n* 128-bit complex number array constructor.\n*\n* @constructor\n* @param {(NonNegativeInteger|Collection|ArrayBuffer|Iterable)} [arg] - length, typed array, array-like object, buffer, or iterable\n* @param {NonNegativeInteger} [byteOffset=0] - byte offset\n* @param {NonNegativeInteger} [length] - view length\n* @throws {RangeError} ArrayBuffer byte length must be a multiple of `16`\n* @throws {RangeError} array-like object and typed array input arguments must have a length which is a multiple of two\n* @throws {TypeError} if provided only a single argument, must provide a valid argument\n* @throws {TypeError} byte offset must be a nonnegative integer\n* @throws {RangeError} byte offset must be a multiple of `16`\n* @throws {TypeError} view length must be a positive multiple of `16`\n* @throws {RangeError} must provide sufficient memory to accommodate byte offset and view length requirements\n* @throws {TypeError} an iterator must return either a two element array containing real and imaginary components or a complex number\n* @returns {Complex128Array} complex number array\n*\n* @example\n* var arr = new Complex128Array();\n* // returns \n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var arr = new Complex128Array( 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var arr = new Complex128Array( [ 1.0, -1.0 ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new Complex128Array( buf );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new Complex128Array( buf, 16 );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 64 );\n* var arr = new Complex128Array( buf, 16, 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*/\nfunction Complex128Array() {\n\tvar byteOffset;\n\tvar nargs;\n\tvar buf;\n\tvar len;\n\n\tnargs = arguments.length;\n\tif ( !(this instanceof Complex128Array) ) {\n\t\tif ( nargs === 0 ) {\n\t\t\treturn new Complex128Array();\n\t\t}\n\t\tif ( nargs === 1 ) {\n\t\t\treturn new Complex128Array( arguments[0] );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\treturn new Complex128Array( arguments[0], arguments[1] );\n\t\t}\n\t\treturn new Complex128Array( arguments[0], arguments[1], arguments[2] );\n\t}\n\t// Create the underlying data buffer...\n\tif ( nargs === 0 ) {\n\t\tbuf = new Float64Array( 0 ); // backward-compatibility\n\t} else if ( nargs === 1 ) {\n\t\tif ( isNonNegativeInteger( arguments[0] ) ) {\n\t\t\tbuf = new Float64Array( arguments[0]*2 );\n\t\t} else if ( isCollection( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tlen = buf.length;\n\n\t\t\t// If provided a \"generic\" array, peak at the first value, and, if the value is a complex number, try to process as an array of complex numbers, falling back to \"normal\" typed array initialization if we fail and ensuring consistency if the first value had not been a complex number...\n\t\t\tif ( len && isArray( buf ) && isComplexLike( buf[0] ) ) {\n\t\t\t\tbuf = fromArray( new Float64Array( len*2 ), buf );\n\t\t\t\tif ( buf === null ) {\n\t\t\t\t\t// We failed and we are now forced to allocate a new array :-(\n\t\t\t\t\tif ( !isEven( len ) ) {\n\t\t\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t\t}\n\t\t\t\t\t// We failed, so fall back to directly setting values...\n\t\t\t\t\tbuf = new Float64Array( arguments[0] );\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif ( isComplex64Array( buf ) ) {\n\t\t\t\t\tbuf = reinterpret64( buf, 0 );\n\t\t\t\t} else if ( isComplex128Array( buf ) ) {\n\t\t\t\t\tbuf = reinterpret128( buf, 0 );\n\t\t\t\t} else if ( !isEven( len ) ) {\n\t\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object and typed array arguments must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t}\n\t\t\t\tbuf = new Float64Array( buf );\n\t\t\t}\n\t\t} else if ( isArrayBuffer( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tif ( !isInteger( buf.byteLength/BYTES_PER_ELEMENT ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. ArrayBuffer byte length must be a multiple of %u. Byte length: `%u`.', BYTES_PER_ELEMENT, buf.byteLength ) );\n\t\t\t}\n\t\t\tbuf = new Float64Array( buf );\n\t\t} else if ( isObject( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tif ( HAS_ITERATOR_SYMBOL === false ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tif ( !isFunction( buf[ ITERATOR_SYMBOL ] ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tbuf = buf[ ITERATOR_SYMBOL ]();\n\t\t\tif ( !isFunction( buf.next ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tbuf = fromIterator( buf );\n\t\t\tif ( buf instanceof Error ) {\n\t\t\t\tthrow buf;\n\t\t\t}\n\t\t\tbuf = new Float64Array( buf );\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arguments[0] ) );\n\t\t}\n\t} else {\n\t\tbuf = arguments[ 0 ];\n\t\tif ( !isArrayBuffer( buf ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an ArrayBuffer. Value: `%s`.', buf ) );\n\t\t}\n\t\tbyteOffset = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( byteOffset ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.', byteOffset ) );\n\t\t}\n\t\tif ( !isInteger( byteOffset/BYTES_PER_ELEMENT ) ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Byte offset must be a multiple of %u. Value: `%u`.', BYTES_PER_ELEMENT, byteOffset ) );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\tlen = buf.byteLength - byteOffset;\n\t\t\tif ( !isInteger( len/BYTES_PER_ELEMENT ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid arguments. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.', BYTES_PER_ELEMENT, len ) );\n\t\t\t}\n\t\t\tbuf = new Float64Array( buf, byteOffset );\n\t\t} else {\n\t\t\tlen = arguments[ 2 ];\n\t\t\tif ( !isNonNegativeInteger( len ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Length must be a nonnegative integer. Value: `%s`.', len ) );\n\t\t\t}\n\t\t\tif ( (len*BYTES_PER_ELEMENT) > (buf.byteLength-byteOffset) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.', len*BYTES_PER_ELEMENT ) );\n\t\t\t}\n\t\t\tbuf = new Float64Array( buf, byteOffset, len*2 );\n\t\t}\n\t}\n\tsetReadOnly( this, '_buffer', buf );\n\tsetReadOnly( this, '_length', buf.length/2 );\n\n\treturn this;\n}\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex128Array\n* @readonly\n* @type {PositiveInteger}\n* @default 16\n*\n* @example\n* var nbytes = Complex128Array.BYTES_PER_ELEMENT;\n* // returns 16\n*/\nsetReadOnly( Complex128Array, 'BYTES_PER_ELEMENT', BYTES_PER_ELEMENT );\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof Complex128Array\n* @readonly\n* @type {string}\n* @default 'Complex128Array'\n*\n* @example\n* var name = Complex128Array.name;\n* // returns 'Complex128Array'\n*/\nsetReadOnly( Complex128Array, 'name', 'Complex128Array' );\n\n/**\n* Creates a new 128-bit complex number array from an array-like object or an iterable.\n*\n* @name from\n* @memberof Complex128Array\n* @type {Function}\n* @param {(Collection|Object)} src - array-like object or iterable\n* @param {Function} [clbk] - callback to invoke for each source element\n* @param {*} [thisArg] - context\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an array-like object or an iterable\n* @throws {TypeError} second argument must be a function\n* @throws {RangeError} array-like objects must have a length which is a multiple of two\n* @throws {TypeError} an iterator must return either a two element array containing real and imaginary components or a complex number\n* @throws {TypeError} when provided an iterator, a callback must return either a two element array containing real and imaginary components or a complex number\n* @returns {Complex128Array} 128-bit complex number array\n*\n* @example\n* var arr = Complex128Array.from( [ 1.0, -1.0 ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var arr = Complex128Array.from( [ new Complex128( 1.0, 1.0 ) ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function clbk( v ) {\n* return new Complex128( real(v)*2.0, imag(v)*2.0 );\n* }\n*\n* var arr = Complex128Array.from( [ new Complex128( 1.0, 1.0 ) ], clbk );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*/\nsetReadOnly( Complex128Array, 'from', function from( src ) {\n\tvar thisArg;\n\tvar nargs;\n\tvar clbk;\n\tvar out;\n\tvar buf;\n\tvar tmp;\n\tvar get;\n\tvar len;\n\tvar flg;\n\tvar v;\n\tvar i;\n\tvar j;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isComplexArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tnargs = arguments.length;\n\tif ( nargs > 1 ) {\n\t\tclbk = arguments[ 1 ];\n\t\tif ( !isFunction( clbk ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a function. Value: `%s`.', clbk ) );\n\t\t}\n\t\tif ( nargs > 2 ) {\n\t\t\tthisArg = arguments[ 2 ];\n\t\t}\n\t}\n\tif ( isComplexArray( src ) ) {\n\t\tlen = src.length;\n\t\tif ( clbk ) {\n\t\t\tout = new this( len );\n\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tv = clbk.call( thisArg, src.get( i ), i );\n\t\t\t\tif ( isComplexLike( v ) ) {\n\t\t\t\t\tbuf[ j ] = real( v );\n\t\t\t\t\tbuf[ j+1 ] = imag( v );\n\t\t\t\t} else if ( isArrayLikeObject( v ) && v.length >= 2 ) {\n\t\t\t\t\tbuf[ j ] = v[ 0 ];\n\t\t\t\t\tbuf[ j+1 ] = v[ 1 ];\n\t\t\t\t} else {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t\t\t}\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\treturn new this( src );\n\t}\n\tif ( isCollection( src ) ) {\n\t\tif ( clbk ) {\n\t\t\t// Note: array contents affect how we iterate over a provided data source. If only complex number objects, we can extract real and imaginary components. Otherwise, for non-complex number arrays (e.g., `Float64Array`, etc), we assume a strided array where real and imaginary components are interleaved. In the former case, we expect a callback to return real and imaginary components (possibly as a complex number). In the latter case, we expect a callback to return *either* a real or imaginary component.\n\n\t\t\tlen = src.length;\n\t\t\tif ( src.get && src.set ) {\n\t\t\t\tget = accessorGetter( 'default' );\n\t\t\t} else {\n\t\t\t\tget = getter( 'default' );\n\t\t\t}\n\t\t\t// Detect whether we've been provided an array which returns complex number objects...\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tif ( !isComplexLike( get( src, i ) ) ) {\n\t\t\t\t\tflg = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// If an array does not contain only complex number objects, then we assume interleaved real and imaginary components...\n\t\t\tif ( flg ) {\n\t\t\t\tif ( !isEven( len ) ) {\n\t\t\t\t\tthrow new RangeError( format( 'invalid argument. First argument must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t}\n\t\t\t\tout = new this( len/2 );\n\t\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\t\tbuf[ i ] = clbk.call( thisArg, get( src, i ), i );\n\t\t\t\t}\n\t\t\t\treturn out;\n\t\t\t}\n\t\t\t// If an array contains only complex number objects, then we need to extract real and imaginary components...\n\t\t\tout = new this( len );\n\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tv = clbk.call( thisArg, get( src, i ), i );\n\t\t\t\tif ( isComplexLike( v ) ) {\n\t\t\t\t\tbuf[ j ] = real( v );\n\t\t\t\t\tbuf[ j+1 ] = imag( v );\n\t\t\t\t} else if ( isArrayLikeObject( v ) && v.length >= 2 ) {\n\t\t\t\t\tbuf[ j ] = v[ 0 ];\n\t\t\t\t\tbuf[ j+1 ] = v[ 1 ];\n\t\t\t\t} else {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t\t\t}\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\treturn new this( src );\n\t}\n\tif ( isObject( src ) && HAS_ITERATOR_SYMBOL && isFunction( src[ ITERATOR_SYMBOL ] ) ) { // eslint-disable-line max-len\n\t\tbuf = src[ ITERATOR_SYMBOL ]();\n\t\tif ( !isFunction( buf.next ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n\t\t}\n\t\tif ( clbk ) {\n\t\t\ttmp = fromIteratorMap( buf, clbk, thisArg );\n\t\t} else {\n\t\t\ttmp = fromIterator( buf );\n\t\t}\n\t\tif ( tmp instanceof Error ) {\n\t\t\tthrow tmp;\n\t\t}\n\t\tlen = tmp.length / 2;\n\t\tout = new this( len );\n\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tbuf[ i ] = tmp[ i ];\n\t\t}\n\t\treturn out;\n\t}\n\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n});\n\n/**\n* Creates a new 128-bit complex number array from a variable number of arguments.\n*\n* @name of\n* @memberof Complex128Array\n* @type {Function}\n* @param {...*} element - array elements\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex128Array} 128-bit complex number array\n*\n* @example\n* var arr = Complex128Array.of( 1.0, 1.0, 1.0, 1.0 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*/\nsetReadOnly( Complex128Array, 'of', function of() {\n\tvar args;\n\tvar i;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isComplexArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\targs = [];\n\tfor ( i = 0; i < arguments.length; i++ ) {\n\t\targs.push( arguments[ i ] );\n\t}\n\treturn new this( args );\n});\n\n/**\n* Returns an array element with support for both nonnegative and negative integer indices.\n*\n* @name at\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {integer} idx - element index\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} must provide an integer\n* @returns {(Complex128|void)} array element\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var arr = new Complex128Array( 10 );\n*\n* var z = arr.at( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 0.0\n*\n* var im = imag( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 9.0, -9.0 ], 9 );\n*\n* z = arr.at( 0 );\n* // returns \n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns -1.0\n*\n* z = arr.at( -1 );\n* // returns \n*\n* re = real( z );\n* // returns 9.0\n*\n* im = imag( z );\n* // returns -9.0\n*\n* z = arr.at( 100 );\n* // returns undefined\n*\n* z = arr.at( -100 );\n* // returns undefined\n*/\nsetReadOnly( Complex128Array.prototype, 'at', function at( idx ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an integer. Value: `%s`.', idx ) );\n\t}\n\tif ( idx < 0 ) {\n\t\tidx += this._length;\n\t}\n\tif ( idx < 0 || idx >= this._length ) {\n\t\treturn;\n\t}\n\treturn getComplex128( this._buffer, idx );\n});\n\n/**\n* Pointer to the underlying data buffer.\n*\n* @name buffer\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {ArrayBuffer}\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var buf = arr.buffer;\n* // returns \n*/\nsetReadOnlyAccessor( Complex128Array.prototype, 'buffer', function get() {\n\treturn this._buffer.buffer;\n});\n\n/**\n* Size (in bytes) of the array.\n*\n* @name byteLength\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var byteLength = arr.byteLength;\n* // returns 160\n*/\nsetReadOnlyAccessor( Complex128Array.prototype, 'byteLength', function get() {\n\treturn this._buffer.byteLength;\n});\n\n/**\n* Offset (in bytes) of the array from the start of its underlying `ArrayBuffer`.\n*\n* @name byteOffset\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var byteOffset = arr.byteOffset;\n* // returns 0\n*/\nsetReadOnlyAccessor( Complex128Array.prototype, 'byteOffset', function get() {\n\treturn this._buffer.byteOffset;\n});\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {PositiveInteger}\n* @default 16\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var nbytes = arr.BYTES_PER_ELEMENT;\n* // returns 16\n*/\nsetReadOnly( Complex128Array.prototype, 'BYTES_PER_ELEMENT', Complex128Array.BYTES_PER_ELEMENT );\n\n/**\n* Copies a sequence of elements within the array to the position starting at `target`.\n*\n* @name copyWithin\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {integer} target - index at which to start copying elements\n* @param {integer} start - source index at which to copy elements from\n* @param {integer} [end] - source index at which to stop copying elements from\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex128Array} modified array\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var arr = new Complex128Array( 4 );\n*\n* // Set the array elements:\n* arr.set( new Complex128( 1.0, 1.0 ), 0 );\n* arr.set( new Complex128( 2.0, 2.0 ), 1 );\n* arr.set( new Complex128( 3.0, 3.0 ), 2 );\n* arr.set( new Complex128( 4.0, 4.0 ), 3 );\n*\n* // Copy the first two elements to the last two elements:\n* arr.copyWithin( 2, 0, 2 );\n*\n* // Get the last array element:\n* var z = arr.get( 3 );\n*\n* var re = real( z );\n* // returns 2.0\n*\n* var im = imag( z );\n* // returns 2.0\n*/\nsetReadOnly( Complex128Array.prototype, 'copyWithin', function copyWithin( target, start ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\t// FIXME: prefer a functional `copyWithin` implementation which addresses lack of universal browser support (e.g., IE11 and Safari) or ensure that typed arrays are polyfilled\n\tif ( arguments.length === 2 ) {\n\t\tthis._buffer.copyWithin( target*2, start*2 );\n\t} else {\n\t\tthis._buffer.copyWithin( target*2, start*2, arguments[2]*2 );\n\t}\n\treturn this;\n});\n\n/**\n* Returns an iterator for iterating over array key-value pairs.\n*\n* @name entries\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Iterator} iterator\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var arr = [\n* new Complex128( 1.0, 1.0 ),\n* new Complex128( 2.0, 2.0 ),\n* new Complex128( 3.0, 3.0 )\n* ];\n* arr = new Complex128Array( arr );\n*\n* // Create an iterator:\n* var it = arr.entries();\n*\n* // Iterate over the key-value pairs...\n* var v = it.next().value;\n* // returns [ 0, ]\n*\n* v = it.next().value;\n* // returns [ 1, ]\n*\n* v = it.next().value;\n* // returns [ 2, ]\n*\n* var bool = it.next().done;\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'entries', function entries() {\n\tvar buffer;\n\tvar self;\n\tvar iter;\n\tvar len;\n\tvar FLG;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tself = this;\n\tbuffer = this._buffer;\n\tlen = this._length;\n\n\t// Initialize the iteration indices:\n\ti = -1;\n\tj = -2;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\tvar z;\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\tj += 2;\n\t\tz = new Complex128( buffer[ j ], buffer[ j+1 ] );\n\t\treturn {\n\t\t\t'value': [ i, z ],\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.entries();\n\t}\n});\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @name every\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var bool = arr.every( predicate );\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'every', function every( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( !predicate.call( thisArg, getComplex128( buf, i ), i, this ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n});\n\n/**\n* Returns a modified typed array filled with a fill value.\n*\n* @name fill\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {ComplexLike} value - fill value\n* @param {integer} [start=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @throws {TypeError} third argument must be an integer\n* @returns {Complex128Array} modified array\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.fill( new Complex128( 1.0, 1.0 ), 1 );\n*\n* var z = arr.get( 1 );\n* // returns \n*\n* var re = real( z );\n* // returns 1.0\n*\n* var im = imag( z );\n* // returns 1.0\n*\n* z = arr.get( 2 );\n* // returns \n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'fill', function fill( value, start, end ) {\n\tvar buf;\n\tvar len;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', value ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( start ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', start ) );\n\t\t}\n\t\tif ( start < 0 ) {\n\t\t\tstart += len;\n\t\t\tif ( start < 0 ) {\n\t\t\t\tstart = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length > 2 ) {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t} else {\n\t\t\tend = len;\n\t\t}\n\t} else {\n\t\tstart = 0;\n\t\tend = len;\n\t}\n\tre = real( value );\n\tim = imag( value );\n\tfor ( i = start; i < end; i++ ) {\n\t\tidx = 2*i;\n\t\tbuf[ idx ] = re;\n\t\tbuf[ idx+1 ] = im;\n\t}\n\treturn this;\n});\n\n/**\n* Returns a new array containing the elements of an array which pass a test implemented by a predicate function.\n*\n* @name filter\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex128Array} complex number array\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var out = arr.filter( predicate );\n* // returns \n*\n* var len = out.length;\n* // returns 1\n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 2.0\n*\n* var im = imag( z );\n* // returns 2.0\n*/\nsetReadOnly( Complex128Array.prototype, 'filter', function filter( predicate, thisArg ) {\n\tvar buf;\n\tvar out;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tout = [];\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\tout.push( z );\n\t\t}\n\t}\n\treturn new this.constructor( out );\n});\n\n/**\n* Returns the first element in an array for which a predicate function returns a truthy value.\n*\n* @name find\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {(Complex128|void)} array element or undefined\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.find( predicate );\n* // returns \n*\n* var re = real( z );\n* // returns 1.0\n*\n* var im = imag( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'find', function find( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn z;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the first element in an array for which a predicate function returns a truthy value.\n*\n* @name findIndex\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var idx = arr.findIndex( predicate );\n* // returns 2\n*/\nsetReadOnly( Complex128Array.prototype, 'findIndex', function findIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLast\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {(Complex128|void)} array element or undefined\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.findLast( predicate );\n* // returns \n*\n* var re = real( z );\n* // returns 3.0\n*\n* var im = imag( z );\n* // returns 3.0\n*/\nsetReadOnly( Complex128Array.prototype, 'findLast', function findLast( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn z;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLastIndex\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var idx = arr.findLastIndex( predicate );\n* // returns 1\n*/\nsetReadOnly( Complex128Array.prototype, 'findLastIndex', function findLastIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Invokes a function once for each array element.\n*\n* @name forEach\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} fcn - function to invoke\n* @param {*} [thisArg] - function invocation context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* function log( v, i ) {\n* console.log( '%s: %s', i, v.toString() );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* arr.forEach( log );\n*/\nsetReadOnly( Complex128Array.prototype, 'forEach', function forEach( fcn, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex128( buf, i );\n\t\tfcn.call( thisArg, z, i, this );\n\t}\n});\n\n/**\n* Returns an array element.\n*\n* @name get\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {NonNegativeInteger} idx - element index\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} must provide a nonnegative integer\n* @returns {(Complex128|void)} array element\n*\n* @example\n* var arr = new Complex128Array( 10 );\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var z = arr.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 0.0\n*\n* var im = imag( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n*\n* z = arr.get( 0 );\n* // returns \n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns -1.0\n*\n* z = arr.get( 100 );\n* // returns undefined\n*/\nsetReadOnly( Complex128Array.prototype, 'get', function get( idx ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isNonNegativeInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a nonnegative integer. Value: `%s`.', idx ) );\n\t}\n\tif ( idx >= this._length ) {\n\t\treturn;\n\t}\n\treturn getComplex128( this._buffer, idx );\n});\n\n/**\n* Number of array elements.\n*\n* @name length\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var len = arr.length;\n* // returns 10\n*/\nsetReadOnlyAccessor( Complex128Array.prototype, 'length', function get() {\n\treturn this._length;\n});\n\n/**\n* Returns a boolean indicating whether an array includes a provided value.\n*\n* @name includes\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - search element\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {boolean} boolean indicating whether an array includes a provided value\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var arr = new Complex128Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var bool = arr.includes( new Complex128( 3.0, -3.0 ) );\n* // returns true\n*\n* bool = arr.includes( new Complex128( 3.0, -3.0 ), 3 );\n* // returns false\n*\n* bool = arr.includes( new Complex128( 4.0, -4.0 ), -3 );\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'includes', function includes( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tre = real( searchElement );\n\tim = imag( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Returns the first index at which a given element can be found.\n*\n* @name indexOf\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - element to find\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var arr = new Complex128Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var idx = arr.indexOf( new Complex128( 3.0, -3.0 ) );\n* // returns 2\n*\n* idx = arr.indexOf( new Complex128( 3.0, -3.0 ), 3 );\n* // returns -1\n*\n* idx = arr.indexOf( new Complex128( 4.0, -4.0 ), -3 );\n* // returns 3\n*/\nsetReadOnly( Complex128Array.prototype, 'indexOf', function indexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tre = real( searchElement );\n\tim = imag( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns a new string by concatenating all array elements.\n*\n* @name join\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {string} [separator=','] - element separator\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a string\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex128Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.join();\n* // returns '1 + 1i,2 + 2i'\n*\n* str = arr.join( '/' );\n* // returns '1 + 1i/2 + 2i'\n*/\nsetReadOnly( Complex128Array.prototype, 'join', function join( separator ) {\n\tvar out;\n\tvar buf;\n\tvar sep;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( arguments.length === 0 ) {\n\t\tsep = ',';\n\t} else if ( isString( separator ) ) {\n\t\tsep = separator;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string. Value: `%s`.', separator ) );\n\t}\n\tout = [];\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex128( buf, i ).toString() );\n\t}\n\treturn out.join( sep );\n});\n\n/**\n* Returns an iterator for iterating over each index key in a typed array.\n*\n* @name keys\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Iterator} iterator\n*\n* @example\n* var arr = new Complex128Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var iter = arr.keys();\n*\n* var v = iter.next().value;\n* // returns 0\n*\n* v = iter.next().value;\n* // returns 1\n*\n* var bool = iter.next().done;\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'keys', function keys() {\n\tvar self;\n\tvar iter;\n\tvar len;\n\tvar FLG;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tself = this;\n\tlen = this._length;\n\n\t// Initialize an iteration index:\n\ti = -1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': i,\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.keys();\n\t}\n});\n\n/**\n* Returns the last index at which a given element can be found.\n*\n* @name lastIndexOf\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - element to find\n* @param {integer} [fromIndex] - index at which to start searching backward (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var arr = new Complex128Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 3.0, -3.0 ], 4 );\n*\n* var idx = arr.lastIndexOf( new Complex128( 3.0, -3.0 ) );\n* // returns 4\n*\n* idx = arr.lastIndexOf( new Complex128( 3.0, -3.0 ), 3 );\n* // returns 2\n*\n* idx = arr.lastIndexOf( new Complex128( 5.0, -5.0 ), 3 );\n* // returns -1\n*\n* idx = arr.lastIndexOf( new Complex128( 2.0, -2.0 ), -3 );\n* // returns 1\n*/\nsetReadOnly( Complex128Array.prototype, 'lastIndexOf', function lastIndexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex >= this._length ) {\n\t\t\tfromIndex = this._length - 1;\n\t\t} else if ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t}\n\t} else {\n\t\tfromIndex = this._length - 1;\n\t}\n\tre = real( searchElement );\n\tim = imag( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i >= 0; i-- ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns a new array with each element being the result of a provided callback function.\n*\n* @name map\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} fcn - callback function\n* @param {*} [thisArg] - callback function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex128Array} complex number array\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function scale( v, i ) {\n* return new Complex128( 2.0*real( v ), 2.0*imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var out = arr.map( scale );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 2.0\n*\n* var im = imag( z );\n* // returns -2.0\n*/\nsetReadOnly( Complex128Array.prototype, 'map', function map( fcn, thisArg ) {\n\tvar outbuf;\n\tvar buf;\n\tvar out;\n\tvar i;\n\tvar v;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\tbuf = this._buffer;\n\tout = new this.constructor( this._length );\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tv = fcn.call( thisArg, getComplex128( buf, i ), i, this );\n\t\tif ( isComplexLike( v ) ) {\n\t\t\toutbuf[ 2*i ] = real( v );\n\t\t\toutbuf[ (2*i)+1 ] = imag( v );\n\t\t} else if ( isArrayLikeObject( v ) && v.length === 2 ) {\n\t\t\toutbuf[ 2*i ] = v[ 0 ];\n\t\t\toutbuf[ (2*i)+1 ] = v[ 1 ];\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t}\n\t}\n\treturn out;\n});\n\n/**\n* Applies a provided callback function to each element of the array, in order, passing in the return value from the calculation on the preceding element and returning the accumulated result upon completion.\n*\n* @name reduce\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} reducer - callback function\n* @param {*} [initialValue] - initial value\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @throws {Error} if not provided an initial value, the array must have at least one element\n* @returns {*} accumulated result\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n* import cadd from '@stdlib/complex-float64-base-add';\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.reduce( cadd );\n* // returns \n*\n* var re = real( z );\n* // returns 6.0\n*\n* var im = imag( z );\n* // returns 6.0\n*/\nsetReadOnly( Complex128Array.prototype, 'reduce', function reduce( reducer, initialValue ) {\n\tvar buf;\n\tvar acc;\n\tvar len;\n\tvar v;\n\tvar i;\n\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( reducer ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', reducer ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tacc = initialValue;\n\t\ti = 0;\n\t} else {\n\t\tif ( len === 0 ) {\n\t\t\tthrow new Error( 'invalid operation. If not provided an initial value, an array must contain at least one element.' );\n\t\t}\n\t\tacc = getComplex128( buf, 0 );\n\t\ti = 1;\n\t}\n\tfor ( ; i < len; i++ ) {\n\t\tv = getComplex128( buf, i );\n\t\tacc = reducer( acc, v, i, this );\n\t}\n\treturn acc;\n});\n\n/**\n* Applies a provided callback function to each element of the array, in reverse order, passing in the return value from the calculation on the preceding element and returning the accumulated result upon completion.\n*\n* @name reduceRight\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} reducer - callback function\n* @param {*} [initialValue] - initial value\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @throws {Error} if not provided an initial value, the array must have at least one element\n* @returns {*} accumulated result\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n* import cadd from '@stdlib/complex-float64-base-add';\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.reduceRight( cadd );\n* // returns \n*\n* var re = real( z );\n* // returns 6.0\n*\n* var im = imag( z );\n* // returns 6.0\n*/\nsetReadOnly( Complex128Array.prototype, 'reduceRight', function reduceRight( reducer, initialValue ) {\n\tvar buf;\n\tvar acc;\n\tvar len;\n\tvar v;\n\tvar i;\n\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( reducer ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', reducer ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tacc = initialValue;\n\t\ti = len-1;\n\t} else {\n\t\tif ( len === 0 ) {\n\t\t\tthrow new Error( 'invalid operation. If not provided an initial value, an array must contain at least one element.' );\n\t\t}\n\t\tacc = getComplex128( buf, len-1 );\n\t\ti = len-2;\n\t}\n\tfor ( ; i >= 0; i-- ) {\n\t\tv = getComplex128( buf, i );\n\t\tacc = reducer( acc, v, i, this );\n\t}\n\treturn acc;\n});\n\n/**\n* Reverses an array in-place.\n*\n* @name reverse\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex128Array} reversed array\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.reverse();\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 3.0\n*\n* var im = imag( z );\n* // returns 3.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = real( z );\n* // returns 2.0\n*\n* im = imag( z );\n* // returns 2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'reverse', function reverse() {\n\tvar buf;\n\tvar tmp;\n\tvar len;\n\tvar N;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tlen = this._length;\n\tbuf = this._buffer;\n\tN = floor( len / 2 );\n\tfor ( i = 0; i < N; i++ ) {\n\t\tj = len - i - 1;\n\t\ttmp = buf[ (2*i) ];\n\t\tbuf[ (2*i) ] = buf[ (2*j) ];\n\t\tbuf[ (2*j) ] = tmp;\n\t\ttmp = buf[ (2*i)+1 ];\n\t\tbuf[ (2*i)+1 ] = buf[ (2*j)+1 ];\n\t\tbuf[ (2*j)+1 ] = tmp;\n\t}\n\treturn this;\n});\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* - When provided a typed array, real or complex, we must check whether the source array shares the same buffer as the target array and whether the underlying memory overlaps. In particular, we are concerned with the following scenario:\n*\n* ```text\n* buf: ---------------------\n* src: ---------------------\n* ```\n*\n* In the above, as we copy values from `src`, we will overwrite values in the `src` view, resulting in duplicated values copied into the end of `buf`, which is not intended. Hence, to avoid overwriting source values, we must **copy** source values to a temporary array.\n*\n* In the other overlapping scenario,\n*\n* ```text\n* buf: ---------------------\n* src: ---------------------\n* ```\n*\n* by the time we begin copying into the overlapping region, we are copying from the end of `src`, a non-overlapping region, which means we don't run the risk of copying copied values, rather than the original `src` values as intended.\n*\n* @name set\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n* @param {NonNegativeInteger} [i=0] - element index at which to start writing values\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be either a complex number, an array-like object, or a complex number array\n* @throws {TypeError} index argument must be a nonnegative integer\n* @throws {RangeError} array-like objects must have a length which is a multiple of two\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {RangeError} target array lacks sufficient storage to accommodate source values\n* @returns {void}\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var arr = new Complex128Array( 10 );\n*\n* var z = arr.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 0.0\n*\n* var im = imag( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n*\n* z = arr.get( 0 );\n* // returns \n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns -1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'set', function set( value ) {\n\t/* eslint-disable no-underscore-dangle */\n\tvar sbuf;\n\tvar idx;\n\tvar buf;\n\tvar tmp;\n\tvar flg;\n\tvar N;\n\tvar v;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tif ( arguments.length > 1 ) {\n\t\tidx = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( idx ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Index argument must be a nonnegative integer. Value: `%s`.', idx ) );\n\t\t}\n\t} else {\n\t\tidx = 0;\n\t}\n\tif ( isComplexLike( value ) ) {\n\t\tif ( idx >= this._length ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%u`.', idx ) );\n\t\t}\n\t\tidx *= 2;\n\t\tbuf[ idx ] = real( value );\n\t\tbuf[ idx+1 ] = imag( value );\n\t\treturn;\n\t}\n\tif ( isComplexArray( value ) ) {\n\t\tN = value._length;\n\t\tif ( idx+N > this._length ) {\n\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t}\n\t\tsbuf = value._buffer;\n\n\t\t// Check for overlapping memory...\n\t\tj = buf.byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\tif (\n\t\t\tsbuf.buffer === buf.buffer &&\n\t\t\t(\n\t\t\t\tsbuf.byteOffset < j &&\n\t\t\t\tsbuf.byteOffset+sbuf.byteLength > j\n\t\t\t)\n\t\t) {\n\t\t\t// We need to copy source values...\n\t\t\ttmp = new Float64Array( sbuf.length );\n\t\t\tfor ( i = 0; i < sbuf.length; i++ ) {\n\t\t\t\ttmp[ i ] = sbuf[ i ];\n\t\t\t}\n\t\t\tsbuf = tmp;\n\t\t}\n\t\tidx *= 2;\n\t\tj = 0;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tbuf[ idx ] = sbuf[ j ];\n\t\t\tbuf[ idx+1 ] = sbuf[ j+1 ];\n\t\t\tidx += 2; // stride\n\t\t\tj += 2; // stride\n\t\t}\n\t\treturn;\n\t}\n\tif ( isCollection( value ) ) {\n\t\t// Detect whether we've been provided an array of complex numbers...\n\t\tN = value.length;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tif ( !isComplexLike( value[ i ] ) ) {\n\t\t\t\tflg = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t// If an array does not contain only complex numbers, then we assume interleaved real and imaginary components...\n\t\tif ( flg ) {\n\t\t\tif ( !isEven( N ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.', N ) );\n\t\t\t}\n\t\t\tif ( idx+(N/2) > this._length ) {\n\t\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t\t}\n\t\t\tsbuf = value;\n\n\t\t\t// Check for overlapping memory...\n\t\t\tj = buf.byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\t\tif (\n\t\t\t\tsbuf.buffer === buf.buffer &&\n\t\t\t\t(\n\t\t\t\t\tsbuf.byteOffset < j &&\n\t\t\t\t\tsbuf.byteOffset+sbuf.byteLength > j\n\t\t\t\t)\n\t\t\t) {\n\t\t\t\t// We need to copy source values...\n\t\t\t\ttmp = new Float64Array( N );\n\t\t\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t\t\ttmp[ i ] = sbuf[ i ];\n\t\t\t\t}\n\t\t\t\tsbuf = tmp;\n\t\t\t}\n\t\t\tidx *= 2;\n\t\t\tN /= 2;\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t\tbuf[ idx ] = sbuf[ j ];\n\t\t\t\tbuf[ idx+1 ] = sbuf[ j+1 ];\n\t\t\t\tidx += 2; // stride\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\t// If an array contains only complex numbers, then we need to extract real and imaginary components...\n\t\tif ( idx+N > this._length ) {\n\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t}\n\t\tidx *= 2;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tv = value[ i ];\n\t\t\tbuf[ idx ] = real( v );\n\t\t\tbuf[ idx+1 ] = imag( v );\n\t\t\tidx += 2; // stride\n\t\t}\n\t\treturn;\n\t}\n\tthrow new TypeError( format( 'invalid argument. First argument must be either a complex number, an array-like object, or a complex number array. Value: `%s`.', value ) );\n\n\t/* eslint-enable no-underscore-dangle */\n});\n\n/**\n* Copies a portion of a typed array to a new typed array.\n*\n* @name slice\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {integer} [start=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {TypeError} second argument must be an integer\n* @returns {Complex128Array} complex number array\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var arr = new Complex128Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var out = arr.slice();\n* // returns \n*\n* var len = out.length;\n* // returns 5\n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 1.0\n*\n* var im = imag( z );\n* // returns -1.0\n*\n* z = out.get( len-1 );\n* // returns \n*\n* re = real( z );\n* // returns 5.0\n*\n* im = imag( z );\n* // returns -5.0\n*\n* out = arr.slice( 1, -2 );\n* // returns \n*\n* len = out.length;\n* // returns 2\n*\n* z = out.get( 0 );\n* // returns \n*\n* re = real( z );\n* // returns 2.0\n*\n* im = imag( z );\n* // returns -2.0\n*\n* z = out.get( len-1 );\n* // returns \n*\n* re = real( z );\n* // returns 3.0\n*\n* im = imag( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex128Array.prototype, 'slice', function slice( start, end ) {\n\tvar outlen;\n\tvar outbuf;\n\tvar out;\n\tvar idx;\n\tvar buf;\n\tvar len;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length === 0 ) {\n\t\tstart = 0;\n\t\tend = len;\n\t} else {\n\t\tif ( !isInteger( start ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', start ) );\n\t\t}\n\t\tif ( start < 0 ) {\n\t\t\tstart += len;\n\t\t\tif ( start < 0 ) {\n\t\t\t\tstart = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length === 1 ) {\n\t\t\tend = len;\n\t\t} else {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t} else if ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t}\n\t}\n\tif ( start < end ) {\n\t\toutlen = end - start;\n\t} else {\n\t\toutlen = 0;\n\t}\n\tout = new this.constructor( outlen );\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < outlen; i++ ) {\n\t\tidx = 2*(i+start);\n\t\toutbuf[ 2*i ] = buf[ idx ];\n\t\toutbuf[ (2*i)+1 ] = buf[ idx+1 ];\n\t}\n\treturn out;\n});\n\n/**\n* Tests whether at least one element in an array passes a test implemented by a predicate function.\n*\n* @name some\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether at least one element passes a test\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var bool = arr.some( predicate );\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'some', function some( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( predicate.call( thisArg, getComplex128( buf, i ), i, this ) ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Sorts an array in-place.\n*\n* @name sort\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} compareFcn - comparison function\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex128Array} sorted array\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function compare( a, b ) {\n* var re1;\n* var re2;\n* var im1;\n* var im2;\n* re1 = real( a );\n* re2 = real( b );\n* if ( re1 < re2 ) {\n* return -1;\n* }\n* if ( re1 > re2 ) {\n* return 1;\n* }\n* im1 = imag( a );\n* im2 = imag( b );\n* if ( im1 < im2 ) {\n* return -1;\n* }\n* if ( im1 > im2 ) {\n* return 1;\n* }\n* return 0;\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 3.0, -3.0 ], 0 );\n* arr.set( [ 1.0, -1.0 ], 1 );\n* arr.set( [ 2.0, -2.0 ], 2 );\n*\n* var out = arr.sort( compare );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 1.0\n*\n* var im = imag( z );\n* // returns -1.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = real( z );\n* // returns 2.0\n*\n* im = imag( z );\n* // returns -2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = real( z );\n* // returns 3.0\n*\n* im = imag( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex128Array.prototype, 'sort', function sort( compareFcn ) {\n\tvar tmp;\n\tvar buf;\n\tvar len;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( compareFcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', compareFcn ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\ttmp = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\ttmp.push( getComplex128( buf, i ) );\n\t}\n\ttmp.sort( compareFcn );\n\tfor ( i = 0; i < len; i++ ) {\n\t\tj = 2 * i;\n\t\tbuf[ j ] = real( tmp[i] );\n\t\tbuf[ j+1 ] = imag( tmp[i] );\n\t}\n\treturn this;\n});\n\n/**\n* Creates a new typed array view over the same underlying `ArrayBuffer` and with the same underlying data type as the host array.\n*\n* @name subarray\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {integer} [begin=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {TypeError} second argument must be an integer\n* @returns {Complex64Array} subarray\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var arr = new Complex128Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var subarr = arr.subarray();\n* // returns \n*\n* var len = subarr.length;\n* // returns 5\n*\n* var z = subarr.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 1.0\n*\n* var im = imag( z );\n* // returns -1.0\n*\n* z = subarr.get( len-1 );\n* // returns \n*\n* re = real( z );\n* // returns 5.0\n*\n* im = imag( z );\n* // returns -5.0\n*\n* subarr = arr.subarray( 1, -2 );\n* // returns \n*\n* len = subarr.length;\n* // returns 2\n*\n* z = subarr.get( 0 );\n* // returns \n*\n* re = real( z );\n* // returns 2.0\n*\n* im = imag( z );\n* // returns -2.0\n*\n* z = subarr.get( len-1 );\n* // returns \n*\n* re = real( z );\n* // returns 3.0\n*\n* im = imag( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex128Array.prototype, 'subarray', function subarray( begin, end ) {\n\tvar offset;\n\tvar buf;\n\tvar len;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length === 0 ) {\n\t\tbegin = 0;\n\t\tend = len;\n\t} else {\n\t\tif ( !isInteger( begin ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', begin ) );\n\t\t}\n\t\tif ( begin < 0 ) {\n\t\t\tbegin += len;\n\t\t\tif ( begin < 0 ) {\n\t\t\t\tbegin = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length === 1 ) {\n\t\t\tend = len;\n\t\t} else {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t} else if ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t}\n\t}\n\tif ( begin >= len ) {\n\t\tlen = 0;\n\t\toffset = buf.byteLength;\n\t} else if ( begin >= end ) {\n\t\tlen = 0;\n\t\toffset = buf.byteOffset + ( begin*BYTES_PER_ELEMENT );\n\t} else {\n\t\tlen = end - begin;\n\t\toffset = buf.byteOffset + ( begin*BYTES_PER_ELEMENT );\n\t}\n\treturn new this.constructor( buf.buffer, offset, ( len < 0 ) ? 0 : len );\n});\n\n/**\n* Serializes an array as a locale-specific string.\n*\n* @name toLocaleString\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {(string|Array)} [locales] - locale identifier(s)\n* @param {Object} [options] - configuration options\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a string or an array of strings\n* @throws {TypeError} options argument must be an object\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex128Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.toLocaleString();\n* // returns '1 + 1i,2 + 2i'\n*/\nsetReadOnly( Complex128Array.prototype, 'toLocaleString', function toLocaleString( locales, options ) {\n\tvar opts;\n\tvar loc;\n\tvar out;\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( arguments.length === 0 ) {\n\t\tloc = [];\n\t} else if ( isString( locales ) || isStringArray( locales ) ) {\n\t\tloc = locales;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string or an array of strings. Value: `%s`.', locales ) );\n\t}\n\tif ( arguments.length < 2 ) {\n\t\topts = {};\n\t} else if ( isObject( options ) ) {\n\t\topts = options;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );\n\t}\n\tbuf = this._buffer;\n\tout = [];\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex128( buf, i ).toLocaleString( loc, opts ) );\n\t}\n\treturn out.join( ',' );\n});\n\n/**\n* Returns a new typed array containing the elements in reversed order.\n*\n* @name toReversed\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex128Array} reversed array\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.toReversed();\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 3.0\n*\n* var im = imag( z );\n* // returns 3.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = real( z );\n* // returns 2.0\n*\n* im = imag( z );\n* // returns 2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'toReversed', function toReversed() {\n\tvar outbuf;\n\tvar out;\n\tvar len;\n\tvar buf;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tlen = this._length;\n\tout = new this.constructor( len );\n\tbuf = this._buffer;\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < len; i++ ) {\n\t\tj = len - i - 1;\n\t\toutbuf[ (2*i) ] = buf[ (2*j) ];\n\t\toutbuf[ (2*i)+1 ] = buf[ (2*j)+1 ];\n\t}\n\treturn out;\n});\n\n/**\n* Returns a new typed array containing the elements in sorted order.\n*\n* @name toSorted\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} compareFcn - comparison function\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex128Array} sorted array\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* function compare( a, b ) {\n* var re1;\n* var re2;\n* var im1;\n* var im2;\n* re1 = real( a );\n* re2 = real( b );\n* if ( re1 < re2 ) {\n* return -1;\n* }\n* if ( re1 > re2 ) {\n* return 1;\n* }\n* im1 = imag( a );\n* im2 = imag( b );\n* if ( im1 < im2 ) {\n* return -1;\n* }\n* if ( im1 > im2 ) {\n* return 1;\n* }\n* return 0;\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 3.0, -3.0 ], 0 );\n* arr.set( [ 1.0, -1.0 ], 1 );\n* arr.set( [ 2.0, -2.0 ], 2 );\n*\n* var out = arr.sort( compare );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 1.0\n*\n* var im = imag( z );\n* // returns -1.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = real( z );\n* // returns 2.0\n*\n* im = imag( z );\n* // returns -2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = real( z );\n* // returns 3.0\n*\n* im = imag( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex128Array.prototype, 'toSorted', function toSorted( compareFcn ) {\n\tvar tmp;\n\tvar buf;\n\tvar len;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( compareFcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', compareFcn ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\ttmp = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\ttmp.push( getComplex128( buf, i ) );\n\t}\n\ttmp.sort( compareFcn );\n\treturn new Complex128Array( tmp );\n});\n\n/**\n* Serializes an array as a string.\n*\n* @name toString\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex128Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.toString();\n* // returns '1 + 1i,2 + 2i'\n*/\nsetReadOnly( Complex128Array.prototype, 'toString', function toString() {\n\tvar out;\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tout = [];\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex128( buf, i ).toString() );\n\t}\n\treturn out.join( ',' );\n});\n\n/**\n* Returns an iterator for iterating over each value in a typed array.\n*\n* @name values\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Iterator} iterator\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n*\n* var arr = new Complex128Array( 2 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n*\n* var iter = arr.values();\n*\n* var v = iter.next().value;\n* // returns \n*\n* var re = real( v );\n* // returns 1.0\n*\n* var im = imag( v );\n* // returns -1.0\n*\n* v = iter.next().value;\n* // returns \n*\n* re = real( v );\n* // returns 2.0\n*\n* im = imag( v );\n* // returns -2.0\n*\n* var bool = iter.next().done;\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'values', function values() {\n\tvar iter;\n\tvar self;\n\tvar len;\n\tvar FLG;\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tself = this;\n\tbuf = this._buffer;\n\tlen = this._length;\n\n\t// Initialize an iteration index:\n\ti = -1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': getComplex128( buf, i ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.values();\n\t}\n});\n\n/**\n* Returns a new typed array with the element at a provided index replaced with a provided value.\n*\n* @name with\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {integer} index - element index\n* @param {ComplexLike} value - new value\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {TypeError} second argument must be a complex number\n* @returns {Complex128Array} new typed array\n*\n* @example\n* import real from '@stdlib/complex-float64-real';\n* import imag from '@stdlib/complex-float64-imag';\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.with( 0, new Complex128( 4.0, 4.0 ) );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 4.0\n*\n* var im = imag( z );\n* // returns 4.0\n*/\nsetReadOnly( Complex128Array.prototype, 'with', function copyWith( index, value ) {\n\tvar buf;\n\tvar out;\n\tvar len;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isInteger( index ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', index ) );\n\t}\n\tlen = this._length;\n\tif ( index < 0 ) {\n\t\tindex += len;\n\t}\n\tif ( index < 0 || index >= len ) {\n\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%s`.', index ) );\n\t}\n\tif ( !isComplexLike( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a complex number. Value: `%s`.', value ) );\n\t}\n\tout = new this.constructor( this._buffer );\n\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tbuf[ 2*index ] = real( value );\n\tbuf[ (2*index)+1 ] = imag( value );\n\treturn out;\n});\n\n\n// EXPORTS //\n\nexport default Complex128Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport real from '@stdlib/complex-float64-real';\nimport imag from '@stdlib/complex-float64-imag';\n\n\n// MAIN //\n\n/**\n* Returns a strided array of real and imaginary components.\n*\n* @private\n* @param {Float64Array} buf - output array\n* @param {Array} arr - array containing complex numbers\n* @returns {(Float64Array|null)} output array or null\n*/\nfunction fromArray( buf, arr ) {\n\tvar len;\n\tvar v;\n\tvar i;\n\tvar j;\n\n\tlen = arr.length;\n\tj = 0;\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = arr[ i ];\n\t\tif ( !isComplexLike( v ) ) {\n\t\t\treturn null;\n\t\t}\n\t\tbuf[ j ] = real( v );\n\t\tbuf[ j+1 ] = imag( v );\n\t\tj += 2; // stride\n\t}\n\treturn buf;\n}\n\n\n// EXPORTS //\n\nexport default fromArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Boolean from '@stdlib/boolean-ctor';\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @returns {Array} output array\n*/\nfunction fromIterator( it ) {\n\tvar out;\n\tvar v;\n\n\tout = [];\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\tout.push( Boolean( v.value ) );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default fromIterator;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArrayLikeObject from '@stdlib/assert-is-array-like-object';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport format from '@stdlib/string-format';\nimport real from '@stdlib/complex-float64-real';\nimport imag from '@stdlib/complex-float64-imag';\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @param {Function} clbk - callback to invoke for each iterated value\n* @param {*} thisArg - invocation context\n* @returns {(Array|TypeError)} array or an error\n*/\nfunction fromIteratorMap( it, clbk, thisArg ) {\n\tvar out;\n\tvar v;\n\tvar z;\n\tvar i;\n\n\tout = [];\n\ti = -1;\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\ti += 1;\n\t\tz = clbk.call( thisArg, v.value, i );\n\t\tif ( isArrayLikeObject( z ) && z.length >= 2 ) {\n\t\t\tout.push( z[ 0 ], z[ 1 ] );\n\t\t} else if ( isComplexLike( z ) ) {\n\t\t\tout.push( real( z ), imag( z ) );\n\t\t} else {\n\t\t\treturn new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', z ) );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default fromIteratorMap;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable no-restricted-syntax, no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\nimport isCollection from '@stdlib/assert-is-collection';\nimport isArrayBuffer from '@stdlib/assert-is-arraybuffer';\nimport isObject from '@stdlib/assert-is-object';\nimport isFunction from '@stdlib/assert-is-function';\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport { primitives as isStringArray } from '@stdlib/assert-is-string-array';\nimport hasIteratorSymbolSupport from '@stdlib/assert-has-iterator-symbol-support';\nimport ITERATOR_SYMBOL from '@stdlib/symbol-iterator';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport setReadOnlyAccessor from '@stdlib/utils-define-nonenumerable-read-only-accessor';\nimport Uint8Array from '@stdlib/array-uint8';\nimport Boolean from '@stdlib/boolean-ctor';\nimport getter from '@stdlib/array-base-getter';\nimport floor from '@stdlib/math-base-special-floor';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport format from '@stdlib/string-format';\nimport fromIterator from './from_iterator.js';\nimport fromIteratorMap from './from_iterator_map.js';\nimport fromArray from './from_array.js';\n\n\n// VARIABLES //\n\nvar BYTES_PER_ELEMENT = Uint8Array.BYTES_PER_ELEMENT;\nvar HAS_ITERATOR_SYMBOL = hasIteratorSymbolSupport();\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating if a value is a `BooleanArray`.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a `BooleanArray`\n*/\nfunction isBooleanArray( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\tvalue.constructor.name === 'BooleanArray' &&\n\t\tvalue.BYTES_PER_ELEMENT === BYTES_PER_ELEMENT\n\t);\n}\n\n/**\n* Returns a boolean indicating if a value is a boolean typed array constructor.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a boolean typed array constructor\n*/\nfunction isBooleanArrayConstructor( value ) {\n\treturn ( value === BooleanArray );\n}\n\n\n// MAIN //\n\n/**\n* Boolean array constructor.\n*\n* @constructor\n* @param {(NonNegativeInteger|Collection|ArrayBuffer|Iterable)} [arg] - length, typed array, array-like object, buffer, or an iterable\n* @param {NonNegativeInteger} [byteOffset=0] - byte offset\n* @param {NonNegativeInteger} [length] - view length\n* @throws {TypeError} if provided only a single argument, must provide a valid argument\n* @throws {TypeError} byte offset must be a nonnegative integer\n* @throws {RangeError} must provide sufficient memory to accommodate byte offset and view length requirements\n* @returns {BooleanArray} boolean array\n*\n* @example\n* var arr = new BooleanArray();\n* // returns \n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var arr = new BooleanArray( 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var arr = new BooleanArray( [ true, false ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = new BooleanArray( buf );\n* // returns \n*\n* var len = arr.length;\n* // returns 16\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = new BooleanArray( buf, 8 );\n* // returns \n*\n* var len = arr.length;\n* // returns 8\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new BooleanArray( buf, 8, 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*/\nfunction BooleanArray() {\n\tvar byteOffset;\n\tvar nargs;\n\tvar buf;\n\tvar len;\n\tvar arg;\n\n\tnargs = arguments.length;\n\tif ( !(this instanceof BooleanArray) ) {\n\t\tif ( nargs === 0 ) {\n\t\t\treturn new BooleanArray();\n\t\t}\n\t\tif ( nargs === 1 ) {\n\t\t\treturn new BooleanArray( arguments[0] );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\treturn new BooleanArray( arguments[0], arguments[1] );\n\t\t}\n\t\treturn new BooleanArray( arguments[0], arguments[1], arguments[2] );\n\t}\n\t// Create the underlying data buffer...\n\tif ( nargs === 0 ) {\n\t\tbuf = new Uint8Array( 0 ); // backward-compatibility\n\t} else if ( nargs === 1 ) {\n\t\targ = arguments[ 0 ];\n\t\tif ( isNonNegativeInteger( arg ) ) {\n\t\t\tbuf = new Uint8Array( arg );\n\t\t} else if ( isCollection( arg ) ) {\n\t\t\tbuf = fromArray( new Uint8Array( arg.length ), arg );\n\t\t} else if ( isArrayBuffer( arg ) ) {\n\t\t\tbuf = new Uint8Array( arg );\n\t\t} else if ( isObject( arg ) ) {\n\t\t\tif ( HAS_ITERATOR_SYMBOL === false ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.', arg ) );\n\t\t\t}\n\t\t\tif ( !isFunction( arg[ ITERATOR_SYMBOL ] ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t\t}\n\t\t\tbuf = arg[ ITERATOR_SYMBOL ]();\n\t\t\tif ( !isFunction( buf.next ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t\t}\n\t\t\tbuf = new Uint8Array( fromIterator( buf ) );\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t}\n\t} else {\n\t\tbuf = arguments[ 0 ];\n\t\tif ( !isArrayBuffer( buf ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an ArrayBuffer. Value: `%s`.', buf ) );\n\t\t}\n\t\tbyteOffset = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( byteOffset ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.', byteOffset ) );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\tbuf = new Uint8Array( buf, byteOffset );\n\t\t} else {\n\t\t\tlen = arguments[ 2 ];\n\t\t\tif ( !isNonNegativeInteger( len ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Length must be a nonnegative integer. Value: `%s`.', len ) );\n\t\t\t}\n\t\t\tif ( (len*BYTES_PER_ELEMENT) > (buf.byteLength-byteOffset) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.', len*BYTES_PER_ELEMENT ) );\n\t\t\t}\n\t\t\tbuf = new Uint8Array( buf, byteOffset, len );\n\t\t}\n\t}\n\tsetReadOnly( this, '_buffer', buf );\n\tsetReadOnly( this, '_length', buf.length );\n\n\treturn this;\n}\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof BooleanArray\n* @readonly\n* @type {PositiveInteger}\n* @default 1\n*\n* @example\n* var nbytes = BooleanArray.BYTES_PER_ELEMENT;\n* // returns 1\n*/\nsetReadOnly( BooleanArray, 'BYTES_PER_ELEMENT', BYTES_PER_ELEMENT );\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof BooleanArray\n* @readonly\n* @type {string}\n* @default 'BooleanArray'\n*\n* @example\n* var str = BooleanArray.name;\n* // returns 'BooleanArray'\n*/\nsetReadOnly( BooleanArray, 'name', 'BooleanArray' );\n\n/**\n* Creates a new boolean array from an array-like object or an iterable.\n*\n* @name from\n* @memberof BooleanArray\n* @type {Function}\n* @param {(Collection|Iterable)} src - array-like object or iterable\n* @param {Function} [clbk] - callback to invoke for each source element\n* @param {*} [thisArg] - context\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be an array-like object or an iterable\n* @throws {TypeError} second argument must be a function\n* @returns {BooleanArray} boolean array\n*\n* @example\n* var arr = BooleanArray.from( [ true, false ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* function clbk( v ) {\n* return !v;\n* }\n*\n* var arr = BooleanArray.from( [ true, false ], clbk );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*/\nsetReadOnly( BooleanArray, 'from', function from( src ) {\n\tvar thisArg;\n\tvar nargs;\n\tvar clbk;\n\tvar out;\n\tvar buf;\n\tvar tmp;\n\tvar get;\n\tvar len;\n\tvar i;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isBooleanArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tnargs = arguments.length;\n\tif ( nargs > 1 ) {\n\t\tclbk = arguments[ 1 ];\n\t\tif ( !isFunction( clbk ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a function. Value: `%s`.', clbk ) );\n\t\t}\n\t\tif ( nargs > 2 ) {\n\t\t\tthisArg = arguments[ 2 ];\n\t\t}\n\t}\n\tif ( isCollection( src ) ) {\n\t\tif ( clbk ) {\n\t\t\tlen = src.length;\n\t\t\tif ( src.get && src.set ) {\n\t\t\t\tget = accessorGetter( 'default' );\n\t\t\t} else {\n\t\t\t\tget = getter( 'default' );\n\t\t\t}\n\t\t\tout = new this( len );\n\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tbuf[ i ] = Boolean( clbk.call( thisArg, get( src, i ), i ) );\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\treturn new this( src );\n\t}\n\tif ( isObject( src ) && HAS_ITERATOR_SYMBOL && isFunction( src[ ITERATOR_SYMBOL ] ) ) { // eslint-disable-line max-len\n\t\tbuf = src[ ITERATOR_SYMBOL ]();\n\t\tif ( !isFunction( buf.next ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n\t\t}\n\t\tif ( clbk ) {\n\t\t\ttmp = fromIteratorMap( buf, clbk, thisArg );\n\t\t} else {\n\t\t\ttmp = fromIterator( buf );\n\t\t}\n\t\tlen = tmp.length;\n\t\tout = new this( len );\n\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tbuf[ i ] = tmp[ i ];\n\t\t}\n\t\treturn out;\n\t}\n\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n});\n\n/**\n* Creates a new boolean array from a variable number of arguments.\n*\n* @name of\n* @memberof BooleanArray\n* @type {Function}\n* @param {...*} element - array elements\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a boolean array\n* @returns {BooleanArray} boolean array\n*\n* @example\n* var arr = BooleanArray.of( true, true, true, true );\n* // returns \n*\n* var len = arr.length;\n* // returns 4\n*/\nsetReadOnly( BooleanArray, 'of', function of() {\n\tvar args;\n\tvar i;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isBooleanArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\targs = [];\n\tfor ( i = 0; i < arguments.length; i++ ) {\n\t\targs.push( arguments[ i ] );\n\t}\n\treturn new this( args );\n});\n\n/**\n* Returns an array element located at integer position (index) `i`, with support for both nonnegative and negative integer indices.\n*\n* @name at\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {integer} idx - element index\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} must provide an integer\n* @returns {(boolean|void)} array element\n*\n* @example\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var v = arr.at( 0 );\n* // returns true\n*\n* v = arr.at( -1 );\n* // returns true\n*\n* v = arr.at( 100 );\n* // returns undefined\n*/\nsetReadOnly( BooleanArray.prototype, 'at', function at( idx ) {\n\tvar buf;\n\tvar len;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an integer. Value: `%s`.', idx ) );\n\t}\n\tlen = this._length;\n\tbuf = this._buffer;\n\tif ( idx < 0 ) {\n\t\tidx += len;\n\t}\n\tif ( idx < 0 || idx >= len ) {\n\t\treturn;\n\t}\n\treturn Boolean( buf[ idx ] );\n});\n\n/**\n* Pointer to the underlying data buffer.\n*\n* @name buffer\n* @memberof BooleanArray.prototype\n* @readonly\n* @type {ArrayBuffer}\n*\n* @example\n* var arr = new BooleanArray( 10 );\n*\n* var buf = arr.buffer;\n* // returns \n*/\nsetReadOnlyAccessor( BooleanArray.prototype, 'buffer', function get() {\n\treturn this._buffer.buffer;\n});\n\n/**\n* Size (in bytes) of the array.\n*\n* @name byteLength\n* @memberof BooleanArray.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new BooleanArray( 10 );\n*\n* var byteLength = arr.byteLength;\n* // returns 10\n*/\nsetReadOnlyAccessor( BooleanArray.prototype, 'byteLength', function get() {\n\treturn this._buffer.byteLength;\n});\n\n/**\n* Offset (in bytes) of the array from the start of its underlying `ArrayBuffer`.\n*\n* @name byteOffset\n* @memberof BooleanArray.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new BooleanArray( 10 );\n*\n* var byteOffset = arr.byteOffset;\n* // returns 0\n*/\nsetReadOnlyAccessor( BooleanArray.prototype, 'byteOffset', function get() {\n\treturn this._buffer.byteOffset;\n});\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof BooleanArray.prototype\n* @readonly\n* @type {PositiveInteger}\n* @default 1\n*\n* @example\n* var arr = new BooleanArray( 10 );\n*\n* var nbytes = arr.BYTES_PER_ELEMENT;\n* // returns 1\n*/\nsetReadOnly( BooleanArray.prototype, 'BYTES_PER_ELEMENT', BooleanArray.BYTES_PER_ELEMENT );\n\n/**\n* Copies a sequence of elements within the array to the position starting at `target`.\n*\n* @name copyWithin\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {integer} target - index at which to start copying elements\n* @param {integer} start - source index at which to copy elements from\n* @param {integer} [end] - source index at which to stop copying elements from\n* @throws {TypeError} `this` must be a boolean array\n* @returns {BooleanArray} modified array\n*\n* @example\n* var arr = new BooleanArray( 4 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( false, 2 );\n* arr.set( true, 3 );\n*\n* // Copy the first two elements to the last two elements:\n* arr.copyWithin( 2, 0, 2 );\n*\n* var v = arr.get( 2 );\n* // returns true\n*\n* v = arr.get( 3 );\n* // returns false\n*/\nsetReadOnly( BooleanArray.prototype, 'copyWithin', function copyWithin( target, start ) {\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\t// FIXME: prefer a functional `copyWithin` implementation which addresses lack of universal browser support (e.g., IE11 and Safari) or ensure that typed arrays are polyfilled\n\tif ( arguments.length === 2 ) {\n\t\tthis._buffer.copyWithin( target, start );\n\t} else {\n\t\tthis._buffer.copyWithin( target, start, arguments[2] );\n\t}\n\treturn this;\n});\n\n/**\n* Returns an iterator for iterating over array key-value pairs.\n*\n* @name entries\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a boolean array\n* @returns {Iterator} iterator\n*\n* @example\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var it = arr.entries();\n*\n* var v = it.next().value;\n* // returns [ 0, true ]\n*\n* v = it.next().value;\n* // returns [ 1, false ]\n*\n* v = it.next().value;\n* // returns [ 2, true ]\n*\n* var bool = it.next().done;\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'entries', function entries() {\n\tvar self;\n\tvar iter;\n\tvar len;\n\tvar buf;\n\tvar FLG;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tself = this;\n\tbuf = this._buffer;\n\tlen = this._length;\n\n\t// Initialize an iteration index:\n\ti = -1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': [ i, Boolean( buf[ i ] ) ],\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.entries();\n\t}\n});\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @name every\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} predicate - predicate function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* function predicate( v ) {\n* return v === true;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( true, 1 );\n* arr.set( true, 2 );\n*\n* var bool = arr.every( predicate );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'every', function every( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( !predicate.call( thisArg, Boolean( buf[ i ] ), i, this ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n});\n\n/**\n* Returns a modified typed array filled with a fill value.\n*\n* @name fill\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {boolean} value - fill value\n* @param {integer} [start=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a boolean\n* @throws {TypeError} second argument must be an integer\n* @throws {TypeError} third argument must be an integer\n* @returns {BooleanArray} modified array\n*\n* @example\n* var arr = new BooleanArray( 3 );\n*\n* arr.fill( true, 1 );\n*\n* var v = arr.get( 0 );\n* // returns false\n*\n* v = arr.get( 1 );\n* // returns true\n*\n* v = arr.get( 2 );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'fill', function fill( value, start, end ) {\n\tvar buf;\n\tvar len;\n\tvar val;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isBoolean( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a boolean. Value: `%s`.', value ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( start ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', start ) );\n\t\t}\n\t\tif ( start < 0 ) {\n\t\t\tstart += len;\n\t\t\tif ( start < 0 ) {\n\t\t\t\tstart = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length > 2 ) {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t} else {\n\t\t\tend = len;\n\t\t}\n\t} else {\n\t\tstart = 0;\n\t\tend = len;\n\t}\n\tif ( value ) {\n\t\tval = 1;\n\t} else {\n\t\tval = 0;\n\t}\n\tfor ( i = start; i < end; i++ ) {\n\t\tbuf[ i ] = val;\n\t}\n\treturn this;\n});\n\n/**\n* Returns a new array containing the elements of an array which pass a test implemented by a predicate function.\n*\n* @name filter\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {BooleanArray} boolean array\n*\n* @example\n* function predicate( v ) {\n* return ( v === true );\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var out = arr.filter( predicate );\n* // returns \n*\n* var len = out.length;\n* // returns 2\n*\n* var v = out.get( 0 );\n* // returns true\n*\n* v = out.get( 1 );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'filter', function filter( predicate, thisArg ) {\n\tvar buf;\n\tvar out;\n\tvar i;\n\tvar v;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tout = [];\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tv = Boolean( buf[ i ] );\n\t\tif ( predicate.call( thisArg, v, i, this ) ) {\n\t\t\tout.push( v );\n\t\t}\n\t}\n\treturn new this.constructor( out );\n});\n\n/**\n* Returns the first element in an array for which a predicate function returns a truthy value.\n*\n* @name find\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} predicate - predicate function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {(boolean|void)} array element or undefined\n*\n* @example\n* function predicate( v ) {\n* return v === true;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var v = arr.find( predicate );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'find', function find( predicate, thisArg ) {\n\tvar buf;\n\tvar v;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tv = Boolean( buf[ i ] );\n\t\tif ( predicate.call( thisArg, v, i, this ) ) {\n\t\t\treturn v;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the first element in an array for which a predicate function returns a truthy value.\n*\n* @name findIndex\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} predicate - predicate function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* function predicate( v ) {\n* return v === true;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var v = arr.findIndex( predicate );\n* // returns 0\n*/\nsetReadOnly( BooleanArray.prototype, 'findIndex', function findIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar v;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tv = Boolean( buf[ i ] );\n\t\tif ( predicate.call( thisArg, v, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLast\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} predicate - predicate function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {(boolean|void)} array element or undefined\n*\n* @example\n* function predicate( v ) {\n* return v === true;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var v = arr.findLast( predicate );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'findLast', function findLast( predicate, thisArg ) {\n\tvar buf;\n\tvar v;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tv = Boolean( buf[ i ] );\n\t\tif ( predicate.call( thisArg, v, i, this ) ) {\n\t\t\treturn v;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLastIndex\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} predicate - predicate function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* function predicate( v ) {\n* return v === true;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var v = arr.findLastIndex( predicate );\n* // returns 2\n*/\nsetReadOnly( BooleanArray.prototype, 'findLastIndex', function findLastIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar v;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tv = Boolean( buf[ i ] );\n\t\tif ( predicate.call( thisArg, v, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Invokes a function once for each array element.\n*\n* @name forEach\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} fcn - function to invoke\n* @param {*} [thisArg] - function invocation context\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n*\n* @example\n* function log( v, i ) {\n* console.log( '%s: %s', i, v.toString() );\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* arr.forEach( log );\n*/\nsetReadOnly( BooleanArray.prototype, 'forEach', function forEach( fcn, thisArg ) {\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tfcn.call( thisArg, Boolean( buf[ i ] ), i, this );\n\t}\n});\n\n/**\n* Returns an array element.\n*\n* @name get\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {NonNegativeInteger} idx - element index\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} must provide a nonnegative integer\n* @returns {(boolean|void)} array element\n*\n* @example\n* var arr = new BooleanArray( 10 );\n*\n* var v = arr.get( 0 );\n* // returns false\n*\n* arr.set( [ true, false ], 0 );\n*\n* v = arr.get( 0 );\n* // returns true\n*\n* v = arr.get( 100 );\n* // returns undefined\n*/\nsetReadOnly( BooleanArray.prototype, 'get', function get( idx ) {\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isNonNegativeInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a nonnegative integer. Value: `%s`.', idx ) );\n\t}\n\tif ( idx >= this._length ) {\n\t\treturn;\n\t}\n\treturn Boolean( this._buffer[ idx ] );\n});\n\n/**\n* Returns a boolean indicating whether an array includes a provided value.\n*\n* @name includes\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {boolean} searchElement - search element\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a boolean value\n* @throws {TypeError} second argument must be an integer\n* @returns {boolean} boolean indicating whether an array includes a value\n*\n* @example\n* var arr = new BooleanArray( 5 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n* arr.set( true, 3 );\n* arr.set( true, 4 );\n*\n* var bool = arr.includes( true );\n* // returns true\n*\n* bool = arr.includes( false, 2 );\n* // returns false\n*/\nsetReadOnly( BooleanArray.prototype, 'includes', function includes( searchElement, fromIndex ) {\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isBoolean( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a boolean. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tif ( searchElement === Boolean( buf[ i ] ) ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Returns the first index at which a given element can be found.\n*\n* @name indexOf\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {boolean} searchElement - element to find\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a boolean value\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* var arr = new BooleanArray( 5 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n* arr.set( true, 3 );\n* arr.set( true, 4 );\n*\n* var idx = arr.indexOf( true );\n* // returns 0\n*\n* idx = arr.indexOf( false, 2 );\n* // returns -1\n*\n* idx = arr.indexOf( false, -3 );\n* // returns -1\n*/\nsetReadOnly( BooleanArray.prototype, 'indexOf', function indexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isBoolean( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a boolean. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tif ( searchElement === Boolean( buf[ i ] ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns a new string by concatenating all array elements.\n*\n* @name join\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {string} [separator=','] - element separator\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a string\n* @returns {string} string representation\n*\n* @example\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var str = arr.join();\n* // returns 'true,false,true'\n*\n* str = arr.join( '|' );\n* // returns 'true|false|true'\n*/\nsetReadOnly( BooleanArray.prototype, 'join', function join( separator ) {\n\tvar buf;\n\tvar out;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( arguments.length > 0 ) {\n\t\tif ( !isString( separator ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string. Value: `%s`.', separator ) );\n\t\t}\n\t} else {\n\t\tseparator = ',';\n\t}\n\tbuf = this._buffer;\n\tout = [];\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( buf[i] ) {\n\t\t\tout.push( 'true' );\n\t\t} else {\n\t\t\tout.push( 'false' );\n\t\t}\n\t}\n\treturn out.join( separator );\n});\n\n/**\n* Returns an iterator for iterating over each index key in a typed array.\n*\n* @name keys\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a boolean array\n* @returns {Iterator} iterator\n*\n* @example\n* var arr = new BooleanArray( 2 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n*\n* var iter = arr.keys();\n*\n* var v = iter.next().value;\n* // returns 0\n*\n* v = iter.next().value;\n* // returns 1\n*\n* var bool = iter.next().done;\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'keys', function keys() {\n\tvar self;\n\tvar iter;\n\tvar len;\n\tvar FLG;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tself = this;\n\tlen = this._length;\n\n\t// Initialize an iteration index:\n\ti = -1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': i,\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.keys();\n\t}\n});\n\n/**\n* Returns the last index at which a given element can be found.\n*\n* @name lastIndexOf\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {boolean} searchElement - element to find\n* @param {integer} [fromIndex] - starting index (inclusive)\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a boolean value\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* var arr = new BooleanArray( 5 );\n*\n* arr.set( true, 0 );\n* arr.set( true, 1 );\n* arr.set( true, 2 );\n* arr.set( false, 3 );\n* arr.set( true, 4 );\n*\n* var idx = arr.lastIndexOf( true );\n* // returns 4\n*\n* idx = arr.lastIndexOf( false, 2 );\n* // returns -1\n*\n* idx = arr.lastIndexOf( false, -3 );\n* // returns -1\n*/\nsetReadOnly( BooleanArray.prototype, 'lastIndexOf', function lastIndexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isBoolean( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a boolean. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex >= this._length ) {\n\t\t\tfromIndex = this._length - 1;\n\t\t} else if ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t}\n\t} else {\n\t\tfromIndex = this._length - 1;\n\t}\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i >= 0; i-- ) {\n\t\tif ( searchElement === Boolean( buf[ i ] ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Number of array elements.\n*\n* @name length\n* @memberof BooleanArray.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new BooleanArray( 10 );\n*\n* var len = arr.length;\n* // returns 10\n*/\nsetReadOnlyAccessor( BooleanArray.prototype, 'length', function get() {\n\treturn this._length;\n});\n\n/**\n* Returns a new array with each element being the result of a provided callback function.\n*\n* @name map\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} fcn - callback function\n* @param {*} [thisArg] - callback function execution context\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {BooleanArray} new boolean array\n*\n* @example\n* function invert( v ) {\n* return !v;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var out = arr.map( invert );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns false\n*\n* z = out.get( 1 );\n* // returns true\n*\n* z = out.get( 2 );\n* // returns false\n*/\nsetReadOnly( BooleanArray.prototype, 'map', function map( fcn, thisArg ) {\n\tvar outbuf;\n\tvar out;\n\tvar buf;\n\tvar i;\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( 'invalid argument. First argument must be a function. Value: `%s`.', fcn );\n\t}\n\tbuf = this._buffer;\n\tout = new this.constructor( this._length );\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\toutbuf[ i ] = Boolean( fcn.call( thisArg, Boolean( buf[ i ] ), i, this ) );\n\t}\n\treturn out;\n});\n\n/**\n* Applies a provided callback function to each element of the array, in order, passing in the return value from the calculation on the preceding element and returning the accumulated result upon completion.\n*\n* @name reduce\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} reducer - callback function\n* @param {*} [initialValue] - initial value\n* @throws {TypeError} `this` must be a boolean array\n* @throws {Error} if not provided an initial value, the array must have at least one element\n* @returns {*} accumulated result\n*\n* @example\n* function reducer( acc, v ) {\n* if ( v ) {\n* return acc + 1;\n* }\n* return acc;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var out = arr.reduce( reducer, 0 );\n* // returns 2\n*/\nsetReadOnly( BooleanArray.prototype, 'reduce', function reduce( reducer, initialValue ) {\n\tvar buf;\n\tvar len;\n\tvar acc;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( reducer ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', reducer ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tacc = initialValue;\n\t\ti = 0;\n\t} else {\n\t\tif ( len === 0 ) {\n\t\t\tthrow new Error( 'invalid operation. If not provided an initial value, an array must contain at least one element.' );\n\t\t}\n\t\tacc = Boolean( buf[ 0 ] );\n\t\ti = 1;\n\t}\n\tfor ( ; i < len; i++ ) {\n\t\tacc = reducer( acc, Boolean( buf[ i ] ), i, this );\n\t}\n\treturn acc;\n});\n\n/**\n* Applies a provided callback function to each element of the array, in reverse order, passing in the return value from the calculation on the preceding element and returning the accumulated result upon completion.\n*\n* @name reduceRight\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} reducer - callback function\n* @param {*} [initialValue] - initial value\n* @throws {TypeError} `this` must be a boolean array\n* @throws {Error} if not provided an initial value, the array must have at least one element\n* @returns {*} accumulated result\n*\n* @example\n* function reducer( acc, v ) {\n* if ( v ) {\n* return acc + 1;\n* }\n* return acc;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var out = arr.reduceRight( reducer, 0 );\n* // returns 2\n*/\nsetReadOnly( BooleanArray.prototype, 'reduceRight', function reduceRight( reducer, initialValue ) {\n\tvar buf;\n\tvar len;\n\tvar acc;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( reducer ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', reducer ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tacc = initialValue;\n\t\ti = len - 1;\n\t} else {\n\t\tif ( len === 0 ) {\n\t\t\tthrow new Error( 'invalid operation. If not provided an initial value, an array must contain at least one element.' );\n\t\t}\n\t\tacc = Boolean( buf[ len-1 ] );\n\t\ti = len - 2;\n\t}\n\tfor ( ; i >= 0; i-- ) {\n\t\tacc = reducer( acc, Boolean( buf[ i ] ), i, this );\n\t}\n\treturn acc;\n});\n\n/**\n* Reverses an array in-place.\n*\n* @name reverse\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a boolean array\n* @returns {BooleanArray} reversed array\n*\n* @example\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( false, 2 );\n*\n* var out = arr.reverse();\n* // returns \n*\n* var v = out.get( 0 );\n* // returns false\n*\n* v = out.get( 1 );\n* // returns false\n*\n* v = out.get( 2 );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'reverse', function reverse() {\n\tvar buf;\n\tvar tmp;\n\tvar len;\n\tvar N;\n\tvar i;\n\tvar j;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tN = floor( len / 2 );\n\tfor ( i = 0; i < N; i++ ) {\n\t\tj = len - i - 1;\n\t\ttmp = buf[ i ];\n\t\tbuf[ i ] = buf[ j ];\n\t\tbuf[ j ] = tmp;\n\t}\n\treturn this;\n});\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* - When provided a typed array, we must check whether the source array shares the same buffer as the target array and whether the underlying memory overlaps. In particular, we are concerned with the following scenario:\n*\n* ```text\n* buf: ---------------------\n* src: ---------------------\n* ```\n*\n* In the above, as we copy values from `src`, we will overwrite values in the `src` view, resulting in duplicated values copied into the end of `buf`, which is not intended. Hence, to avoid overwriting source values, we must **copy** source values to a temporary array.\n*\n* In the other overlapping scenario,\n*\n* ```text\n* buf: ---------------------\n* src: ---------------------\n* ```\n*\n* by the time we begin copying into the overlapping region, we are copying from the end of `src`, a non-overlapping region, which means we don't run the risk of copying copied values, rather than the original `src` values, as intended.\n*\n* @name set\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {(Collection|BooleanArray|*)} value - value(s)\n* @param {NonNegativeInteger} [i=0] - element index at which to start writing values\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} index argument must be a nonnegative integer\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {RangeError} target array lacks sufficient storage to accommodate source values\n* @returns {void}\n*\n* @example\n* var arr = new BooleanArray( 10 );\n*\n* var v = arr.get( 0 );\n* // returns false\n*\n* arr.set( [ true, false ], 0 );\n*\n* v = arr.get( 0 );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'set', function set( value ) {\n\tvar sbuf;\n\tvar idx;\n\tvar buf;\n\tvar tmp;\n\tvar N;\n\tvar i;\n\tvar j;\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tbuf = this._buffer;\n\tif ( arguments.length > 1 ) {\n\t\tidx = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( idx ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Index argument must be a nonnegative integer. Value: `%s`.', idx ) );\n\t\t}\n\t} else {\n\t\tidx = 0;\n\t}\n\tif ( isCollection( value ) ) {\n\t\tN = value.length;\n\t\tif ( idx+N > this._length ) {\n\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t}\n\t\tif ( isBooleanArray( value ) ) {\n\t\t\tsbuf = value._buffer; // eslint-disable-line no-underscore-dangle\n\t\t} else {\n\t\t\tsbuf = value;\n\t\t}\n\t\t// Check for overlapping memory...\n\t\tj = buf.byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\tif (\n\t\t\tsbuf.buffer === buf.buffer &&\n\t\t\t(\n\t\t\t\tsbuf.byteOffset < j &&\n\t\t\t\tsbuf.byteOffset+sbuf.byteLength > j\n\t\t\t)\n\t\t) {\n\t\t\t// We need to copy source values...\n\t\t\ttmp = new Uint8Array( sbuf.length );\n\t\t\tfor ( i = 0; i < sbuf.length; i++ ) {\n\t\t\t\ttmp[ i ] = sbuf[ i ]; // TODO: handle accessor arrays\n\t\t\t}\n\t\t\tsbuf = tmp;\n\t\t}\n\t\tfor ( i = 0; i < N; idx++, i++ ) {\n\t\t\tbuf[ idx ] = ( sbuf[ i ] ) ? 1 : 0;\n\t\t}\n\t\treturn;\n\t}\n\tif ( idx >= this._length ) {\n\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%u`.', idx ) );\n\t}\n\tbuf[ idx ] = ( value ) ? 1 : 0;\n});\n\n/**\n* Copies a portion of a typed array to a new typed array.\n*\n* @name slice\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {integer} [begin] - start index (inclusive)\n* @param {integer} [end] - end index (exclusive)\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be integer\n* @throws {TypeError} second argument must be integer\n* @returns {BooleanArray} boolean array\n*\n* @example\n* var arr = new BooleanArray( 5 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n* arr.set( false, 3 );\n* arr.set( true, 4 );\n*\n* var out = arr.slice();\n* // returns \n*\n* var len = out.length;\n* // returns 5\n*\n* var bool = out.get( 0 );\n* // returns true\n*\n* bool = out.get( len-1 );\n* // returns true\n*\n* out = arr.slice( 1, -2 );\n* // returns \n*\n* len = out.length;\n* // returns 2\n*\n* bool = out.get( 0 );\n* // returns false\n*\n* bool = out.get( len-1 );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'slice', function slice( begin, end ) {\n\tvar outlen;\n\tvar outbuf;\n\tvar out;\n\tvar buf;\n\tvar len;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length === 0 ) {\n\t\tbegin = 0;\n\t\tend = len;\n\t} else {\n\t\tif ( !isInteger( begin ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', begin ) );\n\t\t}\n\t\tif ( begin < 0 ) {\n\t\t\tbegin += len;\n\t\t\tif ( begin < 0 ) {\n\t\t\t\tbegin = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length === 1 ) {\n\t\t\tend = len;\n\t\t} else {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t} else if ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t}\n\t}\n\tif ( begin < end ) {\n\t\toutlen = end - begin;\n\t} else {\n\t\toutlen = 0;\n\t}\n\tout = new this.constructor( outlen );\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < outlen; i++ ) {\n\t\toutbuf[ i ] = buf[ i+begin ];\n\t}\n\treturn out;\n});\n\n/**\n* Tests whether at least one element in an array passes a test implemented by a predicate function.\n*\n* @name some\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} predicate - predicate function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether at least one element passes a test\n*\n* @example\n* function predicate( v ) {\n* return v === true;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( false, 0 );\n* arr.set( true, 1 );\n* arr.set( false, 2 );\n*\n* var bool = arr.some( predicate );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'some', function some( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( predicate.call( thisArg, Boolean( buf[ i ] ), i, this ) ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Sorts an array in-place.\n*\n* @name sort\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} [compareFcn] - comparison function\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {BooleanArray} sorted array\n*\n* @example\n* function compare( a, b ) {\n* if ( a === false ) {\n* if ( b === false ) {\n* return 0;\n* }\n* return 1;\n* }\n* if ( b === true ) {\n* return 0;\n* }\n* return -1;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* arr.sort( compare );\n*\n* var v = arr.get( 0 );\n* // returns true\n*\n* v = arr.get( 1 );\n* // returns true\n*\n* v = arr.get( 2 );\n* // returns false\n*/\nsetReadOnly( BooleanArray.prototype, 'sort', function sort( compareFcn ) {\n\tvar buf;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tbuf = this._buffer;\n\tif ( arguments.length === 0 ) {\n\t\tbuf.sort();\n\t\treturn this;\n\t}\n\tif ( !isFunction( compareFcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', compareFcn ) );\n\t}\n\tbuf.sort( compare );\n\treturn this;\n\n\t/**\n\t* Comparison function for sorting.\n\t*\n\t* @private\n\t* @param {boolean} a - first boolean value for comparison\n\t* @param {boolean} b - second boolean value for comparison\n\t* @returns {number} comparison result\n\t*/\n\tfunction compare( a, b ) {\n\t\treturn compareFcn( Boolean( a ), Boolean( b ) );\n\t}\n});\n\n/**\n* Creates a new typed array view over the same underlying `ArrayBuffer` and with the same underlying data type as the host array.\n*\n* @name subarray\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {integer} [begin] - start index (inclusive)\n* @param {integer} [end] - end index (exclusive)\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be an integer\n* @throws {TypeError} second argument must be an integer\n* @returns {BooleanArray} subarray\n*\n* @example\n* var arr = new BooleanArray( 5 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n* arr.set( false, 3 );\n* arr.set( true, 4 );\n*\n* var subarr = arr.subarray();\n* // returns \n*\n* var len = subarr.length;\n* // returns 5\n*\n* var bool = subarr.get( 0 );\n* // returns true\n*\n* bool = subarr.get( len-1 );\n* // returns true\n*\n* subarr = arr.subarray( 1, -2 );\n* // returns \n*\n* len = subarr.length;\n* // returns 2\n*\n* bool = subarr.get( 0 );\n* // returns false\n*\n* bool = subarr.get( len-1 );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'subarray', function subarray( begin, end ) {\n\tvar offset;\n\tvar buf;\n\tvar len;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length === 0 ) {\n\t\tbegin = 0;\n\t\tend = len;\n\t} else {\n\t\tif ( !isInteger( begin ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', begin ) );\n\t\t}\n\t\tif ( begin < 0 ) {\n\t\t\tbegin += len;\n\t\t\tif ( begin < 0 ) {\n\t\t\t\tbegin = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length === 1 ) {\n\t\t\tend = len;\n\t\t} else {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t} else if ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t}\n\t}\n\tif ( begin >= len ) {\n\t\tlen = 0;\n\t\toffset = buf.byteLength;\n\t} else if ( begin >= end ) {\n\t\tlen = 0;\n\t\toffset = buf.byteOffset + ( begin*BYTES_PER_ELEMENT );\n\t} else {\n\t\tlen = end - begin;\n\t\toffset = buf.byteOffset + ( begin*BYTES_PER_ELEMENT );\n\t}\n\treturn new this.constructor( buf.buffer, offset, ( len < 0 ) ? 0 : len );\n});\n\n/**\n* Serializes an array as a locale-specific string.\n*\n* @name toLocaleString\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {(string|Array)} [locales] - locale identifier(s)\n* @param {Object} [options] - configuration options\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a string or an array of strings\n* @throws {TypeError} options argument must be an object\n* @returns {string} string representation\n*\n* @example\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var str = arr.toLocaleString();\n* // returns 'true,false,true'\n*/\nsetReadOnly( BooleanArray.prototype, 'toLocaleString', function toLocaleString( locales, options ) {\n\tvar opts;\n\tvar loc;\n\tvar out;\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( arguments.length === 0 ) {\n\t\tloc = [];\n\t} else if ( isString( locales ) || isStringArray( locales ) ) {\n\t\tloc = locales;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string or an array of strings. Value: `%s`.', locales ) );\n\t}\n\tif ( arguments.length < 2 ) {\n\t\topts = {};\n\t} else if ( isObject( options ) ) {\n\t\topts = options;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );\n\t}\n\tbuf = this._buffer;\n\tout = [];\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( Boolean( buf[ i ] ).toLocaleString( loc, opts ) );\n\t}\n\treturn out.join( ',' );\n});\n\n/**\n* Returns a new typed array containing the elements in reversed order.\n*\n* @name toReversed\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a boolean array\n* @returns {BooleanArray} reversed array\n*\n* @example\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( false, 2 );\n*\n* var out = arr.toReversed();\n* // returns \n*\n* var v = out.get( 0 );\n* // returns false\n*\n* v = out.get( 1 );\n* // returns false\n*\n* v = out.get( 2 );\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'toReversed', function toReversed() {\n\tvar outbuf;\n\tvar out;\n\tvar len;\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tlen = this._length;\n\tout = new this.constructor( len );\n\tbuf = this._buffer;\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < len; i++ ) {\n\t\toutbuf[ i ] = buf[ len - i - 1 ];\n\t}\n\treturn out;\n});\n\n/**\n* Returns a new typed array containing the elements in sorted order.\n*\n* @name toSorted\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {Function} [compareFcn] - comparison function\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be a function\n* @returns {BooleanArray} sorted array\n*\n* @example\n* function compare( a, b ) {\n* if ( a === false ) {\n* if ( b === false ) {\n* return 0;\n* }\n* return 1;\n* }\n* if ( b === true ) {\n* return 0;\n* }\n* return -1;\n* }\n*\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var out = arr.sort( compare );\n* // returns \n*\n* var v = out.get( 0 );\n* // returns true\n*\n* v = out.get( 1 );\n* // returns true\n*\n* v = out.get( 2 );\n* // returns false\n*/\nsetReadOnly( BooleanArray.prototype, 'toSorted', function toSorted( compareFcn ) {\n\tvar outbuf;\n\tvar out;\n\tvar len;\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tlen = this._length;\n\tout = new this.constructor( len );\n\tbuf = this._buffer;\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < len; i++ ) {\n\t\toutbuf[ i ] = buf[ i ];\n\t}\n\tif ( arguments.length === 0 ) {\n\t\toutbuf.sort();\n\t\treturn out;\n\t}\n\tif ( !isFunction( compareFcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', compareFcn ) );\n\t}\n\toutbuf.sort( compare );\n\treturn out;\n\n\t/**\n\t* Comparison function for sorting.\n\t*\n\t* @private\n\t* @param {boolean} a - first boolean value for comparison\n\t* @param {boolean} b - second boolean value for comparison\n\t* @returns {number} comparison result\n\t*/\n\tfunction compare( a, b ) {\n\t\treturn compareFcn( Boolean( a ), Boolean( b ) );\n\t}\n});\n\n/**\n* Serializes an array as a string.\n*\n* @name toString\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a boolean array\n* @returns {string} string representation\n*\n* @example\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var str = arr.toString();\n* // returns 'true,false,true'\n*/\nsetReadOnly( BooleanArray.prototype, 'toString', function toString() {\n\tvar out;\n\tvar buf;\n\tvar i;\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tout = [];\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( buf[i] ) {\n\t\t\tout.push( 'true' );\n\t\t} else {\n\t\t\tout.push( 'false' );\n\t\t}\n\t}\n\treturn out.join( ',' );\n});\n\n/**\n* Returns an iterator for iterating over each value in a typed array.\n*\n* @name values\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a boolean array\n* @returns {Iterator} iterator\n*\n* @example\n* var arr = new BooleanArray( 2 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n*\n* var iter = arr.values();\n*\n* var v = iter.next().value;\n* // returns true\n*\n* v = iter.next().value;\n* // returns false\n*\n* var bool = iter.next().done;\n* // returns true\n*/\nsetReadOnly( BooleanArray.prototype, 'values', function values() {\n\tvar iter;\n\tvar self;\n\tvar len;\n\tvar FLG;\n\tvar buf;\n\tvar i;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tself = this;\n\tbuf = this._buffer;\n\tlen = this._length;\n\n\t// Initialize an iteration index:\n\ti = -1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': Boolean( buf[ i ] ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.values();\n\t}\n});\n\n/**\n* Returns a new typed array with the element at a provided index replaced with a provided value.\n*\n* @name with\n* @memberof BooleanArray.prototype\n* @type {Function}\n* @param {integer} index - element index\n* @param {boolean} value - new value\n* @throws {TypeError} `this` must be a boolean array\n* @throws {TypeError} first argument must be an integer\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {TypeError} second argument must be a boolean\n* @returns {BooleanArray} new typed array\n*\n* @example\n* var arr = new BooleanArray( 3 );\n*\n* arr.set( true, 0 );\n* arr.set( false, 1 );\n* arr.set( true, 2 );\n*\n* var out = arr.with( 0, false );\n* // returns \n*\n* var v = out.get( 0 );\n* // returns false\n*/\nsetReadOnly( BooleanArray.prototype, 'with', function copyWith( index, value ) {\n\tvar buf;\n\tvar out;\n\tvar len;\n\n\tif ( !isBooleanArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a boolean array.' );\n\t}\n\tif ( !isInteger( index ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', index ) );\n\t}\n\tlen = this._length;\n\tif ( index < 0 ) {\n\t\tindex += len;\n\t}\n\tif ( index < 0 || index >= len ) {\n\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%s`.', index ) );\n\t}\n\tif ( !isBoolean( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a boolean. Value: `%s`.', value ) );\n\t}\n\tout = new this.constructor( this._buffer );\n\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tif ( value ) {\n\t\tbuf[ index ] = 1;\n\t} else {\n\t\tbuf[ index ] = 0;\n\t}\n\treturn out;\n});\n\n\n// EXPORTS //\n\nexport default BooleanArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Boolean from '@stdlib/boolean-ctor';\n\n\n// MAIN //\n\n/**\n* Fills an output array with \"boolean\" values.\n*\n* @private\n* @param {Uint8Array} buf - output array\n* @param {Array} arr - input array\n* @returns {Uint8Array} output array\n*/\nfunction fromArray( buf, arr ) {\n\tvar len;\n\tvar i;\n\n\tlen = arr.length;\n\tfor ( i = 0; i < len; i++ ) {\n\t\tbuf[ i ] = Boolean( arr[ i ] );\n\t}\n\treturn buf;\n}\n\n\n// EXPORTS //\n\nexport default fromArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Boolean from '@stdlib/boolean-ctor';\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @param {Function} clbk - callback to invoke for each iterated value\n* @param {*} thisArg - invocation context\n* @returns {Array} output array\n*/\nfunction fromIteratorMap( it, clbk, thisArg ) {\n\tvar out;\n\tvar v;\n\tvar i;\n\n\tout = [];\n\ti = -1;\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\ti += 1;\n\t\tout.push( Boolean( clbk.call( thisArg, v.value, i ) ) );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default fromIteratorMap;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Float64Array from '@stdlib/array-float64';\nimport Float32Array from '@stdlib/array-float32';\nimport Uint32Array from '@stdlib/array-uint32';\nimport Int32Array from '@stdlib/array-int32';\nimport Uint16Array from '@stdlib/array-uint16';\nimport Int16Array from '@stdlib/array-int16';\nimport Uint8Array from '@stdlib/array-uint8';\nimport Uint8ClampedArray from '@stdlib/array-uint8c';\nimport Int8Array from '@stdlib/array-int8';\nimport Complex64Array from '@stdlib/array-complex64';\nimport Complex128Array from '@stdlib/array-complex128';\nimport BooleanArray from '@stdlib/array-bool';\n\n\n// MAIN //\n\n// Note: order should match `dtypes` order\nvar CTORS = [\n\tFloat64Array,\n\tFloat32Array,\n\tInt32Array,\n\tUint32Array,\n\tInt16Array,\n\tUint16Array,\n\tInt8Array,\n\tUint8Array,\n\tUint8ClampedArray,\n\tComplex64Array,\n\tComplex128Array,\n\tBooleanArray\n];\n\n\n// EXPORTS //\n\nexport default CTORS;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n// Note: order should match `ctors` order\nvar DTYPES = [\n\t'float64',\n\t'float32',\n\t'int32',\n\t'uint32',\n\t'int16',\n\t'uint16',\n\t'int8',\n\t'uint8',\n\t'uint8c',\n\t'complex64',\n\t'complex128',\n\t'bool'\n];\n\n\n// EXPORTS //\n\nexport default DTYPES;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isBuffer from '@stdlib/assert-is-buffer';\nimport isArray from '@stdlib/assert-is-array';\nimport constructorName from '@stdlib/utils-constructor-name';\nimport ctor2dtype from './ctor2dtype.js';\nimport CTORS from './ctors.js';\nimport DTYPES from './dtypes.js';\n\n\n// VARIABLES //\n\nvar NTYPES = DTYPES.length;\n\n\n// MAIN //\n\n/**\n* Returns the data type of an array.\n*\n* @param {*} value - input value\n* @returns {(string|null)} data type\n*\n* @example\n* var dt = dtype( [ 1, 2, 3 ] );\n* // returns 'generic'\n*\n* var dt = dtype( 'beep' );\n* // returns null\n*/\nfunction dtype( value ) {\n\tvar i;\n\tif ( isArray( value ) ) {\n\t\treturn 'generic';\n\t}\n\tif ( isBuffer( value ) ) {\n\t\treturn null;\n\t}\n\tfor ( i = 0; i < NTYPES; i++ ) {\n\t\tif ( value instanceof CTORS[ i ] ) {\n\t\t\treturn DTYPES[ i ];\n\t\t}\n\t}\n\t// If the above failed, fall back to a more robust (and significantly slower) means for resolving underlying data types:\n\treturn ctor2dtype[ constructorName( value ) ] || null;\n}\n\n\n// EXPORTS //\n\nexport default dtype;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests if an object has a specified property, either own or inherited.\n*\n* @param {*} value - value to test\n* @param {*} property - property to test\n* @returns {boolean} boolean indicating if an object has a specified property\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = hasProp( beep, 'boop' );\n* // returns true\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = hasProp( beep, 'bap' );\n* // returns false\n*/\nfunction hasProp( value, property ) {\n\tif ( value === void 0 || value === null ) {\n\t\treturn false;\n\t}\n\tif ( typeof property === 'symbol' ) {\n\t\treturn property in Object( value );\n\t}\n\treturn ( String( property ) in Object( value ) );\n}\n\n\n// EXPORTS //\n\nexport default hasProp;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isAccessorArray from '@stdlib/array-base-assert-is-accessor-array';\nimport resolveGetter from '@stdlib/array-base-resolve-getter';\nimport hasProp from '@stdlib/assert-has-property';\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether at least one element in a provided indexed array has a specified property key-value pair, either own or inherited.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {(string|symbol|number)} prop - property\n* @param {*} value - property value\n* @returns {boolean} result\n*\n* @example\n* var o1 = {\n* 'a': 1\n* };\n* var o2 = {\n* 'b': 2\n* };\n* var o3 = {\n* 'c': 3\n* };\n*\n* var bool = indexed( [ o1, o2, o3 ], 'b', 2 );\n* // returns true\n*\n* bool = indexed( [ o1, o2, o3 ], 'b', 3 );\n* // returns false\n*\n* bool = indexed( [ o1, o2, o3 ], 'd', 0 );\n* // returns false\n*/\nfunction indexed( arr, prop, value ) {\n\tvar v;\n\tvar i;\n\tif ( value === void 0 ) {\n\t\tfor ( i = 0; i < arr.length; i++ ) {\n\t\t\tv = arr[ i ];\n\t\t\tif ( hasProp( v, prop ) && v[ prop ] === value ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\tfor ( i = 0; i < arr.length; i++ ) {\n\t\tif ( arr[ i ][ prop ] === value ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n/**\n* Tests whether at least one element in a provided accessor array has a specified property key-value pair, either own or inherited.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {(string|symbol|number)} prop - property\n* @param {*} value - property value\n* @returns {boolean} result\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n*\n* var o1 = {\n* 'a': 1\n* };\n* var o2 = {\n* 'b': 2\n* };\n* var o3 = {\n* 'c': 3\n* };\n*\n* var bool = accessors( toAccessorArray( [ o1, o2, o3 ] ), 'b', 2 );\n* // returns true\n*\n* bool = accessors( toAccessorArray( [ o1, o2, o3 ] ), 'b', 3 );\n* // returns false\n*\n* bool = accessors( toAccessorArray( [ o1, o2, o3 ] ), 'd', 0 );\n* // returns false\n*/\nfunction accessors( arr, prop, value ) {\n\tvar get;\n\tvar v;\n\tvar i;\n\n\tget = resolveGetter( arr );\n\tif ( value === void 0 ) {\n\t\tfor ( i = 0; i < arr.length; i++ ) {\n\t\t\tv = get( arr, i );\n\t\t\tif ( hasProp( v, prop ) && v[ prop ] === value ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\tfor ( i = 0; i < arr.length; i++ ) {\n\t\tif ( get( arr, i )[ prop ] === value ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// MAIN //\n\n/**\n* Tests whether at least one element in a provided array has a specified property key-value pair, either own or inherited.\n*\n* @param {Collection} arr - input array\n* @param {(string|symbol|number)} prop - property\n* @param {*} value - property value\n* @returns {boolean} result\n*\n* @example\n* var o1 = {\n* 'a': 1\n* };\n* var o2 = {\n* 'b': 2\n* };\n* var o3 = {\n* 'c': 3\n* };\n*\n* var bool = anyIsEntryIn( [ o1, o2, o3 ], 'b', 2 );\n* // returns true\n*\n* bool = anyIsEntryIn( [ o1, o2, o3 ], 'b', 3 );\n* // returns false\n*\n* bool = anyIsEntryIn( [ o1, o2, o3 ], 'd', 0 );\n* // returns false\n*/\nfunction anyIsEntryIn( arr, prop, value ) {\n\tif ( isAccessorArray( arr ) ) {\n\t\treturn accessors( arr, prop, value );\n\t}\n\treturn indexed( arr, prop, value );\n}\n\n\n// EXPORTS //\n\nexport default anyIsEntryIn;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isAccessorArray from '@stdlib/array-base-assert-is-accessor-array';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport getter from '@stdlib/array-base-getter';\nimport dtype from '@stdlib/array-dtype';\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for retrieving an element from an array-like object.\n*\n* @param {Collection} x - input array\n* @returns {Function} accessor\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var get = resolveGetter( arr );\n* var v = get( arr, 2 );\n* // returns 3\n*/\nfunction resolveGetter( x ) {\n\tvar dt = dtype( x );\n\tif ( isAccessorArray( x ) ) {\n\t\treturn accessorGetter( dt );\n\t}\n\treturn getter( dt );\n}\n\n\n// EXPORTS //\n\nexport default resolveGetter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Formats an error message for production.\n*\n* @param {string} code - error code\n* @param {*} ...args - error message arguments\n* @returns {string} formatted error message\n*\n* @example\n* var msg = fmtprodmsg( '3', 'wrong_type' );\n* // returns 'https://stdlib.io/e/3?&arg[]=wrong_type'\n*/\nfunction fmtprodmsg() {\n\tvar a = arguments;\n\tvar c = a[ 0 ];\n\tvar u = 'https://stdlib.io/e/'+c+'?';\n\tvar i;\n\tfor ( i = 1; i < a.length; i++ ) {\n\t\tu += '&arg[]=' + encodeURIComponent( a[ i ] );\n\t}\n\treturn u;\n}\n\n\n// EXPORTS //\n\nexport default fmtprodmsg;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Generates a linearly spaced numeric array whose elements increment by 1 starting from zero.\n*\n* @param {number} n - number of elements\n* @returns {Array} linearly spaced numeric array\n*\n* @example\n* var arr = zeroTo( 6 );\n* // returns [ 0, 1, 2, 3, 4, 5 ]\n*/\nfunction zeroTo( n ) {\n\tvar arr;\n\tvar i;\n\n\tarr = [];\n\tif ( n <= 0 ) {\n\t\treturn arr;\n\t}\n\tfor ( i = 0; i < n; i++ ) {\n\t\tarr.push( i );\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nexport default zeroTo;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport arraylike2object from '@stdlib/array-base-arraylike2object';\nimport reinterpret128 from '@stdlib/strided-base-reinterpret-complex128';\nimport reinterpret64 from '@stdlib/strided-base-reinterpret-complex64';\n\n\n// FUNCTIONS //\n\n/**\n* Fills an indexed array with linearly spaced numeric elements which increment by 1 starting from zero.\n*\n* @private\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {Collection} output array\n*\n* @example\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n*\n* var arr = indexed( out, 1, 0 );\n* // returns [ 0, 1, 2, 3, 4, 5 ]\n*\n* @example\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n*\n* var arr = indexed( out, -1, out.length-1 );\n* // returns [ 5, 4, 3, 2, 1, 0 ]\n*/\nfunction indexed( out, stride, offset ) {\n\tvar v;\n\tvar i;\n\n\ti = offset;\n\tv = 0;\n\twhile ( i >= 0 && i < out.length ) {\n\t\tout[ i ] = v;\n\t\ti += stride;\n\t\tv += 1;\n\t}\n\treturn out;\n}\n\n/**\n* Fills a complex number array with linearly spaced numeric elements which increment by 1 starting from zero.\n*\n* @private\n* @param {(Complex128Array|Complex64Array)} out - output complex number array\n* @param {(Float64Array|Float32Array)} data - output array data\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {(Complex128Array|Complex64Array)} output array\n*\n* @example\n* import Complex128Array from '@stdlib/array-complex128';\n* import reinterpret128 from '@stdlib/strided-base-reinterpret-complex128';\n*\n* var out = new Complex128Array( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n* // returns \n*\n* var data = reinterpret128( out, 0 );\n* // returns [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ]\n*\n* var arr = complex( out, data, 1, 0 );\n* // returns \n*\n* var bool = ( arr === out );\n* // returns true\n*\n* data = reinterpret128( out, 0 );\n* returns [ 0.0, 0.0, 1.0, 0.0, 2.0, 0.0 ]\n*/\nfunction complex( out, data, stride, offset ) {\n\tvar v;\n\tvar s;\n\tvar i;\n\n\ts = stride * 2;\n\ti = offset * 2;\n\tv = 0.0;\n\twhile ( i >= 0 && i < data.length ) {\n\t\tdata[ i ] = v; // real component\n\t\tdata[ i+1 ] = 0.0; // imaginary component\n\t\ti += s;\n\t\tv += 1.0;\n\t}\n\treturn out;\n}\n\n/**\n* Fills an accessor array with linearly spaced numeric elements which increment by 1 starting from zero.\n*\n* @private\n* @param {Object} out - output array object\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {Collection} output array\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import arraylike2object from '@stdlib/array-base-arraylike2object';\n\n* var out = toAccessorArray( [ 0, 0, 0, 0, 0, 0 ] );\n* var arr = accessors( arraylike2object( out ), 1, 0 );\n*\n* var bool = ( arr === out );\n* // returns true\n*\n* var v = out.get( 0 );\n* // returns 0\n*\n* v = out.get( out.length-1 );\n* // returns 5\n*/\nfunction accessors( out, stride, offset ) {\n\tvar data;\n\tvar set;\n\tvar v;\n\tvar i;\n\n\tdata = out.data;\n\tset = out.accessors[ 1 ];\n\n\ti = offset;\n\tv = 0;\n\twhile ( i >= 0 && i < data.length ) {\n\t\tset( data, i, v );\n\t\ti += stride;\n\t\tv += 1;\n\t}\n\treturn data;\n}\n\n\n// MAIN //\n\n/**\n* Fills an array with linearly spaced numeric elements which increment by 1 starting from zero.\n*\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {Collection} output array\n*\n* @example\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n*\n* var arr = assign( out, 1, 0 );\n* // returns [ 0, 1, 2, 3, 4, 5 ]\n*\n* @example\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n*\n* var arr = assign( out, -1, out.length-1 );\n* // returns [ 5, 4, 3, 2, 1, 0 ]\n*/\nfunction assign( out, stride, offset ) {\n\tvar obj = arraylike2object( out );\n\tif ( obj.accessorProtocol ) {\n\t\t// If provided a complex number array, reinterpret as a real typed array and only set the real components...\n\t\tif ( obj.dtype === 'complex128' ) {\n\t\t\treturn complex( out, reinterpret128( out, 0 ), stride, offset );\n\t\t}\n\t\tif ( obj.dtype === 'complex64' ) {\n\t\t\treturn complex( out, reinterpret64( out, 0 ), stride, offset );\n\t\t}\n\t\treturn accessors( obj, stride, offset );\n\t}\n\treturn indexed( out, stride, offset );\n}\n\n\n// EXPORTS //\n\nexport default assign;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Takes elements from an indexed array.\n*\n* @param {Collection} x - input array\n* @param {NonNegativeIntegerArray} indices - list of indices\n* @returns {Array} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n* var indices = [ 3, 1, 2, 0 ];\n*\n* var y = take( x, indices );\n* // returns [ 4, 2, 3, 1 ]\n*/\nfunction take( x, indices ) {\n\tvar out;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < indices.length; i++ ) {\n\t\tout.push( x[ indices[ i ] ] ); // use `Array#push` to ensure \"fast\" elements\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default take;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-loop-interchange-order';\n\n\n// MAIN //\n\n/**\n* Reorders ndarray dimensions and associated strides for loop interchange.\n*\n* ## Notes\n*\n* - The returned object has the following properties:\n*\n* - **sh**: dimensions sorted in loop order.\n* - **sx**: first input ndarray strides sorted in loop order.\n* - **sy**: second input ndarray strides sorted in loop order.\n* - **sz**: output ndarray strides sorted in loop order.\n*\n* @param {NonNegativeIntegerArray} sh - array dimensions\n* @param {IntegerArray} sx - first input array stride lengths\n* @param {IntegerArray} sy - second input array stride lengths\n* @param {IntegerArray} sz - output array stride lengths\n* @returns {Object} loop interchange data\n*\n* @example\n* var sh = [ 2, 3, 4 ];\n*\n* var sx = [ 12, 4, 1 ]; // row-major\n* var sy = [ 24, 8, 1 ]; // row-major\n* var sz = [ 1, -2, 6 ]; // column-major\n*\n* var o = binaryLoopOrder( sh, sx, sy, sz );\n* // returns {...}\n*\n* var ssh = o.sh;\n* // returns [ 4, 3, 2 ]\n*\n* var ssx = o.sx;\n* // returns [ 1, 4, 12 ]\n*\n* var ssy = o.sy;\n* // returns [ 1, 8, 24 ]\n*\n* var ssz = o.sz;\n* // returns [ 6, -2, 1 ]\n*/\nfunction binaryLoopOrder( sh, sx, sy, sz ) {\n\tvar tmp = loopOrder( sh, [ sx, sy, sz ] );\n\treturn {\n\t\t'sh': tmp[ 0 ],\n\t\t'sx': tmp[ 1 ],\n\t\t'sy': tmp[ 2 ],\n\t\t'sz': tmp[ 3 ]\n\t};\n}\n\n\n// EXPORTS //\n\nexport default binaryLoopOrder;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport zeroTo from '@stdlib/array-base-zero-to';\nimport copy from '@stdlib/array-base-copy-indexed';\nimport take from '@stdlib/array-base-take-indexed';\nimport strides2order from '@stdlib/ndarray-base-strides2order';\nimport sort2ins from './sort2ins.js';\n\n\n// MAIN //\n\n/**\n* Reorders ndarray dimensions and associated strides for loop interchange.\n*\n* ## Notes\n*\n* - The returned array has the following elements:\n*\n* ```text\n* [ , ... ]\n* ```\n*\n* where\n*\n* - **shape**: dimensions sorted in loop order.\n* - **...strides**: strides for each respective ndarray sorted in loop order.\n*\n* @param {NonNegativeIntegerArray} shape - array dimensions\n* @param {ArrayLikeObject>} strides - list of stride arrays containing the stride lengths for each input and output ndarray\n* @returns {Array} loop interchange data\n*\n* @example\n* var sh = [ 2, 3, 4 ];\n*\n* var sx = [ 12, 4, 1 ]; // row-major\n* var sy = [ 24, 8, 1 ]; // row-major\n* var sz = [ 1, -2, 6 ]; // column-major\n*\n* var o = loopOrder( sh, [ sx, sy, sz ] );\n* // returns [...]\n*\n* var ssh = o[ 0 ];\n* // returns [ 4, 3, 2 ]\n*\n* var ssx = o[ 1 ];\n* // returns [ 1, 4, 12 ]\n*\n* var ssy = o[ 2 ];\n* // returns [ 1, 8, 24 ]\n*\n* var ssz = o[ 3 ];\n* // returns [ 6, -2, 1 ]\n*/\nfunction loopOrder( shape, strides ) {\n\tvar idx;\n\tvar tmp;\n\tvar max;\n\tvar len;\n\tvar out;\n\tvar st;\n\tvar N;\n\tvar M;\n\tvar i;\n\tvar j;\n\n\tN = strides.length;\n\n\t// Initialize an array for grouping stride arrays according to memory layout:\n\ttmp = [];\n\tfor ( i = 0; i < 4; i++ ) { // note: `4` corresponds to the number of possible return values from `strides2order`\n\t\ttmp.push( [] );\n\t}\n\tM = tmp.length;\n\n\t// Group stride arrays according to memory layout:\n\tfor ( i = 0; i < N; i++ ) {\n\t\ttmp[ strides2order( strides[ i ] ) ].push( strides[ i ] );\n\t}\n\t// Determine which array should be used to generate the loop order:\n\tmax = tmp[ 0 ].length;\n\tif ( max === N ) {\n\t\t// If all arrays are \"disorganized\", then just use the first array, as, generally, each array is likely to be as un-ideal as every other:\n\t\tst = strides[ 0 ];\n\t} else if ( max === N-1 ) {\n\t\t// If all but one array is \"disorganized\", find the \"organized\" array...\n\t\tfor ( i = 1; i < M; i++ ) {\n\t\t\tif ( tmp[ i ].length ) {\n\t\t\t\tst = tmp[ i ][ 0 ];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t} else {\n\t\t// Find the layout which is most common...\n\t\tj = 0;\n\t\tfor ( i = 1; i < M; i++ ) {\n\t\t\tlen = tmp[ i ].length;\n\t\t\tif ( len >= max ) {\n\t\t\t\tmax = len;\n\t\t\t\tj = i;\n\t\t\t}\n\t\t}\n\t\t// Use the strides of the first array having the most common layout:\n\t\tst = tmp[ j ][ 0 ];\n\t}\n\t// Initialize a loop interchange index array for generating a loop order permutation:\n\tidx = zeroTo( shape.length );\n\n\t// Sort strides in increasing order of magnitude:\n\tsort2ins( copy( st ), idx );\n\n\t// Permute the shape based on the sorted strides:\n\tout = [ take( shape, idx ) ];\n\n\t// Permute each stride array based on the sorted strides:\n\tfor ( i = 0; i < N; i++ ) {\n\t\tout.push( take( strides[ i ], idx ) );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default loopOrder;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Simultaneously sorts two arrays based on the sort order of the first array using insertion sort.\n*\n* ## Notes\n*\n* - The first array is sorted in increasing order according to absolute value.\n* - The algorithm has space complexity `O(1)` and worst case time complexity `O(N^2)`.\n* - The algorithm is efficient for small arrays (typically `N <= 20`) and is particularly efficient for sorting arrays which are already substantially sorted.\n* - The algorithm is **stable**, meaning that the algorithm does **not** change the order of array elements which are equal or equivalent.\n* - The input arrays are sorted in-place (i.e., the input arrays are mutated).\n*\n* @private\n* @param {Array} x - first array\n* @param {Array} y - second array\n* @returns {void}\n*\n* @example\n* var x = [ -4, -2, 3, 1 ];\n* var y = [ 0, 1, 2, 3 ];\n*\n* sort2ins( x, y );\n*\n* console.log( x );\n* // => [ 1, -2, 3, -4 ]\n*\n* console.log( y );\n* // => [ 3, 1, 2, 0 ]\n*/\nfunction sort2ins( x, y ) {\n\tvar avx;\n\tvar aux;\n\tvar ix;\n\tvar iy;\n\tvar jx;\n\tvar jy;\n\tvar vx;\n\tvar vy;\n\tvar ux;\n\tvar i;\n\n\tix = 1;\n\tiy = 1;\n\n\t// Sort in increasing order...\n\tfor ( i = 1; i < x.length; i++ ) {\n\t\tvx = x[ ix ];\n\t\tavx = ( vx < 0 ) ? -vx : vx;\n\n\t\tvy = y[ iy ];\n\n\t\tjx = ix - 1;\n\t\tjy = iy - 1;\n\n\t\t// Shift all larger values to the left of the current element to the right...\n\t\twhile ( jx >= 0 ) {\n\t\t\tux = x[ jx ];\n\t\t\taux = ( ux < 0 ) ? -ux : ux;\n\t\t\tif ( aux <= avx ) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tx[ jx+1 ] = ux;\n\t\t\ty[ jy+1 ] = y[ jy ];\n\t\t\tjx -= 1;\n\t\t\tjy -= 1;\n\t\t}\n\t\tx[ jx+1 ] = vx;\n\t\ty[ jy+1 ] = vy;\n\t\tix += 1;\n\t\tiy += 1;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default sort2ins;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number primitive having a positive integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive having a positive integer value\n*\n* @example\n* var bool = isPositiveInteger( 3.0 );\n* // returns true\n*\n* @example\n* var bool = isPositiveInteger( new Number( 3.0 ) );\n* // returns false\n*/\nfunction isPositiveInteger( value ) {\n\treturn (\n\t\tisInteger( value ) &&\n\t\tvalue > 0.0\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isPositiveInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isObject as isInteger } from '@stdlib/assert-is-integer';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object having a positive integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object having a positive integer value\n*\n* @example\n* var bool = isPositiveInteger( 3.0 );\n* // returns false\n*\n* @example\n* var bool = isPositiveInteger( new Number( 3.0 ) );\n* // returns true\n*/\nfunction isPositiveInteger( value ) {\n\treturn (\n\t\tisInteger( value ) &&\n\t\tvalue.valueOf() > 0.0\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isPositiveInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a positive integer.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a positive integer\n*\n* @example\n* var bool = isPositiveInteger( 5.0 );\n* // returns true\n*\n* @example\n* var bool = isPositiveInteger( new Number( 5.0 ) );\n* // returns true\n*\n* @example\n* var bool = isPositiveInteger( 0.0 );\n* // returns false\n*\n* @example\n* var bool = isPositiveInteger( -5.0 );\n* // returns false\n*\n* @example\n* var bool = isPositiveInteger( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isPositiveInteger( null );\n* // returns false\n*/\nfunction isPositiveInteger( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isPositiveInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names.\n*\n* ## Notes\n*\n* - In contrast to the built-in `Object.keys()`, this function returns an empty array if provided `undefined` or `null`, rather than throwing an error.\n*\n* @private\n* @param {*} value - input object\n* @returns {Array} a list of own enumerable property names\n*\n* @example\n* var obj = {\n* 'beep': 'boop',\n* 'foo': 3.14\n* };\n*\n* var k = keys( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nfunction keys( value ) {\n\treturn Object.keys( Object( value ) );\n}\n\n\n// EXPORTS //\n\nexport default keys;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate a linearly spaced numeric array whose elements increment by 1 starting from zero.\n*\n* @module @stdlib/array-base-zero-to\n*\n* @example\n* import zeroTo from '@stdlib/array-base-zero-to';\n*\n* var arr = zeroTo( 6 );\n* // returns [ 0, 1, 2, 3, 4, 5 ]\n*\n* @example\n* import zeroTo from '@stdlib/array-base-zero-to';\n*\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n* var arr = zeroTo.assign( out, 1, 0 );\n* // returns [ 0, 1, 2, 3, 4, 5 ]\n*\n* var bool = ( out === arr );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport assign from './assign.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isAccessorArray from '@stdlib/array-base-assert-is-accessor-array';\nimport getter from '@stdlib/array-base-getter';\nimport setter from '@stdlib/array-base-setter';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport accessorSetter from '@stdlib/array-base-accessor-setter';\nimport dtype from '@stdlib/array-dtype';\n\n\n// MAIN //\n\n/**\n* Converts an array-like to an object likely to have the same \"shape\".\n*\n* ## Notes\n*\n* - This function is intended as a potential performance optimization. In V8, for example, even if two objects share common properties, if those properties were added in different orders or if one object has additional properties not shared by the other object, then those objects will have different \"hidden\" classes. If a function is provided many objects having different \"shapes\", some JavaScript VMs (e.g., V8) will consider the function \"megamorphic\" and fail to perform various runtime optimizations. Accordingly, the intent of this function is to standardize the \"shape\" of the object holding array meta data to ensure that internal functions operating on arrays are provided consistent argument \"shapes\".\n*\n* - The returned object has the following properties:\n*\n* - **data**: reference to the input array.\n* - **dtype**: array data type.\n* - **accessorProtocol**: `boolean` indicating whether the input array uses accessors for getting and setting elements.\n* - **accessors**: a two-element array whose first element is an accessor for retrieving an array element and whose second element is an accessor for setting an array element.\n*\n* @param {Collection} x - array-like object\n* @returns {Object} object containing array meta data\n*\n* @example\n* var obj = arraylike2object( [ 1, 2, 3, 4 ] );\n* // returns {...}\n*/\nfunction arraylike2object( x ) {\n\tvar dt = dtype( x );\n\tif ( isAccessorArray( x ) ) {\n\t\treturn {\n\t\t\t'data': x,\n\t\t\t'dtype': dt,\n\t\t\t'accessorProtocol': true,\n\t\t\t'accessors': [\n\t\t\t\taccessorGetter( dt ),\n\t\t\t\taccessorSetter( dt )\n\t\t\t]\n\t\t};\n\t}\n\treturn {\n\t\t'data': x,\n\t\t'dtype': dt,\n\t\t'accessorProtocol': false,\n\t\t'accessors': [\n\t\t\tgetter( dt ),\n\t\t\tsetter( dt )\n\t\t]\n\t};\n}\n\n\n// EXPORTS //\n\nexport default arraylike2object;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a positive integer.\n*\n* @module @stdlib/assert-is-positive-integer\n*\n* @example\n* import isPositiveInteger from '@stdlib/assert-is-positive-integer';\n*\n* var bool = isPositiveInteger( 5.0 );\n* // returns true\n*\n* bool = isPositiveInteger( new Number( 5.0 ) );\n* // returns true\n*\n* bool = isPositiveInteger( -5.0 );\n* // returns false\n*\n* bool = isPositiveInteger( 3.14 );\n* // returns false\n*\n* bool = isPositiveInteger( null );\n* // returns false\n*\n* @example\n* import { isPrimitive as isPositiveInteger } from '@stdlib/assert-is-positive-integer';\n*\n* var bool = isPositiveInteger( 3.0 );\n* // returns true\n*\n* bool = isPositiveInteger( new Number( 3.0 ) );\n* // returns false\n*\n* @example\n* import { isObject as isPositiveInteger } from '@stdlib/assert-is-positive-integer';\n*\n* var bool = isPositiveInteger( 3.0 );\n* // returns false\n*\n* bool = isPositiveInteger( new Number( 3.0 ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar bool = ( typeof Object.keys !== 'undefined' );\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArguments from './main.js';\n\n\n// VARIABLES //\n\nvar bool;\n\n\n// FUNCTIONS //\n\n/**\n* Detects whether an environment returns the expected internal class of the `arguments` object.\n*\n* @private\n* @returns {boolean} boolean indicating whether an environment behaves as expected\n*\n* @example\n* var bool = detect();\n* // returns \n*/\nfunction detect() {\n\treturn isArguments( arguments );\n}\n\n\n// MAIN //\n\nbool = detect();\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// MAIN //\n\n/**\n* Tests whether a value is an `arguments` object.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is an `arguments` object\n*\n* @example\n* function foo() {\n* return arguments;\n* }\n*\n* var bool = isArguments( foo() );\n* // returns true\n*\n* @example\n* var bool = isArguments( [] );\n* // returns false\n*/\nfunction isArguments( value ) {\n\treturn ( nativeClass( value ) === '[object Arguments]' );\n}\n\n\n// EXPORTS //\n\nexport default isArguments;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests if a double-precision floating-point numeric value is `NaN`.\n*\n* @param {number} x - value to test\n* @returns {boolean} boolean indicating whether the value is `NaN`\n*\n* @example\n* var bool = isnan( NaN );\n* // returns true\n*\n* @example\n* var bool = isnan( 7.0 );\n* // returns false\n*/\nfunction isnan( x ) {\n\treturn ( x !== x );\n}\n\n\n// EXPORTS //\n\nexport default isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport isNan from '@stdlib/math-base-assert-is-nan';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a `NaN` number primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a `NaN` number primitive\n*\n* @example\n* var bool = isnan( NaN );\n* // returns true\n*\n* @example\n* var bool = isnan( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isnan( new Number( NaN ) );\n* // returns false\n*/\nfunction isnan( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisNan( value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isObject as isNumber } from '@stdlib/assert-is-number';\nimport isNan from '@stdlib/math-base-assert-is-nan';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object having a value of `NaN`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object having a value of `NaN`\n*\n* @example\n* var bool = isnan( NaN );\n* // returns false\n*\n* @example\n* var bool = isnan( new Number( NaN ) );\n* // returns true\n*/\nfunction isnan( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisNan( value.valueOf() )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is `NaN`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is `NaN`\n*\n* @example\n* var bool = isnan( NaN );\n* // returns true\n*\n* @example\n* var bool = isnan( new Number( NaN ) );\n* // returns true\n*\n* @example\n* var bool = isnan( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isnan( null );\n* // returns false\n*/\nfunction isnan( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is `NaN`.\n*\n* @module @stdlib/assert-is-nan\n*\n* @example\n* import isnan from '@stdlib/assert-is-nan';\n*\n* var bool = isnan( NaN );\n* // returns true\n*\n* bool = isnan( new Number( NaN ) );\n* // returns true\n*\n* bool = isnan( 3.14 );\n* // returns false\n*\n* bool = isnan( null );\n* // returns false\n*\n* @example\n* import { isPrimitive as isnan } from '@stdlib/assert-is-nan';\n*\n* var bool = isnan( NaN );\n* // returns true\n*\n* bool = isnan( 3.14 );\n* // returns false\n*\n* bool = isnan( new Number( NaN ) );\n* // returns false\n*\n* @example\n* import { isObject as isnan } from '@stdlib/assert-is-nan';\n*\n* var bool = isnan( NaN );\n* // returns false\n*\n* bool = isnan( new Number( NaN ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests if an object's own property is enumerable.\n*\n* @private\n* @name isEnumerableProperty\n* @type {Function}\n* @param {*} value - value to test\n* @param {*} property - property to test\n* @returns {boolean} boolean indicating if an object property is enumerable\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = isEnumerableProperty.call( beep, 'boop' );\n* // returns true\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = isEnumerableProperty.call( beep, 'hasOwnProperty' );\n* // returns false\n*/\nvar isEnumerableProperty = Object.prototype.propertyIsEnumerable;\n\n\n// EXPORTS //\n\nexport default isEnumerableProperty;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isEnum from './native.js';\n\n\n// VARIABLES //\n\nvar bool;\n\n\n// FUNCTIONS //\n\n/**\n* Detects whether an environment has a bug where String indices are not detected as \"enumerable\" properties. Observed in Node v0.10.\n*\n* @private\n* @returns {boolean} boolean indicating whether an environment has the bug\n*/\nfunction detect() {\n\treturn !isEnum.call( 'beep', '0' );\n}\n\n\n// MAIN //\n\nbool = detect();\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isString from '@stdlib/assert-is-string';\nimport { isPrimitive as isnan } from '@stdlib/assert-is-nan';\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport isEnum from './native.js';\nimport hasStringEnumBug from './has_string_enumerability_bug.js';\n\n\n// MAIN //\n\n/**\n* Tests if an object's own property is enumerable.\n*\n* @param {*} value - value to test\n* @param {*} property - property to test\n* @returns {boolean} boolean indicating if an object property is enumerable\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = isEnumerableProperty( beep, 'boop' );\n* // returns true\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = isEnumerableProperty( beep, 'hasOwnProperty' );\n* // returns false\n*/\nfunction isEnumerableProperty( value, property ) {\n\tvar bool;\n\tif (\n\t\tvalue === void 0 ||\n\t\tvalue === null\n\t) {\n\t\treturn false;\n\t}\n\tbool = isEnum.call( value, property );\n\tif ( !bool && hasStringEnumBug && isString( value ) ) {\n\t\t// Note: we only check for indices, as properties attached to a `String` object are properly detected as enumerable above.\n\t\tproperty = +property;\n\t\treturn (\n\t\t\t!isnan( property ) &&\n\t\t\tisInteger( property ) &&\n\t\t\tproperty >= 0 &&\n\t\t\tproperty < value.length\n\t\t);\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default isEnumerableProperty;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an `arguments` object.\n*\n* @module @stdlib/assert-is-arguments\n*\n* @example\n* import isArguments from '@stdlib/assert-is-arguments';\n*\n* function foo() {\n* return arguments;\n* }\n*\n* var bool = isArguments( foo() );\n* // returns true\n*\n* bool = isArguments( [] );\n* // returns false\n*/\n\n// MODULES //\n\nimport hasArgumentsClass from './detect.js';\nimport main from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar isArguments;\nif ( hasArgumentsClass ) {\n\tisArguments = main;\n} else {\n\tisArguments = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default isArguments;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport isEnumerableProperty from '@stdlib/assert-is-enumerable-property';\nimport isArray from '@stdlib/assert-is-array';\nimport isInteger from '@stdlib/math-base-assert-is-integer';\nimport MAX_LENGTH from '@stdlib/constants-uint32-max';\n\n\n// MAIN //\n\n/**\n* Tests whether a value is an `arguments` object.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is an `arguments` object\n*\n* @example\n* function foo() {\n* return arguments;\n* }\n*\n* var bool = isArguments( foo() );\n* // returns true\n*\n* @example\n* var bool = isArguments( [] );\n* // returns false\n*/\nfunction isArguments( value ) {\n\treturn (\n\t\tvalue !== null &&\n\t\ttypeof value === 'object' &&\n\t\t!isArray( value ) &&\n\t\ttypeof value.length === 'number' &&\n\t\tisInteger( value.length ) &&\n\t\tvalue.length >= 0 &&\n\t\tvalue.length <= MAX_LENGTH &&\n\t\thasOwnProp( value, 'callee' ) &&\n\t\t!isEnumerableProperty( value, 'callee' )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isArguments;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArguments from '@stdlib/assert-is-arguments';\nimport builtin from './builtin.js';\n\n\n// VARIABLES //\n\nvar slice = Array.prototype.slice;\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names.\n*\n* @private\n* @param {*} value - input object\n* @returns {Array} a list of own enumerable property names\n*\n* @example\n* var obj = {\n* 'beep': 'boop',\n* 'foo': 3.14\n* };\n*\n* var k = keys( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nfunction keys( value ) {\n\tif ( isArguments( value ) ) {\n\t\treturn builtin( slice.call( value ) );\n\t}\n\treturn builtin( value );\n}\n\n\n// EXPORTS //\n\nexport default keys;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isEnumerableProperty from '@stdlib/assert-is-enumerable-property';\nimport noop from '@stdlib/utils-noop';\n\n\n// MAIN //\n\n// Note: certain environments treat an object's prototype as enumerable, which, as a matter of convention, it shouldn't be...\nvar bool = isEnumerableProperty( noop, 'prototype' );\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* No operation.\n*\n* @example\n* noop();\n* // ...does nothing.\n*/\nfunction noop() {\n\t// Empty function...\n}\n\n\n// EXPORTS //\n\nexport default noop;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isEnumerableProperty from '@stdlib/assert-is-enumerable-property';\n\n\n// VARIABLES //\n\nvar obj = {\n\t'toString': null\n};\n\n\n// MAIN //\n\n// Note: certain environments don't allow enumeration of overwritten properties which are considered non-enumerable...\nvar bool = !isEnumerableProperty( obj, 'toString' );\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isnan from '@stdlib/assert-is-nan';\nimport isCollection from '@stdlib/assert-is-collection';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns the first index at which a given element can be found.\n*\n* @param {ArrayLike} arr - array-like object\n* @param {*} searchElement - element to find\n* @param {integer} [fromIndex] - starting index (if negative, the start index is determined relative to last element)\n* @throws {TypeError} must provide an array-like object\n* @throws {TypeError} third argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* var arr = [ 4, 3, 2, 1 ];\n* var idx = indexOf( arr, 3 );\n* // returns 1\n*\n* @example\n* var arr = [ 4, 3, 2, 1 ];\n* var idx = indexOf( arr, 5 );\n* // returns -1\n*\n* @example\n* // Using a `fromIndex`:\n* var arr = [ 1, 2, 3, 4, 5, 2, 6 ];\n* var idx = indexOf( arr, 2, 3 );\n* // returns 5\n*\n* @example\n* // `fromIndex` which exceeds `array` length:\n* var arr = [ 1, 2, 3, 4, 2, 5 ];\n* var idx = indexOf( arr, 2, 10 );\n* // returns -1\n*\n* @example\n* // Negative `fromIndex`:\n* var arr = [ 1, 2, 3, 4, 5, 2, 6, 2 ];\n* var idx = indexOf( arr, 2, -4 );\n* // returns 5\n*\n* idx = indexOf( arr, 2, -1 );\n* // returns 7\n*\n* @example\n* // Negative `fromIndex` exceeding input `array` length:\n* var arr = [ 1, 2, 3, 4, 5, 2, 6 ];\n* var idx = indexOf( arr, 2, -10 );\n* // returns 1\n*\n* @example\n* // Array-like objects:\n* var str = 'bebop';\n* var idx = indexOf( str, 'o' );\n* // returns 3\n*/\nfunction indexOf( arr, searchElement, fromIndex ) {\n\tvar len;\n\tvar i;\n\tif ( !isCollection( arr ) && !isString( arr ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object. Value: `%s`.', arr ) );\n\t}\n\tlen = arr.length;\n\tif ( len === 0 ) {\n\t\treturn -1;\n\t}\n\tif ( arguments.length === 3 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex >= 0 ) {\n\t\t\tif ( fromIndex >= len ) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\ti = fromIndex;\n\t\t} else {\n\t\t\ti = len + fromIndex;\n\t\t\tif ( i < 0 ) {\n\t\t\t\ti = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\ti = 0;\n\t}\n\t// Check for `NaN`...\n\tif ( isnan( searchElement ) ) {\n\t\tfor ( ; i < len; i++ ) {\n\t\t\tif ( isnan( arr[i] ) ) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfor ( ; i < len; i++ ) {\n\t\t\tif ( arr[ i ] === searchElement ) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\n\n\n// EXPORTS //\n\nexport default indexOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests whether a value equals the prototype of its constructor.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value equals the prototype of its constructor\n*/\nfunction isConstructorPrototype( value ) {\n\treturn ( value.constructor && value.constructor.prototype === value );\n}\n\n\n// EXPORTS //\n\nexport default isConstructorPrototype;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar w = ( typeof window === 'undefined' ) ? void 0 : window;\n\n\n// EXPORTS //\n\nexport default w;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport indexOf from '@stdlib/utils-index-of';\nimport typeOf from '@stdlib/utils-type-of';\nimport isConstructorPrototype from './is_constructor_prototype.js';\nimport EXCLUDED_KEYS from './excluded_keys.json';\nimport win from './window.js';\n\n\n// VARIABLES //\n\nvar bool;\n\n\n// FUNCTIONS //\n\n/**\n* Determines whether an environment throws when comparing to the prototype of a value's constructor (e.g., [IE9][1]).\n*\n* [1]: https://stackoverflow.com/questions/7688070/why-is-comparing-the-constructor-property-of-two-windows-unreliable\n*\n* @private\n* @returns {boolean} boolean indicating whether an environment is buggy\n*/\nfunction check() {\n\tvar k;\n\tif ( typeOf( win ) === 'undefined' ) {\n\t\treturn false;\n\t}\n\tfor ( k in win ) { // eslint-disable-line guard-for-in\n\t\ttry {\n\t\t\tif (\n\t\t\t\tindexOf( EXCLUDED_KEYS, k ) === -1 &&\n\t\t\t\thasOwnProp( win, k ) &&\n\t\t\t\twin[ k ] !== null &&\n\t\t\t\ttypeOf( win[ k ] ) === 'object'\n\t\t\t) {\n\t\t\t\tisConstructorPrototype( win[ k ] );\n\t\t\t}\n\t\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// MAIN //\n\nbool = check();\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar bool = ( typeof window !== 'undefined' );\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasArgumentsBug from './has_arguments_bug.js';\nimport HAS_BUILTIN from './has_builtin.js';\nimport builtin from './builtin.js';\nimport wrapper from './builtin_wrapper.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names.\n*\n* @name keys\n* @type {Function}\n* @param {*} value - input object\n* @returns {Array} a list of own enumerable property names\n*\n* @example\n* var obj = {\n* 'beep': 'boop',\n* 'foo': 3.14\n* };\n*\n* var k = keys( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nvar keys;\nif ( HAS_BUILTIN ) {\n\tif ( hasArgumentsBug() ) {\n\t\tkeys = wrapper;\n\t} else {\n\t\tkeys = builtin;\n\t}\n} else {\n\tkeys = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default keys;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport keys from './builtin.js';\n\n\n// FUNCTIONS //\n\n/**\n* Tests the built-in `Object.keys()` implementation when provided `arguments`.\n*\n* @private\n* @returns {boolean} boolean indicating whether the built-in implementation returns the expected number of keys\n*/\nfunction test() {\n\treturn ( keys( arguments ) || '' ).length !== 2;\n}\n\n\n// MAIN //\n\n/**\n* Tests whether the built-in `Object.keys()` implementation supports providing `arguments` as an input value.\n*\n* ## Notes\n*\n* - Safari 5.0 does **not** support `arguments` as an input value.\n*\n* @private\n* @returns {boolean} boolean indicating whether a built-in implementation supports `arguments`\n*/\nfunction check() {\n\treturn test( 1, 2 );\n}\n\n\n// EXPORTS //\n\nexport default check;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isObjectLike from '@stdlib/assert-is-object-like';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport isArguments from '@stdlib/assert-is-arguments';\nimport HAS_ENUM_PROTO_BUG from './has_enumerable_prototype_bug.js';\nimport HAS_NON_ENUM_PROPS_BUG from './has_non_enumerable_properties_bug.js';\nimport isConstructorPrototype from './is_constructor_prototype_wrapper.js';\nimport NON_ENUMERABLE from './non_enumerable.json';\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names.\n*\n* @private\n* @param {*} value - input object\n* @returns {Array} a list of own enumerable property names\n*\n* @example\n* var obj = {\n* 'beep': 'boop',\n* 'foo': 3.14\n* };\n*\n* var k = keys( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nfunction keys( value ) {\n\tvar skipConstructor;\n\tvar skipPrototype;\n\tvar isFcn;\n\tvar out;\n\tvar k;\n\tvar p;\n\tvar i;\n\n\tout = [];\n\tif ( isArguments( value ) ) {\n\t\t// Account for environments which treat `arguments` differently...\n\t\tfor ( i = 0; i < value.length; i++ ) {\n\t\t\tout.push( i.toString() );\n\t\t}\n\t\t// Note: yes, we are precluding the `arguments` array-like object from having other enumerable properties; however, this should (1) be very rare and (2) not be encouraged (e.g., doing something like `arguments.a = 'b'`; in certain engines directly manipulating the `arguments` value results in automatic de-optimization).\n\t\treturn out;\n\t}\n\tif ( typeof value === 'string' ) {\n\t\t// Account for environments which do not treat string character indices as \"own\" properties...\n\t\tif ( value.length > 0 && !hasOwnProp( value, '0' ) ) {\n\t\t\tfor ( i = 0; i < value.length; i++ ) {\n\t\t\t\tout.push( i.toString() );\n\t\t\t}\n\t\t}\n\t} else {\n\t\tisFcn = ( typeof value === 'function' );\n\t\tif ( isFcn === false && !isObjectLike( value ) ) {\n\t\t\treturn out;\n\t\t}\n\t\tskipPrototype = ( HAS_ENUM_PROTO_BUG && isFcn );\n\t}\n\tfor ( k in value ) {\n\t\tif ( !( skipPrototype && k === 'prototype' ) && hasOwnProp( value, k ) ) {\n\t\t\tout.push( String( k ) );\n\t\t}\n\t}\n\tif ( HAS_NON_ENUM_PROPS_BUG ) {\n\t\tskipConstructor = isConstructorPrototype( value );\n\t\tfor ( i = 0; i < NON_ENUMERABLE.length; i++ ) {\n\t\t\tp = NON_ENUMERABLE[ i ];\n\t\t\tif ( !( skipConstructor && p === 'constructor' ) && hasOwnProp( value, p ) ) {\n\t\t\t\tout.push( String( p ) );\n\t\t\t}\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default keys;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasAutomationEqualityBug from './has_automation_equality_bug.js';\nimport isConstructorPrototype from './is_constructor_prototype.js';\nimport HAS_WINDOW from './has_window.js';\n\n\n// MAIN //\n\n/**\n* Wraps the test for constructor prototype equality to accommodate buggy environments (e.g., environments which throw when testing equality).\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value equals the prototype of its constructor\n*/\nfunction wrapper( value ) {\n\tif ( HAS_WINDOW === false && !hasAutomationEqualityBug ) {\n\t\treturn isConstructorPrototype( value );\n\t}\n\ttry {\n\t\treturn isConstructorPrototype( value );\n\t} catch ( error ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default wrapper;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isFunction from '@stdlib/assert-is-function';\nimport builtin from './native.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar getProto;\nif ( isFunction( Object.getPrototypeOf ) ) {\n\tgetProto = builtin;\n} else {\n\tgetProto = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default getProto;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an object.\n*\n* @name Object\n* @constructor\n* @type {Function}\n* @param {*} value - input value\n* @returns {Object} object\n*\n* @example\n* var o = new Object( null );\n* // returns {}\n*\n* @example\n* var o = new Object( 5.0 );\n* // returns \n*\n* @example\n* var o = new Object( 'beep' );\n* // returns \n*\n* @example\n* var o1 = {};\n*\n* var o2 = new Object( o1 );\n* // returns {}\n*\n* var bool = ( o1 === o2 );\n* // returns true\n*/\nvar Obj = Object; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default Obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar getProto = Object.getPrototypeOf;\n\n\n// EXPORTS //\n\nexport default getProto;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\nimport Object from '@stdlib/object-ctor';\nimport getProto from './proto.js';\n\n\n// MAIN //\n\n/**\n* Returns the prototype of a provided object.\n*\n* @private\n* @param {Object} obj - input object\n* @returns {(Object|null)} prototype\n*/\nfunction getPrototypeOf( obj ) {\n\tvar proto = getProto( obj );\n\tif ( proto || proto === null ) {\n\t\treturn proto;\n\t}\n\tif ( nativeClass( obj.constructor ) === '[object Function]' ) {\n\t\t// May break if the constructor has been tampered with...\n\t\treturn obj.constructor.prototype;\n\t}\n\tif ( obj instanceof Object ) {\n\t\treturn Object.prototype;\n\t}\n\t// Return `null` for objects created via `Object.create( null )`. Also return `null` for cross-realm objects on browsers that lack `__proto__` support, such as IE < 11.\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default getPrototypeOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the value of the `__proto__` property.\n*\n* @private\n* @param {Object} obj - input object\n* @returns {*} value of `__proto__` property\n*/\nfunction getProto( obj ) {\n\t// eslint-disable-next-line no-proto\n\treturn obj.__proto__;\n}\n\n\n// EXPORTS //\n\nexport default getProto;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isObject from '@stdlib/assert-is-object';\nimport isFunction from '@stdlib/assert-is-function';\nimport getPrototypeOf from '@stdlib/utils-get-prototype-of';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar objectPrototype = Object.prototype;\n\n\n// FUNCTIONS //\n\n/**\n* Tests that an object only has own properties.\n*\n* @private\n* @param {Object} obj - value to test\n* @returns {boolean} boolean indicating if an object only has own properties\n*/\nfunction ownProps( obj ) {\n\tvar key;\n\n\t// NOTE: possibility of perf boost if key enumeration order is known (see http://stackoverflow.com/questions/18531624/isplainobject-thing).\n\tfor ( key in obj ) {\n\t\tif ( !hasOwnProp( obj, key ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n\n// MAIN //\n\n/**\n* Tests if a value is a plain object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a plain object\n*\n* @example\n* var bool = isPlainObject( {} );\n* // returns true\n*\n* @example\n* var bool = isPlainObject( null );\n* // returns false\n*/\nfunction isPlainObject( value ) {\n\tvar proto;\n\n\t// Screen for obvious non-objects...\n\tif ( !isObject( value ) ) {\n\t\treturn false;\n\t}\n\t// Objects with no prototype (e.g., `Object.create( null )`) are plain...\n\tproto = getPrototypeOf( value );\n\tif ( !proto ) {\n\t\treturn true;\n\t}\n\t// Objects having a prototype are plain if and only if they are constructed with a global `Object` function and the prototype points to the prototype of a plain object...\n\treturn (\n\t\t// Cannot have own `constructor` property:\n\t\t!hasOwnProp( value, 'constructor' ) &&\n\n\t\t// Prototype `constructor` property must be a function (see also https://bugs.jquery.com/ticket/9897 and http://stackoverflow.com/questions/18531624/isplainobject-thing):\n\t\thasOwnProp( proto, 'constructor' ) &&\n\t\tisFunction( proto.constructor ) &&\n\t\tnativeClass( proto.constructor ) === '[object Function]' &&\n\n\t\t// Test for object-specific method:\n\t\thasOwnProp( proto, 'isPrototypeOf' ) &&\n\t\tisFunction( proto.isPrototypeOf ) &&\n\n\t\t(\n\t\t\t// Test if the prototype matches the global `Object` prototype (same realm):\n\t\t\tproto === objectPrototype ||\n\n\t\t\t// Test that all properties are own properties (cross-realm; *most* likely a plain object):\n\t\t\townProps( value )\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isPlainObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Object from '@stdlib/object-ctor';\nimport getProto from './detect.js';\n\n\n// MAIN //\n\n/**\n* Returns the prototype of a provided object.\n*\n* @param {*} value - input value\n* @returns {(Object|null)} prototype\n*\n* @example\n* var proto = getPrototypeOf( {} );\n* // returns {}\n*/\nfunction getPrototypeOf( value ) {\n\tif (\n\t\tvalue === null ||\n\t\tvalue === void 0\n\t) {\n\t\treturn null;\n\t}\n\t// In order to ensure consistent ES5/ES6 behavior, cast input value to an object (strings, numbers, booleans); ES5 `Object.getPrototypeOf` throws when provided primitives and ES6 `Object.getPrototypeOf` casts:\n\tvalue = Object( value );\n\n\treturn getProto( value );\n}\n\n\n// EXPORTS //\n\nexport default getPrototypeOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport objectInverse from '@stdlib/object-inverse';\nimport dtypeEnums from '@stdlib/ndarray-base-dtype-enums';\n\n\n// VARIABLES //\n\nvar hash = objectInverse( dtypeEnums(), {\n\t'duplicates': false\n});\n\n\n// MAIN //\n\n/**\n* Returns the data type string associated with an ndarray data type enumeration constant.\n*\n* @param {integer} dtype - data type enumeration constant\n* @returns {(string|null)} data type string or null\n*\n* @example\n* import str2enum from '@stdlib/ndarray-base-dtype-str2enum';\n*\n* var v = str2enum( 'float64' );\n* // returns \n*\n* var dt = enum2str( v );\n* // returns 'float64'\n*/\nfunction enum2str( dtype ) {\n\tvar v = hash[ dtype ];\n\treturn ( isString( v ) ) ? v : null; // note: we include this guard to prevent walking the prototype chain\n}\n\n\n// EXPORTS //\n\nexport default enum2str;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport objectKeys from '@stdlib/utils-keys';\nimport isArray from '@stdlib/assert-is-array';\nimport isObject from '@stdlib/assert-is-plain-object';\nimport isObjectLike from '@stdlib/assert-is-object-like';\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Inverts an object, such that keys become values and values become keys.\n*\n* @param {ObjectLike} obj - input object\n* @param {Options} [opts] - function options\n* @param {boolean} [opts.duplicates=true] - boolean indicating whether to store duplicate keys\n* @throws {TypeError} first argument must be object-like\n* @throws {TypeError} second argument must be an object\n* @throws {TypeError} must provide valid options\n* @returns {Object} inverted object\n*\n* @example\n* var out = invert({\n* 'a': 'beep',\n* 'b': 'boop'\n* });\n* // returns { 'beep': 'a', 'boop': 'b' }\n*\n* @example\n* var out = invert({\n* 'a': 'beep',\n* 'b': 'beep'\n* });\n* // returns { 'beep': [ 'a', 'b' ] }\n*\n* @example\n* var obj = {};\n* obj.a = 'beep';\n* obj.b = 'boop';\n* obj.c = 'beep'; // inserted after `a`\n*\n* var out = invert( obj, {\n* 'duplicates': false\n* });\n* // returns { 'beep': 'c', 'boop': 'b' }\n*/\nfunction invert( obj, opts ) {\n\tvar allowDupes = true;\n\tvar keys;\n\tvar len;\n\tvar key;\n\tvar val;\n\tvar out;\n\tvar v;\n\tvar i;\n\tif ( !isObjectLike( obj ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an object (except null). Value: `%s`.', obj ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isObject( opts ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', opts ) );\n\t\t}\n\t\tif ( hasOwnProp( opts, 'duplicates' ) ) {\n\t\t\tallowDupes = opts.duplicates;\n\t\t\tif ( !isBoolean( allowDupes ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a boolean. Option: `%s`.', 'duplicates', allowDupes ) );\n\t\t\t}\n\t\t}\n\t}\n\tkeys = objectKeys( obj );\n\tlen = keys.length;\n\tout = {};\n\tif ( allowDupes ) {\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tkey = keys[ i ];\n\t\t\tval = obj[ key ];\n\t\t\tif ( !hasOwnProp( out, val ) ) {\n\t\t\t\tout[ val ] = key;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tv = out[ val ];\n\t\t\tif ( isArray( v ) ) {\n\t\t\t\tout[ val ].push( key );\n\t\t\t} else {\n\t\t\t\tout[ val ] = [ v, key ];\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tkey = keys[ i ];\n\t\t\tout[ obj[ key ] ] = key;\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default invert;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable stdlib/empty-line-before-comment */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an object mapping supported data type strings to enumeration constants.\n*\n* ## Notes\n*\n* - Downstream consumers of this mapping should **not** rely on specific integer values (e.g., `INT8 == 0`). Instead, the object should be used in an opaque manner.\n* - The main purpose of this function is JavaScript and C inter-operation of ndarray objects.\n*\n* @returns {Object} object mapping supported data type strings to enumeration constants\n*\n* @example\n* var table = dtypeEnums();\n* // returns {...}\n*/\nfunction dtypeEnums() {\n\t// NOTE: the following should match the C enumeration in `@stdlib/ndarray/dtypes`!!!!\n\treturn {\n\t\t// Boolean data types:\n\t\t'bool': 0,\n\n\t\t// Integer data types:\n\t\t'int8': 1,\n\t\t'uint8': 2,\n\t\t'uint8c': 3,\n\t\t'int16': 4,\n\t\t'uint16': 5,\n\t\t'int32': 6,\n\t\t'uint32': 7,\n\t\t'int64': 8,\n\t\t'uint64': 9,\n\t\t// 'int128': 10, // uncomment once supported\n\t\t// 'uint128': 11,\n\t\t// 'int256': 12,\n\t\t// 'uint256': 13,\n\n\t\t// Floating-point data types:\n\t\t'float16': 10,\n\t\t// 'bfloat16': 15,\n\t\t'float32': 11,\n\t\t'float64': 12,\n\t\t// 'float128': 18, // uncomment once supported\n\n\t\t// Complex floating-point number data types:\n\t\t'complex32': 13,\n\t\t'complex64': 14,\n\t\t'complex128': 15,\n\n\t\t// Data type for \"binary\" data (i.e., data stored in a Node.js `Buffer` object):\n\t\t'binary': 16,\n\n\t\t// Data type for \"generic\" JavaScript values (objects):\n\t\t'generic': 17,\n\n\t\t// Define a signaling value which is guaranteed not to be a valid type enumeration value:\n\t\t'notype': 18,\n\n\t\t// Indicate the start of user defined type numbers (leaving room for type growth above):\n\t\t'userdefined_type': 256\n\t};\n}\n\n\n// EXPORTS //\n\nexport default dtypeEnums;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport { isPrimitive as isPositiveInteger } from '@stdlib/assert-is-positive-integer';\nimport enum2str from '@stdlib/ndarray-base-dtype-enum2str';\nimport BYTES_PER_ELEMENT from './bytes_per_element.json';\n\n\n// MAIN //\n\n/**\n* Returns the number of bytes per element for a provided underlying ndarray data type.\n*\n* @param {*} dtype - data type\n* @returns {(PositiveInteger|null)} number of bytes per element\n*\n* @example\n* var nbytes = bytesPerElement( 'float64' );\n* // returns 8\n*\n* nbytes = bytesPerElement( 'generic' );\n* // returns null\n*\n* @example\n* import structFactory from '@stdlib/dstructs-struct';\n*\n* var schema = [\n* {\n* 'name': 'value',\n* 'type': 'float64'\n* }\n* ];\n* var Struct = structFactory( schema );\n* // returns \n*\n* var nbytes = bytesPerElement( Struct );\n* // returns 8\n*/\nfunction bytesPerElement( dtype ) {\n\tvar v;\n\tif ( isString( dtype ) ) {\n\t\treturn BYTES_PER_ELEMENT[ dtype ] || null;\n\t}\n\tif ( isNumber( dtype ) ) {\n\t\treturn BYTES_PER_ELEMENT[ enum2str( dtype ) ] || null;\n\t}\n\tif ( dtype ) {\n\t\tv = dtype.byteLength;\n\t\tif ( isPositiveInteger( v ) ) {\n\t\t\treturn v;\n\t\t}\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default bytesPerElement;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2026 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar defaults = {\n\t// Define a default block size (in bytes):\n\t'BLOCK_SIZE_IN_BYTES': 64|0, // 64b is a common cache line size. How applicable the common cache line size is here is debatable, given that, depending on the associated stride(s), the innermost loop may not iterate over adjacent elements. The primary goal is to have a block size in which all data within a block can always fit in (L1) cache, regardless of cache size (i.e., cache-oblivious). For reference, a common L1 cache size is 32kB per core. For best performance, block sizes should be tuned based on system hardware; however, such tuning is not readily available to us here. Without obvious better alternatives, 64b has some theoretical (and practical) underpinning, and it should be good enough for most inputs, especially for ndarrays with near contiguity.\n\n\t// Define a default block size (in elements):\n\t'BLOCK_SIZE_IN_ELEMENTS': 8|0 // 64 bytes / 8 bytes per element (i.e., default element size is same as a double)\n};\n\n\n// EXPORTS //\n\nexport default defaults;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport blockSize from '@stdlib/ndarray-base-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Returns a loop block size for multi-dimensional array tiled loops.\n*\n* @param {*} dtypeX - first input array data type\n* @param {*} dtypeY - second input array data type\n* @param {*} dtypeZ - output array data type\n* @returns {integer} block size (in units of elements)\n*\n* @example\n* var bsize = binaryBlockSize( 'float64', 'float64', 'float64' );\n* // returns \n*/\nfunction binaryBlockSize( dtypeX, dtypeY, dtypeZ ) {\n\treturn blockSize( [ dtypeX, dtypeY, dtypeZ ] );\n}\n\n\n// EXPORTS //\n\nexport default binaryBlockSize;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2026 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport bytesPerElement from '@stdlib/ndarray-base-bytes-per-element';\nimport defaults from './defaults.js';\n\n\n// MAIN //\n\n/**\n* Returns a loop block size for multi-dimensional array tiled loops.\n*\n* @param {ArrayLikeObject} dtypes - list of input and output ndarray data types\n* @returns {integer} block size (in units of elements)\n*\n* @example\n* var bsize = blockSize( [ 'float64', 'float64', 'float64', 'float64' ] );\n* // returns \n*/\nfunction blockSize( dtypes ) {\n\tvar max;\n\tvar len;\n\tvar nb;\n\tvar i;\n\n\tlen = dtypes.length;\n\tif ( len <= 0 ) {\n\t\treturn defaults.BLOCK_SIZE_IN_ELEMENTS;\n\t}\n\tmax = bytesPerElement( dtypes[ 0 ] );\n\tif ( max === null ) {\n\t\treturn defaults.BLOCK_SIZE_IN_ELEMENTS; // e.g., \"generic\" arrays\n\t}\n\t// Find the largest element size among all arrays...\n\tfor ( i = 1; i < len; i++ ) {\n\t\tnb = bytesPerElement( dtypes[ i ] );\n\t\tif ( nb === null ) {\n\t\t\treturn defaults.BLOCK_SIZE_IN_ELEMENTS; // e.g., \"generic\" arrays\n\t\t}\n\t\tif ( nb > max ) {\n\t\t\tmax = nb;\n\t\t}\n\t}\n\tnb = ( defaults.BLOCK_SIZE_IN_BYTES/max )|0; // asm type annotation\n\treturn ( nb > 0 ) ? nb : 1|0;\n}\n\n\n// EXPORTS //\n\nexport default blockSize;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isColumnMajor from '@stdlib/ndarray-base-assert-is-column-major-string';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Converts a linear index in an array view to a linear index in an underlying data buffer.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @param {NonNegativeInteger} offset - location of the first indexed value **based** on the stride array\n* @param {string} order - specifies whether an array is row-major (C-style) or column-major (Fortran-style)\n* @param {integer} idx - linear index in an array view\n* @param {string} mode - specifies how to handle a linear index which exceeds array dimensions\n* @throws {RangeError} linear index must not exceed array dimensions\n* @returns {NonNegativeInteger} linear index in an underlying data buffer\n*\n* @example\n* var shape = [ 3, 3 ];\n* var strides = [ -3, 1 ];\n* var offset = 6;\n* var order = 'row-major';\n* var mode = 'throw';\n*\n* var ind = vind2bind( shape, strides, offset, order, 1, mode );\n* // returns 7\n*/\nfunction vind2bind( shape, strides, offset, order, idx, mode ) {\n\tvar ndims;\n\tvar len;\n\tvar ind;\n\tvar s;\n\tvar i;\n\n\tndims = shape.length;\n\tlen = 1;\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tlen *= shape[ i ];\n\t}\n\tif ( mode === 'clamp' ) {\n\t\tif ( idx < 0 ) {\n\t\t\tidx = 0;\n\t\t} else if ( idx >= len ) {\n\t\t\tidx = len - 1;\n\t\t}\n\t} else if ( mode === 'wrap' ) {\n\t\tif ( idx < 0 ) {\n\t\t\tidx += len; // slight optimization to avoid modulo arithmetic when |idx| <= len\n\t\t\tif ( idx < 0 ) {\n\t\t\t\tidx %= len;\n\t\t\t\tif ( idx !== 0 ) {\n\t\t\t\t\tidx += len;\n\t\t\t\t}\n\t\t\t}\n\t\t} else if ( idx >= len ) {\n\t\t\tidx -= len; // slight optimization to avoid modulo arithmetic when len < idx <= 2*len\n\t\t\tif ( idx >= len ) {\n\t\t\t\tidx %= len;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tif ( mode === 'normalize' && idx < 0 ) {\n\t\t\tidx += len;\n\t\t}\n\t\tif ( idx < 0 || idx >= len ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Linear index must not exceed array dimensions. Number of array elements: `%u`. Value: `%d`.', len, idx ) );\n\t\t}\n\t}\n\t// The approach which follows is to resolve a view index to its subscripts and then plug the subscripts into the standard formula for computing the linear index in the underlying data buffer...\n\tind = offset;\n\tif ( isColumnMajor( order ) ) {\n\t\tfor ( i = 0; i < ndims; i++ ) {\n\t\t\ts = idx % shape[ i ];\n\t\t\tidx -= s;\n\t\t\tidx /= shape[ i ];\n\t\t\tind += s * strides[ i ];\n\t\t}\n\t\treturn ind;\n\t}\n\t// Case: row-major\n\tfor ( i = ndims-1; i >= 0; i-- ) {\n\t\ts = idx % shape[ i ];\n\t\tidx -= s;\n\t\tidx /= shape[ i ];\n\t\tind += s * strides[ i ];\n\t}\n\treturn ind;\n}\n\n\n// EXPORTS //\n\nexport default vind2bind;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport numel from '@stdlib/ndarray-base-numel';\nimport vind2bind from '@stdlib/ndarray-base-vind2bind';\n\n\n// VARIABLES //\n\nvar MODE = 'throw';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in n-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 6, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binarynd( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binarynd( x, y, z, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar ordx;\n\tvar ordy;\n\tvar ordz;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar len;\n\tvar sh;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i;\n\n\tsh = x.shape;\n\n\t// Compute the total number of elements over which to iterate:\n\tlen = numel( sh );\n\n\t// Cache references to the input and output ndarray data buffers:\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache references to the respective stride arrays:\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays:\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache the respective array orders:\n\tordx = x.order;\n\tordy = y.order;\n\tordz = z.order;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over each element based on the linear **view** index, regardless as to how the data is stored in memory...\n\tfor ( i = 0; i < len; i++ ) {\n\t\tix = vind2bind( sh, sx, ox, ordx, i, MODE );\n\t\tiy = vind2bind( sh, sy, oy, ordy, i, MODE );\n\t\tiz = vind2bind( sh, sz, oz, ordz, i, MODE );\n\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binarynd;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport numel from '@stdlib/ndarray-base-numel';\nimport vind2bind from '@stdlib/ndarray-base-vind2bind';\n\n\n// VARIABLES //\n\nvar MODE = 'throw';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in n-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 6, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binarynd( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binarynd( x, y, z, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar ordx;\n\tvar ordy;\n\tvar ordz;\n\tvar len;\n\tvar sh;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i;\n\n\tsh = x.shape;\n\n\t// Compute the total number of elements over which to iterate:\n\tlen = numel( sh );\n\n\t// Cache references to the input and output ndarray data buffers:\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache references to the respective stride arrays:\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays:\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache the respective array orders:\n\tordx = x.order;\n\tordy = y.order;\n\tordz = z.order;\n\n\t// Iterate over each element based on the linear **view** index, regardless as to how the data is stored in memory...\n\tfor ( i = 0; i < len; i++ ) {\n\t\tix = vind2bind( sh, sx, ox, ordx, i, MODE );\n\t\tiy = vind2bind( sh, sy, oy, ordy, i, MODE );\n\t\tiz = vind2bind( sh, sz, oz, ordz, i, MODE );\n\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binarynd;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport iterationOrder from '@stdlib/ndarray-base-iteration-order';\nimport minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\nimport ndarray2object from '@stdlib/ndarray-base-ndarraylike2object';\nimport strides2order from '@stdlib/ndarray-base-strides2order';\nimport anyIsEntryIn from '@stdlib/array-base-any-is-entry-in';\nimport format from '@stdlib/error-tools-fmtprodmsg';\nimport blockedaccessorbinary2d from './2d_blocked_accessors.js';\nimport blockedaccessorbinary3d from './3d_blocked_accessors.js';\nimport blockedaccessorbinary4d from './4d_blocked_accessors.js';\nimport blockedaccessorbinary5d from './5d_blocked_accessors.js';\nimport blockedaccessorbinary6d from './6d_blocked_accessors.js';\nimport blockedaccessorbinary7d from './7d_blocked_accessors.js';\nimport blockedaccessorbinary8d from './8d_blocked_accessors.js';\nimport blockedaccessorbinary9d from './9d_blocked_accessors.js';\nimport blockedaccessorbinary10d from './10d_blocked_accessors.js';\nimport blockedbinary2d from './2d_blocked.js';\nimport blockedbinary3d from './3d_blocked.js';\nimport blockedbinary4d from './4d_blocked.js';\nimport blockedbinary5d from './5d_blocked.js';\nimport blockedbinary6d from './6d_blocked.js';\nimport blockedbinary7d from './7d_blocked.js';\nimport blockedbinary8d from './8d_blocked.js';\nimport blockedbinary9d from './9d_blocked.js';\nimport blockedbinary10d from './10d_blocked.js';\nimport accessorbinary0d from './0d_accessors.js';\nimport accessorbinary1d from './1d_accessors.js';\nimport accessorbinary2d from './2d_accessors.js';\nimport accessorbinary3d from './3d_accessors.js';\nimport accessorbinary4d from './4d_accessors.js';\nimport accessorbinary5d from './5d_accessors.js';\nimport accessorbinary6d from './6d_accessors.js';\nimport accessorbinary7d from './7d_accessors.js';\nimport accessorbinary8d from './8d_accessors.js';\nimport accessorbinary9d from './9d_accessors.js';\nimport accessorbinary10d from './10d_accessors.js';\nimport accessorbinarynd from './nd_accessors.js';\nimport binary0d from './0d.js';\nimport binary1d from './1d.js';\nimport binary2d from './2d.js';\nimport binary3d from './3d.js';\nimport binary4d from './4d.js';\nimport binary5d from './5d.js';\nimport binary6d from './6d.js';\nimport binary7d from './7d.js';\nimport binary8d from './8d.js';\nimport binary9d from './9d.js';\nimport binary10d from './10d.js';\nimport binarynd from './nd.js';\n\n\n// VARIABLES //\n\nvar BINARY = [\n\tbinary0d,\n\tbinary1d,\n\tbinary2d,\n\tbinary3d,\n\tbinary4d,\n\tbinary5d,\n\tbinary6d,\n\tbinary7d,\n\tbinary8d,\n\tbinary9d,\n\tbinary10d\n];\nvar ACCESSOR_BINARY = [\n\taccessorbinary0d,\n\taccessorbinary1d,\n\taccessorbinary2d,\n\taccessorbinary3d,\n\taccessorbinary4d,\n\taccessorbinary5d,\n\taccessorbinary6d,\n\taccessorbinary7d,\n\taccessorbinary8d,\n\taccessorbinary9d,\n\taccessorbinary10d\n];\nvar BLOCKED_BINARY = [\n\tblockedbinary2d, // 0\n\tblockedbinary3d,\n\tblockedbinary4d,\n\tblockedbinary5d,\n\tblockedbinary6d,\n\tblockedbinary7d,\n\tblockedbinary8d,\n\tblockedbinary9d,\n\tblockedbinary10d // 8\n];\nvar BLOCKED_ACCESSOR_BINARY = [\n\tblockedaccessorbinary2d, // 0\n\tblockedaccessorbinary3d,\n\tblockedaccessorbinary4d,\n\tblockedaccessorbinary5d,\n\tblockedaccessorbinary6d,\n\tblockedaccessorbinary7d,\n\tblockedaccessorbinary8d,\n\tblockedaccessorbinary9d,\n\tblockedaccessorbinary10d // 8\n];\nvar MAX_DIMS = BINARY.length - 1;\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating if at least one ndarray data buffer implements the accessor protocol.\n*\n* @private\n* @param {ndarrayLike} x - first ndarray\n* @param {ndarrayLike} y - second ndarray\n* @param {ndarrayLike} z - third ndarray\n* @returns {boolean} boolean indicating whether an ndarray data buffer implements the accessor protocol\n*/\nfunction hasAccessors( x, y, z ) {\n\treturn anyIsEntryIn( [ x, y, z ], 'accessorProtocol', true );\n}\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in input ndarrays and assigns results to elements in an output ndarray.\n*\n* ## Notes\n*\n* - Each provided ndarray should be an object with the following properties:\n*\n* - **dtype**: data type.\n* - **data**: data buffer.\n* - **shape**: dimensions.\n* - **strides**: stride lengths.\n* - **offset**: index offset.\n* - **order**: specifies whether an ndarray is row-major (C-style) or column major (Fortran-style).\n*\n* @param {ArrayLikeObject} arrays - array-like object containing two input arrays and one output array\n* @param {Callback} fcn - binary callback\n* @throws {Error} arrays must have the same number of dimensions\n* @throws {Error} arrays must have the same shape\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n* import ndarray from '@stdlib/ndarray-ctor';\n* import getData from '@stdlib/ndarray-data-buffer';\n*\n* function add( a, b ) {\n* return a + b;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] );\n* var zbuf = new Float64Array( 6 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 2, 1 ];\n* var sy = [ 2, 2, 1 ];\n* var sz = [ 2, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarrays:\n* var x = new ndarray( 'float64', xbuf, shape, sx, ox, 'row-major' );\n* var y = new ndarray( 'float64', ybuf, shape, sy, oy, 'row-major' );\n* var z = new ndarray( 'float64', zbuf, shape, sz, oz, 'row-major' );\n*\n* // Apply the binary function:\n* binary( [ x, y, z ], add );\n*\n* console.log( getData( z ) );\n* // => [ 2.0, 4.0, 6.0, 8.0, 10.0, 12.0 ]\n*/\nfunction binary( arrays, fcn ) { // eslint-disable-line max-statements\n\tvar ndims;\n\tvar xmmv;\n\tvar ymmv;\n\tvar zmmv;\n\tvar shx;\n\tvar shy;\n\tvar shz;\n\tvar iox;\n\tvar ioy;\n\tvar ioz;\n\tvar len;\n\tvar ord;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ns;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar d;\n\tvar i;\n\n\t// Unpack the ndarrays and standardize ndarray meta data:\n\tx = ndarray2object( arrays[ 0 ] );\n\ty = ndarray2object( arrays[ 1 ] );\n\tz = ndarray2object( arrays[ 2 ] );\n\n\t// Verify that the input and output arrays have the same number of dimensions...\n\tshx = x.shape;\n\tshy = y.shape;\n\tshz = z.shape;\n\tndims = shx.length;\n\tif ( ndims !== shy.length || ndims !== shz.length ) {\n\t\tthrow new Error( format( 'invalid arguments. Arrays must have the same number of dimensions (i.e., same rank). ndims(x) == %d. ndims(y) == %d. ndims(z) == %d.', ndims, shy.length, shz.length ) );\n\t}\n\t// Determine whether we can avoid iteration altogether...\n\tif ( ndims === 0 ) {\n\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\treturn ACCESSOR_BINARY[ ndims ]( x, y, z, fcn );\n\t\t}\n\t\treturn BINARY[ ndims ]( x, y, z, fcn );\n\t}\n\t// Verify that the input and output arrays have the same dimensions...\n\tlen = 1; // number of elements\n\tns = 0; // number of singleton dimensions\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\td = shx[ i ];\n\t\tif ( d !== shy[ i ] || d !== shz[ i ] ) {\n\t\t\tthrow new Error( format('null0d') );\n\t\t}\n\t\t// Note that, if one of the dimensions is `0`, the length will be `0`...\n\t\tlen *= d;\n\n\t\t// Check whether the current dimension is a singleton dimension...\n\t\tif ( d === 1 ) {\n\t\t\tns += 1;\n\t\t}\n\t}\n\t// Check whether we were provided empty ndarrays...\n\tif ( len === 0 ) {\n\t\treturn;\n\t}\n\t// Determine whether the ndarrays are one-dimensional and thus readily translate to one-dimensional strided arrays...\n\tif ( ndims === 1 ) {\n\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\treturn ACCESSOR_BINARY[ ndims ]( x, y, z, fcn );\n\t\t}\n\t\treturn BINARY[ ndims ]( x, y, z, fcn );\n\t}\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\n\t// Determine whether the ndarrays have only **one** non-singleton dimension (e.g., ndims=4, shape=[10,1,1,1]) so that we can treat the ndarrays as being equivalent to one-dimensional strided arrays...\n\tif ( ns === ndims-1 ) {\n\t\t// Get the index of the non-singleton dimension...\n\t\tfor ( i = 0; i < ndims; i++ ) {\n\t\t\tif ( shx[ i ] !== 1 ) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tx.shape = [ shx[i] ];\n\t\ty.shape = x.shape;\n\t\tz.shape = x.shape;\n\t\tx.strides = [ sx[i] ];\n\t\ty.strides = [ sy[i] ];\n\t\tz.strides = [ sz[i] ];\n\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\treturn ACCESSOR_BINARY[ 1 ]( x, y, z, fcn );\n\t\t}\n\t\treturn BINARY[ 1 ]( x, y, z, fcn );\n\t}\n\tiox = iterationOrder( sx ); // +/-1\n\tioy = iterationOrder( sy ); // +/-1\n\tioz = iterationOrder( sz ); // +/-1\n\n\t// Determine whether we can avoid blocked iteration...\n\tord = strides2order( sx );\n\tif ( iox !== 0 && ioy !== 0 && ioz !== 0 && ord === strides2order( sy ) && ord === strides2order( sz ) ) { // eslint-disable-line max-len\n\t\t// Determine the minimum and maximum linear indices which are accessible by the array views:\n\t\txmmv = minmaxViewBufferIndex( shx, sx, x.offset );\n\t\tymmv = minmaxViewBufferIndex( shy, sy, y.offset );\n\t\tzmmv = minmaxViewBufferIndex( shz, sz, z.offset );\n\n\t\t// Determine whether we can ignore shape (and strides) and treat the ndarrays as linear one-dimensional strided arrays...\n\t\tif (\n\t\t\tlen === ( xmmv[1]-xmmv[0]+1 ) &&\n\t\t\tlen === ( ymmv[1]-ymmv[0]+1 ) &&\n\t\t\tlen === ( zmmv[1]-zmmv[0]+1 )\n\t\t) {\n\t\t\t// Note: the above is equivalent to @stdlib/ndarray/base/assert/is-contiguous, but in-lined so we can retain computed values...\n\t\t\tif ( iox === 1 ) {\n\t\t\t\tox = xmmv[ 0 ];\n\t\t\t} else {\n\t\t\t\tox = xmmv[ 1 ];\n\t\t\t}\n\t\t\tif ( ioy === 1 ) {\n\t\t\t\toy = ymmv[ 0 ];\n\t\t\t} else {\n\t\t\t\toy = ymmv[ 1 ];\n\t\t\t}\n\t\t\tif ( ioz === 1 ) {\n\t\t\t\toz = zmmv[ 0 ];\n\t\t\t} else {\n\t\t\t\toz = zmmv[ 1 ];\n\t\t\t}\n\t\t\tx.shape = [ len ];\n\t\t\ty.shape = x.shape;\n\t\t\tz.shape = x.shape;\n\t\t\tx.strides = [ iox ];\n\t\t\ty.strides = [ ioy ];\n\t\t\tz.strides = [ ioz ];\n\t\t\tx.offset = ox;\n\t\t\ty.offset = oy;\n\t\t\tz.offset = oz;\n\t\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\t\treturn ACCESSOR_BINARY[ 1 ]( x, y, z, fcn );\n\t\t\t}\n\t\t\treturn BINARY[ 1 ]( x, y, z, fcn );\n\t\t}\n\t\t// At least one ndarray is non-contiguous, so we cannot directly use one-dimensional array functionality...\n\n\t\t// Determine whether we can use simple nested loops...\n\t\tif ( ndims <= MAX_DIMS ) {\n\t\t\t// So long as iteration for each respective array always moves in the same direction (i.e., no mixed sign strides), we can leverage cache-optimal (i.e., normal) nested loops without resorting to blocked iteration...\n\t\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\t\treturn ACCESSOR_BINARY[ ndims ]( x, y, z, ord === 1, fcn );\n\t\t\t}\n\t\t\treturn BINARY[ ndims ]( x, y, z, ord === 1, fcn );\n\t\t}\n\t\t// Fall-through to blocked iteration...\n\t}\n\t// At this point, we're either dealing with non-contiguous n-dimensional arrays, high dimensional n-dimensional arrays, and/or arrays having differing memory layouts, so our only hope is that we can still perform blocked iteration...\n\n\t// Determine whether we can perform blocked iteration...\n\tif ( ndims <= MAX_DIMS ) {\n\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\treturn BLOCKED_ACCESSOR_BINARY[ ndims-2 ]( x, y, z, fcn );\n\t\t}\n\t\treturn BLOCKED_BINARY[ ndims-2 ]( x, y, z, fcn );\n\t}\n\t// Fall-through to linear view iteration without regard for how data is stored in memory (i.e., take the slow path)...\n\tif ( hasAccessors( x, y, z ) ) {\n\t\treturn accessorbinarynd( x, y, z, fcn );\n\t}\n\tbinarynd( x, y, z, fcn );\n}\n\n\n// EXPORTS //\n\nexport default binary;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in zero-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0 ] );\n* var ybuf = new Float64Array( [ 2.0 ] );\n* var zbuf = new Float64Array( [ 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [];\n*\n* // Define the array strides:\n* var sx = [ 0 ];\n* var sy = [ 0 ];\n* var sz = [ 0 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary0d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 3.0 ]\n*/\nfunction binary0d( x, y, z, fcn ) {\n\tz.data[ z.offset ] = fcn( x.data[ x.offset ], y.data[ y.offset ] );\n}\n\n\n// EXPORTS //\n\nexport default binary0d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in one-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 12 ];\n*\n* // Define the array strides:\n* var sx = [ 1 ];\n* var sy = [ 1 ];\n* var sz = [ 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary1d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary1d( x, y, z, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dy0;\n\tvar dz0;\n\tvar S0;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables: dimensions and loop offset (pointer) increments...\n\tS0 = x.shape[ 0 ];\n\tdx0 = x.strides[ 0 ];\n\tdy0 = y.strides[ 0 ];\n\tdz0 = z.strides[ 0 ];\n\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\tix += dx0;\n\t\tiy += dy0;\n\t\tiz += dz0;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary1d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 6, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary2d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary2d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dy0;\n\tvar dy1;\n\tvar dz0;\n\tvar dz1;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 1 ];\n\t\tS1 = sh[ 0 ];\n\t\tdx0 = sx[ 1 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 0 ] - ( S0*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 1 ];\n\t\tdy1 = sy[ 0 ] - ( S0*sy[1] );\n\t\tdz0 = sz[ 1 ];\n\t\tdz1 = sz[ 0 ] - ( S0*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\tix += dx0;\n\t\t\tiy += dy0;\n\t\t\tiz += dz0;\n\t\t}\n\t\tix += dx1;\n\t\tiy += dy1;\n\t\tiz += dz1;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in three-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n* var sy = [ 4, 2, 1 ];\n* var sz = [ 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary3d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary3d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 2 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 0 ];\n\t\tdx0 = sx[ 2 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[2] );\n\t\tdx2 = sx[ 0 ] - ( S1*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 2 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[2] );\n\t\tdy2 = sy[ 0 ] - ( S1*sy[1] );\n\t\tdz0 = sz[ 2 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[2] );\n\t\tdz2 = sz[ 0 ] - ( S1*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\tix += dx0;\n\t\t\t\tiy += dy0;\n\t\t\t\tiz += dz0;\n\t\t\t}\n\t\t\tix += dx1;\n\t\t\tiy += dy1;\n\t\t\tiz += dz1;\n\t\t}\n\t\tix += dx2;\n\t\tiy += dy2;\n\t\tiz += dz2;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in four-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary4d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary4d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 3 ];\n\t\tS1 = sh[ 2 ];\n\t\tS2 = sh[ 1 ];\n\t\tS3 = sh[ 0 ];\n\t\tdx0 = sx[ 3 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 2 ] - ( S0*sx[3] );\n\t\tdx2 = sx[ 1 ] - ( S1*sx[2] );\n\t\tdx3 = sx[ 0 ] - ( S2*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 3 ];\n\t\tdy1 = sy[ 2 ] - ( S0*sy[3] );\n\t\tdy2 = sy[ 1 ] - ( S1*sy[2] );\n\t\tdy3 = sy[ 0 ] - ( S2*sy[1] );\n\t\tdz0 = sz[ 3 ];\n\t\tdz1 = sz[ 2 ] - ( S0*sz[3] );\n\t\tdz2 = sz[ 1 ] - ( S1*sz[2] );\n\t\tdz3 = sz[ 0 ] - ( S2*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\tix += dx0;\n\t\t\t\t\tiy += dy0;\n\t\t\t\t\tiz += dz0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t\tiy += dy1;\n\t\t\t\tiz += dz1;\n\t\t\t}\n\t\t\tix += dx2;\n\t\t\tiy += dy2;\n\t\t\tiz += dz2;\n\t\t}\n\t\tix += dx3;\n\t\tiy += dy3;\n\t\tiz += dz3;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in five-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary5d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary5d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 4 ];\n\t\tS1 = sh[ 3 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 1 ];\n\t\tS4 = sh[ 0 ];\n\t\tdx0 = sx[ 4 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 3 ] - ( S0*sx[4] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[3] );\n\t\tdx3 = sx[ 1 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 0 ] - ( S3*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 4 ];\n\t\tdy1 = sy[ 3 ] - ( S0*sy[4] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[3] );\n\t\tdy3 = sy[ 1 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 0 ] - ( S3*sy[1] );\n\t\tdz0 = sz[ 4 ];\n\t\tdz1 = sz[ 3 ] - ( S0*sz[4] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[3] );\n\t\tdz3 = sz[ 1 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 0 ] - ( S3*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx1;\n\t\t\t\t\tiy += dy1;\n\t\t\t\t\tiz += dz1;\n\t\t\t\t}\n\t\t\t\tix += dx2;\n\t\t\t\tiy += dy2;\n\t\t\t\tiz += dz2;\n\t\t\t}\n\t\t\tix += dx3;\n\t\t\tiy += dy3;\n\t\t\tiz += dz3;\n\t\t}\n\t\tix += dx4;\n\t\tiy += dy4;\n\t\tiz += dz4;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in six-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary6d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary6d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 5 ];\n\t\tS1 = sh[ 4 ];\n\t\tS2 = sh[ 3 ];\n\t\tS3 = sh[ 2 ];\n\t\tS4 = sh[ 1 ];\n\t\tS5 = sh[ 0 ];\n\t\tdx0 = sx[ 5 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 4 ] - ( S0*sx[5] );\n\t\tdx2 = sx[ 3 ] - ( S1*sx[4] );\n\t\tdx3 = sx[ 2 ] - ( S2*sx[3] );\n\t\tdx4 = sx[ 1 ] - ( S3*sx[2] );\n\t\tdx5 = sx[ 0 ] - ( S4*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 5 ];\n\t\tdy1 = sy[ 4 ] - ( S0*sy[5] );\n\t\tdy2 = sy[ 3 ] - ( S1*sy[4] );\n\t\tdy3 = sy[ 2 ] - ( S2*sy[3] );\n\t\tdy4 = sy[ 1 ] - ( S3*sy[2] );\n\t\tdy5 = sy[ 0 ] - ( S4*sy[1] );\n\t\tdz0 = sz[ 5 ];\n\t\tdz1 = sz[ 4 ] - ( S0*sz[5] );\n\t\tdz2 = sz[ 3 ] - ( S1*sz[4] );\n\t\tdz3 = sz[ 2 ] - ( S2*sz[3] );\n\t\tdz4 = sz[ 1 ] - ( S3*sz[2] );\n\t\tdz5 = sz[ 0 ] - ( S4*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t\tiy += dy2;\n\t\t\t\t\tiz += dz2;\n\t\t\t\t}\n\t\t\t\tix += dx3;\n\t\t\t\tiy += dy3;\n\t\t\t\tiz += dz3;\n\t\t\t}\n\t\t\tix += dx4;\n\t\t\tiy += dy4;\n\t\t\tiz += dz4;\n\t\t}\n\t\tix += dx5;\n\t\tiy += dy5;\n\t\tiz += dz5;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in seven-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary7d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary7d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 6 ];\n\t\tS1 = sh[ 5 ];\n\t\tS2 = sh[ 4 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 2 ];\n\t\tS5 = sh[ 1 ];\n\t\tS6 = sh[ 0 ];\n\t\tdx0 = sx[ 6 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 5 ] - ( S0*sx[6] );\n\t\tdx2 = sx[ 4 ] - ( S1*sx[5] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[4] );\n\t\tdx4 = sx[ 2 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 1 ] - ( S4*sx[2] );\n\t\tdx6 = sx[ 0 ] - ( S5*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 6 ];\n\t\tdy1 = sy[ 5 ] - ( S0*sy[6] );\n\t\tdy2 = sy[ 4 ] - ( S1*sy[5] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[4] );\n\t\tdy4 = sy[ 2 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 1 ] - ( S4*sy[2] );\n\t\tdy6 = sy[ 0 ] - ( S5*sy[1] );\n\t\tdz0 = sz[ 6 ];\n\t\tdz1 = sz[ 5 ] - ( S0*sz[6] );\n\t\tdz2 = sz[ 4 ] - ( S1*sz[5] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[4] );\n\t\tdz4 = sz[ 2 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 1 ] - ( S4*sz[2] );\n\t\tdz6 = sz[ 0 ] - ( S5*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx3;\n\t\t\t\t\tiy += dy3;\n\t\t\t\t\tiz += dz3;\n\t\t\t\t}\n\t\t\t\tix += dx4;\n\t\t\t\tiy += dy4;\n\t\t\t\tiz += dz4;\n\t\t\t}\n\t\t\tix += dx5;\n\t\t\tiy += dy5;\n\t\t\tiz += dz5;\n\t\t}\n\t\tix += dx6;\n\t\tiy += dy6;\n\t\tiz += dz6;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in eight-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary8d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary8d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 7 ];\n\t\tS1 = sh[ 6 ];\n\t\tS2 = sh[ 5 ];\n\t\tS3 = sh[ 4 ];\n\t\tS4 = sh[ 3 ];\n\t\tS5 = sh[ 2 ];\n\t\tS6 = sh[ 1 ];\n\t\tS7 = sh[ 0 ];\n\t\tdx0 = sx[ 7 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 6 ] - ( S0*sx[7] );\n\t\tdx2 = sx[ 5 ] - ( S1*sx[6] );\n\t\tdx3 = sx[ 4 ] - ( S2*sx[5] );\n\t\tdx4 = sx[ 3 ] - ( S3*sx[4] );\n\t\tdx5 = sx[ 2 ] - ( S4*sx[3] );\n\t\tdx6 = sx[ 1 ] - ( S5*sx[2] );\n\t\tdx7 = sx[ 0 ] - ( S6*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 7 ];\n\t\tdy1 = sy[ 6 ] - ( S0*sy[7] );\n\t\tdy2 = sy[ 5 ] - ( S1*sy[6] );\n\t\tdy3 = sy[ 4 ] - ( S2*sy[5] );\n\t\tdy4 = sy[ 3 ] - ( S3*sy[4] );\n\t\tdy5 = sy[ 2 ] - ( S4*sy[3] );\n\t\tdy6 = sy[ 1 ] - ( S5*sy[2] );\n\t\tdy7 = sy[ 0 ] - ( S6*sy[1] );\n\t\tdz0 = sz[ 7 ];\n\t\tdz1 = sz[ 6 ] - ( S0*sz[7] );\n\t\tdz2 = sz[ 5 ] - ( S1*sz[6] );\n\t\tdz3 = sz[ 4 ] - ( S2*sz[5] );\n\t\tdz4 = sz[ 3 ] - ( S3*sz[4] );\n\t\tdz5 = sz[ 2 ] - ( S4*sz[3] );\n\t\tdz6 = sz[ 1 ] - ( S5*sz[2] );\n\t\tdz7 = sz[ 0 ] - ( S6*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] );\n\t\tdx7 = sx[ 7 ] - ( S6*sx[6] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdy7 = sy[ 7 ] - ( S6*sy[6] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t\tdz7 = sz[ 7 ] - ( S6*sz[6] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx4;\n\t\t\t\t\tiy += dy4;\n\t\t\t\t\tiz += dz4;\n\t\t\t\t}\n\t\t\t\tix += dx5;\n\t\t\t\tiy += dy5;\n\t\t\t\tiz += dz5;\n\t\t\t}\n\t\t\tix += dx6;\n\t\t\tiy += dy6;\n\t\t\tiz += dz6;\n\t\t}\n\t\tix += dx7;\n\t\tiy += dy7;\n\t\tiz += dz7;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements, max-len */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in nine-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary9d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary9d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar S8;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 8 ];\n\t\tS1 = sh[ 7 ];\n\t\tS2 = sh[ 6 ];\n\t\tS3 = sh[ 5 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 3 ];\n\t\tS6 = sh[ 2 ];\n\t\tS7 = sh[ 1 ];\n\t\tS8 = sh[ 0 ];\n\t\tdx0 = sx[ 8 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 7 ] - ( S0*sx[8] );\n\t\tdx2 = sx[ 6 ] - ( S1*sx[7] );\n\t\tdx3 = sx[ 5 ] - ( S2*sx[6] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[5] );\n\t\tdx5 = sx[ 3 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 2 ] - ( S5*sx[3] );\n\t\tdx7 = sx[ 1 ] - ( S6*sx[2] );\n\t\tdx8 = sx[ 0 ] - ( S7*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 8 ];\n\t\tdy1 = sy[ 7 ] - ( S0*sy[8] );\n\t\tdy2 = sy[ 6 ] - ( S1*sy[7] );\n\t\tdy3 = sy[ 5 ] - ( S2*sy[6] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[5] );\n\t\tdy5 = sy[ 3 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 2 ] - ( S5*sy[3] );\n\t\tdy7 = sy[ 1 ] - ( S6*sy[2] );\n\t\tdy8 = sy[ 0 ] - ( S7*sy[1] );\n\t\tdz0 = sz[ 8 ];\n\t\tdz1 = sz[ 7 ] - ( S0*sz[8] );\n\t\tdz2 = sz[ 6 ] - ( S1*sz[7] );\n\t\tdz3 = sz[ 5 ] - ( S2*sz[6] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[5] );\n\t\tdz5 = sz[ 3 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 2 ] - ( S5*sz[3] );\n\t\tdz7 = sz[ 1 ] - ( S6*sz[2] );\n\t\tdz8 = sz[ 0 ] - ( S7*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tS8 = sh[ 8 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] );\n\t\tdx7 = sx[ 7 ] - ( S6*sx[6] );\n\t\tdx8 = sx[ 8 ] - ( S7*sx[7] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdy7 = sy[ 7 ] - ( S6*sy[6] );\n\t\tdy8 = sy[ 8 ] - ( S7*sy[7] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t\tdz7 = sz[ 7 ] - ( S6*sz[6] );\n\t\tdz8 = sz[ 8 ] - ( S7*sz[7] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i8 = 0; i8 < S8; i8++ ) {\n\t\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx5;\n\t\t\t\t\tiy += dy5;\n\t\t\t\t\tiz += dz5;\n\t\t\t\t}\n\t\t\t\tix += dx6;\n\t\t\t\tiy += dy6;\n\t\t\t\tiz += dz6;\n\t\t\t}\n\t\t\tix += dx7;\n\t\t\tiy += dy7;\n\t\t\tiz += dz7;\n\t\t}\n\t\tix += dx8;\n\t\tiy += dy8;\n\t\tiz += dz8;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements, max-len, max-lines-per-function */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in ten-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* binary10d( x, y, z, true, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary10d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dx9;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dy9;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar dz9;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar S8;\n\tvar S9;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar i9;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 9 ];\n\t\tS1 = sh[ 8 ];\n\t\tS2 = sh[ 7 ];\n\t\tS3 = sh[ 6 ];\n\t\tS4 = sh[ 5 ];\n\t\tS5 = sh[ 4 ];\n\t\tS6 = sh[ 3 ];\n\t\tS7 = sh[ 2 ];\n\t\tS8 = sh[ 1 ];\n\t\tS9 = sh[ 0 ];\n\t\tdx0 = sx[ 9 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 8 ] - ( S0*sx[9] );\n\t\tdx2 = sx[ 7 ] - ( S1*sx[8] );\n\t\tdx3 = sx[ 6 ] - ( S2*sx[7] );\n\t\tdx4 = sx[ 5 ] - ( S3*sx[6] );\n\t\tdx5 = sx[ 4 ] - ( S4*sx[5] );\n\t\tdx6 = sx[ 3 ] - ( S5*sx[4] );\n\t\tdx7 = sx[ 2 ] - ( S6*sx[3] );\n\t\tdx8 = sx[ 1 ] - ( S7*sx[2] );\n\t\tdx9 = sx[ 0 ] - ( S8*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 9 ];\n\t\tdy1 = sy[ 8 ] - ( S0*sy[9] );\n\t\tdy2 = sy[ 7 ] - ( S1*sy[8] );\n\t\tdy3 = sy[ 6 ] - ( S2*sy[7] );\n\t\tdy4 = sy[ 5 ] - ( S3*sy[6] );\n\t\tdy5 = sy[ 4 ] - ( S4*sy[5] );\n\t\tdy6 = sy[ 3 ] - ( S5*sy[4] );\n\t\tdy7 = sy[ 2 ] - ( S6*sy[3] );\n\t\tdy8 = sy[ 1 ] - ( S7*sy[2] );\n\t\tdy9 = sy[ 0 ] - ( S8*sy[1] );\n\t\tdz0 = sz[ 9 ];\n\t\tdz1 = sz[ 8 ] - ( S0*sz[9] );\n\t\tdz2 = sz[ 7 ] - ( S1*sz[8] );\n\t\tdz3 = sz[ 6 ] - ( S2*sz[7] );\n\t\tdz4 = sz[ 5 ] - ( S3*sz[6] );\n\t\tdz5 = sz[ 4 ] - ( S4*sz[5] );\n\t\tdz6 = sz[ 3 ] - ( S5*sz[4] );\n\t\tdz7 = sz[ 2 ] - ( S6*sz[3] );\n\t\tdz8 = sz[ 1 ] - ( S7*sz[2] );\n\t\tdz9 = sz[ 0 ] - ( S8*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tS8 = sh[ 8 ];\n\t\tS9 = sh[ 9 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] );\n\t\tdx7 = sx[ 7 ] - ( S6*sx[6] );\n\t\tdx8 = sx[ 8 ] - ( S7*sx[7] );\n\t\tdx9 = sx[ 9 ] - ( S8*sx[8] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdy7 = sy[ 7 ] - ( S6*sy[6] );\n\t\tdy8 = sy[ 8 ] - ( S7*sy[7] );\n\t\tdy9 = sy[ 9 ] - ( S8*sy[8] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t\tdz7 = sz[ 7 ] - ( S6*sz[6] );\n\t\tdz8 = sz[ 8 ] - ( S7*sz[7] );\n\t\tdz9 = sz[ 9 ] - ( S8*sz[8] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i9 = 0; i9 < S9; i9++ ) {\n\t\tfor ( i8 = 0; i8 < S8; i8++ ) {\n\t\t\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\t\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx6;\n\t\t\t\t\tiy += dy6;\n\t\t\t\t\tiz += dz6;\n\t\t\t\t}\n\t\t\t\tix += dx7;\n\t\t\t\tiy += dy7;\n\t\t\t\tiz += dz7;\n\t\t\t}\n\t\t\tix += dx8;\n\t\t\tiy += dy8;\n\t\t\tiz += dz8;\n\t\t}\n\t\tix += dx9;\n\t\tiy += dy9;\n\t\tiz += dz9;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary10d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in zero-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0 ] );\n* var ybuf = toAccessorArray( [ 2.0 ] );\n* var zbuf = toAccessorArray( [ 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [];\n*\n* // Define the array strides:\n* var sx = [ 0 ];\n* var sy = [ 0 ];\n* var sz = [ 0 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary0d( x, y, z, fcn );\n*\n* var v = z.data.get( 0 );\n* // returns 3.0\n*/\nfunction binary0d( x, y, z, fcn ) {\n\tz.accessors[ 1 ]( z.data, z.offset, fcn( x.accessors[ 0 ]( x.data, x.offset ), y.accessors[ 0 ]( y.data, y.offset ) ) ); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nexport default binary0d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in one-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 12 ];\n*\n* // Define the array strides:\n* var sx = [ 1 ];\n* var sy = [ 1 ];\n* var sz = [ 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary1d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary1d( x, y, z, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dy0;\n\tvar dz0;\n\tvar S0;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables: dimensions and loop offset (pointer) increments...\n\tS0 = x.shape[ 0 ];\n\tdx0 = x.strides[ 0 ];\n\tdy0 = y.strides[ 0 ];\n\tdz0 = z.strides[ 0 ];\n\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\tix += dx0;\n\t\tiy += dy0;\n\t\tiz += dz0;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary1d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 6, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary2d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary2d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dy0;\n\tvar dy1;\n\tvar dz0;\n\tvar dz1;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 1 ];\n\t\tS1 = sh[ 0 ];\n\t\tdx0 = sx[ 1 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 0 ] - ( S0*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 1 ];\n\t\tdy1 = sy[ 0 ] - ( S0*sy[1] );\n\t\tdz0 = sz[ 1 ];\n\t\tdz1 = sz[ 0 ] - ( S0*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\tix += dx0;\n\t\t\tiy += dy0;\n\t\t\tiz += dz0;\n\t\t}\n\t\tix += dx1;\n\t\tiy += dy1;\n\t\tiz += dz1;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in three-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n* var sy = [ 4, 2, 1 ];\n* var sz = [ 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary3d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary3d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 2 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 0 ];\n\t\tdx0 = sx[ 2 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[2] );\n\t\tdx2 = sx[ 0 ] - ( S1*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 2 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[2] );\n\t\tdy2 = sy[ 0 ] - ( S1*sy[1] );\n\t\tdz0 = sz[ 2 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[2] );\n\t\tdz2 = sz[ 0 ] - ( S1*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\tix += dx0;\n\t\t\t\tiy += dy0;\n\t\t\t\tiz += dz0;\n\t\t\t}\n\t\t\tix += dx1;\n\t\t\tiy += dy1;\n\t\t\tiz += dz1;\n\t\t}\n\t\tix += dx2;\n\t\tiy += dy2;\n\t\tiz += dz2;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in four-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary4d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary4d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 3 ];\n\t\tS1 = sh[ 2 ];\n\t\tS2 = sh[ 1 ];\n\t\tS3 = sh[ 0 ];\n\t\tdx0 = sx[ 3 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 2 ] - ( S0*sx[3] );\n\t\tdx2 = sx[ 1 ] - ( S1*sx[2] );\n\t\tdx3 = sx[ 0 ] - ( S2*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 3 ];\n\t\tdy1 = sy[ 2 ] - ( S0*sy[3] );\n\t\tdy2 = sy[ 1 ] - ( S1*sy[2] );\n\t\tdy3 = sy[ 0 ] - ( S2*sy[1] );\n\t\tdz0 = sz[ 3 ];\n\t\tdz1 = sz[ 2 ] - ( S0*sz[3] );\n\t\tdz2 = sz[ 1 ] - ( S1*sz[2] );\n\t\tdz3 = sz[ 0 ] - ( S2*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\tix += dx0;\n\t\t\t\t\tiy += dy0;\n\t\t\t\t\tiz += dz0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t\tiy += dy1;\n\t\t\t\tiz += dz1;\n\t\t\t}\n\t\t\tix += dx2;\n\t\t\tiy += dy2;\n\t\t\tiz += dz2;\n\t\t}\n\t\tix += dx3;\n\t\tiy += dy3;\n\t\tiz += dz3;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-len, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in five-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary5d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary5d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 4 ];\n\t\tS1 = sh[ 3 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 1 ];\n\t\tS4 = sh[ 0 ];\n\t\tdx0 = sx[ 4 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 3 ] - ( S0*sx[4] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[3] );\n\t\tdx3 = sx[ 1 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 0 ] - ( S3*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 4 ];\n\t\tdy1 = sy[ 3 ] - ( S0*sy[4] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[3] );\n\t\tdy3 = sy[ 1 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 0 ] - ( S3*sy[1] );\n\t\tdz0 = sz[ 4 ];\n\t\tdz1 = sz[ 3 ] - ( S0*sz[4] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[3] );\n\t\tdz3 = sz[ 1 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 0 ] - ( S3*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx1;\n\t\t\t\t\tiy += dy1;\n\t\t\t\t\tiz += dz1;\n\t\t\t\t}\n\t\t\t\tix += dx2;\n\t\t\t\tiy += dy2;\n\t\t\t\tiz += dz2;\n\t\t\t}\n\t\t\tix += dx3;\n\t\t\tiy += dy3;\n\t\t\tiz += dz3;\n\t\t}\n\t\tix += dx4;\n\t\tiy += dy4;\n\t\tiz += dz4;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in six-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary6d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary6d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 5 ];\n\t\tS1 = sh[ 4 ];\n\t\tS2 = sh[ 3 ];\n\t\tS3 = sh[ 2 ];\n\t\tS4 = sh[ 1 ];\n\t\tS5 = sh[ 0 ];\n\t\tdx0 = sx[ 5 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 4 ] - ( S0*sx[5] );\n\t\tdx2 = sx[ 3 ] - ( S1*sx[4] );\n\t\tdx3 = sx[ 2 ] - ( S2*sx[3] );\n\t\tdx4 = sx[ 1 ] - ( S3*sx[2] );\n\t\tdx5 = sx[ 0 ] - ( S4*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 5 ];\n\t\tdy1 = sy[ 4 ] - ( S0*sy[5] );\n\t\tdy2 = sy[ 3 ] - ( S1*sy[4] );\n\t\tdy3 = sy[ 2 ] - ( S2*sy[3] );\n\t\tdy4 = sy[ 1 ] - ( S3*sy[2] );\n\t\tdy5 = sy[ 0 ] - ( S4*sy[1] );\n\t\tdz0 = sz[ 5 ];\n\t\tdz1 = sz[ 4 ] - ( S0*sz[5] );\n\t\tdz2 = sz[ 3 ] - ( S1*sz[4] );\n\t\tdz3 = sz[ 2 ] - ( S2*sz[3] );\n\t\tdz4 = sz[ 1 ] - ( S3*sz[2] );\n\t\tdz5 = sz[ 0 ] - ( S4*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t\tiy += dy2;\n\t\t\t\t\tiz += dz2;\n\t\t\t\t}\n\t\t\t\tix += dx3;\n\t\t\t\tiy += dy3;\n\t\t\t\tiz += dz3;\n\t\t\t}\n\t\t\tix += dx4;\n\t\t\tiy += dy4;\n\t\t\tiz += dz4;\n\t\t}\n\t\tix += dx5;\n\t\tiy += dy5;\n\t\tiz += dz5;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in seven-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary7d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary7d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 6 ];\n\t\tS1 = sh[ 5 ];\n\t\tS2 = sh[ 4 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 2 ];\n\t\tS5 = sh[ 1 ];\n\t\tS6 = sh[ 0 ];\n\t\tdx0 = sx[ 6 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 5 ] - ( S0*sx[6] );\n\t\tdx2 = sx[ 4 ] - ( S1*sx[5] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[4] );\n\t\tdx4 = sx[ 2 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 1 ] - ( S4*sx[2] );\n\t\tdx6 = sx[ 0 ] - ( S5*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 6 ];\n\t\tdy1 = sy[ 5 ] - ( S0*sy[6] );\n\t\tdy2 = sy[ 4 ] - ( S1*sy[5] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[4] );\n\t\tdy4 = sy[ 2 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 1 ] - ( S4*sy[2] );\n\t\tdy6 = sy[ 0 ] - ( S5*sy[1] );\n\t\tdz0 = sz[ 6 ];\n\t\tdz1 = sz[ 5 ] - ( S0*sz[6] );\n\t\tdz2 = sz[ 4 ] - ( S1*sz[5] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[4] );\n\t\tdz4 = sz[ 2 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 1 ] - ( S4*sz[2] );\n\t\tdz6 = sz[ 0 ] - ( S5*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx3;\n\t\t\t\t\tiy += dy3;\n\t\t\t\t\tiz += dz3;\n\t\t\t\t}\n\t\t\t\tix += dx4;\n\t\t\t\tiy += dy4;\n\t\t\t\tiz += dz4;\n\t\t\t}\n\t\t\tix += dx5;\n\t\t\tiy += dy5;\n\t\t\tiz += dz5;\n\t\t}\n\t\tix += dx6;\n\t\tiy += dy6;\n\t\tiz += dz6;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in eight-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary8d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary8d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 7 ];\n\t\tS1 = sh[ 6 ];\n\t\tS2 = sh[ 5 ];\n\t\tS3 = sh[ 4 ];\n\t\tS4 = sh[ 3 ];\n\t\tS5 = sh[ 2 ];\n\t\tS6 = sh[ 1 ];\n\t\tS7 = sh[ 0 ];\n\t\tdx0 = sx[ 7 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 6 ] - ( S0*sx[7] );\n\t\tdx2 = sx[ 5 ] - ( S1*sx[6] );\n\t\tdx3 = sx[ 4 ] - ( S2*sx[5] );\n\t\tdx4 = sx[ 3 ] - ( S3*sx[4] );\n\t\tdx5 = sx[ 2 ] - ( S4*sx[3] );\n\t\tdx6 = sx[ 1 ] - ( S5*sx[2] );\n\t\tdx7 = sx[ 0 ] - ( S6*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 7 ];\n\t\tdy1 = sy[ 6 ] - ( S0*sy[7] );\n\t\tdy2 = sy[ 5 ] - ( S1*sy[6] );\n\t\tdy3 = sy[ 4 ] - ( S2*sy[5] );\n\t\tdy4 = sy[ 3 ] - ( S3*sy[4] );\n\t\tdy5 = sy[ 2 ] - ( S4*sy[3] );\n\t\tdy6 = sy[ 1 ] - ( S5*sy[2] );\n\t\tdy7 = sy[ 0 ] - ( S6*sy[1] );\n\t\tdz0 = sz[ 7 ];\n\t\tdz1 = sz[ 6 ] - ( S0*sz[7] );\n\t\tdz2 = sz[ 5 ] - ( S1*sz[6] );\n\t\tdz3 = sz[ 4 ] - ( S2*sz[5] );\n\t\tdz4 = sz[ 3 ] - ( S3*sz[4] );\n\t\tdz5 = sz[ 2 ] - ( S4*sz[3] );\n\t\tdz6 = sz[ 1 ] - ( S5*sz[2] );\n\t\tdz7 = sz[ 0 ] - ( S6*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] );\n\t\tdx7 = sx[ 7 ] - ( S6*sx[6] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdy7 = sy[ 7 ] - ( S6*sy[6] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t\tdz7 = sz[ 7 ] - ( S6*sz[6] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx4;\n\t\t\t\t\tiy += dy4;\n\t\t\t\t\tiz += dz4;\n\t\t\t\t}\n\t\t\t\tix += dx5;\n\t\t\t\tiy += dy5;\n\t\t\t\tiz += dz5;\n\t\t\t}\n\t\t\tix += dx6;\n\t\t\tiy += dy6;\n\t\t\tiz += dz6;\n\t\t}\n\t\tix += dx7;\n\t\tiy += dy7;\n\t\tiz += dz7;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in nine-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary9d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary9d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar S8;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 8 ];\n\t\tS1 = sh[ 7 ];\n\t\tS2 = sh[ 6 ];\n\t\tS3 = sh[ 5 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 3 ];\n\t\tS6 = sh[ 2 ];\n\t\tS7 = sh[ 1 ];\n\t\tS8 = sh[ 0 ];\n\t\tdx0 = sx[ 8 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 7 ] - ( S0*sx[8] );\n\t\tdx2 = sx[ 6 ] - ( S1*sx[7] );\n\t\tdx3 = sx[ 5 ] - ( S2*sx[6] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[5] );\n\t\tdx5 = sx[ 3 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 2 ] - ( S5*sx[3] );\n\t\tdx7 = sx[ 1 ] - ( S6*sx[2] );\n\t\tdx8 = sx[ 0 ] - ( S7*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 8 ];\n\t\tdy1 = sy[ 7 ] - ( S0*sy[8] );\n\t\tdy2 = sy[ 6 ] - ( S1*sy[7] );\n\t\tdy3 = sy[ 5 ] - ( S2*sy[6] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[5] );\n\t\tdy5 = sy[ 3 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 2 ] - ( S5*sy[3] );\n\t\tdy7 = sy[ 1 ] - ( S6*sy[2] );\n\t\tdy8 = sy[ 0 ] - ( S7*sy[1] );\n\t\tdz0 = sz[ 8 ];\n\t\tdz1 = sz[ 7 ] - ( S0*sz[8] );\n\t\tdz2 = sz[ 6 ] - ( S1*sz[7] );\n\t\tdz3 = sz[ 5 ] - ( S2*sz[6] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[5] );\n\t\tdz5 = sz[ 3 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 2 ] - ( S5*sz[3] );\n\t\tdz7 = sz[ 1 ] - ( S6*sz[2] );\n\t\tdz8 = sz[ 0 ] - ( S7*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tS8 = sh[ 8 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] );\n\t\tdx7 = sx[ 7 ] - ( S6*sx[6] );\n\t\tdx8 = sx[ 8 ] - ( S7*sx[7] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdy7 = sy[ 7 ] - ( S6*sy[6] );\n\t\tdy8 = sy[ 8 ] - ( S7*sy[7] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t\tdz7 = sz[ 7 ] - ( S6*sz[6] );\n\t\tdz8 = sz[ 8 ] - ( S7*sz[7] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i8 = 0; i8 < S8; i8++ ) {\n\t\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx5;\n\t\t\t\t\tiy += dy5;\n\t\t\t\t\tiz += dz5;\n\t\t\t\t}\n\t\t\t\tix += dx6;\n\t\t\t\tiy += dy6;\n\t\t\t\tiz += dz6;\n\t\t\t}\n\t\t\tix += dx7;\n\t\t\tiy += dy7;\n\t\t\tiz += dz7;\n\t\t}\n\t\tix += dx8;\n\t\tiy += dy8;\n\t\tiz += dz8;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in ten-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* binary10d( x, y, z, true, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction binary10d( x, y, z, isRowMajor, fcn ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dx9;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dy9;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar dz9;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar S8;\n\tvar S9;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar i9;\n\n\t// Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tsh = x.shape;\n\tsx = x.strides;\n\tsy = y.strides;\n\tsz = z.strides;\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 9 ];\n\t\tS1 = sh[ 8 ];\n\t\tS2 = sh[ 7 ];\n\t\tS3 = sh[ 6 ];\n\t\tS4 = sh[ 5 ];\n\t\tS5 = sh[ 4 ];\n\t\tS6 = sh[ 3 ];\n\t\tS7 = sh[ 2 ];\n\t\tS8 = sh[ 1 ];\n\t\tS9 = sh[ 0 ];\n\t\tdx0 = sx[ 9 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 8 ] - ( S0*sx[9] );\n\t\tdx2 = sx[ 7 ] - ( S1*sx[8] );\n\t\tdx3 = sx[ 6 ] - ( S2*sx[7] );\n\t\tdx4 = sx[ 5 ] - ( S3*sx[6] );\n\t\tdx5 = sx[ 4 ] - ( S4*sx[5] );\n\t\tdx6 = sx[ 3 ] - ( S5*sx[4] );\n\t\tdx7 = sx[ 2 ] - ( S6*sx[3] );\n\t\tdx8 = sx[ 1 ] - ( S7*sx[2] );\n\t\tdx9 = sx[ 0 ] - ( S8*sx[1] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 9 ];\n\t\tdy1 = sy[ 8 ] - ( S0*sy[9] );\n\t\tdy2 = sy[ 7 ] - ( S1*sy[8] );\n\t\tdy3 = sy[ 6 ] - ( S2*sy[7] );\n\t\tdy4 = sy[ 5 ] - ( S3*sy[6] );\n\t\tdy5 = sy[ 4 ] - ( S4*sy[5] );\n\t\tdy6 = sy[ 3 ] - ( S5*sy[4] );\n\t\tdy7 = sy[ 2 ] - ( S6*sy[3] );\n\t\tdy8 = sy[ 1 ] - ( S7*sy[2] );\n\t\tdy9 = sy[ 0 ] - ( S8*sy[1] );\n\t\tdz0 = sz[ 9 ];\n\t\tdz1 = sz[ 8 ] - ( S0*sz[9] );\n\t\tdz2 = sz[ 7 ] - ( S1*sz[8] );\n\t\tdz3 = sz[ 6 ] - ( S2*sz[7] );\n\t\tdz4 = sz[ 5 ] - ( S3*sz[6] );\n\t\tdz5 = sz[ 4 ] - ( S4*sz[5] );\n\t\tdz6 = sz[ 3 ] - ( S5*sz[4] );\n\t\tdz7 = sz[ 2 ] - ( S6*sz[3] );\n\t\tdz8 = sz[ 1 ] - ( S7*sz[2] );\n\t\tdz9 = sz[ 0 ] - ( S8*sz[1] );\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tS8 = sh[ 8 ];\n\t\tS9 = sh[ 9 ];\n\t\tdx0 = sx[ 0 ]; // offset increment for innermost loop\n\t\tdx1 = sx[ 1 ] - ( S0*sx[0] );\n\t\tdx2 = sx[ 2 ] - ( S1*sx[1] );\n\t\tdx3 = sx[ 3 ] - ( S2*sx[2] );\n\t\tdx4 = sx[ 4 ] - ( S3*sx[3] );\n\t\tdx5 = sx[ 5 ] - ( S4*sx[4] );\n\t\tdx6 = sx[ 6 ] - ( S5*sx[5] );\n\t\tdx7 = sx[ 7 ] - ( S6*sx[6] );\n\t\tdx8 = sx[ 8 ] - ( S7*sx[7] );\n\t\tdx9 = sx[ 9 ] - ( S8*sx[8] ); // offset increment for outermost loop\n\t\tdy0 = sy[ 0 ];\n\t\tdy1 = sy[ 1 ] - ( S0*sy[0] );\n\t\tdy2 = sy[ 2 ] - ( S1*sy[1] );\n\t\tdy3 = sy[ 3 ] - ( S2*sy[2] );\n\t\tdy4 = sy[ 4 ] - ( S3*sy[3] );\n\t\tdy5 = sy[ 5 ] - ( S4*sy[4] );\n\t\tdy6 = sy[ 6 ] - ( S5*sy[5] );\n\t\tdy7 = sy[ 7 ] - ( S6*sy[6] );\n\t\tdy8 = sy[ 8 ] - ( S7*sy[7] );\n\t\tdy9 = sy[ 9 ] - ( S8*sy[8] );\n\t\tdz0 = sz[ 0 ];\n\t\tdz1 = sz[ 1 ] - ( S0*sz[0] );\n\t\tdz2 = sz[ 2 ] - ( S1*sz[1] );\n\t\tdz3 = sz[ 3 ] - ( S2*sz[2] );\n\t\tdz4 = sz[ 4 ] - ( S3*sz[3] );\n\t\tdz5 = sz[ 5 ] - ( S4*sz[4] );\n\t\tdz6 = sz[ 6 ] - ( S5*sz[5] );\n\t\tdz7 = sz[ 7 ] - ( S6*sz[6] );\n\t\tdz8 = sz[ 8 ] - ( S7*sz[7] );\n\t\tdz9 = sz[ 9 ] - ( S8*sz[8] );\n\t}\n\t// Set the pointers to the first indexed elements in the respective ndarrays...\n\tix = x.offset;\n\tiy = y.offset;\n\tiz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\tzset = z.accessors[ 1 ];\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i9 = 0; i9 < S9; i9++ ) {\n\t\tfor ( i8 = 0; i8 < S8; i8++ ) {\n\t\t\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\t\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx6;\n\t\t\t\t\tiy += dy6;\n\t\t\t\t\tiz += dz6;\n\t\t\t\t}\n\t\t\t\tix += dx7;\n\t\t\t\tiy += dy7;\n\t\t\t\tiz += dz7;\n\t\t\t}\n\t\t\tix += dx8;\n\t\t\tiy += dy8;\n\t\t\tiz += dz8;\n\t\t}\n\t\tix += dx9;\n\t\tiy += dy9;\n\t\tiz += dz9;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default binary10d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 6, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary2d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary2d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dy0;\n\tvar dy1;\n\tvar dz0;\n\tvar dz1;\n\tvar ox1;\n\tvar oy1;\n\tvar oz1;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar j0;\n\tvar j1;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\tif ( j1 < bsize ) {\n\t\t\ts1 = j1;\n\t\t\tj1 = 0;\n\t\t} else {\n\t\t\ts1 = bsize;\n\t\t\tj1 -= bsize;\n\t\t}\n\t\tox1 = ox + ( j1*sx[1] );\n\t\toy1 = oy + ( j1*sy[1] );\n\t\toz1 = oz + ( j1*sz[1] );\n\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\tif ( j0 < bsize ) {\n\t\t\t\ts0 = j0;\n\t\t\t\tj0 = 0;\n\t\t\t} else {\n\t\t\t\ts0 = bsize;\n\t\t\t\tj0 -= bsize;\n\t\t\t}\n\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t// Compute loop offset increments...\n\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t// Iterate over the ndarray dimensions...\n\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\tix += dx0;\n\t\t\t\t\tiy += dy0;\n\t\t\t\t\tiz += dz0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t\tiy += dy1;\n\t\t\t\tiz += dz1;\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in three-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n* var sy = [ 4, 2, 1 ];\n* var sz = [ 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary3d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary3d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar ox1;\n\tvar ox2;\n\tvar oy1;\n\tvar oy2;\n\tvar oz1;\n\tvar oz2;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\tif ( j2 < bsize ) {\n\t\t\ts2 = j2;\n\t\t\tj2 = 0;\n\t\t} else {\n\t\t\ts2 = bsize;\n\t\t\tj2 -= bsize;\n\t\t}\n\t\tox2 = ox + ( j2*sx[2] );\n\t\toy2 = oy + ( j2*sy[2] );\n\t\toz2 = oz + ( j2*sz[2] );\n\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\tif ( j1 < bsize ) {\n\t\t\t\ts1 = j1;\n\t\t\t\tj1 = 0;\n\t\t\t} else {\n\t\t\t\ts1 = bsize;\n\t\t\t\tj1 -= bsize;\n\t\t\t}\n\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\ts0 = j0;\n\t\t\t\t\tj0 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts0 = bsize;\n\t\t\t\t\tj0 -= bsize;\n\t\t\t\t}\n\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t// Compute loop offset increments...\n\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t\tiy += dy2;\n\t\t\t\t\tiz += dz2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in four-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary4d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary4d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\tif ( j3 < bsize ) {\n\t\t\ts3 = j3;\n\t\t\tj3 = 0;\n\t\t} else {\n\t\t\ts3 = bsize;\n\t\t\tj3 -= bsize;\n\t\t}\n\t\tox3 = ox + ( j3*sx[3] );\n\t\toy3 = oy + ( j3*sy[3] );\n\t\toz3 = oz + ( j3*sz[3] );\n\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\tif ( j2 < bsize ) {\n\t\t\t\ts2 = j2;\n\t\t\t\tj2 = 0;\n\t\t\t} else {\n\t\t\t\ts2 = bsize;\n\t\t\t\tj2 -= bsize;\n\t\t\t}\n\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\ts1 = j1;\n\t\t\t\t\tj1 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts1 = bsize;\n\t\t\t\t\tj1 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-statements, max-len */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in five-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary5d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary5d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\tif ( j4 < bsize ) {\n\t\t\ts4 = j4;\n\t\t\tj4 = 0;\n\t\t} else {\n\t\t\ts4 = bsize;\n\t\t\tj4 -= bsize;\n\t\t}\n\t\tox4 = ox + ( j4*sx[4] );\n\t\toy4 = oy + ( j4*sy[4] );\n\t\toz4 = oz + ( j4*sz[4] );\n\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\tif ( j3 < bsize ) {\n\t\t\t\ts3 = j3;\n\t\t\t\tj3 = 0;\n\t\t\t} else {\n\t\t\t\ts3 = bsize;\n\t\t\t\tj3 -= bsize;\n\t\t\t}\n\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\ts2 = j2;\n\t\t\t\t\tj2 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts2 = bsize;\n\t\t\t\t\tj2 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in six-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary6d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary6d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\tif ( j5 < bsize ) {\n\t\t\ts5 = j5;\n\t\t\tj5 = 0;\n\t\t} else {\n\t\t\ts5 = bsize;\n\t\t\tj5 -= bsize;\n\t\t}\n\t\tox5 = ox + ( j5*sx[5] );\n\t\toy5 = oy + ( j5*sy[5] );\n\t\toz5 = oz + ( j5*sz[5] );\n\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\tif ( j4 < bsize ) {\n\t\t\t\ts4 = j4;\n\t\t\t\tj4 = 0;\n\t\t\t} else {\n\t\t\t\ts4 = bsize;\n\t\t\t\tj4 -= bsize;\n\t\t\t}\n\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\ts3 = j3;\n\t\t\t\t\tj3 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts3 = bsize;\n\t\t\t\t\tj3 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in seven-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary7d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary7d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\tif ( j6 < bsize ) {\n\t\t\ts6 = j6;\n\t\t\tj6 = 0;\n\t\t} else {\n\t\t\ts6 = bsize;\n\t\t\tj6 -= bsize;\n\t\t}\n\t\tox6 = ox + ( j6*sx[6] );\n\t\toy6 = oy + ( j6*sy[6] );\n\t\toz6 = oz + ( j6*sz[6] );\n\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\tif ( j5 < bsize ) {\n\t\t\t\ts5 = j5;\n\t\t\t\tj5 = 0;\n\t\t\t} else {\n\t\t\t\ts5 = bsize;\n\t\t\t\tj5 -= bsize;\n\t\t\t}\n\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\ts4 = j4;\n\t\t\t\t\tj4 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts4 = bsize;\n\t\t\t\t\tj4 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in eight-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary8d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary8d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oy7;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar oz7;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\tif ( j7 < bsize ) {\n\t\t\ts7 = j7;\n\t\t\tj7 = 0;\n\t\t} else {\n\t\t\ts7 = bsize;\n\t\t\tj7 -= bsize;\n\t\t}\n\t\tox7 = ox + ( j7*sx[7] );\n\t\toy7 = oy + ( j7*sy[7] );\n\t\toz7 = oz + ( j7*sz[7] );\n\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\tif ( j6 < bsize ) {\n\t\t\t\ts6 = j6;\n\t\t\t\tj6 = 0;\n\t\t\t} else {\n\t\t\t\ts6 = bsize;\n\t\t\t\tj6 -= bsize;\n\t\t\t}\n\t\t\tdx7 = sx[7] - ( s6*sx[6] );\n\t\t\tdy7 = sy[7] - ( s6*sy[6] );\n\t\t\tdz7 = sz[7] - ( s6*sz[6] );\n\t\t\tox6 = ox7 + ( j6*sx[6] );\n\t\t\toy6 = oy7 + ( j6*sy[6] );\n\t\t\toz6 = oz7 + ( j6*sz[6] );\n\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\ts5 = j5;\n\t\t\t\t\tj5 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts5 = bsize;\n\t\t\t\t\tj5 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx7;\n\t\t\t\t\t\t\t\t\t\tiy += dy7;\n\t\t\t\t\t\t\t\t\t\tiz += dz7;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in nine-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary9d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary9d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oy7;\n\tvar oy8;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar oz7;\n\tvar oz8;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar s8;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar j8;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j8 = sh[8]; j8 > 0; ) {\n\t\tif ( j8 < bsize ) {\n\t\t\ts8 = j8;\n\t\t\tj8 = 0;\n\t\t} else {\n\t\t\ts8 = bsize;\n\t\t\tj8 -= bsize;\n\t\t}\n\t\tox8 = ox + ( j8*sx[8] );\n\t\toy8 = oy + ( j8*sy[8] );\n\t\toz8 = oz + ( j8*sz[8] );\n\t\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\t\tif ( j7 < bsize ) {\n\t\t\t\ts7 = j7;\n\t\t\t\tj7 = 0;\n\t\t\t} else {\n\t\t\t\ts7 = bsize;\n\t\t\t\tj7 -= bsize;\n\t\t\t}\n\t\t\tdx8 = sx[8] - ( s7*sx[7] );\n\t\t\tdy8 = sy[8] - ( s7*sy[7] );\n\t\t\tdz8 = sz[8] - ( s7*sz[7] );\n\t\t\tox7 = ox8 + ( j7*sx[7] );\n\t\t\toy7 = oy8 + ( j7*sy[7] );\n\t\t\toz7 = oz8 + ( j7*sz[7] );\n\t\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\t\tif ( j6 < bsize ) {\n\t\t\t\t\ts6 = j6;\n\t\t\t\t\tj6 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts6 = bsize;\n\t\t\t\t\tj6 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx7 = sx[7] - ( s6*sx[6] );\n\t\t\t\tdy7 = sy[7] - ( s6*sy[6] );\n\t\t\t\tdz7 = sz[7] - ( s6*sz[6] );\n\t\t\t\tox6 = ox7 + ( j6*sx[6] );\n\t\t\t\toy6 = oy7 + ( j6*sy[6] );\n\t\t\t\toz6 = oz7 + ( j6*sz[6] );\n\t\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\t\ts5 = j5;\n\t\t\t\t\t\tj5 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts5 = bsize;\n\t\t\t\t\t\tj5 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\t\t\tfor ( i8 = 0; i8 < s8; i8++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx7;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy7;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz7;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx8;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy8;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz8;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function, max-lines */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in ten-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = new Float64Array( 12 );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'float64',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major'\n* };\n* var y = {\n* 'dtype': 'float64',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major'\n* };\n* var z = {\n* 'dtype': 'float64',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major'\n* };\n*\n* // Apply the binary function:\n* blockedbinary10d( x, y, z, fcn );\n*\n* console.log( z.data );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary10d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dx9;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dy9;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar dz9;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\n\tvar ox9;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oy7;\n\tvar oy8;\n\tvar oy9;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar oz7;\n\tvar oz8;\n\tvar oz9;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar s8;\n\tvar s9;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar i9;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar j8;\n\tvar j9;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Iterate over blocks...\n\tfor ( j9 = sh[9]; j9 > 0; ) {\n\t\tif ( j9 < bsize ) {\n\t\t\ts9 = j9;\n\t\t\tj9 = 0;\n\t\t} else {\n\t\t\ts9 = bsize;\n\t\t\tj9 -= bsize;\n\t\t}\n\t\tox9 = ox + ( j9*sx[9] );\n\t\toy9 = oy + ( j9*sy[9] );\n\t\toz9 = oz + ( j9*sz[9] );\n\t\tfor ( j8 = sh[8]; j8 > 0; ) {\n\t\t\tif ( j8 < bsize ) {\n\t\t\t\ts8 = j8;\n\t\t\t\tj8 = 0;\n\t\t\t} else {\n\t\t\t\ts8 = bsize;\n\t\t\t\tj8 -= bsize;\n\t\t\t}\n\t\t\tdx9 = sx[9] - ( s8*sx[8] );\n\t\t\tdy9 = sy[9] - ( s8*sy[8] );\n\t\t\tdz9 = sz[9] - ( s8*sz[8] );\n\t\t\tox8 = ox9 + ( j8*sx[8] );\n\t\t\toy8 = oy9 + ( j8*sy[8] );\n\t\t\toz8 = oz9 + ( j8*sz[8] );\n\t\t\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\t\t\tif ( j7 < bsize ) {\n\t\t\t\t\ts7 = j7;\n\t\t\t\t\tj7 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts7 = bsize;\n\t\t\t\t\tj7 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx8 = sx[8] - ( s7*sx[7] );\n\t\t\t\tdy8 = sy[8] - ( s7*sy[7] );\n\t\t\t\tdz8 = sz[8] - ( s7*sz[7] );\n\t\t\t\tox7 = ox8 + ( j7*sx[7] );\n\t\t\t\toy7 = oy8 + ( j7*sy[7] );\n\t\t\t\toz7 = oz8 + ( j7*sz[7] );\n\t\t\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\t\t\tif ( j6 < bsize ) {\n\t\t\t\t\t\ts6 = j6;\n\t\t\t\t\t\tj6 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts6 = bsize;\n\t\t\t\t\t\tj6 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx7 = sx[7] - ( s6*sx[6] );\n\t\t\t\t\tdy7 = sy[7] - ( s6*sy[6] );\n\t\t\t\t\tdz7 = sz[7] - ( s6*sz[6] );\n\t\t\t\t\tox6 = ox7 + ( j6*sx[6] );\n\t\t\t\t\toy6 = oy7 + ( j6*sy[6] );\n\t\t\t\t\toz6 = oz7 + ( j6*sz[6] );\n\t\t\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\t\t\ts5 = j5;\n\t\t\t\t\t\t\tj5 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts5 = bsize;\n\t\t\t\t\t\t\tj5 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\t\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\t\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\t\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\t\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\t\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\t\t\t\tfor ( i9 = 0; i9 < s9; i9++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i8 = 0; i8 < s8; i8++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx7;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy7;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz7;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx8;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy8;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz8;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx9;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy9;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz9;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary10d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 6, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary2d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary2d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dy0;\n\tvar dy1;\n\tvar dz0;\n\tvar dz1;\n\tvar ox1;\n\tvar oy1;\n\tvar oz1;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar j0;\n\tvar j1;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\tif ( j1 < bsize ) {\n\t\t\ts1 = j1;\n\t\t\tj1 = 0;\n\t\t} else {\n\t\t\ts1 = bsize;\n\t\t\tj1 -= bsize;\n\t\t}\n\t\tox1 = ox + ( j1*sx[1] );\n\t\toy1 = oy + ( j1*sy[1] );\n\t\toz1 = oz + ( j1*sz[1] );\n\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\tif ( j0 < bsize ) {\n\t\t\t\ts0 = j0;\n\t\t\t\tj0 = 0;\n\t\t\t} else {\n\t\t\t\ts0 = bsize;\n\t\t\t\tj0 -= bsize;\n\t\t\t}\n\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t// Compute loop offset increments...\n\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t// Iterate over the ndarray dimensions...\n\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\tix += dx0;\n\t\t\t\t\tiy += dy0;\n\t\t\t\t\tiz += dz0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t\tiy += dy1;\n\t\t\t\tiz += dz1;\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in three-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n* var sy = [ 4, 2, 1 ];\n* var sz = [ 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary3d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary3d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar ox1;\n\tvar ox2;\n\tvar oy1;\n\tvar oy2;\n\tvar oz1;\n\tvar oz2;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\tif ( j2 < bsize ) {\n\t\t\ts2 = j2;\n\t\t\tj2 = 0;\n\t\t} else {\n\t\t\ts2 = bsize;\n\t\t\tj2 -= bsize;\n\t\t}\n\t\tox2 = ox + ( j2*sx[2] );\n\t\toy2 = oy + ( j2*sy[2] );\n\t\toz2 = oz + ( j2*sz[2] );\n\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\tif ( j1 < bsize ) {\n\t\t\t\ts1 = j1;\n\t\t\t\tj1 = 0;\n\t\t\t} else {\n\t\t\t\ts1 = bsize;\n\t\t\t\tj1 -= bsize;\n\t\t\t}\n\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\ts0 = j0;\n\t\t\t\t\tj0 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts0 = bsize;\n\t\t\t\t\tj0 -= bsize;\n\t\t\t\t}\n\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t// Compute loop offset increments...\n\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t\tiy += dy2;\n\t\t\t\t\tiz += dz2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in four-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary4d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary4d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\tif ( j3 < bsize ) {\n\t\t\ts3 = j3;\n\t\t\tj3 = 0;\n\t\t} else {\n\t\t\ts3 = bsize;\n\t\t\tj3 -= bsize;\n\t\t}\n\t\tox3 = ox + ( j3*sx[3] );\n\t\toy3 = oy + ( j3*sy[3] );\n\t\toz3 = oz + ( j3*sz[3] );\n\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\tif ( j2 < bsize ) {\n\t\t\t\ts2 = j2;\n\t\t\t\tj2 = 0;\n\t\t\t} else {\n\t\t\t\ts2 = bsize;\n\t\t\t\tj2 -= bsize;\n\t\t\t}\n\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\ts1 = j1;\n\t\t\t\t\tj1 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts1 = bsize;\n\t\t\t\t\tj1 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in five-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary5d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary5d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\tif ( j4 < bsize ) {\n\t\t\ts4 = j4;\n\t\t\tj4 = 0;\n\t\t} else {\n\t\t\ts4 = bsize;\n\t\t\tj4 -= bsize;\n\t\t}\n\t\tox4 = ox + ( j4*sx[4] );\n\t\toy4 = oy + ( j4*sy[4] );\n\t\toz4 = oz + ( j4*sz[4] );\n\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\tif ( j3 < bsize ) {\n\t\t\t\ts3 = j3;\n\t\t\t\tj3 = 0;\n\t\t\t} else {\n\t\t\t\ts3 = bsize;\n\t\t\t\tj3 -= bsize;\n\t\t\t}\n\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\ts2 = j2;\n\t\t\t\t\tj2 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts2 = bsize;\n\t\t\t\t\tj2 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in six-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary6d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary6d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\tif ( j5 < bsize ) {\n\t\t\ts5 = j5;\n\t\t\tj5 = 0;\n\t\t} else {\n\t\t\ts5 = bsize;\n\t\t\tj5 -= bsize;\n\t\t}\n\t\tox5 = ox + ( j5*sx[5] );\n\t\toy5 = oy + ( j5*sy[5] );\n\t\toz5 = oz + ( j5*sz[5] );\n\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\tif ( j4 < bsize ) {\n\t\t\t\ts4 = j4;\n\t\t\t\tj4 = 0;\n\t\t\t} else {\n\t\t\t\ts4 = bsize;\n\t\t\t\tj4 -= bsize;\n\t\t\t}\n\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\ts3 = j3;\n\t\t\t\t\tj3 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts3 = bsize;\n\t\t\t\t\tj3 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in seven-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary7d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary7d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\tif ( j6 < bsize ) {\n\t\t\ts6 = j6;\n\t\t\tj6 = 0;\n\t\t} else {\n\t\t\ts6 = bsize;\n\t\t\tj6 -= bsize;\n\t\t}\n\t\tox6 = ox + ( j6*sx[6] );\n\t\toy6 = oy + ( j6*sy[6] );\n\t\toz6 = oz + ( j6*sz[6] );\n\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\tif ( j5 < bsize ) {\n\t\t\t\ts5 = j5;\n\t\t\t\tj5 = 0;\n\t\t\t} else {\n\t\t\t\ts5 = bsize;\n\t\t\t\tj5 -= bsize;\n\t\t\t}\n\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\ts4 = j4;\n\t\t\t\t\tj4 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts4 = bsize;\n\t\t\t\t\tj4 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in eight-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary8d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary8d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oy7;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar oz7;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\tif ( j7 < bsize ) {\n\t\t\ts7 = j7;\n\t\t\tj7 = 0;\n\t\t} else {\n\t\t\ts7 = bsize;\n\t\t\tj7 -= bsize;\n\t\t}\n\t\tox7 = ox + ( j7*sx[7] );\n\t\toy7 = oy + ( j7*sy[7] );\n\t\toz7 = oz + ( j7*sz[7] );\n\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\tif ( j6 < bsize ) {\n\t\t\t\ts6 = j6;\n\t\t\t\tj6 = 0;\n\t\t\t} else {\n\t\t\t\ts6 = bsize;\n\t\t\t\tj6 -= bsize;\n\t\t\t}\n\t\t\tdx7 = sx[7] - ( s6*sx[6] );\n\t\t\tdy7 = sy[7] - ( s6*sy[6] );\n\t\t\tdz7 = sz[7] - ( s6*sz[6] );\n\t\t\tox6 = ox7 + ( j6*sx[6] );\n\t\t\toy6 = oy7 + ( j6*sy[6] );\n\t\t\toz6 = oz7 + ( j6*sz[6] );\n\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\ts5 = j5;\n\t\t\t\t\tj5 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts5 = bsize;\n\t\t\t\t\tj5 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tix += dx7;\n\t\t\t\t\t\t\t\t\t\tiy += dy7;\n\t\t\t\t\t\t\t\t\t\tiz += dz7;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in nine-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary9d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary9d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oy7;\n\tvar oy8;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar oz7;\n\tvar oz8;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar s8;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar j8;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j8 = sh[8]; j8 > 0; ) {\n\t\tif ( j8 < bsize ) {\n\t\t\ts8 = j8;\n\t\t\tj8 = 0;\n\t\t} else {\n\t\t\ts8 = bsize;\n\t\t\tj8 -= bsize;\n\t\t}\n\t\tox8 = ox + ( j8*sx[8] );\n\t\toy8 = oy + ( j8*sy[8] );\n\t\toz8 = oz + ( j8*sz[8] );\n\t\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\t\tif ( j7 < bsize ) {\n\t\t\t\ts7 = j7;\n\t\t\t\tj7 = 0;\n\t\t\t} else {\n\t\t\t\ts7 = bsize;\n\t\t\t\tj7 -= bsize;\n\t\t\t}\n\t\t\tdx8 = sx[8] - ( s7*sx[7] );\n\t\t\tdy8 = sy[8] - ( s7*sy[7] );\n\t\t\tdz8 = sz[8] - ( s7*sz[7] );\n\t\t\tox7 = ox8 + ( j7*sx[7] );\n\t\t\toy7 = oy8 + ( j7*sy[7] );\n\t\t\toz7 = oz8 + ( j7*sz[7] );\n\t\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\t\tif ( j6 < bsize ) {\n\t\t\t\t\ts6 = j6;\n\t\t\t\t\tj6 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts6 = bsize;\n\t\t\t\t\tj6 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx7 = sx[7] - ( s6*sx[6] );\n\t\t\t\tdy7 = sy[7] - ( s6*sy[6] );\n\t\t\t\tdz7 = sz[7] - ( s6*sz[6] );\n\t\t\t\tox6 = ox7 + ( j6*sx[6] );\n\t\t\t\toy6 = oy7 + ( j6*sy[6] );\n\t\t\t\toz6 = oz7 + ( j6*sz[6] );\n\t\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\t\ts5 = j5;\n\t\t\t\t\t\tj5 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts5 = bsize;\n\t\t\t\t\t\tj5 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\t\t\tfor ( i8 = 0; i8 < s8; i8++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx7;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy7;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz7;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tix += dx8;\n\t\t\t\t\t\t\t\t\t\t\tiy += dy8;\n\t\t\t\t\t\t\t\t\t\t\tiz += dz8;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function, max-lines */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-binary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-binary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in ten-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} x.accessors - data buffer accessors\n* @param {Object} y - object containing input ndarray meta data\n* @param {*} y.dtype - data type\n* @param {Collection} y.data - data buffer\n* @param {NonNegativeIntegerArray} y.shape - dimensions\n* @param {IntegerArray} y.strides - stride lengths\n* @param {NonNegativeInteger} y.offset - index offset\n* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} y.accessors - data buffer accessors\n* @param {Object} z - object containing output ndarray meta data\n* @param {*} z.dtype - data type\n* @param {Collection} z.data - data buffer\n* @param {NonNegativeIntegerArray} z.shape - dimensions\n* @param {IntegerArray} z.strides - stride lengths\n* @param {NonNegativeInteger} z.offset - index offset\n* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array} z.accessors - data buffer accessors\n* @param {Callback} fcn - binary callback\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n* import copy from '@stdlib/array-base-copy';\n*\n* function fcn( x, y ) {\n* return x + y;\n* }\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );\n* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the shape of the input and output arrays:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create the input and output ndarray-like objects:\n* var x = {\n* 'dtype': 'generic',\n* 'data': xbuf,\n* 'shape': shape,\n* 'strides': sx,\n* 'offset': ox,\n* 'order': 'row-major',\n* 'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n* 'dtype': 'generic',\n* 'data': ybuf,\n* 'shape': shape,\n* 'strides': sy,\n* 'offset': oy,\n* 'order': 'row-major',\n* 'accessors': accessors( ybuf ).accessors\n* };\n* var z = {\n* 'dtype': 'generic',\n* 'data': zbuf,\n* 'shape': shape,\n* 'strides': sz,\n* 'offset': oz,\n* 'order': 'row-major',\n* 'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Apply the binary function:\n* blockedbinary10d( x, y, z, fcn );\n*\n* console.log( copy( z.data ) );\n* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ]\n*/\nfunction blockedbinary10d( x, y, z, fcn ) {\n\tvar bsize;\n\tvar xbuf;\n\tvar ybuf;\n\tvar zbuf;\n\tvar xget;\n\tvar yget;\n\tvar zset;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar dx7;\n\tvar dx8;\n\tvar dx9;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar dy5;\n\tvar dy6;\n\tvar dy7;\n\tvar dy8;\n\tvar dy9;\n\tvar dz0;\n\tvar dz1;\n\tvar dz2;\n\tvar dz3;\n\tvar dz4;\n\tvar dz5;\n\tvar dz6;\n\tvar dz7;\n\tvar dz8;\n\tvar dz9;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\n\tvar ox9;\n\tvar oy1;\n\tvar oy2;\n\tvar oy3;\n\tvar oy4;\n\tvar oy5;\n\tvar oy6;\n\tvar oy7;\n\tvar oy8;\n\tvar oy9;\n\tvar oz1;\n\tvar oz2;\n\tvar oz3;\n\tvar oz4;\n\tvar oz5;\n\tvar oz6;\n\tvar oz7;\n\tvar oz8;\n\tvar oz9;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar s8;\n\tvar s9;\n\tvar sx;\n\tvar sy;\n\tvar sz;\n\tvar ox;\n\tvar oy;\n\tvar oz;\n\tvar ix;\n\tvar iy;\n\tvar iz;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar i9;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar j8;\n\tvar j9;\n\tvar o;\n\n\t// Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( x.shape, x.strides, y.strides, z.strides );\n\tsh = o.sh;\n\tsx = o.sx;\n\tsy = o.sy;\n\tsz = o.sz;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Cache the indices of the first indexed elements in the respective ndarrays...\n\tox = x.offset;\n\toy = y.offset;\n\toz = z.offset;\n\n\t// Cache references to the input and output ndarray buffers...\n\txbuf = x.data;\n\tybuf = y.data;\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdx0 = sx[0];\n\tdy0 = sy[0];\n\tdz0 = sz[0];\n\n\t// Cache accessors:\n\txget = x.accessors[0];\n\tyget = y.accessors[0];\n\tzset = z.accessors[1];\n\n\t// Iterate over blocks...\n\tfor ( j9 = sh[9]; j9 > 0; ) {\n\t\tif ( j9 < bsize ) {\n\t\t\ts9 = j9;\n\t\t\tj9 = 0;\n\t\t} else {\n\t\t\ts9 = bsize;\n\t\t\tj9 -= bsize;\n\t\t}\n\t\tox9 = ox + ( j9*sx[9] );\n\t\toy9 = oy + ( j9*sy[9] );\n\t\toz9 = oz + ( j9*sz[9] );\n\t\tfor ( j8 = sh[8]; j8 > 0; ) {\n\t\t\tif ( j8 < bsize ) {\n\t\t\t\ts8 = j8;\n\t\t\t\tj8 = 0;\n\t\t\t} else {\n\t\t\t\ts8 = bsize;\n\t\t\t\tj8 -= bsize;\n\t\t\t}\n\t\t\tdx9 = sx[9] - ( s8*sx[8] );\n\t\t\tdy9 = sy[9] - ( s8*sy[8] );\n\t\t\tdz9 = sz[9] - ( s8*sz[8] );\n\t\t\tox8 = ox9 + ( j8*sx[8] );\n\t\t\toy8 = oy9 + ( j8*sy[8] );\n\t\t\toz8 = oz9 + ( j8*sz[8] );\n\t\t\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\t\t\tif ( j7 < bsize ) {\n\t\t\t\t\ts7 = j7;\n\t\t\t\t\tj7 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts7 = bsize;\n\t\t\t\t\tj7 -= bsize;\n\t\t\t\t}\n\t\t\t\tdx8 = sx[8] - ( s7*sx[7] );\n\t\t\t\tdy8 = sy[8] - ( s7*sy[7] );\n\t\t\t\tdz8 = sz[8] - ( s7*sz[7] );\n\t\t\t\tox7 = ox8 + ( j7*sx[7] );\n\t\t\t\toy7 = oy8 + ( j7*sy[7] );\n\t\t\t\toz7 = oz8 + ( j7*sz[7] );\n\t\t\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\t\t\tif ( j6 < bsize ) {\n\t\t\t\t\t\ts6 = j6;\n\t\t\t\t\t\tj6 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts6 = bsize;\n\t\t\t\t\t\tj6 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tdx7 = sx[7] - ( s6*sx[6] );\n\t\t\t\t\tdy7 = sy[7] - ( s6*sy[6] );\n\t\t\t\t\tdz7 = sz[7] - ( s6*sz[6] );\n\t\t\t\t\tox6 = ox7 + ( j6*sx[6] );\n\t\t\t\t\toy6 = oy7 + ( j6*sy[6] );\n\t\t\t\t\toz6 = oz7 + ( j6*sz[6] );\n\t\t\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\t\t\ts5 = j5;\n\t\t\t\t\t\t\tj5 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts5 = bsize;\n\t\t\t\t\t\t\tj5 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdx6 = sx[6] - ( s5*sx[5] );\n\t\t\t\t\t\tdy6 = sy[6] - ( s5*sy[5] );\n\t\t\t\t\t\tdz6 = sz[6] - ( s5*sz[5] );\n\t\t\t\t\t\tox5 = ox6 + ( j5*sx[5] );\n\t\t\t\t\t\toy5 = oy6 + ( j5*sy[5] );\n\t\t\t\t\t\toz5 = oz6 + ( j5*sz[5] );\n\t\t\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdx5 = sx[5] - ( s4*sx[4] );\n\t\t\t\t\t\t\tdy5 = sy[5] - ( s4*sy[4] );\n\t\t\t\t\t\t\tdz5 = sz[5] - ( s4*sz[4] );\n\t\t\t\t\t\t\tox4 = ox5 + ( j4*sx[4] );\n\t\t\t\t\t\t\toy4 = oy5 + ( j4*sy[4] );\n\t\t\t\t\t\t\toz4 = oz5 + ( j4*sz[4] );\n\t\t\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdx4 = sx[4] - ( s3*sx[3] );\n\t\t\t\t\t\t\t\tdy4 = sy[4] - ( s3*sy[3] );\n\t\t\t\t\t\t\t\tdz4 = sz[4] - ( s3*sz[3] );\n\t\t\t\t\t\t\t\tox3 = ox4 + ( j3*sx[3] );\n\t\t\t\t\t\t\t\toy3 = oy4 + ( j3*sy[3] );\n\t\t\t\t\t\t\t\toz3 = oz4 + ( j3*sz[3] );\n\t\t\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tdx3 = sx[3] - ( s2*sx[2] );\n\t\t\t\t\t\t\t\t\tdy3 = sy[3] - ( s2*sy[2] );\n\t\t\t\t\t\t\t\t\tdz3 = sz[3] - ( s2*sz[2] );\n\t\t\t\t\t\t\t\t\tox2 = ox3 + ( j2*sx[2] );\n\t\t\t\t\t\t\t\t\toy2 = oy3 + ( j2*sy[2] );\n\t\t\t\t\t\t\t\t\toz2 = oz3 + ( j2*sz[2] );\n\t\t\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tdx2 = sx[2] - ( s1*sx[1] );\n\t\t\t\t\t\t\t\t\t\tdy2 = sy[2] - ( s1*sy[1] );\n\t\t\t\t\t\t\t\t\t\tdz2 = sz[2] - ( s1*sz[1] );\n\t\t\t\t\t\t\t\t\t\tox1 = ox2 + ( j1*sx[1] );\n\t\t\t\t\t\t\t\t\t\toy1 = oy2 + ( j1*sy[1] );\n\t\t\t\t\t\t\t\t\t\toz1 = oz2 + ( j1*sz[1] );\n\t\t\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t// Compute index offsets for the first input and output ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\t\t\t\t\t\t\t\t\t\t\tiy = oy1 + ( j0*sy[0] );\n\t\t\t\t\t\t\t\t\t\t\tiz = oz1 + ( j0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Compute loop offset increments...\n\t\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[0] );\n\t\t\t\t\t\t\t\t\t\t\tdy1 = sy[1] - ( s0*sy[0] );\n\t\t\t\t\t\t\t\t\t\t\tdz1 = sz[1] - ( s0*sz[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Iterate over the ndarray dimensions...\n\t\t\t\t\t\t\t\t\t\t\tfor ( i9 = 0; i9 < s9; i9++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i8 = 0; i8 < s8; i8++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz3;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz4;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz5;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx6;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy6;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz6;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx7;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy7;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz7;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tix += dx8;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiy += dy8;\n\t\t\t\t\t\t\t\t\t\t\t\t\tiz += dz8;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tix += dx9;\n\t\t\t\t\t\t\t\t\t\t\t\tiy += dy9;\n\t\t\t\t\t\t\t\t\t\t\t\tiz += dz9;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default blockedbinary10d;\n"],"names":["iterationOrder","strides","cnt","i","length","main","Object","defineProperty","isNumber","value","zeros","n","out","zeroPad","str","width","right","negative","pad","startsWithMinus","substr","lowercase","String","prototype","toLowerCase","uppercase","toUpperCase","formatInteger","token","base","specifier","arg","parseInt","isFinite","Error","toString","precision","padRight","sign","alternate","call","charAt","abs","Math","replace","RE_EXP_POS_DIGITS","RE_EXP_NEG_DIGITS","RE_ONLY_DIGITS","RE_DIGITS_BEFORE_EXP","RE_TRAILING_PERIOD_ZERO","RE_PERIOD_ZERO_EXP","RE_ZERO_BEFORE_EXP","formatDouble","f","digits","toExponential","toFixed","toPrecision","spaces","fromCharCode","isArray","Array","isnan","initialize","flags","mapping","formatInterpolate","tokens","hasPeriod","flag","num","pos","j","TypeError","padZeros","indexOf","arguments","maxWidth","parseFloat","substring","RE","parse","match","formatTokenize","content","prev","exec","slice","lastIndex","push","format","args","tokenize","interpolate","apply","objectProtoype","toStr","defineGetter","__defineGetter__","defineSetter","__defineSetter__","lookupGetter","__lookupGetter__","lookupSetter","__lookupSetter__","err","hasDefinePropertySupport","builtin","obj","prop","descriptor","hasValue","hasGet","hasSet","__proto__","get","set","defineProperty$1","setNonEnumerableReadOnly","configurable","enumerable","writable","minmaxViewBufferIndex","shape","offset","ndims","min","max","s","setReadOnly","TYPE","isAccessorArray","GETTERS","complex128","arr","idx","complex64","default","getter","dtype","SETTERS","setter","float64","float32","int32","int16","int8","uint32","uint16","uint8","uint8c","generic","numel","copy","x","len","isString","FLG","Symbol","hasToStringTagSupport","toStringTag","has","hasOwnProperty","hasOwnProp","property","Sym","toStrTag","nativeClass","hasToStringTag","v","isOwn","tag","valueOf","test","isPrimitive","isObject","isColumnMajorString","shape2strides","order","isColumnMajor","columnmajor","rowmajor","ROW_MAJOR","ord","sh","st","copyIndexed","main$c","Number","o","strides2offset","strides2order","column","row","s1","s2","COLUMN_MAJOR","ndarraylike2object","xbuf","bool","dt","data","getData","getShape","getDType","ref","getStrides","getOffset","getOrder","accessorProtocol","accessors","accessorGetter","accessorSetter","main$b","arrayfcn","predicate","isObjectLike","isBuffer","_isBuffer","constructor","reFunctionName","arrayfun","RE_FUNCTION_NAME","constructorName","name","ctor","REGEXP","ctor2dtypes","Float32Array","Float64Array","Int16Array","Int32Array","Int8Array","Uint16Array","Uint32Array","Uint8Array","Uint8ClampedArray","Complex64Array","Complex128Array","BooleanArray","hasFloat64Array","GlobalFloat64Array","NaN","hasFloat64ArraySupport","Float64Array$1","hasFloat32Array","FLOAT64_PINF","POSITIVE_INFINITY","GlobalFloat32Array","PINF","hasFloat32ArraySupport","Float32Array$1","hasUint32Array","UINT32_MAX","GlobalUint32Array","hasUint32ArraySupport","Uint32Array$1","hasInt32Array","GlobalInt32Array","INT32_MAX","hasInt32ArraySupport","Int32Array$1","hasUint16Array","GlobalUint16Array","UINT16_MAX","hasUint16ArraySupport","Uint16Array$1","hasInt16Array","GlobalInt16Array","INT16_MAX","hasInt16ArraySupport","Int16Array$1","hasUint8Array","GlobalUint8Array","UINT8_MAX","hasUint8ArraySupport","Uint8Array$1","hasUint8ClampedArray","GlobalUint8ClampedArray","hasUint8ClampedArraySupport","Uint8ClampedArray$1","hasInt8Array","GlobalInt8Array","INT8_MAX","hasInt8ArraySupport","Int8Array$1","FLOAT64_NINF","NEGATIVE_INFINITY","floor","isInteger","NINF","isInt","isNonNegativeInteger","MAX_ARRAY_LENGTH","isArrayLikeObject","MAX_LENGTH","MAX_TYPED_ARRAY_LENGTH","isCollection","hasArrayBuffer","ArrayBuffer","isArrayBuffer","isPrimitiveArray","isObjectArray","isStringArray","isBoolean","Bool","Boolean","self","window","global","globalThis","root","codegen","Function","GlobalThis","Self","Win","Global","getGlobal","nodeList","document","childNodes","typedarray","ctorName","type","isFunction","typeOf","Complex128","real","imag","this","setEnumerableReadOnly","re","im","fround","FLOAT32_VIEW","float64ToFloat32$1","Complex64","float64ToFloat32","isComplexLike","isEven","BYTES_PER_ELEMENT","isComplex64Array","isComplex128Array","hasIteratorSymbolSupport","iterator","IteratorSymbol","setNonEnumerableReadOnlyAccessor","z","reinterpret","buffer","byteOffset","fromIterator","it","next","done","realf","imagf","HAS_ITERATOR_SYMBOL","isComplexArray","_length","_buffer","isComplexArrayConstructor","getComplex64","buf","nargs","fromArray","RangeError","reinterpret64","reinterpret128","byteLength","ITERATOR_SYMBOL","src","thisArg","clbk","tmp","flg","fromIteratorMap","target","start","copyWithin","iter","entries","end","fcn","searchElement","fromIndex","separator","sep","join","keys","outbuf","reducer","initialValue","acc","N","sbuf","outlen","compareFcn","sort","begin","locales","options","opts","loc","toLocaleString","values","index","getComplex128","isBooleanArray","isBooleanArrayConstructor","val","a","b","CTORS","DTYPES","NTYPES","ctor2dtype","hasProp","anyIsEntryIn","indexed","fmtprodmsg","u","encodeURIComponent","zeroTo","complex","stride","take","indices","binaryLoopOrder","sx","sy","sz","M","y","avx","ix","iy","jx","jy","vx","vy","ux","sort2ins","loopOrder","isPositiveInteger","isArguments","bool$6","detect","hasArgumentsClass","isNan","isEnumerableProperty","propertyIsEnumerable","hasStringEnumBug","isEnum","isArguments$1","isConstructorPrototype","w","hasAutomationEqualityBug","k","win","EXCLUDED_KEYS","check","HAS_BUILTIN","skipConstructor","skipPrototype","isFcn","p","HAS_ENUM_PROTO_BUG","HAS_NON_ENUM_PROPS_BUG","HAS_WINDOW","error","NON_ENUMERABLE","getProto","Obj","getPrototypeOf","proto","getProto$1","objectPrototype","isPlainObject","isPrototypeOf","key","ownProps","hash","allowDupes","duplicates","objectKeys","objectInverse","int64","uint64","float16","complex32","binary","notype","userdefined_type","bytesPerElement","enum2str","defaults","BLOCK_SIZE_IN_BYTES","BLOCK_SIZE_IN_ELEMENTS","binaryBlockSize","dtypeX","dtypeY","dtypeZ","dtypes","nb","blockSize","vind2bind","mode","ind","MODE","BINARY","ybuf","zbuf","dx0","dy0","dz0","S0","iz","i0","isRowMajor","dx1","dy1","dz1","S1","i1","dx2","dy2","dz2","S2","i2","dx3","dy3","dz3","S3","i3","dx4","dy4","dz4","S4","i4","dx5","dy5","dz5","S5","i5","dx6","dy6","dz6","S6","i6","dx7","dy7","dz7","S7","i7","dx8","dy8","dz8","S8","i8","dx9","dy9","dz9","S9","i9","ACCESSOR_BINARY","xget","yget","zset","BLOCKED_BINARY","bsize","ox1","oy1","oz1","s0","ox","oy","oz","j0","j1","ox2","oy2","oz2","j2","ox3","oy3","oz3","s3","j3","ox4","oy4","oz4","s4","j4","ox5","oy5","oz5","s5","j5","ox6","oy6","oz6","s6","j6","ox7","oy7","oz7","s7","j7","ox8","oy8","oz8","s8","j8","ox9","oy9","oz9","s9","j9","BLOCKED_ACCESSOR_BINARY","MAX_DIMS","hasAccessors","arrays","xmmv","ymmv","zmmv","shx","shy","shz","iox","ioy","ioz","ns","d","ndarray2object","ordx","ordy","ordz","accessorbinarynd","binarynd"],"mappings":";uOA8CA,SAASA,EAAgBC,GACxB,IAAIC,EACAC,EAGJ,IADAD,EAAM,EACAC,EAAI,EAAGA,EAAIF,EAAQG,OAAQD,IAC3BF,EAASE,GAAM,IACnBD,GAAO,GAGT,OAAa,IAARA,EAEG,EAEHA,IAAQD,EAAQG,QAEb,EAGD,CACR,CC5CA,IAAIC,EAA0C,mBAA1BC,OAAOC,eAAkCD,OAAOC,eAAiB,KCiCrF,IAAIA,EAAiBD,OAAOC,eCjB5B,SAASC,EAAUC,GAClB,MAA0B,iBAAVA,CACjB,CCAA,SAASC,EAAOC,GACf,IACIR,EADAS,EAAM,GAEV,IAAMT,EAAI,EAAGA,EAAIQ,EAAGR,IACnBS,GAAO,IAER,OAAOA,CACR,CAcA,SAASC,EAASC,EAAKC,EAAOC,GAC7B,IAAIC,GAAW,EACXC,EAAMH,EAAQD,EAAIV,OACtB,OAAKc,EAAM,IAnCZ,SAA0BJ,GACzB,MAAoB,MAAbA,EAAK,EACb,CAoCMK,CAAiBL,KACrBG,GAAW,EACXH,EAAMA,EAAIM,OAAQ,IAEnBN,EAAM,EACLA,EAAMJ,EAAOQ,GACbR,EAAOQ,GAAQJ,EACXG,IACJH,EAAM,IAAMA,IAVLA,CAaT,CCpDA,IAAIO,EAAYC,OAAOC,UAAUC,YAC7BC,EAAYH,OAAOC,UAAUG,YAajC,SAASC,EAAeC,GACvB,IAAIC,EACAjB,EACAT,EAEJ,OAASyB,EAAME,WACf,IAAK,IAEJD,EAAO,EACP,MACD,IAAK,IAEJA,EAAO,EACP,MACD,IAAK,IACL,IAAK,IAEJA,EAAO,GACP,MAID,QAECA,EAAO,GAKR,GAFAjB,EAAMgB,EAAMG,IACZ5B,EAAI6B,SAAUpB,EAAK,KACbqB,SAAU9B,GAAM,CACrB,IAAMK,EAAUI,GACf,MAAM,IAAIsB,MAAO,2BAA6BtB,GAE/CT,EAAI,CACJ,CAkCD,OAjCKA,EAAI,IAA2B,MAApByB,EAAME,WAA8B,KAATD,KAC1C1B,EAAI,WAAaA,EAAI,GAEjBA,EAAI,GACRS,IAAST,GAAIgC,SAAUN,GAClBD,EAAMQ,YACVxB,EAAMC,EAASD,EAAKgB,EAAMQ,UAAWR,EAAMS,WAE5CzB,EAAM,IAAMA,IAEZA,EAAMT,EAAEgC,SAAUN,GACZ1B,GAAMyB,EAAMQ,UAENR,EAAMQ,YACjBxB,EAAMC,EAASD,EAAKgB,EAAMQ,UAAWR,EAAMS,WAF3CzB,EAAM,GAIFgB,EAAMU,OACV1B,EAAMgB,EAAMU,KAAO1B,IAGP,KAATiB,IACCD,EAAMW,YACV3B,EAAM,KAAOA,GAEdA,EAAQgB,EAAME,YAAcL,EAAUe,KAAMZ,EAAME,WACjDL,EAAUe,KAAM5B,GAChBS,EAAUmB,KAAM5B,IAEJ,IAATiB,GACCD,EAAMW,WAAiC,MAApB3B,EAAI6B,OAAQ,KACnC7B,EAAM,IAAMA,GAGPA,CACR,CCtFA,IAAI8B,EAAMC,KAAKD,IACXrB,EAAYC,OAAOC,UAAUC,YAC7BC,EAAYH,OAAOC,UAAUG,YAC7BkB,EAAUtB,OAAOC,UAAUqB,QAK3BC,EAAoB,WACpBC,EAAoB,UACpBC,EAAiB,UACjBC,EAAuB,UACvBC,EAA0B,OAC1BC,EAAqB,QACrBC,EAAqB,gBAczB,SAASC,EAAcC,EAAGzB,GACzB,IAAI0B,EACA1C,EAEJ,OAASgB,EAAME,WACf,IAAK,IACL,IAAK,IACJlB,EAAMyC,EAAEE,cAAe3B,EAAMQ,WAC7B,MACD,IAAK,IACL,IAAK,IACJxB,EAAMyC,EAAEG,QAAS5B,EAAMQ,WACvB,MACD,IAAK,IACL,IAAK,IACCM,EAAKW,GAAM,OACfC,EAAS1B,EAAMQ,WACD,IACbkB,GAAU,GAEX1C,EAAMyC,EAAEE,cAAeD,IAEvB1C,EAAMyC,EAAEI,YAAa7B,EAAMQ,WAEtBR,EAAMW,YACX3B,EAAMgC,EAAQJ,KAAM5B,EAAKuC,EAAoB,OAC7CvC,EAAMgC,EAAQJ,KAAM5B,EAAKsC,EAAoB,KAC7CtC,EAAMgC,EAAQJ,KAAM5B,EAAKqC,EAAyB,KAEnD,MACD,QACC,MAAM,IAAIf,MAAO,mCAAqCN,EAAME,WAc7D,OAZAlB,EAAMgC,EAAQJ,KAAM5B,EAAKiC,EAAmB,SAC5CjC,EAAMgC,EAAQJ,KAAM5B,EAAKkC,EAAmB,SACvClB,EAAMW,YACV3B,EAAMgC,EAAQJ,KAAM5B,EAAKmC,EAAgB,OACzCnC,EAAMgC,EAAQJ,KAAM5B,EAAKoC,EAAsB,SAE3CK,GAAK,GAAKzB,EAAMU,OACpB1B,EAAMgB,EAAMU,KAAO1B,GAEpBA,EAAQgB,EAAME,YAAcL,EAAUe,KAAMZ,EAAME,WACjDL,EAAUe,KAAM5B,GAChBS,EAAUmB,KAAM5B,EAElB,CCpEA,SAAS8C,EAAQ/C,GAChB,IACIR,EADAS,EAAM,GAEV,IAAMT,EAAI,EAAGA,EAAIQ,EAAGR,IACnBS,GAAO,IAER,OAAOA,CACR,CCJA,IAAI+C,EAAerC,OAAOqC,aACtBC,EAAUC,MAAMD,QAoBpB,SAASE,EAAOrD,GACf,OAASA,GAAUA,CACpB,CASA,SAASsD,EAAYnC,GACpB,IAAIhB,EAAM,CAAA,EAMV,OALAA,EAAIkB,UAAYF,EAAME,UACtBlB,EAAIwB,eAAkC,IAApBR,EAAMQ,UAAyB,EAAIR,EAAMQ,UAC3DxB,EAAIG,MAAQa,EAAMb,MAClBH,EAAIoD,MAAQpC,EAAMoC,OAAS,GAC3BpD,EAAIqD,QAAUrC,EAAMqC,QACbrD,CACR,CAmBA,SAASsD,EAAmBC,GAC3B,IAAIC,EACAJ,EACApC,EACAyC,EACAC,EACA1D,EACA2D,EACAlB,EACAlD,EACAqE,EDnDc1D,EAAKC,EAAOC,EAC1BE,ECoDJ,IAAM0C,EAASO,GACd,MAAM,IAAIM,UAAW,8DAAgEN,EAAS,MAI/F,IAFAvD,EAAM,GACN2D,EAAM,EACApE,EAAI,EAAGA,EAAIgE,EAAO/D,OAAQD,IAE/B,GADAyB,EAAQuC,EAAQhE,GC1ES,iBD2EVyB,EACdhB,GAAOgB,MACD,CAGN,GAFAwC,OAAgC,IAApBxC,EAAMQ,YAClBR,EAAQmC,EAAYnC,IACRE,UACX,MAAM,IAAI2C,UAAW,oEAAqEtE,EAAG,cAAgByB,EAAQ,MAMtH,IAJKA,EAAMqC,UACVM,EAAM3C,EAAMqC,SAEbD,EAAQpC,EAAMoC,MACRQ,EAAI,EAAGA,EAAIR,EAAM5D,OAAQoE,IAE9B,OADAH,EAAOL,EAAMvB,OAAQ+B,IAErB,IAAK,IACJ5C,EAAMU,KAAO,IACb,MACD,IAAK,IACJV,EAAMU,KAAO,IACb,MACD,IAAK,IACJV,EAAMS,UAAW,EACjBT,EAAM8C,UAAW,EACjB,MACD,IAAK,IACJ9C,EAAM8C,SAAWV,EAAMW,QAAS,KAAQ,EACxC,MACD,IAAK,IACJ/C,EAAMW,WAAY,EAClB,MACD,QACC,MAAM,IAAIL,MAAO,iBAAmBmC,GAGtC,GAAqB,MAAhBzC,EAAMb,MAAgB,CAG1B,GAFAa,EAAMb,MAAQiB,SAAU4C,UAAWL,GAAO,IAC1CA,GAAO,EACFT,EAAOlC,EAAMb,OACjB,MAAM,IAAI0D,UAAW,wCAA0CF,EAAM,6BAA+B3C,EAAMb,MAAQ,MAE9Ga,EAAMb,MAAQ,IAClBa,EAAMS,UAAW,EACjBT,EAAMb,OAASa,EAAMb,MAEtB,CACD,GAAKqD,GACqB,MAApBxC,EAAMQ,UAAoB,CAG9B,GAFAR,EAAMQ,UAAYJ,SAAU4C,UAAWL,GAAO,IAC9CA,GAAO,EACFT,EAAOlC,EAAMQ,WACjB,MAAM,IAAIqC,UAAW,4CAA8CF,EAAM,6BAA+B3C,EAAMQ,UAAY,MAEtHR,EAAMQ,UAAY,IACtBR,EAAMQ,UAAY,EAClBgC,GAAY,EAEb,CAGF,OADAxC,EAAMG,IAAM6C,UAAWL,GACd3C,EAAME,WACf,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IAECsC,IACJxC,EAAM8C,UAAW,GAElB9C,EAAMG,IAAMJ,EAAeC,GAC3B,MACD,IAAK,IAEJA,EAAMiD,SAAW,EAAgBjD,EAAMQ,WAAa,EACpDR,EAAMG,IAAMT,OAAQM,EAAMG,KAC1B,MACD,IAAK,IAEJ,IAAM+B,EAAOlC,EAAMG,KAAQ,CAE1B,IADAuC,EAAMtC,SAAUJ,EAAMG,IAAK,KAChB,GAAKuC,EAAM,IACrB,MAAM,IAAIpC,MAAO,kCAAoCN,EAAMG,KAE5DH,EAAMG,IAAQ+B,EAAOQ,GAAUhD,OAAQM,EAAMG,KAAQ4B,EAAcW,EACnE,CACD,MACD,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IAMJ,GAJMF,IACLxC,EAAMQ,UAAY,GAEnBiB,EAAIyB,WAAYlD,EAAMG,MAChBE,SAAUoB,GAAM,CACrB,IAAM7C,EAAUoB,EAAMG,KACrB,MAAM,IAAIG,MAAO,yCAA2CtB,GAG7DyC,EAAIzB,EAAMG,IACVH,EAAM8C,UAAW,CACjB,CACD9C,EAAMG,IAAMqB,EAAcC,EAAGzB,GAC7B,MACD,QACC,MAAM,IAAIM,MAAO,sBAAwBN,EAAME,WAG3CF,EAAMiD,UAAY,GAAKjD,EAAMG,IAAI3B,OAASwB,EAAMiD,WACpDjD,EAAMG,IAAMH,EAAMG,IAAIgD,UAAW,EAAGnD,EAAMiD,WAEtCjD,EAAM8C,SACV9C,EAAMG,IAAMlB,EAASe,EAAMG,IAAKH,EAAMb,OAASa,EAAMQ,UAAWR,EAAMS,UAC3DT,EAAMb,QACjBa,EAAMG,KDpLSjB,ECoLOc,EAAMG,IDpLRhB,ECoLaa,EAAMb,MDpLZC,ECoLmBY,EAAMS,SDnLnDnB,YAAMH,EAAQD,EAAIV,QACX,EACHU,EAERA,EAAM,EACLA,EAAM4C,EAAQxC,GACdwC,EAAQxC,GAAQJ,IC+KfF,GAAOgB,EAAMG,KAAO,GACpBwC,GAAO,CACP,CAEF,OAAO3D,CACR,CEvNA,IAAIoE,EAAK,6EAYT,SAASC,EAAOC,GACf,IAAItD,EAAQ,CACXqC,QAAaiB,EAAO,GAAQlD,SAAUkD,EAAO,GAAK,SAAO,EACzDlB,MAASkB,EAAO,GAChBnE,MAASmE,EAAO,GAChB9C,UAAa8C,EAAO,GACpBpD,UAAaoD,EAAO,IAKrB,MAHoB,MAAfA,EAAO,SAA8B,IAAfA,EAAO,KACjCtD,EAAMQ,UAAY,KAEZR,CACR,CAeA,SAASuD,EAAgBrE,GACxB,IAAIsE,EACAjB,EACAe,EACAG,EAKJ,IAHAlB,EAAS,GACTkB,EAAO,EACPH,EAAQF,EAAGM,KAAMxE,GACToE,IACPE,EAAUtE,EAAIyE,MAAOF,EAAML,EAAGQ,UAAYN,EAAO,GAAI9E,SACxCA,QACZ+D,EAAOsB,KAAML,GAGM,MAAfF,EAAO,GACXf,EAAOsB,KAAM,KAEbtB,EAAOsB,KAAMR,EAAOC,IAErBG,EAAOL,EAAGQ,UACVN,EAAQF,EAAGM,KAAMxE,GAMlB,OAJAsE,EAAUtE,EAAIyE,MAAOF,IACRjF,QACZ+D,EAAOsB,KAAML,GAEPjB,CACR,CC3CA,SAASuB,EAAQ5E,GAChB,IAAI6E,EACAxF,EAEJ,GCf0B,iBDeVW,EACf,MAAM,IAAI2D,UAAWiB,EAAQ,kEAAmE5E,IAGjG,IADA6E,EAAO,CAAEC,EAAU9E,IACbX,EAAI,EAAGA,EAAIyE,UAAUxE,OAAQD,IAClCwF,EAAKF,KAAMb,UAAWzE,IAEvB,OAAO0F,EAAYC,MAAO,KAAMH,EACjC,CE7BA,ICkBIpF,EDlBAwF,EAAiBzF,OAAOiB,UACxByE,EAAQD,EAAe5D,SACvB8D,EAAeF,EAAeG,iBAC9BC,EAAeJ,EAAeK,iBAC9BC,EAAeN,EAAeO,iBAC9BC,EAAeR,EAAeS,iBCiBjCjG,ECdD,WAEC,IAEC,OADAA,EAAgB,CAAE,EAAE,IAAK,CAAA,IAClB,CACP,CAAC,MAAQkG,GACT,OAAO,CACP,CACF,CDGKC,GACaC,EDqBlB,SAAyBC,EAAKC,EAAMC,GACnC,IAAIvF,EACAwF,EACAC,EACAC,EAEJ,GAAoB,iBAARL,GAA4B,OAARA,GAAsC,mBAAtBZ,EAAMxD,KAAMoE,GAC3D,MAAM,IAAInC,UAAWiB,EAAQ,mEAAoEkB,IAElG,GAA2B,iBAAfE,GAA0C,OAAfA,GAAoD,mBAA7Bd,EAAMxD,KAAMsE,GACzE,MAAM,IAAIrC,UAAWiB,EAAQ,wEAAyEoB,IAyBvG,IAvBAC,EAAa,UAAWD,KAGtBT,EAAa7D,KAAMoE,EAAKC,IACxBN,EAAa/D,KAAMoE,EAAKC,IAGxBtF,EAAYqF,EAAIM,UAChBN,EAAIM,UAAYnB,SAGTa,EAAKC,GACZD,EAAKC,GAASC,EAAWrG,MAGzBmG,EAAIM,UAAY3F,GAEhBqF,EAAKC,GAASC,EAAWrG,OAG3BuG,EAAW,QAASF,EACpBG,EAAW,QAASH,EAEfC,IAAcC,GAAUC,GAC5B,MAAM,IAAI/E,MAAO,wHASlB,OANK8E,GAAUf,GACdA,EAAazD,KAAMoE,EAAKC,EAAMC,EAAWK,KAErCF,GAAUd,GACdA,EAAa3D,KAAMoE,EAAKC,EAAMC,EAAWM,KAEnCR,CACR,EC3DA,IAAAS,EAAe9G,EEZf,SAAS+G,EAA0BV,EAAKC,EAAMpG,GAC7CF,EAAgBqG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdC,UAAY,EACZhH,MAASA,GAEX,CCUA,SAASiH,EAAuBC,EAAO1H,EAAS2H,GAC/C,IAAIC,EACAC,EACAC,EACAC,EACA7H,EAKJ,IAHA0H,EAAQF,EAAMvH,OACd0H,EAAMF,EACNG,EAAMH,EACAzH,EAAI,EAAGA,EAAI0H,EAAO1H,IAAM,CAC7B,GAAoB,IAAfwH,EAAOxH,GACX,MAAO,CAAEyH,EAAQA,IAElBI,EAAI/H,EAASE,IACJ,EACR4H,GAAOC,GAAML,EAAMxH,GAAG,GACX6H,EAAI,IACfF,GAAOE,GAAML,EAAMxH,GAAG,GAEvB,CACD,MAAO,CAAE2H,EAAKC,EACf,CCTAE,EAAA5H,EAAA,UCIA,SAAgCsH,EAAO1H,EAAS2H,EAAQhH,GACvD,IAAIiH,EACAC,EACAC,EACAC,EACA7H,EAKJ,IAHA0H,EAAQF,EAAMvH,OACd0H,EAAMF,EACNG,EAAMH,EACAzH,EAAI,EAAGA,EAAI0H,EAAO1H,IAAM,CAC7B,GAAoB,IAAfwH,EAAOxH,GAGX,OAFAS,EAAK,GAAMgH,EACXhH,EAAK,GAAMgH,EACJhH,GAERoH,EAAI/H,EAASE,IACJ,EACR4H,GAAOC,GAAML,EAAMxH,GAAG,GACX6H,EAAI,IACfF,GAAOE,GAAML,EAAMxH,GAAG,GAEvB,CAGD,OAFAS,EAAK,GAAMkH,EACXlH,EAAK,GAAMmH,EACJnH,CACR,ICnFA,IAAIsH,EAAO,WAqBX,SAASC,EAAiB1H,GACzB,cAAgBA,EAAM0G,MAAQe,UAAezH,EAAM2G,MAAQc,CAC5D,CCvBA,IAAIE,EAAU,CACbC,WAwBD,SAAwBC,EAAKC,GAC5B,OAAOD,EAAInB,IAAKoB,EACjB,EAzBCC,UA2CD,SAAuBF,EAAKC,GAC3B,OAAOD,EAAInB,IAAKoB,EACjB,EA5CCE,QAuED,SAAuBH,EAAKC,GAC3B,OAAOD,EAAInB,IAAKoB,EACjB,GAqBA,SAASG,EAAQC,GAChB,IAAItF,EAAI+E,EAASO,GACjB,MAAkB,mBAANtF,EACJA,EAED+E,EAAQK,OAChB,CCvGA,IAAIG,EAAU,CACbP,WA0BD,SAAwBC,EAAKC,EAAK9H,GACjC6H,EAAIlB,IAAK3G,EAAO8H,EACjB,EA3BCC,UA+CD,SAAuBF,EAAKC,EAAK9H,GAChC6H,EAAIlB,IAAK3G,EAAO8H,EACjB,EAhDCE,QA6ED,SAAuBH,EAAKC,EAAK9H,GAChC6H,EAAIlB,IAAK3G,EAAO8H,EACjB,GAwBA,SAASM,EAAQF,GAChB,IAAItF,EAAIuF,EAASD,GACjB,MAAkB,mBAANtF,EACJA,EAEDuF,EAAQH,OAChB,CChHA,IAAIL,EAAU,CACbU,QAgCD,SAAqBR,EAAKC,GACzB,OAAOD,EAAKC,EACb,EAjCCQ,QAmDD,SAAqBT,EAAKC,GACzB,OAAOD,EAAKC,EACb,EApDCS,MAsED,SAAmBV,EAAKC,GACvB,OAAOD,EAAKC,EACb,EAvECU,MAyFD,SAAmBX,EAAKC,GACvB,OAAOD,EAAKC,EACb,EA1FCW,KA4GD,SAAkBZ,EAAKC,GACtB,OAAOD,EAAKC,EACb,EA7GCY,OA+HD,SAAoBb,EAAKC,GACxB,OAAOD,EAAKC,EACb,EAhICa,OAkJD,SAAoBd,EAAKC,GACxB,OAAOD,EAAKC,EACb,EAnJCc,MAqKD,SAAmBf,EAAKC,GACvB,OAAOD,EAAKC,EACb,EAtKCe,OAwLD,SAAoBhB,EAAKC,GACxB,OAAOD,EAAKC,EACb,EAzLCgB,QAyMD,SAAqBjB,EAAKC,GACzB,OAAOD,EAAKC,EACb,EA1MCE,QA0ND,SAAuBH,EAAKC,GAC3B,OAAOD,EAAKC,EACb,GAoBA,SAASG,EAAQC,GAChB,IAAItF,EAAI+E,EAASO,GACjB,MAAkB,mBAANtF,EACJA,EAED+E,EAAQK,OAChB,CCjQA,IAAIG,EAAU,CACbE,QAkCD,SAAqBR,EAAKC,EAAK9H,GAC9B6H,EAAKC,GAAQ9H,CACd,EAnCCsI,QAuDD,SAAqBT,EAAKC,EAAK9H,GAC9B6H,EAAKC,GAAQ9H,CACd,EAxDCuI,MA4ED,SAAmBV,EAAKC,EAAK9H,GAC5B6H,EAAKC,GAAQ9H,CACd,EA7ECwI,MAiGD,SAAmBX,EAAKC,EAAK9H,GAC5B6H,EAAKC,GAAQ9H,CACd,EAlGCyI,KAsHD,SAAkBZ,EAAKC,EAAK9H,GAC3B6H,EAAKC,GAAQ9H,CACd,EAvHC0I,OA2ID,SAAoBb,EAAKC,EAAK9H,GAC7B6H,EAAKC,GAAQ9H,CACd,EA5IC2I,OAgKD,SAAoBd,EAAKC,EAAK9H,GAC7B6H,EAAKC,GAAQ9H,CACd,EAjKC4I,MAqLD,SAAmBf,EAAKC,EAAK9H,GAC5B6H,EAAKC,GAAQ9H,CACd,EAtLC6I,OA0MD,SAAoBhB,EAAKC,EAAK9H,GAC7B6H,EAAKC,GAAQ9H,CACd,EA3MC8I,QA6ND,SAAqBjB,EAAKC,EAAK9H,GAC9B6H,EAAKC,GAAQ9H,CACd,EA9NCgI,QAgPD,SAAuBH,EAAKC,EAAK9H,GAChC6H,EAAKC,GAAQ9H,CACd,GAsBA,SAASoI,EAAQF,GAChB,IAAItF,EAAIuF,EAASD,GACjB,MAAkB,mBAANtF,EACJA,EAEDuF,EAAQH,OAChB,CC/QA,SAASe,EAAO7B,GACf,IAAIE,EACAlH,EACAR,EAGJ,GAAe,KADf0H,EAAQF,EAAMvH,QAEb,OAAO,EAGR,IADAO,EAAI,EACER,EAAI,EAAGA,EAAI0H,EAAO1H,IACvBQ,GAAKgH,EAAOxH,GAEb,OAAOQ,CACR,CCdA,SAAS8I,EAAMC,GACd,IAAI9I,EACA+I,EACAxJ,EAIJ,IAFAwJ,EAAMD,EAAEtJ,OACRQ,EAAM,GACAT,EAAI,EAAGA,EAAIwJ,EAAKxJ,IACrBS,EAAI6E,KAAMiE,EAAGvJ,IAEd,OAAOS,CACR,CCTA,SAASgJ,EAAUnJ,GAClB,MAA0B,iBAAVA,CACjB,CCTA,IAAIoJ,GCMgB,mBAAXC,QACoB,iBAApBA,OAAQ,ODOjB,SAASC,KACR,OAASF,IAAqC,iBAAvBC,OAAOE,WAC/B,CErBA,IAAIhE,GAAQ1F,OAAOiB,UAAUY,SCA7B,IAAI8H,GAAM3J,OAAOiB,UAAU2I,eA4B3B,SAASC,GAAY1J,EAAO2J,GAC3B,OACC3J,SAKMwJ,GAAIzH,KAAM/B,EAAO2J,EACzB,CCpCA,IAAIC,GAA0B,mBAAXP,OAA0BA,YAAS,ECKlDQ,GAA+B,mBAAXR,GAA0BA,GAAOE,YAAc,GCiCvE,IAAAO,GATKC,KCDL,SAAsBC,GACrB,IAAIC,EACAC,EACA/J,EAEJ,GAAK6J,QACJ,OAAOzE,GAAMxD,KAAMiI,GAEpBE,EAAMF,EAAGT,IACTU,EAAQP,GAAYM,EAAGT,IAGvB,IACCS,EAAGT,SAAgB,CACnB,CAAC,MAAQvD,GACT,OAAOT,GAAMxD,KAAMiI,EACnB,CAQD,OAPA7J,EAAMoF,GAAMxD,KAAMiI,GAEbC,EACJD,EAAGT,IAAgBW,SAEZF,EAAGT,IAEJpJ,CACR,EC3BA,SAAsB6J,GACrB,OAAOzE,GAAMxD,KAAMiI,EACpB,EC7BIG,GAAUtJ,OAAOC,UAAUqJ,QCQ/B,IAAIf,GAAMW,KAmBV,SAASZ,GAAUnJ,GAClB,MAAsB,iBAAVA,IACNA,aAAiBa,SAGjBuI,GCnBP,SAAepJ,GACd,IAEC,OADAmK,GAAQpI,KAAM/B,IACP,CACP,CAAC,MAAQgG,GACT,OAAO,CACP,CACF,CDaUoE,CAAMpK,GAEoB,oBAAzB8J,GAAa9J,IAGxB,CEjBA,SAASmJ,GAAUnJ,GAClB,OAASqK,EAAarK,IAAWsK,GAAUtK,EAC5C,CCNA,SAASuK,GAAqBP,GAC7B,MAAe,iBAANA,CACV,CCmDA,SAASQ,GAAetD,EAAOuD,GAC9B,OAAKC,GAAeD,GAhCrB,SAAsBvD,GACrB,IAAI/G,EACAoH,EACA7H,EAIJ,IAFAS,EAAM,GACNoH,EAAI,EACE7H,EAAI,EAAGA,EAAIwH,EAAMvH,OAAQD,IAC9BS,EAAI6E,KAAMuC,GACVA,GAAKL,EAAOxH,GAEb,OAAOS,CACR,CAqBSwK,CAAazD,GA3DtB,SAAmBA,GAClB,IAAIE,EACAjH,EACAoH,EACA7H,EAIJ,IAFA0H,EAAQF,EAAMvH,OACdQ,EAAM,GACAT,EAAI,EAAGA,EAAI0H,EAAO1H,IACvBS,EAAI6E,KAAM,GAGX,IADAuC,EAAI,EACE7H,EAAI0H,EAAM,EAAG1H,GAAK,EAAGA,IAC1BS,EAAKT,GAAM6H,EACXA,GAAKL,EAAOxH,GAEb,OAAOS,CACR,CA4CQyK,CAAU1D,EAClB,CC9BAM,EAAA5H,GAAA,cAAAyK,GACA7C,EAAA5H,GAAA,WAAA0K,ICvBA9C,EAAA5H,GAAA,UCgDA,SAAwBsH,EAAOuD,EAAOtK,GACrC,OAAKuK,GAAeD,GApCrB,SAAsBvD,EAAO/G,GAC5B,IAAIoH,EACA7H,EAGJ,IADA6H,EAAI,EACE7H,EAAI,EAAGA,EAAIwH,EAAMvH,OAAQD,IAC9BS,EAAKT,GAAM6H,EACXA,GAAKL,EAAOxH,GAEb,OAAOS,CACR,CA2BSwK,CAAazD,EAAO/G,GA3D7B,SAAmB+G,EAAO/G,GACzB,IACIoH,EACA7H,EAIJ,IADA6H,EAAI,EACE7H,EAFEwH,EAAMvH,OAEE,EAAGD,GAAK,EAAGA,IAC1BS,EAAKT,GAAM6H,EACXA,GAAKL,EAAOxH,GAEb,OAAOS,CACR,CAiDQyK,CAAU1D,EAAO/G,EACzB,ICpEA,IAAI0K,GAAY,YAkBhB,SAASrL,GAASyJ,EAAGD,GACpB,IAAI8B,EACAC,EACAC,EAGJ,MAAmB,iBADnBA,EAAK/B,EAAEzJ,UAC+B,OAAPwL,EAEX,KADnBD,EAAK9B,EAAE/B,OACCvH,OACA,CAAE,IAGJwJ,EADN2B,EAAM7B,EAAEwB,SAEPK,EAAMD,IAEAL,GAAeO,EAAID,IAEtB9B,EACGiC,EAAaD,GAEdA,CACR,CC9BA,SAASjL,GAAUC,GAClB,MAA0B,iBAAVA,CACjB,CClBA,IAAAkL,GAAeC,OCMXzJ,GAAWyJ,GAAOrK,UAAUY,SCEhC,IAAI0H,GAAMW,KAmBV,SAAShK,GAAUC,GAClB,MAAsB,iBAAVA,IACNA,aAAiBmL,KAGjB/B,GCpBP,SAAepJ,GACd,IAEC,OADA0B,GAASK,KAAM/B,IACR,CACP,CAAC,MAAQgG,GACT,OAAO,CACP,CACF,CDcUoE,CAAMpK,GAEoB,oBAAzB8J,GAAa9J,IAGxB,CEVA,SAASD,GAAUC,GAClB,OAASqK,GAAarK,IAAWsK,GAAUtK,EAC5C,CCZA,SAASmH,GAAQ8B,GAChB,IAAI+B,EACAD,EACAK,EAGJ,OAAKrL,GADLqL,EAAInC,EAAE9B,QAEEiE,EAGW,KADnBL,EAAK9B,EAAE/B,OACCvH,QAIW,iBADnBqL,EAAK/B,EAAEzJ,UAC+B,OAAPwL,EAHvB,ECfT,SAAyB9D,EAAO1H,GAC/B,IAAI2H,EACAC,EACA1H,EAIJ,IAFA0H,EAAQF,EAAMvH,OACdwH,EAAS,EACHzH,EAAI,EAAGA,EAAI0H,EAAO1H,IAClBF,EAASE,GAAM,IAEnByH,GAAU3H,EAASE,IAAQwH,EAAOxH,GAAI,IAGxC,OAAOyH,CACR,CDOQkE,CAAgBN,EAAIC,EAC5B,CEVA,SAAS/I,GAAKgH,GACb,OAAO/G,KAAKD,IAAKgH,EAClB,CCJA,SAASqC,GAAe9L,GACvB,IAAI+L,EACAnE,EACAoE,EACAC,EACAC,EACAhM,EAGJ,GAAe,KADf0H,EAAQ5H,EAAQG,QAEf,OAAO,EAMR,IAJA4L,GAAS,EACTC,GAAM,EAENC,EAAKxJ,GAAKzC,EAAS,IACbE,EAAI,EAAGA,EAAI0H,EAAO1H,IAAM,CAO7B,GANAgM,EAAKzJ,GAAKzC,EAASE,IACd6L,GAAUG,EAAKD,EACnBF,GAAS,EACEC,GAAOE,EAAKD,IACvBD,GAAM,IAEFA,IAAOD,EAGX,OAAO,EAFPE,EAAKC,CAIN,CACD,OAAKF,GAAOD,EACJ,EAEHC,EACG,EAED,CACR,CCVAhE,EAAA5H,GAAA,cAAAyK,IACA7C,EAAA5H,GAAA,WAAA0K,IC7CA,IAAIO,GAAY,YACZc,GAAe,eAqBnB,SAASlB,GAAOxB,GACf,IAAI+B,EACAI,EAGJ,OAAKjC,EADLiC,EAAInC,EAAEwB,OAEEW,EAIW,iBADnBJ,EAAK/B,EAAEzJ,UAC+B,OAAPwL,GAIpB,KADXI,EAAIE,GAAeN,KACG,IAANI,EAHRP,GAMG,IAANO,EACGO,GAGgB,IAAnB1C,EAAE/B,MAAMvH,OACLkL,GAGD,IACR,CCDA,SAASe,GAAoB3C,GAC5B,IAAI4C,EACAC,EACAf,EACAgB,EAQJ,OANAF,EC3CD,SAAe5C,GACd,OAAOA,EAAE+C,IACV,CDyCQC,CAAShD,GAChB8B,EE1CD,SAAgB9B,EAAGD,GAClB,IAAI+B,EAAK9B,EAAE/B,MACX,OAAK8B,EACGiC,EAAaF,GAEdA,CACR,CFoCMmB,CAAUjD,GAAG,GAClB8C,EG7CD,SAAgB9C,GACf,OAAOA,EAAEf,KACV,CH2CMiE,CAAUlD,GAEf6C,EAAOpE,EAAiBmE,GAEjB,CACNO,IAAOnD,EACPf,MAAS6D,EACTC,KAAQH,EACRlM,OAAUoJ,EAAOgC,GACjB7D,MAAS6D,EACTvL,QAAW6M,GAAYpD,GAAG,GAC1B9B,OAAUmF,GAAWrD,GACrBwB,MAAS8B,GAAUtD,GACnBuD,iBAAoBV,EACpBW,UAAa,EACZ,CAAEC,EAAgBX,GAAMY,EAAgBZ,IACxC,CAAE9D,EAAQ8D,GAAM3D,EAAQ2D,IAE3B,CIvCA,IAAAa,GATKxJ,MAAMD,QACNC,MAAMD,QARX,SAAkBnD,GACjB,MAAkC,mBAAzB8J,GAAa9J,EACvB,ECCA,SAAS6M,GAAUC,GAClB,GAA0B,mBAAdA,EACX,MAAM,IAAI9I,UAAWiB,EAAQ,0DAA2D6H,IAEzF,OASA,SAAgB9M,GACf,IAAIkJ,EACAxJ,EACJ,IAAMyD,GAASnD,GACd,OAAO,EAGR,GAAa,KADbkJ,EAAMlJ,EAAML,QAEX,OAAO,EAER,IAAMD,EAAI,EAAGA,EAAIwJ,EAAKxJ,IACrB,IAAiC,IAA5BoN,EAAW9M,EAAON,IACtB,OAAO,EAGT,OAAO,CACP,CACF,CCzCA,SAASqN,GAAc/M,GACtB,OACW,OAAVA,GACiB,iBAAVA,CAET,CCMA,SAASgN,GAAUhN,GAClB,OACC+M,GAAc/M,KAGbA,EAAMiN,WAELjN,EAAMkN,aAGgC,mBAA/BlN,EAAMkN,YAAYF,UACzBhN,EAAMkN,YAAYF,SAAUhN,GAIhC,CClBA,SAASmN,KACR,MAAO,yBACR,CCaA3F,EAAA5H,GAAA,oBALAwN,GAAAxN,KCFA,IAAIyN,GFPI,0BGQR,SAASC,GAAiBtD,GACzB,IAAIvF,EACA8I,EACAC,EAEJ,IAAe,YADfD,EAAOzD,GAAaE,GAAIlF,MAAO,GAAI,KACC,UAATyI,IAAqBvD,EAAEkD,YAAc,CAE/D,GAA0B,iBAD1BM,EAAOxD,EAAEkD,aACQK,KAChB,OAAOC,EAAKD,KAGb,GADA9I,EAAQF,GAAGM,KAAM2I,EAAK9L,YAErB,OAAO+C,EAAO,EAEf,CACD,OAAKuI,GAAUhD,GACP,SAEDuD,CACR,CCnBA/F,EAAA5H,GAAA,SAAA6N,IChCA,IAAIC,GAAc,CACjBC,aAAgB,UAChBC,aAAgB,UAChBxK,MAAS,UACTyK,WAAc,QACdC,WAAc,QACdC,UAAa,OACbC,YAAe,SACfC,YAAe,SACfC,WAAc,QACdC,kBAAqB,SACrBC,eAAkB,YAClBC,gBAAmB,aACnBC,aAAgB,QCTbC,GAA4C,mBAAjBX,aCL/B,IAAIhO,GAAiC,mBAAjBgO,aAAgCA,aAAe,KCAnE,ICmBIJ,GDnBAA,GAAiC,mBAAjBI,aAAgCA,kBAAe,ECuBlEJ,GCRD,WACC,IAAI1B,EACAjE,EJSoB7H,EIPxB,GAAmC,mBAAvBwO,GACX,OAAO,EAGR,IACC3G,EAAM,IAAI2G,GAAoB,CAAE,EAAK,MAAO,KAAMC,MJE3BzO,EIAN6H,EADjBiE,GJGEyC,IAAmBvO,aAAiB4N,cACb,0BAAzB9D,GAAa9J,KIFC,IAAb6H,EAAK,IACQ,OAAbA,EAAK,KACS,OAAdA,EAAK,IACLA,EAAK,IAAQA,EAAK,EAEnB,CAAC,MAAQ7B,GACT8F,GAAO,CACP,CACD,OAAOA,CACR,CDhBK4C,GACGxI,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAAkN,GAAenB,GGxBXoB,GAA4C,mBAAjBjB,aCuB/B,IAAIkB,GAAe1D,OAAO2D,kBC5BtBlP,GAAiC,mBAAjB+N,aAAgCA,aAAe,KCAnE,ICmBIH,GDnBAA,GAAiC,mBAAjBG,aAAgCA,kBAAe,ECuBlEH,GCPD,WACC,IAAI1B,EACAjE,ELQoB7H,EKNxB,GAAmC,mBAAvB+O,GACX,OAAO,EAGR,IACClH,EAAM,IAAIkH,GAAoB,CAAE,EAAK,MAAO,KAAM,OLC3B/O,EKCN6H,EADjBiE,GLEE8C,IAAmB5O,aAAiB2N,cACb,0BAAzB7D,GAAa9J,KKDC,IAAb6H,EAAK,IACQ,oBAAbA,EAAK,KACS,oBAAdA,EAAK,IACLA,EAAK,KAAQmH,EAEd,CAAC,MAAQhJ,GACT8F,GAAO,CACP,CACD,OAAOA,CACR,CDjBKmD,GACG/I,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAAyN,GAAe1B,GGxBX2B,GAA0C,mBAAhBlB,YC4B9B,IAAImB,GAAa,WCjCbxP,GAAgC,mBAAhBqO,YAA+BA,YAAc,KCAjE,ICmBIT,GDnBAA,GAAgC,mBAAhBS,YAA+BA,iBAAc,ECuBhET,GCPD,WACC,IAAI1B,EACAjE,ELQmB7H,EKNvB,GAAkC,mBAAtBqP,GACX,OAAO,EAGR,IAECxH,EAAM,IAAIwH,GADVxH,EAAM,CAAE,EAAG,MAAO,KAAMuH,WAAcA,aLChBpP,EKEN6H,EADhBiE,GLCEqD,IAAkBnP,aAAiBiO,aACZ,yBAAzBnE,GAAa9J,KKAC,IAAb6H,EAAK,IACQ,IAAbA,EAAK,IACQuH,aAAbvH,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,EAEN,CAAC,MAAQ7B,GACT8F,GAAO,CACP,CACD,OAAOA,CACR,CDnBKwD,GACGpJ,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAA8N,GAAe/B,GGxBXgC,GAAwC,mBAAf1B,WC4B7B,ICjCIlO,GAA+B,mBAAfkO,WAA8BA,WAAa,KCA/D,ICmBIN,GDnBAA,GAA+B,mBAAfM,WAA8BA,gBAAa,ECuB9DN,GCND,WACC,IAAI1B,EACAjE,ELOkB7H,EKLtB,GAAiC,mBAArByP,GACX,OAAO,EAGR,IACC5H,EAAM,IAAI4H,GAAkB,CAAE,EAAG,MAAO,KAAMC,aLAzB1P,EKEN6H,EADfiE,GLCE0D,IAAiBxP,aAAiB8N,YACX,wBAAzBhE,GAAa9J,KKAC,IAAb6H,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,KCEQ,aDDbA,EAAK,EAEN,CAAC,MAAQ7B,GACT8F,GAAO,CACP,CACD,OAAOA,CACR,CDlBK6D,GACGzJ,GGdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EHoBA,IAAAmO,GAAepC,GIxBXqC,GAA0C,mBAAhB7B,YC4B9B,ICjCIpO,GAAgC,mBAAhBoO,YAA+BA,YAAc,KCAjE,ICmBIR,GDnBAA,GAAgC,mBAAhBQ,YAA+BA,iBAAc,ECuBhER,GCPD,WACC,IAAI1B,EACAjE,ELQmB7H,EKNvB,GAAkC,mBAAtB8P,GACX,OAAO,EAGR,IAECjI,EAAM,IAAIiI,GADVjI,EAAM,CAAE,EAAG,MAAO,KAAMkI,MAAcA,QLChB/P,EKEN6H,EADhBiE,GLCE+D,IAAkB7P,aAAiBgO,aACZ,yBAAzBlE,GAAa9J,KKAC,IAAb6H,EAAK,IACQ,IAAbA,EAAK,IACQkI,QAAblI,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,EAEN,CAAC,MAAQ7B,GACT8F,GAAO,CACP,CACD,OAAOA,CACR,CDnBKkE,GACG9J,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAAwO,GAAezC,GGxBX0C,GAAwC,mBAAfrC,WC4B7B,ICjCIjO,GAA+B,mBAAfiO,WAA8BA,WAAa,KCA/D,ICmBIL,GDnBAA,GAA+B,mBAAfK,WAA8BA,gBAAa,ECuB9DL,GCND,WACC,IAAI1B,EACAjE,ELOkB7H,EKLtB,GAAiC,mBAArBmQ,GACX,OAAO,EAGR,IACCtI,EAAM,IAAIsI,GAAkB,CAAE,EAAG,MAAO,KAAMC,QLAzBpQ,EKEN6H,EADfiE,GLCEoE,IAAiBlQ,aAAiB6N,YACX,wBAAzB/D,GAAa9J,KKAC,IAAb6H,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,KCEQ,QDDbA,EAAK,EAEN,CAAC,MAAQ7B,GACT8F,GAAO,CACP,CACD,OAAOA,CACR,CDlBKuE,GACGnK,GGdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EHoBA,IAAA6O,GAAe9C,GIxBX+C,GAAwC,mBAAfrC,WC4B7B,ICjCItO,GAA+B,mBAAfsO,WAA8BA,WAAa,KCA/D,ICmBIV,GDnBAA,GAA+B,mBAAfU,WAA8BA,gBAAa,ECuB9DV,GCPD,WACC,IAAI1B,EACAjE,ELQkB7H,EKNtB,GAAiC,mBAArBwQ,GACX,OAAO,EAGR,IAEC3I,EAAM,IAAI2I,GADV3I,EAAM,CAAE,EAAG,MAAO,KAAM4I,IAAaA,MLChBzQ,EKEN6H,EADfiE,GLCEyE,IAAiBvQ,aAAiBkO,YACX,wBAAzBpE,GAAa9J,KKAC,IAAb6H,EAAK,IACQ,IAAbA,EAAK,IACQ4I,MAAb5I,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,EAEN,CAAC,MAAQ7B,GACT8F,GAAO,CACP,CACD,OAAOA,CACR,CDnBK4E,GACGxK,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAAkP,GAAenD,GGxBXoD,GAAsD,mBAAtBzC,kBCLpC,IAAIvO,GAAsC,mBAAtBuO,kBAAqCA,kBAAoB,KCA7E,ICmBIX,GDnBAA,GAAsC,mBAAtBW,kBAAqCA,uBAAoB,ECuB5EX,GCRD,WACC,IAAI1B,EACAjE,EJSyB7H,EIP7B,GAAwC,mBAA5B6Q,GACX,OAAO,EAGR,IACChJ,EAAM,IAAIgJ,GAAyB,EAAG,EAAG,EAAG,EAAG,KAAM,KAAM,IAAK,MJEpC7Q,EIAN6H,EADtBiE,GJGE8E,IAAwB5Q,aAAiBmO,mBAClB,+BAAzBrE,GAAa9J,KIFC,IAAb6H,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,MAAbA,EAAK,IACQ,MAAbA,EAAK,EAEN,CAAC,MAAQ7B,GACT8F,GAAO,CACP,CACD,OAAOA,CACR,CDnBKgF,GACG5K,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAAsP,GAAevD,GGxBXwD,GAAsC,mBAAdjD,UC4B5B,ICjCInO,GAA8B,mBAAdmO,UAA6BA,UAAY,KCA7D,ICmBIP,GDnBAA,GAA8B,mBAAdO,UAA6BA,eAAY,ECuB5DP,GCND,WACC,IAAI1B,EACAjE,ELOiB7H,EKLrB,GAAgC,mBAApBiR,GACX,OAAO,EAGR,IACCpJ,EAAM,IAAIoJ,GAAiB,CAAE,EAAG,MAAO,KAAMC,MLAzBlR,EKEN6H,EADdiE,GLCEkF,IAAgBhR,aAAiB+N,WACV,uBAAzBjE,GAAa9J,KKAC,IAAb6H,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,KCEO,MDDZA,EAAK,EAEN,CAAC,MAAQ7B,GACT8F,GAAO,CACP,CACD,OAAOA,CACR,CDlBKqF,GACGjL,GGdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EHoBA,IAAA2P,GAAe5D,GIGX6D,GAAelG,GAAOmG,kBCVtBC,GAAQrP,KAAKqP,MCHjB,SAASC,GAAWvI,GACnB,OAAQsI,GAAMtI,KAAOA,CACtB,CCPA,SAASuI,GAAWxR,GACnB,OACCA,EAAQgP,IACRhP,EAAQyR,IACRC,GAAO1R,EAET,CCAA,SAASwR,GAAWxR,GACnB,OACCD,GAAUC,IACV0R,GAAO1R,EAET,CCLA,SAASwR,GAAWxR,GACnB,OACCD,GAAUC,IACV0R,GAAO1R,EAAMmK,UAEf,CCGA,SAASqH,GAAWxR,GACnB,OAASqK,GAAarK,IAAWsK,GAAUtK,EAC5C,CCXA,SAAS2R,GAAsB3R,GAC9B,OACCwR,GAAWxR,IACXA,GAAS,CAEX,CCLA,SAAS2R,GAAsB3R,GAC9B,OACCwR,GAAWxR,IACXA,EAAMmK,WAAa,CAErB,CCQA,SAASwH,GAAsB3R,GAC9B,OAASqK,GAAarK,IAAWsK,GAAUtK,EAC5C,CCeAwH,EAAA5H,GAAA,cAAAyK,IACA7C,EAAA5H,GAAA,WAAA0K,ICAA9C,EAAA5H,GAAA,cAAAyK,IACA7C,EAAA5H,GAAA,WAAA0K,IC9BA,IAAIsH,GAAmB,WCGvB,SAASC,GAAmB7R,GAC3B,MACkB,iBAAVA,GACG,OAAVA,GACwB,iBAAjBA,EAAML,QACb6R,GAAWxR,EAAML,SACjBK,EAAML,QAAU,GAChBK,EAAML,QAAUmS,EAElB,CCZA,IAAIC,GAAyB,iBCD7B,SAASC,GAAchS,GACtB,MACkB,iBAAVA,GACG,OAAVA,GACwB,iBAAjBA,EAAML,QACb6R,GAAWxR,EAAML,SACjBK,EAAML,QAAU,GAChBK,EAAML,QAAUmS,EAElB,CCxBA,IAAIG,GAA0C,mBAAhBC,YAqB9B,SAASC,GAAenS,GACvB,OACGiS,IAAkBjS,aAAiBkS,aACZ,yBAAzBpI,GAAa9J,EAEf,CCZA,SAASsK,GAAUtK,GAClB,MACkB,iBAAVA,GACG,OAAVA,IACCmD,GAASnD,EAEZ,CCeA,IAAAoS,GAAAhF,GAAAjE,GAAAkB,aACAgI,GAAAjF,GAAAjE,GAAAmB,UAKAgI,GAAAlF,GAAAjE,IACA3B,EAAA8K,GAAA,aAAAF,IACA5K,EAAA8K,GAAA,UAAAD,IClDA,IAAI9N,GAAK,ICoBT,SAASgO,GAAWvS,GACnB,MAA0B,kBAAVA,CACjB,CCGA,IAAIwS,GAAOC,QCxBP/Q,GAAW+Q,QAAQ3R,UAAUY,SCSjC,IAAI0H,GAAMW,KAqBV,SAASwI,GAAWvS,GACnB,MAAsB,iBAAVA,IACNA,aAAiByS,KAGjBrJ,GCtBP,SAAepJ,GACd,IAEC,OADA0B,GAASK,KAAM/B,IACR,CACP,CAAC,MAAQgG,GACT,OAAO,CACP,CACF,CDgBUoE,CAAMpK,GAEoB,qBAAzB8J,GAAa9J,IAGxB,CERA,SAASuS,GAAWvS,GACnB,OAASqK,GAAarK,IAAWsK,GAAUtK,EAC5C,CCUAwH,EAAA5H,GAAA,cAAAyK,IACA7C,EAAA5H,GAAA,WAAA0K,IC7CA,IAAInE,GAAwB,iBAATuM,KAAsBA,KAAO,KCA5CvM,GAA0B,iBAAXwM,OAAwBA,OAAS,KCAhDxM,GAA0B,iBAAXyM,OAAwBA,OAAS,KCAhDzM,GAA8B,iBAAf0M,WAA4BA,WAAa,KCK5D,IAAIC,GCsBJ,SAAoBC,GACnB,GAAK5O,UAAUxE,OAAS,CACvB,IAAM4S,GAAWQ,GAChB,MAAM,IAAI/O,UAAWiB,EAAQ,yDAA0D8N,IAExF,GAAKA,EACJ,OC1BK,IAAIC,SAAU,eAAd,ED6BN,CAED,GAAKC,GACJ,OAAOA,GAGR,GAAKC,GACJ,OAAOA,GAGR,GAAKC,GACJ,OAAOA,GAGR,GAAKC,GACJ,OAAOA,GAGR,MAAM,IAAI3R,MAAO,qDAClB,CDlDW4R,GACPC,GAAWR,GAAKS,UAAYT,GAAKS,SAASC,WGR1CC,GAAa1F,UCwBjB,IAAInO,GCNY,mBAAP2E,IAGe,iBAAfkP,IAGa,mBAAbH,GCXT,SAAiBtJ,GAChB,OAAO0J,GAAU1J,GAAIjJ,aACtB,ECqBA,SAAiBiJ,GAChB,IAAI2J,EAGJ,OAAW,OAAN3J,EACG,OAKM,YAHd2J,SAAc3J,GAIN0J,GAAU1J,GAAIjJ,cAEf4S,CACR,EC7BA,SAASC,GAAY5T,GAEpB,MAA6B,aAApB6T,GAAQ7T,EAClB,CCCA,SAASwH,GAAarB,EAAKC,EAAMpG,GAChCF,EAAgBqG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdC,UAAY,EACZhH,MAASA,GAEX,CCLA,SAAS8T,GAAYC,EAAMC,GAC1B,KAAQC,gBAAgBH,IACvB,MAAM,IAAI9P,UAAW,0EAEtB,IAAMjE,GAAUgU,GACf,MAAM,IAAI/P,UAAWiB,EAAQ,kEAAmE8O,IAEjG,IAAMhU,GAAUiU,GACf,MAAM,IAAIhQ,UAAWiB,EAAQ,uEAAwE+O,IAItG,OAFAE,GAAuBD,KAAM,KAAMF,GACnCG,GAAuBD,KAAM,KAAMD,GAC5BC,IACR,CAeAzM,EAAasM,GAAY,OAAQ,cAcjCtM,EAAasM,GAAY,oBAAqB,GAgBnCjN,EAAEiN,GAAWhT,UAAW,oBAAqB,GAgB7C+F,EAAEiN,GAAWhT,UAAW,aAAc,IAgBtC+F,EAAEiN,GAAWhT,UAAW,YC/GnC,WAEC,IAAIT,EAAM,GAAK4T,KAAKE,GAOpB,OANKF,KAAKG,GAAK,EACd/T,GAAO,OAAU4T,KAAKG,GAEtB/T,GAAO,MAAQ4T,KAAKG,GAErB/T,GAAO,GAER,IDyHWwG,EAAEiN,GAAWhT,UAAW,UEnInC,WAEC,IAAIX,EAAM,CACVA,KAAW,cAGX,OAFAA,EAAIgU,GAAKF,KAAKE,GACdhU,EAAIiU,GAAKH,KAAKG,GACPjU,CACR,ICXA,IAAIkU,GAAkC,mBAAhBnS,KAAKmS,OAA0BnS,KAAKmS,OAAS,KCK/DC,GAAe,IAAI3G,GAAc,GCuBrC,IAAA4G,GATwB,mBAAZrO,GACQA,GDApB,SAA2B+C,GAE1B,OADAqL,GAAc,GAAMrL,EACbqL,GAAc,EACtB,EEGA,SAASE,GAAWT,EAAMC,GACzB,KAAQC,gBAAgBO,IACvB,MAAM,IAAIxQ,UAAW,0EAEtB,IAAMjE,GAAUgU,GACf,MAAM,IAAI/P,UAAWiB,EAAQ,kEAAmE8O,IAEjG,IAAMhU,GAAUiU,GACf,MAAM,IAAIhQ,UAAWiB,EAAQ,uEAAwE+O,IAItG,OAFAE,GAAuBD,KAAM,KAAMQ,GAAkBV,IACrDG,GAAuBD,KAAM,KAAMQ,GAAkBT,IAC9CC,IACR,CCfA,SAASS,GAAe1U,GACvB,OAAKA,aAAiB8T,IAAc9T,aAAiBwU,IAInC,iBAAVxU,GACG,OAAVA,GACoB,iBAAbA,EAAMmU,IACO,iBAAbnU,EAAMoU,EAEf,CCPA,SAASO,GAAQ1L,GAChB,OAAOuI,GAAWvI,EAAE,EACrB,CFyBAzB,EAAagN,GAAW,OAAQ,aAchChN,EAAagN,GAAW,oBAAqB,GAgBlC3N,EAAE2N,GAAU1T,UAAW,oBAAqB,GAgB5C+F,EAAE2N,GAAU1T,UAAW,aAAc,GAgBrC+F,EAAE2N,GAAU1T,UAAW,YGhHlC,WAEC,IAAIT,EAAM,GAAK4T,KAAKE,GAOpB,OANKF,KAAKG,GAAK,EACd/T,GAAO,OAAU4T,KAAKG,GAEtB/T,GAAO,MAAQ4T,KAAKG,GAErB/T,GAAO,GAER,IH0HWwG,EAAE2N,GAAU1T,UAAW,UIpIlC,WAEC,IAAIX,EAAM,CACVA,KAAW,aAGX,OAFAA,EAAIgU,GAAKF,KAAKE,GACdhU,EAAIiU,GAAKH,KAAKG,GACPjU,CACR,ICXA,IAAIyU,GAAoB,EAoBxB,SAASC,GAAkB7U,GAE1B,MACkB,iBAAVA,GACG,OAAVA,GAC2B,mBAA3BA,EAAMkN,YAAYK,MAClBvN,EAAM4U,oBAAsBA,EAE9B,CC5BA,IAAIA,GAAoB,GAoBxB,SAASE,GAAmB9U,GAE3B,MACkB,iBAAVA,GACG,OAAVA,GAC2B,oBAA3BA,EAAMkN,YAAYK,MAClBvN,EAAM4U,oBAAsBA,EAE9B,CCbA,SAASG,KACR,MACmB,mBAAX1L,IACoB,iBAApBA,GAAQ,QACfK,GAAYL,GAAQ,aACO,iBAApBA,GAAO2L,QAEhB,CC6BA,IAAIC,GAAmBF,KAA+B1L,OAAO2L,SAAW,KCxBxE,SAASE,GAAkC/O,EAAKC,EAAM6B,GACrDnI,EAAgBqG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdL,IAAOuB,GAET,CCrBA,SAAS8L,GAAMoB,GACd,OAAOA,EAAEhB,EACV,CCFA,SAASH,GAAMmB,GACd,OAAOA,EAAEf,EACV,CCSA,SAASgB,GAAanM,EAAG9B,GACxB,OAAO,IAAIwG,GAAc1E,EAAEoM,OAAQpM,EAAEqM,WAAYrM,EAAE2L,kBAAkBzN,EAAS,GAAG8B,EAAEtJ,OAAOwH,GAC3F,CCFA,SAASiO,GAAanM,EAAG9B,GACxB,OAAO,IAAIyG,GAAc3E,EAAEoM,OAAQpM,EAAEqM,WAAYrM,EAAE2L,kBAAkBzN,EAAS,GAAG8B,EAAEtJ,OAAOwH,GAC3F,CCTA,SAASoO,GAAcC,GACtB,IAAIrV,EACA6J,EACAmL,EAGJ,IADAhV,EAAM,KAEL6J,EAAIwL,EAAGC,QACAC,MAIP,GAAK7D,GADLsD,EAAInL,EAAEhK,QACyBmV,EAAExV,QAAU,EAC1CQ,EAAI6E,KAAMmQ,EAAG,GAAKA,EAAG,QACf,KAAKT,GAAeS,GAG1B,OAAO,IAAInR,UAAWiB,EAAQ,kJAAmJkQ,IAFjLhV,EAAI6E,KAAM2Q,GAAOR,GAAKS,GAAOT,GAG7B,CAEF,OAAOhV,CACR,CCAA,IAAAyU,GAAA,EAAAjH,GAAAiH,kBACAiB,GAAAd,KAYA,SAAAe,GAAA9V,GACA,OACAA,aAAAoO,IAEA,iBAAApO,GACA,OAAAA,IAEA,mBAAAA,EAAAkN,YAAAK,MACA,oBAAAvN,EAAAkN,YAAAK,OAEA,iBAAAvN,EAAA+V,SAGA,iBAAA/V,EAAAgW,OAGA,CASA,SAAAC,GAAAjW,GACA,OACAA,IAAAoO,IAGA,oBAAApO,EAAAuN,IAEA,CAUA,SAAA2I,GAAAC,EAAArO,GAEA,OAAA,IAAA0M,GAAA2B,EADArO,GAAA,GACAqO,EAAArO,EAAA,GACA,CAyEA,SAAAsG,KACA,IAAAkH,EACAc,EACAD,EACAjN,EAGA,GADAkN,EAAAjS,UAAAxE,SACAsU,gBAAA7F,IACA,OAAA,IAAAgI,EACA,IAAAhI,GAEA,IAAAgI,EACA,IAAAhI,GAAAjK,UAAA,IAEA,IAAAiS,EACA,IAAAhI,GAAAjK,UAAA,GAAAA,UAAA,IAEA,IAAAiK,GAAAjK,UAAA,GAAAA,UAAA,GAAAA,UAAA,IAGA,GAAA,IAAAiS,EACAD,EAAA,IAAAxI,GAAA,QACA,GAAA,IAAAyI,EACA,GAAAzE,GAAAxN,UAAA,IACAgS,EAAA,IAAAxI,GAAA,EAAAxJ,UAAA,SACA,GAAA6N,GAAA7N,UAAA,IAKA,IAHA+E,GADAiN,EAAAhS,UAAA,IACAxE,SAGAwD,GAAAgT,IAAAzB,GAAAyB,EAAA,KAEA,GADAA,ECxLA,SAAoBA,EAAKtO,GACxB,IAAIqB,EACAc,EACAtK,EACAqE,EAIJ,IAFAmF,EAAMrB,EAAIlI,OACVoE,EAAI,EACErE,EAAI,EAAGA,EAAIwJ,EAAKxJ,IAAM,CAE3B,IAAMgV,GADN1K,EAAInC,EAAKnI,IAER,OAAO,KAERyW,EAAKpS,GAAM4R,GAAO3L,GAClBmM,EAAKpS,EAAE,GAAM6R,GAAO5L,GACpBjG,GAAK,CACL,CACD,OAAOoS,CACR,CDsKAE,CAAA,IAAA1I,GAAA,EAAAzE,GAAAiN,GACA,OAAAA,EAAA,CAEA,IAAAxB,GAAAzL,GACA,MAAA,IAAAoN,WAAArR,EAAA,6GAAAiE,IAGAiN,EAAA,IAAAxI,GAAAxJ,UAAA,GACA,MACA,CACA,GAAA0Q,GAAAsB,GACAA,EAAAI,GAAAJ,EAAA,QACA,GAAArB,GAAAqB,GACAA,EAAAK,GAAAL,EAAA,QACA,IAAAxB,GAAAzL,GACA,MAAA,IAAAoN,WAAArR,EAAA,6HAAAiE,IAEAiN,EAAA,IAAAxI,GAAAwI,EACA,MACA,GAAAhE,GAAAhO,UAAA,IAAA,CAEA,IAAAqN,IADA2E,EAAAhS,UAAA,IACAsS,WAAA7B,IACA,MAAA,IAAA0B,WAAArR,EAAA,yFAAA2P,GAAAuB,EAAAM,aAEAN,EAAA,IAAAxI,GAAAwI,EACA,KAAA,KAAA7L,GAAAnG,UAAA,IAkBA,MAAA,IAAAH,UAAAiB,EAAA,qHAAAd,UAAA,KAhBA,GADAgS,EAAAhS,UAAA,IACA,IAAA0R,GACA,MAAA,IAAA7R,UAAAiB,EAAA,mJAAAkR,IAEA,IAAAvC,GAAAuC,EAAAO,KACA,MAAA,IAAA1S,UAAAiB,EAAA,qHAAAkR,IAGA,IAAAvC,IADAuC,EAAAA,EAAAO,OACAjB,MACA,MAAA,IAAAzR,UAAAiB,EAAA,qHAAAkR,IAGA,IADAA,EAAAZ,GAAAY,cACA1U,MACA,MAAA0U,EAEAA,EAAA,IAAAxI,GAAAwI,EAGA,KACA,CAEA,IAAAhE,GADAgE,EAAAhS,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,wEAAAkR,IAGA,IAAAxE,GADA2D,EAAAnR,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,4EAAAqQ,IAEA,IAAA9D,GAAA8D,EAAAV,IACA,MAAA,IAAA0B,WAAArR,EAAA,uEAAA2P,GAAAU,IAEA,GAAA,IAAAc,EAAA,CAEA,IAAA5E,IADAtI,EAAAiN,EAAAM,WAAAnB,GACAV,IACA,MAAA,IAAA0B,WAAArR,EAAA,oGAAA2P,GAAA1L,IAEAiN,EAAA,IAAAxI,GAAAwI,EAAAb,EACA,KAAA,CAEA,IAAA3D,GADAzI,EAAA/E,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,uEAAAiE,IAEA,GAAAA,EAAA0L,GAAAuB,EAAAM,WAAAnB,EACA,MAAA,IAAAgB,WAAArR,EAAA,iJAAAiE,EAAA0L,KAEAuB,EAAA,IAAAxI,GAAAwI,EAAAb,EAAA,EAAApM,EACA,CACA,CAIA,OAHA1B,EAAAyM,KAAA,UAAAkC,GACA3O,EAAAyM,KAAA,UAAAkC,EAAAxW,OAAA,GAEAsU,IACA,CEzQA,SAASF,GAAMoB,GACd,OAAOA,EAAEhB,EACV,CCFA,SAASH,GAAMmB,GACd,OAAOA,EAAEf,EACV,CCEA,SAASmB,GAAcC,GACtB,IAAIrV,EACA6J,EACAmL,EAGJ,IADAhV,EAAM,KAEL6J,EAAIwL,EAAGC,QACAC,MAIP,GAAK7D,GADLsD,EAAInL,EAAEhK,QACyBmV,EAAExV,QAAU,EAC1CQ,EAAI6E,KAAMmQ,EAAG,GAAKA,EAAG,QACf,KAAKT,GAAeS,GAG1B,OAAO,IAAInR,UAAWiB,EAAQ,kJAAmJkQ,IAFjLhV,EAAI6E,KAAM+O,GAAMoB,GAAKnB,GAAMmB,GAG3B,CAEF,OAAOhV,CACR,CJ+PAqH,EAAA4G,GAAA,oBAAAwG,IAeApN,EAAA4G,GAAA,OAAA,kBAmDAvH,EAAAuH,GAAA,QAAA,SAAAuI,GACA,IAAAC,EACAR,EACAS,EACA1W,EACAgW,EACAW,EACApQ,EACAwC,EACA6N,EACA/M,EACAtK,EACAqE,EACA,IAAA6P,GAAAK,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAAiS,GAAAhC,MACA,MAAA,IAAAjQ,UAAA,6DAGA,IADAoS,EAAAjS,UAAAxE,QACA,EAAA,CAEA,IAAAiU,GADAiD,EAAA1S,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,qEAAA4R,IAEAT,EAAA,IACAQ,EAAAzS,UAAA,GAEA,CACA,GAAA2R,GAAAa,GAAA,CAEA,GADAzN,EAAAyN,EAAAhX,OACAkX,EAAA,CAIA,IAFAV,GADAhW,EAAA,IAAA8T,KAAA/K,IACA8M,QACAjS,EAAA,EACArE,EAAA,EAAAA,EAAAwJ,EAAAxJ,IAAA,CAEA,GAAAgV,GADA1K,EAAA6M,EAAA9U,KAAA6U,EAAAD,EAAAjQ,IAAAhH,GAAAA,IAEAyW,EAAApS,GAAA4R,GAAA3L,GACAmM,EAAApS,EAAA,GAAA6R,GAAA5L,OACA,MAAA6H,GAAA7H,IAAAA,EAAArK,QAAA,GAIA,MAAA,IAAAqE,UAAAiB,EAAA,+IAAA+E,IAHAmM,EAAApS,GAAAiG,EAAA,GACAmM,EAAApS,EAAA,GAAAiG,EAAA,EAGA,CACAjG,GAAA,CACA,CACA,OAAA5D,CACA,CACA,OAAA,IAAA8T,KAAA0C,EACA,CACA,GAAA3E,GAAA2E,GAAA,CACA,GAAAE,EAAA,CAUA,IAPA3N,EAAAyN,EAAAhX,OAEA+G,EADAiQ,EAAAjQ,KAAAiQ,EAAAhQ,IACA+F,EAAA,WAEAzE,EAAA,WAGAvI,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACA,IAAAgV,GAAAhO,EAAAiQ,EAAAjX,IAAA,CACAqX,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAApC,GAAAzL,GACA,MAAA,IAAAoN,WAAArR,EAAA,+FAAA,EAAAiE,IAIA,IADAiN,GADAhW,EAAA,IAAA8T,KAAA/K,EAAA,IACA8M,QACAtW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAyW,EAAAzW,GAAAmX,EAAA9U,KAAA6U,EAAAlQ,EAAAiQ,EAAAjX,GAAAA,GAEA,OAAAS,CACA,CAKA,IAFAgW,GADAhW,EAAA,IAAA8T,KAAA/K,IACA8M,QACAjS,EAAA,EACArE,EAAA,EAAAA,EAAAwJ,EAAAxJ,IAAA,CAEA,GAAAgV,GADA1K,EAAA6M,EAAA9U,KAAA6U,EAAAlQ,EAAAiQ,EAAAjX,GAAAA,IAEAyW,EAAApS,GAAA4R,GAAA3L,GACAmM,EAAApS,EAAA,GAAA6R,GAAA5L,OACA,MAAA6H,GAAA7H,IAAAA,EAAArK,QAAA,GAIA,MAAA,IAAAqE,UAAAiB,EAAA,+IAAA+E,IAHAmM,EAAApS,GAAAiG,EAAA,GACAmM,EAAApS,EAAA,GAAAiG,EAAA,EAGA,CACAjG,GAAA,CACA,CACA,OAAA5D,CACA,CACA,OAAA,IAAA8T,KAAA0C,EACA,CACA,GAAArM,GAAAqM,IAAAd,IAAAjC,GAAA+C,EAAAD,KAAA,CAEA,IAAA9C,IADAuC,EAAAQ,EAAAD,OACAjB,MACA,MAAA,IAAAzR,UAAAiB,EAAA,6FAAA0R,IAOA,GAJAG,EADAD,EK/bA,SAA0BrB,EAAIqB,EAAMD,GACnC,IAAIzW,EACA6J,EACAmL,EACAzV,EAIJ,IAFAS,EAAM,GACNT,GAAK,IAEJsK,EAAIwL,EAAGC,QACAC,MAKP,GAFAhW,GAAK,EAEAmS,GADLsD,EAAI0B,EAAK9U,KAAM6U,EAAS5M,EAAEhK,MAAON,KACFyV,EAAExV,QAAU,EAC1CQ,EAAI6E,KAAMmQ,EAAG,GAAKA,EAAG,QACf,KAAKT,GAAeS,GAG1B,OAAO,IAAInR,UAAWiB,EAAQ,+IAAgJkQ,IAF9KhV,EAAI6E,KAAM2Q,GAAOR,GAAKS,GAAOT,GAG7B,CAEF,OAAOhV,CACR,CLwaA6W,CAAAb,EAAAU,EAAAD,GAEArB,GAAAY,GAEAW,aAAArV,MACA,MAAAqV,EAKA,IADAX,GADAhW,EAAA,IAAA8T,KADA/K,EAAA4N,EAAAnX,OAAA,IAEAqW,QACAtW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAyW,EAAAzW,GAAAoX,EAAApX,GAEA,OAAAS,CACA,CACA,MAAA,IAAA6D,UAAAiB,EAAA,6FAAA0R,GACA,IAoBAnP,EAAA4G,GAAA,MAAA,WACA,IAAAlJ,EACAxF,EACA,IAAAkU,GAAAK,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAAiS,GAAAhC,MACA,MAAA,IAAAjQ,UAAA,6DAGA,IADAkB,EAAA,GACAxF,EAAA,EAAAA,EAAAyE,UAAAxE,OAAAD,IACAwF,EAAAF,KAAAb,UAAAzE,IAEA,OAAA,IAAAuU,KAAA/O,EACA,IAuDA2B,EAAAuH,GAAAtN,UAAA,MAAA,SAAAgH,GACA,IAAAgO,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAAwN,GAAA1J,GACA,MAAA,IAAA9D,UAAAiB,EAAA,0DAAA6C,IAKA,GAHAA,EAAA,IACAA,GAAAmM,KAAA8B,WAEAjO,EAAA,GAAAA,GAAAmM,KAAA8B,SAGA,OAAAG,GAAAjC,KAAA+B,QAAAlO,EACA,IAgBAoN,GAAA9G,GAAAtN,UAAA,UAAA,WACA,OAAAmT,KAAA+B,QAAAX,MACA,IAgBAH,GAAA9G,GAAAtN,UAAA,cAAA,WACA,OAAAmT,KAAA+B,QAAAS,UACA,IAgBAvB,GAAA9G,GAAAtN,UAAA,cAAA,WACA,OAAAmT,KAAA+B,QAAAV,UACA,IAiBAzO,EAAAuH,GAAAtN,UAAA,oBAAAsN,GAAAwG,mBAuCApN,EAAA4G,GAAAtN,UAAA,cAAA,SAAAmW,EAAAC,GACA,IAAApB,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAQA,OALA,IAAAG,UAAAxE,OACAsU,KAAA+B,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,GAEAjD,KAAA+B,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,EAAA,EAAA/S,UAAA,IAEA8P,IACA,IAqCApN,EAAAuH,GAAAtN,UAAA,WAAA,WACA,IAAA4R,EACA0E,EACAlO,EACAiN,EACA/M,EACA1J,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAiBA,OAfA0O,EAAAuB,KACAkC,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QAGArW,GAAA,EAIA8H,EADA4P,EAAA,CAAA,EACA,QAcA,WAEA,GADA1X,GAAA,EACA0J,GAAA1J,GAAAwJ,EACA,MAAA,CACAwM,MAAA,GAGA,MAAA,CACA1V,MAAA,CAAAN,EAAAwW,GAAAC,EAAAzW,IACAgW,MAAA,EAEA,IAxBAlO,EAAA4P,EAAA,UAiCA,SAAApX,GAEA,GADAoJ,GAAA,EACAjF,UAAAxE,OACA,MAAA,CACAK,MAAAA,EACA0V,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAgB,IACAlP,EAAA4P,EAAAV,IAiDA,WACA,OAAAhE,EAAA2E,SACA,IAjDAD,CAkDA,IA+BA5P,EAAA4G,GAAAtN,UAAA,SAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAzW,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAqJ,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACA,IAAAoN,EAAA/K,KAAA6U,EAAAV,GAAAC,EAAAzW,GAAAA,EAAAuU,MACA,OAAA,EAGA,OAAA,CACA,IA2CAzM,EAAA4G,GAAAtN,UAAA,QAAA,SAAAd,EAAAkX,EAAAI,GACA,IAAAnB,EACAjN,EACApB,EACAqM,EACAC,EACA1U,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA0Q,GAAA1U,GACA,MAAA,IAAAgE,UAAAiB,EAAA,0EAAAjF,IAIA,GAFAmW,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACA5R,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAA0F,GACA,MAAA,IAAAlT,UAAAiB,EAAA,qEAAAiS,IAQA,GANAA,EAAA,IACAA,GAAAhO,GACA,IACAgO,EAAA,GAGA/S,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAA8F,GACA,MAAA,IAAAtT,UAAAiB,EAAA,oEAAAqS,IAEAA,EAAA,IACAA,GAAApO,GACA,IACAoO,EAAA,GAGAA,EAAApO,IACAoO,EAAApO,EAEA,MACAoO,EAAApO,CAEA,MACAgO,EAAA,EACAI,EAAApO,EAIA,IAFAiL,EAAAwB,GAAA3V,GACAoU,EAAAwB,GAAA5V,GACAN,EAAAwX,EAAAxX,EAAA4X,EAAA5X,IAEAyW,EADArO,EAAA,EAAApI,GACAyU,EACAgC,EAAArO,EAAA,GAAAsM,EAEA,OAAAH,IACA,IA2CAzM,EAAA4G,GAAAtN,UAAA,UAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAhW,EACAT,EACAyV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAIA,IAFAqJ,EAAAlC,KAAA+B,QACA7V,EAAA,GACAT,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACAyV,EAAAe,GAAAC,EAAAzW,GACAoN,EAAA/K,KAAA6U,EAAAzB,EAAAzV,EAAAuU,OACA9T,EAAA6E,KAAAmQ,GAGA,OAAA,IAAAlB,KAAA/G,YAAA/M,EACA,IAsCAqH,EAAA4G,GAAAtN,UAAA,QAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAzW,EACAyV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAqJ,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IAEA,GADAyV,EAAAe,GAAAC,EAAAzW,GACAoN,EAAA/K,KAAA6U,EAAAzB,EAAAzV,EAAAuU,MACA,OAAAkB,CAGA,IAgCA3N,EAAA4G,GAAAtN,UAAA,aAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAzW,EACAyV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAqJ,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IAEA,GADAyV,EAAAe,GAAAC,EAAAzW,GACAoN,EAAA/K,KAAA6U,EAAAzB,EAAAzV,EAAAuU,MACA,OAAAvU,EAGA,OAAA,CACA,IAsCA8H,EAAA4G,GAAAtN,UAAA,YAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAzW,EACAyV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAqJ,EAAAlC,KAAA+B,QACAtW,EAAAuU,KAAA8B,QAAA,EAAArW,GAAA,EAAAA,IAEA,GADAyV,EAAAe,GAAAC,EAAAzW,GACAoN,EAAA/K,KAAA6U,EAAAzB,EAAAzV,EAAAuU,MACA,OAAAkB,CAGA,IAgCA3N,EAAA4G,GAAAtN,UAAA,iBAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAzW,EACAyV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAqJ,EAAAlC,KAAA+B,QACAtW,EAAAuU,KAAA8B,QAAA,EAAArW,GAAA,EAAAA,IAEA,GADAyV,EAAAe,GAAAC,EAAAzW,GACAoN,EAAA/K,KAAA6U,EAAAzB,EAAAzV,EAAAuU,MACA,OAAAvU,EAGA,OAAA,CACA,IA4BA8H,EAAA4G,GAAAtN,UAAA,WAAA,SAAAyW,EAAAX,GACA,IAAAT,EACAzW,EACAyV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAA2D,GACA,MAAA,IAAAvT,UAAAiB,EAAA,oEAAAsS,IAGA,IADApB,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACAyV,EAAAe,GAAAC,EAAAzW,GACA6X,EAAAxV,KAAA6U,EAAAzB,EAAAzV,EAAAuU,KAEA,IAyCApN,EAAAuH,GAAAtN,UAAA,OAAA,SAAAgH,GACA,IAAAgO,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA2N,GAAA7J,GACA,MAAA,IAAA9D,UAAAiB,EAAA,qEAAA6C,IAEA,KAAAA,GAAAmM,KAAA8B,SAGA,OAAAG,GAAAjC,KAAA+B,QAAAlO,EACA,IAmCAN,EAAA4G,GAAAtN,UAAA,YAAA,SAAA0W,EAAAC,GACA,IAAAtB,EACArO,EACAqM,EACAC,EACA1U,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA0Q,GAAA8C,GACA,MAAA,IAAAxT,UAAAiB,EAAA,0EAAAuS,IAEA,GAAArT,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAAiG,GACA,MAAA,IAAAzT,UAAAiB,EAAA,qEAAAwS,IAEAA,EAAA,IACAA,GAAAxD,KAAA8B,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAtD,EAAAwB,GAAA6B,GACApD,EAAAwB,GAAA4B,GACArB,EAAAlC,KAAA+B,QACAtW,EAAA+X,EAAA/X,EAAAuU,KAAA8B,QAAArW,IAEA,GAAAyU,IAAAgC,EADArO,EAAA,EAAApI,IACA0U,IAAA+B,EAAArO,EAAA,GACA,OAAA,EAGA,OAAA,CACA,IAmCAN,EAAA4G,GAAAtN,UAAA,WAAA,SAAA0W,EAAAC,GACA,IAAAtB,EACArO,EACAqM,EACAC,EACA1U,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA0Q,GAAA8C,GACA,MAAA,IAAAxT,UAAAiB,EAAA,0EAAAuS,IAEA,GAAArT,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAAiG,GACA,MAAA,IAAAzT,UAAAiB,EAAA,qEAAAwS,IAEAA,EAAA,IACAA,GAAAxD,KAAA8B,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAtD,EAAAwB,GAAA6B,GACApD,EAAAwB,GAAA4B,GACArB,EAAAlC,KAAA+B,QACAtW,EAAA+X,EAAA/X,EAAAuU,KAAA8B,QAAArW,IAEA,GAAAyU,IAAAgC,EADArO,EAAA,EAAApI,IACA0U,IAAA+B,EAAArO,EAAA,GACA,OAAApI,EAGA,OAAA,CACA,IAyBAmH,EAAAuH,GAAAtN,UAAA,QAAA,SAAA4W,GACA,IAAAvX,EACAgW,EACAwB,EACAjY,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,GAAA,IAAAG,UAAAxE,OACAgY,EAAA,QACA,KAAAxO,EAAAuO,GAGA,MAAA,IAAA1T,UAAAiB,EAAA,kEAAAyS,IAFAC,EAAAD,CAGA,CAGA,IAFAvX,EAAA,GACAgW,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACAS,EAAA6E,KAAAkR,GAAAC,EAAAzW,GAAAgC,YAEA,OAAAvB,EAAAyX,KAAAD,EACA,IA4BA9Q,EAAAuH,GAAAtN,UAAA,QAAA,WACA,IAAA4R,EACA0E,EACAlO,EACAE,EACA1J,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAgBA,OAdA0O,EAAAuB,KACA/K,EAAA+K,KAAA8B,QAGArW,GAAA,EAIA8H,EADA4P,EAAA,CAAA,EACA,QAcA,WAEA,GADA1X,GAAA,EACA0J,GAAA1J,GAAAwJ,EACA,MAAA,CACAwM,MAAA,GAGA,MAAA,CACA1V,MAAAN,EACAgW,MAAA,EAEA,IAxBAlO,EAAA4P,EAAA,UAiCA,SAAApX,GAEA,GADAoJ,GAAA,EACAjF,UAAAxE,OACA,MAAA,CACAK,MAAAA,EACA0V,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAgB,IACAlP,EAAA4P,EAAAV,IAiDA,WACA,OAAAhE,EAAAmF,MACA,IAjDAT,CAkDA,IAsCA5P,EAAA4G,GAAAtN,UAAA,eAAA,SAAA0W,EAAAC,GACA,IAAAtB,EACArO,EACAqM,EACAC,EACA1U,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA0Q,GAAA8C,GACA,MAAA,IAAAxT,UAAAiB,EAAA,0EAAAuS,IAEA,GAAArT,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAAiG,GACA,MAAA,IAAAzT,UAAAiB,EAAA,qEAAAwS,IAEAA,GAAAxD,KAAA8B,QACA0B,EAAAxD,KAAA8B,QAAA,EACA0B,EAAA,IACAA,GAAAxD,KAAA8B,QAEA,MACA0B,EAAAxD,KAAA8B,QAAA,EAKA,IAHA5B,EAAAwB,GAAA6B,GACApD,EAAAwB,GAAA4B,GACArB,EAAAlC,KAAA+B,QACAtW,EAAA+X,EAAA/X,GAAA,EAAAA,IAEA,GAAAyU,IAAAgC,EADArO,EAAA,EAAApI,IACA0U,IAAA+B,EAAArO,EAAA,GACA,OAAApI,EAGA,OAAA,CACA,IAgBAwV,GAAA9G,GAAAtN,UAAA,UAAA,WACA,OAAAmT,KAAA8B,OACA,IAyCAvO,EAAA4G,GAAAtN,UAAA,OAAA,SAAAyW,EAAAX,GACA,IAAAkB,EACA3B,EACAhW,EACAT,EACAsK,EACA,IAAA8L,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAA2D,GACA,MAAA,IAAAvT,UAAAiB,EAAA,oEAAAsS,IAKA,IAHApB,EAAAlC,KAAA+B,QAEA8B,GADA3X,EAAA,IAAA8T,KAAA/G,YAAA+G,KAAA8B,UACAC,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IAEA,GAAAgV,GADA1K,EAAAuN,EAAAxV,KAAA6U,EAAAV,GAAAC,EAAAzW,GAAAA,EAAAuU,OAEA6D,EAAA,EAAApY,GAAAiW,GAAA3L,GACA8N,EAAA,EAAApY,EAAA,GAAAkW,GAAA5L,OACA,KAAA6H,GAAA7H,IAAA,IAAAA,EAAArK,OAIA,MAAA,IAAAqE,UAAAiB,EAAA,+IAAA+E,IAHA8N,EAAA,EAAApY,GAAAsK,EAAA,GACA8N,EAAA,EAAApY,EAAA,GAAAsK,EAAA,EAGA,CAEA,OAAA7J,CACA,IAmCAqH,EAAA4G,GAAAtN,UAAA,UAAA,SAAAiX,EAAAC,GACA,IAAA7B,EACA8B,EACA/O,EAEAxJ,EAEA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAAmE,GACA,MAAA,IAAA/T,UAAAiB,EAAA,oEAAA8S,IAIA,GAFA5B,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACA5R,UAAAxE,OAAA,EACAsY,EAAAD,EACAtY,EAAA,MACA,CACA,GAAA,IAAAwJ,EACA,MAAA,IAAAzH,MAAA,oGAEAwW,EAAA/B,GAAAC,EAAA,GACAzW,EAAA,CACA,CACA,KAAAA,EAAAwJ,EAAAxJ,IAEAuY,EAAAF,EAAAE,EADA/B,GAAAC,EAAAzW,GACAA,EAAAuU,MAEA,OAAAgE,CACA,IAmCAzQ,EAAA4G,GAAAtN,UAAA,eAAA,SAAAiX,EAAAC,GACA,IAAA7B,EACA8B,EACA/O,EAEAxJ,EAEA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAAmE,GACA,MAAA,IAAA/T,UAAAiB,EAAA,oEAAA8S,IAIA,GAFA5B,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACA5R,UAAAxE,OAAA,EACAsY,EAAAD,EACAtY,EAAAwJ,EAAA,MACA,CACA,GAAA,IAAAA,EACA,MAAA,IAAAzH,MAAA,oGAEAwW,EAAA/B,GAAAC,EAAAjN,EAAA,GACAxJ,EAAAwJ,EAAA,CACA,CACA,KAAAxJ,GAAA,EAAAA,IAEAuY,EAAAF,EAAAE,EADA/B,GAAAC,EAAAzW,GACAA,EAAAuU,MAEA,OAAAgE,CACA,IAmDApR,EAAAuH,GAAAtN,UAAA,WAAA,WACA,IAAAqV,EACAW,EACA5N,EACAgP,EACAxY,EACAqE,EACA,IAAA+R,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAKA,IAHAkF,EAAA+K,KAAA8B,QACAI,EAAAlC,KAAA+B,QACAkC,EAAA3G,GAAArI,EAAA,GACAxJ,EAAA,EAAAA,EAAAwY,EAAAxY,IACAqE,EAAAmF,EAAAxJ,EAAA,EACAoX,EAAAX,EAAA,EAAAzW,GACAyW,EAAA,EAAAzW,GAAAyW,EAAA,EAAApS,GACAoS,EAAA,EAAApS,GAAA+S,EACAA,EAAAX,EAAA,EAAAzW,EAAA,GACAyW,EAAA,EAAAzW,EAAA,GAAAyW,EAAA,EAAApS,EAAA,GACAoS,EAAA,EAAApS,EAAA,GAAA+S,EAEA,OAAA7C,IACA,IAgEApN,EAAAuH,GAAAtN,UAAA,OAAA,SAAAd,GAEA,IAAAmY,EACArQ,EACAqO,EACAW,EACAC,EACAmB,EACAlO,EACAtK,EACAqE,EACA,IAAA+R,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAGA,GADAmS,EAAAlC,KAAA+B,QACA7R,UAAAxE,OAAA,GAEA,IAAAgS,GADA7J,EAAA3D,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,+EAAA6C,SAGAA,EAAA,EAEA,GAAA4M,GAAA1U,GAAA,CACA,GAAA8H,GAAAmM,KAAA8B,QACA,MAAA,IAAAO,WAAArR,EAAA,kEAAA6C,IAKA,OAFAqO,EADArO,GAAA,GACA6N,GAAA3V,QACAmW,EAAArO,EAAA,GAAA8N,GAAA5V,GAEA,CACA,GAAA8V,GAAA9V,GAAA,CAEA,GAAA8H,GADAoQ,EAAAlY,EAAA+V,SACA9B,KAAA8B,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA6B,EAAAnY,EAAAgW,QAGAjS,EAAAoS,EAAAb,WAAAxN,EAAA8M,GAEAuD,EAAA9C,SAAAc,EAAAd,QAEA8C,EAAA7C,WAAAvR,GACAoU,EAAA7C,WAAA6C,EAAA1B,WAAA1S,EAEA,CAGA,IADA+S,EAAA,IAAAnJ,GAAAwK,EAAAxY,QACAD,EAAA,EAAAA,EAAAyY,EAAAxY,OAAAD,IACAoX,EAAApX,GAAAyY,EAAAzY,GAEAyY,EAAArB,CACA,CAGA,IAFAhP,GAAA,EACA/D,EAAA,EACArE,EAAA,EAAAA,EAAAwY,EAAAxY,IACAyW,EAAArO,GAAAqQ,EAAApU,GACAoS,EAAArO,EAAA,GAAAqQ,EAAApU,EAAA,GACA+D,GAAA,EACA/D,GAAA,CAGA,KAhCA,CAiCA,IAAAiO,GAAAhS,GA2DA,MAAA,IAAAgE,UAAAiB,EAAA,kIAAAjF,IAxDA,IADAkY,EAAAlY,EAAAL,OACAD,EAAA,EAAAA,EAAAwY,EAAAxY,IACA,IAAAgV,GAAA1U,EAAAN,IAAA,CACAqX,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAApC,GAAAuD,GACA,MAAA,IAAA5B,WAAArR,EAAA,6GAAAiT,IAEA,GAAApQ,EAAAoQ,EAAA,EAAAjE,KAAA8B,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA6B,EAAAnY,EAGA+D,EAAAoS,EAAAb,WAAAxN,EAAA8M,GAEAuD,EAAA9C,SAAAc,EAAAd,QAEA8C,EAAA7C,WAAAvR,GACAoU,EAAA7C,WAAA6C,EAAA1B,WAAA1S,EAEA,CAGA,IADA+S,EAAA,IAAAnJ,GAAAuK,GACAxY,EAAA,EAAAA,EAAAwY,EAAAxY,IACAoX,EAAApX,GAAAyY,EAAAzY,GAEAyY,EAAArB,CACA,CAIA,IAHAhP,GAAA,EACAoQ,GAAA,EACAnU,EAAA,EACArE,EAAA,EAAAA,EAAAwY,EAAAxY,IACAyW,EAAArO,GAAAqQ,EAAApU,GACAoS,EAAArO,EAAA,GAAAqQ,EAAApU,EAAA,GACA+D,GAAA,EACA/D,GAAA,EAEA,MACA,CAEA,GAAA+D,EAAAoQ,EAAAjE,KAAA8B,QACA,MAAA,IAAAO,WAAA,0FAGA,IADAxO,GAAA,EACApI,EAAA,EAAAA,EAAAwY,EAAAxY,IACAsK,EAAAhK,EAAAN,GACAyW,EAAArO,GAAA6N,GAAA3L,GACAmM,EAAArO,EAAA,GAAA8N,GAAA5L,GACAlC,GAAA,CAxDA,CA+DA,IA2EAN,EAAA4G,GAAAtN,UAAA,SAAA,SAAAoW,EAAAI,GACA,IAAAc,EACAN,EACA3X,EACA2H,EACAqO,EACAjN,EACAxJ,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAIA,GAFAmS,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACA,IAAA5R,UAAAxE,OACAuX,EAAA,EACAI,EAAApO,MACA,CACA,IAAAsI,GAAA0F,GACA,MAAA,IAAAlT,UAAAiB,EAAA,oEAAAiS,IAQA,GANAA,EAAA,IACAA,GAAAhO,GACA,IACAgO,EAAA,GAGA,IAAA/S,UAAAxE,OACA2X,EAAApO,MACA,CACA,IAAAsI,GAAA8F,GACA,MAAA,IAAAtT,UAAAiB,EAAA,qEAAAqS,IAEAA,EAAA,GACAA,GAAApO,GACA,IACAoO,EAAA,GAEAA,EAAApO,IACAoO,EAAApO,EAEA,CACA,CAQA,IANAkP,EADAlB,EAAAI,EACAA,EAAAJ,EAEA,EAGAY,GADA3X,EAAA,IAAA8T,KAAA/G,YAAAkL,IACApC,QACAtW,EAAA,EAAAA,EAAA0Y,EAAA1Y,IACAoI,EAAA,GAAApI,EAAAwX,GACAY,EAAA,EAAApY,GAAAyW,EAAArO,GACAgQ,EAAA,EAAApY,EAAA,GAAAyW,EAAArO,EAAA,GAEA,OAAA3H,CACA,IA+BAqH,EAAA4G,GAAAtN,UAAA,QAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAzW,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAqJ,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACA,GAAAoN,EAAA/K,KAAA6U,EAAAV,GAAAC,EAAAzW,GAAAA,EAAAuU,MACA,OAAA,EAGA,OAAA,CACA,IA6EApN,EAAAuH,GAAAtN,UAAA,QAAA,SAAAuX,GACA,IAAAvB,EACAX,EACAjN,EACAxJ,EACAqE,EACA,IAAA+R,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAAyE,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAKA,IAHAlC,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACAe,EAAA,GACApX,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAoX,EAAA9R,KAAAkR,GAAAC,EAAAzW,IAGA,IADAoX,EAAAwB,KAAAD,GACA3Y,EAAA,EAAAA,EAAAwJ,EAAAxJ,IAEAyW,EADApS,EAAA,EAAArE,GACAiW,GAAAmB,EAAApX,IACAyW,EAAApS,EAAA,GAAA6R,GAAAkB,EAAApX,IAEA,OAAAuU,IACA,IA2EAzM,EAAA4G,GAAAtN,UAAA,YAAA,SAAAyX,EAAAjB,GACA,IAAAnQ,EACAgP,EACAjN,EACA,IAAA4M,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAIA,GAFAmS,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACA,IAAA5R,UAAAxE,OACA4Y,EAAA,EACAjB,EAAApO,MACA,CACA,IAAAsI,GAAA+G,GACA,MAAA,IAAAvU,UAAAiB,EAAA,oEAAAsT,IAQA,GANAA,EAAA,IACAA,GAAArP,GACA,IACAqP,EAAA,GAGA,IAAApU,UAAAxE,OACA2X,EAAApO,MACA,CACA,IAAAsI,GAAA8F,GACA,MAAA,IAAAtT,UAAAiB,EAAA,qEAAAqS,IAEAA,EAAA,GACAA,GAAApO,GACA,IACAoO,EAAA,GAEAA,EAAApO,IACAoO,EAAApO,EAEA,CACA,CAWA,OAVAqP,GAAArP,GACAA,EAAA,EACA/B,EAAAgP,EAAAM,YACA8B,GAAAjB,GACApO,EAAA,EACA/B,EAAAgP,EAAAb,WAAAiD,EAAA3D,KAEA1L,EAAAoO,EAAAiB,EACApR,EAAAgP,EAAAb,WAAAiD,EAAA3D,IAEA,IAAAX,KAAA/G,YAAAiJ,EAAAd,OAAAlO,EAAA+B,EAAA,EAAA,EAAAA,EACA,IAwBA1B,EAAA4G,GAAAtN,UAAA,kBAAA,SAAA0X,EAAAC,GACA,IAAAC,EACAC,EACAxY,EACAgW,EACAzW,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,GAAA,IAAAG,UAAAxE,OACAgZ,EAAA,OACA,KAAAxP,EAAAqP,KAAAlG,GAAAkG,GAGA,MAAA,IAAAxU,UAAAiB,EAAA,yFAAAuT,IAFAG,EAAAH,CAGA,CACA,GAAArU,UAAAxE,OAAA,EACA+Y,EAAA,CAAA,MACA,KAAApO,GAAAmO,GAGA,MAAA,IAAAzU,UAAAiB,EAAA,qEAAAwT,IAFAC,EAAAD,CAGA,CAGA,IAFAtC,EAAAlC,KAAA+B,QACA7V,EAAA,GACAT,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACAS,EAAA6E,KAAAkR,GAAAC,EAAAzW,GAAAkZ,eAAAD,EAAAD,IAEA,OAAAvY,EAAAyX,KAAA,IACA,IAmDA/Q,EAAAuH,GAAAtN,UAAA,cAAA,WACA,IAAAgX,EACA3X,EACA+I,EACAiN,EACAzW,EACAqE,EACA,IAAA+R,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAMA,IAJAkF,EAAA+K,KAAA8B,QACA5V,EAAA,IAAA8T,KAAA/G,YAAAhE,GACAiN,EAAAlC,KAAA+B,QACA8B,EAAA3X,EAAA6V,QACAtW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAqE,EAAAmF,EAAAxJ,EAAA,EACAoY,EAAA,EAAApY,GAAAyW,EAAA,EAAApS,GACA+T,EAAA,EAAApY,EAAA,GAAAyW,EAAA,EAAApS,EAAA,GAEA,OAAA5D,CACA,IA6EA0G,EAAAuH,GAAAtN,UAAA,YAAA,SAAAuX,GACA,IAAAvB,EACAX,EACAjN,EACAxJ,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAAyE,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAKA,IAHAlC,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACAe,EAAA,GACApX,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAoX,EAAA9R,KAAAkR,GAAAC,EAAAzW,IAGA,OADAoX,EAAAwB,KAAAD,GACA,IAAAjK,GAAA0I,EACA,IAoBAjQ,EAAAuH,GAAAtN,UAAA,YAAA,WACA,IAAAX,EACAgW,EACAzW,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAIA,IAFA7D,EAAA,GACAgW,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACAS,EAAA6E,KAAAkR,GAAAC,EAAAzW,GAAAgC,YAEA,OAAAvB,EAAAyX,KAAA,IACA,IA0CA/Q,EAAAuH,GAAAtN,UAAA,UAAA,WACA,IAAAsW,EACA1E,EACAxJ,EACAE,EACA+M,EACAzW,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAiBA,OAfA0O,EAAAuB,KACAkC,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QAGArW,GAAA,EAIA8H,EADA4P,EAAA,CAAA,EACA,QAcA,WAEA,GADA1X,GAAA,EACA0J,GAAA1J,GAAAwJ,EACA,MAAA,CACAwM,MAAA,GAGA,MAAA,CACA1V,MAAAkW,GAAAC,EAAAzW,GACAgW,MAAA,EAEA,IAxBAlO,EAAA4P,EAAA,UAiCA,SAAApX,GAEA,GADAoJ,GAAA,EACAjF,UAAAxE,OACA,MAAA,CACAK,MAAAA,EACA0V,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAgB,IACAlP,EAAA4P,EAAAV,IAiDA,WACA,OAAAhE,EAAAmG,QACA,IAjDAzB,CAkDA,IAuCA5P,EAAA4G,GAAAtN,UAAA,QAAA,SAAAgY,EAAA9Y,GACA,IAAAmW,EACAhW,EACA+I,EACA,IAAA4M,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAAwN,GAAAsH,GACA,MAAA,IAAA9U,UAAAiB,EAAA,oEAAA6T,IAMA,GAJA5P,EAAA+K,KAAA8B,QACA+C,EAAA,IACAA,GAAA5P,GAEA4P,EAAA,GAAAA,GAAA5P,EACA,MAAA,IAAAoN,WAAArR,EAAA,kEAAA6T,IAEA,IAAApE,GAAA1U,GACA,MAAA,IAAAgE,UAAAiB,EAAA,2EAAAjF,IAMA,OAHAmW,GADAhW,EAAA,IAAA8T,KAAA/G,YAAA+G,KAAA+B,UACAA,SACA,EAAA8C,GAAAnD,GAAA3V,GACAmW,EAAA,EAAA2C,EAAA,GAAAlD,GAAA5V,GACAG,CACA,IM15FA,IAAAyU,GAAA,EAAAhH,GAAAgH,kBACAiB,GAAAd,KAYA,SAAAe,GAAA9V,GACA,OACAA,aAAAqO,IAEA,iBAAArO,GACA,OAAAA,IAEA,mBAAAA,EAAAkN,YAAAK,MACA,oBAAAvN,EAAAkN,YAAAK,OAEA,iBAAAvN,EAAA+V,SAGA,iBAAA/V,EAAAgW,OAGA,CASA,SAAAC,GAAAjW,GACA,OACAA,IAAAqO,IAGA,mBAAArO,EAAAuN,IAEA,CAUA,SAAAwL,GAAA5C,EAAArO,GAEA,OAAA,IAAAgM,GAAAqC,EADArO,GAAA,GACAqO,EAAArO,EAAA,GACA,CAyEA,SAAAuG,KACA,IAAAiH,EACAc,EACAD,EACAjN,EAGA,GADAkN,EAAAjS,UAAAxE,SACAsU,gBAAA5F,IACA,OAAA,IAAA+H,EACA,IAAA/H,GAEA,IAAA+H,EACA,IAAA/H,GAAAlK,UAAA,IAEA,IAAAiS,EACA,IAAA/H,GAAAlK,UAAA,GAAAA,UAAA,IAEA,IAAAkK,GAAAlK,UAAA,GAAAA,UAAA,GAAAA,UAAA,IAGA,GAAA,IAAAiS,EACAD,EAAA,IAAAvI,GAAA,QACA,GAAA,IAAAwI,EACA,GAAAzE,GAAAxN,UAAA,IACAgS,EAAA,IAAAvI,GAAA,EAAAzJ,UAAA,SACA,GAAA6N,GAAA7N,UAAA,IAKA,IAHA+E,GADAiN,EAAAhS,UAAA,IACAxE,SAGAwD,GAAAgT,IAAAzB,GAAAyB,EAAA,KAEA,GADAA,ECxLA,SAAoBA,EAAKtO,GACxB,IAAIqB,EACAc,EACAtK,EACAqE,EAIJ,IAFAmF,EAAMrB,EAAIlI,OACVoE,EAAI,EACErE,EAAI,EAAGA,EAAIwJ,EAAKxJ,IAAM,CAE3B,IAAMgV,GADN1K,EAAInC,EAAKnI,IAER,OAAO,KAERyW,EAAKpS,GAAMgQ,GAAM/J,GACjBmM,EAAKpS,EAAE,GAAMiQ,GAAMhK,GACnBjG,GAAK,CACL,CACD,OAAOoS,CACR,CDsKAE,CAAA,IAAAzI,GAAA,EAAA1E,GAAAiN,GACA,OAAAA,EAAA,CAEA,IAAAxB,GAAAzL,GACA,MAAA,IAAAoN,WAAArR,EAAA,6GAAAiE,IAGAiN,EAAA,IAAAvI,GAAAzJ,UAAA,GACA,MACA,CACA,GAAA0Q,GAAAsB,GACAA,EAAAI,GAAAJ,EAAA,QACA,GAAArB,GAAAqB,GACAA,EAAAK,GAAAL,EAAA,QACA,IAAAxB,GAAAzL,GACA,MAAA,IAAAoN,WAAArR,EAAA,6HAAAiE,IAEAiN,EAAA,IAAAvI,GAAAuI,EACA,MACA,GAAAhE,GAAAhO,UAAA,IAAA,CAEA,IAAAqN,IADA2E,EAAAhS,UAAA,IACAsS,WAAA7B,IACA,MAAA,IAAA0B,WAAArR,EAAA,yFAAA2P,GAAAuB,EAAAM,aAEAN,EAAA,IAAAvI,GAAAuI,EACA,KAAA,KAAA7L,GAAAnG,UAAA,IAkBA,MAAA,IAAAH,UAAAiB,EAAA,qHAAAd,UAAA,KAhBA,GADAgS,EAAAhS,UAAA,IACA,IAAA0R,GACA,MAAA,IAAA7R,UAAAiB,EAAA,mJAAAkR,IAEA,IAAAvC,GAAAuC,EAAAO,KACA,MAAA,IAAA1S,UAAAiB,EAAA,qHAAAkR,IAGA,IAAAvC,IADAuC,EAAAA,EAAAO,OACAjB,MACA,MAAA,IAAAzR,UAAAiB,EAAA,qHAAAkR,IAGA,IADAA,EAAAZ,GAAAY,cACA1U,MACA,MAAA0U,EAEAA,EAAA,IAAAvI,GAAAuI,EAGA,KACA,CAEA,IAAAhE,GADAgE,EAAAhS,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,wEAAAkR,IAGA,IAAAxE,GADA2D,EAAAnR,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,4EAAAqQ,IAEA,IAAA9D,GAAA8D,EAAAV,IACA,MAAA,IAAA0B,WAAArR,EAAA,uEAAA2P,GAAAU,IAEA,GAAA,IAAAc,EAAA,CAEA,IAAA5E,IADAtI,EAAAiN,EAAAM,WAAAnB,GACAV,IACA,MAAA,IAAA0B,WAAArR,EAAA,oGAAA2P,GAAA1L,IAEAiN,EAAA,IAAAvI,GAAAuI,EAAAb,EACA,KAAA,CAEA,IAAA3D,GADAzI,EAAA/E,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,uEAAAiE,IAEA,GAAAA,EAAA0L,GAAAuB,EAAAM,WAAAnB,EACA,MAAA,IAAAgB,WAAArR,EAAA,iJAAAiE,EAAA0L,KAEAuB,EAAA,IAAAvI,GAAAuI,EAAAb,EAAA,EAAApM,EACA,CACA,CAIA,OAHA1B,EAAAyM,KAAA,UAAAkC,GACA3O,EAAAyM,KAAA,UAAAkC,EAAAxW,OAAA,GAEAsU,IACA,CEzQA,SAASsB,GAAcC,GACtB,IAAIrV,EACA6J,EAGJ,IADA7J,EAAM,KAEL6J,EAAIwL,EAAGC,QACAC,MAGPvV,EAAI6E,KAAMyN,GAASzI,EAAEhK,QAEtB,OAAOG,CACR,CF2QAqH,EAAA6G,GAAA,oBAAAuG,IAeApN,EAAA6G,GAAA,OAAA,mBAmDAxH,EAAAwH,GAAA,QAAA,SAAAsI,GACA,IAAAC,EACAR,EACAS,EACA1W,EACAgW,EACAW,EACApQ,EACAwC,EACA6N,EACA/M,EACAtK,EACAqE,EACA,IAAA6P,GAAAK,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAAiS,GAAAhC,MACA,MAAA,IAAAjQ,UAAA,6DAGA,IADAoS,EAAAjS,UAAAxE,QACA,EAAA,CAEA,IAAAiU,GADAiD,EAAA1S,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,qEAAA4R,IAEAT,EAAA,IACAQ,EAAAzS,UAAA,GAEA,CACA,GAAA2R,GAAAa,GAAA,CAEA,GADAzN,EAAAyN,EAAAhX,OACAkX,EAAA,CAIA,IAFAV,GADAhW,EAAA,IAAA8T,KAAA/K,IACA8M,QACAjS,EAAA,EACArE,EAAA,EAAAA,EAAAwJ,EAAAxJ,IAAA,CAEA,GAAAgV,GADA1K,EAAA6M,EAAA9U,KAAA6U,EAAAD,EAAAjQ,IAAAhH,GAAAA,IAEAyW,EAAApS,GAAAgQ,GAAA/J,GACAmM,EAAApS,EAAA,GAAAiQ,GAAAhK,OACA,MAAA6H,GAAA7H,IAAAA,EAAArK,QAAA,GAIA,MAAA,IAAAqE,UAAAiB,EAAA,+IAAA+E,IAHAmM,EAAApS,GAAAiG,EAAA,GACAmM,EAAApS,EAAA,GAAAiG,EAAA,EAGA,CACAjG,GAAA,CACA,CACA,OAAA5D,CACA,CACA,OAAA,IAAA8T,KAAA0C,EACA,CACA,GAAA3E,GAAA2E,GAAA,CACA,GAAAE,EAAA,CAUA,IAPA3N,EAAAyN,EAAAhX,OAEA+G,EADAiQ,EAAAjQ,KAAAiQ,EAAAhQ,IACA+F,EAAA,WAEAzE,EAAA,WAGAvI,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACA,IAAAgV,GAAAhO,EAAAiQ,EAAAjX,IAAA,CACAqX,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAApC,GAAAzL,GACA,MAAA,IAAAoN,WAAArR,EAAA,gGAAAiE,IAIA,IADAiN,GADAhW,EAAA,IAAA8T,KAAA/K,EAAA,IACA8M,QACAtW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAyW,EAAAzW,GAAAmX,EAAA9U,KAAA6U,EAAAlQ,EAAAiQ,EAAAjX,GAAAA,GAEA,OAAAS,CACA,CAKA,IAFAgW,GADAhW,EAAA,IAAA8T,KAAA/K,IACA8M,QACAjS,EAAA,EACArE,EAAA,EAAAA,EAAAwJ,EAAAxJ,IAAA,CAEA,GAAAgV,GADA1K,EAAA6M,EAAA9U,KAAA6U,EAAAlQ,EAAAiQ,EAAAjX,GAAAA,IAEAyW,EAAApS,GAAAgQ,GAAA/J,GACAmM,EAAApS,EAAA,GAAAiQ,GAAAhK,OACA,MAAA6H,GAAA7H,IAAAA,EAAArK,QAAA,GAIA,MAAA,IAAAqE,UAAAiB,EAAA,+IAAA+E,IAHAmM,EAAApS,GAAAiG,EAAA,GACAmM,EAAApS,EAAA,GAAAiG,EAAA,EAGA,CACAjG,GAAA,CACA,CACA,OAAA5D,CACA,CACA,OAAA,IAAA8T,KAAA0C,EACA,CACA,GAAArM,GAAAqM,IAAAd,IAAAjC,GAAA+C,EAAAD,KAAA,CAEA,IAAA9C,IADAuC,EAAAQ,EAAAD,OACAjB,MACA,MAAA,IAAAzR,UAAAiB,EAAA,6FAAA0R,IAOA,GAJAG,EADAD,EG/bA,SAA0BrB,EAAIqB,EAAMD,GACnC,IAAIzW,EACA6J,EACAmL,EACAzV,EAIJ,IAFAS,EAAM,GACNT,GAAK,IAEJsK,EAAIwL,EAAGC,QACAC,MAKP,GAFAhW,GAAK,EAEAmS,GADLsD,EAAI0B,EAAK9U,KAAM6U,EAAS5M,EAAEhK,MAAON,KACFyV,EAAExV,QAAU,EAC1CQ,EAAI6E,KAAMmQ,EAAG,GAAKA,EAAG,QACf,KAAKT,GAAeS,GAG1B,OAAO,IAAInR,UAAWiB,EAAQ,+IAAgJkQ,IAF9KhV,EAAI6E,KAAM+O,GAAMoB,GAAKnB,GAAMmB,GAG3B,CAEF,OAAOhV,CACR,CHwaA6W,CAAAb,EAAAU,EAAAD,GAEArB,GAAAY,GAEAW,aAAArV,MACA,MAAAqV,EAKA,IADAX,GADAhW,EAAA,IAAA8T,KADA/K,EAAA4N,EAAAnX,OAAA,IAEAqW,QACAtW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAyW,EAAAzW,GAAAoX,EAAApX,GAEA,OAAAS,CACA,CACA,MAAA,IAAA6D,UAAAiB,EAAA,6FAAA0R,GACA,IAoBAnP,EAAA6G,GAAA,MAAA,WACA,IAAAnJ,EACAxF,EACA,IAAAkU,GAAAK,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAAiS,GAAAhC,MACA,MAAA,IAAAjQ,UAAA,6DAGA,IADAkB,EAAA,GACAxF,EAAA,EAAAA,EAAAyE,UAAAxE,OAAAD,IACAwF,EAAAF,KAAAb,UAAAzE,IAEA,OAAA,IAAAuU,KAAA/O,EACA,IAwDA2B,EAAAwH,GAAAvN,UAAA,MAAA,SAAAgH,GACA,IAAAgO,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAAwN,GAAA1J,GACA,MAAA,IAAA9D,UAAAiB,EAAA,0DAAA6C,IAKA,GAHAA,EAAA,IACAA,GAAAmM,KAAA8B,WAEAjO,EAAA,GAAAA,GAAAmM,KAAA8B,SAGA,OAAAgD,GAAA9E,KAAA+B,QAAAlO,EACA,IAgBAoN,GAAA7G,GAAAvN,UAAA,UAAA,WACA,OAAAmT,KAAA+B,QAAAX,MACA,IAgBAH,GAAA7G,GAAAvN,UAAA,cAAA,WACA,OAAAmT,KAAA+B,QAAAS,UACA,IAgBAvB,GAAA7G,GAAAvN,UAAA,cAAA,WACA,OAAAmT,KAAA+B,QAAAV,UACA,IAiBAzO,EAAAwH,GAAAvN,UAAA,oBAAAuN,GAAAuG,mBAuCApN,EAAA6G,GAAAvN,UAAA,cAAA,SAAAmW,EAAAC,GACA,IAAApB,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAQA,OALA,IAAAG,UAAAxE,OACAsU,KAAA+B,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,GAEAjD,KAAA+B,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,EAAA,EAAA/S,UAAA,IAEA8P,IACA,IAqCApN,EAAAwH,GAAAvN,UAAA,WAAA,WACA,IAAAuU,EACA3C,EACA0E,EACAlO,EACAE,EACA1J,EACAqE,EACA,IAAA+R,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAkBA,OAhBA0O,EAAAuB,KACAoB,EAAApB,KAAA+B,QACA9M,EAAA+K,KAAA8B,QAGArW,GAAA,EACAqE,GAAA,EAIAyD,EADA4P,EAAA,CAAA,EACA,QAcA,WACA,IAAAjC,EAEA,GADAzV,GAAA,EACA0J,GAAA1J,GAAAwJ,EACA,MAAA,CACAwM,MAAA,GAKA,OADAP,EAAA,IAAArB,GAAAuB,EADAtR,GAAA,GACAsR,EAAAtR,EAAA,IACA,CACA/D,MAAA,CAAAN,EAAAyV,GACAO,MAAA,EAEA,IA3BAlO,EAAA4P,EAAA,UAoCA,SAAApX,GAEA,GADAoJ,GAAA,EACAjF,UAAAxE,OACA,MAAA,CACAK,MAAAA,EACA0V,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA7CAgB,IACAlP,EAAA4P,EAAAV,IAoDA,WACA,OAAAhE,EAAA2E,SACA,IApDAD,CAqDA,IA+BA5P,EAAA6G,GAAAvN,UAAA,SAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAzW,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAqJ,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACA,IAAAoN,EAAA/K,KAAA6U,EAAAmC,GAAA5C,EAAAzW,GAAAA,EAAAuU,MACA,OAAA,EAGA,OAAA,CACA,IA2CAzM,EAAA6G,GAAAvN,UAAA,QAAA,SAAAd,EAAAkX,EAAAI,GACA,IAAAnB,EACAjN,EACApB,EACAqM,EACAC,EACA1U,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA0Q,GAAA1U,GACA,MAAA,IAAAgE,UAAAiB,EAAA,0EAAAjF,IAIA,GAFAmW,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACA5R,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAA0F,GACA,MAAA,IAAAlT,UAAAiB,EAAA,qEAAAiS,IAQA,GANAA,EAAA,IACAA,GAAAhO,GACA,IACAgO,EAAA,GAGA/S,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAA8F,GACA,MAAA,IAAAtT,UAAAiB,EAAA,oEAAAqS,IAEAA,EAAA,IACAA,GAAApO,GACA,IACAoO,EAAA,GAGAA,EAAApO,IACAoO,EAAApO,EAEA,MACAoO,EAAApO,CAEA,MACAgO,EAAA,EACAI,EAAApO,EAIA,IAFAiL,EAAAJ,GAAA/T,GACAoU,EAAAJ,GAAAhU,GACAN,EAAAwX,EAAAxX,EAAA4X,EAAA5X,IAEAyW,EADArO,EAAA,EAAApI,GACAyU,EACAgC,EAAArO,EAAA,GAAAsM,EAEA,OAAAH,IACA,IA2CAzM,EAAA6G,GAAAvN,UAAA,UAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAhW,EACAT,EACAyV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAIA,IAFAqJ,EAAAlC,KAAA+B,QACA7V,EAAA,GACAT,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACAyV,EAAA4D,GAAA5C,EAAAzW,GACAoN,EAAA/K,KAAA6U,EAAAzB,EAAAzV,EAAAuU,OACA9T,EAAA6E,KAAAmQ,GAGA,OAAA,IAAAlB,KAAA/G,YAAA/M,EACA,IAqCAqH,EAAA6G,GAAAvN,UAAA,QAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAzW,EACAyV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAqJ,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IAEA,GADAyV,EAAA4D,GAAA5C,EAAAzW,GACAoN,EAAA/K,KAAA6U,EAAAzB,EAAAzV,EAAAuU,MACA,OAAAkB,CAGA,IA+BA3N,EAAA6G,GAAAvN,UAAA,aAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAzW,EACAyV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAqJ,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IAEA,GADAyV,EAAA4D,GAAA5C,EAAAzW,GACAoN,EAAA/K,KAAA6U,EAAAzB,EAAAzV,EAAAuU,MACA,OAAAvU,EAGA,OAAA,CACA,IAqCA8H,EAAA6G,GAAAvN,UAAA,YAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAzW,EACAyV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAqJ,EAAAlC,KAAA+B,QACAtW,EAAAuU,KAAA8B,QAAA,EAAArW,GAAA,EAAAA,IAEA,GADAyV,EAAA4D,GAAA5C,EAAAzW,GACAoN,EAAA/K,KAAA6U,EAAAzB,EAAAzV,EAAAuU,MACA,OAAAkB,CAGA,IA+BA3N,EAAA6G,GAAAvN,UAAA,iBAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAzW,EACAyV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAqJ,EAAAlC,KAAA+B,QACAtW,EAAAuU,KAAA8B,QAAA,EAAArW,GAAA,EAAAA,IAEA,GADAyV,EAAA4D,GAAA5C,EAAAzW,GACAoN,EAAA/K,KAAA6U,EAAAzB,EAAAzV,EAAAuU,MACA,OAAAvU,EAGA,OAAA,CACA,IA4BA8H,EAAA6G,GAAAvN,UAAA,WAAA,SAAAyW,EAAAX,GACA,IAAAT,EACAzW,EACAyV,EACA,IAAAW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAA2D,GACA,MAAA,IAAAvT,UAAAiB,EAAA,oEAAAsS,IAGA,IADApB,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACAyV,EAAA4D,GAAA5C,EAAAzW,GACA6X,EAAAxV,KAAA6U,EAAAzB,EAAAzV,EAAAuU,KAEA,IAyCApN,EAAAwH,GAAAvN,UAAA,OAAA,SAAAgH,GACA,IAAAgO,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA2N,GAAA7J,GACA,MAAA,IAAA9D,UAAAiB,EAAA,qEAAA6C,IAEA,KAAAA,GAAAmM,KAAA8B,SAGA,OAAAgD,GAAA9E,KAAA+B,QAAAlO,EACA,IAgBAoN,GAAA7G,GAAAvN,UAAA,UAAA,WACA,OAAAmT,KAAA8B,OACA,IAmCAvO,EAAA6G,GAAAvN,UAAA,YAAA,SAAA0W,EAAAC,GACA,IAAAtB,EACArO,EACAqM,EACAC,EACA1U,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA0Q,GAAA8C,GACA,MAAA,IAAAxT,UAAAiB,EAAA,0EAAAuS,IAEA,GAAArT,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAAiG,GACA,MAAA,IAAAzT,UAAAiB,EAAA,qEAAAwS,IAEAA,EAAA,IACAA,GAAAxD,KAAA8B,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAtD,EAAAJ,GAAAyD,GACApD,EAAAJ,GAAAwD,GACArB,EAAAlC,KAAA+B,QACAtW,EAAA+X,EAAA/X,EAAAuU,KAAA8B,QAAArW,IAEA,GAAAyU,IAAAgC,EADArO,EAAA,EAAApI,IACA0U,IAAA+B,EAAArO,EAAA,GACA,OAAA,EAGA,OAAA,CACA,IAmCAN,EAAA6G,GAAAvN,UAAA,WAAA,SAAA0W,EAAAC,GACA,IAAAtB,EACArO,EACAqM,EACAC,EACA1U,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA0Q,GAAA8C,GACA,MAAA,IAAAxT,UAAAiB,EAAA,0EAAAuS,IAEA,GAAArT,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAAiG,GACA,MAAA,IAAAzT,UAAAiB,EAAA,qEAAAwS,IAEAA,EAAA,IACAA,GAAAxD,KAAA8B,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAtD,EAAAJ,GAAAyD,GACApD,EAAAJ,GAAAwD,GACArB,EAAAlC,KAAA+B,QACAtW,EAAA+X,EAAA/X,EAAAuU,KAAA8B,QAAArW,IAEA,GAAAyU,IAAAgC,EADArO,EAAA,EAAApI,IACA0U,IAAA+B,EAAArO,EAAA,GACA,OAAApI,EAGA,OAAA,CACA,IAyBAmH,EAAAwH,GAAAvN,UAAA,QAAA,SAAA4W,GACA,IAAAvX,EACAgW,EACAwB,EACAjY,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,GAAA,IAAAG,UAAAxE,OACAgY,EAAA,QACA,KAAAxO,GAAAuO,GAGA,MAAA,IAAA1T,UAAAiB,EAAA,kEAAAyS,IAFAC,EAAAD,CAGA,CAGA,IAFAvX,EAAA,GACAgW,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACAS,EAAA6E,KAAA+T,GAAA5C,EAAAzW,GAAAgC,YAEA,OAAAvB,EAAAyX,KAAAD,EACA,IA4BA9Q,EAAAwH,GAAAvN,UAAA,QAAA,WACA,IAAA4R,EACA0E,EACAlO,EACAE,EACA1J,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAgBA,OAdA0O,EAAAuB,KACA/K,EAAA+K,KAAA8B,QAGArW,GAAA,EAIA8H,EADA4P,EAAA,CAAA,EACA,QAcA,WAEA,GADA1X,GAAA,EACA0J,GAAA1J,GAAAwJ,EACA,MAAA,CACAwM,MAAA,GAGA,MAAA,CACA1V,MAAAN,EACAgW,MAAA,EAEA,IAxBAlO,EAAA4P,EAAA,UAiCA,SAAApX,GAEA,GADAoJ,GAAA,EACAjF,UAAAxE,OACA,MAAA,CACAK,MAAAA,EACA0V,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAgB,IACAlP,EAAA4P,EAAAV,IAiDA,WACA,OAAAhE,EAAAmF,MACA,IAjDAT,CAkDA,IAsCA5P,EAAA6G,GAAAvN,UAAA,eAAA,SAAA0W,EAAAC,GACA,IAAAtB,EACArO,EACAqM,EACAC,EACA1U,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA0Q,GAAA8C,GACA,MAAA,IAAAxT,UAAAiB,EAAA,0EAAAuS,IAEA,GAAArT,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAAiG,GACA,MAAA,IAAAzT,UAAAiB,EAAA,qEAAAwS,IAEAA,GAAAxD,KAAA8B,QACA0B,EAAAxD,KAAA8B,QAAA,EACA0B,EAAA,IACAA,GAAAxD,KAAA8B,QAEA,MACA0B,EAAAxD,KAAA8B,QAAA,EAKA,IAHA5B,EAAAJ,GAAAyD,GACApD,EAAAJ,GAAAwD,GACArB,EAAAlC,KAAA+B,QACAtW,EAAA+X,EAAA/X,GAAA,EAAAA,IAEA,GAAAyU,IAAAgC,EADArO,EAAA,EAAApI,IACA0U,IAAA+B,EAAArO,EAAA,GACA,OAAApI,EAGA,OAAA,CACA,IAyCA8H,EAAA6G,GAAAvN,UAAA,OAAA,SAAAyW,EAAAX,GACA,IAAAkB,EACA3B,EACAhW,EACAT,EACAsK,EACA,IAAA8L,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAA2D,GACA,MAAA,IAAAvT,UAAAiB,EAAA,oEAAAsS,IAKA,IAHApB,EAAAlC,KAAA+B,QAEA8B,GADA3X,EAAA,IAAA8T,KAAA/G,YAAA+G,KAAA8B,UACAC,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IAEA,GAAAgV,GADA1K,EAAAuN,EAAAxV,KAAA6U,EAAAmC,GAAA5C,EAAAzW,GAAAA,EAAAuU,OAEA6D,EAAA,EAAApY,GAAAqU,GAAA/J,GACA8N,EAAA,EAAApY,EAAA,GAAAsU,GAAAhK,OACA,KAAA6H,GAAA7H,IAAA,IAAAA,EAAArK,OAIA,MAAA,IAAAqE,UAAAiB,EAAA,+IAAA+E,IAHA8N,EAAA,EAAApY,GAAAsK,EAAA,GACA8N,EAAA,EAAApY,EAAA,GAAAsK,EAAA,EAGA,CAEA,OAAA7J,CACA,IAmCAqH,EAAA6G,GAAAvN,UAAA,UAAA,SAAAiX,EAAAC,GACA,IAAA7B,EACA8B,EACA/O,EAEAxJ,EAEA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAAmE,GACA,MAAA,IAAA/T,UAAAiB,EAAA,oEAAA8S,IAIA,GAFA5B,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACA5R,UAAAxE,OAAA,EACAsY,EAAAD,EACAtY,EAAA,MACA,CACA,GAAA,IAAAwJ,EACA,MAAA,IAAAzH,MAAA,oGAEAwW,EAAAc,GAAA5C,EAAA,GACAzW,EAAA,CACA,CACA,KAAAA,EAAAwJ,EAAAxJ,IAEAuY,EAAAF,EAAAE,EADAc,GAAA5C,EAAAzW,GACAA,EAAAuU,MAEA,OAAAgE,CACA,IAmCAzQ,EAAA6G,GAAAvN,UAAA,eAAA,SAAAiX,EAAAC,GACA,IAAA7B,EACA8B,EACA/O,EAEAxJ,EAEA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAAmE,GACA,MAAA,IAAA/T,UAAAiB,EAAA,oEAAA8S,IAIA,GAFA5B,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACA5R,UAAAxE,OAAA,EACAsY,EAAAD,EACAtY,EAAAwJ,EAAA,MACA,CACA,GAAA,IAAAA,EACA,MAAA,IAAAzH,MAAA,oGAEAwW,EAAAc,GAAA5C,EAAAjN,EAAA,GACAxJ,EAAAwJ,EAAA,CACA,CACA,KAAAxJ,GAAA,EAAAA,IAEAuY,EAAAF,EAAAE,EADAc,GAAA5C,EAAAzW,GACAA,EAAAuU,MAEA,OAAAgE,CACA,IAmDApR,EAAAwH,GAAAvN,UAAA,WAAA,WACA,IAAAqV,EACAW,EACA5N,EACAgP,EACAxY,EACAqE,EACA,IAAA+R,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAKA,IAHAkF,EAAA+K,KAAA8B,QACAI,EAAAlC,KAAA+B,QACAkC,EAAA3G,GAAArI,EAAA,GACAxJ,EAAA,EAAAA,EAAAwY,EAAAxY,IACAqE,EAAAmF,EAAAxJ,EAAA,EACAoX,EAAAX,EAAA,EAAAzW,GACAyW,EAAA,EAAAzW,GAAAyW,EAAA,EAAApS,GACAoS,EAAA,EAAApS,GAAA+S,EACAA,EAAAX,EAAA,EAAAzW,EAAA,GACAyW,EAAA,EAAAzW,EAAA,GAAAyW,EAAA,EAAApS,EAAA,GACAoS,EAAA,EAAApS,EAAA,GAAA+S,EAEA,OAAA7C,IACA,IAgEApN,EAAAwH,GAAAvN,UAAA,OAAA,SAAAd,GAEA,IAAAmY,EACArQ,EACAqO,EACAW,EACAC,EACAmB,EACAlO,EACAtK,EACAqE,EACA,IAAA+R,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAGA,GADAmS,EAAAlC,KAAA+B,QACA7R,UAAAxE,OAAA,GAEA,IAAAgS,GADA7J,EAAA3D,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,+EAAA6C,SAGAA,EAAA,EAEA,GAAA4M,GAAA1U,GAAA,CACA,GAAA8H,GAAAmM,KAAA8B,QACA,MAAA,IAAAO,WAAArR,EAAA,kEAAA6C,IAKA,OAFAqO,EADArO,GAAA,GACAiM,GAAA/T,QACAmW,EAAArO,EAAA,GAAAkM,GAAAhU,GAEA,CACA,GAAA8V,GAAA9V,GAAA,CAEA,GAAA8H,GADAoQ,EAAAlY,EAAA+V,SACA9B,KAAA8B,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA6B,EAAAnY,EAAAgW,QAGAjS,EAAAoS,EAAAb,WAAAxN,EAAA8M,GAEAuD,EAAA9C,SAAAc,EAAAd,QAEA8C,EAAA7C,WAAAvR,GACAoU,EAAA7C,WAAA6C,EAAA1B,WAAA1S,EAEA,CAGA,IADA+S,EAAA,IAAAlJ,GAAAuK,EAAAxY,QACAD,EAAA,EAAAA,EAAAyY,EAAAxY,OAAAD,IACAoX,EAAApX,GAAAyY,EAAAzY,GAEAyY,EAAArB,CACA,CAGA,IAFAhP,GAAA,EACA/D,EAAA,EACArE,EAAA,EAAAA,EAAAwY,EAAAxY,IACAyW,EAAArO,GAAAqQ,EAAApU,GACAoS,EAAArO,EAAA,GAAAqQ,EAAApU,EAAA,GACA+D,GAAA,EACA/D,GAAA,CAGA,KAhCA,CAiCA,IAAAiO,GAAAhS,GA2DA,MAAA,IAAAgE,UAAAiB,EAAA,kIAAAjF,IAxDA,IADAkY,EAAAlY,EAAAL,OACAD,EAAA,EAAAA,EAAAwY,EAAAxY,IACA,IAAAgV,GAAA1U,EAAAN,IAAA,CACAqX,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAApC,GAAAuD,GACA,MAAA,IAAA5B,WAAArR,EAAA,6GAAAiT,IAEA,GAAApQ,EAAAoQ,EAAA,EAAAjE,KAAA8B,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA6B,EAAAnY,EAGA+D,EAAAoS,EAAAb,WAAAxN,EAAA8M,GAEAuD,EAAA9C,SAAAc,EAAAd,QAEA8C,EAAA7C,WAAAvR,GACAoU,EAAA7C,WAAA6C,EAAA1B,WAAA1S,EAEA,CAGA,IADA+S,EAAA,IAAAlJ,GAAAsK,GACAxY,EAAA,EAAAA,EAAAwY,EAAAxY,IACAoX,EAAApX,GAAAyY,EAAAzY,GAEAyY,EAAArB,CACA,CAIA,IAHAhP,GAAA,EACAoQ,GAAA,EACAnU,EAAA,EACArE,EAAA,EAAAA,EAAAwY,EAAAxY,IACAyW,EAAArO,GAAAqQ,EAAApU,GACAoS,EAAArO,EAAA,GAAAqQ,EAAApU,EAAA,GACA+D,GAAA,EACA/D,GAAA,EAEA,MACA,CAEA,GAAA+D,EAAAoQ,EAAAjE,KAAA8B,QACA,MAAA,IAAAO,WAAA,0FAGA,IADAxO,GAAA,EACApI,EAAA,EAAAA,EAAAwY,EAAAxY,IACAsK,EAAAhK,EAAAN,GACAyW,EAAArO,GAAAiM,GAAA/J,GACAmM,EAAArO,EAAA,GAAAkM,GAAAhK,GACAlC,GAAA,CAxDA,CA+DA,IA2EAN,EAAA6G,GAAAvN,UAAA,SAAA,SAAAoW,EAAAI,GACA,IAAAc,EACAN,EACA3X,EACA2H,EACAqO,EACAjN,EACAxJ,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAIA,GAFAmS,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACA,IAAA5R,UAAAxE,OACAuX,EAAA,EACAI,EAAApO,MACA,CACA,IAAAsI,GAAA0F,GACA,MAAA,IAAAlT,UAAAiB,EAAA,oEAAAiS,IAQA,GANAA,EAAA,IACAA,GAAAhO,GACA,IACAgO,EAAA,GAGA,IAAA/S,UAAAxE,OACA2X,EAAApO,MACA,CACA,IAAAsI,GAAA8F,GACA,MAAA,IAAAtT,UAAAiB,EAAA,qEAAAqS,IAEAA,EAAA,GACAA,GAAApO,GACA,IACAoO,EAAA,GAEAA,EAAApO,IACAoO,EAAApO,EAEA,CACA,CAQA,IANAkP,EADAlB,EAAAI,EACAA,EAAAJ,EAEA,EAGAY,GADA3X,EAAA,IAAA8T,KAAA/G,YAAAkL,IACApC,QACAtW,EAAA,EAAAA,EAAA0Y,EAAA1Y,IACAoI,EAAA,GAAApI,EAAAwX,GACAY,EAAA,EAAApY,GAAAyW,EAAArO,GACAgQ,EAAA,EAAApY,EAAA,GAAAyW,EAAArO,EAAA,GAEA,OAAA3H,CACA,IA+BAqH,EAAA6G,GAAAvN,UAAA,QAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAzW,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAqJ,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACA,GAAAoN,EAAA/K,KAAA6U,EAAAmC,GAAA5C,EAAAzW,GAAAA,EAAAuU,MACA,OAAA,EAGA,OAAA,CACA,IA6EApN,EAAAwH,GAAAvN,UAAA,QAAA,SAAAuX,GACA,IAAAvB,EACAX,EACAjN,EACAxJ,EACAqE,EACA,IAAA+R,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAAyE,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAKA,IAHAlC,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACAe,EAAA,GACApX,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAoX,EAAA9R,KAAA+T,GAAA5C,EAAAzW,IAGA,IADAoX,EAAAwB,KAAAD,GACA3Y,EAAA,EAAAA,EAAAwJ,EAAAxJ,IAEAyW,EADApS,EAAA,EAAArE,GACAqU,GAAA+C,EAAApX,IACAyW,EAAApS,EAAA,GAAAiQ,GAAA8C,EAAApX,IAEA,OAAAuU,IACA,IA2EAzM,EAAA6G,GAAAvN,UAAA,YAAA,SAAAyX,EAAAjB,GACA,IAAAnQ,EACAgP,EACAjN,EACA,IAAA4M,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAIA,GAFAmS,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACA,IAAA5R,UAAAxE,OACA4Y,EAAA,EACAjB,EAAApO,MACA,CACA,IAAAsI,GAAA+G,GACA,MAAA,IAAAvU,UAAAiB,EAAA,oEAAAsT,IAQA,GANAA,EAAA,IACAA,GAAArP,GACA,IACAqP,EAAA,GAGA,IAAApU,UAAAxE,OACA2X,EAAApO,MACA,CACA,IAAAsI,GAAA8F,GACA,MAAA,IAAAtT,UAAAiB,EAAA,qEAAAqS,IAEAA,EAAA,GACAA,GAAApO,GACA,IACAoO,EAAA,GAEAA,EAAApO,IACAoO,EAAApO,EAEA,CACA,CAWA,OAVAqP,GAAArP,GACAA,EAAA,EACA/B,EAAAgP,EAAAM,YACA8B,GAAAjB,GACApO,EAAA,EACA/B,EAAAgP,EAAAb,WAAAiD,EAAA3D,KAEA1L,EAAAoO,EAAAiB,EACApR,EAAAgP,EAAAb,WAAAiD,EAAA3D,IAEA,IAAAX,KAAA/G,YAAAiJ,EAAAd,OAAAlO,EAAA+B,EAAA,EAAA,EAAAA,EACA,IAwBA1B,EAAA6G,GAAAvN,UAAA,kBAAA,SAAA0X,EAAAC,GACA,IAAAC,EACAC,EACAxY,EACAgW,EACAzW,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,GAAA,IAAAG,UAAAxE,OACAgZ,EAAA,OACA,KAAAxP,GAAAqP,KAAAlG,GAAAkG,GAGA,MAAA,IAAAxU,UAAAiB,EAAA,yFAAAuT,IAFAG,EAAAH,CAGA,CACA,GAAArU,UAAAxE,OAAA,EACA+Y,EAAA,CAAA,MACA,KAAApO,GAAAmO,GAGA,MAAA,IAAAzU,UAAAiB,EAAA,qEAAAwT,IAFAC,EAAAD,CAGA,CAGA,IAFAtC,EAAAlC,KAAA+B,QACA7V,EAAA,GACAT,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACAS,EAAA6E,KAAA+T,GAAA5C,EAAAzW,GAAAkZ,eAAAD,EAAAD,IAEA,OAAAvY,EAAAyX,KAAA,IACA,IAmDA/Q,EAAAwH,GAAAvN,UAAA,cAAA,WACA,IAAAgX,EACA3X,EACA+I,EACAiN,EACAzW,EACAqE,EACA,IAAA+R,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAMA,IAJAkF,EAAA+K,KAAA8B,QACA5V,EAAA,IAAA8T,KAAA/G,YAAAhE,GACAiN,EAAAlC,KAAA+B,QACA8B,EAAA3X,EAAA6V,QACAtW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAqE,EAAAmF,EAAAxJ,EAAA,EACAoY,EAAA,EAAApY,GAAAyW,EAAA,EAAApS,GACA+T,EAAA,EAAApY,EAAA,GAAAyW,EAAA,EAAApS,EAAA,GAEA,OAAA5D,CACA,IA6EA0G,EAAAwH,GAAAvN,UAAA,YAAA,SAAAuX,GACA,IAAAvB,EACAX,EACAjN,EACAxJ,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAA4P,GAAAyE,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAKA,IAHAlC,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACAe,EAAA,GACApX,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAoX,EAAA9R,KAAA+T,GAAA5C,EAAAzW,IAGA,OADAoX,EAAAwB,KAAAD,GACA,IAAAhK,GAAAyI,EACA,IAoBAjQ,EAAAwH,GAAAvN,UAAA,YAAA,WACA,IAAAX,EACAgW,EACAzW,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAIA,IAFA7D,EAAA,GACAgW,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACAS,EAAA6E,KAAA+T,GAAA5C,EAAAzW,GAAAgC,YAEA,OAAAvB,EAAAyX,KAAA,IACA,IA2CA/Q,EAAAwH,GAAAvN,UAAA,UAAA,WACA,IAAAsW,EACA1E,EACAxJ,EACAE,EACA+M,EACAzW,EACA,IAAAoW,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAiBA,OAfA0O,EAAAuB,KACAkC,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QAGArW,GAAA,EAIA8H,EADA4P,EAAA,CAAA,EACA,QAcA,WAEA,GADA1X,GAAA,EACA0J,GAAA1J,GAAAwJ,EACA,MAAA,CACAwM,MAAA,GAGA,MAAA,CACA1V,MAAA+Y,GAAA5C,EAAAzW,GACAgW,MAAA,EAEA,IAxBAlO,EAAA4P,EAAA,UAiCA,SAAApX,GAEA,GADAoJ,GAAA,EACAjF,UAAAxE,OACA,MAAA,CACAK,MAAAA,EACA0V,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAgB,IACAlP,EAAA4P,EAAAV,IAiDA,WACA,OAAAhE,EAAAmG,QACA,IAjDAzB,CAkDA,IAuCA5P,EAAA6G,GAAAvN,UAAA,QAAA,SAAAgY,EAAA9Y,GACA,IAAAmW,EACAhW,EACA+I,EACA,IAAA4M,GAAA7B,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAAwN,GAAAsH,GACA,MAAA,IAAA9U,UAAAiB,EAAA,oEAAA6T,IAMA,GAJA5P,EAAA+K,KAAA8B,QACA+C,EAAA,IACAA,GAAA5P,GAEA4P,EAAA,GAAAA,GAAA5P,EACA,MAAA,IAAAoN,WAAArR,EAAA,kEAAA6T,IAEA,IAAApE,GAAA1U,GACA,MAAA,IAAAgE,UAAAiB,EAAA,2EAAAjF,IAMA,OAHAmW,GADAhW,EAAA,IAAA8T,KAAA/G,YAAA+G,KAAA+B,UACAA,SACA,EAAA8C,GAAA/E,GAAA/T,GACAmW,EAAA,EAAA2C,EAAA,GAAA9E,GAAAhU,GACAG,CACA,IIt6FA,IAAAyU,GAAA1G,GAAA0G,kBACAiB,GAAAd,KAYA,SAAAiE,GAAAhZ,GACA,MACA,iBAAAA,GACA,OAAAA,GACA,iBAAAA,EAAAkN,YAAAK,MACAvN,EAAA4U,oBAAAA,EAEA,CASA,SAAAqE,GAAAjZ,GACA,OAAAA,IAAAsO,EACA,CAoEA,SAAAA,KACA,IAAAgH,EACAc,EACAD,EACAjN,EACA5H,EAGA,GADA8U,EAAAjS,UAAAxE,SACAsU,gBAAA3F,IACA,OAAA,IAAA8H,EACA,IAAA9H,GAEA,IAAA8H,EACA,IAAA9H,GAAAnK,UAAA,IAEA,IAAAiS,EACA,IAAA9H,GAAAnK,UAAA,GAAAA,UAAA,IAEA,IAAAmK,GAAAnK,UAAA,GAAAA,UAAA,GAAAA,UAAA,IAGA,GAAA,IAAAiS,EACAD,EAAA,IAAAjI,GAAA,QACA,GAAA,IAAAkI,EAEA,GAAAzE,GADArQ,EAAA6C,UAAA,IAEAgS,EAAA,IAAAjI,GAAA5M,QACA,GAAA0Q,GAAA1Q,GACA6U,EC9IA,SAAoBA,EAAKtO,GACxB,IAAIqB,EACAxJ,EAGJ,IADAwJ,EAAMrB,EAAIlI,OACJD,EAAI,EAAGA,EAAIwJ,EAAKxJ,IACrByW,EAAKzW,GAAM+S,GAAS5K,EAAKnI,IAE1B,OAAOyW,CACR,CDqIAE,CAAA,IAAAnI,GAAA5M,EAAA3B,QAAA2B,QACA,GAAA6Q,GAAA7Q,GACA6U,EAAA,IAAAjI,GAAA5M,OACA,KAAAgJ,GAAAhJ,GAaA,MAAA,IAAA0C,UAAAiB,EAAA,qHAAA3D,IAZA,IAAA,IAAAuU,GACA,MAAA,IAAA7R,UAAAiB,EAAA,mJAAA3D,IAEA,IAAAsS,GAAAtS,EAAAoV,KACA,MAAA,IAAA1S,UAAAiB,EAAA,qHAAA3D,IAGA,IAAAsS,IADAuC,EAAA7U,EAAAoV,OACAjB,MACA,MAAA,IAAAzR,UAAAiB,EAAA,qHAAA3D,IAEA6U,EAAA,IAAAjI,GAAAqH,GAAAY,GAGA,KACA,CAEA,IAAAhE,GADAgE,EAAAhS,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,wEAAAkR,IAGA,IAAAxE,GADA2D,EAAAnR,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,4EAAAqQ,IAEA,GAAA,IAAAc,EACAD,EAAA,IAAAjI,GAAAiI,EAAAb,OACA,CAEA,IAAA3D,GADAzI,EAAA/E,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,uEAAAiE,IAEA,GAAAA,EAAA0L,GAAAuB,EAAAM,WAAAnB,EACA,MAAA,IAAAgB,WAAArR,EAAA,iJAAAiE,EAAA0L,KAEAuB,EAAA,IAAAjI,GAAAiI,EAAAb,EAAApM,EACA,CACA,CAIA,OAHA1B,EAAAyM,KAAA,UAAAkC,GACA3O,EAAAyM,KAAA,UAAAkC,EAAAxW,QAEAsU,IACA,CAeAzM,EAAA8G,GAAA,oBAAAsG,IAeApN,EAAA8G,GAAA,OAAA,gBAmCAzH,EAAAyH,GAAA,QAAA,SAAAqI,GACA,IAAAC,EACAR,EACAS,EACA1W,EACAgW,EACAW,EACApQ,EACAwC,EACAxJ,EACA,IAAAkU,GAAAK,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAAiV,GAAAhF,MACA,MAAA,IAAAjQ,UAAA,sDAGA,IADAoS,EAAAjS,UAAAxE,QACA,EAAA,CAEA,IAAAiU,GADAiD,EAAA1S,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,qEAAA4R,IAEAT,EAAA,IACAQ,EAAAzS,UAAA,GAEA,CACA,GAAA6N,GAAA2E,GAAA,CACA,GAAAE,EAAA,CASA,IARA3N,EAAAyN,EAAAhX,OAEA+G,EADAiQ,EAAAjQ,KAAAiQ,EAAAhQ,IACA+F,EAAA,WAEAzE,EAAA,WAGAkO,GADAhW,EAAA,IAAA8T,KAAA/K,IACA8M,QACAtW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAyW,EAAAzW,GAAA+S,GAAAoE,EAAA9U,KAAA6U,EAAAlQ,EAAAiQ,EAAAjX,GAAAA,IAEA,OAAAS,CACA,CACA,OAAA,IAAA8T,KAAA0C,EACA,CACA,GAAArM,GAAAqM,IAAAd,IAAAjC,GAAA+C,EAAAD,KAAA,CAEA,IAAA9C,IADAuC,EAAAQ,EAAAD,OACAjB,MACA,MAAA,IAAAzR,UAAAiB,EAAA,6FAAA0R,IAUA,IAPAG,EADAD,EE1SA,SAA0BrB,EAAIqB,EAAMD,GACnC,IAAIzW,EACA6J,EACAtK,EAIJ,IAFAS,EAAM,GACNT,GAAK,IAEJsK,EAAIwL,EAAGC,QACAC,MAGPhW,GAAK,EACLS,EAAI6E,KAAMyN,GAASoE,EAAK9U,KAAM6U,EAAS5M,EAAEhK,MAAON,KAEjD,OAAOS,CACR,CF2RA6W,CAAAb,EAAAU,EAAAD,GAEArB,GAAAY,GAIAA,GADAhW,EAAA,IAAA8T,KADA/K,EAAA4N,EAAAnX,SAEAqW,QACAtW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAyW,EAAAzW,GAAAoX,EAAApX,GAEA,OAAAS,CACA,CACA,MAAA,IAAA6D,UAAAiB,EAAA,6FAAA0R,GACA,IAoBAnP,EAAA8G,GAAA,MAAA,WACA,IAAApJ,EACAxF,EACA,IAAAkU,GAAAK,MACA,MAAA,IAAAjQ,UAAA,6DAEA,IAAAiV,GAAAhF,MACA,MAAA,IAAAjQ,UAAA,sDAGA,IADAkB,EAAA,GACAxF,EAAA,EAAAA,EAAAyE,UAAAxE,OAAAD,IACAwF,EAAAF,KAAAb,UAAAzE,IAEA,OAAA,IAAAuU,KAAA/O,EACA,IA6BA2B,EAAAyH,GAAAxN,UAAA,MAAA,SAAAgH,GACA,IAAAqO,EACAjN,EAEA,IAAA8P,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,IAAAwN,GAAA1J,GACA,MAAA,IAAA9D,UAAAiB,EAAA,0DAAA6C,IAOA,GALAoB,EAAA+K,KAAA8B,QACAI,EAAAlC,KAAA+B,QACAlO,EAAA,IACAA,GAAAoB,KAEApB,EAAA,GAAAA,GAAAoB,GAGA,OAAAuJ,GAAA0D,EAAArO,GACA,IAgBAoN,GAAA5G,GAAAxN,UAAA,UAAA,WACA,OAAAmT,KAAA+B,QAAAX,MACA,IAgBAH,GAAA5G,GAAAxN,UAAA,cAAA,WACA,OAAAmT,KAAA+B,QAAAS,UACA,IAgBAvB,GAAA5G,GAAAxN,UAAA,cAAA,WACA,OAAAmT,KAAA+B,QAAAV,UACA,IAiBAzO,EAAAyH,GAAAxN,UAAA,oBAAAwN,GAAAsG,mBA+BApN,EAAA8G,GAAAxN,UAAA,cAAA,SAAAmW,EAAAC,GACA,IAAA8B,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAQA,OALA,IAAAG,UAAAxE,OACAsU,KAAA+B,QAAAmB,WAAAF,EAAAC,GAEAjD,KAAA+B,QAAAmB,WAAAF,EAAAC,EAAA/S,UAAA,IAEA8P,IACA,IAgCApN,EAAAyH,GAAAxN,UAAA,WAAA,WACA,IAAA4R,EACA0E,EACAlO,EACAiN,EACA/M,EACA1J,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAiBA,OAfA0O,EAAAuB,KACAkC,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QAGArW,GAAA,EAIA8H,EADA4P,EAAA,CAAA,EACA,QAcA,WAEA,GADA1X,GAAA,EACA0J,GAAA1J,GAAAwJ,EACA,MAAA,CACAwM,MAAA,GAGA,MAAA,CACA1V,MAAA,CAAAN,EAAA+S,GAAA0D,EAAAzW,KACAgW,MAAA,EAEA,IAxBAlO,EAAA4P,EAAA,UAiCA,SAAApX,GAEA,GADAoJ,GAAA,EACAjF,UAAAxE,OACA,MAAA,CACAK,MAAAA,EACA0V,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAgB,IACAlP,EAAA4P,EAAAV,IAiDA,WACA,OAAAhE,EAAA2E,SACA,IAjDAD,CAkDA,IA4BA5P,EAAA8G,GAAAxN,UAAA,SAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAzW,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAqJ,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACA,IAAAoN,EAAA/K,KAAA6U,EAAAnE,GAAA0D,EAAAzW,IAAAA,EAAAuU,MACA,OAAA,EAGA,OAAA,CACA,IA+BAzM,EAAA8G,GAAAxN,UAAA,QAAA,SAAAd,EAAAkX,EAAAI,GACA,IAAAnB,EACAjN,EACAgQ,EACAxZ,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,IAAAuO,GAAAvS,GACA,MAAA,IAAAgE,UAAAiB,EAAA,mEAAAjF,IAIA,GAFAmW,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACA5R,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAA0F,GACA,MAAA,IAAAlT,UAAAiB,EAAA,qEAAAiS,IAQA,GANAA,EAAA,IACAA,GAAAhO,GACA,IACAgO,EAAA,GAGA/S,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAA8F,GACA,MAAA,IAAAtT,UAAAiB,EAAA,oEAAAqS,IAEAA,EAAA,IACAA,GAAApO,GACA,IACAoO,EAAA,GAGAA,EAAApO,IACAoO,EAAApO,EAEA,MACAoO,EAAApO,CAEA,MACAgO,EAAA,EACAI,EAAApO,EAOA,IAJAgQ,EADAlZ,EACA,EAEA,EAEAN,EAAAwX,EAAAxX,EAAA4X,EAAA5X,IACAyW,EAAAzW,GAAAwZ,EAEA,OAAAjF,IACA,IAqCAzM,EAAA8G,GAAAxN,UAAA,UAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAhW,EACAT,EACAsK,EAEA,IAAAgP,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAIA,IAFAqJ,EAAAlC,KAAA+B,QACA7V,EAAA,GACAT,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACAsK,EAAAyI,GAAA0D,EAAAzW,IACAoN,EAAA/K,KAAA6U,EAAA5M,EAAAtK,EAAAuU,OACA9T,EAAA6E,KAAAgF,GAGA,OAAA,IAAAiK,KAAA/G,YAAA/M,EACA,IA4BAqH,EAAA8G,GAAAxN,UAAA,QAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAnM,EACAtK,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAqJ,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IAEA,GADAsK,EAAAyI,GAAA0D,EAAAzW,IACAoN,EAAA/K,KAAA6U,EAAA5M,EAAAtK,EAAAuU,MACA,OAAAjK,CAGA,IA4BAxC,EAAA8G,GAAAxN,UAAA,aAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAnM,EACAtK,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAqJ,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IAEA,GADAsK,EAAAyI,GAAA0D,EAAAzW,IACAoN,EAAA/K,KAAA6U,EAAA5M,EAAAtK,EAAAuU,MACA,OAAAvU,EAGA,OAAA,CACA,IA4BA8H,EAAA8G,GAAAxN,UAAA,YAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAnM,EACAtK,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAqJ,EAAAlC,KAAA+B,QACAtW,EAAAuU,KAAA8B,QAAA,EAAArW,GAAA,EAAAA,IAEA,GADAsK,EAAAyI,GAAA0D,EAAAzW,IACAoN,EAAA/K,KAAA6U,EAAA5M,EAAAtK,EAAAuU,MACA,OAAAjK,CAGA,IA4BAxC,EAAA8G,GAAAxN,UAAA,iBAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAnM,EACAtK,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAqJ,EAAAlC,KAAA+B,QACAtW,EAAAuU,KAAA8B,QAAA,EAAArW,GAAA,EAAAA,IAEA,GADAsK,EAAAyI,GAAA0D,EAAAzW,IACAoN,EAAA/K,KAAA6U,EAAA5M,EAAAtK,EAAAuU,MACA,OAAAvU,EAGA,OAAA,CACA,IA0BA8H,EAAA8G,GAAAxN,UAAA,WAAA,SAAAyW,EAAAX,GACA,IAAAT,EACAzW,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,IAAA4P,GAAA2D,GACA,MAAA,IAAAvT,UAAAiB,EAAA,oEAAAsS,IAGA,IADApB,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACA6X,EAAAxV,KAAA6U,EAAAnE,GAAA0D,EAAAzW,IAAAA,EAAAuU,KAEA,IA2BApN,EAAAyH,GAAAxN,UAAA,OAAA,SAAAgH,GACA,IAAAkR,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,IAAA2N,GAAA7J,GACA,MAAA,IAAA9D,UAAAiB,EAAA,qEAAA6C,IAEA,KAAAA,GAAAmM,KAAA8B,SAGA,OAAAtD,GAAAwB,KAAA+B,QAAAlO,GACA,IA8BAN,EAAA8G,GAAAxN,UAAA,YAAA,SAAA0W,EAAAC,GACA,IAAAtB,EACAzW,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,IAAAuO,GAAAiF,GACA,MAAA,IAAAxT,UAAAiB,EAAA,mEAAAuS,IAEA,GAAArT,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAAiG,GACA,MAAA,IAAAzT,UAAAiB,EAAA,qEAAAwS,IAEAA,EAAA,IACAA,GAAAxD,KAAA8B,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAGA,IADAtB,EAAAlC,KAAA+B,QACAtW,EAAA+X,EAAA/X,EAAAuU,KAAA8B,QAAArW,IACA,GAAA8X,IAAA/E,GAAA0D,EAAAzW,IACA,OAAA,EAGA,OAAA,CACA,IAiCA8H,EAAA8G,GAAAxN,UAAA,WAAA,SAAA0W,EAAAC,GACA,IAAAtB,EACAzW,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,IAAAuO,GAAAiF,GACA,MAAA,IAAAxT,UAAAiB,EAAA,mEAAAuS,IAEA,GAAArT,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAAiG,GACA,MAAA,IAAAzT,UAAAiB,EAAA,qEAAAwS,IAEAA,EAAA,IACAA,GAAAxD,KAAA8B,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAGA,IADAtB,EAAAlC,KAAA+B,QACAtW,EAAA+X,EAAA/X,EAAAuU,KAAA8B,QAAArW,IACA,GAAA8X,IAAA/E,GAAA0D,EAAAzW,IACA,OAAAA,EAGA,OAAA,CACA,IA0BAmH,EAAAyH,GAAAxN,UAAA,QAAA,SAAA4W,GACA,IAAAvB,EACAhW,EACAT,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,GAAAG,UAAAxE,OAAA,GACA,IAAAwJ,EAAAuO,GACA,MAAA,IAAA1T,UAAAiB,EAAA,kEAAAyS,SAGAA,EAAA,IAIA,IAFAvB,EAAAlC,KAAA+B,QACA7V,EAAA,GACAT,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACAyW,EAAAzW,GACAS,EAAA6E,KAAA,QAEA7E,EAAA6E,KAAA,SAGA,OAAA7E,EAAAyX,KAAAF,EACA,IA4BA7Q,EAAAyH,GAAAxN,UAAA,QAAA,WACA,IAAA4R,EACA0E,EACAlO,EACAE,EACA1J,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAgBA,OAdA0O,EAAAuB,KACA/K,EAAA+K,KAAA8B,QAGArW,GAAA,EAIA8H,EADA4P,EAAA,CAAA,EACA,QAcA,WAEA,GADA1X,GAAA,EACA0J,GAAA1J,GAAAwJ,EACA,MAAA,CACAwM,MAAA,GAGA,MAAA,CACA1V,MAAAN,EACAgW,MAAA,EAEA,IAxBAlO,EAAA4P,EAAA,UAiCA,SAAApX,GAEA,GADAoJ,GAAA,EACAjF,UAAAxE,OACA,MAAA,CACAK,MAAAA,EACA0V,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAgB,IACAlP,EAAA4P,EAAAV,IAiDA,WACA,OAAAhE,EAAAmF,MACA,IAjDAT,CAkDA,IAiCA5P,EAAA8G,GAAAxN,UAAA,eAAA,SAAA0W,EAAAC,GACA,IAAAtB,EACAzW,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,IAAAuO,GAAAiF,GACA,MAAA,IAAAxT,UAAAiB,EAAA,mEAAAuS,IAEA,GAAArT,UAAAxE,OAAA,EAAA,CACA,IAAA6R,GAAAiG,GACA,MAAA,IAAAzT,UAAAiB,EAAA,qEAAAwS,IAEAA,GAAAxD,KAAA8B,QACA0B,EAAAxD,KAAA8B,QAAA,EACA0B,EAAA,IACAA,GAAAxD,KAAA8B,QAEA,MACA0B,EAAAxD,KAAA8B,QAAA,EAGA,IADAI,EAAAlC,KAAA+B,QACAtW,EAAA+X,EAAA/X,GAAA,EAAAA,IACA,GAAA8X,IAAA/E,GAAA0D,EAAAzW,IACA,OAAAA,EAGA,OAAA,CACA,IAgBAwV,GAAA5G,GAAAxN,UAAA,UAAA,WACA,OAAAmT,KAAA8B,OACA,IAqCAvO,EAAA8G,GAAAxN,UAAA,OAAA,SAAAyW,EAAAX,GACA,IAAAkB,EACA3X,EACAgW,EACAzW,EACA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,IAAA4P,GAAA2D,GACA,MAAA,IAAAvT,UAAA,oEAAAuT,GAKA,IAHApB,EAAAlC,KAAA+B,QAEA8B,GADA3X,EAAA,IAAA8T,KAAA/G,YAAA+G,KAAA8B,UACAC,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACAoY,EAAApY,GAAA+S,GAAA8E,EAAAxV,KAAA6U,EAAAnE,GAAA0D,EAAAzW,IAAAA,EAAAuU,OAEA,OAAA9T,CACA,IA+BAqH,EAAA8G,GAAAxN,UAAA,UAAA,SAAAiX,EAAAC,GACA,IAAA7B,EACAjN,EACA+O,EACAvY,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,IAAA4P,GAAAmE,GACA,MAAA,IAAA/T,UAAAiB,EAAA,oEAAA8S,IAIA,GAFA5B,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACA5R,UAAAxE,OAAA,EACAsY,EAAAD,EACAtY,EAAA,MACA,CACA,GAAA,IAAAwJ,EACA,MAAA,IAAAzH,MAAA,oGAEAwW,EAAAxF,GAAA0D,EAAA,IACAzW,EAAA,CACA,CACA,KAAAA,EAAAwJ,EAAAxJ,IACAuY,EAAAF,EAAAE,EAAAxF,GAAA0D,EAAAzW,IAAAA,EAAAuU,MAEA,OAAAgE,CACA,IA+BAzQ,EAAA8G,GAAAxN,UAAA,eAAA,SAAAiX,EAAAC,GACA,IAAA7B,EACAjN,EACA+O,EACAvY,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,IAAA4P,GAAAmE,GACA,MAAA,IAAA/T,UAAAiB,EAAA,oEAAA8S,IAIA,GAFA5B,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACA5R,UAAAxE,OAAA,EACAsY,EAAAD,EACAtY,EAAAwJ,EAAA,MACA,CACA,GAAA,IAAAA,EACA,MAAA,IAAAzH,MAAA,oGAEAwW,EAAAxF,GAAA0D,EAAAjN,EAAA,IACAxJ,EAAAwJ,EAAA,CACA,CACA,KAAAxJ,GAAA,EAAAA,IACAuY,EAAAF,EAAAE,EAAAxF,GAAA0D,EAAAzW,IAAAA,EAAAuU,MAEA,OAAAgE,CACA,IA8BApR,EAAAyH,GAAAxN,UAAA,WAAA,WACA,IAAAqV,EACAW,EACA5N,EACAgP,EACAxY,EACAqE,EAEA,IAAAiV,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAKA,IAHAmS,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACAmC,EAAA3G,GAAArI,EAAA,GACAxJ,EAAA,EAAAA,EAAAwY,EAAAxY,IACAqE,EAAAmF,EAAAxJ,EAAA,EACAoX,EAAAX,EAAAzW,GACAyW,EAAAzW,GAAAyW,EAAApS,GACAoS,EAAApS,GAAA+S,EAEA,OAAA7C,IACA,IA+CApN,EAAAyH,GAAAxN,UAAA,OAAA,SAAAd,GACA,IAAAmY,EACArQ,EACAqO,EACAW,EACAoB,EACAxY,EACAqE,EACA,IAAAiV,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAGA,GADAmS,EAAAlC,KAAA+B,QACA7R,UAAAxE,OAAA,GAEA,IAAAgS,GADA7J,EAAA3D,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,+EAAA6C,SAGAA,EAAA,EAEA,GAAAkK,GAAAhS,GAAA,CAEA,GAAA8H,GADAoQ,EAAAlY,EAAAL,QACAsU,KAAA8B,QACA,MAAA,IAAAO,WAAA,0FASA,GANA6B,EADAa,GAAAhZ,GACAA,EAAAgW,QAEAhW,EAGA+D,EAAAoS,EAAAb,WAAAxN,EAAA8M,GAEAuD,EAAA9C,SAAAc,EAAAd,QAEA8C,EAAA7C,WAAAvR,GACAoU,EAAA7C,WAAA6C,EAAA1B,WAAA1S,EAEA,CAGA,IADA+S,EAAA,IAAA5I,GAAAiK,EAAAxY,QACAD,EAAA,EAAAA,EAAAyY,EAAAxY,OAAAD,IACAoX,EAAApX,GAAAyY,EAAAzY,GAEAyY,EAAArB,CACA,CACA,IAAApX,EAAA,EAAAA,EAAAwY,EAAApQ,IAAApI,IACAyW,EAAArO,GAAAqQ,EAAAzY,GAAA,EAAA,CAGA,KA9BA,CA+BA,GAAAoI,GAAAmM,KAAA8B,QACA,MAAA,IAAAO,WAAArR,EAAA,kEAAA6C,IAEAqO,EAAArO,GAAA,EAAA,EAAA,CAJA,CAKA,IAgDAN,EAAA8G,GAAAxN,UAAA,SAAA,SAAAyX,EAAAjB,GACA,IAAAc,EACAN,EACA3X,EACAgW,EACAjN,EACAxJ,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAIA,GAFAmS,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACA,IAAA5R,UAAAxE,OACA4Y,EAAA,EACAjB,EAAApO,MACA,CACA,IAAAsI,GAAA+G,GACA,MAAA,IAAAvU,UAAAiB,EAAA,oEAAAsT,IAQA,GANAA,EAAA,IACAA,GAAArP,GACA,IACAqP,EAAA,GAGA,IAAApU,UAAAxE,OACA2X,EAAApO,MACA,CACA,IAAAsI,GAAA8F,GACA,MAAA,IAAAtT,UAAAiB,EAAA,qEAAAqS,IAEAA,EAAA,GACAA,GAAApO,GACA,IACAoO,EAAA,GAEAA,EAAApO,IACAoO,EAAApO,EAEA,CACA,CAQA,IANAkP,EADAG,EAAAjB,EACAA,EAAAiB,EAEA,EAGAT,GADA3X,EAAA,IAAA8T,KAAA/G,YAAAkL,IACApC,QACAtW,EAAA,EAAAA,EAAA0Y,EAAA1Y,IACAoY,EAAApY,GAAAyW,EAAAzW,EAAA6Y,GAEA,OAAApY,CACA,IA4BAqH,EAAA8G,GAAAxN,UAAA,QAAA,SAAAgM,EAAA8J,GACA,IAAAT,EACAzW,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,IAAA4P,GAAA9G,GACA,MAAA,IAAA9I,UAAAiB,EAAA,oEAAA6H,IAGA,IADAqJ,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACA,GAAAoN,EAAA/K,KAAA6U,EAAAnE,GAAA0D,EAAAzW,IAAAA,EAAAuU,MACA,OAAA,EAGA,OAAA,CACA,IA4CApN,EAAAyH,GAAAxN,UAAA,QAAA,SAAAuX,GACA,IAAAlC,EAEA,IAAA6C,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAGA,GADAmS,EAAAlC,KAAA+B,QACA,IAAA7R,UAAAxE,OAEA,OADAwW,EAAAmC,OACArE,KAEA,IAAAL,GAAAyE,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAGA,OADAlC,EAAAmC,MAWA,SAAAa,EAAAC,GACA,OAAAf,EAAA5F,GAAA0G,GAAA1G,GAAA2G,GACA,IAZAnF,IAaA,IAgDAzM,EAAA8G,GAAAxN,UAAA,YAAA,SAAAyX,EAAAjB,GACA,IAAAnQ,EACAgP,EACAjN,EAEA,IAAA8P,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAIA,GAFAmS,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QACA,IAAA5R,UAAAxE,OACA4Y,EAAA,EACAjB,EAAApO,MACA,CACA,IAAAsI,GAAA+G,GACA,MAAA,IAAAvU,UAAAiB,EAAA,oEAAAsT,IAQA,GANAA,EAAA,IACAA,GAAArP,GACA,IACAqP,EAAA,GAGA,IAAApU,UAAAxE,OACA2X,EAAApO,MACA,CACA,IAAAsI,GAAA8F,GACA,MAAA,IAAAtT,UAAAiB,EAAA,qEAAAqS,IAEAA,EAAA,GACAA,GAAApO,GACA,IACAoO,EAAA,GAEAA,EAAApO,IACAoO,EAAApO,EAEA,CACA,CAWA,OAVAqP,GAAArP,GACAA,EAAA,EACA/B,EAAAgP,EAAAM,YACA8B,GAAAjB,GACApO,EAAA,EACA/B,EAAAgP,EAAAb,WAAAiD,EAAA3D,KAEA1L,EAAAoO,EAAAiB,EACApR,EAAAgP,EAAAb,WAAAiD,EAAA3D,IAEA,IAAAX,KAAA/G,YAAAiJ,EAAAd,OAAAlO,EAAA+B,EAAA,EAAA,EAAAA,EACA,IAyBA1B,EAAA8G,GAAAxN,UAAA,kBAAA,SAAA0X,EAAAC,GACA,IAAAC,EACAC,EACAxY,EACAgW,EACAzW,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,GAAA,IAAAG,UAAAxE,OACAgZ,EAAA,OACA,KAAAxP,EAAAqP,KAAAlG,GAAAkG,GAGA,MAAA,IAAAxU,UAAAiB,EAAA,yFAAAuT,IAFAG,EAAAH,CAGA,CACA,GAAArU,UAAAxE,OAAA,EACA+Y,EAAA,CAAA,MACA,KAAApO,GAAAmO,GAGA,MAAA,IAAAzU,UAAAiB,EAAA,qEAAAwT,IAFAC,EAAAD,CAGA,CAGA,IAFAtC,EAAAlC,KAAA+B,QACA7V,EAAA,GACAT,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACAS,EAAA6E,KAAAyN,GAAA0D,EAAAzW,IAAAkZ,eAAAD,EAAAD,IAEA,OAAAvY,EAAAyX,KAAA,IACA,IA8BA/Q,EAAAyH,GAAAxN,UAAA,cAAA,WACA,IAAAgX,EACA3X,EACA+I,EACAiN,EACAzW,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAMA,IAJAkF,EAAA+K,KAAA8B,QACA5V,EAAA,IAAA8T,KAAA/G,YAAAhE,GACAiN,EAAAlC,KAAA+B,QACA8B,EAAA3X,EAAA6V,QACAtW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAoY,EAAApY,GAAAyW,EAAAjN,EAAAxJ,EAAA,GAEA,OAAAS,CACA,IA6CA0G,EAAAyH,GAAAxN,UAAA,YAAA,SAAAuX,GACA,IAAAP,EACA3X,EACA+I,EACAiN,EACAzW,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAMA,IAJAkF,EAAA+K,KAAA8B,QACA5V,EAAA,IAAA8T,KAAA/G,YAAAhE,GACAiN,EAAAlC,KAAA+B,QACA8B,EAAA3X,EAAA6V,QACAtW,EAAA,EAAAA,EAAAwJ,EAAAxJ,IACAoY,EAAApY,GAAAyW,EAAAzW,GAEA,GAAA,IAAAyE,UAAAxE,OAEA,OADAmY,EAAAQ,OACAnY,EAEA,IAAAyT,GAAAyE,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAGA,OADAP,EAAAQ,MAWA,SAAAa,EAAAC,GACA,OAAAf,EAAA5F,GAAA0G,GAAA1G,GAAA2G,GACA,IAZAjZ,CAaA,IAqBA0G,EAAAyH,GAAAxN,UAAA,YAAA,WACA,IAAAX,EACAgW,EACAzW,EACA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAIA,IAFA7D,EAAA,GACAgW,EAAAlC,KAAA+B,QACAtW,EAAA,EAAAA,EAAAuU,KAAA8B,QAAArW,IACAyW,EAAAzW,GACAS,EAAA6E,KAAA,QAEA7E,EAAA6E,KAAA,SAGA,OAAA7E,EAAAyX,KAAA,IACA,IA4BA/Q,EAAAyH,GAAAxN,UAAA,UAAA,WACA,IAAAsW,EACA1E,EACAxJ,EACAE,EACA+M,EACAzW,EAEA,IAAAsZ,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAiBA,OAfA0O,EAAAuB,KACAkC,EAAAlC,KAAA+B,QACA9M,EAAA+K,KAAA8B,QAGArW,GAAA,EAIA8H,EADA4P,EAAA,CAAA,EACA,QAcA,WAEA,GADA1X,GAAA,EACA0J,GAAA1J,GAAAwJ,EACA,MAAA,CACAwM,MAAA,GAGA,MAAA,CACA1V,MAAAyS,GAAA0D,EAAAzW,IACAgW,MAAA,EAEA,IAxBAlO,EAAA4P,EAAA,UAiCA,SAAApX,GAEA,GADAoJ,GAAA,EACAjF,UAAAxE,OACA,MAAA,CACAK,MAAAA,EACA0V,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAgB,IACAlP,EAAA4P,EAAAV,IAiDA,WACA,OAAAhE,EAAAmG,QACA,IAjDAzB,CAkDA,IA6BA5P,EAAA8G,GAAAxN,UAAA,QAAA,SAAAgY,EAAA9Y,GACA,IACAG,EACA+I,EAEA,IAAA8P,GAAA/E,MACA,MAAA,IAAAjQ,UAAA,sDAEA,IAAAwN,GAAAsH,GACA,MAAA,IAAA9U,UAAAiB,EAAA,oEAAA6T,IAMA,GAJA5P,EAAA+K,KAAA8B,QACA+C,EAAA,IACAA,GAAA5P,GAEA4P,EAAA,GAAAA,GAAA5P,EACA,MAAA,IAAAoN,WAAArR,EAAA,kEAAA6T,IAEA,IAAAvG,GAAAvS,GACA,MAAA,IAAAgE,UAAAiB,EAAA,oEAAAjF,IASA,OAPAG,EAAA,IAAA8T,KAAA/G,YAAA+G,KAAA+B,UACAA,QAEA8C,GADA9Y,EACA,EAEA,EAEAG,CACA,IG/4EA,IAAIkZ,GAAQ,CACXzL,GACAD,GACAG,GACAG,GACAJ,GACAG,GACAD,GACAG,GACAC,GACAC,GACAC,GACAC,IC5BGgL,GAAS,CACZ,UACA,UACA,QACA,SACA,QACA,SACA,OACA,QACA,SACA,YACA,aACA,QCHGC,GAASD,GAAO3Z,OAkBpB,SAASuI,GAAOlI,GACf,IAAIN,EACJ,GAAKyD,GAASnD,GACb,MAAO,UAER,GAAKgN,GAAUhN,GACd,OAAO,KAER,IAAMN,EAAI,EAAGA,EAAI6Z,GAAQ7Z,IACxB,GAAKM,aAAiBqZ,GAAO3Z,GAC5B,OAAO4Z,GAAQ5Z,GAIjB,OAAO8Z,GAAYlM,GAAiBtN,KAAa,IAClD,CCpBA,SAASyZ,GAASzZ,EAAO2J,GACxB,OAAK3J,UAGoB,iBAAb2J,EACJA,KAAY9J,OAAQG,GAEnBa,OAAQ8I,KAAc9J,OAAQG,GACxC,CCwDA,SAASyM,GAAW5E,EAAKzB,EAAMpG,GAC9B,IAAI0G,EACAsD,EACAtK,ECrEmBuJ,EACnB8C,EDuEJ,GCvEIA,EAAK7D,GADce,EDuEFpB,GAArBnB,ECrEKgB,EAAiBuB,GACdyD,EAAgBX,GAEjB9D,EAAQ8D,QDmEA,IAAV/L,EAAmB,CACvB,IAAMN,EAAI,EAAGA,EAAImI,EAAIlI,OAAQD,IAE5B,GAAK+Z,GADLzP,EAAItD,EAAKmB,EAAKnI,GACG0G,IAAU4D,EAAG5D,KAAWpG,EACxC,OAAO,EAGT,OAAO,CACP,CACD,IAAMN,EAAI,EAAGA,EAAImI,EAAIlI,OAAQD,IAC5B,GAAKgH,EAAKmB,EAAKnI,GAAK0G,KAAWpG,EAC9B,OAAO,EAGT,OAAO,CACR,CAiCA,SAAS0Z,GAAc7R,EAAKzB,EAAMpG,GACjC,OAAK0H,EAAiBG,GACd4E,GAAW5E,EAAKzB,EAAMpG,GA3G/B,SAAkB6H,EAAKzB,EAAMpG,GAC5B,IAAIgK,EACAtK,EACJ,QAAe,IAAVM,EAAmB,CACvB,IAAMN,EAAI,EAAGA,EAAImI,EAAIlI,OAAQD,IAE5B,GAAK+Z,GADLzP,EAAInC,EAAKnI,GACQ0G,IAAU4D,EAAG5D,KAAWpG,EACxC,OAAO,EAGT,OAAO,CACP,CACD,IAAMN,EAAI,EAAGA,EAAImI,EAAIlI,OAAQD,IAC5B,GAAKmI,EAAKnI,GAAK0G,KAAWpG,EACzB,OAAO,EAGT,OAAO,CACR,CA2FQ2Z,CAAS9R,EAAKzB,EAAMpG,EAC5B,CEvIA,SAAS4Z,KACR,IAGIla,EAHAyZ,EAAIhV,UAEJ0V,EAAI,uBADAV,EAAG,GACsB,IAEjC,IAAMzZ,EAAI,EAAGA,EAAIyZ,EAAExZ,OAAQD,IAC1Bma,GAAK,UAAYC,mBAAoBX,EAAGzZ,IAEzC,OAAOma,CACR,CCVA,SAASE,GAAQ7Z,GAChB,IAAI2H,EACAnI,EAGJ,GADAmI,EAAM,GACD3H,GAAK,EACT,OAAO2H,EAER,IAAMnI,EAAI,EAAGA,EAAIQ,EAAGR,IACnBmI,EAAI7C,KAAMtF,GAEX,OAAOmI,CACR,CCiDA,SAASmS,GAAS7Z,EAAK6L,EAAMiO,EAAQ9S,GACpC,IAAI6C,EACAzC,EACA7H,EAKJ,IAHA6H,EAAa,EAAT0S,EACJva,EAAa,EAATyH,EACJ6C,EAAI,EACItK,GAAK,GAAKA,EAAIsM,EAAKrM,QAC1BqM,EAAMtM,GAAMsK,EACZgC,EAAMtM,EAAE,GAAM,EACdA,GAAK6H,EACLyC,GAAK,EAEN,OAAO7J,CACR,CCxEA,SAAS+Z,GAAMjR,EAAGkR,GACjB,IAAIha,EACAT,EAGJ,IADAS,EAAM,GACAT,EAAI,EAAGA,EAAIya,EAAQxa,OAAQD,IAChCS,EAAI6E,KAAMiE,EAAGkR,EAASza,KAEvB,OAAOS,CACR,CCsBA,SAASia,GAAiBrP,EAAIsP,EAAIC,EAAIC,GACrC,IAAIzD,ECKL,SAAoB5P,EAAO1H,GAC1B,IAAIsI,EACAgP,EACAxP,EACA4B,EACA/I,EACA6K,EACAkN,EACAsC,EACA9a,EACAqE,EAMJ,IAJAmU,EAAI1Y,EAAQG,OAGZmX,EAAM,GACApX,EAAI,EAAGA,EAAI,EAAGA,IACnBoX,EAAI9R,KAAM,IAKX,IAHAwV,EAAI1D,EAAInX,OAGFD,EAAI,EAAGA,EAAIwY,EAAGxY,IACnBoX,EAAKxL,GAAe9L,EAASE,KAAQsF,KAAMxF,EAASE,IAIrD,IADA4H,EAAMwP,EAAK,GAAInX,UACFuY,EAEZlN,EAAKxL,EAAS,QACR,GAAK8H,IAAQ4Q,EAAE,GAErB,IAAMxY,EAAI,EAAGA,EAAI8a,EAAG9a,IACnB,GAAKoX,EAAKpX,GAAIC,OAAS,CACtBqL,EAAK8L,EAAKpX,GAAK,GACf,KACA,MAEI,CAGN,IADAqE,EAAI,EACErE,EAAI,EAAGA,EAAI8a,EAAG9a,KACnBwJ,EAAM4N,EAAKpX,GAAIC,SACH2H,IACXA,EAAM4B,EACNnF,EAAIrE,GAINsL,EAAK8L,EAAK/S,GAAK,EACf,CAWD,IATA+D,EAAMiS,GAAQ7S,EAAMvH,QC3ErB,SAAmBsJ,EAAGwR,GACrB,IAAIC,EAEAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAvb,EAMJ,IAJAib,EAAK,EACLC,EAAK,EAGClb,EAAI,EAAGA,EAAIuJ,EAAEtJ,OAAQD,IAAM,CAUhC,IARAgb,GADAK,EAAK9R,EAAG0R,IACK,GAAOI,EAAKA,EAEzBC,EAAKP,EAAGG,GAERC,EAAKF,EAAK,EACVG,EAAKF,EAAK,EAGFC,GAAM,OACbI,EAAKhS,EAAG4R,IACK,GAAOI,EAAKA,IACbP,IAGZzR,EAAG4R,EAAG,GAAMI,EACZR,EAAGK,EAAG,GAAML,EAAGK,GACfD,GAAM,EACNC,GAAM,EAEP7R,EAAG4R,EAAG,GAAME,EACZN,EAAGK,EAAG,GAAME,EACZL,GAAM,EACNC,GAAM,CACN,CACF,CDoCCM,CAAUlS,EAAMgC,GAAMlD,GAGtB3H,EAAM,CAAE+Z,GAAMhT,EAAOY,IAGfpI,EAAI,EAAGA,EAAIwY,EAAGxY,IACnBS,EAAI6E,KAAMkV,GAAM1a,EAASE,GAAKoI,IAE/B,OAAO3H,CACR,CDtEWgb,CAAWpQ,EAAI,CAAEsP,EAAIC,EAAIC,IACnC,MAAO,CACNxP,GAAM+L,EAAK,GACXuD,GAAMvD,EAAK,GACXwD,GAAMxD,EAAK,GACXyD,GAAMzD,EAAK,GAEb,CGlCA,SAASsE,GAAmBpb,GAC3B,OACCwR,GAAWxR,IACXA,EAAQ,CAEV,CCLA,SAASob,GAAmBpb,GAC3B,OACCwR,GAAWxR,IACXA,EAAMmK,UAAY,CAEpB,CCYA,SAASiR,GAAmBpb,GAC3B,OAASqK,GAAarK,IAAWsK,GAAUtK,EAC5C,CClBA,SAAS6X,GAAM7X,GACd,OAAOH,OAAOgY,KAAMhY,OAAQG,GAC7B,CCOAwH,EAAA5H,GAAA,UT8HA,SAAiBO,EAAK8Z,EAAQ9S,GAC7B,IU7H0B8B,EACtB8C,EV4HA5F,GU5HA4F,EAAK7D,GADiBe,EV6HE9I,GU3HvBuH,EAAiBuB,GACd,CACN+C,KAAQ/C,EACRf,MAAS6D,EACTS,kBAAoB,EACpBC,UAAa,CACZC,EAAgBX,GAChBY,EAAgBZ,KAIZ,CACNC,KAAQ/C,EACRf,MAAS6D,EACTS,kBAAoB,EACpBC,UAAa,CACZxE,EAAQ8D,GACR3D,EAAQ2D,MV2GV,OAAK5F,EAAIqG,iBAEW,eAAdrG,EAAI+B,MACD8R,GAAS7Z,EAAKqW,GAAgBrW,EAAK,GAAK8Z,EAAQ9S,GAErC,cAAdhB,EAAI+B,MACD8R,GAAS7Z,EAAKoW,GAAepW,EAAK,GAAK8Z,EAAQ9S,GAlDzD,SAAoBhH,EAAK8Z,EAAQ9S,GAChC,IAAI6E,EACArF,EACAqD,EACAtK,EAOJ,IALAsM,EAAO7L,EAAI6L,KACXrF,EAAMxG,EAAIsM,UAAW,GAErB/M,EAAIyH,EACJ6C,EAAI,EACItK,GAAK,GAAKA,EAAIsM,EAAKrM,QAC1BgH,EAAKqF,EAAMtM,EAAGsK,GACdtK,GAAKua,EACLjQ,GAAK,EAEN,OAAOgC,CACR,CAmCSS,CAAWtG,EAAK8T,EAAQ9S,GAzIjC,SAAkBhH,EAAK8Z,EAAQ9S,GAC9B,IAAI6C,EACAtK,EAIJ,IAFAA,EAAIyH,EACJ6C,EAAI,EACItK,GAAK,GAAKA,EAAIS,EAAIR,QACzBQ,EAAKT,GAAMsK,EACXtK,GAAKua,EACLjQ,GAAK,EAEN,OAAO7J,CACR,CA+HQwZ,CAASxZ,EAAK8Z,EAAQ9S,EAC9B,IWtHAK,EAAA5H,GAAA,cAAAyK,IACA7C,EAAA5H,GAAA,WAAA0K,ICnDA,ICKIwB,GDLAA,QAAgC,IAAhBjM,OAAOgY,KEwB3B,SAASwD,GAAarb,GACrB,MAAkC,uBAAzB8J,GAAa9J,EACvB,CDCIsb,GAPJ,WACC,OAAOD,GAAalX,UACrB,CAKOoX,GAKP,IAAAC,GAAe1P,GElBf,SAASzI,GAAO4F,GACf,OAASA,GAAMA,CAChB,CCQA,SAAS5F,GAAOrD,GACf,OACCD,GAAUC,IACVyb,GAAOzb,EAET,CCTA,SAASqD,GAAOrD,GACf,OACCD,GAAUC,IACVyb,GAAOzb,EAAMmK,UAEf,CCGA,SAAS9G,GAAOrD,GACf,OAASqK,GAAarK,IAAWsK,GAAUtK,EAC5C,CCoBAwH,EAAA5H,GAAA,cAAAyK,IACA7C,EAAA5H,GAAA,WAAA0K,ICzBA,IAAIoR,GAAuB7b,OAAOiB,UAAU6a,qBCE5C,IAAAC,IAXSC,GAAO9Z,KAAM,OAAQ,KCe9B,SAAS2Z,GAAsB1b,EAAO2J,GACrC,IAAImC,EACJ,OACC9L,YAKD8L,EAAO+P,GAAO9Z,KAAM/B,EAAO2J,KACbiS,IAAoBzS,GAAUnJ,IAIzCqD,GAFFsG,GAAYA,IAGX6H,GAAW7H,IACXA,GAAY,GACZA,EAAW3J,EAAML,OAGZmM,EACR,CChBA,IAAAgQ,GATKN,GACU5b,GCAf,SAAsBI,GACrB,OACW,OAAVA,GACiB,iBAAVA,IACNmD,GAASnD,IACc,iBAAjBA,EAAML,QACb6R,GAAWxR,EAAML,SACjBK,EAAML,QAAU,GAChBK,EAAML,QAAUmS,IAChBpI,GAAY1J,EAAO,YAClB0b,GAAsB1b,EAAO,SAEhC,EClCI8E,GAAQ1B,MAAMtC,UAAUgE,MCC5B,IAAIgH,GAAO4P,ICFX,WAEA,GDAuC,aEMnC5P,IAAQ4P,GARF,CACTha,SAAY,MAO0B,YCiDvC,SAASwC,GAAS2D,EAAK2P,EAAeC,GACrC,IAAIvO,EACAxJ,EACJ,IAAMsS,GAAcnK,KAAUsB,EAAUtB,GACvC,MAAM,IAAI7D,UAAWiB,EAAQ,8EAA+E4C,IAG7G,GAAa,KADbqB,EAAMrB,EAAIlI,QAET,OAAQ,EAET,GAA0B,IAArBwE,UAAUxE,OAAe,CAC7B,IAAM6R,GAAWiG,GAChB,MAAM,IAAIzT,UAAWiB,EAAQ,oEAAqEwS,IAEnG,GAAKA,GAAa,EAAI,CACrB,GAAKA,GAAavO,EACjB,OAAQ,EAETxJ,EAAI+X,CACP,MACG/X,EAAIwJ,EAAMuO,GACD,IACR/X,EAAI,EAGR,MACEA,EAAI,EAGL,GAAK2D,GAAOmU,IACX,KAAQ9X,EAAIwJ,EAAKxJ,IAChB,GAAK2D,GAAOwE,EAAInI,IACf,OAAOA,OAIT,KAAQA,EAAIwJ,EAAKxJ,IAChB,GAAKmI,EAAKnI,KAAQ8X,EACjB,OAAO9X,EAIV,OAAQ,CACT,CClGA,SAASqc,GAAwB/b,GAChC,OAASA,EAAMkN,aAAelN,EAAMkN,YAAYpM,YAAcd,CAC/D,6PCTIgc,GAAwB,oBAAXrJ,YAA2B,EAASA,OCqDrD,IAAAsJ,GA9BA,WACC,IAAIC,EACJ,GAAuB,cAAlBrI,GAAQsI,IACZ,OAAO,EAER,IAAMD,KAAKC,GACV,KAEmC,IAAjCjY,GAASkY,GAAeF,IACxBxS,GAAYyS,GAAKD,IACJ,OAAbC,GAAKD,IACkB,WAAvBrI,GAAQsI,GAAKD,KAEbH,GAAwBI,GAAKD,GAE9B,CAAC,MAAQlW,GACT,OAAO,CACP,CAEF,OAAO,CACR,CAKOqW,GChDHvQ,GAA2B,oBAAX6G,WC0BhBkF,oHAKFA,GAJGyE,GChBL,WACC,OAA8C,KAArCzE,GAAM1T,YAAe,IAAKxE,MACpC,CAgBQyK,CAAM,EAAG,GVFjB,SAAepK,GACd,OAAKqb,GAAarb,GACVkG,GAASpB,GAAM/C,KAAM/B,IAEtBkG,GAASlG,EACjB,ESDSkG,GEJT,SAAelG,GACd,IAAIuc,EACAC,EACAC,EACAtc,EACA+b,EACAQ,EACAhd,EAGJ,GADAS,EAAM,GACDkb,GAAarb,GAAU,CAE3B,IAAMN,EAAI,EAAGA,EAAIM,EAAML,OAAQD,IAC9BS,EAAI6E,KAAMtF,EAAEgC,YAGb,OAAOvB,CACP,CACD,GAAsB,iBAAVH,GAEX,GAAKA,EAAML,OAAS,IAAM+J,GAAY1J,EAAO,KAC5C,IAAMN,EAAI,EAAGA,EAAIM,EAAML,OAAQD,IAC9BS,EAAI6E,KAAMtF,EAAEgC,gBAGR,CAEN,IAAe,IADf+a,EAA2B,mBAAVzc,KACQ+M,GAAc/M,GACtC,OAAOG,EAERqc,EAAkBG,IAAsBF,CACxC,CACD,IAAMP,KAAKlc,EACFwc,GAAuB,cAANN,IAAuBxS,GAAY1J,EAAOkc,IAClE/b,EAAI6E,KAAMnE,OAAQqb,IAGpB,GAAKU,GAEJ,IADAL,ECnDF,SAAkBvc,GACjB,IAAoB,IAAf6c,KAAyBZ,GAC7B,OAAOF,GAAwB/b,GAEhC,IACC,OAAO+b,GAAwB/b,EAC/B,CAAC,MAAQ8c,GACT,OAAO,CACP,CACF,CD0CoBf,CAAwB/b,GACpCN,EAAI,EAAGA,EAAIqd,GAAepd,OAAQD,IACvCgd,EAAIK,GAAgBrd,GACZ6c,GAAyB,gBAANG,IAAyBhT,GAAY1J,EAAO0c,IACtEvc,EAAI6E,KAAMnE,OAAQ6b,IAIrB,OAAOvc,CACR,EFlCA,IIjCI6c,GJiCJpd,GAAeiY,GKVXoF,GAAMpd,OC9BNmd,GAAWnd,OAAOqd,eFSrBF,GADIpJ,GAAY/T,OAAOqd,gBACZhX,GGKZ,SAAyBC,GACxB,IAAIgX,ECVL,SAAmBhX,GAElB,OAAOA,EAAIM,SACZ,CDOauW,CAAU7W,GACtB,OAAKgX,GAAmB,OAAVA,EACNA,EAEgC,sBAAnCrT,GAAa3D,EAAI+G,aAEd/G,EAAI+G,YAAYpM,UAEnBqF,aAAetG,GACZA,GAAOiB,UAGR,IACR,EHXA,IAAAsc,GAAeJ,GKRf,IAAIK,GAAkBxd,OAAOiB,UAyC7B,SAASwc,GAAetd,GACvB,IAAImd,EAGJ,QAAM7S,GAAUtK,KAIhBmd,EC1CD,SAAyBnd,GACxB,OACCA,QAGO,MAGRA,EAAQH,GAAQG,GAETgd,GAAUhd,GAClB,CD+BSkd,CAAgBld,IAClBmd,IAMJzT,GAAY1J,EAAO,gBAGpB0J,GAAYyT,EAAO,gBACnBvJ,GAAYuJ,EAAMjQ,cACmB,sBAArCpD,GAAaqT,EAAMjQ,cAGnBxD,GAAYyT,EAAO,kBACnBvJ,GAAYuJ,EAAMI,iBAIjBJ,IAAUE,IAzDb,SAAmBlX,GAClB,IAAIqX,EAGJ,IAAMA,KAAOrX,EACZ,IAAMuD,GAAYvD,EAAKqX,GACtB,OAAO,EAGT,OAAO,CACR,CAkDGC,CAAUzd,IAGb,CE7EA,IAAI0d,GCwCJ,SAAiBvX,EAAKuS,GACrB,IACIb,EACA3O,EACAsU,EACAtE,EACA/Y,EACA6J,EACAtK,EAPAie,GAAa,EAQjB,IAAM5Q,GAAc5G,GACnB,MAAM,IAAInC,UAAWiB,EAAQ,iFAAkFkB,IAEhH,GAAKhC,UAAUxE,OAAS,EAAI,CAC3B,IAAM2K,GAAUoO,GACf,MAAM,IAAI1U,UAAWiB,EAAQ,qEAAsEyT,IAEpG,GAAKhP,GAAYgP,EAAM,gBAEhBnG,GADNoL,EAAajF,EAAKkF,YAEjB,MAAM,IAAI5Z,UAAWiB,EAAQ,+DAAgE,aAAc0Y,GAG7G,CAID,GAFAzU,GADA2O,EAAOgG,GAAY1X,IACRxG,OACXQ,EAAM,CAAA,EACDwd,EACJ,IAAMje,EAAI,EAAGA,EAAIwJ,EAAKxJ,IAGfgK,GAAYvJ,EADlB+Y,EAAM/S,EADNqX,EAAM3F,EAAMnY,MAMZsK,EAAI7J,EAAK+Y,GACJ/V,GAAS6G,GACb7J,EAAK+Y,GAAMlU,KAAMwY,GAEjBrd,EAAK+Y,GAAQ,CAAElP,EAAGwT,IAPlBrd,EAAK+Y,GAAQsE,OAWf,IAAM9d,EAAI,EAAGA,EAAIwJ,EAAKxJ,IAErBS,EAAKgG,EADLqX,EAAM3F,EAAMnY,KACQ8d,EAGtB,OAAOrd,CACR,CDxFW2d,CEWH,CAENhS,KAAQ,EAGRrD,KAAQ,EACRG,MAAS,EACTC,OAAU,EACVL,MAAS,EACTG,OAAU,EACVJ,MAAS,EACTG,OAAU,EACVqV,MAAS,EACTC,OAAU,EAOVC,QAAW,GAEX3V,QAAW,GACXD,QAAW,GAIX6V,UAAa,GACbnW,UAAa,GACbH,WAAc,GAGduW,OAAU,GAGVrV,QAAW,GAGXsV,OAAU,GAGVC,iBAAoB,KFpDkB,CACvCT,YAAc,8OG6Bf,SAASU,GAAiBpW,GACzB,IAAI8B,EACJ,OAAKb,EAAUjB,GACP0M,GAAmB1M,IAAW,KAEjCnI,GAAUmI,GACP0M,GHdT,SAAmB1M,GAClB,IAAI8B,EAAI0T,GAAMxV,GACd,OAASiB,EAAUa,GAAQA,EAAI,IAChC,CGW4BuU,CAAUrW,KAAa,KAE7CA,GAECkT,GADLpR,EAAI9B,EAAMuO,YAEFzM,EAGF,IACR,CCpDA,IAAIwU,GAAW,CAEdC,oBAAuB,GAGvBC,uBAA0B,GCY3B,SAASC,GAAiBC,EAAQC,EAAQC,GACzC,OCFD,SAAoBC,GACnB,IAAIzX,EACA4B,EACA8V,EACAtf,EAGJ,IADAwJ,EAAM6V,EAAOpf,SACD,EACX,OAAO6e,GAASE,uBAGjB,GAAa,QADbpX,EAAMgX,GAAiBS,EAAQ,KAE9B,OAAOP,GAASE,uBAGjB,IAAMhf,EAAI,EAAGA,EAAIwJ,EAAKxJ,IAAM,CAE3B,GAAY,QADZsf,EAAKV,GAAiBS,EAAQrf,KAE7B,OAAO8e,GAASE,uBAEZM,EAAK1X,IACTA,EAAM0X,EAEP,CAED,OADAA,EAAOR,GAASC,oBAAoBnX,EAAM,GAC5B,EAAM0X,EAAK,CAC1B,CDxBQC,CAAW,CAAEL,EAAQC,EAAQC,GACrC,CESA,SAASI,GAAWhY,EAAO1H,EAAS2H,EAAQsD,EAAO3C,EAAKqX,GACvD,IAAI/X,EACA8B,EACAkW,EACA7X,EACA7H,EAIJ,IAFA0H,EAAQF,EAAMvH,OACduJ,EAAM,EACAxJ,EAAI,EAAGA,EAAI0H,EAAO1H,IACvBwJ,GAAOhC,EAAOxH,GAEf,GAAc,UAATyf,EACCrX,EAAM,EACVA,EAAM,EACKA,GAAOoB,IAClBpB,EAAMoB,EAAM,QAEP,GAAc,SAATiW,EACNrX,EAAM,GACVA,GAAOoB,GACI,GAEG,KADbpB,GAAOoB,KAENpB,GAAOoB,GAGEpB,GAAOoB,IAClBpB,GAAOoB,IACKA,IACXpB,GAAOoB,QAOT,GAHc,cAATiW,GAAwBrX,EAAM,IAClCA,GAAOoB,GAEHpB,EAAM,GAAKA,GAAOoB,EACtB,MAAM,IAAIoN,WAAYrR,EAAQ,gHAAiHiE,EAAKpB,IAKtJ,GADAsX,EAAMjY,EACDuD,GAAeD,GAAU,CAC7B,IAAM/K,EAAI,EAAGA,EAAI0H,EAAO1H,IAEvBoI,GADAP,EAAIO,EAAMZ,EAAOxH,GAEjBoI,GAAOZ,EAAOxH,GACd0f,GAAO7X,EAAI/H,EAASE,GAErB,OAAO0f,CACP,CAED,IAAM1f,EAAI0H,EAAM,EAAG1H,GAAK,EAAGA,IAE1BoI,GADAP,EAAIO,EAAMZ,EAAOxH,GAEjBoI,GAAOZ,EAAOxH,GACd0f,GAAO7X,EAAI/H,EAASE,GAErB,OAAO0f,CACR,CClFA,IAAIC,GAAO,QCAX,IAAIA,GAAO,QC8CX,IAAIC,GAAS,CCiCb,SAAmBrW,EAAGwR,EAAGtF,EAAGoC,GAC3BpC,EAAEnJ,KAAMmJ,EAAEhO,QAAWoQ,EAAKtO,EAAE+C,KAAM/C,EAAE9B,QAAUsT,EAAEzO,KAAMyO,EAAEtT,QACzD,ECFA,SAAmB8B,EAAGwR,EAAGtF,EAAGoC,GAC3B,IAAI1L,EACA0T,EACAC,EACAC,EACAC,EACAC,EACAC,EACAjF,EACAC,EACAiF,EACAC,EAqBJ,IAhBAF,EAAK3W,EAAE/B,MAAO,GACduY,EAAMxW,EAAEzJ,QAAS,GACjBkgB,EAAMjF,EAAEjb,QAAS,GACjBmgB,EAAMxK,EAAE3V,QAAS,GAGjBmb,EAAK1R,EAAE9B,OACPyT,EAAKH,EAAEtT,OACP0Y,EAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGH8T,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOtI,EAAK1L,EAAM8O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,CAER,ECrCA,SAAmB1W,EAAGwR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAI1L,EACA0T,EACAC,EACAC,EACAO,EACAN,EACAO,EACAN,EACAO,EACAnV,EACA6U,EACAO,EACA9F,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EAyCJ,IApCArV,EAAK9B,EAAE/B,MACPmT,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QACFugB,GAEJH,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,KAGxBqF,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,IAGzBI,EAAK1R,EAAE9B,OACPyT,EAAKH,EAAEtT,OACP0Y,EAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGHoU,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOtI,EAAK1L,EAAM8O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACF,ECxEA,SAAmBjX,EAAGwR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAI1L,EACA0T,EACAC,EACAC,EACAO,EACAK,EACAX,EACAO,EACAK,EACAX,EACAO,EACAK,EACAxV,EACA6U,EACAO,EACAK,EACAnG,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EAiDJ,IA5CA1V,EAAK9B,EAAE/B,MACPmT,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QACFugB,GAEJH,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,KAGxBqF,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,IAGzBI,EAAK1R,EAAE9B,OACPyT,EAAKH,EAAEtT,OACP0Y,EAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGHyU,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOtI,EAAK1L,EAAM8O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACF,EC1FA,SAAmBtX,EAAGwR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAI1L,EACA0T,EACAC,EACAC,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACA7V,EACA6U,EACAO,EACAK,EACAK,EACAxG,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EAyDJ,IApDA/V,EAAK9B,EAAE/B,MACPmT,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QACFugB,GAEJH,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,KAGxBqF,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,IAGzBI,EAAK1R,EAAE9B,OACPyT,EAAKH,EAAEtT,OACP0Y,EAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGH8U,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOtI,EAAK1L,EAAM8O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACF,EC1GA,SAAmB3X,EAAGwR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAI1L,EACA0T,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACAlW,EACA6U,EACAO,EACAK,EACAK,EACAK,EACA7G,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACAK,EAiEJ,IA5DApW,EAAK9B,EAAE/B,MACPmT,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QACFugB,GAEJH,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,KAGxBqF,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,IAGzBI,EAAK1R,EAAE9B,OACPyT,EAAKH,EAAEtT,OACP0Y,EAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGHmV,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOtI,EAAK1L,EAAM8O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACF,EC9HA,SAAmBhY,EAAGwR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAI1L,EACA0T,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAvW,EACA6U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAlH,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EAyEJ,IApEAzW,EAAK9B,EAAE/B,MACPmT,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QACFugB,GAEJH,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,KAGxBqF,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,IAGzBI,EAAK1R,EAAE9B,OACPyT,EAAKH,EAAEtT,OACP0Y,EAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGHwV,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOtI,EAAK1L,EAAM8O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACDtG,GAAMyG,EACNxG,GAAMyG,EACNxB,GAAMyB,CACN,CACF,EChJA,SAAmBrY,EAAGwR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAI1L,EACA0T,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA5W,EACA6U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAvH,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EACAK,EAiFJ,IA5EA9W,EAAK9B,EAAE/B,MACPmT,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QACFugB,GAEJH,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT6W,EAAK7W,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,KAGxBqF,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT6W,EAAK7W,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,IAGzBI,EAAK1R,EAAE9B,OACPyT,EAAKH,EAAEtT,OACP0Y,EAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGH6V,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOtI,EAAK1L,EAAM8O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACDtG,GAAMyG,EACNxG,GAAMyG,EACNxB,GAAMyB,CACN,CACD3G,GAAM8G,EACN7G,GAAM8G,EACN7B,GAAM8B,CACN,CACF,EClKA,SAAmB1Y,EAAGwR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAI1L,EACA0T,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACApC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACApC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAjX,EACA6U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA5H,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,GAyFJ,IApFAnX,EAAK9B,EAAE/B,MACPmT,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QACFugB,GAEJH,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT6W,EAAK7W,EAAI,GACTkX,EAAKlX,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,KAGxBqF,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT6W,EAAK7W,EAAI,GACTkX,EAAKlX,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,IAGzBI,EAAK1R,EAAE9B,OACPyT,EAAKH,EAAEtT,OACP0Y,EAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGHkW,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOtI,EAAK1L,EAAM8O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACDtG,GAAMyG,EACNxG,GAAMyG,EACNxB,GAAMyB,CACN,CACD3G,GAAM8G,EACN7G,GAAM8G,EACN7B,GAAM8B,CACN,CACDhH,GAAMmH,EACNlH,GAAMmH,EACNlC,GAAMmC,CACN,CACF,ECpLA,SAAmB/Y,EAAGwR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAI1L,EACA0T,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAzC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAzC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAtX,EACA6U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAjI,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GAiGJ,IA5FAxX,EAAK9B,EAAE/B,MACPmT,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QACFugB,GAEJH,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT6W,EAAK7W,EAAI,GACTkX,EAAKlX,EAAI,GACTuX,EAAKvX,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ4H,EAAG5H,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ2H,EAAG3H,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ0H,EAAG1H,EAAG,KAGxBqF,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT6W,EAAK7W,EAAI,GACTkX,EAAKlX,EAAI,GACTuX,EAAKvX,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ4H,EAAG5H,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ2H,EAAG3H,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ0H,EAAG1H,EAAG,IAGzBI,EAAK1R,EAAE9B,OACPyT,EAAKH,EAAEtT,OACP0Y,EAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGHuW,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOtI,EAAK1L,EAAM8O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACDtG,GAAMyG,EACNxG,GAAMyG,EACNxB,GAAMyB,CACN,CACD3G,GAAM8G,EACN7G,GAAM8G,EACN7B,GAAM8B,CACN,CACDhH,GAAMmH,EACNlH,GAAMmH,EACNlC,GAAMmC,CACN,CACDrH,GAAMwH,EACNvH,GAAMwH,EACNvC,GAAMwC,CACN,CACF,ECtMA,SAAoBpZ,EAAGwR,EAAGtF,EAAG4K,EAAYxI,GACxC,IAAI1L,EACA0T,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA9C,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA9C,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA3X,EACA6U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAtI,EACAC,EACAC,EACAI,EACAC,EACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GAyGJ,IApGA7X,EAAK9B,EAAE/B,MACPmT,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QACFugB,GAEJH,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT6W,EAAK7W,EAAI,GACTkX,EAAKlX,EAAI,GACTuX,EAAKvX,EAAI,GACT4X,EAAK5X,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ4H,EAAG5H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQiI,EAAGjI,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ2H,EAAG3H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQgI,EAAGhI,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ0H,EAAG1H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQ+H,EAAG/H,EAAG,KAGxBqF,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT6W,EAAK7W,EAAI,GACTkX,EAAKlX,EAAI,GACTuX,EAAKvX,EAAI,GACT4X,EAAK5X,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ4H,EAAG5H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQiI,EAAGjI,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ2H,EAAG3H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQgI,EAAGhI,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ0H,EAAG1H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQ+H,EAAG/H,EAAG,IAGzBI,EAAK1R,EAAE9B,OACPyT,EAAKH,EAAEtT,OACP0Y,GAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGH4W,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKF,EAAIE,KACtBN,EAAMK,IAAOtI,EAAK1L,EAAM8O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,IAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,IAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,IAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,IAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,IAAMoB,CACN,CACDtG,GAAMyG,EACNxG,GAAMyG,EACNxB,IAAMyB,CACN,CACD3G,GAAM8G,EACN7G,GAAM8G,EACN7B,IAAM8B,CACN,CACDhH,GAAMmH,EACNlH,GAAMmH,EACNlC,IAAMmC,CACN,CACDrH,GAAMwH,EACNvH,GAAMwH,EACNvC,IAAMwC,CACN,CACD1H,GAAM6H,EACN5H,GAAM6H,EACN5C,IAAM6C,CACN,CACF,GX/OIG,GAAkB,CY2BtB,SAAmB5Z,EAAGwR,EAAGtF,EAAGoC,GAC3BpC,EAAE1I,UAAW,GAAK0I,EAAEnJ,KAAMmJ,EAAEhO,OAAQoQ,EAAKtO,EAAEwD,UAAW,GAAKxD,EAAE+C,KAAM/C,EAAE9B,QAAUsT,EAAEhO,UAAW,GAAKgO,EAAEzO,KAAMyO,EAAEtT,SAC5G,ECDA,SAAmB8B,EAAGwR,EAAGtF,EAAGoC,GAC3B,IAAI1L,EACA0T,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAC,EACAC,EACAC,EACAjF,EACAC,EACAiF,EACAC,EA0BJ,IArBAF,EAAK3W,EAAE/B,MAAO,GACduY,EAAMxW,EAAEzJ,QAAS,GACjBkgB,EAAMjF,EAAEjb,QAAS,GACjBmgB,EAAMxK,EAAE3V,QAAS,GAGjBmb,EAAK1R,EAAE9B,OACPyT,EAAKH,EAAEtT,OACP0Y,EAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGT8W,EAAO7Z,EAAEwD,UAAW,GACpBsW,EAAOtI,EAAEhO,UAAW,GACpBuW,EAAO7N,EAAE1I,UAAW,GAGdqT,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAMjX,EAAM8O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,CAER,EC7CA,SAAmB1W,EAAGwR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAI1L,EACA0T,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAN,EACAO,EACAN,EACAO,EACAnV,EACA6U,EACAO,EACA9F,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EA8CJ,IAzCArV,EAAK9B,EAAE/B,MACPmT,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QACFugB,GAEJH,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,KAGxBqF,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,IAGzBI,EAAK1R,EAAE9B,OACPyT,EAAKH,EAAEtT,OACP0Y,EAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGT8W,EAAO7Z,EAAEwD,UAAW,GACpBsW,EAAOtI,EAAEhO,UAAW,GACpBuW,EAAO7N,EAAE1I,UAAW,GAGd2T,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAMjX,EAAM8O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACF,EChFA,SAAmBjX,EAAGwR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAI1L,EACA0T,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAX,EACAO,EACAK,EACAX,EACAO,EACAK,EACAxV,EACA6U,EACAO,EACAK,EACAnG,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EAsDJ,IAjDA1V,EAAK9B,EAAE/B,MACPmT,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QACFugB,GAEJH,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,KAGxBqF,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,IAGzBI,EAAK1R,EAAE9B,OACPyT,EAAKH,EAAEtT,OACP0Y,EAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGT8W,EAAO7Z,EAAEwD,UAAW,GACpBsW,EAAOtI,EAAEhO,UAAW,GACpBuW,EAAO7N,EAAE1I,UAAW,GAGdgU,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAMjX,EAAM8O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACF,EClGA,SAAmBtX,EAAGwR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAI1L,EACA0T,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACA7V,EACA6U,EACAO,EACAK,EACAK,EACAxG,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EA8DJ,IAzDA/V,EAAK9B,EAAE/B,MACPmT,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QACFugB,GAEJH,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,KAGxBqF,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,IAGzBI,EAAK1R,EAAE9B,OACPyT,EAAKH,EAAEtT,OACP0Y,EAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGT8W,EAAO7Z,EAAEwD,UAAW,GACpBsW,EAAOtI,EAAEhO,UAAW,GACpBuW,EAAO7N,EAAE1I,UAAW,GAGdqU,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAMjX,EAAM8O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACF,EClHA,SAAmB3X,EAAGwR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAI1L,EACA0T,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACAlW,EACA6U,EACAO,EACAK,EACAK,EACAK,EACA7G,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACAK,EAsEJ,IAjEApW,EAAK9B,EAAE/B,MACPmT,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QACFugB,GAEJH,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,KAGxBqF,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,IAGzBI,EAAK1R,EAAE9B,OACPyT,EAAKH,EAAEtT,OACP0Y,EAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGT8W,EAAO7Z,EAAEwD,UAAW,GACpBsW,EAAOtI,EAAEhO,UAAW,GACpBuW,EAAO7N,EAAE1I,UAAW,GAGd0U,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAMjX,EAAM8O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACF,ECtIA,SAAmBhY,EAAGwR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAI1L,EACA0T,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAvW,EACA6U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAlH,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EA8EJ,IAzEAzW,EAAK9B,EAAE/B,MACPmT,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QACFugB,GAEJH,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,KAGxBqF,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,IAGzBI,EAAK1R,EAAE9B,OACPyT,EAAKH,EAAEtT,OACP0Y,EAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGT8W,EAAO7Z,EAAEwD,UAAW,GACpBsW,EAAOtI,EAAEhO,UAAW,GACpBuW,EAAO7N,EAAE1I,UAAW,GAGd+U,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAMjX,EAAM8O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACDtG,GAAMyG,EACNxG,GAAMyG,EACNxB,GAAMyB,CACN,CACF,ECxJA,SAAmBrY,EAAGwR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAI1L,EACA0T,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA5W,EACA6U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAvH,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EACAK,EAsFJ,IAjFA9W,EAAK9B,EAAE/B,MACPmT,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QACFugB,GAEJH,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT6W,EAAK7W,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,KAGxBqF,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT6W,EAAK7W,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,IAGzBI,EAAK1R,EAAE9B,OACPyT,EAAKH,EAAEtT,OACP0Y,EAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGT8W,EAAO7Z,EAAEwD,UAAW,GACpBsW,EAAOtI,EAAEhO,UAAW,GACpBuW,EAAO7N,EAAE1I,UAAW,GAGdoV,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAMjX,EAAM8O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACDtG,GAAMyG,EACNxG,GAAMyG,EACNxB,GAAMyB,CACN,CACD3G,GAAM8G,EACN7G,GAAM8G,EACN7B,GAAM8B,CACN,CACF,EC1KA,SAAmB1Y,EAAGwR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAI1L,EACA0T,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACApC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACApC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAjX,EACA6U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA5H,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACAK,GACAK,GACAK,GACAK,GA8FJ,IAzFAnX,EAAK9B,EAAE/B,MACPmT,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QACFugB,GAEJH,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT6W,EAAK7W,EAAI,GACTkX,EAAKlX,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,KAGxBqF,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT6W,EAAK7W,EAAI,GACTkX,EAAKlX,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,IAGzBI,EAAK1R,EAAE9B,OACPyT,EAAKH,EAAEtT,OACP0Y,EAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGT8W,EAAO7Z,EAAEwD,UAAW,GACpBsW,EAAOtI,EAAEhO,UAAW,GACpBuW,EAAO7N,EAAE1I,UAAW,GAGdyV,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAMjX,EAAM8O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACDtG,GAAMyG,EACNxG,GAAMyG,EACNxB,GAAMyB,CACN,CACD3G,GAAM8G,EACN7G,GAAM8G,EACN7B,GAAM8B,CACN,CACDhH,GAAMmH,EACNlH,GAAMmH,EACNlC,GAAMmC,CACN,CACF,EC5LA,SAAmB/Y,EAAGwR,EAAGtF,EAAG4K,EAAYxI,GACvC,IAAI1L,EACA0T,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAzC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAzC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAtX,EACA6U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAjI,EACAC,EACAC,EACAI,EACAC,EACAiF,EACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GAsGJ,IAjGAxX,EAAK9B,EAAE/B,MACPmT,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QACFugB,GAEJH,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT6W,EAAK7W,EAAI,GACTkX,EAAKlX,EAAI,GACTuX,EAAKvX,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ4H,EAAG5H,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ2H,EAAG3H,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ0H,EAAG1H,EAAG,KAGxBqF,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT6W,EAAK7W,EAAI,GACTkX,EAAKlX,EAAI,GACTuX,EAAKvX,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ4H,EAAG5H,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ2H,EAAG3H,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQqF,EAAGrF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQiG,EAAGjG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQsG,EAAGtG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ2G,EAAG3G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQgH,EAAGhH,EAAG,GACxByH,EAAMzH,EAAI,GAAQqH,EAAGrH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ0H,EAAG1H,EAAG,IAGzBI,EAAK1R,EAAE9B,OACPyT,EAAKH,EAAEtT,OACP0Y,EAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGT8W,EAAO7Z,EAAEwD,UAAW,GACpBsW,EAAOtI,EAAEhO,UAAW,GACpBuW,EAAO7N,EAAE1I,UAAW,GAGd8V,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKF,EAAIE,KACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAMjX,EAAM8O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CACDtG,GAAMyG,EACNxG,GAAMyG,EACNxB,GAAMyB,CACN,CACD3G,GAAM8G,EACN7G,GAAM8G,EACN7B,GAAM8B,CACN,CACDhH,GAAMmH,EACNlH,GAAMmH,EACNlC,GAAMmC,CACN,CACDrH,GAAMwH,EACNvH,GAAMwH,EACNvC,GAAMwC,CACN,CACF,EC9MA,SAAoBpZ,EAAGwR,EAAGtF,EAAG4K,EAAYxI,GACxC,IAAI1L,EACA0T,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA9C,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA9C,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA3X,EACA6U,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAtI,EACAC,EACAC,GACAI,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GA8GJ,IAzGA7X,EAAK9B,EAAE/B,MACPmT,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,GAAKpF,EAAE3V,QACFugB,GAEJH,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT6W,EAAK7W,EAAI,GACTkX,EAAKlX,EAAI,GACTuX,EAAKvX,EAAI,GACT4X,EAAK5X,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ4H,EAAG5H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQiI,EAAGjI,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ2H,EAAG3H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQgI,EAAGhI,EAAG,GACxBqF,EAAMpF,GAAI,GACV2F,EAAM3F,GAAI,GAAQqF,EAAGrF,GAAG,GACxBgG,EAAMhG,GAAI,GAAQ4F,EAAG5F,GAAG,GACxBqG,EAAMrG,GAAI,GAAQiG,EAAGjG,GAAG,GACxB0G,EAAM1G,GAAI,GAAQsG,EAAGtG,GAAG,GACxB+G,EAAM/G,GAAI,GAAQ2G,EAAG3G,GAAG,GACxBoH,EAAMpH,GAAI,GAAQgH,EAAGhH,GAAG,GACxByH,EAAMzH,GAAI,GAAQqH,EAAGrH,GAAG,GACxB8H,EAAM9H,GAAI,GAAQ0H,EAAG1H,GAAG,GACxBmI,EAAMnI,GAAI,GAAQ+H,EAAG/H,GAAG,KAGxBqF,EAAK7U,EAAI,GACToV,EAAKpV,EAAI,GACTyV,EAAKzV,EAAI,GACT8V,EAAK9V,EAAI,GACTmW,EAAKnW,EAAI,GACTwW,EAAKxW,EAAI,GACT6W,EAAK7W,EAAI,GACTkX,EAAKlX,EAAI,GACTuX,EAAKvX,EAAI,GACT4X,EAAK5X,EAAI,GACT0U,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQuF,EAAGvF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ8F,EAAG9F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQmG,EAAGnG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ6G,EAAG7G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQkH,EAAGlH,EAAG,GACxByH,EAAMzH,EAAI,GAAQuH,EAAGvH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ4H,EAAG5H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQiI,EAAGjI,EAAG,GACxBqF,EAAMpF,EAAI,GACV2F,EAAM3F,EAAI,GAAQsF,EAAGtF,EAAG,GACxBgG,EAAMhG,EAAI,GAAQ6F,EAAG7F,EAAG,GACxBqG,EAAMrG,EAAI,GAAQkG,EAAGlG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQuG,EAAGvG,EAAG,GACxB+G,EAAM/G,EAAI,GAAQ4G,EAAG5G,EAAG,GACxBoH,EAAMpH,EAAI,GAAQiH,EAAGjH,EAAG,GACxByH,EAAMzH,EAAI,GAAQsH,EAAGtH,EAAG,GACxB8H,EAAM9H,EAAI,GAAQ2H,EAAG3H,EAAG,GACxBmI,EAAMnI,EAAI,GAAQgI,EAAGhI,EAAG,GACxBqF,EAAMpF,GAAI,GACV2F,EAAM3F,GAAI,GAAQqF,EAAGrF,GAAG,GACxBgG,EAAMhG,GAAI,GAAQ4F,EAAG5F,GAAG,GACxBqG,EAAMrG,GAAI,GAAQiG,EAAGjG,GAAG,GACxB0G,EAAM1G,GAAI,GAAQsG,EAAGtG,GAAG,GACxB+G,EAAM/G,GAAI,GAAQ2G,EAAG3G,GAAG,GACxBoH,EAAMpH,GAAI,GAAQgH,EAAGhH,GAAG,GACxByH,EAAMzH,GAAI,GAAQqH,EAAGrH,GAAG,GACxB8H,EAAM9H,GAAI,GAAQ0H,EAAG1H,GAAG,GACxBmI,EAAMnI,GAAI,GAAQ+H,EAAG/H,GAAG,IAGzBI,GAAK1R,EAAE9B,OACPyT,GAAKH,EAAEtT,OACP0Y,GAAK1K,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGT8W,EAAO7Z,EAAEwD,UAAW,GACpBsW,EAAOtI,EAAEhO,UAAW,GACpBuW,EAAO7N,EAAE1I,UAAW,GAGdmW,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKD,EAAIC,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKF,EAAIE,KACtBkD,EAAMxD,EAAMK,GAAItI,EAAKuL,EAAMjX,EAAM8O,IAAMoI,EAAMxD,EAAM3E,MACnDD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CACD3G,IAAM8G,EACN7G,IAAM8G,EACN7B,IAAM8B,CACN,CACDhH,IAAMmH,EACNlH,IAAMmH,EACNlC,IAAMmC,CACN,CACDrH,IAAMwH,EACNvH,IAAMwH,EACNvC,IAAMwC,CACN,CACD1H,IAAM6H,EACN5H,IAAM6H,EACN5C,IAAM6C,CACN,CACF,GtBlPIO,GAAiB,CuBYrB,SAA0Bha,EAAGwR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACArX,EACA0T,EACAC,EACAC,EACAO,EACAN,EACAO,EACAN,EACAO,EACAiD,EACAC,EACAC,EACAtY,EACAuY,EACA7X,EACA4O,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EACAiF,EACAC,EACAM,EACAsD,EACAC,EACAvY,EA8BJ,IAxBAL,GADAK,EAAI+P,GAAWlS,EAAE/B,MAAO+B,EAAEzJ,QAASib,EAAEjb,QAAS2V,EAAE3V,UACzCuL,GACPsP,EAAKjP,EAAEiP,GACPC,EAAKlP,EAAEkP,GACPC,EAAKnP,EAAEmP,GAGP2I,EAAQjE,GAAWhW,EAAEf,MAAOuS,EAAEvS,MAAOiN,EAAEjN,OAGvCqb,EAAKta,EAAE9B,OACPqc,EAAK/I,EAAEtT,OACPsc,EAAKtO,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTyT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGHoJ,EAAK5Y,EAAG,GAAI4Y,EAAK,GAWtB,IAVKA,EAAKT,GACTzX,EAAKkY,EACLA,EAAK,IAELlY,EAAKyX,EACLS,GAAMT,GAEPC,EAAMI,EAAOI,EAAGtJ,EAAG,GACnB+I,EAAMI,EAAOG,EAAGrJ,EAAG,GACnB+I,EAAMI,EAAOE,EAAGpJ,EAAG,GACbmJ,EAAK3Y,EAAG,GAAI2Y,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPvI,EAAKwI,EAAQO,EAAGrJ,EAAG,GACnBO,EAAKwI,EAAQM,EAAGpJ,EAAG,GACnBuF,EAAKwD,EAAQK,EAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhB6F,EAAK,EAAGA,EAAK3U,EAAI2U,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBN,EAAMK,GAAOtI,EAAK1L,EAAM8O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CAGJ,ECrGA,SAA0BjX,EAAGwR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACArX,EACA0T,EACAC,EACAC,EACAO,EACAK,EACAX,EACAO,EACAK,EACAX,EACAO,EACAK,EACA4C,EACAS,EACAR,EACAS,EACAR,EACAS,EACA/Y,EACAuY,EACA7X,EACAC,EACA2O,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAiD,EACAC,EACAI,EACA3Y,EA8BJ,IAxBAL,GADAK,EAAI+P,GAAWlS,EAAE/B,MAAO+B,EAAEzJ,QAASib,EAAEjb,QAAS2V,EAAE3V,UACzCuL,GACPsP,EAAKjP,EAAEiP,GACPC,EAAKlP,EAAEkP,GACPC,EAAKnP,EAAEmP,GAGP2I,EAAQjE,GAAWhW,EAAEf,MAAOuS,EAAEvS,MAAOiN,EAAEjN,OAGvCqb,EAAKta,EAAE9B,OACPqc,EAAK/I,EAAEtT,OACPsc,EAAKtO,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTyT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGHwJ,EAAKhZ,EAAG,GAAIgZ,EAAK,GAWtB,IAVKA,EAAKb,GACTxX,EAAKqY,EACLA,EAAK,IAELrY,EAAKwX,EACLa,GAAMb,GAEPU,EAAML,EAAOQ,EAAG1J,EAAG,GACnBwJ,EAAML,EAAOO,EAAGzJ,EAAG,GACnBwJ,EAAML,EAAOM,EAAGxJ,EAAG,GACboJ,EAAK5Y,EAAG,GAAI4Y,EAAK,GActB,IAbKA,EAAKT,GACTzX,EAAKkY,EACLA,EAAK,IAELlY,EAAKyX,EACLS,GAAMT,GAEP7C,EAAMhG,EAAG,GAAO5O,EAAG4O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO7O,EAAG6O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO9O,EAAG8O,EAAG,GACtB4I,EAAMS,EAAQD,EAAGtJ,EAAG,GACpB+I,EAAMS,EAAQF,EAAGrJ,EAAG,GACpB+I,EAAMS,EAAQH,EAAGpJ,EAAG,GACdmJ,EAAK3Y,EAAG,GAAI2Y,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPvI,EAAKwI,EAAQO,EAAGrJ,EAAG,GACnBO,EAAKwI,EAAQM,EAAGpJ,EAAG,GACnBuF,EAAKwD,EAAQK,EAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhBkG,EAAK,EAAGA,EAAK/U,EAAI+U,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAK3U,EAAI2U,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBN,EAAMK,GAAOtI,EAAK1L,EAAM8O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CAIL,ECpIA,SAA0BtX,EAAGwR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACArX,EACA0T,EACAC,EACAC,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAuC,EACAS,EACAI,EACAZ,EACAS,EACAI,EACAZ,EACAS,EACAI,EACAnZ,EACAuY,EACA7X,EACAC,EACAyY,EACA9J,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACA4C,EACAC,EACAI,EACAK,EACAhZ,EA8BJ,IAxBAL,GADAK,EAAI+P,GAAWlS,EAAE/B,MAAO+B,EAAEzJ,QAASib,EAAEjb,QAAS2V,EAAE3V,UACzCuL,GACPsP,EAAKjP,EAAEiP,GACPC,EAAKlP,EAAEkP,GACPC,EAAKnP,EAAEmP,GAGP2I,EAAQjE,GAAWhW,EAAEf,MAAOuS,EAAEvS,MAAOiN,EAAEjN,OAGvCqb,EAAKta,EAAE9B,OACPqc,EAAK/I,EAAEtT,OACPsc,EAAKtO,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTyT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGH6J,EAAKrZ,EAAG,GAAIqZ,EAAK,GAWtB,IAVKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPc,EAAMT,EAAOa,EAAG/J,EAAG,GACnB4J,EAAMT,EAAOY,EAAG9J,EAAG,GACnB4J,EAAMT,EAAOW,EAAG7J,EAAG,GACbwJ,EAAKhZ,EAAG,GAAIgZ,EAAK,GActB,IAbKA,EAAKb,GACTxX,EAAKqY,EACLA,EAAK,IAELrY,EAAKwX,EACLa,GAAMb,GAEPxC,EAAMrG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsG,EAAMrG,EAAG,GAAO5O,EAAG4O,EAAG,GACtBsG,EAAMrG,EAAG,GAAO7O,EAAG6O,EAAG,GACtBqJ,EAAMI,EAAQD,EAAG1J,EAAG,GACpBwJ,EAAMI,EAAQF,EAAGzJ,EAAG,GACpBwJ,EAAMI,EAAQH,EAAGxJ,EAAG,GACdoJ,EAAK5Y,EAAG,GAAI4Y,EAAK,GActB,IAbKA,EAAKT,GACTzX,EAAKkY,EACLA,EAAK,IAELlY,EAAKyX,EACLS,GAAMT,GAEP7C,EAAMhG,EAAG,GAAO5O,EAAG4O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO7O,EAAG6O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO9O,EAAG8O,EAAG,GACtB4I,EAAMS,EAAQD,EAAGtJ,EAAG,GACpB+I,EAAMS,EAAQF,EAAGrJ,EAAG,GACpB+I,EAAMS,EAAQH,EAAGpJ,EAAG,GACdmJ,EAAK3Y,EAAG,GAAI2Y,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPvI,EAAKwI,EAAQO,EAAGrJ,EAAG,GACnBO,EAAKwI,EAAQM,EAAGpJ,EAAG,GACnBuF,EAAKwD,EAAQK,EAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhBuG,EAAK,EAAGA,EAAKqD,EAAIrD,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAK/U,EAAI+U,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAK3U,EAAI2U,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBN,EAAMK,GAAOtI,EAAK1L,EAAM8O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CAKN,ECjKA,SAA0B3X,EAAGwR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACArX,EACA0T,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACAkC,EACAS,EACAI,EACAK,EACAjB,EACAS,EACAI,EACAK,EACAjB,EACAS,EACAI,EACAK,EACAxZ,EACAuY,EACA7X,EACAC,EACAyY,EACAK,EACAnK,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACAK,GACAuC,GACAC,GACAI,GACAK,GACAK,GACArZ,GA8BJ,IAxBAL,GADAK,GAAI+P,GAAWlS,EAAE/B,MAAO+B,EAAEzJ,QAASib,EAAEjb,QAAS2V,EAAE3V,UACzCuL,GACPsP,EAAKjP,GAAEiP,GACPC,EAAKlP,GAAEkP,GACPC,EAAKnP,GAAEmP,GAGP2I,EAAQjE,GAAWhW,EAAEf,MAAOuS,EAAEvS,MAAOiN,EAAEjN,OAGvCqb,EAAKta,EAAE9B,OACPqc,EAAK/I,EAAEtT,OACPsc,EAAKtO,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTyT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGHkK,GAAK1Z,EAAG,GAAI0Z,GAAK,GAWtB,IAVKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEPmB,EAAMd,EAAOkB,GAAGpK,EAAG,GACnBiK,EAAMd,EAAOiB,GAAGnK,EAAG,GACnBiK,EAAMd,EAAOgB,GAAGlK,EAAG,GACb6J,GAAKrZ,EAAG,GAAIqZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,EAAG,GAAO8J,EAAG9J,EAAG,GACtB2G,EAAM1G,EAAG,GAAO6J,EAAG7J,EAAG,GACtB2G,EAAM1G,EAAG,GAAO4J,EAAG5J,EAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,EAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,EAAG,GACpB4J,EAAMK,EAAQH,GAAG7J,EAAG,GACdwJ,GAAKhZ,EAAG,GAAIgZ,GAAK,GActB,IAbKA,GAAKb,GACTxX,EAAKqY,GACLA,GAAK,IAELrY,EAAKwX,EACLa,IAAMb,GAEPxC,EAAMrG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsG,EAAMrG,EAAG,GAAO5O,EAAG4O,EAAG,GACtBsG,EAAMrG,EAAG,GAAO7O,EAAG6O,EAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,EAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,EAAG,GACpBwJ,EAAMI,EAAQH,GAAGxJ,EAAG,GACdoJ,GAAK5Y,EAAG,GAAI4Y,GAAK,GActB,IAbKA,GAAKT,GACTzX,EAAKkY,GACLA,GAAK,IAELlY,EAAKyX,EACLS,IAAMT,GAEP7C,EAAMhG,EAAG,GAAO5O,EAAG4O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO7O,EAAG6O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO9O,EAAG8O,EAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,EAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,EAAG,GACpB+I,EAAMS,EAAQH,GAAGpJ,EAAG,GACdmJ,GAAK3Y,EAAG,GAAI2Y,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPvI,EAAKwI,EAAQO,GAAGrJ,EAAG,GACnBO,EAAKwI,EAAQM,GAAGpJ,EAAG,GACnBuF,EAAKwD,EAAQK,GAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhB4G,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKqD,EAAIrD,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAK/U,EAAI+U,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAK3U,EAAI2U,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBN,EAAMK,GAAOtI,EAAK1L,EAAM8O,GAAM4E,EAAM3E,IACpCD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CAMP,EC9LA,SAA0BhY,EAAGwR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACArX,EACA0T,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACA6B,EACAS,EACAI,EACAK,EACAK,EACAtB,EACAS,EACAI,EACAK,EACAK,EACAtB,EACAS,EACAI,EACAK,EACAK,EACA7Z,EACAuY,EACA7X,EACAC,EACAyY,EACAK,EACAK,EACAxK,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAkC,GACAC,GACAI,GACAK,GACAK,GACAK,GACA1Z,GA8BJ,IAxBAL,GADAK,GAAI+P,GAAWlS,EAAE/B,MAAO+B,EAAEzJ,QAASib,EAAEjb,QAAS2V,EAAE3V,UACzCuL,GACPsP,EAAKjP,GAAEiP,GACPC,EAAKlP,GAAEkP,GACPC,EAAKnP,GAAEmP,GAGP2I,EAAQjE,GAAWhW,EAAEf,MAAOuS,EAAEvS,MAAOiN,EAAEjN,OAGvCqb,EAAKta,EAAE9B,OACPqc,EAAK/I,EAAEtT,OACPsc,EAAKtO,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTyT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGHuK,GAAK/Z,EAAG,GAAI+Z,GAAK,GAWtB,IAVKA,GAAK5B,GACT2B,EAAKC,GACLA,GAAK,IAELD,EAAK3B,EACL4B,IAAM5B,GAEPwB,EAAMnB,EAAOuB,GAAGzK,EAAG,GACnBsK,EAAMnB,EAAOsB,GAAGxK,EAAG,GACnBsK,EAAMnB,EAAOqB,GAAGvK,EAAG,GACbkK,GAAK1Z,EAAG,GAAI0Z,GAAK,GActB,IAbKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,EAAG,GAAOmK,EAAGnK,EAAG,GACtBgH,EAAM/G,EAAG,GAAOkK,EAAGlK,EAAG,GACtBgH,EAAM/G,EAAG,GAAOiK,EAAGjK,EAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,EAAG,GACpBiK,EAAMK,EAAQF,GAAGnK,EAAG,GACpBiK,EAAMK,EAAQH,GAAGlK,EAAG,GACd6J,GAAKrZ,EAAG,GAAIqZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,EAAG,GAAO8J,EAAG9J,EAAG,GACtB2G,EAAM1G,EAAG,GAAO6J,EAAG7J,EAAG,GACtB2G,EAAM1G,EAAG,GAAO4J,EAAG5J,EAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,EAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,EAAG,GACpB4J,EAAMK,EAAQH,GAAG7J,EAAG,GACdwJ,GAAKhZ,EAAG,GAAIgZ,GAAK,GActB,IAbKA,GAAKb,GACTxX,EAAKqY,GACLA,GAAK,IAELrY,EAAKwX,EACLa,IAAMb,GAEPxC,EAAMrG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsG,EAAMrG,EAAG,GAAO5O,EAAG4O,EAAG,GACtBsG,EAAMrG,EAAG,GAAO7O,EAAG6O,EAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,EAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,EAAG,GACpBwJ,EAAMI,EAAQH,GAAGxJ,EAAG,GACdoJ,GAAK5Y,EAAG,GAAI4Y,GAAK,GActB,IAbKA,GAAKT,GACTzX,EAAKkY,GACLA,GAAK,IAELlY,EAAKyX,EACLS,IAAMT,GAEP7C,EAAMhG,EAAG,GAAO5O,EAAG4O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO7O,EAAG6O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO9O,EAAG8O,EAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,EAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,EAAG,GACpB+I,EAAMS,EAAQH,GAAGpJ,EAAG,GACdmJ,GAAK3Y,EAAG,GAAI2Y,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,EAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,EAAG,GACnBuF,GAAKwD,EAAQK,GAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhBiH,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK/U,EAAI+U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK3U,EAAI2U,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,EAAIxD,KACtBN,EAAMK,IAAOtI,EAAK1L,EAAM8O,IAAM4E,EAAM3E,KACpCD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CAOR,EC3NA,SAA0BrY,EAAGwR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACArX,EACA0T,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAwB,EACAS,EACAI,EACAK,EACAK,EACAK,EACA3B,EACAS,EACAI,EACAK,EACAK,EACAK,EACA3B,EACAS,EACAI,EACAK,EACAK,EACAK,EACAla,EACAuY,EACA7X,EACAC,EACAyY,EACAK,EACAK,EACAK,GACA7K,GACAC,GACAC,GACAgJ,GACAC,GACAC,GACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACA6B,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACA/Z,GA8BJ,IAxBAL,GADAK,GAAI+P,GAAWlS,EAAE/B,MAAO+B,EAAEzJ,QAASib,EAAEjb,QAAS2V,EAAE3V,UACzCuL,GACPsP,GAAKjP,GAAEiP,GACPC,GAAKlP,GAAEkP,GACPC,GAAKnP,GAAEmP,GAGP2I,EAAQjE,GAAWhW,EAAEf,MAAOuS,EAAEvS,MAAOiN,EAAEjN,OAGvCqb,GAAKta,EAAE9B,OACPqc,GAAK/I,EAAEtT,OACPsc,GAAKtO,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTyT,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GAGH4K,GAAKpa,EAAG,GAAIoa,GAAK,GAWtB,IAVKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEP6B,EAAMxB,GAAO4B,GAAG9K,GAAG,GACnB2K,EAAMxB,GAAO2B,GAAG7K,GAAG,GACnB2K,EAAMxB,GAAO0B,GAAG5K,GAAG,GACbuK,GAAK/Z,EAAG,GAAI+Z,GAAK,GActB,IAbKA,GAAK5B,GACT2B,EAAKC,GACLA,GAAK,IAELD,EAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpH,GAAG,GAAOwK,EAAGxK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOuK,EAAGvK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOsK,EAAGtK,GAAG,GACtBmK,EAAMK,EAAQD,GAAGzK,GAAG,GACpBsK,EAAMK,EAAQF,GAAGxK,GAAG,GACpBsK,EAAMK,EAAQH,GAAGvK,GAAG,GACdkK,GAAK1Z,EAAG,GAAI0Z,GAAK,GActB,IAbKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,GAAG,GAAOmK,EAAGnK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOkK,EAAGlK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOiK,EAAGjK,GAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,GAAG,GACpBiK,EAAMK,EAAQF,GAAGnK,GAAG,GACpBiK,EAAMK,EAAQH,GAAGlK,GAAG,GACd6J,GAAKrZ,EAAG,GAAIqZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,GAAG,GAAO8J,EAAG9J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO6J,EAAG7J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO4J,EAAG5J,GAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,GAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,GAAG,GACpB4J,EAAMK,EAAQH,GAAG7J,GAAG,GACdwJ,GAAKhZ,EAAG,GAAIgZ,GAAK,GActB,IAbKA,GAAKb,GACTxX,EAAKqY,GACLA,GAAK,IAELrY,EAAKwX,EACLa,IAAMb,GAEPxC,EAAMrG,GAAG,GAAO3O,EAAG2O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO5O,EAAG4O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO7O,EAAG6O,GAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,GAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,GAAG,GACpBwJ,EAAMI,EAAQH,GAAGxJ,GAAG,GACdoJ,GAAK5Y,EAAG,GAAI4Y,GAAK,GActB,IAbKA,GAAKT,GACTzX,EAAKkY,GACLA,GAAK,IAELlY,EAAKyX,EACLS,IAAMT,GAEP7C,EAAMhG,GAAG,GAAO5O,EAAG4O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO7O,EAAG6O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO9O,EAAG8O,GAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,GAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,GAAG,GACpB+I,EAAMS,EAAQH,GAAGpJ,GAAG,GACdmJ,GAAK3Y,EAAG,GAAI2Y,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,GAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,GAAG,GACnBuF,GAAKwD,EAAQK,GAAGnJ,GAAG,GAGnByF,EAAM3F,GAAG,GAAOiJ,EAAGjJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAOgJ,EAAGhJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAO+I,EAAG/I,GAAG,GAGhBsH,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK/U,EAAI+U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK3U,EAAI2U,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,EAAIxD,KACtBN,EAAMK,IAAOtI,EAAK1L,EAAM8O,IAAM4E,EAAM3E,KACpCD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CACD3G,IAAM8G,EACN7G,IAAM8G,EACN7B,IAAM8B,CACN,CAQT,ECxPA,SAA0B1Y,EAAGwR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACArX,EACA0T,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACApC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACApC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAmB,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAhC,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAhC,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAva,EACAuY,GACA7X,GACAC,GACAyY,GACAK,GACAK,GACAK,GACAK,GACAlL,GACAC,GACAC,GACAgJ,GACAC,GACAC,GACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAwB,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACApa,GA8BJ,IAxBAL,GADAK,GAAI+P,GAAWlS,EAAE/B,MAAO+B,EAAEzJ,QAASib,EAAEjb,QAAS2V,EAAE3V,UACzCuL,GACPsP,GAAKjP,GAAEiP,GACPC,GAAKlP,GAAEkP,GACPC,GAAKnP,GAAEmP,GAGP2I,EAAQjE,GAAWhW,EAAEf,MAAOuS,EAAEvS,MAAOiN,EAAEjN,OAGvCqb,GAAKta,EAAE9B,OACPqc,GAAK/I,EAAEtT,OACPsc,GAAKtO,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTyT,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GAGHiL,GAAKza,EAAG,GAAIya,GAAK,GAWtB,IAVKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPkC,EAAM7B,GAAOiC,GAAGnL,GAAG,GACnBgL,EAAM7B,GAAOgC,GAAGlL,GAAG,GACnBgL,EAAM7B,GAAO+B,GAAGjL,GAAG,GACb4K,GAAKpa,EAAG,GAAIoa,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzH,GAAG,GAAO6K,GAAG7K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO4K,GAAG5K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO2K,GAAG3K,GAAG,GACtBwK,EAAMK,EAAQD,GAAG9K,GAAG,GACpB2K,EAAMK,EAAQF,GAAG7K,GAAG,GACpB2K,EAAMK,EAAQH,GAAG5K,GAAG,GACduK,GAAK/Z,EAAG,GAAI+Z,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpH,GAAG,GAAOwK,GAAGxK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOuK,GAAGvK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOsK,GAAGtK,GAAG,GACtBmK,EAAMK,EAAQD,GAAGzK,GAAG,GACpBsK,EAAMK,EAAQF,GAAGxK,GAAG,GACpBsK,EAAMK,EAAQH,GAAGvK,GAAG,GACdkK,GAAK1Z,EAAG,GAAI0Z,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,GAAG,GAAOmK,GAAGnK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOkK,GAAGlK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOiK,GAAGjK,GAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,GAAG,GACpBiK,EAAMK,EAAQF,GAAGnK,GAAG,GACpBiK,EAAMK,EAAQH,GAAGlK,GAAG,GACd6J,GAAKrZ,EAAG,GAAIqZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,GAAG,GAAO8J,GAAG9J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO6J,GAAG7J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO4J,GAAG5J,GAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,GAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,GAAG,GACpB4J,EAAMK,EAAQH,GAAG7J,GAAG,GACdwJ,GAAKhZ,EAAG,GAAIgZ,GAAK,GActB,IAbKA,GAAKb,GACTxX,GAAKqY,GACLA,GAAK,IAELrY,GAAKwX,EACLa,IAAMb,GAEPxC,EAAMrG,GAAG,GAAO3O,GAAG2O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO5O,GAAG4O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO7O,GAAG6O,GAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,GAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,GAAG,GACpBwJ,EAAMI,EAAQH,GAAGxJ,GAAG,GACdoJ,GAAK5Y,EAAG,GAAI4Y,GAAK,GActB,IAbKA,GAAKT,GACTzX,GAAKkY,GACLA,GAAK,IAELlY,GAAKyX,EACLS,IAAMT,GAEP7C,EAAMhG,GAAG,GAAO5O,GAAG4O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO7O,GAAG6O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO9O,GAAG8O,GAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,GAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,GAAG,GACpB+I,EAAMS,EAAQH,GAAGpJ,GAAG,GACdmJ,GAAK3Y,EAAG,GAAI2Y,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,GAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,GAAG,GACnBuF,GAAKwD,EAAQK,GAAGnJ,GAAG,GAGnByF,EAAM3F,GAAG,GAAOiJ,GAAGjJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAOgJ,GAAGhJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAO+I,GAAG/I,GAAG,GAGhB2H,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK/U,GAAI+U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK3U,GAAI2U,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBN,EAAMK,IAAOtI,EAAK1L,EAAM8O,IAAM4E,EAAM3E,KACpCD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CACD3G,IAAM8G,EACN7G,IAAM8G,EACN7B,IAAM8B,CACN,CACDhH,IAAMmH,EACNlH,IAAMmH,EACNlC,IAAMmC,CACN,CASV,ECrRA,SAA0B/Y,EAAGwR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACArX,EACA0T,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAzC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAzC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAc,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAK,EACArC,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAK,EACArC,EACAS,EACAI,EACAK,GACAK,GACAK,GACAK,GACAK,GACA5a,GACAuY,GACA7X,GACAC,GACAyY,GACAK,GACAK,GACAK,GACAK,GACAK,GACAvL,GACAC,GACAC,GACAgJ,GACAC,GACAC,GACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAmB,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAza,GA8BJ,IAxBAL,IADAK,GAAI+P,GAAWlS,EAAE/B,MAAO+B,EAAEzJ,QAASib,EAAEjb,QAAS2V,EAAE3V,UACzCuL,GACPsP,GAAKjP,GAAEiP,GACPC,GAAKlP,GAAEkP,GACPC,GAAKnP,GAAEmP,GAGP2I,EAAQjE,GAAWhW,EAAEf,MAAOuS,EAAEvS,MAAOiN,EAAEjN,OAGvCqb,GAAKta,EAAE9B,OACPqc,GAAK/I,EAAEtT,OACPsc,GAAKtO,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTyT,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GAGHsL,GAAK9a,GAAG,GAAI8a,GAAK,GAWtB,IAVKA,GAAK3C,GACT0C,GAAKC,GACLA,GAAK,IAELD,GAAK1C,EACL2C,IAAM3C,GAEPuC,EAAMlC,GAAOsC,GAAGxL,GAAG,GACnBqL,EAAMlC,GAAOqC,GAAGvL,GAAG,GACnBqL,GAAMlC,GAAOoC,GAAGtL,GAAG,GACbiL,GAAKza,GAAG,GAAIya,GAAK,GActB,IAbKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPf,EAAM9H,GAAG,GAAOkL,GAAGlL,GAAG,GACtB+H,EAAM9H,GAAG,GAAOiL,GAAGjL,GAAG,GACtB+H,EAAM9H,GAAG,GAAOgL,GAAGhL,GAAG,GACtB6K,EAAMK,EAAQD,GAAGnL,GAAG,GACpBgL,EAAMK,EAAQF,GAAGlL,GAAG,GACpBgL,GAAMK,GAAQH,GAAGjL,GAAG,GACd4K,GAAKpa,GAAG,GAAIoa,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzH,GAAG,GAAO6K,GAAG7K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO4K,GAAG5K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO2K,GAAG3K,GAAG,GACtBwK,EAAMK,EAAQD,GAAG9K,GAAG,GACpB2K,EAAMK,EAAQF,GAAG7K,GAAG,GACpB2K,GAAMK,GAAQH,GAAG5K,GAAG,GACduK,GAAK/Z,GAAG,GAAI+Z,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpH,GAAG,GAAOwK,GAAGxK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOuK,GAAGvK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOsK,GAAGtK,GAAG,GACtBmK,EAAMK,EAAQD,GAAGzK,GAAG,GACpBsK,EAAMK,EAAQF,GAAGxK,GAAG,GACpBsK,GAAMK,GAAQH,GAAGvK,GAAG,GACdkK,GAAK1Z,GAAG,GAAI0Z,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,GAAG,GAAOmK,GAAGnK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOkK,GAAGlK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOiK,GAAGjK,GAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,GAAG,GACpBiK,EAAMK,EAAQF,GAAGnK,GAAG,GACpBiK,GAAMK,GAAQH,GAAGlK,GAAG,GACd6J,GAAKrZ,GAAG,GAAIqZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,GAAG,GAAO8J,GAAG9J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO6J,GAAG7J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO4J,GAAG5J,GAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,GAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,GAAG,GACpB4J,EAAMK,GAAQH,GAAG7J,GAAG,GACdwJ,GAAKhZ,GAAG,GAAIgZ,GAAK,GActB,IAbKA,GAAKb,GACTxX,GAAKqY,GACLA,GAAK,IAELrY,GAAKwX,EACLa,IAAMb,GAEPxC,EAAMrG,GAAG,GAAO3O,GAAG2O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO5O,GAAG4O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO7O,GAAG6O,GAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,GAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,GAAG,GACpBwJ,EAAMI,EAAQH,GAAGxJ,GAAG,GACdoJ,GAAK5Y,GAAG,GAAI4Y,GAAK,GActB,IAbKA,GAAKT,GACTzX,GAAKkY,GACLA,GAAK,IAELlY,GAAKyX,EACLS,IAAMT,GAEP7C,EAAMhG,GAAG,GAAO5O,GAAG4O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO7O,GAAG6O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO9O,GAAG8O,GAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,GAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,GAAG,GACpB+I,EAAMS,EAAQH,GAAGpJ,GAAG,GACdmJ,GAAK3Y,GAAG,GAAI2Y,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,GAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,GAAG,GACnBuF,GAAKwD,EAAQK,GAAGnJ,GAAG,GAGnByF,EAAM3F,GAAG,GAAOiJ,GAAGjJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAOgJ,GAAGhJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAO+I,GAAG/I,GAAG,GAGhBgI,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK/U,GAAI+U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK3U,GAAI2U,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBN,EAAMK,IAAOtI,EAAK1L,EAAM8O,IAAM4E,EAAM3E,KACpCD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CACD3G,IAAM8G,EACN7G,IAAM8G,EACN7B,IAAM8B,CACN,CACDhH,IAAMmH,EACNlH,IAAMmH,EACNlC,IAAMmC,CACN,CACDrH,IAAMwH,EACNvH,IAAMwH,EACNvC,IAAMwC,CACN,CAUX,EClTA,SAA2BpZ,EAAGwR,EAAGtF,EAAGoC,GACnC,IAAI2L,EACArX,EACA0T,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA9C,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA9C,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAS,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA1C,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAK,GACAK,GACA1C,GACAS,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAjb,GACAuY,GACA7X,GACAC,GACAyY,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACA5L,GACAC,GACAC,GACAgJ,GACAC,GACAC,GACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAc,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACA9a,GA8BJ,IAxBAL,IADAK,GAAI+P,GAAWlS,EAAE/B,MAAO+B,EAAEzJ,QAASib,EAAEjb,QAAS2V,EAAE3V,UACzCuL,GACPsP,GAAKjP,GAAEiP,GACPC,GAAKlP,GAAEkP,GACPC,GAAKnP,GAAEmP,GAGP2I,EAAQjE,GAAWhW,EAAEf,MAAOuS,EAAEvS,MAAOiN,EAAEjN,OAGvCqb,GAAKta,EAAE9B,OACPqc,GAAK/I,EAAEtT,OACPsc,GAAKtO,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTyT,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GAGH2L,GAAKnb,GAAG,GAAImb,GAAK,GAWtB,IAVKA,GAAKhD,GACT+C,GAAKC,GACLA,GAAK,IAELD,GAAK/C,EACLgD,IAAMhD,GAEP4C,EAAMvC,GAAO2C,GAAG7L,GAAG,GACnB0L,GAAMvC,GAAO0C,GAAG5L,GAAG,GACnB0L,GAAMvC,GAAOyC,GAAG3L,GAAG,GACbsL,GAAK9a,GAAG,GAAI8a,GAAK,GActB,IAbKA,GAAK3C,GACT0C,GAAKC,GACLA,GAAK,IAELD,GAAK1C,EACL2C,IAAM3C,GAEPV,EAAMnI,GAAG,GAAOuL,GAAGvL,GAAG,GACtBoI,EAAMnI,GAAG,GAAOsL,GAAGtL,GAAG,GACtBoI,EAAMnI,GAAG,GAAOqL,GAAGrL,GAAG,GACtBkL,EAAMK,EAAQD,GAAGxL,GAAG,GACpBqL,GAAMK,GAAQF,GAAGvL,GAAG,GACpBqL,GAAMK,GAAQH,GAAGtL,GAAG,GACdiL,GAAKza,GAAG,GAAIya,GAAK,GActB,IAbKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPf,EAAM9H,GAAG,GAAOkL,GAAGlL,GAAG,GACtB+H,EAAM9H,GAAG,GAAOiL,GAAGjL,GAAG,GACtB+H,EAAM9H,GAAG,GAAOgL,GAAGhL,GAAG,GACtB6K,EAAMK,EAAQD,GAAGnL,GAAG,GACpBgL,EAAMK,GAAQF,GAAGlL,GAAG,GACpBgL,GAAMK,GAAQH,GAAGjL,GAAG,GACd4K,GAAKpa,GAAG,GAAIoa,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzH,GAAG,GAAO6K,GAAG7K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO4K,GAAG5K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO2K,GAAG3K,GAAG,GACtBwK,EAAMK,EAAQD,GAAG9K,GAAG,GACpB2K,EAAMK,EAAQF,GAAG7K,GAAG,GACpB2K,GAAMK,GAAQH,GAAG5K,GAAG,GACduK,GAAK/Z,GAAG,GAAI+Z,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpH,GAAG,GAAOwK,GAAGxK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOuK,GAAGvK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOsK,GAAGtK,GAAG,GACtBmK,EAAMK,EAAQD,GAAGzK,GAAG,GACpBsK,EAAMK,EAAQF,GAAGxK,GAAG,GACpBsK,GAAMK,GAAQH,GAAGvK,GAAG,GACdkK,GAAK1Z,GAAG,GAAI0Z,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,GAAG,GAAOmK,GAAGnK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOkK,GAAGlK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOiK,GAAGjK,GAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,GAAG,GACpBiK,EAAMK,EAAQF,GAAGnK,GAAG,GACpBiK,GAAMK,GAAQH,GAAGlK,GAAG,GACd6J,GAAKrZ,GAAG,GAAIqZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,GAAG,GAAO8J,GAAG9J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO6J,GAAG7J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO4J,GAAG5J,GAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,GAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,GAAG,GACpB4J,GAAMK,GAAQH,GAAG7J,GAAG,GACdwJ,GAAKhZ,GAAG,GAAIgZ,GAAK,GActB,IAbKA,GAAKb,GACTxX,GAAKqY,GACLA,GAAK,IAELrY,GAAKwX,EACLa,IAAMb,GAEPxC,EAAMrG,GAAG,GAAO3O,GAAG2O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO5O,GAAG4O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO7O,GAAG6O,GAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,GAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,GAAG,GACpBwJ,GAAMI,GAAQH,GAAGxJ,GAAG,GACdoJ,GAAK5Y,GAAG,GAAI4Y,GAAK,GActB,IAbKA,GAAKT,GACTzX,GAAKkY,GACLA,GAAK,IAELlY,GAAKyX,EACLS,IAAMT,GAEP7C,EAAMhG,GAAG,GAAO5O,GAAG4O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO7O,GAAG6O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO9O,GAAG8O,GAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,GAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,GAAG,GACpB+I,GAAMS,GAAQH,GAAGpJ,GAAG,GACdmJ,GAAK3Y,GAAG,GAAI2Y,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,GAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,GAAG,GACnBuF,GAAKwD,GAAQK,GAAGnJ,GAAG,GAGnByF,EAAM3F,GAAG,GAAOiJ,GAAGjJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAOgJ,GAAGhJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAO+I,GAAG/I,GAAG,GAGhBqI,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK/U,GAAI+U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK3U,GAAI2U,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBN,EAAMK,IAAOtI,EAAK1L,EAAM8O,IAAM4E,EAAM3E,KACpCD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CACD3G,IAAM8G,EACN7G,IAAM8G,EACN7B,IAAM8B,CACN,CACDhH,IAAMmH,EACNlH,IAAMmH,EACNlC,IAAMmC,CACN,CACDrH,IAAMwH,EACNvH,IAAMwH,EACNvC,IAAMwC,CACN,CACD1H,IAAM6H,EACN5H,IAAM6H,EACN5C,IAAM6C,CACN,CAWZ,G/BlVIyD,GAA0B,CgCS9B,SAA0Bld,EAAGwR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACArX,EACA0T,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAN,EACAO,EACAN,EACAO,EACAiD,EACAC,EACAC,EACAtY,EACAuY,EACA7X,EACA4O,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EACAiF,EACAC,EACAM,EACAsD,EACAC,EACAvY,EAmCJ,IA7BAL,GADAK,EAAI+P,GAAWlS,EAAE/B,MAAO+B,EAAEzJ,QAASib,EAAEjb,QAAS2V,EAAE3V,UACzCuL,GACPsP,EAAKjP,EAAEiP,GACPC,EAAKlP,EAAEkP,GACPC,EAAKnP,EAAEmP,GAGP2I,EAAQjE,GAAWhW,EAAEf,MAAOuS,EAAEvS,MAAOiN,EAAEjN,OAGvCqb,EAAKta,EAAE9B,OACPqc,EAAK/I,EAAEtT,OACPsc,EAAKtO,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTyT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGTuI,EAAO7Z,EAAEwD,UAAU,GACnBsW,EAAOtI,EAAEhO,UAAU,GACnBuW,EAAO7N,EAAE1I,UAAU,GAGbkX,EAAK5Y,EAAG,GAAI4Y,EAAK,GAWtB,IAVKA,EAAKT,GACTzX,EAAKkY,EACLA,EAAK,IAELlY,EAAKyX,EACLS,GAAMT,GAEPC,EAAMI,EAAOI,EAAGtJ,EAAG,GACnB+I,EAAMI,EAAOG,EAAGrJ,EAAG,GACnB+I,EAAMI,EAAOE,EAAGpJ,EAAG,GACbmJ,EAAK3Y,EAAG,GAAI2Y,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPvI,EAAKwI,EAAQO,EAAGrJ,EAAG,GACnBO,EAAKwI,EAAQM,EAAGpJ,EAAG,GACnBuF,EAAKwD,EAAQK,EAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhB6F,EAAK,EAAGA,EAAK3U,EAAI2U,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAMjX,EAAM8O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CAGJ,EC7GA,SAA0BjX,EAAGwR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACArX,EACA0T,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAX,EACAO,EACAK,EACAX,EACAO,EACAK,EACA4C,EACAS,EACAR,EACAS,EACAR,EACAS,EACA/Y,EACAuY,EACA7X,EACAC,EACA2O,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAiD,EACAC,EACAI,EACA3Y,EAmCJ,IA7BAL,GADAK,EAAI+P,GAAWlS,EAAE/B,MAAO+B,EAAEzJ,QAASib,EAAEjb,QAAS2V,EAAE3V,UACzCuL,GACPsP,EAAKjP,EAAEiP,GACPC,EAAKlP,EAAEkP,GACPC,EAAKnP,EAAEmP,GAGP2I,EAAQjE,GAAWhW,EAAEf,MAAOuS,EAAEvS,MAAOiN,EAAEjN,OAGvCqb,EAAKta,EAAE9B,OACPqc,EAAK/I,EAAEtT,OACPsc,EAAKtO,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTyT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGTuI,EAAO7Z,EAAEwD,UAAU,GACnBsW,EAAOtI,EAAEhO,UAAU,GACnBuW,EAAO7N,EAAE1I,UAAU,GAGbsX,EAAKhZ,EAAG,GAAIgZ,EAAK,GAWtB,IAVKA,EAAKb,GACTxX,EAAKqY,EACLA,EAAK,IAELrY,EAAKwX,EACLa,GAAMb,GAEPU,EAAML,EAAOQ,EAAG1J,EAAG,GACnBwJ,EAAML,EAAOO,EAAGzJ,EAAG,GACnBwJ,EAAML,EAAOM,EAAGxJ,EAAG,GACboJ,EAAK5Y,EAAG,GAAI4Y,EAAK,GActB,IAbKA,EAAKT,GACTzX,EAAKkY,EACLA,EAAK,IAELlY,EAAKyX,EACLS,GAAMT,GAEP7C,EAAMhG,EAAG,GAAO5O,EAAG4O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO7O,EAAG6O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO9O,EAAG8O,EAAG,GACtB4I,EAAMS,EAAQD,EAAGtJ,EAAG,GACpB+I,EAAMS,EAAQF,EAAGrJ,EAAG,GACpB+I,EAAMS,EAAQH,EAAGpJ,EAAG,GACdmJ,EAAK3Y,EAAG,GAAI2Y,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPvI,EAAKwI,EAAQO,EAAGrJ,EAAG,GACnBO,EAAKwI,EAAQM,EAAGpJ,EAAG,GACnBuF,EAAKwD,EAAQK,EAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhBkG,EAAK,EAAGA,EAAK/U,EAAI+U,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAK3U,EAAI2U,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAMjX,EAAM8O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CAIL,EC5IA,SAA0BtX,EAAGwR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACArX,EACA0T,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAuC,EACAS,EACAI,EACAZ,EACAS,EACAI,EACAZ,EACAS,EACAI,EACAnZ,EACAuY,EACA7X,EACAC,EACAyY,EACA9J,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EACAiF,EACAC,EACAM,EACAK,EACAK,EACA4C,EACAC,EACAI,EACAK,EACAhZ,GAmCJ,IA7BAL,GADAK,GAAI+P,GAAWlS,EAAE/B,MAAO+B,EAAEzJ,QAASib,EAAEjb,QAAS2V,EAAE3V,UACzCuL,GACPsP,EAAKjP,GAAEiP,GACPC,EAAKlP,GAAEkP,GACPC,EAAKnP,GAAEmP,GAGP2I,EAAQjE,GAAWhW,EAAEf,MAAOuS,EAAEvS,MAAOiN,EAAEjN,OAGvCqb,EAAKta,EAAE9B,OACPqc,EAAK/I,EAAEtT,OACPsc,EAAKtO,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTyT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGTuI,EAAO7Z,EAAEwD,UAAU,GACnBsW,EAAOtI,EAAEhO,UAAU,GACnBuW,EAAO7N,EAAE1I,UAAU,GAGb2X,EAAKrZ,EAAG,GAAIqZ,EAAK,GAWtB,IAVKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPc,EAAMT,EAAOa,EAAG/J,EAAG,GACnB4J,EAAMT,EAAOY,EAAG9J,EAAG,GACnB4J,EAAMT,EAAOW,EAAG7J,EAAG,GACbwJ,EAAKhZ,EAAG,GAAIgZ,EAAK,GActB,IAbKA,EAAKb,GACTxX,EAAKqY,EACLA,EAAK,IAELrY,EAAKwX,EACLa,GAAMb,GAEPxC,EAAMrG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsG,EAAMrG,EAAG,GAAO5O,EAAG4O,EAAG,GACtBsG,EAAMrG,EAAG,GAAO7O,EAAG6O,EAAG,GACtBqJ,EAAMI,EAAQD,EAAG1J,EAAG,GACpBwJ,EAAMI,EAAQF,EAAGzJ,EAAG,GACpBwJ,EAAMI,EAAQH,EAAGxJ,EAAG,GACdoJ,EAAK5Y,EAAG,GAAI4Y,EAAK,GActB,IAbKA,EAAKT,GACTzX,EAAKkY,EACLA,EAAK,IAELlY,EAAKyX,EACLS,GAAMT,GAEP7C,EAAMhG,EAAG,GAAO5O,EAAG4O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO7O,EAAG6O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO9O,EAAG8O,EAAG,GACtB4I,EAAMS,EAAQD,EAAGtJ,EAAG,GACpB+I,EAAMS,EAAQF,EAAGrJ,EAAG,GACpB+I,EAAMS,EAAQH,EAAGpJ,EAAG,GACdmJ,EAAK3Y,EAAG,GAAI2Y,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPvI,EAAKwI,EAAQO,EAAGrJ,EAAG,GACnBO,EAAKwI,EAAQM,EAAGpJ,EAAG,GACnBuF,EAAKwD,EAAQK,EAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhBuG,EAAK,EAAGA,EAAKqD,EAAIrD,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAK/U,EAAI+U,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAK3U,EAAI2U,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAMjX,EAAM8O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CAKN,ECzKA,SAA0B3X,EAAGwR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACArX,EACA0T,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACAkC,EACAS,EACAI,EACAK,EACAjB,EACAS,EACAI,EACAK,EACAjB,EACAS,EACAI,EACAK,EACAxZ,EACAuY,EACA7X,EACAC,EACAyY,EACAK,EACAnK,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EACAiF,EACAC,EACAM,GACAK,GACAK,GACAK,GACAuC,GACAC,GACAI,GACAK,GACAK,GACArZ,GAmCJ,IA7BAL,GADAK,GAAI+P,GAAWlS,EAAE/B,MAAO+B,EAAEzJ,QAASib,EAAEjb,QAAS2V,EAAE3V,UACzCuL,GACPsP,EAAKjP,GAAEiP,GACPC,EAAKlP,GAAEkP,GACPC,EAAKnP,GAAEmP,GAGP2I,EAAQjE,GAAWhW,EAAEf,MAAOuS,EAAEvS,MAAOiN,EAAEjN,OAGvCqb,EAAKta,EAAE9B,OACPqc,EAAK/I,EAAEtT,OACPsc,EAAKtO,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTyT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGTuI,EAAO7Z,EAAEwD,UAAU,GACnBsW,EAAOtI,EAAEhO,UAAU,GACnBuW,EAAO7N,EAAE1I,UAAU,GAGbgY,GAAK1Z,EAAG,GAAI0Z,GAAK,GAWtB,IAVKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEPmB,EAAMd,EAAOkB,GAAGpK,EAAG,GACnBiK,EAAMd,EAAOiB,GAAGnK,EAAG,GACnBiK,EAAMd,EAAOgB,GAAGlK,EAAG,GACb6J,GAAKrZ,EAAG,GAAIqZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,EAAG,GAAO8J,EAAG9J,EAAG,GACtB2G,EAAM1G,EAAG,GAAO6J,EAAG7J,EAAG,GACtB2G,EAAM1G,EAAG,GAAO4J,EAAG5J,EAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,EAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,EAAG,GACpB4J,EAAMK,EAAQH,GAAG7J,EAAG,GACdwJ,GAAKhZ,EAAG,GAAIgZ,GAAK,GActB,IAbKA,GAAKb,GACTxX,EAAKqY,GACLA,GAAK,IAELrY,EAAKwX,EACLa,IAAMb,GAEPxC,EAAMrG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsG,EAAMrG,EAAG,GAAO5O,EAAG4O,EAAG,GACtBsG,EAAMrG,EAAG,GAAO7O,EAAG6O,EAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,EAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,EAAG,GACpBwJ,EAAMI,EAAQH,GAAGxJ,EAAG,GACdoJ,GAAK5Y,EAAG,GAAI4Y,GAAK,GActB,IAbKA,GAAKT,GACTzX,EAAKkY,GACLA,GAAK,IAELlY,EAAKyX,EACLS,IAAMT,GAEP7C,EAAMhG,EAAG,GAAO5O,EAAG4O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO7O,EAAG6O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO9O,EAAG8O,EAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,EAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,EAAG,GACpB+I,EAAMS,EAAQH,GAAGpJ,EAAG,GACdmJ,GAAK3Y,EAAG,GAAI2Y,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPvI,EAAKwI,EAAQO,GAAGrJ,EAAG,GACnBO,EAAKwI,EAAQM,GAAGpJ,EAAG,GACnBuF,EAAKwD,EAAQK,GAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhB4G,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK/U,EAAI+U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK3U,EAAI2U,KAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBkD,EAAMxD,EAAMK,EAAItI,EAAKuL,EAAMjX,EAAM8O,GAAMoI,EAAMxD,EAAM3E,KACnDD,GAAM8E,EACN7E,GAAM8E,EACNG,GAAMF,EAEPhF,GAAMqF,EACNpF,GAAMqF,EACNJ,GAAMK,CACN,CACDvF,GAAM0F,EACNzF,GAAM0F,EACNT,GAAMU,CACN,CACD5F,GAAM+F,EACN9F,GAAM+F,EACNd,GAAMe,CACN,CACDjG,GAAMoG,EACNnG,GAAMoG,EACNnB,GAAMoB,CACN,CAMP,ECtMA,SAA0BhY,EAAGwR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACArX,EACA0T,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACA6B,EACAS,EACAI,EACAK,EACAK,EACAtB,EACAS,EACAI,EACAK,EACAK,EACAtB,EACAS,EACAI,EACAK,EACAK,EACA7Z,EACAuY,EACA7X,EACAC,EACAyY,EACAK,EACAK,EACAxK,EACAC,EACAC,EACAgJ,GACAC,GACAC,GACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAkC,GACAC,GACAI,GACAK,GACAK,GACAK,GACA1Z,GAmCJ,IA7BAL,GADAK,GAAI+P,GAAWlS,EAAE/B,MAAO+B,EAAEzJ,QAASib,EAAEjb,QAAS2V,EAAE3V,UACzCuL,GACPsP,EAAKjP,GAAEiP,GACPC,EAAKlP,GAAEkP,GACPC,EAAKnP,GAAEmP,GAGP2I,EAAQjE,GAAWhW,EAAEf,MAAOuS,EAAEvS,MAAOiN,EAAEjN,OAGvCqb,GAAKta,EAAE9B,OACPqc,GAAK/I,EAAEtT,OACPsc,GAAKtO,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTyT,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GACTqF,EAAMpF,EAAG,GAGTuI,EAAO7Z,EAAEwD,UAAU,GACnBsW,EAAOtI,EAAEhO,UAAU,GACnBuW,EAAO7N,EAAE1I,UAAU,GAGbqY,GAAK/Z,EAAG,GAAI+Z,GAAK,GAWtB,IAVKA,GAAK5B,GACT2B,EAAKC,GACLA,GAAK,IAELD,EAAK3B,EACL4B,IAAM5B,GAEPwB,EAAMnB,GAAOuB,GAAGzK,EAAG,GACnBsK,EAAMnB,GAAOsB,GAAGxK,EAAG,GACnBsK,EAAMnB,GAAOqB,GAAGvK,EAAG,GACbkK,GAAK1Z,EAAG,GAAI0Z,GAAK,GActB,IAbKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,EAAG,GAAOmK,EAAGnK,EAAG,GACtBgH,EAAM/G,EAAG,GAAOkK,EAAGlK,EAAG,GACtBgH,EAAM/G,EAAG,GAAOiK,EAAGjK,EAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,EAAG,GACpBiK,EAAMK,EAAQF,GAAGnK,EAAG,GACpBiK,EAAMK,EAAQH,GAAGlK,EAAG,GACd6J,GAAKrZ,EAAG,GAAIqZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,EAAG,GAAO8J,EAAG9J,EAAG,GACtB2G,EAAM1G,EAAG,GAAO6J,EAAG7J,EAAG,GACtB2G,EAAM1G,EAAG,GAAO4J,EAAG5J,EAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,EAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,EAAG,GACpB4J,EAAMK,EAAQH,GAAG7J,EAAG,GACdwJ,GAAKhZ,EAAG,GAAIgZ,GAAK,GActB,IAbKA,GAAKb,GACTxX,EAAKqY,GACLA,GAAK,IAELrY,EAAKwX,EACLa,IAAMb,GAEPxC,EAAMrG,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsG,EAAMrG,EAAG,GAAO5O,EAAG4O,EAAG,GACtBsG,EAAMrG,EAAG,GAAO7O,EAAG6O,EAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,EAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,EAAG,GACpBwJ,EAAMI,EAAQH,GAAGxJ,EAAG,GACdoJ,GAAK5Y,EAAG,GAAI4Y,GAAK,GActB,IAbKA,GAAKT,GACTzX,EAAKkY,GACLA,GAAK,IAELlY,EAAKyX,EACLS,IAAMT,GAEP7C,EAAMhG,EAAG,GAAO5O,EAAG4O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO7O,EAAG6O,EAAG,GACtBiG,EAAMhG,EAAG,GAAO9O,EAAG8O,EAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,EAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,EAAG,GACpB+I,EAAMS,EAAQH,GAAGpJ,EAAG,GACdmJ,GAAK3Y,EAAG,GAAI2Y,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,EAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,EAAG,GACnBuF,GAAKwD,EAAQK,GAAGnJ,EAAG,GAGnByF,EAAM3F,EAAG,GAAOiJ,EAAGjJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAOgJ,EAAGhJ,EAAG,GACtB4F,EAAM3F,EAAG,GAAO+I,EAAG/I,EAAG,GAGhBiH,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK/U,EAAI+U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK3U,EAAI2U,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,EAAIxD,KACtBkD,EAAMxD,EAAMK,GAAItI,EAAKuL,EAAMjX,EAAM8O,IAAMoI,EAAMxD,EAAM3E,MACnDD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CAOR,ECnOA,SAA0BrY,EAAGwR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACArX,EACA0T,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAwB,EACAS,EACAI,EACAK,EACAK,EACAK,EACA3B,EACAS,EACAI,EACAK,EACAK,EACAK,EACA3B,EACAS,EACAI,EACAK,EACAK,EACAK,EACAla,EACAuY,EACA7X,EACAC,EACAyY,GACAK,GACAK,GACAK,GACA7K,GACAC,GACAC,GACAgJ,GACAC,GACAC,GACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACA6B,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACA/Z,GAmCJ,IA7BAL,GADAK,GAAI+P,GAAWlS,EAAE/B,MAAO+B,EAAEzJ,QAASib,EAAEjb,QAAS2V,EAAE3V,UACzCuL,GACPsP,GAAKjP,GAAEiP,GACPC,GAAKlP,GAAEkP,GACPC,GAAKnP,GAAEmP,GAGP2I,EAAQjE,GAAWhW,EAAEf,MAAOuS,EAAEvS,MAAOiN,EAAEjN,OAGvCqb,GAAKta,EAAE9B,OACPqc,GAAK/I,EAAEtT,OACPsc,GAAKtO,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTyT,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GAGTuI,EAAO7Z,EAAEwD,UAAU,GACnBsW,EAAOtI,EAAEhO,UAAU,GACnBuW,EAAO7N,EAAE1I,UAAU,GAGb0Y,GAAKpa,EAAG,GAAIoa,GAAK,GAWtB,IAVKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEP6B,EAAMxB,GAAO4B,GAAG9K,GAAG,GACnB2K,EAAMxB,GAAO2B,GAAG7K,GAAG,GACnB2K,EAAMxB,GAAO0B,GAAG5K,GAAG,GACbuK,GAAK/Z,EAAG,GAAI+Z,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpH,GAAG,GAAOwK,GAAGxK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOuK,GAAGvK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOsK,GAAGtK,GAAG,GACtBmK,EAAMK,EAAQD,GAAGzK,GAAG,GACpBsK,EAAMK,EAAQF,GAAGxK,GAAG,GACpBsK,EAAMK,EAAQH,GAAGvK,GAAG,GACdkK,GAAK1Z,EAAG,GAAI0Z,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,GAAG,GAAOmK,GAAGnK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOkK,GAAGlK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOiK,GAAGjK,GAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,GAAG,GACpBiK,EAAMK,EAAQF,GAAGnK,GAAG,GACpBiK,EAAMK,EAAQH,GAAGlK,GAAG,GACd6J,GAAKrZ,EAAG,GAAIqZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,GAAG,GAAO8J,GAAG9J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO6J,GAAG7J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO4J,GAAG5J,GAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,GAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,GAAG,GACpB4J,EAAMK,EAAQH,GAAG7J,GAAG,GACdwJ,GAAKhZ,EAAG,GAAIgZ,GAAK,GActB,IAbKA,GAAKb,GACTxX,EAAKqY,GACLA,GAAK,IAELrY,EAAKwX,EACLa,IAAMb,GAEPxC,EAAMrG,GAAG,GAAO3O,EAAG2O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO5O,EAAG4O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO7O,EAAG6O,GAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,GAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,GAAG,GACpBwJ,EAAMI,EAAQH,GAAGxJ,GAAG,GACdoJ,GAAK5Y,EAAG,GAAI4Y,GAAK,GActB,IAbKA,GAAKT,GACTzX,EAAKkY,GACLA,GAAK,IAELlY,EAAKyX,EACLS,IAAMT,GAEP7C,EAAMhG,GAAG,GAAO5O,EAAG4O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO7O,EAAG6O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO9O,EAAG8O,GAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,GAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,GAAG,GACpB+I,EAAMS,EAAQH,GAAGpJ,GAAG,GACdmJ,GAAK3Y,EAAG,GAAI2Y,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,GAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,GAAG,GACnBuF,GAAKwD,EAAQK,GAAGnJ,GAAG,GAGnByF,EAAM3F,GAAG,GAAOiJ,EAAGjJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAOgJ,EAAGhJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAO+I,EAAG/I,GAAG,GAGhBsH,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK/U,EAAI+U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK3U,EAAI2U,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,EAAIxD,KACtBkD,EAAMxD,EAAMK,GAAItI,EAAKuL,EAAMjX,EAAM8O,IAAMoI,EAAMxD,EAAM3E,MACnDD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CACD3G,IAAM8G,EACN7G,IAAM8G,EACN7B,IAAM8B,CACN,CAQT,EChQA,SAA0B1Y,EAAGwR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACArX,EACA0T,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACApC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACApC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAmB,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAhC,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAhC,EACAS,EACAI,EACAK,EACAK,EACAK,GACAK,GACAva,GACAuY,GACA7X,GACAC,GACAyY,GACAK,GACAK,GACAK,GACAK,GACAlL,GACAC,GACAC,GACAgJ,GACAC,GACAC,GACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAwB,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACApa,GAmCJ,IA7BAL,IADAK,GAAI+P,GAAWlS,EAAE/B,MAAO+B,EAAEzJ,QAASib,EAAEjb,QAAS2V,EAAE3V,UACzCuL,GACPsP,GAAKjP,GAAEiP,GACPC,GAAKlP,GAAEkP,GACPC,GAAKnP,GAAEmP,GAGP2I,EAAQjE,GAAWhW,EAAEf,MAAOuS,EAAEvS,MAAOiN,EAAEjN,OAGvCqb,GAAKta,EAAE9B,OACPqc,GAAK/I,EAAEtT,OACPsc,GAAKtO,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTyT,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GAGTuI,EAAO7Z,EAAEwD,UAAU,GACnBsW,EAAOtI,EAAEhO,UAAU,GACnBuW,EAAO7N,EAAE1I,UAAU,GAGb+Y,GAAKza,GAAG,GAAIya,GAAK,GAWtB,IAVKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPkC,EAAM7B,GAAOiC,GAAGnL,GAAG,GACnBgL,EAAM7B,GAAOgC,GAAGlL,GAAG,GACnBgL,GAAM7B,GAAO+B,GAAGjL,GAAG,GACb4K,GAAKpa,GAAG,GAAIoa,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzH,GAAG,GAAO6K,GAAG7K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO4K,GAAG5K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO2K,GAAG3K,GAAG,GACtBwK,EAAMK,EAAQD,GAAG9K,GAAG,GACpB2K,EAAMK,EAAQF,GAAG7K,GAAG,GACpB2K,GAAMK,GAAQH,GAAG5K,GAAG,GACduK,GAAK/Z,GAAG,GAAI+Z,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpH,GAAG,GAAOwK,GAAGxK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOuK,GAAGvK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOsK,GAAGtK,GAAG,GACtBmK,EAAMK,EAAQD,GAAGzK,GAAG,GACpBsK,EAAMK,EAAQF,GAAGxK,GAAG,GACpBsK,EAAMK,GAAQH,GAAGvK,GAAG,GACdkK,GAAK1Z,GAAG,GAAI0Z,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,GAAG,GAAOmK,GAAGnK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOkK,GAAGlK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOiK,GAAGjK,GAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,GAAG,GACpBiK,EAAMK,EAAQF,GAAGnK,GAAG,GACpBiK,EAAMK,EAAQH,GAAGlK,GAAG,GACd6J,GAAKrZ,GAAG,GAAIqZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,GAAG,GAAO8J,GAAG9J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO6J,GAAG7J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO4J,GAAG5J,GAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,GAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,GAAG,GACpB4J,EAAMK,EAAQH,GAAG7J,GAAG,GACdwJ,GAAKhZ,GAAG,GAAIgZ,GAAK,GActB,IAbKA,GAAKb,GACTxX,GAAKqY,GACLA,GAAK,IAELrY,GAAKwX,EACLa,IAAMb,GAEPxC,EAAMrG,GAAG,GAAO3O,GAAG2O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO5O,GAAG4O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO7O,GAAG6O,GAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,GAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,GAAG,GACpBwJ,EAAMI,EAAQH,GAAGxJ,GAAG,GACdoJ,GAAK5Y,GAAG,GAAI4Y,GAAK,GActB,IAbKA,GAAKT,GACTzX,GAAKkY,GACLA,GAAK,IAELlY,GAAKyX,EACLS,IAAMT,GAEP7C,EAAMhG,GAAG,GAAO5O,GAAG4O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO7O,GAAG6O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO9O,GAAG8O,GAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,GAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,GAAG,GACpB+I,EAAMS,EAAQH,GAAGpJ,GAAG,GACdmJ,GAAK3Y,GAAG,GAAI2Y,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,GAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,GAAG,GACnBuF,GAAKwD,EAAQK,GAAGnJ,GAAG,GAGnByF,EAAM3F,GAAG,GAAOiJ,GAAGjJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAOgJ,GAAGhJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAO+I,GAAG/I,GAAG,GAGhB2H,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK/U,GAAI+U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK3U,GAAI2U,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBkD,EAAMxD,EAAMK,GAAItI,EAAKuL,EAAMjX,EAAM8O,IAAMoI,EAAMxD,EAAM3E,MACnDD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CACD3G,IAAM8G,EACN7G,IAAM8G,EACN7B,IAAM8B,CACN,CACDhH,IAAMmH,EACNlH,IAAMmH,EACNlC,IAAMmC,CACN,CASV,EC7RA,SAA0B/Y,EAAGwR,EAAGtF,EAAGoC,GAClC,IAAI2L,EACArX,EACA0T,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAzC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAzC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAc,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAK,EACArC,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAK,EACArC,GACAS,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACA5a,GACAuY,GACA7X,GACAC,GACAyY,GACAK,GACAK,GACAK,GACAK,GACAK,GACAvL,GACAC,GACAC,GACAgJ,GACAC,GACAC,GACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAmB,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAza,GAmCJ,IA7BAL,IADAK,GAAI+P,GAAWlS,EAAE/B,MAAO+B,EAAEzJ,QAASib,EAAEjb,QAAS2V,EAAE3V,UACzCuL,GACPsP,GAAKjP,GAAEiP,GACPC,GAAKlP,GAAEkP,GACPC,GAAKnP,GAAEmP,GAGP2I,EAAQjE,GAAWhW,EAAEf,MAAOuS,EAAEvS,MAAOiN,EAAEjN,OAGvCqb,GAAKta,EAAE9B,OACPqc,GAAK/I,EAAEtT,OACPsc,GAAKtO,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTyT,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GAGTuI,EAAO7Z,EAAEwD,UAAU,GACnBsW,EAAOtI,EAAEhO,UAAU,GACnBuW,EAAO7N,EAAE1I,UAAU,GAGboZ,GAAK9a,GAAG,GAAI8a,GAAK,GAWtB,IAVKA,GAAK3C,GACT0C,GAAKC,GACLA,GAAK,IAELD,GAAK1C,EACL2C,IAAM3C,GAEPuC,EAAMlC,GAAOsC,GAAGxL,GAAG,GACnBqL,EAAMlC,GAAOqC,GAAGvL,GAAG,GACnBqL,GAAMlC,GAAOoC,GAAGtL,GAAG,GACbiL,GAAKza,GAAG,GAAIya,GAAK,GActB,IAbKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPf,EAAM9H,GAAG,GAAOkL,GAAGlL,GAAG,GACtB+H,EAAM9H,GAAG,GAAOiL,GAAGjL,GAAG,GACtB+H,EAAM9H,GAAG,GAAOgL,GAAGhL,GAAG,GACtB6K,EAAMK,EAAQD,GAAGnL,GAAG,GACpBgL,EAAMK,EAAQF,GAAGlL,GAAG,GACpBgL,GAAMK,GAAQH,GAAGjL,GAAG,GACd4K,GAAKpa,GAAG,GAAIoa,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzH,GAAG,GAAO6K,GAAG7K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO4K,GAAG5K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO2K,GAAG3K,GAAG,GACtBwK,EAAMK,EAAQD,GAAG9K,GAAG,GACpB2K,EAAMK,EAAQF,GAAG7K,GAAG,GACpB2K,GAAMK,GAAQH,GAAG5K,GAAG,GACduK,GAAK/Z,GAAG,GAAI+Z,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpH,GAAG,GAAOwK,GAAGxK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOuK,GAAGvK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOsK,GAAGtK,GAAG,GACtBmK,EAAMK,EAAQD,GAAGzK,GAAG,GACpBsK,EAAMK,EAAQF,GAAGxK,GAAG,GACpBsK,GAAMK,GAAQH,GAAGvK,GAAG,GACdkK,GAAK1Z,GAAG,GAAI0Z,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,GAAG,GAAOmK,GAAGnK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOkK,GAAGlK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOiK,GAAGjK,GAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,GAAG,GACpBiK,EAAMK,EAAQF,GAAGnK,GAAG,GACpBiK,GAAMK,GAAQH,GAAGlK,GAAG,GACd6J,GAAKrZ,GAAG,GAAIqZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,GAAG,GAAO8J,GAAG9J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO6J,GAAG7J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO4J,GAAG5J,GAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,GAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,GAAG,GACpB4J,GAAMK,GAAQH,GAAG7J,GAAG,GACdwJ,GAAKhZ,GAAG,GAAIgZ,GAAK,GActB,IAbKA,GAAKb,GACTxX,GAAKqY,GACLA,GAAK,IAELrY,GAAKwX,EACLa,IAAMb,GAEPxC,EAAMrG,GAAG,GAAO3O,GAAG2O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO5O,GAAG4O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO7O,GAAG6O,GAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,GAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,GAAG,GACpBwJ,GAAMI,GAAQH,GAAGxJ,GAAG,GACdoJ,GAAK5Y,GAAG,GAAI4Y,GAAK,GActB,IAbKA,GAAKT,GACTzX,GAAKkY,GACLA,GAAK,IAELlY,GAAKyX,EACLS,IAAMT,GAEP7C,EAAMhG,GAAG,GAAO5O,GAAG4O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO7O,GAAG6O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO9O,GAAG8O,GAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,GAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,GAAG,GACpB+I,GAAMS,GAAQH,GAAGpJ,GAAG,GACdmJ,GAAK3Y,GAAG,GAAI2Y,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,GAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,GAAG,GACnBuF,GAAKwD,GAAQK,GAAGnJ,GAAG,GAGnByF,EAAM3F,GAAG,GAAOiJ,GAAGjJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAOgJ,GAAGhJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAO+I,GAAG/I,GAAG,GAGhBgI,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK/U,GAAI+U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK3U,GAAI2U,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBkD,EAAMxD,EAAMK,GAAItI,EAAKuL,EAAMjX,EAAM8O,IAAMoI,EAAMxD,EAAM3E,MACnDD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CACD3G,IAAM8G,EACN7G,IAAM8G,EACN7B,IAAM8B,CACN,CACDhH,IAAMmH,EACNlH,IAAMmH,EACNlC,IAAMmC,CACN,CACDrH,IAAMwH,EACNvH,IAAMwH,EACNvC,IAAMwC,CACN,CAUX,EC1TA,SAA2BpZ,EAAGwR,EAAGtF,EAAGoC,GACnC,IAAI2L,EACArX,EACA0T,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA9C,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA9C,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAS,EACAS,EACAI,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA1C,EACAS,EACAI,EACAK,EACAK,GACAK,GACAK,GACAK,GACAK,GACA1C,GACAS,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAjb,GACAuY,GACA7X,GACAC,GACAyY,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACA5L,GACAC,GACAC,GACAgJ,GACAC,GACAC,GACA9I,GACAC,GACAiF,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAc,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACA9a,GAmCJ,IA7BAL,IADAK,GAAI+P,GAAWlS,EAAE/B,MAAO+B,EAAEzJ,QAASib,EAAEjb,QAAS2V,EAAE3V,UACzCuL,GACPsP,GAAKjP,GAAEiP,GACPC,GAAKlP,GAAEkP,GACPC,GAAKnP,GAAEmP,GAGP2I,EAAQjE,GAAWhW,EAAEf,MAAOuS,EAAEvS,MAAOiN,EAAEjN,OAGvCqb,GAAKta,EAAE9B,OACPqc,GAAK/I,EAAEtT,OACPsc,GAAKtO,EAAEhO,OAGP0E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTyT,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GACTqF,EAAMpF,GAAG,GAGTuI,EAAO7Z,EAAEwD,UAAU,GACnBsW,EAAOtI,EAAEhO,UAAU,GACnBuW,EAAO7N,EAAE1I,UAAU,GAGbyZ,GAAKnb,GAAG,GAAImb,GAAK,GAWtB,IAVKA,GAAKhD,GACT+C,GAAKC,GACLA,GAAK,IAELD,GAAK/C,EACLgD,IAAMhD,GAEP4C,EAAMvC,GAAO2C,GAAG7L,GAAG,GACnB0L,GAAMvC,GAAO0C,GAAG5L,GAAG,GACnB0L,GAAMvC,GAAOyC,GAAG3L,GAAG,GACbsL,GAAK9a,GAAG,GAAI8a,GAAK,GActB,IAbKA,GAAK3C,GACT0C,GAAKC,GACLA,GAAK,IAELD,GAAK1C,EACL2C,IAAM3C,GAEPV,EAAMnI,GAAG,GAAOuL,GAAGvL,GAAG,GACtBoI,EAAMnI,GAAG,GAAOsL,GAAGtL,GAAG,GACtBoI,EAAMnI,GAAG,GAAOqL,GAAGrL,GAAG,GACtBkL,EAAMK,EAAQD,GAAGxL,GAAG,GACpBqL,GAAMK,GAAQF,GAAGvL,GAAG,GACpBqL,GAAMK,GAAQH,GAAGtL,GAAG,GACdiL,GAAKza,GAAG,GAAIya,GAAK,GActB,IAbKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPf,EAAM9H,GAAG,GAAOkL,GAAGlL,GAAG,GACtB+H,EAAM9H,GAAG,GAAOiL,GAAGjL,GAAG,GACtB+H,EAAM9H,GAAG,GAAOgL,GAAGhL,GAAG,GACtB6K,EAAMK,EAAQD,GAAGnL,GAAG,GACpBgL,GAAMK,GAAQF,GAAGlL,GAAG,GACpBgL,GAAMK,GAAQH,GAAGjL,GAAG,GACd4K,GAAKpa,GAAG,GAAIoa,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzH,GAAG,GAAO6K,GAAG7K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO4K,GAAG5K,GAAG,GACtB0H,EAAMzH,GAAG,GAAO2K,GAAG3K,GAAG,GACtBwK,EAAMK,EAAQD,GAAG9K,GAAG,GACpB2K,GAAMK,GAAQF,GAAG7K,GAAG,GACpB2K,GAAMK,GAAQH,GAAG5K,GAAG,GACduK,GAAK/Z,GAAG,GAAI+Z,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpH,GAAG,GAAOwK,GAAGxK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOuK,GAAGvK,GAAG,GACtBqH,EAAMpH,GAAG,GAAOsK,GAAGtK,GAAG,GACtBmK,EAAMK,EAAQD,GAAGzK,GAAG,GACpBsK,GAAMK,GAAQF,GAAGxK,GAAG,GACpBsK,GAAMK,GAAQH,GAAGvK,GAAG,GACdkK,GAAK1Z,GAAG,GAAI0Z,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/G,GAAG,GAAOmK,GAAGnK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOkK,GAAGlK,GAAG,GACtBgH,EAAM/G,GAAG,GAAOiK,GAAGjK,GAAG,GACtB8J,EAAMK,EAAQD,GAAGpK,GAAG,GACpBiK,EAAMK,GAAQF,GAAGnK,GAAG,GACpBiK,GAAMK,GAAQH,GAAGlK,GAAG,GACd6J,GAAKrZ,GAAG,GAAIqZ,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1G,GAAG,GAAO8J,GAAG9J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO6J,GAAG7J,GAAG,GACtB2G,EAAM1G,GAAG,GAAO4J,GAAG5J,GAAG,GACtByJ,EAAMK,EAAQD,GAAG/J,GAAG,GACpB4J,EAAMK,EAAQF,GAAG9J,GAAG,GACpB4J,GAAMK,GAAQH,GAAG7J,GAAG,GACdwJ,GAAKhZ,GAAG,GAAIgZ,GAAK,GActB,IAbKA,GAAKb,GACTxX,GAAKqY,GACLA,GAAK,IAELrY,GAAKwX,EACLa,IAAMb,GAEPxC,EAAMrG,GAAG,GAAO3O,GAAG2O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO5O,GAAG4O,GAAG,GACtBsG,EAAMrG,GAAG,GAAO7O,GAAG6O,GAAG,GACtBqJ,EAAMI,EAAQD,GAAG1J,GAAG,GACpBwJ,EAAMI,EAAQF,GAAGzJ,GAAG,GACpBwJ,GAAMI,GAAQH,GAAGxJ,GAAG,GACdoJ,GAAK5Y,GAAG,GAAI4Y,GAAK,GActB,IAbKA,GAAKT,GACTzX,GAAKkY,GACLA,GAAK,IAELlY,GAAKyX,EACLS,IAAMT,GAEP7C,EAAMhG,GAAG,GAAO5O,GAAG4O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO7O,GAAG6O,GAAG,GACtBiG,EAAMhG,GAAG,GAAO9O,GAAG8O,GAAG,GACtB4I,EAAMS,EAAQD,GAAGtJ,GAAG,GACpB+I,EAAMS,EAAQF,GAAGrJ,GAAG,GACpB+I,GAAMS,GAAQH,GAAGpJ,GAAG,GACdmJ,GAAK3Y,GAAG,GAAI2Y,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPvI,GAAKwI,EAAQO,GAAGrJ,GAAG,GACnBO,GAAKwI,EAAQM,GAAGpJ,GAAG,GACnBuF,GAAKwD,GAAQK,GAAGnJ,GAAG,GAGnByF,EAAM3F,GAAG,GAAOiJ,GAAGjJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAOgJ,GAAGhJ,GAAG,GACtB4F,EAAM3F,GAAG,GAAO+I,GAAG/I,GAAG,GAGhBqI,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,GAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK/U,GAAI+U,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK3U,GAAI2U,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBkD,EAAMxD,EAAMK,GAAItI,EAAKuL,EAAMjX,EAAM8O,IAAMoI,EAAMxD,EAAM3E,MACnDD,IAAM8E,EACN7E,IAAM8E,EACNG,IAAMF,EAEPhF,IAAMqF,EACNpF,IAAMqF,EACNJ,IAAMK,CACN,CACDvF,IAAM0F,EACNzF,IAAM0F,EACNT,IAAMU,CACN,CACD5F,IAAM+F,EACN9F,IAAM+F,EACNd,IAAMe,CACN,CACDjG,IAAMoG,EACNnG,IAAMoG,EACNnB,IAAMoB,CACN,CACDtG,IAAMyG,EACNxG,IAAMyG,EACNxB,IAAMyB,CACN,CACD3G,IAAM8G,EACN7G,IAAM8G,EACN7B,IAAM8B,CACN,CACDhH,IAAMmH,EACNlH,IAAMmH,EACNlC,IAAMmC,CACN,CACDrH,IAAMwH,EACNvH,IAAMwH,EACNvC,IAAMwC,CACN,CACD1H,IAAM6H,EACN5H,IAAM6H,EACN5C,IAAM6C,CACN,CAWZ,GxCvVI0D,GAAW9G,GAAO3f,OAAS,EAc/B,SAAS0mB,GAAcpd,EAAGwR,EAAGtF,GAC5B,OAAOuE,GAAc,CAAEzQ,EAAGwR,EAAGtF,GAAK,oBAAoB,EACvD,QA+DA,SAAiBmR,EAAQ/O,GACxB,IAAInQ,EACAmf,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACA7d,EACA4B,EACAuP,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACAuD,EACA/d,EACAwR,EACAtF,EACA8R,EACAvnB,EAYJ,GATAuJ,EAAIie,GAAgBZ,EAAQ,IAC5B7L,EAAIyM,GAAgBZ,EAAQ,IAC5BnR,EAAI+R,GAAgBZ,EAAQ,IAG5BI,EAAMzd,EAAE/B,MACRyf,EAAMlM,EAAEvT,MACR0f,EAAMzR,EAAEjO,OACRE,EAAQsf,EAAI/mB,UACGgnB,EAAIhnB,QAAUyH,IAAUwf,EAAIjnB,OAC1C,MAAM,IAAI8B,MAAOwD,GAAQ,uIAAwImC,EAAOuf,EAAIhnB,OAAQinB,EAAIjnB,SAGzL,GAAe,IAAVyH,EACJ,OAAKif,GAAcpd,EAAGwR,EAAGtF,GACjB0N,GAAiBzb,GAAS6B,EAAGwR,EAAGtF,EAAGoC,GAEpC+H,GAAQlY,GAAS6B,EAAGwR,EAAGtF,EAAGoC,GAKlC,IAFArO,EAAM,EACN8d,EAAK,EACCtnB,EAAI,EAAGA,EAAI0H,EAAO1H,IAAM,CAE7B,IADAunB,EAAIP,EAAKhnB,MACEinB,EAAKjnB,IAAOunB,IAAML,EAAKlnB,GACjC,MAAM,IAAI+B,MAAOwD,GAAO,WAGzBiE,GAAO+d,EAGI,IAANA,IACJD,GAAM,EAEP,CAED,GAAa,IAAR9d,EAAL,CAIA,GAAe,IAAV9B,EACJ,OAAKif,GAAcpd,EAAGwR,EAAGtF,GACjB0N,GAAiBzb,GAAS6B,EAAGwR,EAAGtF,EAAGoC,GAEpC+H,GAAQlY,GAAS6B,EAAGwR,EAAGtF,EAAGoC,GAOlC,GALA8C,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QAGFwnB,IAAO5f,EAAM,EAAI,CAErB,IAAM1H,EAAI,EAAGA,EAAI0H,GACE,IAAbsf,EAAKhnB,GADaA,KAWxB,OANAuJ,EAAE/B,MAAQ,CAAEwf,EAAIhnB,IAChB+a,EAAEvT,MAAQ+B,EAAE/B,MACZiO,EAAEjO,MAAQ+B,EAAE/B,MACZ+B,EAAEzJ,QAAU,CAAE6a,EAAG3a,IACjB+a,EAAEjb,QAAU,CAAE8a,EAAG5a,IACjByV,EAAE3V,QAAU,CAAE+a,EAAG7a,IACZ2mB,GAAcpd,EAAGwR,EAAGtF,GACjB0N,GAAiB,GAAK5Z,EAAGwR,EAAGtF,EAAGoC,GAEhC+H,GAAQ,GAAKrW,EAAGwR,EAAGtF,EAAGoC,EAC7B,CAOD,GANAsP,EAAMtnB,EAAgB8a,GACtByM,EAAMvnB,EAAgB+a,GACtByM,EAAMxnB,EAAgBgb,GAGtBzP,EAAMQ,GAAe+O,GACR,IAARwM,GAAqB,IAARC,GAAqB,IAARC,GAAajc,IAAQQ,GAAegP,IAAQxP,IAAQQ,GAAeiP,GAAO,CAOxG,GALAgM,EAAOtf,EAAuByf,EAAKrM,EAAIpR,EAAE9B,QACzCqf,EAAOvf,EAAuB0f,EAAKrM,EAAIG,EAAEtT,QACzCsf,EAAOxf,EAAuB2f,EAAKrM,EAAIpF,EAAEhO,QAIxC+B,IAAUqd,EAAK,GAAGA,EAAK,GAAG,GAC1Brd,IAAUsd,EAAK,GAAGA,EAAK,GAAG,GAC1Btd,IAAUud,EAAK,GAAGA,EAAK,GAAG,EA2B1B,OAvBClD,EADY,IAARsD,EACCN,EAAM,GAENA,EAAM,GAGX/C,EADY,IAARsD,EACCN,EAAM,GAENA,EAAM,GAGX/C,EADY,IAARsD,EACCN,EAAM,GAENA,EAAM,GAEZxd,EAAE/B,MAAQ,CAAEgC,GACZuR,EAAEvT,MAAQ+B,EAAE/B,MACZiO,EAAEjO,MAAQ+B,EAAE/B,MACZ+B,EAAEzJ,QAAU,CAAEqnB,GACdpM,EAAEjb,QAAU,CAAEsnB,GACd3R,EAAE3V,QAAU,CAAEunB,GACd9d,EAAE9B,OAASoc,EACX9I,EAAEtT,OAASqc,EACXrO,EAAEhO,OAASsc,EACN4C,GAAcpd,EAAGwR,EAAGtF,GACjB0N,GAAiB,GAAK5Z,EAAGwR,EAAGtF,EAAGoC,GAEhC+H,GAAQ,GAAKrW,EAAGwR,EAAGtF,EAAGoC,GAK9B,GAAKnQ,GAASgf,GAEb,OAAKC,GAAcpd,EAAGwR,EAAGtF,GACjB0N,GAAiBzb,GAAS6B,EAAGwR,EAAGtF,EAAW,IAARrK,EAAWyM,GAE/C+H,GAAQlY,GAAS6B,EAAGwR,EAAGtF,EAAW,IAARrK,EAAWyM,EAG7C,CAID,OAAKnQ,GAASgf,GACRC,GAAcpd,EAAGwR,EAAGtF,GACjBgR,GAAyB/e,EAAM,GAAK6B,EAAGwR,EAAGtF,EAAGoC,GAE9C0L,GAAgB7b,EAAM,GAAK6B,EAAGwR,EAAGtF,EAAGoC,GAGvC8O,GAAcpd,EAAGwR,EAAGtF,GFjP1B,SAAmBlM,EAAGwR,EAAGtF,EAAGoC,GAC3B,IAAI1L,EACA0T,EACAC,EACA2H,EACAC,EACAC,EACAvE,EACAC,EACAC,EACA9Z,EACA6B,EACAsP,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EAEAlb,EAiCJ,IA5BAwJ,EAAMH,EAHNgC,EAAK9B,EAAE/B,OAMP2E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTqO,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QAGP+jB,EAAKta,EAAE9B,OACPqc,EAAK/I,EAAEtT,OACPsc,EAAKtO,EAAEhO,OAGPggB,EAAOle,EAAEwB,MACT2c,EAAO3M,EAAEhQ,MACT4c,EAAOlS,EAAE1K,MAGTqY,EAAO7Z,EAAEwD,UAAW,GACpBsW,EAAOtI,EAAEhO,UAAW,GACpBuW,EAAO7N,EAAE1I,UAAW,GAGd/M,EAAI,EAAGA,EAAIwJ,EAAKxJ,IACrBib,EAAKuE,GAAWnU,EAAIsP,EAAIkJ,EAAI4D,EAAMznB,EAAG2f,IACrCzE,EAAKsE,GAAWnU,EAAIuP,EAAIkJ,EAAI4D,EAAM1nB,EAAG2f,IAErC2D,EAAMxD,EADDN,GAAWnU,EAAIwP,EAAIkJ,EAAI4D,EAAM3nB,EAAG2f,IACrB9H,EAAKuL,EAAMjX,EAAM8O,GAAMoI,EAAMxD,EAAM3E,IAErD,CEsLS0M,CAAkBre,EAAGwR,EAAGtF,EAAGoC,QD1PpC,SAAmBtO,EAAGwR,EAAGtF,EAAGoC,GAC3B,IAAI1L,EACA0T,EACAC,EACA2H,EACAC,EACAC,EACAne,EACA6B,EACAsP,EACAC,EACAC,EACAgJ,EACAC,EACAC,EACA9I,EACAC,EAEAlb,EA4BJ,IAvBAwJ,EAAMH,EAHNgC,EAAK9B,EAAE/B,OAMP2E,EAAO5C,EAAE+C,KACTuT,EAAO9E,EAAEzO,KACTwT,EAAOrK,EAAEnJ,KAGTqO,EAAKpR,EAAEzJ,QACP8a,EAAKG,EAAEjb,QACP+a,EAAKpF,EAAE3V,QAGP+jB,EAAKta,EAAE9B,OACPqc,EAAK/I,EAAEtT,OACPsc,EAAKtO,EAAEhO,OAGPggB,EAAOle,EAAEwB,MACT2c,EAAO3M,EAAEhQ,MACT4c,EAAOlS,EAAE1K,MAGH/K,EAAI,EAAGA,EAAIwJ,EAAKxJ,IACrBib,EAAKuE,GAAWnU,EAAIsP,EAAIkJ,EAAI4D,EAAMznB,EAAG2f,IACrCzE,EAAKsE,GAAWnU,EAAIuP,EAAIkJ,EAAI4D,EAAM1nB,EAAG2f,IAErCG,EADKN,GAAWnU,EAAIwP,EAAIkJ,EAAI4D,EAAM3nB,EAAG2f,KACxB9H,EAAK1L,EAAM8O,GAAM4E,EAAM3E,GAEtC,CCwMC2M,CAAUte,EAAGwR,EAAGtF,EAAGoC,EAxGlB,CAyGF","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266,267,268,269,270,271,272]} \ No newline at end of file diff --git a/lib/0d.js b/lib/0d.js deleted file mode 100644 index dc83755..0000000 --- a/lib/0d.js +++ /dev/null @@ -1,115 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in zero-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0 ] ); -* var ybuf = new Float64Array( [ 2.0 ] ); -* var zbuf = new Float64Array( [ 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = []; -* -* // Define the array strides: -* var sx = [ 0 ]; -* var sy = [ 0 ]; -* var sz = [ 0 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* binary0d( x, y, z, fcn ); -* -* console.log( z.data ); -* // => [ 3.0 ] -*/ -function binary0d( x, y, z, fcn ) { - z.data[ z.offset ] = fcn( x.data[ x.offset ], y.data[ y.offset ] ); -} - - -// EXPORTS // - -module.exports = binary0d; diff --git a/lib/0d_accessors.js b/lib/0d_accessors.js deleted file mode 100644 index 4aecf7a..0000000 --- a/lib/0d_accessors.js +++ /dev/null @@ -1,122 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in zero-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0 ] ); -* var ybuf = toAccessorArray( [ 2.0 ] ); -* var zbuf = toAccessorArray( [ 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = []; -* -* // Define the array strides: -* var sx = [ 0 ]; -* var sy = [ 0 ]; -* var sz = [ 0 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* binary0d( x, y, z, fcn ); -* -* var v = z.data.get( 0 ); -* // returns 3.0 -*/ -function binary0d( x, y, z, fcn ) { - z.accessors[ 1 ]( z.data, z.offset, fcn( x.accessors[ 0 ]( x.data, x.offset ), y.accessors[ 0 ]( y.data, y.offset ) ) ); // eslint-disable-line max-len -} - - -// EXPORTS // - -module.exports = binary0d; diff --git a/lib/10d.js b/lib/10d.js deleted file mode 100644 index eaf8829..0000000 --- a/lib/10d.js +++ /dev/null @@ -1,332 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-statements, max-len, max-lines-per-function */ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in ten-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* binary10d( x, y, z, true, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary10d( x, y, z, isRowMajor, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dx6; - var dx7; - var dx8; - var dx9; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dy6; - var dy7; - var dy8; - var dy9; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var dz6; - var dz7; - var dz8; - var dz9; - var sh; - var S0; - var S1; - var S2; - var S3; - var S4; - var S5; - var S6; - var S7; - var S8; - var S9; - var sx; - var sy; - var sz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - var i6; - var i7; - var i8; - var i9; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments... - sh = x.shape; - sx = x.strides; - sy = y.strides; - sz = z.strides; - if ( isRowMajor ) { - // For row-major ndarrays, the last dimensions have the fastest changing indices... - S0 = sh[ 9 ]; - S1 = sh[ 8 ]; - S2 = sh[ 7 ]; - S3 = sh[ 6 ]; - S4 = sh[ 5 ]; - S5 = sh[ 4 ]; - S6 = sh[ 3 ]; - S7 = sh[ 2 ]; - S8 = sh[ 1 ]; - S9 = sh[ 0 ]; - dx0 = sx[ 9 ]; // offset increment for innermost loop - dx1 = sx[ 8 ] - ( S0*sx[9] ); - dx2 = sx[ 7 ] - ( S1*sx[8] ); - dx3 = sx[ 6 ] - ( S2*sx[7] ); - dx4 = sx[ 5 ] - ( S3*sx[6] ); - dx5 = sx[ 4 ] - ( S4*sx[5] ); - dx6 = sx[ 3 ] - ( S5*sx[4] ); - dx7 = sx[ 2 ] - ( S6*sx[3] ); - dx8 = sx[ 1 ] - ( S7*sx[2] ); - dx9 = sx[ 0 ] - ( S8*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 9 ]; - dy1 = sy[ 8 ] - ( S0*sy[9] ); - dy2 = sy[ 7 ] - ( S1*sy[8] ); - dy3 = sy[ 6 ] - ( S2*sy[7] ); - dy4 = sy[ 5 ] - ( S3*sy[6] ); - dy5 = sy[ 4 ] - ( S4*sy[5] ); - dy6 = sy[ 3 ] - ( S5*sy[4] ); - dy7 = sy[ 2 ] - ( S6*sy[3] ); - dy8 = sy[ 1 ] - ( S7*sy[2] ); - dy9 = sy[ 0 ] - ( S8*sy[1] ); - dz0 = sz[ 9 ]; - dz1 = sz[ 8 ] - ( S0*sz[9] ); - dz2 = sz[ 7 ] - ( S1*sz[8] ); - dz3 = sz[ 6 ] - ( S2*sz[7] ); - dz4 = sz[ 5 ] - ( S3*sz[6] ); - dz5 = sz[ 4 ] - ( S4*sz[5] ); - dz6 = sz[ 3 ] - ( S5*sz[4] ); - dz7 = sz[ 2 ] - ( S6*sz[3] ); - dz8 = sz[ 1 ] - ( S7*sz[2] ); - dz9 = sz[ 0 ] - ( S8*sz[1] ); - } else { // order === 'column-major' - // For column-major ndarrays, the first dimensions have the fastest changing indices... - S0 = sh[ 0 ]; - S1 = sh[ 1 ]; - S2 = sh[ 2 ]; - S3 = sh[ 3 ]; - S4 = sh[ 4 ]; - S5 = sh[ 5 ]; - S6 = sh[ 6 ]; - S7 = sh[ 7 ]; - S8 = sh[ 8 ]; - S9 = sh[ 9 ]; - dx0 = sx[ 0 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[0] ); - dx2 = sx[ 2 ] - ( S1*sx[1] ); - dx3 = sx[ 3 ] - ( S2*sx[2] ); - dx4 = sx[ 4 ] - ( S3*sx[3] ); - dx5 = sx[ 5 ] - ( S4*sx[4] ); - dx6 = sx[ 6 ] - ( S5*sx[5] ); - dx7 = sx[ 7 ] - ( S6*sx[6] ); - dx8 = sx[ 8 ] - ( S7*sx[7] ); - dx9 = sx[ 9 ] - ( S8*sx[8] ); // offset increment for outermost loop - dy0 = sy[ 0 ]; - dy1 = sy[ 1 ] - ( S0*sy[0] ); - dy2 = sy[ 2 ] - ( S1*sy[1] ); - dy3 = sy[ 3 ] - ( S2*sy[2] ); - dy4 = sy[ 4 ] - ( S3*sy[3] ); - dy5 = sy[ 5 ] - ( S4*sy[4] ); - dy6 = sy[ 6 ] - ( S5*sy[5] ); - dy7 = sy[ 7 ] - ( S6*sy[6] ); - dy8 = sy[ 8 ] - ( S7*sy[7] ); - dy9 = sy[ 9 ] - ( S8*sy[8] ); - dz0 = sz[ 0 ]; - dz1 = sz[ 1 ] - ( S0*sz[0] ); - dz2 = sz[ 2 ] - ( S1*sz[1] ); - dz3 = sz[ 3 ] - ( S2*sz[2] ); - dz4 = sz[ 4 ] - ( S3*sz[3] ); - dz5 = sz[ 5 ] - ( S4*sz[4] ); - dz6 = sz[ 6 ] - ( S5*sz[5] ); - dz7 = sz[ 7 ] - ( S6*sz[6] ); - dz8 = sz[ 8 ] - ( S7*sz[7] ); - dz9 = sz[ 9 ] - ( S8*sz[8] ); - } - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Iterate over the ndarray dimensions... - for ( i9 = 0; i9 < S9; i9++ ) { - for ( i8 = 0; i8 < S8; i8++ ) { - for ( i7 = 0; i7 < S7; i7++ ) { - for ( i6 = 0; i6 < S6; i6++ ) { - for ( i5 = 0; i5 < S5; i5++ ) { - for ( i4 = 0; i4 < S4; i4++ ) { - for ( i3 = 0; i3 < S3; i3++ ) { - for ( i2 = 0; i2 < S2; i2++ ) { - for ( i1 = 0; i1 < S1; i1++ ) { - for ( i0 = 0; i0 < S0; i0++ ) { - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } - ix += dx6; - iy += dy6; - iz += dz6; - } - ix += dx7; - iy += dy7; - iz += dz7; - } - ix += dx8; - iy += dy8; - iz += dz8; - } - ix += dx9; - iy += dy9; - iz += dz9; - } -} - - -// EXPORTS // - -module.exports = binary10d; diff --git a/lib/10d_accessors.js b/lib/10d_accessors.js deleted file mode 100644 index 3c34c42..0000000 --- a/lib/10d_accessors.js +++ /dev/null @@ -1,348 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in ten-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* binary10d( x, y, z, true, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary10d( x, y, z, isRowMajor, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var xget; - var yget; - var zset; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dx6; - var dx7; - var dx8; - var dx9; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dy6; - var dy7; - var dy8; - var dy9; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var dz6; - var dz7; - var dz8; - var dz9; - var sh; - var S0; - var S1; - var S2; - var S3; - var S4; - var S5; - var S6; - var S7; - var S8; - var S9; - var sx; - var sy; - var sz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - var i6; - var i7; - var i8; - var i9; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments... - sh = x.shape; - sx = x.strides; - sy = y.strides; - sz = z.strides; - if ( isRowMajor ) { - // For row-major ndarrays, the last dimensions have the fastest changing indices... - S0 = sh[ 9 ]; - S1 = sh[ 8 ]; - S2 = sh[ 7 ]; - S3 = sh[ 6 ]; - S4 = sh[ 5 ]; - S5 = sh[ 4 ]; - S6 = sh[ 3 ]; - S7 = sh[ 2 ]; - S8 = sh[ 1 ]; - S9 = sh[ 0 ]; - dx0 = sx[ 9 ]; // offset increment for innermost loop - dx1 = sx[ 8 ] - ( S0*sx[9] ); - dx2 = sx[ 7 ] - ( S1*sx[8] ); - dx3 = sx[ 6 ] - ( S2*sx[7] ); - dx4 = sx[ 5 ] - ( S3*sx[6] ); - dx5 = sx[ 4 ] - ( S4*sx[5] ); - dx6 = sx[ 3 ] - ( S5*sx[4] ); - dx7 = sx[ 2 ] - ( S6*sx[3] ); - dx8 = sx[ 1 ] - ( S7*sx[2] ); - dx9 = sx[ 0 ] - ( S8*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 9 ]; - dy1 = sy[ 8 ] - ( S0*sy[9] ); - dy2 = sy[ 7 ] - ( S1*sy[8] ); - dy3 = sy[ 6 ] - ( S2*sy[7] ); - dy4 = sy[ 5 ] - ( S3*sy[6] ); - dy5 = sy[ 4 ] - ( S4*sy[5] ); - dy6 = sy[ 3 ] - ( S5*sy[4] ); - dy7 = sy[ 2 ] - ( S6*sy[3] ); - dy8 = sy[ 1 ] - ( S7*sy[2] ); - dy9 = sy[ 0 ] - ( S8*sy[1] ); - dz0 = sz[ 9 ]; - dz1 = sz[ 8 ] - ( S0*sz[9] ); - dz2 = sz[ 7 ] - ( S1*sz[8] ); - dz3 = sz[ 6 ] - ( S2*sz[7] ); - dz4 = sz[ 5 ] - ( S3*sz[6] ); - dz5 = sz[ 4 ] - ( S4*sz[5] ); - dz6 = sz[ 3 ] - ( S5*sz[4] ); - dz7 = sz[ 2 ] - ( S6*sz[3] ); - dz8 = sz[ 1 ] - ( S7*sz[2] ); - dz9 = sz[ 0 ] - ( S8*sz[1] ); - } else { // order === 'column-major' - // For column-major ndarrays, the first dimensions have the fastest changing indices... - S0 = sh[ 0 ]; - S1 = sh[ 1 ]; - S2 = sh[ 2 ]; - S3 = sh[ 3 ]; - S4 = sh[ 4 ]; - S5 = sh[ 5 ]; - S6 = sh[ 6 ]; - S7 = sh[ 7 ]; - S8 = sh[ 8 ]; - S9 = sh[ 9 ]; - dx0 = sx[ 0 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[0] ); - dx2 = sx[ 2 ] - ( S1*sx[1] ); - dx3 = sx[ 3 ] - ( S2*sx[2] ); - dx4 = sx[ 4 ] - ( S3*sx[3] ); - dx5 = sx[ 5 ] - ( S4*sx[4] ); - dx6 = sx[ 6 ] - ( S5*sx[5] ); - dx7 = sx[ 7 ] - ( S6*sx[6] ); - dx8 = sx[ 8 ] - ( S7*sx[7] ); - dx9 = sx[ 9 ] - ( S8*sx[8] ); // offset increment for outermost loop - dy0 = sy[ 0 ]; - dy1 = sy[ 1 ] - ( S0*sy[0] ); - dy2 = sy[ 2 ] - ( S1*sy[1] ); - dy3 = sy[ 3 ] - ( S2*sy[2] ); - dy4 = sy[ 4 ] - ( S3*sy[3] ); - dy5 = sy[ 5 ] - ( S4*sy[4] ); - dy6 = sy[ 6 ] - ( S5*sy[5] ); - dy7 = sy[ 7 ] - ( S6*sy[6] ); - dy8 = sy[ 8 ] - ( S7*sy[7] ); - dy9 = sy[ 9 ] - ( S8*sy[8] ); - dz0 = sz[ 0 ]; - dz1 = sz[ 1 ] - ( S0*sz[0] ); - dz2 = sz[ 2 ] - ( S1*sz[1] ); - dz3 = sz[ 3 ] - ( S2*sz[2] ); - dz4 = sz[ 4 ] - ( S3*sz[3] ); - dz5 = sz[ 5 ] - ( S4*sz[4] ); - dz6 = sz[ 6 ] - ( S5*sz[5] ); - dz7 = sz[ 7 ] - ( S6*sz[6] ); - dz8 = sz[ 8 ] - ( S7*sz[7] ); - dz9 = sz[ 9 ] - ( S8*sz[8] ); - } - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache accessors: - xget = x.accessors[ 0 ]; - yget = y.accessors[ 0 ]; - zset = z.accessors[ 1 ]; - - // Iterate over the ndarray dimensions... - for ( i9 = 0; i9 < S9; i9++ ) { - for ( i8 = 0; i8 < S8; i8++ ) { - for ( i7 = 0; i7 < S7; i7++ ) { - for ( i6 = 0; i6 < S6; i6++ ) { - for ( i5 = 0; i5 < S5; i5++ ) { - for ( i4 = 0; i4 < S4; i4++ ) { - for ( i3 = 0; i3 < S3; i3++ ) { - for ( i2 = 0; i2 < S2; i2++ ) { - for ( i1 = 0; i1 < S1; i1++ ) { - for ( i0 = 0; i0 < S0; i0++ ) { - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } - ix += dx6; - iy += dy6; - iz += dz6; - } - ix += dx7; - iy += dy7; - iz += dz7; - } - ix += dx8; - iy += dy8; - iz += dz8; - } - ix += dx9; - iy += dy9; - iz += dz9; - } -} - - -// EXPORTS // - -module.exports = binary10d; diff --git a/lib/10d_blocked.js b/lib/10d_blocked.js deleted file mode 100644 index 877211f..0000000 --- a/lib/10d_blocked.js +++ /dev/null @@ -1,455 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function, max-lines */ - -'use strict'; - -// MODULES // - -var loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' ); -var blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' ); - - -// MAIN // - -/** -* Applies a binary callback to elements in ten-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Callback} fcn - binary callback -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* blockedbinary10d( x, y, z, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function blockedbinary10d( x, y, z, fcn ) { - var bsize; - var xbuf; - var ybuf; - var zbuf; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dx6; - var dx7; - var dx8; - var dx9; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dy6; - var dy7; - var dy8; - var dy9; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var dz6; - var dz7; - var dz8; - var dz9; - var ox1; - var ox2; - var ox3; - var ox4; - var ox5; - var ox6; - var ox7; - var ox8; - var ox9; - var oy1; - var oy2; - var oy3; - var oy4; - var oy5; - var oy6; - var oy7; - var oy8; - var oy9; - var oz1; - var oz2; - var oz3; - var oz4; - var oz5; - var oz6; - var oz7; - var oz8; - var oz9; - var sh; - var s0; - var s1; - var s2; - var s3; - var s4; - var s5; - var s6; - var s7; - var s8; - var s9; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - var i6; - var i7; - var i8; - var i9; - var j0; - var j1; - var j2; - var j3; - var j4; - var j5; - var j6; - var j7; - var j8; - var j9; - var o; - - // Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop... - - // Resolve the loop interchange order: - o = loopOrder( x.shape, x.strides, y.strides, z.strides ); - sh = o.sh; - sx = o.sx; - sy = o.sy; - sz = o.sz; - - // Determine the block size: - bsize = blockSize( x.dtype, y.dtype, z.dtype ); - - // Cache the indices of the first indexed elements in the respective ndarrays... - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache offset increments for the innermost loop... - dx0 = sx[0]; - dy0 = sy[0]; - dz0 = sz[0]; - - // Iterate over blocks... - for ( j9 = sh[9]; j9 > 0; ) { - if ( j9 < bsize ) { - s9 = j9; - j9 = 0; - } else { - s9 = bsize; - j9 -= bsize; - } - ox9 = ox + ( j9*sx[9] ); - oy9 = oy + ( j9*sy[9] ); - oz9 = oz + ( j9*sz[9] ); - for ( j8 = sh[8]; j8 > 0; ) { - if ( j8 < bsize ) { - s8 = j8; - j8 = 0; - } else { - s8 = bsize; - j8 -= bsize; - } - dx9 = sx[9] - ( s8*sx[8] ); - dy9 = sy[9] - ( s8*sy[8] ); - dz9 = sz[9] - ( s8*sz[8] ); - ox8 = ox9 + ( j8*sx[8] ); - oy8 = oy9 + ( j8*sy[8] ); - oz8 = oz9 + ( j8*sz[8] ); - for ( j7 = sh[7]; j7 > 0; ) { - if ( j7 < bsize ) { - s7 = j7; - j7 = 0; - } else { - s7 = bsize; - j7 -= bsize; - } - dx8 = sx[8] - ( s7*sx[7] ); - dy8 = sy[8] - ( s7*sy[7] ); - dz8 = sz[8] - ( s7*sz[7] ); - ox7 = ox8 + ( j7*sx[7] ); - oy7 = oy8 + ( j7*sy[7] ); - oz7 = oz8 + ( j7*sz[7] ); - for ( j6 = sh[6]; j6 > 0; ) { - if ( j6 < bsize ) { - s6 = j6; - j6 = 0; - } else { - s6 = bsize; - j6 -= bsize; - } - dx7 = sx[7] - ( s6*sx[6] ); - dy7 = sy[7] - ( s6*sy[6] ); - dz7 = sz[7] - ( s6*sz[6] ); - ox6 = ox7 + ( j6*sx[6] ); - oy6 = oy7 + ( j6*sy[6] ); - oz6 = oz7 + ( j6*sz[6] ); - for ( j5 = sh[5]; j5 > 0; ) { - if ( j5 < bsize ) { - s5 = j5; - j5 = 0; - } else { - s5 = bsize; - j5 -= bsize; - } - dx6 = sx[6] - ( s5*sx[5] ); - dy6 = sy[6] - ( s5*sy[5] ); - dz6 = sz[6] - ( s5*sz[5] ); - ox5 = ox6 + ( j5*sx[5] ); - oy5 = oy6 + ( j5*sy[5] ); - oz5 = oz6 + ( j5*sz[5] ); - for ( j4 = sh[4]; j4 > 0; ) { - if ( j4 < bsize ) { - s4 = j4; - j4 = 0; - } else { - s4 = bsize; - j4 -= bsize; - } - dx5 = sx[5] - ( s4*sx[4] ); - dy5 = sy[5] - ( s4*sy[4] ); - dz5 = sz[5] - ( s4*sz[4] ); - ox4 = ox5 + ( j4*sx[4] ); - oy4 = oy5 + ( j4*sy[4] ); - oz4 = oz5 + ( j4*sz[4] ); - for ( j3 = sh[3]; j3 > 0; ) { - if ( j3 < bsize ) { - s3 = j3; - j3 = 0; - } else { - s3 = bsize; - j3 -= bsize; - } - dx4 = sx[4] - ( s3*sx[3] ); - dy4 = sy[4] - ( s3*sy[3] ); - dz4 = sz[4] - ( s3*sz[3] ); - ox3 = ox4 + ( j3*sx[3] ); - oy3 = oy4 + ( j3*sy[3] ); - oz3 = oz4 + ( j3*sz[3] ); - for ( j2 = sh[2]; j2 > 0; ) { - if ( j2 < bsize ) { - s2 = j2; - j2 = 0; - } else { - s2 = bsize; - j2 -= bsize; - } - dx3 = sx[3] - ( s2*sx[2] ); - dy3 = sy[3] - ( s2*sy[2] ); - dz3 = sz[3] - ( s2*sz[2] ); - ox2 = ox3 + ( j2*sx[2] ); - oy2 = oy3 + ( j2*sy[2] ); - oz2 = oz3 + ( j2*sz[2] ); - for ( j1 = sh[1]; j1 > 0; ) { - if ( j1 < bsize ) { - s1 = j1; - j1 = 0; - } else { - s1 = bsize; - j1 -= bsize; - } - dx2 = sx[2] - ( s1*sx[1] ); - dy2 = sy[2] - ( s1*sy[1] ); - dz2 = sz[2] - ( s1*sz[1] ); - ox1 = ox2 + ( j1*sx[1] ); - oy1 = oy2 + ( j1*sy[1] ); - oz1 = oz2 + ( j1*sz[1] ); - for ( j0 = sh[0]; j0 > 0; ) { - if ( j0 < bsize ) { - s0 = j0; - j0 = 0; - } else { - s0 = bsize; - j0 -= bsize; - } - // Compute index offsets for the first input and output ndarray elements in the current block... - ix = ox1 + ( j0*sx[0] ); - iy = oy1 + ( j0*sy[0] ); - iz = oz1 + ( j0*sz[0] ); - - // Compute loop offset increments... - dx1 = sx[1] - ( s0*sx[0] ); - dy1 = sy[1] - ( s0*sy[0] ); - dz1 = sz[1] - ( s0*sz[0] ); - - // Iterate over the ndarray dimensions... - for ( i9 = 0; i9 < s9; i9++ ) { - for ( i8 = 0; i8 < s8; i8++ ) { - for ( i7 = 0; i7 < s7; i7++ ) { - for ( i6 = 0; i6 < s6; i6++ ) { - for ( i5 = 0; i5 < s5; i5++ ) { - for ( i4 = 0; i4 < s4; i4++ ) { - for ( i3 = 0; i3 < s3; i3++ ) { - for ( i2 = 0; i2 < s2; i2++ ) { - for ( i1 = 0; i1 < s1; i1++ ) { - for ( i0 = 0; i0 < s0; i0++ ) { - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } - ix += dx6; - iy += dy6; - iz += dz6; - } - ix += dx7; - iy += dy7; - iz += dz7; - } - ix += dx8; - iy += dy8; - iz += dz8; - } - ix += dx9; - iy += dy9; - iz += dz9; - } - } - } - } - } - } - } - } - } - } - } -} - - -// EXPORTS // - -module.exports = blockedbinary10d; diff --git a/lib/10d_blocked_accessors.js b/lib/10d_blocked_accessors.js deleted file mode 100644 index f85712e..0000000 --- a/lib/10d_blocked_accessors.js +++ /dev/null @@ -1,471 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function, max-lines */ - -'use strict'; - -// MODULES // - -var loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' ); -var blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' ); - - -// MAIN // - -/** -* Applies a binary callback to elements in ten-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {Callback} fcn - binary callback -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* blockedbinary10d( x, y, z, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function blockedbinary10d( x, y, z, fcn ) { - var bsize; - var xbuf; - var ybuf; - var zbuf; - var xget; - var yget; - var zset; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dx6; - var dx7; - var dx8; - var dx9; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dy6; - var dy7; - var dy8; - var dy9; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var dz6; - var dz7; - var dz8; - var dz9; - var ox1; - var ox2; - var ox3; - var ox4; - var ox5; - var ox6; - var ox7; - var ox8; - var ox9; - var oy1; - var oy2; - var oy3; - var oy4; - var oy5; - var oy6; - var oy7; - var oy8; - var oy9; - var oz1; - var oz2; - var oz3; - var oz4; - var oz5; - var oz6; - var oz7; - var oz8; - var oz9; - var sh; - var s0; - var s1; - var s2; - var s3; - var s4; - var s5; - var s6; - var s7; - var s8; - var s9; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - var i6; - var i7; - var i8; - var i9; - var j0; - var j1; - var j2; - var j3; - var j4; - var j5; - var j6; - var j7; - var j8; - var j9; - var o; - - // Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop... - - // Resolve the loop interchange order: - o = loopOrder( x.shape, x.strides, y.strides, z.strides ); - sh = o.sh; - sx = o.sx; - sy = o.sy; - sz = o.sz; - - // Determine the block size: - bsize = blockSize( x.dtype, y.dtype, z.dtype ); - - // Cache the indices of the first indexed elements in the respective ndarrays... - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache offset increments for the innermost loop... - dx0 = sx[0]; - dy0 = sy[0]; - dz0 = sz[0]; - - // Cache accessors: - xget = x.accessors[0]; - yget = y.accessors[0]; - zset = z.accessors[1]; - - // Iterate over blocks... - for ( j9 = sh[9]; j9 > 0; ) { - if ( j9 < bsize ) { - s9 = j9; - j9 = 0; - } else { - s9 = bsize; - j9 -= bsize; - } - ox9 = ox + ( j9*sx[9] ); - oy9 = oy + ( j9*sy[9] ); - oz9 = oz + ( j9*sz[9] ); - for ( j8 = sh[8]; j8 > 0; ) { - if ( j8 < bsize ) { - s8 = j8; - j8 = 0; - } else { - s8 = bsize; - j8 -= bsize; - } - dx9 = sx[9] - ( s8*sx[8] ); - dy9 = sy[9] - ( s8*sy[8] ); - dz9 = sz[9] - ( s8*sz[8] ); - ox8 = ox9 + ( j8*sx[8] ); - oy8 = oy9 + ( j8*sy[8] ); - oz8 = oz9 + ( j8*sz[8] ); - for ( j7 = sh[7]; j7 > 0; ) { - if ( j7 < bsize ) { - s7 = j7; - j7 = 0; - } else { - s7 = bsize; - j7 -= bsize; - } - dx8 = sx[8] - ( s7*sx[7] ); - dy8 = sy[8] - ( s7*sy[7] ); - dz8 = sz[8] - ( s7*sz[7] ); - ox7 = ox8 + ( j7*sx[7] ); - oy7 = oy8 + ( j7*sy[7] ); - oz7 = oz8 + ( j7*sz[7] ); - for ( j6 = sh[6]; j6 > 0; ) { - if ( j6 < bsize ) { - s6 = j6; - j6 = 0; - } else { - s6 = bsize; - j6 -= bsize; - } - dx7 = sx[7] - ( s6*sx[6] ); - dy7 = sy[7] - ( s6*sy[6] ); - dz7 = sz[7] - ( s6*sz[6] ); - ox6 = ox7 + ( j6*sx[6] ); - oy6 = oy7 + ( j6*sy[6] ); - oz6 = oz7 + ( j6*sz[6] ); - for ( j5 = sh[5]; j5 > 0; ) { - if ( j5 < bsize ) { - s5 = j5; - j5 = 0; - } else { - s5 = bsize; - j5 -= bsize; - } - dx6 = sx[6] - ( s5*sx[5] ); - dy6 = sy[6] - ( s5*sy[5] ); - dz6 = sz[6] - ( s5*sz[5] ); - ox5 = ox6 + ( j5*sx[5] ); - oy5 = oy6 + ( j5*sy[5] ); - oz5 = oz6 + ( j5*sz[5] ); - for ( j4 = sh[4]; j4 > 0; ) { - if ( j4 < bsize ) { - s4 = j4; - j4 = 0; - } else { - s4 = bsize; - j4 -= bsize; - } - dx5 = sx[5] - ( s4*sx[4] ); - dy5 = sy[5] - ( s4*sy[4] ); - dz5 = sz[5] - ( s4*sz[4] ); - ox4 = ox5 + ( j4*sx[4] ); - oy4 = oy5 + ( j4*sy[4] ); - oz4 = oz5 + ( j4*sz[4] ); - for ( j3 = sh[3]; j3 > 0; ) { - if ( j3 < bsize ) { - s3 = j3; - j3 = 0; - } else { - s3 = bsize; - j3 -= bsize; - } - dx4 = sx[4] - ( s3*sx[3] ); - dy4 = sy[4] - ( s3*sy[3] ); - dz4 = sz[4] - ( s3*sz[3] ); - ox3 = ox4 + ( j3*sx[3] ); - oy3 = oy4 + ( j3*sy[3] ); - oz3 = oz4 + ( j3*sz[3] ); - for ( j2 = sh[2]; j2 > 0; ) { - if ( j2 < bsize ) { - s2 = j2; - j2 = 0; - } else { - s2 = bsize; - j2 -= bsize; - } - dx3 = sx[3] - ( s2*sx[2] ); - dy3 = sy[3] - ( s2*sy[2] ); - dz3 = sz[3] - ( s2*sz[2] ); - ox2 = ox3 + ( j2*sx[2] ); - oy2 = oy3 + ( j2*sy[2] ); - oz2 = oz3 + ( j2*sz[2] ); - for ( j1 = sh[1]; j1 > 0; ) { - if ( j1 < bsize ) { - s1 = j1; - j1 = 0; - } else { - s1 = bsize; - j1 -= bsize; - } - dx2 = sx[2] - ( s1*sx[1] ); - dy2 = sy[2] - ( s1*sy[1] ); - dz2 = sz[2] - ( s1*sz[1] ); - ox1 = ox2 + ( j1*sx[1] ); - oy1 = oy2 + ( j1*sy[1] ); - oz1 = oz2 + ( j1*sz[1] ); - for ( j0 = sh[0]; j0 > 0; ) { - if ( j0 < bsize ) { - s0 = j0; - j0 = 0; - } else { - s0 = bsize; - j0 -= bsize; - } - // Compute index offsets for the first input and output ndarray elements in the current block... - ix = ox1 + ( j0*sx[0] ); - iy = oy1 + ( j0*sy[0] ); - iz = oz1 + ( j0*sz[0] ); - - // Compute loop offset increments... - dx1 = sx[1] - ( s0*sx[0] ); - dy1 = sy[1] - ( s0*sy[0] ); - dz1 = sz[1] - ( s0*sz[0] ); - - // Iterate over the ndarray dimensions... - for ( i9 = 0; i9 < s9; i9++ ) { - for ( i8 = 0; i8 < s8; i8++ ) { - for ( i7 = 0; i7 < s7; i7++ ) { - for ( i6 = 0; i6 < s6; i6++ ) { - for ( i5 = 0; i5 < s5; i5++ ) { - for ( i4 = 0; i4 < s4; i4++ ) { - for ( i3 = 0; i3 < s3; i3++ ) { - for ( i2 = 0; i2 < s2; i2++ ) { - for ( i1 = 0; i1 < s1; i1++ ) { - for ( i0 = 0; i0 < s0; i0++ ) { - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } - ix += dx6; - iy += dy6; - iz += dz6; - } - ix += dx7; - iy += dy7; - iz += dz7; - } - ix += dx8; - iy += dy8; - iz += dz8; - } - ix += dx9; - iy += dy9; - iz += dz9; - } - } - } - } - } - } - } - } - } - } - } -} - - -// EXPORTS // - -module.exports = blockedbinary10d; diff --git a/lib/1d.js b/lib/1d.js deleted file mode 100644 index bbc23de..0000000 --- a/lib/1d.js +++ /dev/null @@ -1,151 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in one-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 12 ]; -* -* // Define the array strides: -* var sx = [ 1 ]; -* var sy = [ 1 ]; -* var sz = [ 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* binary1d( x, y, z, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary1d( x, y, z, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var dx0; - var dy0; - var dz0; - var S0; - var ix; - var iy; - var iz; - var i0; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables: dimensions and loop offset (pointer) increments... - S0 = x.shape[ 0 ]; - dx0 = x.strides[ 0 ]; - dy0 = y.strides[ 0 ]; - dz0 = z.strides[ 0 ]; - - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Iterate over the ndarray dimensions... - for ( i0 = 0; i0 < S0; i0++ ) { - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - ix += dx0; - iy += dy0; - iz += dz0; - } -} - - -// EXPORTS // - -module.exports = binary1d; diff --git a/lib/1d_accessors.js b/lib/1d_accessors.js deleted file mode 100644 index ae60a9b..0000000 --- a/lib/1d_accessors.js +++ /dev/null @@ -1,167 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in one-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 12 ]; -* -* // Define the array strides: -* var sx = [ 1 ]; -* var sy = [ 1 ]; -* var sz = [ 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* binary1d( x, y, z, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary1d( x, y, z, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var xget; - var yget; - var zset; - var dx0; - var dy0; - var dz0; - var S0; - var ix; - var iy; - var iz; - var i0; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables: dimensions and loop offset (pointer) increments... - S0 = x.shape[ 0 ]; - dx0 = x.strides[ 0 ]; - dy0 = y.strides[ 0 ]; - dz0 = z.strides[ 0 ]; - - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache accessors: - xget = x.accessors[ 0 ]; - yget = y.accessors[ 0 ]; - zset = z.accessors[ 1 ]; - - // Iterate over the ndarray dimensions... - for ( i0 = 0; i0 < S0; i0++ ) { - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - ix += dx0; - iy += dy0; - iz += dz0; - } -} - - -// EXPORTS // - -module.exports = binary1d; diff --git a/lib/2d.js b/lib/2d.js deleted file mode 100644 index ff01296..0000000 --- a/lib/2d.js +++ /dev/null @@ -1,186 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in two-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 6, 2 ]; -* -* // Define the array strides: -* var sx = [ 2, 1 ]; -* var sy = [ 2, 1 ]; -* var sz = [ 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* binary2d( x, y, z, true, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary2d( x, y, z, isRowMajor, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var dx0; - var dx1; - var dy0; - var dy1; - var dz0; - var dz1; - var sh; - var S0; - var S1; - var sx; - var sy; - var sz; - var ix; - var iy; - var iz; - var i0; - var i1; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments... - sh = x.shape; - sx = x.strides; - sy = y.strides; - sz = z.strides; - if ( isRowMajor ) { - // For row-major ndarrays, the last dimensions have the fastest changing indices... - S0 = sh[ 1 ]; - S1 = sh[ 0 ]; - dx0 = sx[ 1 ]; // offset increment for innermost loop - dx1 = sx[ 0 ] - ( S0*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 1 ]; - dy1 = sy[ 0 ] - ( S0*sy[1] ); - dz0 = sz[ 1 ]; - dz1 = sz[ 0 ] - ( S0*sz[1] ); - } else { // order === 'column-major' - // For column-major ndarrays, the first dimensions have the fastest changing indices... - S0 = sh[ 0 ]; - S1 = sh[ 1 ]; - dx0 = sx[ 0 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[0] ); // offset increment for outermost loop - dy0 = sy[ 0 ]; - dy1 = sy[ 1 ] - ( S0*sy[0] ); - dz0 = sz[ 0 ]; - dz1 = sz[ 1 ] - ( S0*sz[0] ); - } - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Iterate over the ndarray dimensions... - for ( i1 = 0; i1 < S1; i1++ ) { - for ( i0 = 0; i0 < S0; i0++ ) { - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } -} - - -// EXPORTS // - -module.exports = binary2d; diff --git a/lib/2d_accessors.js b/lib/2d_accessors.js deleted file mode 100644 index cd8aba4..0000000 --- a/lib/2d_accessors.js +++ /dev/null @@ -1,202 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in two-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 6, 2 ]; -* -* // Define the array strides: -* var sx = [ 2, 1 ]; -* var sy = [ 2, 1 ]; -* var sz = [ 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* binary2d( x, y, z, true, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary2d( x, y, z, isRowMajor, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var xget; - var yget; - var zset; - var dx0; - var dx1; - var dy0; - var dy1; - var dz0; - var dz1; - var sh; - var S0; - var S1; - var sx; - var sy; - var sz; - var ix; - var iy; - var iz; - var i0; - var i1; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments... - sh = x.shape; - sx = x.strides; - sy = y.strides; - sz = z.strides; - if ( isRowMajor ) { - // For row-major ndarrays, the last dimensions have the fastest changing indices... - S0 = sh[ 1 ]; - S1 = sh[ 0 ]; - dx0 = sx[ 1 ]; // offset increment for innermost loop - dx1 = sx[ 0 ] - ( S0*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 1 ]; - dy1 = sy[ 0 ] - ( S0*sy[1] ); - dz0 = sz[ 1 ]; - dz1 = sz[ 0 ] - ( S0*sz[1] ); - } else { // order === 'column-major' - // For column-major ndarrays, the first dimensions have the fastest changing indices... - S0 = sh[ 0 ]; - S1 = sh[ 1 ]; - dx0 = sx[ 0 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[0] ); // offset increment for outermost loop - dy0 = sy[ 0 ]; - dy1 = sy[ 1 ] - ( S0*sy[0] ); - dz0 = sz[ 0 ]; - dz1 = sz[ 1 ] - ( S0*sz[0] ); - } - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache accessors: - xget = x.accessors[ 0 ]; - yget = y.accessors[ 0 ]; - zset = z.accessors[ 1 ]; - - // Iterate over the ndarray dimensions... - for ( i1 = 0; i1 < S1; i1++ ) { - for ( i0 = 0; i0 < S0; i0++ ) { - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } -} - - -// EXPORTS // - -module.exports = binary2d; diff --git a/lib/2d_blocked.js b/lib/2d_blocked.js deleted file mode 100644 index 9bfe4c6..0000000 --- a/lib/2d_blocked.js +++ /dev/null @@ -1,221 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MODULES // - -var loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' ); -var blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' ); - - -// MAIN // - -/** -* Applies a binary callback to elements in two-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Callback} fcn - binary callback -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 6, 2 ]; -* -* // Define the array strides: -* var sx = [ 2, 1 ]; -* var sy = [ 2, 1 ]; -* var sz = [ 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* blockedbinary2d( x, y, z, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function blockedbinary2d( x, y, z, fcn ) { - var bsize; - var xbuf; - var ybuf; - var zbuf; - var dx0; - var dx1; - var dy0; - var dy1; - var dz0; - var dz1; - var ox1; - var oy1; - var oz1; - var sh; - var s0; - var s1; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i0; - var i1; - var j0; - var j1; - var o; - - // Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop... - - // Resolve the loop interchange order: - o = loopOrder( x.shape, x.strides, y.strides, z.strides ); - sh = o.sh; - sx = o.sx; - sy = o.sy; - sz = o.sz; - - // Determine the block size: - bsize = blockSize( x.dtype, y.dtype, z.dtype ); - - // Cache the indices of the first indexed elements in the respective ndarrays... - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache offset increments for the innermost loop... - dx0 = sx[0]; - dy0 = sy[0]; - dz0 = sz[0]; - - // Iterate over blocks... - for ( j1 = sh[1]; j1 > 0; ) { - if ( j1 < bsize ) { - s1 = j1; - j1 = 0; - } else { - s1 = bsize; - j1 -= bsize; - } - ox1 = ox + ( j1*sx[1] ); - oy1 = oy + ( j1*sy[1] ); - oz1 = oz + ( j1*sz[1] ); - for ( j0 = sh[0]; j0 > 0; ) { - if ( j0 < bsize ) { - s0 = j0; - j0 = 0; - } else { - s0 = bsize; - j0 -= bsize; - } - // Compute index offsets for the first input and output ndarray elements in the current block... - ix = ox1 + ( j0*sx[0] ); - iy = oy1 + ( j0*sy[0] ); - iz = oz1 + ( j0*sz[0] ); - - // Compute loop offset increments... - dx1 = sx[1] - ( s0*sx[0] ); - dy1 = sy[1] - ( s0*sy[0] ); - dz1 = sz[1] - ( s0*sz[0] ); - - // Iterate over the ndarray dimensions... - for ( i1 = 0; i1 < s1; i1++ ) { - for ( i0 = 0; i0 < s0; i0++ ) { - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - } - } -} - - -// EXPORTS // - -module.exports = blockedbinary2d; diff --git a/lib/2d_blocked_accessors.js b/lib/2d_blocked_accessors.js deleted file mode 100644 index a219eb0..0000000 --- a/lib/2d_blocked_accessors.js +++ /dev/null @@ -1,237 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MODULES // - -var loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' ); -var blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' ); - - -// MAIN // - -/** -* Applies a binary callback to elements in two-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {Callback} fcn - binary callback -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 6, 2 ]; -* -* // Define the array strides: -* var sx = [ 2, 1 ]; -* var sy = [ 2, 1 ]; -* var sz = [ 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* blockedbinary2d( x, y, z, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function blockedbinary2d( x, y, z, fcn ) { - var bsize; - var xbuf; - var ybuf; - var zbuf; - var xget; - var yget; - var zset; - var dx0; - var dx1; - var dy0; - var dy1; - var dz0; - var dz1; - var ox1; - var oy1; - var oz1; - var sh; - var s0; - var s1; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i0; - var i1; - var j0; - var j1; - var o; - - // Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop... - - // Resolve the loop interchange order: - o = loopOrder( x.shape, x.strides, y.strides, z.strides ); - sh = o.sh; - sx = o.sx; - sy = o.sy; - sz = o.sz; - - // Determine the block size: - bsize = blockSize( x.dtype, y.dtype, z.dtype ); - - // Cache the indices of the first indexed elements in the respective ndarrays... - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache offset increments for the innermost loop... - dx0 = sx[0]; - dy0 = sy[0]; - dz0 = sz[0]; - - // Cache accessors: - xget = x.accessors[0]; - yget = y.accessors[0]; - zset = z.accessors[1]; - - // Iterate over blocks... - for ( j1 = sh[1]; j1 > 0; ) { - if ( j1 < bsize ) { - s1 = j1; - j1 = 0; - } else { - s1 = bsize; - j1 -= bsize; - } - ox1 = ox + ( j1*sx[1] ); - oy1 = oy + ( j1*sy[1] ); - oz1 = oz + ( j1*sz[1] ); - for ( j0 = sh[0]; j0 > 0; ) { - if ( j0 < bsize ) { - s0 = j0; - j0 = 0; - } else { - s0 = bsize; - j0 -= bsize; - } - // Compute index offsets for the first input and output ndarray elements in the current block... - ix = ox1 + ( j0*sx[0] ); - iy = oy1 + ( j0*sy[0] ); - iz = oz1 + ( j0*sz[0] ); - - // Compute loop offset increments... - dx1 = sx[1] - ( s0*sx[0] ); - dy1 = sy[1] - ( s0*sy[0] ); - dz1 = sz[1] - ( s0*sz[0] ); - - // Iterate over the ndarray dimensions... - for ( i1 = 0; i1 < s1; i1++ ) { - for ( i0 = 0; i0 < s0; i0++ ) { - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - } - } -} - - -// EXPORTS // - -module.exports = blockedbinary2d; diff --git a/lib/3d.js b/lib/3d.js deleted file mode 100644 index 1b90955..0000000 --- a/lib/3d.js +++ /dev/null @@ -1,204 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in three-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 4, 2, 1 ]; -* var sy = [ 4, 2, 1 ]; -* var sz = [ 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* binary3d( x, y, z, true, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary3d( x, y, z, isRowMajor, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var dx0; - var dx1; - var dx2; - var dy0; - var dy1; - var dy2; - var dz0; - var dz1; - var dz2; - var sh; - var S0; - var S1; - var S2; - var sx; - var sy; - var sz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments... - sh = x.shape; - sx = x.strides; - sy = y.strides; - sz = z.strides; - if ( isRowMajor ) { - // For row-major ndarrays, the last dimensions have the fastest changing indices... - S0 = sh[ 2 ]; - S1 = sh[ 1 ]; - S2 = sh[ 0 ]; - dx0 = sx[ 2 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[2] ); - dx2 = sx[ 0 ] - ( S1*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 2 ]; - dy1 = sy[ 1 ] - ( S0*sy[2] ); - dy2 = sy[ 0 ] - ( S1*sy[1] ); - dz0 = sz[ 2 ]; - dz1 = sz[ 1 ] - ( S0*sz[2] ); - dz2 = sz[ 0 ] - ( S1*sz[1] ); - } else { // order === 'column-major' - // For column-major ndarrays, the first dimensions have the fastest changing indices... - S0 = sh[ 0 ]; - S1 = sh[ 1 ]; - S2 = sh[ 2 ]; - dx0 = sx[ 0 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[0] ); - dx2 = sx[ 2 ] - ( S1*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 0 ]; - dy1 = sy[ 1 ] - ( S0*sy[0] ); - dy2 = sy[ 2 ] - ( S1*sy[1] ); - dz0 = sz[ 0 ]; - dz1 = sz[ 1 ] - ( S0*sz[0] ); - dz2 = sz[ 2 ] - ( S1*sz[1] ); - } - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Iterate over the ndarray dimensions... - for ( i2 = 0; i2 < S2; i2++ ) { - for ( i1 = 0; i1 < S1; i1++ ) { - for ( i0 = 0; i0 < S0; i0++ ) { - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } -} - - -// EXPORTS // - -module.exports = binary3d; diff --git a/lib/3d_accessors.js b/lib/3d_accessors.js deleted file mode 100644 index bd38b99..0000000 --- a/lib/3d_accessors.js +++ /dev/null @@ -1,220 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in three-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 4, 2, 1 ]; -* var sy = [ 4, 2, 1 ]; -* var sz = [ 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* binary3d( x, y, z, true, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary3d( x, y, z, isRowMajor, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var xget; - var yget; - var zset; - var dx0; - var dx1; - var dx2; - var dy0; - var dy1; - var dy2; - var dz0; - var dz1; - var dz2; - var sh; - var S0; - var S1; - var S2; - var sx; - var sy; - var sz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments... - sh = x.shape; - sx = x.strides; - sy = y.strides; - sz = z.strides; - if ( isRowMajor ) { - // For row-major ndarrays, the last dimensions have the fastest changing indices... - S0 = sh[ 2 ]; - S1 = sh[ 1 ]; - S2 = sh[ 0 ]; - dx0 = sx[ 2 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[2] ); - dx2 = sx[ 0 ] - ( S1*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 2 ]; - dy1 = sy[ 1 ] - ( S0*sy[2] ); - dy2 = sy[ 0 ] - ( S1*sy[1] ); - dz0 = sz[ 2 ]; - dz1 = sz[ 1 ] - ( S0*sz[2] ); - dz2 = sz[ 0 ] - ( S1*sz[1] ); - } else { // order === 'column-major' - // For column-major ndarrays, the first dimensions have the fastest changing indices... - S0 = sh[ 0 ]; - S1 = sh[ 1 ]; - S2 = sh[ 2 ]; - dx0 = sx[ 0 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[0] ); - dx2 = sx[ 2 ] - ( S1*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 0 ]; - dy1 = sy[ 1 ] - ( S0*sy[0] ); - dy2 = sy[ 2 ] - ( S1*sy[1] ); - dz0 = sz[ 0 ]; - dz1 = sz[ 1 ] - ( S0*sz[0] ); - dz2 = sz[ 2 ] - ( S1*sz[1] ); - } - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache accessors: - xget = x.accessors[ 0 ]; - yget = y.accessors[ 0 ]; - zset = z.accessors[ 1 ]; - - // Iterate over the ndarray dimensions... - for ( i2 = 0; i2 < S2; i2++ ) { - for ( i1 = 0; i1 < S1; i1++ ) { - for ( i0 = 0; i0 < S0; i0++ ) { - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } -} - - -// EXPORTS // - -module.exports = binary3d; diff --git a/lib/3d_blocked.js b/lib/3d_blocked.js deleted file mode 100644 index 2d69b7b..0000000 --- a/lib/3d_blocked.js +++ /dev/null @@ -1,252 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth */ - -'use strict'; - -// MODULES // - -var loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' ); -var blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' ); - - -// MAIN // - -/** -* Applies a binary callback to elements in three-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Callback} fcn - binary callback -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 4, 2, 1 ]; -* var sy = [ 4, 2, 1 ]; -* var sz = [ 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* blockedbinary3d( x, y, z, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function blockedbinary3d( x, y, z, fcn ) { - var bsize; - var xbuf; - var ybuf; - var zbuf; - var dx0; - var dx1; - var dx2; - var dy0; - var dy1; - var dy2; - var dz0; - var dz1; - var dz2; - var ox1; - var ox2; - var oy1; - var oy2; - var oz1; - var oz2; - var sh; - var s0; - var s1; - var s2; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var j0; - var j1; - var j2; - var o; - - // Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop... - - // Resolve the loop interchange order: - o = loopOrder( x.shape, x.strides, y.strides, z.strides ); - sh = o.sh; - sx = o.sx; - sy = o.sy; - sz = o.sz; - - // Determine the block size: - bsize = blockSize( x.dtype, y.dtype, z.dtype ); - - // Cache the indices of the first indexed elements in the respective ndarrays... - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache offset increments for the innermost loop... - dx0 = sx[0]; - dy0 = sy[0]; - dz0 = sz[0]; - - // Iterate over blocks... - for ( j2 = sh[2]; j2 > 0; ) { - if ( j2 < bsize ) { - s2 = j2; - j2 = 0; - } else { - s2 = bsize; - j2 -= bsize; - } - ox2 = ox + ( j2*sx[2] ); - oy2 = oy + ( j2*sy[2] ); - oz2 = oz + ( j2*sz[2] ); - for ( j1 = sh[1]; j1 > 0; ) { - if ( j1 < bsize ) { - s1 = j1; - j1 = 0; - } else { - s1 = bsize; - j1 -= bsize; - } - dx2 = sx[2] - ( s1*sx[1] ); - dy2 = sy[2] - ( s1*sy[1] ); - dz2 = sz[2] - ( s1*sz[1] ); - ox1 = ox2 + ( j1*sx[1] ); - oy1 = oy2 + ( j1*sy[1] ); - oz1 = oz2 + ( j1*sz[1] ); - for ( j0 = sh[0]; j0 > 0; ) { - if ( j0 < bsize ) { - s0 = j0; - j0 = 0; - } else { - s0 = bsize; - j0 -= bsize; - } - // Compute index offsets for the first input and output ndarray elements in the current block... - ix = ox1 + ( j0*sx[0] ); - iy = oy1 + ( j0*sy[0] ); - iz = oz1 + ( j0*sz[0] ); - - // Compute loop offset increments... - dx1 = sx[1] - ( s0*sx[0] ); - dy1 = sy[1] - ( s0*sy[0] ); - dz1 = sz[1] - ( s0*sz[0] ); - - // Iterate over the ndarray dimensions... - for ( i2 = 0; i2 < s2; i2++ ) { - for ( i1 = 0; i1 < s1; i1++ ) { - for ( i0 = 0; i0 < s0; i0++ ) { - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - } - } - } -} - - -// EXPORTS // - -module.exports = blockedbinary3d; diff --git a/lib/3d_blocked_accessors.js b/lib/3d_blocked_accessors.js deleted file mode 100644 index 48e1ab6..0000000 --- a/lib/3d_blocked_accessors.js +++ /dev/null @@ -1,268 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-len, max-statements */ - -'use strict'; - -// MODULES // - -var loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' ); -var blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' ); - - -// MAIN // - -/** -* Applies a binary callback to elements in three-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {Callback} fcn - binary callback -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 4, 2, 1 ]; -* var sy = [ 4, 2, 1 ]; -* var sz = [ 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* blockedbinary3d( x, y, z, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function blockedbinary3d( x, y, z, fcn ) { - var bsize; - var xbuf; - var ybuf; - var zbuf; - var xget; - var yget; - var zset; - var dx0; - var dx1; - var dx2; - var dy0; - var dy1; - var dy2; - var dz0; - var dz1; - var dz2; - var ox1; - var ox2; - var oy1; - var oy2; - var oz1; - var oz2; - var sh; - var s0; - var s1; - var s2; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var j0; - var j1; - var j2; - var o; - - // Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop... - - // Resolve the loop interchange order: - o = loopOrder( x.shape, x.strides, y.strides, z.strides ); - sh = o.sh; - sx = o.sx; - sy = o.sy; - sz = o.sz; - - // Determine the block size: - bsize = blockSize( x.dtype, y.dtype, z.dtype ); - - // Cache the indices of the first indexed elements in the respective ndarrays... - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache offset increments for the innermost loop... - dx0 = sx[0]; - dy0 = sy[0]; - dz0 = sz[0]; - - // Cache accessors: - xget = x.accessors[0]; - yget = y.accessors[0]; - zset = z.accessors[1]; - - // Iterate over blocks... - for ( j2 = sh[2]; j2 > 0; ) { - if ( j2 < bsize ) { - s2 = j2; - j2 = 0; - } else { - s2 = bsize; - j2 -= bsize; - } - ox2 = ox + ( j2*sx[2] ); - oy2 = oy + ( j2*sy[2] ); - oz2 = oz + ( j2*sz[2] ); - for ( j1 = sh[1]; j1 > 0; ) { - if ( j1 < bsize ) { - s1 = j1; - j1 = 0; - } else { - s1 = bsize; - j1 -= bsize; - } - dx2 = sx[2] - ( s1*sx[1] ); - dy2 = sy[2] - ( s1*sy[1] ); - dz2 = sz[2] - ( s1*sz[1] ); - ox1 = ox2 + ( j1*sx[1] ); - oy1 = oy2 + ( j1*sy[1] ); - oz1 = oz2 + ( j1*sz[1] ); - for ( j0 = sh[0]; j0 > 0; ) { - if ( j0 < bsize ) { - s0 = j0; - j0 = 0; - } else { - s0 = bsize; - j0 -= bsize; - } - // Compute index offsets for the first input and output ndarray elements in the current block... - ix = ox1 + ( j0*sx[0] ); - iy = oy1 + ( j0*sy[0] ); - iz = oz1 + ( j0*sz[0] ); - - // Compute loop offset increments... - dx1 = sx[1] - ( s0*sx[0] ); - dy1 = sy[1] - ( s0*sy[0] ); - dz1 = sz[1] - ( s0*sz[0] ); - - // Iterate over the ndarray dimensions... - for ( i2 = 0; i2 < s2; i2++ ) { - for ( i1 = 0; i1 < s1; i1++ ) { - for ( i0 = 0; i0 < s0; i0++ ) { - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - } - } - } -} - - -// EXPORTS // - -module.exports = blockedbinary3d; diff --git a/lib/4d.js b/lib/4d.js deleted file mode 100644 index 503539b..0000000 --- a/lib/4d.js +++ /dev/null @@ -1,222 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in four-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 4, 2, 1 ]; -* var sy = [ 12, 4, 2, 1 ]; -* var sz = [ 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* binary4d( x, y, z, true, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary4d( x, y, z, isRowMajor, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var dx0; - var dx1; - var dx2; - var dx3; - var dy0; - var dy1; - var dy2; - var dy3; - var dz0; - var dz1; - var dz2; - var dz3; - var sh; - var S0; - var S1; - var S2; - var S3; - var sx; - var sy; - var sz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments... - sh = x.shape; - sx = x.strides; - sy = y.strides; - sz = z.strides; - if ( isRowMajor ) { - // For row-major ndarrays, the last dimensions have the fastest changing indices... - S0 = sh[ 3 ]; - S1 = sh[ 2 ]; - S2 = sh[ 1 ]; - S3 = sh[ 0 ]; - dx0 = sx[ 3 ]; // offset increment for innermost loop - dx1 = sx[ 2 ] - ( S0*sx[3] ); - dx2 = sx[ 1 ] - ( S1*sx[2] ); - dx3 = sx[ 0 ] - ( S2*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 3 ]; - dy1 = sy[ 2 ] - ( S0*sy[3] ); - dy2 = sy[ 1 ] - ( S1*sy[2] ); - dy3 = sy[ 0 ] - ( S2*sy[1] ); - dz0 = sz[ 3 ]; - dz1 = sz[ 2 ] - ( S0*sz[3] ); - dz2 = sz[ 1 ] - ( S1*sz[2] ); - dz3 = sz[ 0 ] - ( S2*sz[1] ); - } else { // order === 'column-major' - // For column-major ndarrays, the first dimensions have the fastest changing indices... - S0 = sh[ 0 ]; - S1 = sh[ 1 ]; - S2 = sh[ 2 ]; - S3 = sh[ 3 ]; - dx0 = sx[ 0 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[0] ); - dx2 = sx[ 2 ] - ( S1*sx[1] ); - dx3 = sx[ 3 ] - ( S2*sx[2] ); // offset increment for outermost loop - dy0 = sy[ 0 ]; - dy1 = sy[ 1 ] - ( S0*sy[0] ); - dy2 = sy[ 2 ] - ( S1*sy[1] ); - dy3 = sy[ 3 ] - ( S2*sy[2] ); - dz0 = sz[ 0 ]; - dz1 = sz[ 1 ] - ( S0*sz[0] ); - dz2 = sz[ 2 ] - ( S1*sz[1] ); - dz3 = sz[ 3 ] - ( S2*sz[2] ); - } - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Iterate over the ndarray dimensions... - for ( i3 = 0; i3 < S3; i3++ ) { - for ( i2 = 0; i2 < S2; i2++ ) { - for ( i1 = 0; i1 < S1; i1++ ) { - for ( i0 = 0; i0 < S0; i0++ ) { - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } -} - - -// EXPORTS // - -module.exports = binary4d; diff --git a/lib/4d_accessors.js b/lib/4d_accessors.js deleted file mode 100644 index 6ddc05d..0000000 --- a/lib/4d_accessors.js +++ /dev/null @@ -1,238 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in four-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 4, 2, 1 ]; -* var sy = [ 12, 4, 2, 1 ]; -* var sz = [ 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* binary4d( x, y, z, true, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary4d( x, y, z, isRowMajor, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var xget; - var yget; - var zset; - var dx0; - var dx1; - var dx2; - var dx3; - var dy0; - var dy1; - var dy2; - var dy3; - var dz0; - var dz1; - var dz2; - var dz3; - var sh; - var S0; - var S1; - var S2; - var S3; - var sx; - var sy; - var sz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments... - sh = x.shape; - sx = x.strides; - sy = y.strides; - sz = z.strides; - if ( isRowMajor ) { - // For row-major ndarrays, the last dimensions have the fastest changing indices... - S0 = sh[ 3 ]; - S1 = sh[ 2 ]; - S2 = sh[ 1 ]; - S3 = sh[ 0 ]; - dx0 = sx[ 3 ]; // offset increment for innermost loop - dx1 = sx[ 2 ] - ( S0*sx[3] ); - dx2 = sx[ 1 ] - ( S1*sx[2] ); - dx3 = sx[ 0 ] - ( S2*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 3 ]; - dy1 = sy[ 2 ] - ( S0*sy[3] ); - dy2 = sy[ 1 ] - ( S1*sy[2] ); - dy3 = sy[ 0 ] - ( S2*sy[1] ); - dz0 = sz[ 3 ]; - dz1 = sz[ 2 ] - ( S0*sz[3] ); - dz2 = sz[ 1 ] - ( S1*sz[2] ); - dz3 = sz[ 0 ] - ( S2*sz[1] ); - } else { // order === 'column-major' - // For column-major ndarrays, the first dimensions have the fastest changing indices... - S0 = sh[ 0 ]; - S1 = sh[ 1 ]; - S2 = sh[ 2 ]; - S3 = sh[ 3 ]; - dx0 = sx[ 0 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[0] ); - dx2 = sx[ 2 ] - ( S1*sx[1] ); - dx3 = sx[ 3 ] - ( S2*sx[2] ); // offset increment for outermost loop - dy0 = sy[ 0 ]; - dy1 = sy[ 1 ] - ( S0*sy[0] ); - dy2 = sy[ 2 ] - ( S1*sy[1] ); - dy3 = sy[ 3 ] - ( S2*sy[2] ); - dz0 = sz[ 0 ]; - dz1 = sz[ 1 ] - ( S0*sz[0] ); - dz2 = sz[ 2 ] - ( S1*sz[1] ); - dz3 = sz[ 3 ] - ( S2*sz[2] ); - } - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache accessors: - xget = x.accessors[ 0 ]; - yget = y.accessors[ 0 ]; - zset = z.accessors[ 1 ]; - - // Iterate over the ndarray dimensions... - for ( i3 = 0; i3 < S3; i3++ ) { - for ( i2 = 0; i2 < S2; i2++ ) { - for ( i1 = 0; i1 < S1; i1++ ) { - for ( i0 = 0; i0 < S0; i0++ ) { - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } -} - - -// EXPORTS // - -module.exports = binary4d; diff --git a/lib/4d_blocked.js b/lib/4d_blocked.js deleted file mode 100644 index 30c7e9a..0000000 --- a/lib/4d_blocked.js +++ /dev/null @@ -1,281 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-statements */ - -'use strict'; - -// MODULES // - -var loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' ); -var blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' ); - - -// MAIN // - -/** -* Applies a binary callback to elements in four-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Callback} fcn - binary callback -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 4, 2, 1 ]; -* var sy = [ 12, 4, 2, 1 ]; -* var sz = [ 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* blockedbinary4d( x, y, z, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function blockedbinary4d( x, y, z, fcn ) { - var bsize; - var xbuf; - var ybuf; - var zbuf; - var dx0; - var dx1; - var dx2; - var dx3; - var dy0; - var dy1; - var dy2; - var dy3; - var dz0; - var dz1; - var dz2; - var dz3; - var ox1; - var ox2; - var ox3; - var oy1; - var oy2; - var oy3; - var oz1; - var oz2; - var oz3; - var sh; - var s0; - var s1; - var s2; - var s3; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var j0; - var j1; - var j2; - var j3; - var o; - - // Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop... - - // Resolve the loop interchange order: - o = loopOrder( x.shape, x.strides, y.strides, z.strides ); - sh = o.sh; - sx = o.sx; - sy = o.sy; - sz = o.sz; - - // Determine the block size: - bsize = blockSize( x.dtype, y.dtype, z.dtype ); - - // Cache the indices of the first indexed elements in the respective ndarrays... - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache offset increments for the innermost loop... - dx0 = sx[0]; - dy0 = sy[0]; - dz0 = sz[0]; - - // Iterate over blocks... - for ( j3 = sh[3]; j3 > 0; ) { - if ( j3 < bsize ) { - s3 = j3; - j3 = 0; - } else { - s3 = bsize; - j3 -= bsize; - } - ox3 = ox + ( j3*sx[3] ); - oy3 = oy + ( j3*sy[3] ); - oz3 = oz + ( j3*sz[3] ); - for ( j2 = sh[2]; j2 > 0; ) { - if ( j2 < bsize ) { - s2 = j2; - j2 = 0; - } else { - s2 = bsize; - j2 -= bsize; - } - dx3 = sx[3] - ( s2*sx[2] ); - dy3 = sy[3] - ( s2*sy[2] ); - dz3 = sz[3] - ( s2*sz[2] ); - ox2 = ox3 + ( j2*sx[2] ); - oy2 = oy3 + ( j2*sy[2] ); - oz2 = oz3 + ( j2*sz[2] ); - for ( j1 = sh[1]; j1 > 0; ) { - if ( j1 < bsize ) { - s1 = j1; - j1 = 0; - } else { - s1 = bsize; - j1 -= bsize; - } - dx2 = sx[2] - ( s1*sx[1] ); - dy2 = sy[2] - ( s1*sy[1] ); - dz2 = sz[2] - ( s1*sz[1] ); - ox1 = ox2 + ( j1*sx[1] ); - oy1 = oy2 + ( j1*sy[1] ); - oz1 = oz2 + ( j1*sz[1] ); - for ( j0 = sh[0]; j0 > 0; ) { - if ( j0 < bsize ) { - s0 = j0; - j0 = 0; - } else { - s0 = bsize; - j0 -= bsize; - } - // Compute index offsets for the first input and output ndarray elements in the current block... - ix = ox1 + ( j0*sx[0] ); - iy = oy1 + ( j0*sy[0] ); - iz = oz1 + ( j0*sz[0] ); - - // Compute loop offset increments... - dx1 = sx[1] - ( s0*sx[0] ); - dy1 = sy[1] - ( s0*sy[0] ); - dz1 = sz[1] - ( s0*sz[0] ); - - // Iterate over the ndarray dimensions... - for ( i3 = 0; i3 < s3; i3++ ) { - for ( i2 = 0; i2 < s2; i2++ ) { - for ( i1 = 0; i1 < s1; i1++ ) { - for ( i0 = 0; i0 < s0; i0++ ) { - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - } - } - } - } -} - - -// EXPORTS // - -module.exports = blockedbinary4d; diff --git a/lib/4d_blocked_accessors.js b/lib/4d_blocked_accessors.js deleted file mode 100644 index f952b31..0000000 --- a/lib/4d_blocked_accessors.js +++ /dev/null @@ -1,297 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-len, max-statements */ - -'use strict'; - -// MODULES // - -var loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' ); -var blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' ); - - -// MAIN // - -/** -* Applies a binary callback to elements in four-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {Callback} fcn - binary callback -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 4, 2, 1 ]; -* var sy = [ 12, 4, 2, 1 ]; -* var sz = [ 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* blockedbinary4d( x, y, z, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function blockedbinary4d( x, y, z, fcn ) { - var bsize; - var xbuf; - var ybuf; - var zbuf; - var xget; - var yget; - var zset; - var dx0; - var dx1; - var dx2; - var dx3; - var dy0; - var dy1; - var dy2; - var dy3; - var dz0; - var dz1; - var dz2; - var dz3; - var ox1; - var ox2; - var ox3; - var oy1; - var oy2; - var oy3; - var oz1; - var oz2; - var oz3; - var sh; - var s0; - var s1; - var s2; - var s3; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var j0; - var j1; - var j2; - var j3; - var o; - - // Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop... - - // Resolve the loop interchange order: - o = loopOrder( x.shape, x.strides, y.strides, z.strides ); - sh = o.sh; - sx = o.sx; - sy = o.sy; - sz = o.sz; - - // Determine the block size: - bsize = blockSize( x.dtype, y.dtype, z.dtype ); - - // Cache the indices of the first indexed elements in the respective ndarrays... - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache offset increments for the innermost loop... - dx0 = sx[0]; - dy0 = sy[0]; - dz0 = sz[0]; - - // Cache accessors: - xget = x.accessors[0]; - yget = y.accessors[0]; - zset = z.accessors[1]; - - // Iterate over blocks... - for ( j3 = sh[3]; j3 > 0; ) { - if ( j3 < bsize ) { - s3 = j3; - j3 = 0; - } else { - s3 = bsize; - j3 -= bsize; - } - ox3 = ox + ( j3*sx[3] ); - oy3 = oy + ( j3*sy[3] ); - oz3 = oz + ( j3*sz[3] ); - for ( j2 = sh[2]; j2 > 0; ) { - if ( j2 < bsize ) { - s2 = j2; - j2 = 0; - } else { - s2 = bsize; - j2 -= bsize; - } - dx3 = sx[3] - ( s2*sx[2] ); - dy3 = sy[3] - ( s2*sy[2] ); - dz3 = sz[3] - ( s2*sz[2] ); - ox2 = ox3 + ( j2*sx[2] ); - oy2 = oy3 + ( j2*sy[2] ); - oz2 = oz3 + ( j2*sz[2] ); - for ( j1 = sh[1]; j1 > 0; ) { - if ( j1 < bsize ) { - s1 = j1; - j1 = 0; - } else { - s1 = bsize; - j1 -= bsize; - } - dx2 = sx[2] - ( s1*sx[1] ); - dy2 = sy[2] - ( s1*sy[1] ); - dz2 = sz[2] - ( s1*sz[1] ); - ox1 = ox2 + ( j1*sx[1] ); - oy1 = oy2 + ( j1*sy[1] ); - oz1 = oz2 + ( j1*sz[1] ); - for ( j0 = sh[0]; j0 > 0; ) { - if ( j0 < bsize ) { - s0 = j0; - j0 = 0; - } else { - s0 = bsize; - j0 -= bsize; - } - // Compute index offsets for the first input and output ndarray elements in the current block... - ix = ox1 + ( j0*sx[0] ); - iy = oy1 + ( j0*sy[0] ); - iz = oz1 + ( j0*sz[0] ); - - // Compute loop offset increments... - dx1 = sx[1] - ( s0*sx[0] ); - dy1 = sy[1] - ( s0*sy[0] ); - dz1 = sz[1] - ( s0*sz[0] ); - - // Iterate over the ndarray dimensions... - for ( i3 = 0; i3 < s3; i3++ ) { - for ( i2 = 0; i2 < s2; i2++ ) { - for ( i1 = 0; i1 < s1; i1++ ) { - for ( i0 = 0; i0 < s0; i0++ ) { - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - } - } - } - } -} - - -// EXPORTS // - -module.exports = blockedbinary4d; diff --git a/lib/5d.js b/lib/5d.js deleted file mode 100644 index bb0c9a4..0000000 --- a/lib/5d.js +++ /dev/null @@ -1,242 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-statements */ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in five-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* binary5d( x, y, z, true, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary5d( x, y, z, isRowMajor, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var sh; - var S0; - var S1; - var S2; - var S3; - var S4; - var sx; - var sy; - var sz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments... - sh = x.shape; - sx = x.strides; - sy = y.strides; - sz = z.strides; - if ( isRowMajor ) { - // For row-major ndarrays, the last dimensions have the fastest changing indices... - S0 = sh[ 4 ]; - S1 = sh[ 3 ]; - S2 = sh[ 2 ]; - S3 = sh[ 1 ]; - S4 = sh[ 0 ]; - dx0 = sx[ 4 ]; // offset increment for innermost loop - dx1 = sx[ 3 ] - ( S0*sx[4] ); - dx2 = sx[ 2 ] - ( S1*sx[3] ); - dx3 = sx[ 1 ] - ( S2*sx[2] ); - dx4 = sx[ 0 ] - ( S3*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 4 ]; - dy1 = sy[ 3 ] - ( S0*sy[4] ); - dy2 = sy[ 2 ] - ( S1*sy[3] ); - dy3 = sy[ 1 ] - ( S2*sy[2] ); - dy4 = sy[ 0 ] - ( S3*sy[1] ); - dz0 = sz[ 4 ]; - dz1 = sz[ 3 ] - ( S0*sz[4] ); - dz2 = sz[ 2 ] - ( S1*sz[3] ); - dz3 = sz[ 1 ] - ( S2*sz[2] ); - dz4 = sz[ 0 ] - ( S3*sz[1] ); - } else { // order === 'column-major' - // For column-major ndarrays, the first dimensions have the fastest changing indices... - S0 = sh[ 0 ]; - S1 = sh[ 1 ]; - S2 = sh[ 2 ]; - S3 = sh[ 3 ]; - S4 = sh[ 4 ]; - dx0 = sx[ 0 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[0] ); - dx2 = sx[ 2 ] - ( S1*sx[1] ); - dx3 = sx[ 3 ] - ( S2*sx[2] ); - dx4 = sx[ 4 ] - ( S3*sx[3] ); // offset increment for outermost loop - dy0 = sy[ 0 ]; - dy1 = sy[ 1 ] - ( S0*sy[0] ); - dy2 = sy[ 2 ] - ( S1*sy[1] ); - dy3 = sy[ 3 ] - ( S2*sy[2] ); - dy4 = sy[ 4 ] - ( S3*sy[3] ); - dz0 = sz[ 0 ]; - dz1 = sz[ 1 ] - ( S0*sz[0] ); - dz2 = sz[ 2 ] - ( S1*sz[1] ); - dz3 = sz[ 3 ] - ( S2*sz[2] ); - dz4 = sz[ 4 ] - ( S3*sz[3] ); - } - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Iterate over the ndarray dimensions... - for ( i4 = 0; i4 < S4; i4++ ) { - for ( i3 = 0; i3 < S3; i3++ ) { - for ( i2 = 0; i2 < S2; i2++ ) { - for ( i1 = 0; i1 < S1; i1++ ) { - for ( i0 = 0; i0 < S0; i0++ ) { - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } -} - - -// EXPORTS // - -module.exports = binary5d; diff --git a/lib/5d_accessors.js b/lib/5d_accessors.js deleted file mode 100644 index 6fca3ba..0000000 --- a/lib/5d_accessors.js +++ /dev/null @@ -1,258 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-len, max-statements */ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in five-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* binary5d( x, y, z, true, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary5d( x, y, z, isRowMajor, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var xget; - var yget; - var zset; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var sh; - var S0; - var S1; - var S2; - var S3; - var S4; - var sx; - var sy; - var sz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments... - sh = x.shape; - sx = x.strides; - sy = y.strides; - sz = z.strides; - if ( isRowMajor ) { - // For row-major ndarrays, the last dimensions have the fastest changing indices... - S0 = sh[ 4 ]; - S1 = sh[ 3 ]; - S2 = sh[ 2 ]; - S3 = sh[ 1 ]; - S4 = sh[ 0 ]; - dx0 = sx[ 4 ]; // offset increment for innermost loop - dx1 = sx[ 3 ] - ( S0*sx[4] ); - dx2 = sx[ 2 ] - ( S1*sx[3] ); - dx3 = sx[ 1 ] - ( S2*sx[2] ); - dx4 = sx[ 0 ] - ( S3*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 4 ]; - dy1 = sy[ 3 ] - ( S0*sy[4] ); - dy2 = sy[ 2 ] - ( S1*sy[3] ); - dy3 = sy[ 1 ] - ( S2*sy[2] ); - dy4 = sy[ 0 ] - ( S3*sy[1] ); - dz0 = sz[ 4 ]; - dz1 = sz[ 3 ] - ( S0*sz[4] ); - dz2 = sz[ 2 ] - ( S1*sz[3] ); - dz3 = sz[ 1 ] - ( S2*sz[2] ); - dz4 = sz[ 0 ] - ( S3*sz[1] ); - } else { // order === 'column-major' - // For column-major ndarrays, the first dimensions have the fastest changing indices... - S0 = sh[ 0 ]; - S1 = sh[ 1 ]; - S2 = sh[ 2 ]; - S3 = sh[ 3 ]; - S4 = sh[ 4 ]; - dx0 = sx[ 0 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[0] ); - dx2 = sx[ 2 ] - ( S1*sx[1] ); - dx3 = sx[ 3 ] - ( S2*sx[2] ); - dx4 = sx[ 4 ] - ( S3*sx[3] ); // offset increment for outermost loop - dy0 = sy[ 0 ]; - dy1 = sy[ 1 ] - ( S0*sy[0] ); - dy2 = sy[ 2 ] - ( S1*sy[1] ); - dy3 = sy[ 3 ] - ( S2*sy[2] ); - dy4 = sy[ 4 ] - ( S3*sy[3] ); - dz0 = sz[ 0 ]; - dz1 = sz[ 1 ] - ( S0*sz[0] ); - dz2 = sz[ 2 ] - ( S1*sz[1] ); - dz3 = sz[ 3 ] - ( S2*sz[2] ); - dz4 = sz[ 4 ] - ( S3*sz[3] ); - } - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache accessors: - xget = x.accessors[ 0 ]; - yget = y.accessors[ 0 ]; - zset = z.accessors[ 1 ]; - - // Iterate over the ndarray dimensions... - for ( i4 = 0; i4 < S4; i4++ ) { - for ( i3 = 0; i3 < S3; i3++ ) { - for ( i2 = 0; i2 < S2; i2++ ) { - for ( i1 = 0; i1 < S1; i1++ ) { - for ( i0 = 0; i0 < S0; i0++ ) { - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } -} - - -// EXPORTS // - -module.exports = binary5d; diff --git a/lib/5d_blocked.js b/lib/5d_blocked.js deleted file mode 100644 index 3c0f52b..0000000 --- a/lib/5d_blocked.js +++ /dev/null @@ -1,310 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-statements, max-len */ - -'use strict'; - -// MODULES // - -var loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' ); -var blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' ); - - -// MAIN // - -/** -* Applies a binary callback to elements in five-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Callback} fcn - binary callback -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* blockedbinary5d( x, y, z, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function blockedbinary5d( x, y, z, fcn ) { - var bsize; - var xbuf; - var ybuf; - var zbuf; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var ox1; - var ox2; - var ox3; - var ox4; - var oy1; - var oy2; - var oy3; - var oy4; - var oz1; - var oz2; - var oz3; - var oz4; - var sh; - var s0; - var s1; - var s2; - var s3; - var s4; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var j0; - var j1; - var j2; - var j3; - var j4; - var o; - - // Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop... - - // Resolve the loop interchange order: - o = loopOrder( x.shape, x.strides, y.strides, z.strides ); - sh = o.sh; - sx = o.sx; - sy = o.sy; - sz = o.sz; - - // Determine the block size: - bsize = blockSize( x.dtype, y.dtype, z.dtype ); - - // Cache the indices of the first indexed elements in the respective ndarrays... - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache offset increments for the innermost loop... - dx0 = sx[0]; - dy0 = sy[0]; - dz0 = sz[0]; - - // Iterate over blocks... - for ( j4 = sh[4]; j4 > 0; ) { - if ( j4 < bsize ) { - s4 = j4; - j4 = 0; - } else { - s4 = bsize; - j4 -= bsize; - } - ox4 = ox + ( j4*sx[4] ); - oy4 = oy + ( j4*sy[4] ); - oz4 = oz + ( j4*sz[4] ); - for ( j3 = sh[3]; j3 > 0; ) { - if ( j3 < bsize ) { - s3 = j3; - j3 = 0; - } else { - s3 = bsize; - j3 -= bsize; - } - dx4 = sx[4] - ( s3*sx[3] ); - dy4 = sy[4] - ( s3*sy[3] ); - dz4 = sz[4] - ( s3*sz[3] ); - ox3 = ox4 + ( j3*sx[3] ); - oy3 = oy4 + ( j3*sy[3] ); - oz3 = oz4 + ( j3*sz[3] ); - for ( j2 = sh[2]; j2 > 0; ) { - if ( j2 < bsize ) { - s2 = j2; - j2 = 0; - } else { - s2 = bsize; - j2 -= bsize; - } - dx3 = sx[3] - ( s2*sx[2] ); - dy3 = sy[3] - ( s2*sy[2] ); - dz3 = sz[3] - ( s2*sz[2] ); - ox2 = ox3 + ( j2*sx[2] ); - oy2 = oy3 + ( j2*sy[2] ); - oz2 = oz3 + ( j2*sz[2] ); - for ( j1 = sh[1]; j1 > 0; ) { - if ( j1 < bsize ) { - s1 = j1; - j1 = 0; - } else { - s1 = bsize; - j1 -= bsize; - } - dx2 = sx[2] - ( s1*sx[1] ); - dy2 = sy[2] - ( s1*sy[1] ); - dz2 = sz[2] - ( s1*sz[1] ); - ox1 = ox2 + ( j1*sx[1] ); - oy1 = oy2 + ( j1*sy[1] ); - oz1 = oz2 + ( j1*sz[1] ); - for ( j0 = sh[0]; j0 > 0; ) { - if ( j0 < bsize ) { - s0 = j0; - j0 = 0; - } else { - s0 = bsize; - j0 -= bsize; - } - // Compute index offsets for the first input and output ndarray elements in the current block... - ix = ox1 + ( j0*sx[0] ); - iy = oy1 + ( j0*sy[0] ); - iz = oz1 + ( j0*sz[0] ); - - // Compute loop offset increments... - dx1 = sx[1] - ( s0*sx[0] ); - dy1 = sy[1] - ( s0*sy[0] ); - dz1 = sz[1] - ( s0*sz[0] ); - - // Iterate over the ndarray dimensions... - for ( i4 = 0; i4 < s4; i4++ ) { - for ( i3 = 0; i3 < s3; i3++ ) { - for ( i2 = 0; i2 < s2; i2++ ) { - for ( i1 = 0; i1 < s1; i1++ ) { - for ( i0 = 0; i0 < s0; i0++ ) { - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - } - } - } - } - } -} - - -// EXPORTS // - -module.exports = blockedbinary5d; diff --git a/lib/5d_blocked_accessors.js b/lib/5d_blocked_accessors.js deleted file mode 100644 index 793591a..0000000 --- a/lib/5d_blocked_accessors.js +++ /dev/null @@ -1,326 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-len, max-statements */ - -'use strict'; - -// MODULES // - -var loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' ); -var blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' ); - - -// MAIN // - -/** -* Applies a binary callback to elements in five-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {Callback} fcn - binary callback -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* blockedbinary5d( x, y, z, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function blockedbinary5d( x, y, z, fcn ) { - var bsize; - var xbuf; - var ybuf; - var zbuf; - var xget; - var yget; - var zset; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var ox1; - var ox2; - var ox3; - var ox4; - var oy1; - var oy2; - var oy3; - var oy4; - var oz1; - var oz2; - var oz3; - var oz4; - var sh; - var s0; - var s1; - var s2; - var s3; - var s4; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var j0; - var j1; - var j2; - var j3; - var j4; - var o; - - // Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop... - - // Resolve the loop interchange order: - o = loopOrder( x.shape, x.strides, y.strides, z.strides ); - sh = o.sh; - sx = o.sx; - sy = o.sy; - sz = o.sz; - - // Determine the block size: - bsize = blockSize( x.dtype, y.dtype, z.dtype ); - - // Cache the indices of the first indexed elements in the respective ndarrays... - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache offset increments for the innermost loop... - dx0 = sx[0]; - dy0 = sy[0]; - dz0 = sz[0]; - - // Cache accessors: - xget = x.accessors[0]; - yget = y.accessors[0]; - zset = z.accessors[1]; - - // Iterate over blocks... - for ( j4 = sh[4]; j4 > 0; ) { - if ( j4 < bsize ) { - s4 = j4; - j4 = 0; - } else { - s4 = bsize; - j4 -= bsize; - } - ox4 = ox + ( j4*sx[4] ); - oy4 = oy + ( j4*sy[4] ); - oz4 = oz + ( j4*sz[4] ); - for ( j3 = sh[3]; j3 > 0; ) { - if ( j3 < bsize ) { - s3 = j3; - j3 = 0; - } else { - s3 = bsize; - j3 -= bsize; - } - dx4 = sx[4] - ( s3*sx[3] ); - dy4 = sy[4] - ( s3*sy[3] ); - dz4 = sz[4] - ( s3*sz[3] ); - ox3 = ox4 + ( j3*sx[3] ); - oy3 = oy4 + ( j3*sy[3] ); - oz3 = oz4 + ( j3*sz[3] ); - for ( j2 = sh[2]; j2 > 0; ) { - if ( j2 < bsize ) { - s2 = j2; - j2 = 0; - } else { - s2 = bsize; - j2 -= bsize; - } - dx3 = sx[3] - ( s2*sx[2] ); - dy3 = sy[3] - ( s2*sy[2] ); - dz3 = sz[3] - ( s2*sz[2] ); - ox2 = ox3 + ( j2*sx[2] ); - oy2 = oy3 + ( j2*sy[2] ); - oz2 = oz3 + ( j2*sz[2] ); - for ( j1 = sh[1]; j1 > 0; ) { - if ( j1 < bsize ) { - s1 = j1; - j1 = 0; - } else { - s1 = bsize; - j1 -= bsize; - } - dx2 = sx[2] - ( s1*sx[1] ); - dy2 = sy[2] - ( s1*sy[1] ); - dz2 = sz[2] - ( s1*sz[1] ); - ox1 = ox2 + ( j1*sx[1] ); - oy1 = oy2 + ( j1*sy[1] ); - oz1 = oz2 + ( j1*sz[1] ); - for ( j0 = sh[0]; j0 > 0; ) { - if ( j0 < bsize ) { - s0 = j0; - j0 = 0; - } else { - s0 = bsize; - j0 -= bsize; - } - // Compute index offsets for the first input and output ndarray elements in the current block... - ix = ox1 + ( j0*sx[0] ); - iy = oy1 + ( j0*sy[0] ); - iz = oz1 + ( j0*sz[0] ); - - // Compute loop offset increments... - dx1 = sx[1] - ( s0*sx[0] ); - dy1 = sy[1] - ( s0*sy[0] ); - dz1 = sz[1] - ( s0*sz[0] ); - - // Iterate over the ndarray dimensions... - for ( i4 = 0; i4 < s4; i4++ ) { - for ( i3 = 0; i3 < s3; i3++ ) { - for ( i2 = 0; i2 < s2; i2++ ) { - for ( i1 = 0; i1 < s1; i1++ ) { - for ( i0 = 0; i0 < s0; i0++ ) { - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - } - } - } - } - } -} - - -// EXPORTS // - -module.exports = blockedbinary5d; diff --git a/lib/6d.js b/lib/6d.js deleted file mode 100644 index bc3c8d7..0000000 --- a/lib/6d.js +++ /dev/null @@ -1,260 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-statements */ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in six-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* binary6d( x, y, z, true, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary6d( x, y, z, isRowMajor, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var sh; - var S0; - var S1; - var S2; - var S3; - var S4; - var S5; - var sx; - var sy; - var sz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments... - sh = x.shape; - sx = x.strides; - sy = y.strides; - sz = z.strides; - if ( isRowMajor ) { - // For row-major ndarrays, the last dimensions have the fastest changing indices... - S0 = sh[ 5 ]; - S1 = sh[ 4 ]; - S2 = sh[ 3 ]; - S3 = sh[ 2 ]; - S4 = sh[ 1 ]; - S5 = sh[ 0 ]; - dx0 = sx[ 5 ]; // offset increment for innermost loop - dx1 = sx[ 4 ] - ( S0*sx[5] ); - dx2 = sx[ 3 ] - ( S1*sx[4] ); - dx3 = sx[ 2 ] - ( S2*sx[3] ); - dx4 = sx[ 1 ] - ( S3*sx[2] ); - dx5 = sx[ 0 ] - ( S4*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 5 ]; - dy1 = sy[ 4 ] - ( S0*sy[5] ); - dy2 = sy[ 3 ] - ( S1*sy[4] ); - dy3 = sy[ 2 ] - ( S2*sy[3] ); - dy4 = sy[ 1 ] - ( S3*sy[2] ); - dy5 = sy[ 0 ] - ( S4*sy[1] ); - dz0 = sz[ 5 ]; - dz1 = sz[ 4 ] - ( S0*sz[5] ); - dz2 = sz[ 3 ] - ( S1*sz[4] ); - dz3 = sz[ 2 ] - ( S2*sz[3] ); - dz4 = sz[ 1 ] - ( S3*sz[2] ); - dz5 = sz[ 0 ] - ( S4*sz[1] ); - } else { // order === 'column-major' - // For column-major ndarrays, the first dimensions have the fastest changing indices... - S0 = sh[ 0 ]; - S1 = sh[ 1 ]; - S2 = sh[ 2 ]; - S3 = sh[ 3 ]; - S4 = sh[ 4 ]; - S5 = sh[ 5 ]; - dx0 = sx[ 0 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[0] ); - dx2 = sx[ 2 ] - ( S1*sx[1] ); - dx3 = sx[ 3 ] - ( S2*sx[2] ); - dx4 = sx[ 4 ] - ( S3*sx[3] ); - dx5 = sx[ 5 ] - ( S4*sx[4] ); // offset increment for outermost loop - dy0 = sy[ 0 ]; - dy1 = sy[ 1 ] - ( S0*sy[0] ); - dy2 = sy[ 2 ] - ( S1*sy[1] ); - dy3 = sy[ 3 ] - ( S2*sy[2] ); - dy4 = sy[ 4 ] - ( S3*sy[3] ); - dy5 = sy[ 5 ] - ( S4*sy[4] ); - dz0 = sz[ 0 ]; - dz1 = sz[ 1 ] - ( S0*sz[0] ); - dz2 = sz[ 2 ] - ( S1*sz[1] ); - dz3 = sz[ 3 ] - ( S2*sz[2] ); - dz4 = sz[ 4 ] - ( S3*sz[3] ); - dz5 = sz[ 5 ] - ( S4*sz[4] ); - } - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Iterate over the ndarray dimensions... - for ( i5 = 0; i5 < S5; i5++ ) { - for ( i4 = 0; i4 < S4; i4++ ) { - for ( i3 = 0; i3 < S3; i3++ ) { - for ( i2 = 0; i2 < S2; i2++ ) { - for ( i1 = 0; i1 < S1; i1++ ) { - for ( i0 = 0; i0 < S0; i0++ ) { - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } -} - - -// EXPORTS // - -module.exports = binary6d; diff --git a/lib/6d_accessors.js b/lib/6d_accessors.js deleted file mode 100644 index c6c241c..0000000 --- a/lib/6d_accessors.js +++ /dev/null @@ -1,276 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-len, max-statements */ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in six-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* binary6d( x, y, z, true, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary6d( x, y, z, isRowMajor, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var xget; - var yget; - var zset; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var sh; - var S0; - var S1; - var S2; - var S3; - var S4; - var S5; - var sx; - var sy; - var sz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments... - sh = x.shape; - sx = x.strides; - sy = y.strides; - sz = z.strides; - if ( isRowMajor ) { - // For row-major ndarrays, the last dimensions have the fastest changing indices... - S0 = sh[ 5 ]; - S1 = sh[ 4 ]; - S2 = sh[ 3 ]; - S3 = sh[ 2 ]; - S4 = sh[ 1 ]; - S5 = sh[ 0 ]; - dx0 = sx[ 5 ]; // offset increment for innermost loop - dx1 = sx[ 4 ] - ( S0*sx[5] ); - dx2 = sx[ 3 ] - ( S1*sx[4] ); - dx3 = sx[ 2 ] - ( S2*sx[3] ); - dx4 = sx[ 1 ] - ( S3*sx[2] ); - dx5 = sx[ 0 ] - ( S4*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 5 ]; - dy1 = sy[ 4 ] - ( S0*sy[5] ); - dy2 = sy[ 3 ] - ( S1*sy[4] ); - dy3 = sy[ 2 ] - ( S2*sy[3] ); - dy4 = sy[ 1 ] - ( S3*sy[2] ); - dy5 = sy[ 0 ] - ( S4*sy[1] ); - dz0 = sz[ 5 ]; - dz1 = sz[ 4 ] - ( S0*sz[5] ); - dz2 = sz[ 3 ] - ( S1*sz[4] ); - dz3 = sz[ 2 ] - ( S2*sz[3] ); - dz4 = sz[ 1 ] - ( S3*sz[2] ); - dz5 = sz[ 0 ] - ( S4*sz[1] ); - } else { // order === 'column-major' - // For column-major ndarrays, the first dimensions have the fastest changing indices... - S0 = sh[ 0 ]; - S1 = sh[ 1 ]; - S2 = sh[ 2 ]; - S3 = sh[ 3 ]; - S4 = sh[ 4 ]; - S5 = sh[ 5 ]; - dx0 = sx[ 0 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[0] ); - dx2 = sx[ 2 ] - ( S1*sx[1] ); - dx3 = sx[ 3 ] - ( S2*sx[2] ); - dx4 = sx[ 4 ] - ( S3*sx[3] ); - dx5 = sx[ 5 ] - ( S4*sx[4] ); // offset increment for outermost loop - dy0 = sy[ 0 ]; - dy1 = sy[ 1 ] - ( S0*sy[0] ); - dy2 = sy[ 2 ] - ( S1*sy[1] ); - dy3 = sy[ 3 ] - ( S2*sy[2] ); - dy4 = sy[ 4 ] - ( S3*sy[3] ); - dy5 = sy[ 5 ] - ( S4*sy[4] ); - dz0 = sz[ 0 ]; - dz1 = sz[ 1 ] - ( S0*sz[0] ); - dz2 = sz[ 2 ] - ( S1*sz[1] ); - dz3 = sz[ 3 ] - ( S2*sz[2] ); - dz4 = sz[ 4 ] - ( S3*sz[3] ); - dz5 = sz[ 5 ] - ( S4*sz[4] ); - } - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache accessors: - xget = x.accessors[ 0 ]; - yget = y.accessors[ 0 ]; - zset = z.accessors[ 1 ]; - - // Iterate over the ndarray dimensions... - for ( i5 = 0; i5 < S5; i5++ ) { - for ( i4 = 0; i4 < S4; i4++ ) { - for ( i3 = 0; i3 < S3; i3++ ) { - for ( i2 = 0; i2 < S2; i2++ ) { - for ( i1 = 0; i1 < S1; i1++ ) { - for ( i0 = 0; i0 < S0; i0++ ) { - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } -} - - -// EXPORTS // - -module.exports = binary6d; diff --git a/lib/6d_blocked.js b/lib/6d_blocked.js deleted file mode 100644 index ed7bcbb..0000000 --- a/lib/6d_blocked.js +++ /dev/null @@ -1,339 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */ - -'use strict'; - -// MODULES // - -var loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' ); -var blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' ); - - -// MAIN // - -/** -* Applies a binary callback to elements in six-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Callback} fcn - binary callback -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* blockedbinary6d( x, y, z, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function blockedbinary6d( x, y, z, fcn ) { - var bsize; - var xbuf; - var ybuf; - var zbuf; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var ox1; - var ox2; - var ox3; - var ox4; - var ox5; - var oy1; - var oy2; - var oy3; - var oy4; - var oy5; - var oz1; - var oz2; - var oz3; - var oz4; - var oz5; - var sh; - var s0; - var s1; - var s2; - var s3; - var s4; - var s5; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - var j0; - var j1; - var j2; - var j3; - var j4; - var j5; - var o; - - // Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop... - - // Resolve the loop interchange order: - o = loopOrder( x.shape, x.strides, y.strides, z.strides ); - sh = o.sh; - sx = o.sx; - sy = o.sy; - sz = o.sz; - - // Determine the block size: - bsize = blockSize( x.dtype, y.dtype, z.dtype ); - - // Cache the indices of the first indexed elements in the respective ndarrays... - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache offset increments for the innermost loop... - dx0 = sx[0]; - dy0 = sy[0]; - dz0 = sz[0]; - - // Iterate over blocks... - for ( j5 = sh[5]; j5 > 0; ) { - if ( j5 < bsize ) { - s5 = j5; - j5 = 0; - } else { - s5 = bsize; - j5 -= bsize; - } - ox5 = ox + ( j5*sx[5] ); - oy5 = oy + ( j5*sy[5] ); - oz5 = oz + ( j5*sz[5] ); - for ( j4 = sh[4]; j4 > 0; ) { - if ( j4 < bsize ) { - s4 = j4; - j4 = 0; - } else { - s4 = bsize; - j4 -= bsize; - } - dx5 = sx[5] - ( s4*sx[4] ); - dy5 = sy[5] - ( s4*sy[4] ); - dz5 = sz[5] - ( s4*sz[4] ); - ox4 = ox5 + ( j4*sx[4] ); - oy4 = oy5 + ( j4*sy[4] ); - oz4 = oz5 + ( j4*sz[4] ); - for ( j3 = sh[3]; j3 > 0; ) { - if ( j3 < bsize ) { - s3 = j3; - j3 = 0; - } else { - s3 = bsize; - j3 -= bsize; - } - dx4 = sx[4] - ( s3*sx[3] ); - dy4 = sy[4] - ( s3*sy[3] ); - dz4 = sz[4] - ( s3*sz[3] ); - ox3 = ox4 + ( j3*sx[3] ); - oy3 = oy4 + ( j3*sy[3] ); - oz3 = oz4 + ( j3*sz[3] ); - for ( j2 = sh[2]; j2 > 0; ) { - if ( j2 < bsize ) { - s2 = j2; - j2 = 0; - } else { - s2 = bsize; - j2 -= bsize; - } - dx3 = sx[3] - ( s2*sx[2] ); - dy3 = sy[3] - ( s2*sy[2] ); - dz3 = sz[3] - ( s2*sz[2] ); - ox2 = ox3 + ( j2*sx[2] ); - oy2 = oy3 + ( j2*sy[2] ); - oz2 = oz3 + ( j2*sz[2] ); - for ( j1 = sh[1]; j1 > 0; ) { - if ( j1 < bsize ) { - s1 = j1; - j1 = 0; - } else { - s1 = bsize; - j1 -= bsize; - } - dx2 = sx[2] - ( s1*sx[1] ); - dy2 = sy[2] - ( s1*sy[1] ); - dz2 = sz[2] - ( s1*sz[1] ); - ox1 = ox2 + ( j1*sx[1] ); - oy1 = oy2 + ( j1*sy[1] ); - oz1 = oz2 + ( j1*sz[1] ); - for ( j0 = sh[0]; j0 > 0; ) { - if ( j0 < bsize ) { - s0 = j0; - j0 = 0; - } else { - s0 = bsize; - j0 -= bsize; - } - // Compute index offsets for the first input and output ndarray elements in the current block... - ix = ox1 + ( j0*sx[0] ); - iy = oy1 + ( j0*sy[0] ); - iz = oz1 + ( j0*sz[0] ); - - // Compute loop offset increments... - dx1 = sx[1] - ( s0*sx[0] ); - dy1 = sy[1] - ( s0*sy[0] ); - dz1 = sz[1] - ( s0*sz[0] ); - - // Iterate over the ndarray dimensions... - for ( i5 = 0; i5 < s5; i5++ ) { - for ( i4 = 0; i4 < s4; i4++ ) { - for ( i3 = 0; i3 < s3; i3++ ) { - for ( i2 = 0; i2 < s2; i2++ ) { - for ( i1 = 0; i1 < s1; i1++ ) { - for ( i0 = 0; i0 < s0; i0++ ) { - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } - } - } - } - } - } - } -} - - -// EXPORTS // - -module.exports = blockedbinary6d; diff --git a/lib/6d_blocked_accessors.js b/lib/6d_blocked_accessors.js deleted file mode 100644 index 626ba3a..0000000 --- a/lib/6d_blocked_accessors.js +++ /dev/null @@ -1,355 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */ - -'use strict'; - -// MODULES // - -var loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' ); -var blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' ); - - -// MAIN // - -/** -* Applies a binary callback to elements in six-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {Callback} fcn - binary callback -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* blockedbinary6d( x, y, z, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function blockedbinary6d( x, y, z, fcn ) { - var bsize; - var xbuf; - var ybuf; - var zbuf; - var xget; - var yget; - var zset; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var ox1; - var ox2; - var ox3; - var ox4; - var ox5; - var oy1; - var oy2; - var oy3; - var oy4; - var oy5; - var oz1; - var oz2; - var oz3; - var oz4; - var oz5; - var sh; - var s0; - var s1; - var s2; - var s3; - var s4; - var s5; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - var j0; - var j1; - var j2; - var j3; - var j4; - var j5; - var o; - - // Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop... - - // Resolve the loop interchange order: - o = loopOrder( x.shape, x.strides, y.strides, z.strides ); - sh = o.sh; - sx = o.sx; - sy = o.sy; - sz = o.sz; - - // Determine the block size: - bsize = blockSize( x.dtype, y.dtype, z.dtype ); - - // Cache the indices of the first indexed elements in the respective ndarrays... - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache offset increments for the innermost loop... - dx0 = sx[0]; - dy0 = sy[0]; - dz0 = sz[0]; - - // Cache accessors: - xget = x.accessors[0]; - yget = y.accessors[0]; - zset = z.accessors[1]; - - // Iterate over blocks... - for ( j5 = sh[5]; j5 > 0; ) { - if ( j5 < bsize ) { - s5 = j5; - j5 = 0; - } else { - s5 = bsize; - j5 -= bsize; - } - ox5 = ox + ( j5*sx[5] ); - oy5 = oy + ( j5*sy[5] ); - oz5 = oz + ( j5*sz[5] ); - for ( j4 = sh[4]; j4 > 0; ) { - if ( j4 < bsize ) { - s4 = j4; - j4 = 0; - } else { - s4 = bsize; - j4 -= bsize; - } - dx5 = sx[5] - ( s4*sx[4] ); - dy5 = sy[5] - ( s4*sy[4] ); - dz5 = sz[5] - ( s4*sz[4] ); - ox4 = ox5 + ( j4*sx[4] ); - oy4 = oy5 + ( j4*sy[4] ); - oz4 = oz5 + ( j4*sz[4] ); - for ( j3 = sh[3]; j3 > 0; ) { - if ( j3 < bsize ) { - s3 = j3; - j3 = 0; - } else { - s3 = bsize; - j3 -= bsize; - } - dx4 = sx[4] - ( s3*sx[3] ); - dy4 = sy[4] - ( s3*sy[3] ); - dz4 = sz[4] - ( s3*sz[3] ); - ox3 = ox4 + ( j3*sx[3] ); - oy3 = oy4 + ( j3*sy[3] ); - oz3 = oz4 + ( j3*sz[3] ); - for ( j2 = sh[2]; j2 > 0; ) { - if ( j2 < bsize ) { - s2 = j2; - j2 = 0; - } else { - s2 = bsize; - j2 -= bsize; - } - dx3 = sx[3] - ( s2*sx[2] ); - dy3 = sy[3] - ( s2*sy[2] ); - dz3 = sz[3] - ( s2*sz[2] ); - ox2 = ox3 + ( j2*sx[2] ); - oy2 = oy3 + ( j2*sy[2] ); - oz2 = oz3 + ( j2*sz[2] ); - for ( j1 = sh[1]; j1 > 0; ) { - if ( j1 < bsize ) { - s1 = j1; - j1 = 0; - } else { - s1 = bsize; - j1 -= bsize; - } - dx2 = sx[2] - ( s1*sx[1] ); - dy2 = sy[2] - ( s1*sy[1] ); - dz2 = sz[2] - ( s1*sz[1] ); - ox1 = ox2 + ( j1*sx[1] ); - oy1 = oy2 + ( j1*sy[1] ); - oz1 = oz2 + ( j1*sz[1] ); - for ( j0 = sh[0]; j0 > 0; ) { - if ( j0 < bsize ) { - s0 = j0; - j0 = 0; - } else { - s0 = bsize; - j0 -= bsize; - } - // Compute index offsets for the first input and output ndarray elements in the current block... - ix = ox1 + ( j0*sx[0] ); - iy = oy1 + ( j0*sy[0] ); - iz = oz1 + ( j0*sz[0] ); - - // Compute loop offset increments... - dx1 = sx[1] - ( s0*sx[0] ); - dy1 = sy[1] - ( s0*sy[0] ); - dz1 = sz[1] - ( s0*sz[0] ); - - // Iterate over the ndarray dimensions... - for ( i5 = 0; i5 < s5; i5++ ) { - for ( i4 = 0; i4 < s4; i4++ ) { - for ( i3 = 0; i3 < s3; i3++ ) { - for ( i2 = 0; i2 < s2; i2++ ) { - for ( i1 = 0; i1 < s1; i1++ ) { - for ( i0 = 0; i0 < s0; i0++ ) { - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } - } - } - } - } - } - } -} - - -// EXPORTS // - -module.exports = blockedbinary6d; diff --git a/lib/7d.js b/lib/7d.js deleted file mode 100644 index 1950e44..0000000 --- a/lib/7d.js +++ /dev/null @@ -1,278 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-statements */ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in seven-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* binary7d( x, y, z, true, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary7d( x, y, z, isRowMajor, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dx6; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dy6; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var dz6; - var sh; - var S0; - var S1; - var S2; - var S3; - var S4; - var S5; - var S6; - var sx; - var sy; - var sz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - var i6; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments... - sh = x.shape; - sx = x.strides; - sy = y.strides; - sz = z.strides; - if ( isRowMajor ) { - // For row-major ndarrays, the last dimensions have the fastest changing indices... - S0 = sh[ 6 ]; - S1 = sh[ 5 ]; - S2 = sh[ 4 ]; - S3 = sh[ 3 ]; - S4 = sh[ 2 ]; - S5 = sh[ 1 ]; - S6 = sh[ 0 ]; - dx0 = sx[ 6 ]; // offset increment for innermost loop - dx1 = sx[ 5 ] - ( S0*sx[6] ); - dx2 = sx[ 4 ] - ( S1*sx[5] ); - dx3 = sx[ 3 ] - ( S2*sx[4] ); - dx4 = sx[ 2 ] - ( S3*sx[3] ); - dx5 = sx[ 1 ] - ( S4*sx[2] ); - dx6 = sx[ 0 ] - ( S5*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 6 ]; - dy1 = sy[ 5 ] - ( S0*sy[6] ); - dy2 = sy[ 4 ] - ( S1*sy[5] ); - dy3 = sy[ 3 ] - ( S2*sy[4] ); - dy4 = sy[ 2 ] - ( S3*sy[3] ); - dy5 = sy[ 1 ] - ( S4*sy[2] ); - dy6 = sy[ 0 ] - ( S5*sy[1] ); - dz0 = sz[ 6 ]; - dz1 = sz[ 5 ] - ( S0*sz[6] ); - dz2 = sz[ 4 ] - ( S1*sz[5] ); - dz3 = sz[ 3 ] - ( S2*sz[4] ); - dz4 = sz[ 2 ] - ( S3*sz[3] ); - dz5 = sz[ 1 ] - ( S4*sz[2] ); - dz6 = sz[ 0 ] - ( S5*sz[1] ); - } else { // order === 'column-major' - // For column-major ndarrays, the first dimensions have the fastest changing indices... - S0 = sh[ 0 ]; - S1 = sh[ 1 ]; - S2 = sh[ 2 ]; - S3 = sh[ 3 ]; - S4 = sh[ 4 ]; - S5 = sh[ 5 ]; - S6 = sh[ 6 ]; - dx0 = sx[ 0 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[0] ); - dx2 = sx[ 2 ] - ( S1*sx[1] ); - dx3 = sx[ 3 ] - ( S2*sx[2] ); - dx4 = sx[ 4 ] - ( S3*sx[3] ); - dx5 = sx[ 5 ] - ( S4*sx[4] ); - dx6 = sx[ 6 ] - ( S5*sx[5] ); // offset increment for outermost loop - dy0 = sy[ 0 ]; - dy1 = sy[ 1 ] - ( S0*sy[0] ); - dy2 = sy[ 2 ] - ( S1*sy[1] ); - dy3 = sy[ 3 ] - ( S2*sy[2] ); - dy4 = sy[ 4 ] - ( S3*sy[3] ); - dy5 = sy[ 5 ] - ( S4*sy[4] ); - dy6 = sy[ 6 ] - ( S5*sy[5] ); - dz0 = sz[ 0 ]; - dz1 = sz[ 1 ] - ( S0*sz[0] ); - dz2 = sz[ 2 ] - ( S1*sz[1] ); - dz3 = sz[ 3 ] - ( S2*sz[2] ); - dz4 = sz[ 4 ] - ( S3*sz[3] ); - dz5 = sz[ 5 ] - ( S4*sz[4] ); - dz6 = sz[ 6 ] - ( S5*sz[5] ); - } - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Iterate over the ndarray dimensions... - for ( i6 = 0; i6 < S6; i6++ ) { - for ( i5 = 0; i5 < S5; i5++ ) { - for ( i4 = 0; i4 < S4; i4++ ) { - for ( i3 = 0; i3 < S3; i3++ ) { - for ( i2 = 0; i2 < S2; i2++ ) { - for ( i1 = 0; i1 < S1; i1++ ) { - for ( i0 = 0; i0 < S0; i0++ ) { - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } - ix += dx6; - iy += dy6; - iz += dz6; - } -} - - -// EXPORTS // - -module.exports = binary7d; diff --git a/lib/7d_accessors.js b/lib/7d_accessors.js deleted file mode 100644 index 40f32e6..0000000 --- a/lib/7d_accessors.js +++ /dev/null @@ -1,294 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-len, max-statements */ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in seven-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* binary7d( x, y, z, true, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary7d( x, y, z, isRowMajor, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var xget; - var yget; - var zset; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dx6; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dy6; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var dz6; - var sh; - var S0; - var S1; - var S2; - var S3; - var S4; - var S5; - var S6; - var sx; - var sy; - var sz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - var i6; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments... - sh = x.shape; - sx = x.strides; - sy = y.strides; - sz = z.strides; - if ( isRowMajor ) { - // For row-major ndarrays, the last dimensions have the fastest changing indices... - S0 = sh[ 6 ]; - S1 = sh[ 5 ]; - S2 = sh[ 4 ]; - S3 = sh[ 3 ]; - S4 = sh[ 2 ]; - S5 = sh[ 1 ]; - S6 = sh[ 0 ]; - dx0 = sx[ 6 ]; // offset increment for innermost loop - dx1 = sx[ 5 ] - ( S0*sx[6] ); - dx2 = sx[ 4 ] - ( S1*sx[5] ); - dx3 = sx[ 3 ] - ( S2*sx[4] ); - dx4 = sx[ 2 ] - ( S3*sx[3] ); - dx5 = sx[ 1 ] - ( S4*sx[2] ); - dx6 = sx[ 0 ] - ( S5*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 6 ]; - dy1 = sy[ 5 ] - ( S0*sy[6] ); - dy2 = sy[ 4 ] - ( S1*sy[5] ); - dy3 = sy[ 3 ] - ( S2*sy[4] ); - dy4 = sy[ 2 ] - ( S3*sy[3] ); - dy5 = sy[ 1 ] - ( S4*sy[2] ); - dy6 = sy[ 0 ] - ( S5*sy[1] ); - dz0 = sz[ 6 ]; - dz1 = sz[ 5 ] - ( S0*sz[6] ); - dz2 = sz[ 4 ] - ( S1*sz[5] ); - dz3 = sz[ 3 ] - ( S2*sz[4] ); - dz4 = sz[ 2 ] - ( S3*sz[3] ); - dz5 = sz[ 1 ] - ( S4*sz[2] ); - dz6 = sz[ 0 ] - ( S5*sz[1] ); - } else { // order === 'column-major' - // For column-major ndarrays, the first dimensions have the fastest changing indices... - S0 = sh[ 0 ]; - S1 = sh[ 1 ]; - S2 = sh[ 2 ]; - S3 = sh[ 3 ]; - S4 = sh[ 4 ]; - S5 = sh[ 5 ]; - S6 = sh[ 6 ]; - dx0 = sx[ 0 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[0] ); - dx2 = sx[ 2 ] - ( S1*sx[1] ); - dx3 = sx[ 3 ] - ( S2*sx[2] ); - dx4 = sx[ 4 ] - ( S3*sx[3] ); - dx5 = sx[ 5 ] - ( S4*sx[4] ); - dx6 = sx[ 6 ] - ( S5*sx[5] ); // offset increment for outermost loop - dy0 = sy[ 0 ]; - dy1 = sy[ 1 ] - ( S0*sy[0] ); - dy2 = sy[ 2 ] - ( S1*sy[1] ); - dy3 = sy[ 3 ] - ( S2*sy[2] ); - dy4 = sy[ 4 ] - ( S3*sy[3] ); - dy5 = sy[ 5 ] - ( S4*sy[4] ); - dy6 = sy[ 6 ] - ( S5*sy[5] ); - dz0 = sz[ 0 ]; - dz1 = sz[ 1 ] - ( S0*sz[0] ); - dz2 = sz[ 2 ] - ( S1*sz[1] ); - dz3 = sz[ 3 ] - ( S2*sz[2] ); - dz4 = sz[ 4 ] - ( S3*sz[3] ); - dz5 = sz[ 5 ] - ( S4*sz[4] ); - dz6 = sz[ 6 ] - ( S5*sz[5] ); - } - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache accessors: - xget = x.accessors[ 0 ]; - yget = y.accessors[ 0 ]; - zset = z.accessors[ 1 ]; - - // Iterate over the ndarray dimensions... - for ( i6 = 0; i6 < S6; i6++ ) { - for ( i5 = 0; i5 < S5; i5++ ) { - for ( i4 = 0; i4 < S4; i4++ ) { - for ( i3 = 0; i3 < S3; i3++ ) { - for ( i2 = 0; i2 < S2; i2++ ) { - for ( i1 = 0; i1 < S1; i1++ ) { - for ( i0 = 0; i0 < S0; i0++ ) { - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } - ix += dx6; - iy += dy6; - iz += dz6; - } -} - - -// EXPORTS // - -module.exports = binary7d; diff --git a/lib/7d_blocked.js b/lib/7d_blocked.js deleted file mode 100644 index 4cf2b36..0000000 --- a/lib/7d_blocked.js +++ /dev/null @@ -1,368 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */ - -'use strict'; - -// MODULES // - -var loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' ); -var blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' ); - - -// MAIN // - -/** -* Applies a binary callback to elements in seven-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Callback} fcn - binary callback -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* blockedbinary7d( x, y, z, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function blockedbinary7d( x, y, z, fcn ) { - var bsize; - var xbuf; - var ybuf; - var zbuf; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dx6; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dy6; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var dz6; - var ox1; - var ox2; - var ox3; - var ox4; - var ox5; - var ox6; - var oy1; - var oy2; - var oy3; - var oy4; - var oy5; - var oy6; - var oz1; - var oz2; - var oz3; - var oz4; - var oz5; - var oz6; - var sh; - var s0; - var s1; - var s2; - var s3; - var s4; - var s5; - var s6; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - var i6; - var j0; - var j1; - var j2; - var j3; - var j4; - var j5; - var j6; - var o; - - // Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop... - - // Resolve the loop interchange order: - o = loopOrder( x.shape, x.strides, y.strides, z.strides ); - sh = o.sh; - sx = o.sx; - sy = o.sy; - sz = o.sz; - - // Determine the block size: - bsize = blockSize( x.dtype, y.dtype, z.dtype ); - - // Cache the indices of the first indexed elements in the respective ndarrays... - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache offset increments for the innermost loop... - dx0 = sx[0]; - dy0 = sy[0]; - dz0 = sz[0]; - - // Iterate over blocks... - for ( j6 = sh[6]; j6 > 0; ) { - if ( j6 < bsize ) { - s6 = j6; - j6 = 0; - } else { - s6 = bsize; - j6 -= bsize; - } - ox6 = ox + ( j6*sx[6] ); - oy6 = oy + ( j6*sy[6] ); - oz6 = oz + ( j6*sz[6] ); - for ( j5 = sh[5]; j5 > 0; ) { - if ( j5 < bsize ) { - s5 = j5; - j5 = 0; - } else { - s5 = bsize; - j5 -= bsize; - } - dx6 = sx[6] - ( s5*sx[5] ); - dy6 = sy[6] - ( s5*sy[5] ); - dz6 = sz[6] - ( s5*sz[5] ); - ox5 = ox6 + ( j5*sx[5] ); - oy5 = oy6 + ( j5*sy[5] ); - oz5 = oz6 + ( j5*sz[5] ); - for ( j4 = sh[4]; j4 > 0; ) { - if ( j4 < bsize ) { - s4 = j4; - j4 = 0; - } else { - s4 = bsize; - j4 -= bsize; - } - dx5 = sx[5] - ( s4*sx[4] ); - dy5 = sy[5] - ( s4*sy[4] ); - dz5 = sz[5] - ( s4*sz[4] ); - ox4 = ox5 + ( j4*sx[4] ); - oy4 = oy5 + ( j4*sy[4] ); - oz4 = oz5 + ( j4*sz[4] ); - for ( j3 = sh[3]; j3 > 0; ) { - if ( j3 < bsize ) { - s3 = j3; - j3 = 0; - } else { - s3 = bsize; - j3 -= bsize; - } - dx4 = sx[4] - ( s3*sx[3] ); - dy4 = sy[4] - ( s3*sy[3] ); - dz4 = sz[4] - ( s3*sz[3] ); - ox3 = ox4 + ( j3*sx[3] ); - oy3 = oy4 + ( j3*sy[3] ); - oz3 = oz4 + ( j3*sz[3] ); - for ( j2 = sh[2]; j2 > 0; ) { - if ( j2 < bsize ) { - s2 = j2; - j2 = 0; - } else { - s2 = bsize; - j2 -= bsize; - } - dx3 = sx[3] - ( s2*sx[2] ); - dy3 = sy[3] - ( s2*sy[2] ); - dz3 = sz[3] - ( s2*sz[2] ); - ox2 = ox3 + ( j2*sx[2] ); - oy2 = oy3 + ( j2*sy[2] ); - oz2 = oz3 + ( j2*sz[2] ); - for ( j1 = sh[1]; j1 > 0; ) { - if ( j1 < bsize ) { - s1 = j1; - j1 = 0; - } else { - s1 = bsize; - j1 -= bsize; - } - dx2 = sx[2] - ( s1*sx[1] ); - dy2 = sy[2] - ( s1*sy[1] ); - dz2 = sz[2] - ( s1*sz[1] ); - ox1 = ox2 + ( j1*sx[1] ); - oy1 = oy2 + ( j1*sy[1] ); - oz1 = oz2 + ( j1*sz[1] ); - for ( j0 = sh[0]; j0 > 0; ) { - if ( j0 < bsize ) { - s0 = j0; - j0 = 0; - } else { - s0 = bsize; - j0 -= bsize; - } - // Compute index offsets for the first input and output ndarray elements in the current block... - ix = ox1 + ( j0*sx[0] ); - iy = oy1 + ( j0*sy[0] ); - iz = oz1 + ( j0*sz[0] ); - - // Compute loop offset increments... - dx1 = sx[1] - ( s0*sx[0] ); - dy1 = sy[1] - ( s0*sy[0] ); - dz1 = sz[1] - ( s0*sz[0] ); - - // Iterate over the ndarray dimensions... - for ( i6 = 0; i6 < s6; i6++ ) { - for ( i5 = 0; i5 < s5; i5++ ) { - for ( i4 = 0; i4 < s4; i4++ ) { - for ( i3 = 0; i3 < s3; i3++ ) { - for ( i2 = 0; i2 < s2; i2++ ) { - for ( i1 = 0; i1 < s1; i1++ ) { - for ( i0 = 0; i0 < s0; i0++ ) { - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } - ix += dx6; - iy += dy6; - iz += dz6; - } - } - } - } - } - } - } - } -} - - -// EXPORTS // - -module.exports = blockedbinary7d; diff --git a/lib/7d_blocked_accessors.js b/lib/7d_blocked_accessors.js deleted file mode 100644 index 020771d..0000000 --- a/lib/7d_blocked_accessors.js +++ /dev/null @@ -1,384 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */ - -'use strict'; - -// MODULES // - -var loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' ); -var blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' ); - - -// MAIN // - -/** -* Applies a binary callback to elements in seven-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {Callback} fcn - binary callback -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* blockedbinary7d( x, y, z, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function blockedbinary7d( x, y, z, fcn ) { - var bsize; - var xbuf; - var ybuf; - var zbuf; - var xget; - var yget; - var zset; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dx6; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dy6; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var dz6; - var ox1; - var ox2; - var ox3; - var ox4; - var ox5; - var ox6; - var oy1; - var oy2; - var oy3; - var oy4; - var oy5; - var oy6; - var oz1; - var oz2; - var oz3; - var oz4; - var oz5; - var oz6; - var sh; - var s0; - var s1; - var s2; - var s3; - var s4; - var s5; - var s6; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - var i6; - var j0; - var j1; - var j2; - var j3; - var j4; - var j5; - var j6; - var o; - - // Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop... - - // Resolve the loop interchange order: - o = loopOrder( x.shape, x.strides, y.strides, z.strides ); - sh = o.sh; - sx = o.sx; - sy = o.sy; - sz = o.sz; - - // Determine the block size: - bsize = blockSize( x.dtype, y.dtype, z.dtype ); - - // Cache the indices of the first indexed elements in the respective ndarrays... - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache offset increments for the innermost loop... - dx0 = sx[0]; - dy0 = sy[0]; - dz0 = sz[0]; - - // Cache accessors: - xget = x.accessors[0]; - yget = y.accessors[0]; - zset = z.accessors[1]; - - // Iterate over blocks... - for ( j6 = sh[6]; j6 > 0; ) { - if ( j6 < bsize ) { - s6 = j6; - j6 = 0; - } else { - s6 = bsize; - j6 -= bsize; - } - ox6 = ox + ( j6*sx[6] ); - oy6 = oy + ( j6*sy[6] ); - oz6 = oz + ( j6*sz[6] ); - for ( j5 = sh[5]; j5 > 0; ) { - if ( j5 < bsize ) { - s5 = j5; - j5 = 0; - } else { - s5 = bsize; - j5 -= bsize; - } - dx6 = sx[6] - ( s5*sx[5] ); - dy6 = sy[6] - ( s5*sy[5] ); - dz6 = sz[6] - ( s5*sz[5] ); - ox5 = ox6 + ( j5*sx[5] ); - oy5 = oy6 + ( j5*sy[5] ); - oz5 = oz6 + ( j5*sz[5] ); - for ( j4 = sh[4]; j4 > 0; ) { - if ( j4 < bsize ) { - s4 = j4; - j4 = 0; - } else { - s4 = bsize; - j4 -= bsize; - } - dx5 = sx[5] - ( s4*sx[4] ); - dy5 = sy[5] - ( s4*sy[4] ); - dz5 = sz[5] - ( s4*sz[4] ); - ox4 = ox5 + ( j4*sx[4] ); - oy4 = oy5 + ( j4*sy[4] ); - oz4 = oz5 + ( j4*sz[4] ); - for ( j3 = sh[3]; j3 > 0; ) { - if ( j3 < bsize ) { - s3 = j3; - j3 = 0; - } else { - s3 = bsize; - j3 -= bsize; - } - dx4 = sx[4] - ( s3*sx[3] ); - dy4 = sy[4] - ( s3*sy[3] ); - dz4 = sz[4] - ( s3*sz[3] ); - ox3 = ox4 + ( j3*sx[3] ); - oy3 = oy4 + ( j3*sy[3] ); - oz3 = oz4 + ( j3*sz[3] ); - for ( j2 = sh[2]; j2 > 0; ) { - if ( j2 < bsize ) { - s2 = j2; - j2 = 0; - } else { - s2 = bsize; - j2 -= bsize; - } - dx3 = sx[3] - ( s2*sx[2] ); - dy3 = sy[3] - ( s2*sy[2] ); - dz3 = sz[3] - ( s2*sz[2] ); - ox2 = ox3 + ( j2*sx[2] ); - oy2 = oy3 + ( j2*sy[2] ); - oz2 = oz3 + ( j2*sz[2] ); - for ( j1 = sh[1]; j1 > 0; ) { - if ( j1 < bsize ) { - s1 = j1; - j1 = 0; - } else { - s1 = bsize; - j1 -= bsize; - } - dx2 = sx[2] - ( s1*sx[1] ); - dy2 = sy[2] - ( s1*sy[1] ); - dz2 = sz[2] - ( s1*sz[1] ); - ox1 = ox2 + ( j1*sx[1] ); - oy1 = oy2 + ( j1*sy[1] ); - oz1 = oz2 + ( j1*sz[1] ); - for ( j0 = sh[0]; j0 > 0; ) { - if ( j0 < bsize ) { - s0 = j0; - j0 = 0; - } else { - s0 = bsize; - j0 -= bsize; - } - // Compute index offsets for the first input and output ndarray elements in the current block... - ix = ox1 + ( j0*sx[0] ); - iy = oy1 + ( j0*sy[0] ); - iz = oz1 + ( j0*sz[0] ); - - // Compute loop offset increments... - dx1 = sx[1] - ( s0*sx[0] ); - dy1 = sy[1] - ( s0*sy[0] ); - dz1 = sz[1] - ( s0*sz[0] ); - - // Iterate over the ndarray dimensions... - for ( i6 = 0; i6 < s6; i6++ ) { - for ( i5 = 0; i5 < s5; i5++ ) { - for ( i4 = 0; i4 < s4; i4++ ) { - for ( i3 = 0; i3 < s3; i3++ ) { - for ( i2 = 0; i2 < s2; i2++ ) { - for ( i1 = 0; i1 < s1; i1++ ) { - for ( i0 = 0; i0 < s0; i0++ ) { - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } - ix += dx6; - iy += dy6; - iz += dz6; - } - } - } - } - } - } - } - } -} - - -// EXPORTS // - -module.exports = blockedbinary7d; diff --git a/lib/8d.js b/lib/8d.js deleted file mode 100644 index 99326a6..0000000 --- a/lib/8d.js +++ /dev/null @@ -1,296 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-statements */ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in eight-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* binary8d( x, y, z, true, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary8d( x, y, z, isRowMajor, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dx6; - var dx7; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dy6; - var dy7; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var dz6; - var dz7; - var sh; - var S0; - var S1; - var S2; - var S3; - var S4; - var S5; - var S6; - var S7; - var sx; - var sy; - var sz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - var i6; - var i7; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments... - sh = x.shape; - sx = x.strides; - sy = y.strides; - sz = z.strides; - if ( isRowMajor ) { - // For row-major ndarrays, the last dimensions have the fastest changing indices... - S0 = sh[ 7 ]; - S1 = sh[ 6 ]; - S2 = sh[ 5 ]; - S3 = sh[ 4 ]; - S4 = sh[ 3 ]; - S5 = sh[ 2 ]; - S6 = sh[ 1 ]; - S7 = sh[ 0 ]; - dx0 = sx[ 7 ]; // offset increment for innermost loop - dx1 = sx[ 6 ] - ( S0*sx[7] ); - dx2 = sx[ 5 ] - ( S1*sx[6] ); - dx3 = sx[ 4 ] - ( S2*sx[5] ); - dx4 = sx[ 3 ] - ( S3*sx[4] ); - dx5 = sx[ 2 ] - ( S4*sx[3] ); - dx6 = sx[ 1 ] - ( S5*sx[2] ); - dx7 = sx[ 0 ] - ( S6*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 7 ]; - dy1 = sy[ 6 ] - ( S0*sy[7] ); - dy2 = sy[ 5 ] - ( S1*sy[6] ); - dy3 = sy[ 4 ] - ( S2*sy[5] ); - dy4 = sy[ 3 ] - ( S3*sy[4] ); - dy5 = sy[ 2 ] - ( S4*sy[3] ); - dy6 = sy[ 1 ] - ( S5*sy[2] ); - dy7 = sy[ 0 ] - ( S6*sy[1] ); - dz0 = sz[ 7 ]; - dz1 = sz[ 6 ] - ( S0*sz[7] ); - dz2 = sz[ 5 ] - ( S1*sz[6] ); - dz3 = sz[ 4 ] - ( S2*sz[5] ); - dz4 = sz[ 3 ] - ( S3*sz[4] ); - dz5 = sz[ 2 ] - ( S4*sz[3] ); - dz6 = sz[ 1 ] - ( S5*sz[2] ); - dz7 = sz[ 0 ] - ( S6*sz[1] ); - } else { // order === 'column-major' - // For column-major ndarrays, the first dimensions have the fastest changing indices... - S0 = sh[ 0 ]; - S1 = sh[ 1 ]; - S2 = sh[ 2 ]; - S3 = sh[ 3 ]; - S4 = sh[ 4 ]; - S5 = sh[ 5 ]; - S6 = sh[ 6 ]; - S7 = sh[ 7 ]; - dx0 = sx[ 0 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[0] ); - dx2 = sx[ 2 ] - ( S1*sx[1] ); - dx3 = sx[ 3 ] - ( S2*sx[2] ); - dx4 = sx[ 4 ] - ( S3*sx[3] ); - dx5 = sx[ 5 ] - ( S4*sx[4] ); - dx6 = sx[ 6 ] - ( S5*sx[5] ); - dx7 = sx[ 7 ] - ( S6*sx[6] ); // offset increment for outermost loop - dy0 = sy[ 0 ]; - dy1 = sy[ 1 ] - ( S0*sy[0] ); - dy2 = sy[ 2 ] - ( S1*sy[1] ); - dy3 = sy[ 3 ] - ( S2*sy[2] ); - dy4 = sy[ 4 ] - ( S3*sy[3] ); - dy5 = sy[ 5 ] - ( S4*sy[4] ); - dy6 = sy[ 6 ] - ( S5*sy[5] ); - dy7 = sy[ 7 ] - ( S6*sy[6] ); - dz0 = sz[ 0 ]; - dz1 = sz[ 1 ] - ( S0*sz[0] ); - dz2 = sz[ 2 ] - ( S1*sz[1] ); - dz3 = sz[ 3 ] - ( S2*sz[2] ); - dz4 = sz[ 4 ] - ( S3*sz[3] ); - dz5 = sz[ 5 ] - ( S4*sz[4] ); - dz6 = sz[ 6 ] - ( S5*sz[5] ); - dz7 = sz[ 7 ] - ( S6*sz[6] ); - } - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Iterate over the ndarray dimensions... - for ( i7 = 0; i7 < S7; i7++ ) { - for ( i6 = 0; i6 < S6; i6++ ) { - for ( i5 = 0; i5 < S5; i5++ ) { - for ( i4 = 0; i4 < S4; i4++ ) { - for ( i3 = 0; i3 < S3; i3++ ) { - for ( i2 = 0; i2 < S2; i2++ ) { - for ( i1 = 0; i1 < S1; i1++ ) { - for ( i0 = 0; i0 < S0; i0++ ) { - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } - ix += dx6; - iy += dy6; - iz += dz6; - } - ix += dx7; - iy += dy7; - iz += dz7; - } -} - - -// EXPORTS // - -module.exports = binary8d; diff --git a/lib/8d_accessors.js b/lib/8d_accessors.js deleted file mode 100644 index 77646d4..0000000 --- a/lib/8d_accessors.js +++ /dev/null @@ -1,312 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-len, max-statements */ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in eight-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* binary8d( x, y, z, true, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary8d( x, y, z, isRowMajor, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var xget; - var yget; - var zset; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dx6; - var dx7; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dy6; - var dy7; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var dz6; - var dz7; - var sh; - var S0; - var S1; - var S2; - var S3; - var S4; - var S5; - var S6; - var S7; - var sx; - var sy; - var sz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - var i6; - var i7; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments... - sh = x.shape; - sx = x.strides; - sy = y.strides; - sz = z.strides; - if ( isRowMajor ) { - // For row-major ndarrays, the last dimensions have the fastest changing indices... - S0 = sh[ 7 ]; - S1 = sh[ 6 ]; - S2 = sh[ 5 ]; - S3 = sh[ 4 ]; - S4 = sh[ 3 ]; - S5 = sh[ 2 ]; - S6 = sh[ 1 ]; - S7 = sh[ 0 ]; - dx0 = sx[ 7 ]; // offset increment for innermost loop - dx1 = sx[ 6 ] - ( S0*sx[7] ); - dx2 = sx[ 5 ] - ( S1*sx[6] ); - dx3 = sx[ 4 ] - ( S2*sx[5] ); - dx4 = sx[ 3 ] - ( S3*sx[4] ); - dx5 = sx[ 2 ] - ( S4*sx[3] ); - dx6 = sx[ 1 ] - ( S5*sx[2] ); - dx7 = sx[ 0 ] - ( S6*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 7 ]; - dy1 = sy[ 6 ] - ( S0*sy[7] ); - dy2 = sy[ 5 ] - ( S1*sy[6] ); - dy3 = sy[ 4 ] - ( S2*sy[5] ); - dy4 = sy[ 3 ] - ( S3*sy[4] ); - dy5 = sy[ 2 ] - ( S4*sy[3] ); - dy6 = sy[ 1 ] - ( S5*sy[2] ); - dy7 = sy[ 0 ] - ( S6*sy[1] ); - dz0 = sz[ 7 ]; - dz1 = sz[ 6 ] - ( S0*sz[7] ); - dz2 = sz[ 5 ] - ( S1*sz[6] ); - dz3 = sz[ 4 ] - ( S2*sz[5] ); - dz4 = sz[ 3 ] - ( S3*sz[4] ); - dz5 = sz[ 2 ] - ( S4*sz[3] ); - dz6 = sz[ 1 ] - ( S5*sz[2] ); - dz7 = sz[ 0 ] - ( S6*sz[1] ); - } else { // order === 'column-major' - // For column-major ndarrays, the first dimensions have the fastest changing indices... - S0 = sh[ 0 ]; - S1 = sh[ 1 ]; - S2 = sh[ 2 ]; - S3 = sh[ 3 ]; - S4 = sh[ 4 ]; - S5 = sh[ 5 ]; - S6 = sh[ 6 ]; - S7 = sh[ 7 ]; - dx0 = sx[ 0 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[0] ); - dx2 = sx[ 2 ] - ( S1*sx[1] ); - dx3 = sx[ 3 ] - ( S2*sx[2] ); - dx4 = sx[ 4 ] - ( S3*sx[3] ); - dx5 = sx[ 5 ] - ( S4*sx[4] ); - dx6 = sx[ 6 ] - ( S5*sx[5] ); - dx7 = sx[ 7 ] - ( S6*sx[6] ); // offset increment for outermost loop - dy0 = sy[ 0 ]; - dy1 = sy[ 1 ] - ( S0*sy[0] ); - dy2 = sy[ 2 ] - ( S1*sy[1] ); - dy3 = sy[ 3 ] - ( S2*sy[2] ); - dy4 = sy[ 4 ] - ( S3*sy[3] ); - dy5 = sy[ 5 ] - ( S4*sy[4] ); - dy6 = sy[ 6 ] - ( S5*sy[5] ); - dy7 = sy[ 7 ] - ( S6*sy[6] ); - dz0 = sz[ 0 ]; - dz1 = sz[ 1 ] - ( S0*sz[0] ); - dz2 = sz[ 2 ] - ( S1*sz[1] ); - dz3 = sz[ 3 ] - ( S2*sz[2] ); - dz4 = sz[ 4 ] - ( S3*sz[3] ); - dz5 = sz[ 5 ] - ( S4*sz[4] ); - dz6 = sz[ 6 ] - ( S5*sz[5] ); - dz7 = sz[ 7 ] - ( S6*sz[6] ); - } - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache accessors: - xget = x.accessors[ 0 ]; - yget = y.accessors[ 0 ]; - zset = z.accessors[ 1 ]; - - // Iterate over the ndarray dimensions... - for ( i7 = 0; i7 < S7; i7++ ) { - for ( i6 = 0; i6 < S6; i6++ ) { - for ( i5 = 0; i5 < S5; i5++ ) { - for ( i4 = 0; i4 < S4; i4++ ) { - for ( i3 = 0; i3 < S3; i3++ ) { - for ( i2 = 0; i2 < S2; i2++ ) { - for ( i1 = 0; i1 < S1; i1++ ) { - for ( i0 = 0; i0 < S0; i0++ ) { - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } - ix += dx6; - iy += dy6; - iz += dz6; - } - ix += dx7; - iy += dy7; - iz += dz7; - } -} - - -// EXPORTS // - -module.exports = binary8d; diff --git a/lib/8d_blocked.js b/lib/8d_blocked.js deleted file mode 100644 index 6722da1..0000000 --- a/lib/8d_blocked.js +++ /dev/null @@ -1,397 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */ - -'use strict'; - -// MODULES // - -var loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' ); -var blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' ); - - -// MAIN // - -/** -* Applies a binary callback to elements in eight-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Callback} fcn - binary callback -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* blockedbinary8d( x, y, z, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function blockedbinary8d( x, y, z, fcn ) { - var bsize; - var xbuf; - var ybuf; - var zbuf; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dx6; - var dx7; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dy6; - var dy7; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var dz6; - var dz7; - var ox1; - var ox2; - var ox3; - var ox4; - var ox5; - var ox6; - var ox7; - var oy1; - var oy2; - var oy3; - var oy4; - var oy5; - var oy6; - var oy7; - var oz1; - var oz2; - var oz3; - var oz4; - var oz5; - var oz6; - var oz7; - var sh; - var s0; - var s1; - var s2; - var s3; - var s4; - var s5; - var s6; - var s7; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - var i6; - var i7; - var j0; - var j1; - var j2; - var j3; - var j4; - var j5; - var j6; - var j7; - var o; - - // Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop... - - // Resolve the loop interchange order: - o = loopOrder( x.shape, x.strides, y.strides, z.strides ); - sh = o.sh; - sx = o.sx; - sy = o.sy; - sz = o.sz; - - // Determine the block size: - bsize = blockSize( x.dtype, y.dtype, z.dtype ); - - // Cache the indices of the first indexed elements in the respective ndarrays... - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache offset increments for the innermost loop... - dx0 = sx[0]; - dy0 = sy[0]; - dz0 = sz[0]; - - // Iterate over blocks... - for ( j7 = sh[7]; j7 > 0; ) { - if ( j7 < bsize ) { - s7 = j7; - j7 = 0; - } else { - s7 = bsize; - j7 -= bsize; - } - ox7 = ox + ( j7*sx[7] ); - oy7 = oy + ( j7*sy[7] ); - oz7 = oz + ( j7*sz[7] ); - for ( j6 = sh[6]; j6 > 0; ) { - if ( j6 < bsize ) { - s6 = j6; - j6 = 0; - } else { - s6 = bsize; - j6 -= bsize; - } - dx7 = sx[7] - ( s6*sx[6] ); - dy7 = sy[7] - ( s6*sy[6] ); - dz7 = sz[7] - ( s6*sz[6] ); - ox6 = ox7 + ( j6*sx[6] ); - oy6 = oy7 + ( j6*sy[6] ); - oz6 = oz7 + ( j6*sz[6] ); - for ( j5 = sh[5]; j5 > 0; ) { - if ( j5 < bsize ) { - s5 = j5; - j5 = 0; - } else { - s5 = bsize; - j5 -= bsize; - } - dx6 = sx[6] - ( s5*sx[5] ); - dy6 = sy[6] - ( s5*sy[5] ); - dz6 = sz[6] - ( s5*sz[5] ); - ox5 = ox6 + ( j5*sx[5] ); - oy5 = oy6 + ( j5*sy[5] ); - oz5 = oz6 + ( j5*sz[5] ); - for ( j4 = sh[4]; j4 > 0; ) { - if ( j4 < bsize ) { - s4 = j4; - j4 = 0; - } else { - s4 = bsize; - j4 -= bsize; - } - dx5 = sx[5] - ( s4*sx[4] ); - dy5 = sy[5] - ( s4*sy[4] ); - dz5 = sz[5] - ( s4*sz[4] ); - ox4 = ox5 + ( j4*sx[4] ); - oy4 = oy5 + ( j4*sy[4] ); - oz4 = oz5 + ( j4*sz[4] ); - for ( j3 = sh[3]; j3 > 0; ) { - if ( j3 < bsize ) { - s3 = j3; - j3 = 0; - } else { - s3 = bsize; - j3 -= bsize; - } - dx4 = sx[4] - ( s3*sx[3] ); - dy4 = sy[4] - ( s3*sy[3] ); - dz4 = sz[4] - ( s3*sz[3] ); - ox3 = ox4 + ( j3*sx[3] ); - oy3 = oy4 + ( j3*sy[3] ); - oz3 = oz4 + ( j3*sz[3] ); - for ( j2 = sh[2]; j2 > 0; ) { - if ( j2 < bsize ) { - s2 = j2; - j2 = 0; - } else { - s2 = bsize; - j2 -= bsize; - } - dx3 = sx[3] - ( s2*sx[2] ); - dy3 = sy[3] - ( s2*sy[2] ); - dz3 = sz[3] - ( s2*sz[2] ); - ox2 = ox3 + ( j2*sx[2] ); - oy2 = oy3 + ( j2*sy[2] ); - oz2 = oz3 + ( j2*sz[2] ); - for ( j1 = sh[1]; j1 > 0; ) { - if ( j1 < bsize ) { - s1 = j1; - j1 = 0; - } else { - s1 = bsize; - j1 -= bsize; - } - dx2 = sx[2] - ( s1*sx[1] ); - dy2 = sy[2] - ( s1*sy[1] ); - dz2 = sz[2] - ( s1*sz[1] ); - ox1 = ox2 + ( j1*sx[1] ); - oy1 = oy2 + ( j1*sy[1] ); - oz1 = oz2 + ( j1*sz[1] ); - for ( j0 = sh[0]; j0 > 0; ) { - if ( j0 < bsize ) { - s0 = j0; - j0 = 0; - } else { - s0 = bsize; - j0 -= bsize; - } - // Compute index offsets for the first input and output ndarray elements in the current block... - ix = ox1 + ( j0*sx[0] ); - iy = oy1 + ( j0*sy[0] ); - iz = oz1 + ( j0*sz[0] ); - - // Compute loop offset increments... - dx1 = sx[1] - ( s0*sx[0] ); - dy1 = sy[1] - ( s0*sy[0] ); - dz1 = sz[1] - ( s0*sz[0] ); - - // Iterate over the ndarray dimensions... - for ( i7 = 0; i7 < s7; i7++ ) { - for ( i6 = 0; i6 < s6; i6++ ) { - for ( i5 = 0; i5 < s5; i5++ ) { - for ( i4 = 0; i4 < s4; i4++ ) { - for ( i3 = 0; i3 < s3; i3++ ) { - for ( i2 = 0; i2 < s2; i2++ ) { - for ( i1 = 0; i1 < s1; i1++ ) { - for ( i0 = 0; i0 < s0; i0++ ) { - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } - ix += dx6; - iy += dy6; - iz += dz6; - } - ix += dx7; - iy += dy7; - iz += dz7; - } - } - } - } - } - } - } - } - } -} - - -// EXPORTS // - -module.exports = blockedbinary8d; diff --git a/lib/8d_blocked_accessors.js b/lib/8d_blocked_accessors.js deleted file mode 100644 index 55ac171..0000000 --- a/lib/8d_blocked_accessors.js +++ /dev/null @@ -1,413 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */ - -'use strict'; - -// MODULES // - -var loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' ); -var blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' ); - - -// MAIN // - -/** -* Applies a binary callback to elements in eight-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {Callback} fcn - binary callback -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* blockedbinary8d( x, y, z, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function blockedbinary8d( x, y, z, fcn ) { - var bsize; - var xbuf; - var ybuf; - var zbuf; - var xget; - var yget; - var zset; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dx6; - var dx7; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dy6; - var dy7; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var dz6; - var dz7; - var ox1; - var ox2; - var ox3; - var ox4; - var ox5; - var ox6; - var ox7; - var oy1; - var oy2; - var oy3; - var oy4; - var oy5; - var oy6; - var oy7; - var oz1; - var oz2; - var oz3; - var oz4; - var oz5; - var oz6; - var oz7; - var sh; - var s0; - var s1; - var s2; - var s3; - var s4; - var s5; - var s6; - var s7; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - var i6; - var i7; - var j0; - var j1; - var j2; - var j3; - var j4; - var j5; - var j6; - var j7; - var o; - - // Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop... - - // Resolve the loop interchange order: - o = loopOrder( x.shape, x.strides, y.strides, z.strides ); - sh = o.sh; - sx = o.sx; - sy = o.sy; - sz = o.sz; - - // Determine the block size: - bsize = blockSize( x.dtype, y.dtype, z.dtype ); - - // Cache the indices of the first indexed elements in the respective ndarrays... - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache offset increments for the innermost loop... - dx0 = sx[0]; - dy0 = sy[0]; - dz0 = sz[0]; - - // Cache accessors: - xget = x.accessors[0]; - yget = y.accessors[0]; - zset = z.accessors[1]; - - // Iterate over blocks... - for ( j7 = sh[7]; j7 > 0; ) { - if ( j7 < bsize ) { - s7 = j7; - j7 = 0; - } else { - s7 = bsize; - j7 -= bsize; - } - ox7 = ox + ( j7*sx[7] ); - oy7 = oy + ( j7*sy[7] ); - oz7 = oz + ( j7*sz[7] ); - for ( j6 = sh[6]; j6 > 0; ) { - if ( j6 < bsize ) { - s6 = j6; - j6 = 0; - } else { - s6 = bsize; - j6 -= bsize; - } - dx7 = sx[7] - ( s6*sx[6] ); - dy7 = sy[7] - ( s6*sy[6] ); - dz7 = sz[7] - ( s6*sz[6] ); - ox6 = ox7 + ( j6*sx[6] ); - oy6 = oy7 + ( j6*sy[6] ); - oz6 = oz7 + ( j6*sz[6] ); - for ( j5 = sh[5]; j5 > 0; ) { - if ( j5 < bsize ) { - s5 = j5; - j5 = 0; - } else { - s5 = bsize; - j5 -= bsize; - } - dx6 = sx[6] - ( s5*sx[5] ); - dy6 = sy[6] - ( s5*sy[5] ); - dz6 = sz[6] - ( s5*sz[5] ); - ox5 = ox6 + ( j5*sx[5] ); - oy5 = oy6 + ( j5*sy[5] ); - oz5 = oz6 + ( j5*sz[5] ); - for ( j4 = sh[4]; j4 > 0; ) { - if ( j4 < bsize ) { - s4 = j4; - j4 = 0; - } else { - s4 = bsize; - j4 -= bsize; - } - dx5 = sx[5] - ( s4*sx[4] ); - dy5 = sy[5] - ( s4*sy[4] ); - dz5 = sz[5] - ( s4*sz[4] ); - ox4 = ox5 + ( j4*sx[4] ); - oy4 = oy5 + ( j4*sy[4] ); - oz4 = oz5 + ( j4*sz[4] ); - for ( j3 = sh[3]; j3 > 0; ) { - if ( j3 < bsize ) { - s3 = j3; - j3 = 0; - } else { - s3 = bsize; - j3 -= bsize; - } - dx4 = sx[4] - ( s3*sx[3] ); - dy4 = sy[4] - ( s3*sy[3] ); - dz4 = sz[4] - ( s3*sz[3] ); - ox3 = ox4 + ( j3*sx[3] ); - oy3 = oy4 + ( j3*sy[3] ); - oz3 = oz4 + ( j3*sz[3] ); - for ( j2 = sh[2]; j2 > 0; ) { - if ( j2 < bsize ) { - s2 = j2; - j2 = 0; - } else { - s2 = bsize; - j2 -= bsize; - } - dx3 = sx[3] - ( s2*sx[2] ); - dy3 = sy[3] - ( s2*sy[2] ); - dz3 = sz[3] - ( s2*sz[2] ); - ox2 = ox3 + ( j2*sx[2] ); - oy2 = oy3 + ( j2*sy[2] ); - oz2 = oz3 + ( j2*sz[2] ); - for ( j1 = sh[1]; j1 > 0; ) { - if ( j1 < bsize ) { - s1 = j1; - j1 = 0; - } else { - s1 = bsize; - j1 -= bsize; - } - dx2 = sx[2] - ( s1*sx[1] ); - dy2 = sy[2] - ( s1*sy[1] ); - dz2 = sz[2] - ( s1*sz[1] ); - ox1 = ox2 + ( j1*sx[1] ); - oy1 = oy2 + ( j1*sy[1] ); - oz1 = oz2 + ( j1*sz[1] ); - for ( j0 = sh[0]; j0 > 0; ) { - if ( j0 < bsize ) { - s0 = j0; - j0 = 0; - } else { - s0 = bsize; - j0 -= bsize; - } - // Compute index offsets for the first input and output ndarray elements in the current block... - ix = ox1 + ( j0*sx[0] ); - iy = oy1 + ( j0*sy[0] ); - iz = oz1 + ( j0*sz[0] ); - - // Compute loop offset increments... - dx1 = sx[1] - ( s0*sx[0] ); - dy1 = sy[1] - ( s0*sy[0] ); - dz1 = sz[1] - ( s0*sz[0] ); - - // Iterate over the ndarray dimensions... - for ( i7 = 0; i7 < s7; i7++ ) { - for ( i6 = 0; i6 < s6; i6++ ) { - for ( i5 = 0; i5 < s5; i5++ ) { - for ( i4 = 0; i4 < s4; i4++ ) { - for ( i3 = 0; i3 < s3; i3++ ) { - for ( i2 = 0; i2 < s2; i2++ ) { - for ( i1 = 0; i1 < s1; i1++ ) { - for ( i0 = 0; i0 < s0; i0++ ) { - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } - ix += dx6; - iy += dy6; - iz += dz6; - } - ix += dx7; - iy += dy7; - iz += dz7; - } - } - } - } - } - } - } - } - } -} - - -// EXPORTS // - -module.exports = blockedbinary8d; diff --git a/lib/9d.js b/lib/9d.js deleted file mode 100644 index 7037ab7..0000000 --- a/lib/9d.js +++ /dev/null @@ -1,314 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-statements, max-len */ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in nine-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* binary9d( x, y, z, true, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary9d( x, y, z, isRowMajor, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dx6; - var dx7; - var dx8; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dy6; - var dy7; - var dy8; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var dz6; - var dz7; - var dz8; - var sh; - var S0; - var S1; - var S2; - var S3; - var S4; - var S5; - var S6; - var S7; - var S8; - var sx; - var sy; - var sz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - var i6; - var i7; - var i8; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments... - sh = x.shape; - sx = x.strides; - sy = y.strides; - sz = z.strides; - if ( isRowMajor ) { - // For row-major ndarrays, the last dimensions have the fastest changing indices... - S0 = sh[ 8 ]; - S1 = sh[ 7 ]; - S2 = sh[ 6 ]; - S3 = sh[ 5 ]; - S4 = sh[ 4 ]; - S5 = sh[ 3 ]; - S6 = sh[ 2 ]; - S7 = sh[ 1 ]; - S8 = sh[ 0 ]; - dx0 = sx[ 8 ]; // offset increment for innermost loop - dx1 = sx[ 7 ] - ( S0*sx[8] ); - dx2 = sx[ 6 ] - ( S1*sx[7] ); - dx3 = sx[ 5 ] - ( S2*sx[6] ); - dx4 = sx[ 4 ] - ( S3*sx[5] ); - dx5 = sx[ 3 ] - ( S4*sx[4] ); - dx6 = sx[ 2 ] - ( S5*sx[3] ); - dx7 = sx[ 1 ] - ( S6*sx[2] ); - dx8 = sx[ 0 ] - ( S7*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 8 ]; - dy1 = sy[ 7 ] - ( S0*sy[8] ); - dy2 = sy[ 6 ] - ( S1*sy[7] ); - dy3 = sy[ 5 ] - ( S2*sy[6] ); - dy4 = sy[ 4 ] - ( S3*sy[5] ); - dy5 = sy[ 3 ] - ( S4*sy[4] ); - dy6 = sy[ 2 ] - ( S5*sy[3] ); - dy7 = sy[ 1 ] - ( S6*sy[2] ); - dy8 = sy[ 0 ] - ( S7*sy[1] ); - dz0 = sz[ 8 ]; - dz1 = sz[ 7 ] - ( S0*sz[8] ); - dz2 = sz[ 6 ] - ( S1*sz[7] ); - dz3 = sz[ 5 ] - ( S2*sz[6] ); - dz4 = sz[ 4 ] - ( S3*sz[5] ); - dz5 = sz[ 3 ] - ( S4*sz[4] ); - dz6 = sz[ 2 ] - ( S5*sz[3] ); - dz7 = sz[ 1 ] - ( S6*sz[2] ); - dz8 = sz[ 0 ] - ( S7*sz[1] ); - } else { // order === 'column-major' - // For column-major ndarrays, the first dimensions have the fastest changing indices... - S0 = sh[ 0 ]; - S1 = sh[ 1 ]; - S2 = sh[ 2 ]; - S3 = sh[ 3 ]; - S4 = sh[ 4 ]; - S5 = sh[ 5 ]; - S6 = sh[ 6 ]; - S7 = sh[ 7 ]; - S8 = sh[ 8 ]; - dx0 = sx[ 0 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[0] ); - dx2 = sx[ 2 ] - ( S1*sx[1] ); - dx3 = sx[ 3 ] - ( S2*sx[2] ); - dx4 = sx[ 4 ] - ( S3*sx[3] ); - dx5 = sx[ 5 ] - ( S4*sx[4] ); - dx6 = sx[ 6 ] - ( S5*sx[5] ); - dx7 = sx[ 7 ] - ( S6*sx[6] ); - dx8 = sx[ 8 ] - ( S7*sx[7] ); // offset increment for outermost loop - dy0 = sy[ 0 ]; - dy1 = sy[ 1 ] - ( S0*sy[0] ); - dy2 = sy[ 2 ] - ( S1*sy[1] ); - dy3 = sy[ 3 ] - ( S2*sy[2] ); - dy4 = sy[ 4 ] - ( S3*sy[3] ); - dy5 = sy[ 5 ] - ( S4*sy[4] ); - dy6 = sy[ 6 ] - ( S5*sy[5] ); - dy7 = sy[ 7 ] - ( S6*sy[6] ); - dy8 = sy[ 8 ] - ( S7*sy[7] ); - dz0 = sz[ 0 ]; - dz1 = sz[ 1 ] - ( S0*sz[0] ); - dz2 = sz[ 2 ] - ( S1*sz[1] ); - dz3 = sz[ 3 ] - ( S2*sz[2] ); - dz4 = sz[ 4 ] - ( S3*sz[3] ); - dz5 = sz[ 5 ] - ( S4*sz[4] ); - dz6 = sz[ 6 ] - ( S5*sz[5] ); - dz7 = sz[ 7 ] - ( S6*sz[6] ); - dz8 = sz[ 8 ] - ( S7*sz[7] ); - } - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Iterate over the ndarray dimensions... - for ( i8 = 0; i8 < S8; i8++ ) { - for ( i7 = 0; i7 < S7; i7++ ) { - for ( i6 = 0; i6 < S6; i6++ ) { - for ( i5 = 0; i5 < S5; i5++ ) { - for ( i4 = 0; i4 < S4; i4++ ) { - for ( i3 = 0; i3 < S3; i3++ ) { - for ( i2 = 0; i2 < S2; i2++ ) { - for ( i1 = 0; i1 < S1; i1++ ) { - for ( i0 = 0; i0 < S0; i0++ ) { - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } - ix += dx6; - iy += dy6; - iz += dz6; - } - ix += dx7; - iy += dy7; - iz += dz7; - } - ix += dx8; - iy += dy8; - iz += dz8; - } -} - - -// EXPORTS // - -module.exports = binary9d; diff --git a/lib/9d_accessors.js b/lib/9d_accessors.js deleted file mode 100644 index cce4889..0000000 --- a/lib/9d_accessors.js +++ /dev/null @@ -1,330 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-len, max-statements */ - -'use strict'; - -// MAIN // - -/** -* Applies a binary callback to elements in nine-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* binary9d( x, y, z, true, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binary9d( x, y, z, isRowMajor, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var xget; - var yget; - var zset; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dx6; - var dx7; - var dx8; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dy6; - var dy7; - var dy8; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var dz6; - var dz7; - var dz8; - var sh; - var S0; - var S1; - var S2; - var S3; - var S4; - var S5; - var S6; - var S7; - var S8; - var sx; - var sy; - var sz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - var i6; - var i7; - var i8; - - // Note on variable naming convention: S#, dx#, dy#, dz#, i# where # corresponds to the loop number, with `0` being the innermost loop... - - // Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments... - sh = x.shape; - sx = x.strides; - sy = y.strides; - sz = z.strides; - if ( isRowMajor ) { - // For row-major ndarrays, the last dimensions have the fastest changing indices... - S0 = sh[ 8 ]; - S1 = sh[ 7 ]; - S2 = sh[ 6 ]; - S3 = sh[ 5 ]; - S4 = sh[ 4 ]; - S5 = sh[ 3 ]; - S6 = sh[ 2 ]; - S7 = sh[ 1 ]; - S8 = sh[ 0 ]; - dx0 = sx[ 8 ]; // offset increment for innermost loop - dx1 = sx[ 7 ] - ( S0*sx[8] ); - dx2 = sx[ 6 ] - ( S1*sx[7] ); - dx3 = sx[ 5 ] - ( S2*sx[6] ); - dx4 = sx[ 4 ] - ( S3*sx[5] ); - dx5 = sx[ 3 ] - ( S4*sx[4] ); - dx6 = sx[ 2 ] - ( S5*sx[3] ); - dx7 = sx[ 1 ] - ( S6*sx[2] ); - dx8 = sx[ 0 ] - ( S7*sx[1] ); // offset increment for outermost loop - dy0 = sy[ 8 ]; - dy1 = sy[ 7 ] - ( S0*sy[8] ); - dy2 = sy[ 6 ] - ( S1*sy[7] ); - dy3 = sy[ 5 ] - ( S2*sy[6] ); - dy4 = sy[ 4 ] - ( S3*sy[5] ); - dy5 = sy[ 3 ] - ( S4*sy[4] ); - dy6 = sy[ 2 ] - ( S5*sy[3] ); - dy7 = sy[ 1 ] - ( S6*sy[2] ); - dy8 = sy[ 0 ] - ( S7*sy[1] ); - dz0 = sz[ 8 ]; - dz1 = sz[ 7 ] - ( S0*sz[8] ); - dz2 = sz[ 6 ] - ( S1*sz[7] ); - dz3 = sz[ 5 ] - ( S2*sz[6] ); - dz4 = sz[ 4 ] - ( S3*sz[5] ); - dz5 = sz[ 3 ] - ( S4*sz[4] ); - dz6 = sz[ 2 ] - ( S5*sz[3] ); - dz7 = sz[ 1 ] - ( S6*sz[2] ); - dz8 = sz[ 0 ] - ( S7*sz[1] ); - } else { // order === 'column-major' - // For column-major ndarrays, the first dimensions have the fastest changing indices... - S0 = sh[ 0 ]; - S1 = sh[ 1 ]; - S2 = sh[ 2 ]; - S3 = sh[ 3 ]; - S4 = sh[ 4 ]; - S5 = sh[ 5 ]; - S6 = sh[ 6 ]; - S7 = sh[ 7 ]; - S8 = sh[ 8 ]; - dx0 = sx[ 0 ]; // offset increment for innermost loop - dx1 = sx[ 1 ] - ( S0*sx[0] ); - dx2 = sx[ 2 ] - ( S1*sx[1] ); - dx3 = sx[ 3 ] - ( S2*sx[2] ); - dx4 = sx[ 4 ] - ( S3*sx[3] ); - dx5 = sx[ 5 ] - ( S4*sx[4] ); - dx6 = sx[ 6 ] - ( S5*sx[5] ); - dx7 = sx[ 7 ] - ( S6*sx[6] ); - dx8 = sx[ 8 ] - ( S7*sx[7] ); // offset increment for outermost loop - dy0 = sy[ 0 ]; - dy1 = sy[ 1 ] - ( S0*sy[0] ); - dy2 = sy[ 2 ] - ( S1*sy[1] ); - dy3 = sy[ 3 ] - ( S2*sy[2] ); - dy4 = sy[ 4 ] - ( S3*sy[3] ); - dy5 = sy[ 5 ] - ( S4*sy[4] ); - dy6 = sy[ 6 ] - ( S5*sy[5] ); - dy7 = sy[ 7 ] - ( S6*sy[6] ); - dy8 = sy[ 8 ] - ( S7*sy[7] ); - dz0 = sz[ 0 ]; - dz1 = sz[ 1 ] - ( S0*sz[0] ); - dz2 = sz[ 2 ] - ( S1*sz[1] ); - dz3 = sz[ 3 ] - ( S2*sz[2] ); - dz4 = sz[ 4 ] - ( S3*sz[3] ); - dz5 = sz[ 5 ] - ( S4*sz[4] ); - dz6 = sz[ 6 ] - ( S5*sz[5] ); - dz7 = sz[ 7 ] - ( S6*sz[6] ); - dz8 = sz[ 8 ] - ( S7*sz[7] ); - } - // Set the pointers to the first indexed elements in the respective ndarrays... - ix = x.offset; - iy = y.offset; - iz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache accessors: - xget = x.accessors[ 0 ]; - yget = y.accessors[ 0 ]; - zset = z.accessors[ 1 ]; - - // Iterate over the ndarray dimensions... - for ( i8 = 0; i8 < S8; i8++ ) { - for ( i7 = 0; i7 < S7; i7++ ) { - for ( i6 = 0; i6 < S6; i6++ ) { - for ( i5 = 0; i5 < S5; i5++ ) { - for ( i4 = 0; i4 < S4; i4++ ) { - for ( i3 = 0; i3 < S3; i3++ ) { - for ( i2 = 0; i2 < S2; i2++ ) { - for ( i1 = 0; i1 < S1; i1++ ) { - for ( i0 = 0; i0 < S0; i0++ ) { - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } - ix += dx6; - iy += dy6; - iz += dz6; - } - ix += dx7; - iy += dy7; - iz += dz7; - } - ix += dx8; - iy += dy8; - iz += dz8; - } -} - - -// EXPORTS // - -module.exports = binary9d; diff --git a/lib/9d_blocked.js b/lib/9d_blocked.js deleted file mode 100644 index 0c9d361..0000000 --- a/lib/9d_blocked.js +++ /dev/null @@ -1,426 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */ - -'use strict'; - -// MODULES // - -var loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' ); -var blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' ); - - -// MAIN // - -/** -* Applies a binary callback to elements in nine-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Callback} fcn - binary callback -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* blockedbinary9d( x, y, z, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function blockedbinary9d( x, y, z, fcn ) { - var bsize; - var xbuf; - var ybuf; - var zbuf; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dx6; - var dx7; - var dx8; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dy6; - var dy7; - var dy8; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var dz6; - var dz7; - var dz8; - var ox1; - var ox2; - var ox3; - var ox4; - var ox5; - var ox6; - var ox7; - var ox8; - var oy1; - var oy2; - var oy3; - var oy4; - var oy5; - var oy6; - var oy7; - var oy8; - var oz1; - var oz2; - var oz3; - var oz4; - var oz5; - var oz6; - var oz7; - var oz8; - var sh; - var s0; - var s1; - var s2; - var s3; - var s4; - var s5; - var s6; - var s7; - var s8; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - var i6; - var i7; - var i8; - var j0; - var j1; - var j2; - var j3; - var j4; - var j5; - var j6; - var j7; - var j8; - var o; - - // Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop... - - // Resolve the loop interchange order: - o = loopOrder( x.shape, x.strides, y.strides, z.strides ); - sh = o.sh; - sx = o.sx; - sy = o.sy; - sz = o.sz; - - // Determine the block size: - bsize = blockSize( x.dtype, y.dtype, z.dtype ); - - // Cache the indices of the first indexed elements in the respective ndarrays... - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache offset increments for the innermost loop... - dx0 = sx[0]; - dy0 = sy[0]; - dz0 = sz[0]; - - // Iterate over blocks... - for ( j8 = sh[8]; j8 > 0; ) { - if ( j8 < bsize ) { - s8 = j8; - j8 = 0; - } else { - s8 = bsize; - j8 -= bsize; - } - ox8 = ox + ( j8*sx[8] ); - oy8 = oy + ( j8*sy[8] ); - oz8 = oz + ( j8*sz[8] ); - for ( j7 = sh[7]; j7 > 0; ) { - if ( j7 < bsize ) { - s7 = j7; - j7 = 0; - } else { - s7 = bsize; - j7 -= bsize; - } - dx8 = sx[8] - ( s7*sx[7] ); - dy8 = sy[8] - ( s7*sy[7] ); - dz8 = sz[8] - ( s7*sz[7] ); - ox7 = ox8 + ( j7*sx[7] ); - oy7 = oy8 + ( j7*sy[7] ); - oz7 = oz8 + ( j7*sz[7] ); - for ( j6 = sh[6]; j6 > 0; ) { - if ( j6 < bsize ) { - s6 = j6; - j6 = 0; - } else { - s6 = bsize; - j6 -= bsize; - } - dx7 = sx[7] - ( s6*sx[6] ); - dy7 = sy[7] - ( s6*sy[6] ); - dz7 = sz[7] - ( s6*sz[6] ); - ox6 = ox7 + ( j6*sx[6] ); - oy6 = oy7 + ( j6*sy[6] ); - oz6 = oz7 + ( j6*sz[6] ); - for ( j5 = sh[5]; j5 > 0; ) { - if ( j5 < bsize ) { - s5 = j5; - j5 = 0; - } else { - s5 = bsize; - j5 -= bsize; - } - dx6 = sx[6] - ( s5*sx[5] ); - dy6 = sy[6] - ( s5*sy[5] ); - dz6 = sz[6] - ( s5*sz[5] ); - ox5 = ox6 + ( j5*sx[5] ); - oy5 = oy6 + ( j5*sy[5] ); - oz5 = oz6 + ( j5*sz[5] ); - for ( j4 = sh[4]; j4 > 0; ) { - if ( j4 < bsize ) { - s4 = j4; - j4 = 0; - } else { - s4 = bsize; - j4 -= bsize; - } - dx5 = sx[5] - ( s4*sx[4] ); - dy5 = sy[5] - ( s4*sy[4] ); - dz5 = sz[5] - ( s4*sz[4] ); - ox4 = ox5 + ( j4*sx[4] ); - oy4 = oy5 + ( j4*sy[4] ); - oz4 = oz5 + ( j4*sz[4] ); - for ( j3 = sh[3]; j3 > 0; ) { - if ( j3 < bsize ) { - s3 = j3; - j3 = 0; - } else { - s3 = bsize; - j3 -= bsize; - } - dx4 = sx[4] - ( s3*sx[3] ); - dy4 = sy[4] - ( s3*sy[3] ); - dz4 = sz[4] - ( s3*sz[3] ); - ox3 = ox4 + ( j3*sx[3] ); - oy3 = oy4 + ( j3*sy[3] ); - oz3 = oz4 + ( j3*sz[3] ); - for ( j2 = sh[2]; j2 > 0; ) { - if ( j2 < bsize ) { - s2 = j2; - j2 = 0; - } else { - s2 = bsize; - j2 -= bsize; - } - dx3 = sx[3] - ( s2*sx[2] ); - dy3 = sy[3] - ( s2*sy[2] ); - dz3 = sz[3] - ( s2*sz[2] ); - ox2 = ox3 + ( j2*sx[2] ); - oy2 = oy3 + ( j2*sy[2] ); - oz2 = oz3 + ( j2*sz[2] ); - for ( j1 = sh[1]; j1 > 0; ) { - if ( j1 < bsize ) { - s1 = j1; - j1 = 0; - } else { - s1 = bsize; - j1 -= bsize; - } - dx2 = sx[2] - ( s1*sx[1] ); - dy2 = sy[2] - ( s1*sy[1] ); - dz2 = sz[2] - ( s1*sz[1] ); - ox1 = ox2 + ( j1*sx[1] ); - oy1 = oy2 + ( j1*sy[1] ); - oz1 = oz2 + ( j1*sz[1] ); - for ( j0 = sh[0]; j0 > 0; ) { - if ( j0 < bsize ) { - s0 = j0; - j0 = 0; - } else { - s0 = bsize; - j0 -= bsize; - } - // Compute index offsets for the first input and output ndarray elements in the current block... - ix = ox1 + ( j0*sx[0] ); - iy = oy1 + ( j0*sy[0] ); - iz = oz1 + ( j0*sz[0] ); - - // Compute loop offset increments... - dx1 = sx[1] - ( s0*sx[0] ); - dy1 = sy[1] - ( s0*sy[0] ); - dz1 = sz[1] - ( s0*sz[0] ); - - // Iterate over the ndarray dimensions... - for ( i8 = 0; i8 < s8; i8++ ) { - for ( i7 = 0; i7 < s7; i7++ ) { - for ( i6 = 0; i6 < s6; i6++ ) { - for ( i5 = 0; i5 < s5; i5++ ) { - for ( i4 = 0; i4 < s4; i4++ ) { - for ( i3 = 0; i3 < s3; i3++ ) { - for ( i2 = 0; i2 < s2; i2++ ) { - for ( i1 = 0; i1 < s1; i1++ ) { - for ( i0 = 0; i0 < s0; i0++ ) { - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } - ix += dx6; - iy += dy6; - iz += dz6; - } - ix += dx7; - iy += dy7; - iz += dz7; - } - ix += dx8; - iy += dy8; - iz += dz8; - } - } - } - } - } - } - } - } - } - } -} - - -// EXPORTS // - -module.exports = blockedbinary9d; diff --git a/lib/9d_blocked_accessors.js b/lib/9d_blocked_accessors.js deleted file mode 100644 index 0336e71..0000000 --- a/lib/9d_blocked_accessors.js +++ /dev/null @@ -1,442 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */ - -'use strict'; - -// MODULES // - -var loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' ); -var blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' ); - - -// MAIN // - -/** -* Applies a binary callback to elements in nine-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray via loop blocking. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {Callback} fcn - binary callback -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ]; -* -* // Define the array strides: -* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* var sz = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* blockedbinary9d( x, y, z, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function blockedbinary9d( x, y, z, fcn ) { - var bsize; - var xbuf; - var ybuf; - var zbuf; - var xget; - var yget; - var zset; - var dx0; - var dx1; - var dx2; - var dx3; - var dx4; - var dx5; - var dx6; - var dx7; - var dx8; - var dy0; - var dy1; - var dy2; - var dy3; - var dy4; - var dy5; - var dy6; - var dy7; - var dy8; - var dz0; - var dz1; - var dz2; - var dz3; - var dz4; - var dz5; - var dz6; - var dz7; - var dz8; - var ox1; - var ox2; - var ox3; - var ox4; - var ox5; - var ox6; - var ox7; - var ox8; - var oy1; - var oy2; - var oy3; - var oy4; - var oy5; - var oy6; - var oy7; - var oy8; - var oz1; - var oz2; - var oz3; - var oz4; - var oz5; - var oz6; - var oz7; - var oz8; - var sh; - var s0; - var s1; - var s2; - var s3; - var s4; - var s5; - var s6; - var s7; - var s8; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i0; - var i1; - var i2; - var i3; - var i4; - var i5; - var i6; - var i7; - var i8; - var j0; - var j1; - var j2; - var j3; - var j4; - var j5; - var j6; - var j7; - var j8; - var o; - - // Note on variable naming convention: s#, dx#, dy#, dz#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop... - - // Resolve the loop interchange order: - o = loopOrder( x.shape, x.strides, y.strides, z.strides ); - sh = o.sh; - sx = o.sx; - sy = o.sy; - sz = o.sz; - - // Determine the block size: - bsize = blockSize( x.dtype, y.dtype, z.dtype ); - - // Cache the indices of the first indexed elements in the respective ndarrays... - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache references to the input and output ndarray buffers... - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache offset increments for the innermost loop... - dx0 = sx[0]; - dy0 = sy[0]; - dz0 = sz[0]; - - // Cache accessors: - xget = x.accessors[0]; - yget = y.accessors[0]; - zset = z.accessors[1]; - - // Iterate over blocks... - for ( j8 = sh[8]; j8 > 0; ) { - if ( j8 < bsize ) { - s8 = j8; - j8 = 0; - } else { - s8 = bsize; - j8 -= bsize; - } - ox8 = ox + ( j8*sx[8] ); - oy8 = oy + ( j8*sy[8] ); - oz8 = oz + ( j8*sz[8] ); - for ( j7 = sh[7]; j7 > 0; ) { - if ( j7 < bsize ) { - s7 = j7; - j7 = 0; - } else { - s7 = bsize; - j7 -= bsize; - } - dx8 = sx[8] - ( s7*sx[7] ); - dy8 = sy[8] - ( s7*sy[7] ); - dz8 = sz[8] - ( s7*sz[7] ); - ox7 = ox8 + ( j7*sx[7] ); - oy7 = oy8 + ( j7*sy[7] ); - oz7 = oz8 + ( j7*sz[7] ); - for ( j6 = sh[6]; j6 > 0; ) { - if ( j6 < bsize ) { - s6 = j6; - j6 = 0; - } else { - s6 = bsize; - j6 -= bsize; - } - dx7 = sx[7] - ( s6*sx[6] ); - dy7 = sy[7] - ( s6*sy[6] ); - dz7 = sz[7] - ( s6*sz[6] ); - ox6 = ox7 + ( j6*sx[6] ); - oy6 = oy7 + ( j6*sy[6] ); - oz6 = oz7 + ( j6*sz[6] ); - for ( j5 = sh[5]; j5 > 0; ) { - if ( j5 < bsize ) { - s5 = j5; - j5 = 0; - } else { - s5 = bsize; - j5 -= bsize; - } - dx6 = sx[6] - ( s5*sx[5] ); - dy6 = sy[6] - ( s5*sy[5] ); - dz6 = sz[6] - ( s5*sz[5] ); - ox5 = ox6 + ( j5*sx[5] ); - oy5 = oy6 + ( j5*sy[5] ); - oz5 = oz6 + ( j5*sz[5] ); - for ( j4 = sh[4]; j4 > 0; ) { - if ( j4 < bsize ) { - s4 = j4; - j4 = 0; - } else { - s4 = bsize; - j4 -= bsize; - } - dx5 = sx[5] - ( s4*sx[4] ); - dy5 = sy[5] - ( s4*sy[4] ); - dz5 = sz[5] - ( s4*sz[4] ); - ox4 = ox5 + ( j4*sx[4] ); - oy4 = oy5 + ( j4*sy[4] ); - oz4 = oz5 + ( j4*sz[4] ); - for ( j3 = sh[3]; j3 > 0; ) { - if ( j3 < bsize ) { - s3 = j3; - j3 = 0; - } else { - s3 = bsize; - j3 -= bsize; - } - dx4 = sx[4] - ( s3*sx[3] ); - dy4 = sy[4] - ( s3*sy[3] ); - dz4 = sz[4] - ( s3*sz[3] ); - ox3 = ox4 + ( j3*sx[3] ); - oy3 = oy4 + ( j3*sy[3] ); - oz3 = oz4 + ( j3*sz[3] ); - for ( j2 = sh[2]; j2 > 0; ) { - if ( j2 < bsize ) { - s2 = j2; - j2 = 0; - } else { - s2 = bsize; - j2 -= bsize; - } - dx3 = sx[3] - ( s2*sx[2] ); - dy3 = sy[3] - ( s2*sy[2] ); - dz3 = sz[3] - ( s2*sz[2] ); - ox2 = ox3 + ( j2*sx[2] ); - oy2 = oy3 + ( j2*sy[2] ); - oz2 = oz3 + ( j2*sz[2] ); - for ( j1 = sh[1]; j1 > 0; ) { - if ( j1 < bsize ) { - s1 = j1; - j1 = 0; - } else { - s1 = bsize; - j1 -= bsize; - } - dx2 = sx[2] - ( s1*sx[1] ); - dy2 = sy[2] - ( s1*sy[1] ); - dz2 = sz[2] - ( s1*sz[1] ); - ox1 = ox2 + ( j1*sx[1] ); - oy1 = oy2 + ( j1*sy[1] ); - oz1 = oz2 + ( j1*sz[1] ); - for ( j0 = sh[0]; j0 > 0; ) { - if ( j0 < bsize ) { - s0 = j0; - j0 = 0; - } else { - s0 = bsize; - j0 -= bsize; - } - // Compute index offsets for the first input and output ndarray elements in the current block... - ix = ox1 + ( j0*sx[0] ); - iy = oy1 + ( j0*sy[0] ); - iz = oz1 + ( j0*sz[0] ); - - // Compute loop offset increments... - dx1 = sx[1] - ( s0*sx[0] ); - dy1 = sy[1] - ( s0*sy[0] ); - dz1 = sz[1] - ( s0*sz[0] ); - - // Iterate over the ndarray dimensions... - for ( i8 = 0; i8 < s8; i8++ ) { - for ( i7 = 0; i7 < s7; i7++ ) { - for ( i6 = 0; i6 < s6; i6++ ) { - for ( i5 = 0; i5 < s5; i5++ ) { - for ( i4 = 0; i4 < s4; i4++ ) { - for ( i3 = 0; i3 < s3; i3++ ) { - for ( i2 = 0; i2 < s2; i2++ ) { - for ( i1 = 0; i1 < s1; i1++ ) { - for ( i0 = 0; i0 < s0; i0++ ) { - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - ix += dx0; - iy += dy0; - iz += dz0; - } - ix += dx1; - iy += dy1; - iz += dz1; - } - ix += dx2; - iy += dy2; - iz += dz2; - } - ix += dx3; - iy += dy3; - iz += dz3; - } - ix += dx4; - iy += dy4; - iz += dz4; - } - ix += dx5; - iy += dy5; - iz += dz5; - } - ix += dx6; - iy += dy6; - iz += dz6; - } - ix += dx7; - iy += dy7; - iz += dz7; - } - ix += dx8; - iy += dy8; - iz += dz8; - } - } - } - } - } - } - } - } - } - } -} - - -// EXPORTS // - -module.exports = blockedbinary9d; diff --git a/lib/index.js b/lib/index.js deleted file mode 100644 index 4fde354..0000000 --- a/lib/index.js +++ /dev/null @@ -1,73 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -/** -* Apply a binary callback to elements in input ndarrays and assign results to elements in an output ndarray. -* -* @module @stdlib/ndarray-base-binary -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* var ndarray = require( '@stdlib/ndarray-ctor' ); -* var getData = require( '@stdlib/ndarray-data-buffer' ); -* var binary = require( '@stdlib/ndarray-base-binary' ); -* -* function add( a, b ) { -* return a + b; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] ); -* var zbuf = new Float64Array( 6 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 3, 1, 2 ]; -* -* // Define the array strides: -* var sx = [ 2, 2, 1 ]; -* var sy = [ 2, 2, 1 ]; -* var sz = [ 2, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarrays: -* var x = new ndarray( 'float64', xbuf, shape, sx, ox, 'row-major' ); -* var y = new ndarray( 'float64', ybuf, shape, sy, oy, 'row-major' ); -* var z = new ndarray( 'float64', zbuf, shape, sz, oz, 'row-major' ); -* -* // Apply the binary function: -* binary( [ x, y, z ], add ); -* -* console.log( getData( z ) ); -* // => [ 2.0, 4.0, 6.0, 8.0, 10.0, 12.0 ] -*/ - -// MODULES // - -var main = require( './main.js' ); - - -// EXPORTS // - -module.exports = main; diff --git a/lib/main.js b/lib/main.js deleted file mode 100644 index 952863a..0000000 --- a/lib/main.js +++ /dev/null @@ -1,377 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MODULES // - -var iterationOrder = require( '@stdlib/ndarray-base-iteration-order' ); -var minmaxViewBufferIndex = require( '@stdlib/ndarray-base-minmax-view-buffer-index' ); -var ndarray2object = require( '@stdlib/ndarray-base-ndarraylike2object' ); -var strides2order = require( '@stdlib/ndarray-base-strides2order' ); -var anyIsEntryIn = require( '@stdlib/array-base-any-is-entry-in' ); -var format = require( '@stdlib/string-format' ); -var blockedaccessorbinary2d = require( './2d_blocked_accessors.js' ); -var blockedaccessorbinary3d = require( './3d_blocked_accessors.js' ); -var blockedaccessorbinary4d = require( './4d_blocked_accessors.js' ); -var blockedaccessorbinary5d = require( './5d_blocked_accessors.js' ); -var blockedaccessorbinary6d = require( './6d_blocked_accessors.js' ); -var blockedaccessorbinary7d = require( './7d_blocked_accessors.js' ); -var blockedaccessorbinary8d = require( './8d_blocked_accessors.js' ); -var blockedaccessorbinary9d = require( './9d_blocked_accessors.js' ); -var blockedaccessorbinary10d = require( './10d_blocked_accessors.js' ); -var blockedbinary2d = require( './2d_blocked.js' ); -var blockedbinary3d = require( './3d_blocked.js' ); -var blockedbinary4d = require( './4d_blocked.js' ); -var blockedbinary5d = require( './5d_blocked.js' ); -var blockedbinary6d = require( './6d_blocked.js' ); -var blockedbinary7d = require( './7d_blocked.js' ); -var blockedbinary8d = require( './8d_blocked.js' ); -var blockedbinary9d = require( './9d_blocked.js' ); -var blockedbinary10d = require( './10d_blocked.js' ); -var accessorbinary0d = require( './0d_accessors.js' ); -var accessorbinary1d = require( './1d_accessors.js' ); -var accessorbinary2d = require( './2d_accessors.js' ); -var accessorbinary3d = require( './3d_accessors.js' ); -var accessorbinary4d = require( './4d_accessors.js' ); -var accessorbinary5d = require( './5d_accessors.js' ); -var accessorbinary6d = require( './6d_accessors.js' ); -var accessorbinary7d = require( './7d_accessors.js' ); -var accessorbinary8d = require( './8d_accessors.js' ); -var accessorbinary9d = require( './9d_accessors.js' ); -var accessorbinary10d = require( './10d_accessors.js' ); -var accessorbinarynd = require( './nd_accessors.js' ); -var binary0d = require( './0d.js' ); -var binary1d = require( './1d.js' ); -var binary2d = require( './2d.js' ); -var binary3d = require( './3d.js' ); -var binary4d = require( './4d.js' ); -var binary5d = require( './5d.js' ); -var binary6d = require( './6d.js' ); -var binary7d = require( './7d.js' ); -var binary8d = require( './8d.js' ); -var binary9d = require( './9d.js' ); -var binary10d = require( './10d.js' ); -var binarynd = require( './nd.js' ); - - -// VARIABLES // - -var BINARY = [ - binary0d, - binary1d, - binary2d, - binary3d, - binary4d, - binary5d, - binary6d, - binary7d, - binary8d, - binary9d, - binary10d -]; -var ACCESSOR_BINARY = [ - accessorbinary0d, - accessorbinary1d, - accessorbinary2d, - accessorbinary3d, - accessorbinary4d, - accessorbinary5d, - accessorbinary6d, - accessorbinary7d, - accessorbinary8d, - accessorbinary9d, - accessorbinary10d -]; -var BLOCKED_BINARY = [ - blockedbinary2d, // 0 - blockedbinary3d, - blockedbinary4d, - blockedbinary5d, - blockedbinary6d, - blockedbinary7d, - blockedbinary8d, - blockedbinary9d, - blockedbinary10d // 8 -]; -var BLOCKED_ACCESSOR_BINARY = [ - blockedaccessorbinary2d, // 0 - blockedaccessorbinary3d, - blockedaccessorbinary4d, - blockedaccessorbinary5d, - blockedaccessorbinary6d, - blockedaccessorbinary7d, - blockedaccessorbinary8d, - blockedaccessorbinary9d, - blockedaccessorbinary10d // 8 -]; -var MAX_DIMS = BINARY.length - 1; - - -// FUNCTIONS // - -/** -* Returns a boolean indicating if at least one ndarray data buffer implements the accessor protocol. -* -* @private -* @param {ndarrayLike} x - first ndarray -* @param {ndarrayLike} y - second ndarray -* @param {ndarrayLike} z - third ndarray -* @returns {boolean} boolean indicating whether an ndarray data buffer implements the accessor protocol -*/ -function hasAccessors( x, y, z ) { - return anyIsEntryIn( [ x, y, z ], 'accessorProtocol', true ); -} - - -// MAIN // - -/** -* Applies a binary callback to elements in input ndarrays and assigns results to elements in an output ndarray. -* -* ## Notes -* -* - Each provided ndarray should be an object with the following properties: -* -* - **dtype**: data type. -* - **data**: data buffer. -* - **shape**: dimensions. -* - **strides**: stride lengths. -* - **offset**: index offset. -* - **order**: specifies whether an ndarray is row-major (C-style) or column major (Fortran-style). -* -* @param {ArrayLikeObject} arrays - array-like object containing two input arrays and one output array -* @param {Callback} fcn - binary callback -* @throws {Error} arrays must have the same number of dimensions -* @throws {Error} arrays must have the same shape -* @returns {void} -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* var ndarray = require( '@stdlib/ndarray-ctor' ); -* var getData = require( '@stdlib/ndarray-data-buffer' ); -* -* function add( a, b ) { -* return a + b; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] ); -* var zbuf = new Float64Array( 6 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 3, 1, 2 ]; -* -* // Define the array strides: -* var sx = [ 2, 2, 1 ]; -* var sy = [ 2, 2, 1 ]; -* var sz = [ 2, 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarrays: -* var x = new ndarray( 'float64', xbuf, shape, sx, ox, 'row-major' ); -* var y = new ndarray( 'float64', ybuf, shape, sy, oy, 'row-major' ); -* var z = new ndarray( 'float64', zbuf, shape, sz, oz, 'row-major' ); -* -* // Apply the binary function: -* binary( [ x, y, z ], add ); -* -* console.log( getData( z ) ); -* // => [ 2.0, 4.0, 6.0, 8.0, 10.0, 12.0 ] -*/ -function binary( arrays, fcn ) { // eslint-disable-line max-statements - var ndims; - var xmmv; - var ymmv; - var zmmv; - var shx; - var shy; - var shz; - var iox; - var ioy; - var ioz; - var len; - var ord; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ns; - var x; - var y; - var z; - var d; - var i; - - // Unpack the ndarrays and standardize ndarray meta data: - x = ndarray2object( arrays[ 0 ] ); - y = ndarray2object( arrays[ 1 ] ); - z = ndarray2object( arrays[ 2 ] ); - - // Verify that the input and output arrays have the same number of dimensions... - shx = x.shape; - shy = y.shape; - shz = z.shape; - ndims = shx.length; - if ( ndims !== shy.length || ndims !== shz.length ) { - throw new Error( format( 'invalid arguments. Arrays must have the same number of dimensions (i.e., same rank). ndims(x) == %d. ndims(y) == %d. ndims(z) == %d.', ndims, shy.length, shz.length ) ); - } - // Determine whether we can avoid iteration altogether... - if ( ndims === 0 ) { - if ( hasAccessors( x, y, z ) ) { - return ACCESSOR_BINARY[ ndims ]( x, y, z, fcn ); - } - return BINARY[ ndims ]( x, y, z, fcn ); - } - // Verify that the input and output arrays have the same dimensions... - len = 1; // number of elements - ns = 0; // number of singleton dimensions - for ( i = 0; i < ndims; i++ ) { - d = shx[ i ]; - if ( d !== shy[ i ] || d !== shz[ i ] ) { - throw new Error( 'invalid arguments. Arrays must have the same shape.' ); - } - // Note that, if one of the dimensions is `0`, the length will be `0`... - len *= d; - - // Check whether the current dimension is a singleton dimension... - if ( d === 1 ) { - ns += 1; - } - } - // Check whether we were provided empty ndarrays... - if ( len === 0 ) { - return; - } - // Determine whether the ndarrays are one-dimensional and thus readily translate to one-dimensional strided arrays... - if ( ndims === 1 ) { - if ( hasAccessors( x, y, z ) ) { - return ACCESSOR_BINARY[ ndims ]( x, y, z, fcn ); - } - return BINARY[ ndims ]( x, y, z, fcn ); - } - sx = x.strides; - sy = y.strides; - sz = z.strides; - - // Determine whether the ndarrays have only **one** non-singleton dimension (e.g., ndims=4, shape=[10,1,1,1]) so that we can treat the ndarrays as being equivalent to one-dimensional strided arrays... - if ( ns === ndims-1 ) { - // Get the index of the non-singleton dimension... - for ( i = 0; i < ndims; i++ ) { - if ( shx[ i ] !== 1 ) { - break; - } - } - x.shape = [ shx[i] ]; - y.shape = x.shape; - z.shape = x.shape; - x.strides = [ sx[i] ]; - y.strides = [ sy[i] ]; - z.strides = [ sz[i] ]; - if ( hasAccessors( x, y, z ) ) { - return ACCESSOR_BINARY[ 1 ]( x, y, z, fcn ); - } - return BINARY[ 1 ]( x, y, z, fcn ); - } - iox = iterationOrder( sx ); // +/-1 - ioy = iterationOrder( sy ); // +/-1 - ioz = iterationOrder( sz ); // +/-1 - - // Determine whether we can avoid blocked iteration... - ord = strides2order( sx ); - if ( iox !== 0 && ioy !== 0 && ioz !== 0 && ord === strides2order( sy ) && ord === strides2order( sz ) ) { // eslint-disable-line max-len - // Determine the minimum and maximum linear indices which are accessible by the array views: - xmmv = minmaxViewBufferIndex( shx, sx, x.offset ); - ymmv = minmaxViewBufferIndex( shy, sy, y.offset ); - zmmv = minmaxViewBufferIndex( shz, sz, z.offset ); - - // Determine whether we can ignore shape (and strides) and treat the ndarrays as linear one-dimensional strided arrays... - if ( - len === ( xmmv[1]-xmmv[0]+1 ) && - len === ( ymmv[1]-ymmv[0]+1 ) && - len === ( zmmv[1]-zmmv[0]+1 ) - ) { - // Note: the above is equivalent to @stdlib/ndarray/base/assert/is-contiguous, but in-lined so we can retain computed values... - if ( iox === 1 ) { - ox = xmmv[ 0 ]; - } else { - ox = xmmv[ 1 ]; - } - if ( ioy === 1 ) { - oy = ymmv[ 0 ]; - } else { - oy = ymmv[ 1 ]; - } - if ( ioz === 1 ) { - oz = zmmv[ 0 ]; - } else { - oz = zmmv[ 1 ]; - } - x.shape = [ len ]; - y.shape = x.shape; - z.shape = x.shape; - x.strides = [ iox ]; - y.strides = [ ioy ]; - z.strides = [ ioz ]; - x.offset = ox; - y.offset = oy; - z.offset = oz; - if ( hasAccessors( x, y, z ) ) { - return ACCESSOR_BINARY[ 1 ]( x, y, z, fcn ); - } - return BINARY[ 1 ]( x, y, z, fcn ); - } - // At least one ndarray is non-contiguous, so we cannot directly use one-dimensional array functionality... - - // Determine whether we can use simple nested loops... - if ( ndims <= MAX_DIMS ) { - // So long as iteration for each respective array always moves in the same direction (i.e., no mixed sign strides), we can leverage cache-optimal (i.e., normal) nested loops without resorting to blocked iteration... - if ( hasAccessors( x, y, z ) ) { - return ACCESSOR_BINARY[ ndims ]( x, y, z, ord === 1, fcn ); - } - return BINARY[ ndims ]( x, y, z, ord === 1, fcn ); - } - // Fall-through to blocked iteration... - } - // At this point, we're either dealing with non-contiguous n-dimensional arrays, high dimensional n-dimensional arrays, and/or arrays having differing memory layouts, so our only hope is that we can still perform blocked iteration... - - // Determine whether we can perform blocked iteration... - if ( ndims <= MAX_DIMS ) { - if ( hasAccessors( x, y, z ) ) { - return BLOCKED_ACCESSOR_BINARY[ ndims-2 ]( x, y, z, fcn ); - } - return BLOCKED_BINARY[ ndims-2 ]( x, y, z, fcn ); - } - // Fall-through to linear view iteration without regard for how data is stored in memory (i.e., take the slow path)... - if ( hasAccessors( x, y, z ) ) { - return accessorbinarynd( x, y, z, fcn ); - } - binarynd( x, y, z, fcn ); -} - - -// EXPORTS // - -module.exports = binary; diff --git a/lib/nd.js b/lib/nd.js deleted file mode 100644 index 5a70617..0000000 --- a/lib/nd.js +++ /dev/null @@ -1,176 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MODULES // - -var numel = require( '@stdlib/ndarray-base-numel' ); -var vind2bind = require( '@stdlib/ndarray-base-vind2bind' ); - - -// VARIABLES // - -var MODE = 'throw'; - - -// MAIN // - -/** -* Applies a binary callback to elements in n-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var Float64Array = require( '@stdlib/array-float64' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = new Float64Array( 12 ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 6, 2 ]; -* -* // Define the array strides: -* var sx = [ 2, 1 ]; -* var sy = [ 2, 1 ]; -* var sz = [ 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'float64', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major' -* }; -* var y = { -* 'dtype': 'float64', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major' -* }; -* var z = { -* 'dtype': 'float64', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major' -* }; -* -* // Apply the binary function: -* binarynd( x, y, z, fcn ); -* -* console.log( z.data ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binarynd( x, y, z, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var ordx; - var ordy; - var ordz; - var len; - var sh; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i; - - sh = x.shape; - - // Compute the total number of elements over which to iterate: - len = numel( sh ); - - // Cache references to the input and output ndarray data buffers: - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache references to the respective stride arrays: - sx = x.strides; - sy = y.strides; - sz = z.strides; - - // Cache the indices of the first indexed elements in the respective ndarrays: - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache the respective array orders: - ordx = x.order; - ordy = y.order; - ordz = z.order; - - // Iterate over each element based on the linear **view** index, regardless as to how the data is stored in memory... - for ( i = 0; i < len; i++ ) { - ix = vind2bind( sh, sx, ox, ordx, i, MODE ); - iy = vind2bind( sh, sy, oy, ordy, i, MODE ); - iz = vind2bind( sh, sz, oz, ordz, i, MODE ); - zbuf[ iz ] = fcn( xbuf[ ix ], ybuf[ iy ] ); - } -} - - -// EXPORTS // - -module.exports = binarynd; diff --git a/lib/nd_accessors.js b/lib/nd_accessors.js deleted file mode 100644 index 3d0c4b2..0000000 --- a/lib/nd_accessors.js +++ /dev/null @@ -1,192 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MODULES // - -var numel = require( '@stdlib/ndarray-base-numel' ); -var vind2bind = require( '@stdlib/ndarray-base-vind2bind' ); - - -// VARIABLES // - -var MODE = 'throw'; - - -// MAIN // - -/** -* Applies a binary callback to elements in n-dimensional input ndarrays and assigns results to elements in an equivalently shaped output ndarray. -* -* @private -* @param {Object} x - object containing input ndarray meta data -* @param {*} x.dtype - data type -* @param {Collection} x.data - data buffer -* @param {NonNegativeIntegerArray} x.shape - dimensions -* @param {IntegerArray} x.strides - stride lengths -* @param {NonNegativeInteger} x.offset - index offset -* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} x.accessors - data buffer accessors -* @param {Object} y - object containing input ndarray meta data -* @param {*} y.dtype - data type -* @param {Collection} y.data - data buffer -* @param {NonNegativeIntegerArray} y.shape - dimensions -* @param {IntegerArray} y.strides - stride lengths -* @param {NonNegativeInteger} y.offset - index offset -* @param {string} y.order - specifies whether `y` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} y.accessors - data buffer accessors -* @param {Object} z - object containing output ndarray meta data -* @param {*} z.dtype - data type -* @param {Collection} z.data - data buffer -* @param {NonNegativeIntegerArray} z.shape - dimensions -* @param {IntegerArray} z.strides - stride lengths -* @param {NonNegativeInteger} z.offset - index offset -* @param {string} z.order - specifies whether `z` is row-major (C-style) or column-major (Fortran-style) -* @param {Array} z.accessors - data buffer accessors -* @param {Callback} fcn - binary callback -* @returns {void} -* -* @example -* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' ); -* var accessors = require( '@stdlib/array-base-accessors' ); -* var copy = require( '@stdlib/array-base-copy' ); -* -* function fcn( x, y ) { -* return x + y; -* } -* -* // Create data buffers: -* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); -* var ybuf = toAccessorArray( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] ); -* var zbuf = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ); -* -* // Define the shape of the input and output arrays: -* var shape = [ 6, 2 ]; -* -* // Define the array strides: -* var sx = [ 2, 1 ]; -* var sy = [ 2, 1 ]; -* var sz = [ 2, 1 ]; -* -* // Define the index offsets: -* var ox = 0; -* var oy = 0; -* var oz = 0; -* -* // Create the input and output ndarray-like objects: -* var x = { -* 'dtype': 'generic', -* 'data': xbuf, -* 'shape': shape, -* 'strides': sx, -* 'offset': ox, -* 'order': 'row-major', -* 'accessors': accessors( xbuf ).accessors -* }; -* var y = { -* 'dtype': 'generic', -* 'data': ybuf, -* 'shape': shape, -* 'strides': sy, -* 'offset': oy, -* 'order': 'row-major', -* 'accessors': accessors( ybuf ).accessors -* }; -* var z = { -* 'dtype': 'generic', -* 'data': zbuf, -* 'shape': shape, -* 'strides': sz, -* 'offset': oz, -* 'order': 'row-major', -* 'accessors': accessors( zbuf ).accessors -* }; -* -* // Apply the binary function: -* binarynd( x, y, z, fcn ); -* -* console.log( copy( z.data ) ); -* // => [ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ] -*/ -function binarynd( x, y, z, fcn ) { - var xbuf; - var ybuf; - var zbuf; - var ordx; - var ordy; - var ordz; - var xget; - var yget; - var zset; - var len; - var sh; - var sx; - var sy; - var sz; - var ox; - var oy; - var oz; - var ix; - var iy; - var iz; - var i; - - sh = x.shape; - - // Compute the total number of elements over which to iterate: - len = numel( sh ); - - // Cache references to the input and output ndarray data buffers: - xbuf = x.data; - ybuf = y.data; - zbuf = z.data; - - // Cache references to the respective stride arrays: - sx = x.strides; - sy = y.strides; - sz = z.strides; - - // Cache the indices of the first indexed elements in the respective ndarrays: - ox = x.offset; - oy = y.offset; - oz = z.offset; - - // Cache the respective array orders: - ordx = x.order; - ordy = y.order; - ordz = z.order; - - // Cache accessors: - xget = x.accessors[ 0 ]; - yget = y.accessors[ 0 ]; - zset = z.accessors[ 1 ]; - - // Iterate over each element based on the linear **view** index, regardless as to how the data is stored in memory... - for ( i = 0; i < len; i++ ) { - ix = vind2bind( sh, sx, ox, ordx, i, MODE ); - iy = vind2bind( sh, sy, oy, ordy, i, MODE ); - iz = vind2bind( sh, sz, oz, ordz, i, MODE ); - zset( zbuf, iz, fcn( xget( xbuf, ix ), yget( ybuf, iy ) ) ); - } -} - - -// EXPORTS // - -module.exports = binarynd; diff --git a/package.json b/package.json index 5831826..ac66b68 100644 --- a/package.json +++ b/package.json @@ -3,31 +3,7 @@ "version": "0.1.1", "description": "Apply a binary callback to elements in input ndarrays and assign results to elements in an output ndarray.", "license": "Apache-2.0", - "author": { - "name": "The Stdlib Authors", - "url": "https://github.com/stdlib-js/stdlib/graphs/contributors" - }, - "contributors": [ - { - "name": "The Stdlib Authors", - "url": "https://github.com/stdlib-js/stdlib/graphs/contributors" - } - ], - "main": "./lib", - "directories": { - "benchmark": "./benchmark", - "doc": "./docs", - "example": "./examples", - "lib": "./lib", - "test": "./test" - }, - "types": "./docs/types", - "scripts": { - "test": "make test", - "test-cov": "make test-cov", - "examples": "make examples", - "benchmark": "make benchmark" - }, + "main": "./index.js", "homepage": "https://stdlib.io", "repository": { "type": "git", @@ -36,70 +12,6 @@ "bugs": { "url": "https://github.com/stdlib-js/stdlib/issues" }, - "dependencies": { - "@stdlib/array-base-any-is-entry-in": "^0.1.1", - "@stdlib/ndarray-base-binary-loop-interchange-order": "^0.2.4", - "@stdlib/ndarray-base-binary-tiling-block-size": "^0.2.3", - "@stdlib/ndarray-base-iteration-order": "^0.2.3", - "@stdlib/ndarray-base-minmax-view-buffer-index": "^0.2.3", - "@stdlib/ndarray-base-ndarraylike2object": "^0.2.3", - "@stdlib/ndarray-base-numel": "^0.2.3", - "@stdlib/ndarray-base-strides2order": "^0.2.3", - "@stdlib/ndarray-base-vind2bind": "^0.2.3", - "@stdlib/string-format": "^0.2.3", - "@stdlib/types": "^0.5.1", - "@stdlib/error-tools-fmtprodmsg": "^0.2.3" - }, - "devDependencies": { - "@stdlib/array-complex128": "^0.3.2", - "@stdlib/array-filled": "^0.3.1", - "@stdlib/array-filled-by": "^0.3.1", - "@stdlib/array-float64": "^0.2.3", - "@stdlib/array-one-to": "^0.2.3", - "@stdlib/array-ones": "^0.2.2", - "@stdlib/array-zeros": "^0.2.3", - "@stdlib/assert-is-same-complex128array": "^0.2.3", - "@stdlib/assert-is-same-float64array": "^0.2.3", - "@stdlib/blas-ext-base-dfill": "^0.3.1", - "@stdlib/blas-ext-base-zfill": "^0.1.1", - "@stdlib/complex-float64-base-add": "^0.2.1", - "@stdlib/complex-float64-ctor": "^0.1.2", - "@stdlib/math-base-assert-is-nan": "^0.2.3", - "@stdlib/math-base-special-floor": "^0.2.4", - "@stdlib/math-base-special-pow": "^0.3.1", - "@stdlib/math-base-special-sqrt": "^0.2.3", - "@stdlib/ndarray-base-assert-is-row-major-string": "^0.1.1", - "@stdlib/ndarray-base-nullary-tiling-block-size": "^0.2.3", - "@stdlib/ndarray-base-shape2strides": "^0.2.3", - "@stdlib/ndarray-base-strides2offset": "^0.2.3", - "@stdlib/ndarray-base-to-array": "^0.2.2", - "@stdlib/ndarray-ctor": "^0.3.1", - "@stdlib/ndarray-data-buffer": "^0.2.3", - "@stdlib/ndarray-from-scalar": "^0.3.1", - "@stdlib/ndarray-orders": "^0.2.3", - "@stdlib/number-float64-base-add": "^0.1.1", - "@stdlib/random-array-discrete-uniform": "^0.2.2", - "@stdlib/random-base-discrete-uniform": "^0.2.2", - "tape": "git+https://github.com/kgryte/tape.git#fix/globby", - "istanbul": "^0.4.1", - "tap-min": "git+https://github.com/Planeshifter/tap-min.git", - "@stdlib/bench-harness": "^0.2.3" - }, - "engines": { - "node": ">=0.10.0", - "npm": ">2.7.0" - }, - "os": [ - "aix", - "darwin", - "freebsd", - "linux", - "macos", - "openbsd", - "sunos", - "win32", - "windows" - ], "keywords": [ "stdlib", "base", diff --git a/stats_browser.html b/stats_browser.html new file mode 100644 index 0000000..b711c93 --- /dev/null +++ b/stats_browser.html @@ -0,0 +1,4842 @@ + + + + + + + + Rollup Visualizer + + + +
+ + + + + diff --git a/stats_node.html b/stats_node.html new file mode 100644 index 0000000..f51e3a4 --- /dev/null +++ b/stats_node.html @@ -0,0 +1,4842 @@ + + + + + + + + Rollup Visualizer + + + +
+ + + + + diff --git a/test/dist/test.js b/test/dist/test.js deleted file mode 100644 index a8a9c60..0000000 --- a/test/dist/test.js +++ /dev/null @@ -1,33 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2023 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MODULES // - -var tape = require( 'tape' ); -var main = require( './../../dist' ); - - -// TESTS // - -tape( 'main export is defined', function test( t ) { - t.ok( true, __filename ); - t.strictEqual( main !== void 0, true, 'main export is defined' ); - t.end(); -}); diff --git a/test/test.0d.js b/test/test.0d.js deleted file mode 100644 index 717de67..0000000 --- a/test/test.0d.js +++ /dev/null @@ -1,82 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MODULES // - -var tape = require( 'tape' ); -var isSameComplex128Array = require( '@stdlib/assert-is-same-complex128array' ); -var isSameFloat64Array = require( '@stdlib/assert-is-same-float64array' ); -var Complex128Array = require( '@stdlib/array-complex128' ); -var Float64Array = require( '@stdlib/array-float64' ); -var Complex128 = require( '@stdlib/complex-float64-ctor' ); -var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' ); -var add = require( '@stdlib/number-float64-base-add' ); -var zadd = require( '@stdlib/complex-float64-base-add' ); -var getData = require( '@stdlib/ndarray-data-buffer' ); -var binary = require( './../lib' ); - - -// TESTS // - -tape( 'main export is a function', function test( t ) { - t.ok( true, __filename ); - t.strictEqual( typeof binary, 'function', 'main export is a function'); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 0-dimensional ndarrays', function test( t ) { - var expected; - var x; - var y; - - x = scalar2ndarray( 5.0, { - 'dtype': 'float64' - }); - - y = scalar2ndarray( 0.0, { - 'dtype': 'float64' - }); - - binary( [ x, x, y ], add ); - - expected = new Float64Array( [ 10.0 ] ); - t.strictEqual( isSameFloat64Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 0-dimensional ndarrays (accessors)', function test( t ) { - var expected; - var x; - var y; - - x = scalar2ndarray( new Complex128( 5.0, 5.0 ), { - 'dtype': 'complex128' - }); - - y = scalar2ndarray( new Complex128( 0.0, 0.0 ), { - 'dtype': 'complex128' - }); - - binary( [ x, x, y ], zadd ); - - expected = new Complex128Array( [ 10.0, 10.0 ] ); - t.strictEqual( isSameComplex128Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); diff --git a/test/test.1d.js b/test/test.1d.js deleted file mode 100644 index c472bc1..0000000 --- a/test/test.1d.js +++ /dev/null @@ -1,106 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MODULES // - -var tape = require( 'tape' ); -var isSameComplex128Array = require( '@stdlib/assert-is-same-complex128array' ); -var isSameFloat64Array = require( '@stdlib/assert-is-same-float64array' ); -var Complex128Array = require( '@stdlib/array-complex128' ); -var Float64Array = require( '@stdlib/array-float64' ); -var zeros = require( '@stdlib/array-zeros' ); -var ndarray = require( '@stdlib/ndarray-ctor' ); -var add = require( '@stdlib/number-float64-base-add' ); -var zadd = require( '@stdlib/complex-float64-base-add' ); -var getData = require( '@stdlib/ndarray-data-buffer' ); -var binary = require( './../lib' ); - - -// TESTS // - -tape( 'main export is a function', function test( t ) { - t.ok( true, __filename ); - t.strictEqual( typeof binary, 'function', 'main export is a function'); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 1-dimensional ndarrays', function test( t ) { - var expected; - var x; - var y; - - x = ndarray( 'float64', new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] ), [ 4 ], [ 1 ], 0, 'row-major' ); - y = ndarray( 'float64', zeros( 4, 'float64' ), [ 4 ], [ 1 ], 0, 'row-major' ); - - binary( [ x, x, y ], add ); - - expected = new Float64Array([ - 2.0, - 4.0, - 6.0, - 8.0 - ]); - t.strictEqual( isSameFloat64Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 1-dimensional ndarrays (empty arrays)', function test( t ) { - var expected; - var x; - var y; - - x = ndarray( 'float64', new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] ), [ 0 ], [ 1 ], 0, 'row-major' ); - y = ndarray( 'float64', zeros( 4, 'float64' ), [ 0 ], [ 1 ], 0, 'row-major' ); - - binary( [ x, x, y ], add ); - - expected = new Float64Array([ - 0.0, - 0.0, - 0.0, - 0.0 - ]); - t.strictEqual( isSameFloat64Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 1-dimensional ndarrays (accessors)', function test( t ) { - var expected; - var x; - var y; - - x = ndarray( 'complex128', new Complex128Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] ), [ 4 ], [ 1 ], 0, 'row-major' ); - y = ndarray( 'complex128', zeros( 4, 'complex128' ), [ 4 ], [ 1 ], 0, 'row-major' ); - - binary( [ x, x, y ], zadd ); - - expected = new Complex128Array([ - 2.0, - 4.0, - 6.0, - 8.0, - 10.0, - 12.0, - 14.0, - 16.0 - ]); - t.strictEqual( isSameComplex128Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); diff --git a/test/test.2d.js b/test/test.2d.js deleted file mode 100644 index d2bd51b..0000000 --- a/test/test.2d.js +++ /dev/null @@ -1,1056 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MODULES // - -var tape = require( 'tape' ); -var isSameComplex128Array = require( '@stdlib/assert-is-same-complex128array' ); -var isSameFloat64Array = require( '@stdlib/assert-is-same-float64array' ); -var Complex128Array = require( '@stdlib/array-complex128' ); -var Float64Array = require( '@stdlib/array-float64' ); -var Complex128 = require( '@stdlib/complex-float64-ctor' ); -var zeros = require( '@stdlib/array-zeros' ); -var oneTo = require( '@stdlib/array-one-to' ); -var ones = require( '@stdlib/array-ones' ); -var ndarray = require( '@stdlib/ndarray-ctor' ); -var shape2strides = require( '@stdlib/ndarray-base-shape2strides' ); -var strides2offset = require( '@stdlib/ndarray-base-strides2offset' ); -var numel = require( '@stdlib/ndarray-base-numel' ); -var dfill = require( '@stdlib/blas-ext-base-dfill' ); -var zfill = require( '@stdlib/blas-ext-base-zfill' ); -var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' ); -var add = require( '@stdlib/number-float64-base-add' ); -var zadd = require( '@stdlib/complex-float64-base-add' ); -var getData = require( '@stdlib/ndarray-data-buffer' ); -var binary = require( './../lib' ); - - -// TESTS // - -tape( 'main export is a function', function test( t ) { - t.ok( true, __filename ); - t.strictEqual( typeof binary, 'function', 'main export is a function'); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (row-major, singleton dimensions)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'float64'; - ord = 'row-major'; - sh = [ 4, 1 ]; - st = shape2strides( sh, ord ); - o = strides2offset( sh, st ); - - x = ndarray( dt, oneTo( numel( sh ), dt ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); - - binary( [ x, x, y ], add ); - - expected = new Float64Array([ - 2.0, - 4.0, - 6.0, - 8.0 - ]); - t.strictEqual( isSameFloat64Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (row-major, singleton dimensions, accessors)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'complex128'; - ord = 'row-major'; - sh = [ 4, 1 ]; - st = shape2strides( sh, ord ); - o = strides2offset( sh, st ); - - x = ndarray( dt, new Complex128Array( oneTo( numel( sh ) * 2, 'float64' ) ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); - - binary( [ x, x, y ], zadd ); - - expected = new Complex128Array([ - 2.0, - 4.0, - 6.0, - 8.0, - 10.0, - 12.0, - 14.0, - 16.0 - ]); - t.strictEqual( isSameComplex128Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (row-major, empty)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'float64'; - ord = 'row-major'; - sh = [ 2, 0 ]; - st = shape2strides( sh, ord ); - o = strides2offset( sh, st ); - - x = ndarray( dt, oneTo( 2, dt ), sh, st, o, ord ); - y = ndarray( dt, zeros( 2, dt ), sh, st, o, ord ); - - binary( [ x, x, y ], add ); - - expected = new Float64Array([ - 0.0, - 0.0 - ]); - t.strictEqual( isSameFloat64Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (row-major, contiguous)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'float64'; - ord = 'row-major'; - sh = [ 2, 2 ]; - st = shape2strides( sh, ord ); - o = strides2offset( sh, st ); - - x = ndarray( dt, oneTo( numel( sh ), dt ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); - - binary( [ x, x, y ], add ); - - expected = new Float64Array([ - 2.0, - 4.0, - 6.0, - 8.0 - ]); - t.strictEqual( isSameFloat64Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (row-major, contiguous, negative strides)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'float64'; - ord = 'row-major'; - sh = [ 2, 2 ]; - st = [ -2, -1 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, oneTo( numel( sh ), dt ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); - - binary( [ x, x, y ], add ); - - expected = new Float64Array([ - 2.0, - 4.0, - 6.0, - 8.0 - ]); - t.strictEqual( isSameFloat64Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (row-major, non-contiguous, same sign strides)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'float64'; - ord = 'row-major'; - sh = [ 2, 2 ]; - st = [ 4, 1 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, oneTo( 8, dt ), sh, st, o, ord ); - y = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); - - binary( [ x, x, y ], add ); - - expected = new Float64Array([ - 2.0, - 4.0, - 0.0, - 0.0, - 10.0, - 12.0, - 0.0, - 0.0 - ]); - t.strictEqual( isSameFloat64Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (row-major, non-contiguous, mixed sign strides)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'float64'; - ord = 'row-major'; - sh = [ 2, 2 ]; - st = [ 4, -1 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, oneTo( 8, dt ), sh, st, o, ord ); - y = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); - - binary( [ x, x, y ], add ); - - expected = new Float64Array([ - 2.0, - 4.0, - 0.0, - 0.0, - 10.0, - 12.0, - 0.0, - 0.0 - ]); - t.strictEqual( isSameFloat64Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (row-major, non-contiguous, large arrays)', function test( t ) { - var expected; - var bsize; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'float64'; - ord = 'row-major'; - - bsize = blockSize( dt ); - sh = [ bsize*2, 2 ]; - st = [ -4, 2 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, ones( numel( sh ) * 2, dt ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh ) * 2, dt ), sh, st, o, ord ); - - binary( [ x, x, y ], add ); - - expected = new Float64Array( x.length*2 ); - dfill( x.length, 2.0, expected, st[ 1 ] ); - - t.strictEqual( isSameFloat64Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (row-major, non-contiguous, large arrays)', function test( t ) { - var expected; - var bsize; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'float64'; - ord = 'row-major'; - - bsize = blockSize( dt ); - sh = [ 2, bsize*2 ]; - st = [ bsize*4, -2 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); - - binary( [ x, x, y ], add ); - - expected = new Float64Array( x.length*2 ); - dfill( x.length, 2.0, expected, st[ 1 ] ); - - t.strictEqual( isSameFloat64Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (row-major, contiguous, accessors)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'complex128'; - ord = 'row-major'; - sh = [ 2, 2 ]; - st = shape2strides( sh, ord ); - o = strides2offset( sh, st ); - - x = ndarray( dt, new Complex128Array( oneTo( numel( sh ) * 2, 'float64' ) ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); - - binary( [ x, x, y ], zadd ); - - expected = new Complex128Array([ - 2.0, - 4.0, - 6.0, - 8.0, - 10.0, - 12.0, - 14.0, - 16.0 - ]); - t.strictEqual( isSameComplex128Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (row-major, contiguous, negative strides, accessors)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'complex128'; - ord = 'row-major'; - sh = [ 2, 2 ]; - st = [ -2, -1 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, new Complex128Array( oneTo( numel( sh ) * 2, 'float64' ) ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); - - binary( [ x, x, y ], zadd ); - - expected = new Complex128Array([ - 2.0, - 4.0, - 6.0, - 8.0, - 10.0, - 12.0, - 14.0, - 16.0 - ]); - t.strictEqual( isSameComplex128Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (row-major, non-contiguous, same sign strides, accessors)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'complex128'; - ord = 'row-major'; - sh = [ 2, 2 ]; - st = [ 4, 1 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, new Complex128Array( oneTo( numel( sh ) * 4, 'float64' ) ), sh, st, o, ord ); - y = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); - - binary( [ x, x, y ], zadd ); - - expected = new Complex128Array([ - 2.0, - 4.0, - 6.0, - 8.0, - 0.0, - 0.0, - 0.0, - 0.0, - 18.0, - 20.0, - 22.0, - 24.0, - 0.0, - 0.0, - 0.0, - 0.0 - ]); - t.strictEqual( isSameComplex128Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'complex128'; - ord = 'row-major'; - sh = [ 2, 2 ]; - st = [ 4, -1 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, new Complex128Array( oneTo( numel( sh ) * 4, 'float64' ) ), sh, st, o, ord ); - y = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); - - binary( [ x, x, y ], zadd ); - - expected = new Complex128Array([ - 2.0, - 4.0, - 6.0, - 8.0, - 0.0, - 0.0, - 0.0, - 0.0, - 18.0, - 20.0, - 22.0, - 24.0, - 0.0, - 0.0, - 0.0, - 0.0 - ]); - t.strictEqual( isSameComplex128Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (row-major, non-contiguous, large arrays, accessors)', function test( t ) { - var expected; - var bsize; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'complex128'; - ord = 'row-major'; - - bsize = blockSize( dt ); - sh = [ bsize*2, 2 ]; - st = [ -4, 2 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, new Complex128Array( ones( numel( sh ) * 4, 'float64' ) ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh ) * 2, dt ), sh, st, o, ord ); - - binary( [ x, x, y ], zadd ); - - expected = new Complex128Array( x.length*2 ); - zfill( x.length, new Complex128( 2.0, 2.0 ), expected, st[ 1 ] ); - - t.strictEqual( isSameComplex128Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (row-major, non-contiguous, large arrays, accessors)', function test( t ) { - var expected; - var bsize; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'complex128'; - ord = 'row-major'; - - bsize = blockSize( dt ); - sh = [ 2, bsize*2 ]; - st = [ bsize*4, -2 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, new Complex128Array( ones( numel( sh ) * 4, 'float64' ) ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh ) * 2, dt ), sh, st, o, ord ); - - binary( [ x, x, y ], zadd ); - - expected = new Complex128Array( x.length*2 ); - zfill( x.length, new Complex128( 2.0, 2.0 ), expected, st[ 1 ] ); - - t.strictEqual( isSameComplex128Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (column-major, singleton dimensions)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'float64'; - ord = 'column-major'; - sh = [ 1, 4 ]; - st = shape2strides( sh, ord ); - o = strides2offset( sh, st ); - - x = ndarray( dt, oneTo( numel( sh ), dt ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); - - binary( [ x, x, y ], add ); - - expected = new Float64Array([ - 2.0, - 4.0, - 6.0, - 8.0 - ]); - t.strictEqual( isSameFloat64Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (column-major, singleton dimensions, accessors)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'complex128'; - ord = 'column-major'; - sh = [ 4, 1 ]; - st = shape2strides( sh, ord ); - o = strides2offset( sh, st ); - - x = ndarray( dt, new Complex128Array( oneTo( numel( sh ) * 2, 'float64' ) ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); - - binary( [ x, x, y ], zadd ); - - expected = new Complex128Array([ - 2.0, - 4.0, - 6.0, - 8.0, - 10.0, - 12.0, - 14.0, - 16.0 - ]); - t.strictEqual( isSameComplex128Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (column-major, empty)', function test( t ) { - var expected; - var x; - var y; - - x = ndarray( 'float64', oneTo( 4, 'float64' ), [ 0, 0 ], [ 1, 1 ], 0, 'column-major' ); - y = ndarray( 'float64', zeros( 4, 'float64' ), [ 0, 0 ], [ 1, 1 ], 0, 'column-major' ); - - binary( [ x, x, y ], add ); - - expected = new Float64Array([ - 0.0, - 0.0, - 0.0, - 0.0 - ]); - t.strictEqual( isSameFloat64Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (column-major, contiguous)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'float64'; - ord = 'column-major'; - sh = [ 2, 2 ]; - st = shape2strides( sh, ord ); - o = strides2offset( sh, st ); - - x = ndarray( dt, oneTo( numel( sh ), dt ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); - - binary( [ x, x, y ], add ); - - expected = new Float64Array([ - 2.0, - 4.0, - 6.0, - 8.0 - ]); - t.strictEqual( isSameFloat64Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (column-major, contiguous, negative strides)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'float64'; - ord = 'column-major'; - sh = [ 2, 2 ]; - st = [ -1, -2 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, oneTo( numel( sh ), dt ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); - - binary( [ x, x, y ], add ); - - expected = new Float64Array([ - 2.0, - 4.0, - 6.0, - 8.0 - ]); - t.strictEqual( isSameFloat64Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (column-major, non-contiguous, same sign strides)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'float64'; - ord = 'column-major'; - sh = [ 2, 2 ]; - st = [ 1, 4 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, oneTo( 8, dt ), sh, st, o, ord ); - y = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); - - binary( [ x, x, y ], add ); - - expected = new Float64Array([ - 2.0, - 4.0, - 0.0, - 0.0, - 10.0, - 12.0, - 0.0, - 0.0 - ]); - t.strictEqual( isSameFloat64Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (column-major, non-contiguous, mixed sign strides)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'float64'; - ord = 'column-major'; - sh = [ 2, 2 ]; - st = [ 1, -4 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, oneTo( 8, dt ), sh, st, o, ord ); - y = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); - - binary( [ x, x, y ], add ); - - expected = new Float64Array([ - 2.0, - 4.0, - 0.0, - 0.0, - 10.0, - 12.0, - 0.0, - 0.0 - ]); - t.strictEqual( isSameFloat64Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (column-major, non-contiguous, large arrays)', function test( t ) { - var expected; - var bsize; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'float64'; - ord = 'column-major'; - - bsize = blockSize( dt ); - sh = [ bsize*2, 2 ]; - st = [ 2, -bsize*4 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); - - binary( [ x, x, y ], add ); - - expected = new Float64Array( x.length*2 ); - dfill( x.length, 2.0, expected, st[ 0 ] ); - - t.strictEqual( isSameFloat64Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (column-major, non-contiguous, large arrays)', function test( t ) { - var expected; - var bsize; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'float64'; - ord = 'column-major'; - - bsize = blockSize( dt ); - sh = [ 2, bsize*2 ]; - st = [ -2, 4 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); - - binary( [ x, x, y ], add ); - - expected = new Float64Array( x.length*2 ); - dfill( x.length, 2.0, expected, st[ 0 ] ); - - t.strictEqual( isSameFloat64Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (column-major, contiguous, accessors)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'complex128'; - ord = 'column-major'; - sh = [ 2, 2 ]; - st = shape2strides( sh, ord ); - o = strides2offset( sh, st ); - - x = ndarray( dt, new Complex128Array( oneTo( numel( sh ) * 2, 'float64' ) ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); - - binary( [ x, x, y ], zadd ); - - expected = new Complex128Array([ - 2.0, - 4.0, - 6.0, - 8.0, - 10.0, - 12.0, - 14.0, - 16.0 - ]); - t.strictEqual( isSameComplex128Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (column-major, contiguous, negative strides, accessors)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'complex128'; - ord = 'column-major'; - sh = [ 2, 2 ]; - st = [ -1, -2 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, new Complex128Array( oneTo( numel( sh ) * 2, 'float64' ) ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); - - binary( [ x, x, y ], zadd ); - - expected = new Complex128Array([ - 2.0, - 4.0, - 6.0, - 8.0, - 10.0, - 12.0, - 14.0, - 16.0 - ]); - t.strictEqual( isSameComplex128Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (column-major, non-contiguous, same sign strides, accessors)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'complex128'; - ord = 'column-major'; - sh = [ 2, 2 ]; - st = [ 1, 4 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, new Complex128Array( oneTo( numel( sh ) * 4, 'float64' ) ), sh, st, o, ord ); - y = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); - - binary( [ x, x, y ], zadd ); - - expected = new Complex128Array([ - 2.0, - 4.0, - 6.0, - 8.0, - 0.0, - 0.0, - 0.0, - 0.0, - 18.0, - 20.0, - 22.0, - 24.0, - 0.0, - 0.0, - 0.0, - 0.0 - ]); - t.strictEqual( isSameComplex128Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { - var expected; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'complex128'; - ord = 'column-major'; - sh = [ 2, 2 ]; - st = [ 1, -4 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, new Complex128Array( oneTo( numel( sh ) * 4, 'float64' ) ), sh, st, o, ord ); - y = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); - - binary( [ x, x, y ], zadd ); - - expected = new Complex128Array([ - 2.0, - 4.0, - 6.0, - 8.0, - 0.0, - 0.0, - 0.0, - 0.0, - 18.0, - 20.0, - 22.0, - 24.0, - 0.0, - 0.0, - 0.0, - 0.0 - ]); - t.strictEqual( isSameComplex128Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (column-major, non-contiguous, large arrays, accessors)', function test( t ) { - var expected; - var bsize; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'complex128'; - ord = 'column-major'; - - bsize = blockSize( dt ); - sh = [ bsize*2, 2 ]; - st = [ 2, -bsize*4 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, new Complex128Array( ones( numel( sh ) * 4, 'float64' ) ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh ) * 2, dt ), sh, st, o, ord ); - - binary( [ x, x, y ], zadd ); - - expected = new Complex128Array( x.length*2 ); - zfill( x.length, new Complex128( 2.0, 2.0 ), expected, st[ 0 ] ); - - t.strictEqual( isSameComplex128Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); - -tape( 'the function applies a binary callback to indexed elements of two 2-dimensional ndarrays (column-major, non-contiguous, large arrays, accessors)', function test( t ) { - var expected; - var bsize; - var ord; - var sh; - var st; - var dt; - var o; - var x; - var y; - - dt = 'complex128'; - ord = 'column-major'; - - bsize = blockSize( dt ); - sh = [ 2, bsize*2 ]; - st = [ -2, 4 ]; - o = strides2offset( sh, st ); - - x = ndarray( dt, new Complex128Array( ones( numel( sh ) * 4, 'float64' ) ), sh, st, o, ord ); - y = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); - - binary( [ x, x, y ], zadd ); - - expected = new Complex128Array( x.length*2 ); - zfill( x.length, new Complex128( 2.0, 2.0 ), expected, st[ 0 ] ); - - t.strictEqual( isSameComplex128Array( getData( y ), expected ), true, 'returns expected value' ); - t.end(); -}); diff --git a/test/test.js b/test/test.js deleted file mode 100644 index 6dcf199..0000000 --- a/test/test.js +++ /dev/null @@ -1,151 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -/* eslint-disable max-len */ - -'use strict'; - -// MODULES // - -var tape = require( 'tape' ); -var ndarray = require( '@stdlib/ndarray-ctor' ); -var zeros = require( '@stdlib/array-zeros' ); -var ones = require( '@stdlib/array-ones' ); -var shape2strides = require( '@stdlib/ndarray-base-shape2strides' ); -var strides2offset = require( '@stdlib/ndarray-base-strides2offset' ); -var numel = require( '@stdlib/ndarray-base-numel' ); -var binary = require( './../lib' ); - - -// TESTS // - -tape( 'main export is a function', function test( t ) { - t.ok( true, __filename ); - t.strictEqual( typeof binary, 'function', 'main export is a function' ); - t.end(); -}); - -tape( 'the function throws an error if provided input and output ndarrays which do not have the same number of dimensions', function test( t ) { - var shapes; - var i; - - shapes = [ - [ [ 4, 2, 1 ], [ 4, 2, 1 ], [ 4, 2 ] ], - [ [ 2, 2 ], [ 2, 2, 2 ], [ 2, 2, 2 ] ], - [ [ 1, 1, 1, 1 ], [ 1, 1, 1 ], [ 1, 1 ] ], - [ [ 2, 2, 1, 2 ], [ 2, 2, 1 ], [ 2, 1, 2 ] ], - [ [ 1, 1, 4, 2, 2, 2 ], [ 0 ], [ 10, 2 ] ], - [ [ 1, 1, 1, 1 ], [ 1, 1, 1 ], [ 1, 1, 1, 1, 1 ] ] - ]; - - for ( i = 0; i < shapes.length; i++ ) { - t.throws( badValue( shapes[i][0], shapes[i][1], shapes[i][2] ), Error, 'throws an error for index ' + i ); - } - t.end(); - - function add( a, b ) { - return a + b; - } - - function badValue( sh1, sh2, sh3 ) { - return function badValue() { - var dtype; - var ord; - var st1; - var st2; - var st3; - var o1; - var o2; - var o3; - var x; - var y; - var z; - - ord = 'row-major'; - dtype = 'float64'; - - st1 = shape2strides( sh1, ord ); - st2 = shape2strides( sh2, ord ); - st3 = shape2strides( sh3, ord ); - o1 = strides2offset( sh1, st1 ); - o2 = strides2offset( sh2, st2 ); - o3 = strides2offset( sh3, st3 ); - - x = ndarray( dtype, ones( numel( sh1 ), dtype ), sh1, st1, o1, ord ); - y = ndarray( dtype, ones( numel( sh2 ), dtype ), sh2, st2, o2, ord ); - z = ndarray( dtype, zeros( numel( sh3 ), dtype ), sh3, st3, o3, ord ); - - binary( [ x, y, z ], add ); - }; - } -}); - -tape( 'the function throws an error if provided input and output ndarrays which do not have the same shape', function test( t ) { - var shapes; - var i; - - shapes = [ - [ [ 4, 2, 1 ], [ 4, 2, 2 ], [ 4, 2, 1 ] ], - [ [ 3, 3 ], [ 2, 2 ], [ 3, 3 ] ], - [ [ 5, 5, 5 ], [ 5, 5, 4 ], [ 5, 5, 4 ] ], - [ [ 1, 1, 1 ], [ 2, 2, 2 ], [ 1, 1, 2 ] ], - [ [ 1, 4 ], [ 3, 8 ], [ 4, 4 ] ], - [ [ 10, 2, 1 ], [ 1, 2, 10 ], [ 2, 1, 10 ] ] - ]; - - for ( i = 0; i < shapes.length; i++ ) { - t.throws( badValue( shapes[i][0], shapes[i][1], shapes[i][2] ), Error, 'throws an error for index ' + i ); - } - t.end(); - - function add( a, b ) { - return a + b; - } - - function badValue( sh1, sh2, sh3 ) { - return function badValue() { - var dtype; - var ord; - var st1; - var st2; - var st3; - var o1; - var o2; - var o3; - var x; - var y; - var z; - - ord = 'row-major'; - dtype = 'float64'; - - st1 = shape2strides( sh1, ord ); - st2 = shape2strides( sh2, ord ); - st3 = shape2strides( sh3, ord ); - o1 = strides2offset( sh1, st1 ); - o2 = strides2offset( sh2, st2 ); - o3 = strides2offset( sh3, st3 ); - - x = ndarray( dtype, ones( numel( sh1 ), dtype ), sh1, st1, o1, ord ); - y = ndarray( dtype, ones( numel( sh2 ), dtype ), sh2, st2, o2, ord ); - z = ndarray( dtype, zeros( numel( sh3 ), dtype ), sh3, st3, o3, ord ); - - binary( [ x, y, z ], add ); - }; - } -});